forked from pharo-containers/Containers-Queue
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCTQueueTest.class.st
More file actions
464 lines (362 loc) · 10.5 KB
/
CTQueueTest.class.st
File metadata and controls
464 lines (362 loc) · 10.5 KB
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
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
"
I provide a comprehensive suite of unit tests for the CTQueue class.
My tests cover basic operations, FIFO behavior, error handling, state management,
capacity growth, constructors, bulk operations, and various edge cases to ensure
the implementation is robust, correct, and performant.
"
Class {
#name : 'CTQueueTest',
#superclass : 'TestCase',
#instVars : [
'queue'
],
#category : 'Containers-Queue-Tests',
#package : 'Containers-Queue-Tests'
}
{ #category : 'running' }
CTQueueTest >> setUp [
super setUp.
queue := CTQueue new: 5
]
{ #category : 'tests' }
CTQueueTest >> testAlternatingEnqueueDequeue [
queue enqueue: 'a'.
self assert: queue dequeue equals: 'a'.
queue enqueue: 'b'; enqueue: 'c'.
self assert: queue dequeue equals: 'b'.
queue enqueue: 'd'.
self assert: queue front equals: 'c'.
self assert: queue size equals: 2
]
{ #category : 'tests' }
CTQueueTest >> testAsArray [
| result |
queue enqueue: 'first'; enqueue: 'second'; enqueue: 'third'.
result := queue asArray.
self assert: result equals: #('first' 'second' 'third').
"Elements from front to rear"
]
{ #category : 'tests' }
CTQueueTest >> testAsOrderedCollection [
| result |
queue enqueue: 'a'; enqueue: 'b'; enqueue: 'c'.
result := queue asOrderedCollection.
self assert: result class equals: OrderedCollection.
self assert: result asArray equals: #('a' 'b' 'c')
]
{ #category : 'tests' }
CTQueueTest >> testCapacityGrowth [
| originalCapacity |
originalCapacity := queue capacity.
1 to: originalCapacity do: [ :i | queue enqueue: i ].
self assert: queue capacity equals: originalCapacity.
queue enqueue: 'overflow'.
self assert: queue capacity equals: originalCapacity * 2.
self assert: queue size equals: originalCapacity + 1
]
{ #category : 'tests' }
CTQueueTest >> testCircularArrayWrapping [
| testQueue |
testQueue := CTQueue new: 3.
"Fill the queue"
testQueue enqueue: 1; enqueue: 2; enqueue: 3.
"Remove front elements"
testQueue dequeue; dequeue.
"Add more elements to test wraparound"
testQueue enqueue: 4; enqueue: 5.
self assert: testQueue front equals: 3.
self assert: testQueue size equals: 3
]
{ #category : 'tests' }
CTQueueTest >> testCopyCreatesNewObject [
| copy |
queue
enqueue: 'a';
enqueue: 'b'.
copy := queue copy.
self deny: queue identicalTo: copy
]
{ #category : 'tests' }
CTQueueTest >> testCopyHasSameContents [
| copy |
queue
enqueue: 'first';
enqueue: 'second';
enqueue: 'third'.
copy := queue copy.
self assert: copy size equals: queue size.
self assert: copy front equals: queue front
]
{ #category : 'tests' }
CTQueueTest >> testCopyIsIndependent [
| copy |
queue enqueue: 'a'; enqueue: 'b'.
copy := queue copy.
"Now, modify the original queue"
queue dequeue.
queue enqueue: 'c'.
self assert: copy size equals: 2.
self assert: copy front equals: 'a'.
self deny: copy front equals: queue front
]
{ #category : 'tests' }
CTQueueTest >> testDefaultQueueCreation [
| defaultQueue |
defaultQueue := CTQueue new.
self assert: defaultQueue capacity equals: 10.
self assert: defaultQueue isEmpty.
self assert: defaultQueue size equals: 0
]
{ #category : 'tests' }
CTQueueTest >> testDequeueAllElements [
queue
enqueue: 'a';
enqueue: 'b';
enqueue: 'c'.
queue
dequeue;
dequeue;
dequeue.
self assert: queue isEmpty.
self assert: queue size equals: 0
]
{ #category : 'tests' }
CTQueueTest >> testDequeueMultipleElements [
queue enqueue: 'first'; enqueue: 'second'; enqueue: 'third'.
self assert: queue dequeue equals: 'first'.
self assert: queue dequeue equals: 'second'.
self assert: queue size equals: 1.
self assert: queue front equals: 'third'
]
{ #category : 'tests' }
CTQueueTest >> testDequeueSingleElement [
| element |
queue enqueue: 'test'.
element := queue dequeue.
self assert: element equals: 'test'.
self assert: queue isEmpty.
self assert: queue size equals: 0
]
{ #category : 'tests' }
CTQueueTest >> testDoIteration [
| elements |
queue enqueue: 'first'; enqueue: 'second'; enqueue: 'third'.
elements := OrderedCollection new.
queue do: [ :each | elements add: each ].
self assert: elements asArray equals: #('first' 'second' 'third').
self assert: queue size equals: 3. "Iteration should not modify the queue"
]
{ #category : 'tests' }
CTQueueTest >> testDynamicQueue [
| testQueue |
testQueue := CTQueue new: 2.
testQueue
enqueue: 'a';
enqueue: 'b'.
self assert: testQueue capacity equals: 2.
"Enqueue one more - should double capacity"
testQueue enqueue: 'c'.
self assert: testQueue capacity equals: 4.
self assert: testQueue size equals: 3.
self assert: testQueue front equals: 'a'
]
{ #category : 'tests' }
CTQueueTest >> testEnqueueAll [
| result |
result := queue enqueueAll: #('a' 'b' 'c').
self assert: queue size equals: 3.
self assert: queue front equals: 'a'.
self assert: result identicalTo: queue
]
{ #category : 'tests' }
CTQueueTest >> testEnqueueAllLargeCollection [
| collection size |
size := 50000.
collection := (1 to: size) asArray.
queue enqueueAll: collection.
self assert: queue size equals: size.
1 to: size do: [ :i | self assert: queue dequeue equals: i ].
self assert: queue isEmpty
]
{ #category : 'tests' }
CTQueueTest >> testEnqueueAllWithEmptyCollection [
| result |
result := queue enqueueAll: #().
self assert: queue isEmpty.
self assert: result identicalTo: queue
]
{ #category : 'tests' }
CTQueueTest >> testEnqueueMultipleElements [
queue
enqueue: 'first';
enqueue: 'second';
enqueue: 'third'.
self assert: queue size equals: 3.
self assert: queue front equals: 'first'.
self deny: queue isEmpty
]
{ #category : 'tests' }
CTQueueTest >> testEnqueueNilElement [
queue enqueue: nil.
self assert: queue size equals: 1.
self assert: queue front isNil.
self assert: queue dequeue isNil.
self assert: queue isEmpty
]
{ #category : 'tests' }
CTQueueTest >> testEnqueueSingleElement [
queue enqueue: 'first'.
self assert: queue size equals: 1.
self deny: queue isEmpty.
self assert: queue front equals: 'first'
]
{ #category : 'tests' }
CTQueueTest >> testEnqueueUnlessAdds [
queue enqueue: 1 unless: [ :v | (v rem: 2) = 0 ].
self assert: (queue includes: 1).
self assert: queue size equals: 1.
queue enqueue: 2 unless: [ :v | (v rem: 2) = 0 ].
self assert: (queue includes: 1).
self assert: (queue includes: 2).
self assert: queue size equals: 2.
]
{ #category : 'tests' }
CTQueueTest >> testEnqueueUnlessIgnores [
queue enqueue: 1 unless: [ :v | (v rem: 2) = 0 ].
queue enqueue: 2 unless: [ :v | (v rem: 2) = 0 ].
queue enqueue: 4 unless: [ :v | (v rem: 2) = 0 ].
self assert: (queue includes: 1).
self assert: (queue includes: 2).
self assert: queue size equals: 2.
queue enqueue: 3 unless: [ :v | (v rem: 2) = 0 ].
self assert: (queue includes: 1).
self assert: (queue includes: 2).
self assert: queue size equals: 2.
]
{ #category : 'tests' }
CTQueueTest >> testEquality [
| q1 q2 |
q1 := CTQueue new.
q2 := CTQueue new.
q1 enqueue: 'A'; enqueue: 'B'.
q2 enqueue: 'A'; enqueue: 'B'.
self assert: q1 equals: q2.
self assert: q1 hash equals: q2 hash.
]
{ #category : 'tests' }
CTQueueTest >> testErrorHandling [
self should: [ queue dequeue ] raise: Error.
self should: [ queue front ] raise: Error.
queue enqueue: 'test'.
queue dequeue.
self should: [ queue dequeue ] raise: Error.
self should: [ queue front ] raise: Error
]
{ #category : 'tests' }
CTQueueTest >> testFIFOOrdering [
queue enqueue: 'first'; enqueue: 'second'; enqueue: 'third'; enqueue: 'fourth'.
self assert: queue dequeue equals: 'first'.
self assert: queue dequeue equals: 'second'.
self assert: queue dequeue equals: 'third'.
self assert: queue dequeue equals: 'fourth'
]
{ #category : 'tests' }
CTQueueTest >> testFrontWithoutRemoving [
queue enqueue: 'first'; enqueue: 'second'.
self assert: queue front equals: 'first'.
self assert: queue size equals: 2.
self assert: queue front equals: 'first'. "Still there"
]
{ #category : 'tests' }
CTQueueTest >> testIncludes [
queue enqueueAll: #(5 10 15).
self assert: (queue includes: 10).
self deny: (queue includes: 20).
self assert: queue size equals: 3.
]
{ #category : 'tests' }
CTQueueTest >> testInterleavedEnqueueDequeue [
queue enqueue: 1.
queue enqueue: 2.
self assert: queue dequeue equals: 1.
queue enqueue: 3.
self assert: queue dequeue equals: 2.
queue enqueue: 4.
self assert: queue dequeue equals: 3.
self assert: queue dequeue equals: 4.
self assert: queue isEmpty
]
{ #category : 'tests' }
CTQueueTest >> testIsEmpty [
self assert: queue isEmpty.
queue enqueue: 'test'.
self deny: queue isEmpty.
queue dequeue.
self assert: queue isEmpty
]
{ #category : 'tests' }
CTQueueTest >> testQueueCreationWithCapacity [
| testQueue |
testQueue := CTQueue new: 3.
self assert: testQueue capacity equals: 3.
self assert: testQueue isEmpty.
self assert: testQueue size equals: 0
]
{ #category : 'tests' }
CTQueueTest >> testQueueCreationWithInvalidCapacity [
self should: [ CTQueue new: -1 ] raise: Error.
self should: [ CTQueue new: -10 ] raise: Error
]
{ #category : 'tests' }
CTQueueTest >> testQueueCreationWithZeroCapacity [
| zeroQueue |
zeroQueue := CTQueue new: 0.
self assert: zeroQueue capacity equals: 0.
self assert: zeroQueue isEmpty.
self assert: zeroQueue size equals: 0.
zeroQueue enqueue: 'first'.
self assert: zeroQueue capacity equals: 10.
self assert: zeroQueue size equals: 1
]
{ #category : 'tests' }
CTQueueTest >> testRemoveAll [
queue
enqueue: 'a';
enqueue: 'b';
enqueue: 'c'.
queue removeAll.
self assert: queue isEmpty.
self assert: queue size equals: 0.
queue enqueue: 'd'.
self deny: queue isEmpty.
self assert: queue size equals: 1.
self assert: queue front equals: 'd'
]
{ #category : 'tests' }
CTQueueTest >> testRemoveAllOnEmptyQueue [
queue removeAll.
self assert: queue isEmpty.
self assert: queue size equals: 0
]
{ #category : 'tests' }
CTQueueTest >> testSearchExistingElement [
queue enqueue: 'a'; enqueue: 'b'; enqueue: 'c'; enqueue: 'b'.
self assert: (queue search: 'a') equals: 1. "Front element"
self assert: (queue search: 'b') equals: 2. "First occurrence"
self assert: (queue search: 'c') equals: 3
]
{ #category : 'tests' }
CTQueueTest >> testSearchNonExistentElement [
queue enqueue: 'a'; enqueue: 'b'; enqueue: 'c'.
self assert: (queue search: 'x') equals: -1
]
{ #category : 'tests' }
CTQueueTest >> testSize [
self assert: queue size equals: 0.
queue enqueue: 'a'.
self assert: queue size equals: 1.
queue enqueue: 'b'; enqueue: 'c'.
self assert: queue size equals: 3.
queue dequeue.
self assert: queue size equals: 2
]