blob: 54090091ec473cec014b4b63e3d1ac3ff19f0a31 (
plain) (
blame)
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
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
|
import scala.collection.mutable.PriorityQueue
// populate a priority queue a few different ways and make sure they all seem equal
object Test {
def main(args: Array[String]) {
testInsertionsAndEqualities
testIntensiveEnqueueDequeue
testIndexing
testTails
testInits
testFilters
testDrops
testUpdates
testEquality
testMisc
}
def testInsertionsAndEqualities {
import scala.util.Random.nextInt
val pq1 = new PriorityQueue[String]
val pq2 = new PriorityQueue[String]
val pq3 = new PriorityQueue[String]
val pq4 = new PriorityQueue[String]
val strings = (1 to 20).toList map (i => List.fill((Math.abs(nextInt % 20)) + 1)("x").mkString)
pq1 ++= strings
pq2 ++= strings.reverse
for (s <- strings) pq3 += s
for (s <- strings.reverse) pq4 += s
val pqs = List(pq1, pq2, pq3, pq4, pq1.clone, pq2.clone)
for (queue1 <- pqs ; queue2 <- pqs) {
assert(queue1 == queue2)
assert(queue1.max == queue2.max)
}
assertPriority(pq1)
}
def testIndexing {
val pq = new PriorityQueue[Char]
"The quick brown fox jumps over the lazy dog".foreach(pq += _)
// val iter = pq.iterator
// while (iter.hasNext) println("`" + iter.next + "`")
assert(pq(0) == 'z')
assert(pq(1) == 'y')
assert(pq(2) == 'x')
assert(pq(3) == 'w')
assert(pq(4) == 'v')
assert(pq(5) == 'u')
assert(pq(7) == 't')
assert(pq(8) == 's')
assert(pq(9) == 'r')
assert(pq(10) == 'r')
pq.clear
"abcdefghijklmnopqrstuvwxyz".foreach(pq += _)
for (i <- 0 until 26) assert(pq(i) == ('z' - i))
val intpq = new PriorityQueue[Int]
val intlst = new collection.mutable.ArrayBuffer ++ (0 until 100)
val random = new util.Random(101)
while (intlst.nonEmpty) {
val idx = random.nextInt(intlst.size)
intpq += intlst(idx)
intlst.remove(idx)
}
for (i <- 0 until 100) assert(intpq(i) == (99 - i))
}
def testTails {
val pq = new PriorityQueue[Int]
for (i <- 0 until 10) pq += i * 4321 % 200
assert(pq.size == 10)
assert(pq.nonEmpty)
val tailpq = pq.tail
// pq.printstate
// tailpq.printstate
assert(tailpq.size == 9)
assert(tailpq.nonEmpty)
assertPriorityDestructive(tailpq)
}
def assertPriorityDestructive[A](pq: PriorityQueue[A])(implicit ord: Ordering[A]) {
import ord._
var prev: A = null.asInstanceOf[A]
while (pq.nonEmpty) {
val curr = pq.dequeue
if (prev != null) assert(curr <= prev)
prev = curr
}
}
def assertPriority[A](pq: PriorityQueue[A])(implicit ord: Ordering[A]) {
import ord._
var prev: A = null.asInstanceOf[A]
val iter = pq.iterator
while (iter.hasNext) {
val curr = iter.next
if (prev != null) assert(curr <= prev)
prev = curr
}
}
def testInits {
val pq = new PriorityQueue[Long]
for (i <- 0 until 20) pq += (i + 313) * 111 % 300
assert(pq.size == 20)
val initpq = pq.init
assert(initpq.size == 19)
assertPriorityDestructive(initpq)
}
def testFilters {
val pq = new PriorityQueue[String]
for (i <- 0 until 100) pq += "Some " + (i * 312 % 200)
val filpq = pq.filter(_.indexOf('0') != -1)
assertPriorityDestructive(filpq)
}
def testIntensiveEnqueueDequeue {
val pq = new PriorityQueue[Int]
testIntensive(1000, pq)
pq.clear
testIntensive(200, pq)
}
def testIntensive(sz: Int, pq: PriorityQueue[Int]) {
val lst = new collection.mutable.ArrayBuffer[Int] ++ (0 until sz)
val rand = new util.Random(7)
while (lst.nonEmpty) {
val idx = rand.nextInt(lst.size)
pq.enqueue(lst(idx))
lst.remove(idx)
if (rand.nextDouble < 0.25 && pq.nonEmpty) pq.dequeue
assertPriority(pq)
}
}
def testDrops {
val pq = new PriorityQueue[Int]
pq ++= (0 until 100)
val droppq = pq.drop(50)
assertPriority(droppq)
pq.clear
pq ++= droppq
assertPriorityDestructive(droppq)
assertPriority(pq)
assertPriorityDestructive(pq)
}
def testUpdates {
val pq = new PriorityQueue[Int]
pq ++= (0 until 36)
assertPriority(pq)
pq(0) = 100
assert(pq(0) == 100)
assert(pq.dequeue == 100)
assertPriority(pq)
pq.clear
pq ++= (1 to 100)
pq(5) = 200
assert(pq(0) == 200)
assert(pq(1) == 100)
assert(pq(2) == 99)
assert(pq(3) == 98)
assert(pq(4) == 97)
assert(pq(5) == 96)
assert(pq(6) == 94)
assert(pq(7) == 93)
assert(pq(98) == 2)
assert(pq(99) == 1)
assertPriority(pq)
pq(99) = 450
assert(pq(0) == 450)
assert(pq(1) == 200)
assert(pq(99) == 2)
assertPriority(pq)
pq(1) = 0
assert(pq(1) == 100)
assert(pq(99) == 0)
assertPriority(pq)
assertPriorityDestructive(pq)
}
def testEquality {
val pq1 = new PriorityQueue[Int]
val pq2 = new PriorityQueue[Int]
pq1 ++= (0 until 50)
var i = 49
while (i >= 0) {
pq2 += i
i -= 1
}
assert(pq1 == pq2)
assertPriority(pq2)
pq1 += 100
assert(pq1 != pq2)
pq2 += 100
assert(pq1 == pq2)
pq2 += 200
assert(pq1 != pq2)
pq1 += 200
assert(pq1 == pq2)
assertPriorityDestructive(pq1)
assertPriorityDestructive(pq2)
}
def testMisc {
val pq = new PriorityQueue[Int]
pq ++= (0 until 100)
assert(pq.size == 100)
val (p1, p2) = pq.partition(_ < 50)
assertPriorityDestructive(p1)
assertPriorityDestructive(p2)
val spq = pq.slice(25, 75)
assertPriorityDestructive(spq)
pq.clear
pq ++= (0 until 10)
pq += 5
assert(pq.size == 11)
val ind = pq.lastIndexWhere(_ == 5)
assert(ind == 5)
assertPriorityDestructive(pq)
pq.clear
pq ++= (0 until 10)
assert(pq.lastIndexWhere(_ == 9) == 0)
assert(pq.lastIndexOf(8) == 1)
assert(pq.lastIndexOf(7) == 2)
pq += 5
pq += 9
assert(pq.lastIndexOf(9) == 1)
assert(pq.lastIndexWhere(_ % 2 == 1) == 10)
assert(pq.lastIndexOf(5) == 6)
val lst = pq.reverseIterator.toList
for (i <- 0 until 5) assert(lst(i) == i)
assert(lst(5) == 5)
assert(lst(6) == 5)
assert(lst(7) == 6)
assert(lst(8) == 7)
assert(lst(9) == 8)
assert(lst(10) == 9)
assert(lst(11) == 9)
}
}
|