-
Notifications
You must be signed in to change notification settings - Fork 2
/
boolean_queue.cpp
226 lines (180 loc) · 4.31 KB
/
boolean_queue.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
#include <stdlib.h>
#include <stdio.h>
#include "header.h"
#include "boolean_queue.h"
using namespace std;
and_boolean_queue::and_boolean_queue(){
len = 0;
heap_queue = NULL;
top = QUE_END_MARK;
}
/* constructor of and_boolean_queue */
/* Thsi function build a boolean_queue object */
/* from a list of boolean_queue objects */
and_boolean_queue::and_boolean_queue(int l, boolean_queue *bq_list, int t){
len = l;
heap_queue = bq_pq_initialize(t);
for (int i = 0; i < len; i++){
bq_pq_insert(&bq_list[i], heap_queue);
}
top = 0;
}
/* constructor of and_boolean_queue */
/* Thsi function build a boolean_queue object */
/* from a list of boolean_queue objects */
void and_boolean_queue::initialize(int l, boolean_queue *bq_list, int t){
len = l;
heap_queue = bq_pq_initialize(t);
for (int i = 0; i < len; i++){
bq_pq_insert(&bq_list[i], heap_queue);
}
top = 0;
}
/* add a boolean_queue into this queue */
void and_boolean_queue::add(boolean_queue *bq){
bq_pq_insert(bq, heap_queue);
len ++;
}
/* pop out the top one and find the next intersection */
/* of all the queue lists. if one of the queus runs over */
/* the whole list will be destroied cause of no more */
/* answer. */
void and_boolean_queue::pop(){
int count; /* count the exist time. */
unsigned int last; /* last one */
boolean_queue *bq;
if(top == QUE_END_MARK)
return;
if(bq_pq_is_empty(heap_queue)){
top = QUE_END_MARK;
return;
}
last = bq_pq_find_min(heap_queue)->top;
count = 1;
while(heap_queue->size > 0){
bq = bq_pq_delete_min(heap_queue);
bq->pop();
if(bq->top == QUE_END_MARK){
bq->destroy();
while (heap_queue->size > 0){
bq = bq_pq_delete_min(heap_queue);
if ( bq->top == last )
count++;
bq->destroy();
}
if (count >=len){
top = last;
}else{
top = QUE_END_MARK;
}
return;
}
bq_pq_insert(bq, heap_queue);
bq = bq_pq_find_min(heap_queue);
if(bq->top == last){
count++;
}else{
if(count >= len){
top = last;
return;
}
count = 1;
last=bq->top;
}
}
top = QUE_END_MARK;
return;
}
void and_boolean_queue::destroy(){
boolean_queue *bq;
if(heap_queue!=NULL){
while(!bq_pq_is_empty(heap_queue)){
bq = bq_pq_delete_min(heap_queue);
bq->destroy();
}
bq_pq_destroy(heap_queue);
}
heap_queue = NULL;
}
/* constructor of and_boolean_queue */
/* Thsi function build a boolean_queue object */
/* from a list of boolean_queue objects */
or_boolean_queue::or_boolean_queue(int l, boolean_queue *bq_list, int t){
len = l;
top = 0;
heap_queue = bq_pq_initialize(t);
for (int i = 0; i < len; i++){
bq_pq_insert(&bq_list[i], heap_queue);
}
}
/* add a boolean_queue into this queue */
void or_boolean_queue::add(boolean_queue *bq){
bq_pq_insert(bq, heap_queue);
len ++;
}
/* pop out the top one and find the next intersection */
/* of all the queue lists. if one of the queus runs over */
/* the whole list will be destroied cause of no more */
/* answer. */
void or_boolean_queue::pop(){
boolean_queue *bq;
if(top == QUE_END_MARK)
return;
if(!bq_pq_is_empty(heap_queue)){
bq = bq_pq_delete_min(heap_queue);
top = bq->top;
bq->pop();
if(bq->top == QUE_END_MARK){
bq->destroy();
return;
}else{
bq_pq_insert(bq, heap_queue);
return;
}
}
top = QUE_END_MARK;
return;
}
void or_boolean_queue::destroy(){
boolean_queue *bq;
while(!bq_pq_is_empty(heap_queue)){
bq = bq_pq_delete_min(heap_queue);
bq->destroy();
}
bq_pq_destroy(heap_queue);
}
single_boolean_queue::single_boolean_queue()
{
ivlist = NULL;
len = 0;
pos = 0;
}
void single_boolean_queue::initialize(int l, unsigned int *list)
{
len = l;
pos = 0;
top = 0;
ivlist = list;
pop();
}
single_boolean_queue::single_boolean_queue(int l, unsigned int *list)
{
len = l;
pos = 0;
top = 0;
ivlist = list;
pop();
}
void single_boolean_queue::pop(){
if (pos < len){
top = ivlist[pos++];
}else{
top = QUE_END_MARK;
}
}
void single_boolean_queue::destroy(){
ivlist = NULL;
len = 0;
pos = 0;
top = QUE_END_MARK;
}