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
225
226
|
// This may look like C code, but it is really -*- C++ -*-
/*
Copyright (C) 1988 Free Software Foundation
written by Doug Lea (dl@rocky.oswego.edu)
This file is part of GNU CC.
GNU CC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY. No author or distributor
accepts responsibility to anyone for the consequences of using it
or for whether it serves any particular purpose or works at all,
unless he says so in writing. Refer to the GNU CC General Public
License for full details.
Everyone is granted permission to copy, modify and redistribute
GNU CC, but only under the conditions described in the
GNU CC General Public License. A copy of this license is
supposed to have been given to you along with GNU CC so you
can know your rights and responsibilities. It should be in a
file named COPYING. Among other things, the copyright notice
and this notice must be preserved on all copies.
*/
#ifdef __GNUG__
#pragma implementation
#endif
#include "<T>.OXPBag.h"
Pix <T>OXPBag::seek(<T&> item, Pix i)
{
if (i == 0)
{
int l = p.low();
int h = p.high();
while (l <= h)
{
int mid = (l + h) / 2;
int cmp = <T>CMP(item, p[mid]);
if (cmp == 0)
{
while (mid > p.low() && <T>EQ(item, p[mid - 1])) --mid;
return p.index_to_Pix(mid);
}
else if (cmp < 0)
h = mid - 1;
else
l = mid + 1;
}
return 0;
}
int cmp = <T>CMP(item, p(i));
if (cmp == 0)
{
next(i);
return (<T>EQ(item, p(i)))? i : 0;
}
else if (cmp < 0)
{
int ind = p.Pix_to_index(i);
int l = ind;
int h = p.high();
while (l <= h)
{
int mid = (l + h) / 2;
cmp = <T>CMP(item, p[mid]);
if (cmp == 0)
{
while (mid > ind && <T>EQ(item, p[mid - 1])) --mid;
return p.index_to_Pix(mid);
}
else if (cmp < 0)
h = mid - 1;
else
l = mid + 1;
}
return 0;
}
else
return 0;
}
int <T>OXPBag::nof(<T&> item)
{
int l = p.low();
int h = p.high();
while (l <= h)
{
int mid = (l + h) / 2;
int cmp = <T>CMP(item, p[mid]);
if (cmp == 0)
{
l = h = mid;
while (l > p.low() && <T>EQ(item, p[l - 1])) --l;
while (h < p.high() && <T>EQ(item, p[h + 1])) ++h;
return h - l + 1;
}
else if (cmp < 0)
h = mid - 1;
else
l = mid + 1;
}
return 0;
}
Pix <T>OXPBag::add(<T&> item)
{
if (count == 0)
{
++count;
return p.index_to_Pix(p.add_high(item));
}
int l = p.low();
int h = p.high();
while (l <= h)
{
int mid = (l + h) / 2;
int cmp = <T>CMP(item, p[mid]);
if (cmp == 0)
{
l = mid;
break;
}
else if (cmp < 0)
h = mid - 1;
else
l = mid + 1;
}
// add on whichever side is shortest
++count;
if (l == p.fence())
return p.index_to_Pix(p.add_high(item));
else if (l == p.low())
return p.index_to_Pix(p.add_low(item));
else
{
if (p.high() - l < l - p.low())
{
h = p.add_high(p.high_element());
for (int i = h - 1; i > l; --i) p[i] = p[i-1];
}
else
{
--l;
h = p.add_low(p.low_element());
for (int i = h + 1; i < l; ++i) p[i] = p[i+1];
}
p[l] = item;
return p.index_to_Pix(l);
}
}
void <T>OXPBag::del(<T&> item)
{
int l = p.low();
int h = p.high();
while (l <= h)
{
int mid = (l + h) / 2;
int cmp = <T>CMP(item, p[mid]);
if (cmp == 0)
{
--count;
if (p.high() - mid < mid - p.low())
{
for (int i = mid; i < p.high(); ++i) p[i] = p[i+1];
p.del_high();
}
else
{
for (int i = mid; i > p.low(); --i) p[i] = p[i-1];
p.del_low();
}
return;
}
else if (cmp < 0)
h = mid - 1;
else
l = mid + 1;
}
}
void <T>OXPBag::remove(<T&> item)
{
int l = p.low();
int h = p.high();
while (l <= h)
{
int mid = (l + h) / 2;
int cmp = <T>CMP(item, p[mid]);
if (cmp == 0)
{
l = h = mid;
while (l > p.low() && <T>EQ(item, p[l - 1])) --l;
while (h < p.high() && <T>EQ(item, p[h + 1])) ++h;
int n = h - l + 1;
count -= n;
if (p.high() - h < l - p.low())
{
h = p.high() - n;
for (int i = l; i <= h; ++i) p[i] = p[i+n];
while (n-- > 0) p.del_high();
}
else
{
l = p.low() + n;
for (int i = h; i >= l; --i) p[i] = p[i-n];
while (n-- > 0) p.del_low();
}
return;
}
else if (cmp < 0)
h = mid - 1;
else
l = mid + 1;
}
}
int <T>OXPBag::OK()
{
int v = p.OK();
v &= count == p.length();
for (int i = p.low(); i < p.high(); ++i) v &= <T>CMP(p[i], p[i+1]) <= 0;
if (!v) error("invariant failure");
return v;
}
|
