-
Notifications
You must be signed in to change notification settings - Fork 0
/
BoundedBlockingQueueTest.scala
474 lines (373 loc) · 16.8 KB
/
BoundedBlockingQueueTest.scala
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
465
466
467
468
469
470
471
472
473
474
package gakesson.util.concurrent.scala
import java.util.LinkedList
import java.util.Queue
import java.util.concurrent.BlockingQueue
import java.util.concurrent.CountDownLatch
import java.util.concurrent.Executors
import java.util.concurrent.TimeUnit
import java.util.concurrent.atomic.AtomicBoolean
import java.util.concurrent.atomic.AtomicInteger
import java.util.concurrent.atomic.AtomicReference
import java.util.concurrent.locks.ReentrantLock
import scala.annotation.tailrec
import scala.util.Random
import org.fest.assertions.Assertions
import org.fest.assertions.Assertions.assertThat
import org.testng.Assert.fail
import org.testng.annotations.Test
class BoundedBlockingQueueTest extends Assertions {
val elementCounter = new AtomicInteger(0)
@Test
def shouldOfferElementToFullQueueUntilQueueIsCleared() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
verifyAndOfferAllElements(numberOfElements, queue)
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.clear()
concurentPerformOfferElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldOfferElementToFullQueueUntilQueueIsDrained() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
verifyAndOfferAllElements(numberOfElements, queue)
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.drainTo(new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false))
concurentPerformOfferElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldOfferElementToFullQueueUntilQueueIsDrainedUsingMaxElements() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
verifyAndOfferAllElements(numberOfElements, queue)
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.drainTo(new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false), numberOfElements * 2)
concurentPerformOfferElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldOfferElementToFullQueueUntilAnotherElementIsRemoved() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
val firstElement = verifyAndOfferAllElements(numberOfElements, queue).head
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.remove(firstElement)
concurentPerformOfferElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldOfferElementToFullQueueUntilAnotherElementIsRemovedUsingIterator() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
val firstElement = verifyAndOfferAllElements(numberOfElements, queue).head
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = {
val iterator = queue.iterator()
iterator.next()
iterator.remove()
}
concurentPerformOfferElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldOfferElementToFullQueueUntilAnotherElementIsPolled() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
val firstElement = verifyAndOfferAllElements(numberOfElements, queue).head
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.poll()
concurentPerformOfferElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldOfferElementToFullQueueUntilAnotherElementIsPolledUsingSpecifiedTimeout() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
val firstElement = verifyAndOfferAllElements(numberOfElements, queue).head
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.poll(10, TimeUnit.SECONDS)
concurentPerformOfferElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldOfferElementToFullQueueUntilAnotherElementIsTaken() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
val firstElement = verifyAndOfferAllElements(numberOfElements, queue).head
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.take()
concurentPerformOfferElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldPutElementToFullQueueUntilQueueIsCleared() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
verifyAndOfferAllElements(numberOfElements, queue)
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.clear()
concurrentPerformPutElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldPutElementToFullQueueUntilQueueIsDrained() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
verifyAndOfferAllElements(numberOfElements, queue)
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.drainTo(new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false))
concurrentPerformPutElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldPutElementToFullQueueUntilQueueIsDrainedUsingMaxElements() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
verifyAndOfferAllElements(numberOfElements, queue)
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.drainTo(new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false), numberOfElements * 2)
concurrentPerformPutElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldPutElementToFullQueueUntilAnotherElementIsRemoved() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
val firstElement = verifyAndOfferAllElements(numberOfElements, queue).head
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.remove(firstElement)
concurrentPerformPutElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldPutElementToFullQueueUntilAnotherElementIsRemovedUsingIterator() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
val firstElement = verifyAndOfferAllElements(numberOfElements, queue).head
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = {
val iterator = queue.iterator()
iterator.next()
iterator.remove()
}
concurrentPerformPutElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldPutElementToFullQueueUntilAnotherElementIsPolled() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
val firstElement = verifyAndOfferAllElements(numberOfElements, queue).head
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.poll()
concurrentPerformPutElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldPutElementToFullQueueUntilAnotherElementIsPolledUsingSpecifiedTimeout() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
val firstElement = verifyAndOfferAllElements(numberOfElements, queue).head
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.poll(10, TimeUnit.SECONDS)
concurrentPerformPutElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldPutElementToFullQueueUntilAnotherElementIsTaken() {
val numberOfElements = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), numberOfElements, false)
val firstElement = verifyAndOfferAllElements(numberOfElements, queue).head
assertThat(queue.remainingCapacity()).isZero()
def enableSpace() = queue.take()
concurrentPerformPutElementUntilSpaceIsAvailable(enableSpace, queue)
}
@Test
def shouldPollElementFromEmptyQueueUntilElementIsOffered() {
val capacity = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), capacity, false)
val elementToAdd = new Element()
assertThat(queue.remainingCapacity()).isEqualTo(capacity)
def availableElement() = queue.offer(elementToAdd)
concurrentPerformPollUntilElementIsAvailable(availableElement, queue, elementToAdd)
}
@Test
def shouldPollElementFromEmptyQueueUntilElementIsOfferedUsingSpecifiedTimeout() {
val capacity = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), capacity, false)
val elementToAdd = new Element()
assertThat(queue.remainingCapacity()).isEqualTo(capacity)
def availableElement() = queue.offer(elementToAdd, 10, TimeUnit.SECONDS)
concurrentPerformPollUntilElementIsAvailable(availableElement, queue, elementToAdd)
}
@Test
def shouldPollElementFromEmptyQueueUntilElementIsPut() {
val capacity = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), capacity, false)
val elementToAdd = new Element()
assertThat(queue.remainingCapacity()).isEqualTo(capacity)
def availableElement() = queue.put(elementToAdd)
concurrentPerformPollUntilElementIsAvailable(availableElement, queue, elementToAdd)
}
@Test
def shouldPollElementFromEmptyQueueUntilElementIsAdded() {
val capacity = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), capacity, false)
val elementToAdd = new Element()
assertThat(queue.remainingCapacity()).isEqualTo(capacity)
def availableElement() = queue.add(elementToAdd)
concurrentPerformPollUntilElementIsAvailable(availableElement, queue, elementToAdd)
}
@Test
def shouldTakeElementFromEmptyQueueUntilElementIsOffered() {
val capacity = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), capacity, false)
val elementToAdd = new Element()
assertThat(queue.remainingCapacity()).isEqualTo(capacity)
def availableElement() = queue.offer(elementToAdd)
concurrentPerformTakeUntilElementIsAvailable(availableElement, queue, elementToAdd)
}
@Test
def shouldTakeElementFromEmptyQueueUntilElementIsOfferedUsingSpecifiedTimeout() {
val capacity = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), capacity, false)
val elementToAdd = new Element()
assertThat(queue.remainingCapacity()).isEqualTo(capacity)
def availableElement() = queue.offer(elementToAdd, 10, TimeUnit.SECONDS)
concurrentPerformTakeUntilElementIsAvailable(availableElement, queue, elementToAdd)
}
@Test
def shouldTakeElementFromEmptyQueueUntilElementIsPut() {
val capacity = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), capacity, false)
val elementToAdd = new Element()
assertThat(queue.remainingCapacity()).isEqualTo(capacity)
def availableElement() = queue.put(elementToAdd)
concurrentPerformTakeUntilElementIsAvailable(availableElement, queue, elementToAdd)
}
@Test
def shouldTakeElementFromEmptyQueueUntilElementIsAdd() {
val capacity = 200
val queue = new BoundedBlockingQueue[Element](createQueueToWrap(), capacity, false)
val elementToAdd = new Element()
assertThat(queue.remainingCapacity()).isEqualTo(capacity)
def availableElement() = queue.add(elementToAdd)
concurrentPerformTakeUntilElementIsAvailable(availableElement, queue, elementToAdd)
}
private def concurentPerformOfferElementUntilSpaceIsAvailable(executionToEnableSpace: => Unit, queue: BlockingQueue[Element]) {
val offeredElement = new AtomicBoolean(false)
val reachedLockBarrier = new CountDownLatch(1)
val offeredElementBarrier = new CountDownLatch(1)
val internalLock = extractInternalLockFrom(queue)
val elementToOffer = new Element()
val execution = new Runnable {
def run() {
internalLock.lock()
try {
reachedLockBarrier.countDown()
val isInserted = queue.offer(elementToOffer, 30, TimeUnit.SECONDS)
offeredElement.set(isInserted)
offeredElementBarrier.countDown()
} finally internalLock.unlock()
}
}
val executor = Executors.newCachedThreadPool()
executor.execute(execution)
reachedLockBarrier.await(10, TimeUnit.SECONDS)
internalLock.lock()
try executionToEnableSpace
finally internalLock.unlock()
offeredElementBarrier.await(2, TimeUnit.SECONDS)
executor.shutdownNow()
assertThat(offeredElement.get()).isTrue()
}
private def concurrentPerformPutElementUntilSpaceIsAvailable(executionToEnableSpace: => Unit, queue: BlockingQueue[Element]) {
val putElement = new AtomicBoolean(false)
val reachedLockBarrier = new CountDownLatch(1)
val putElementBarrier = new CountDownLatch(1)
val internalLock = extractInternalLockFrom(queue)
val elementToOffer = new Element()
val execution = new Runnable {
def run() {
internalLock.lock()
try {
reachedLockBarrier.countDown()
queue.put(elementToOffer)
putElement.set(true)
putElementBarrier.countDown()
} finally internalLock.unlock()
}
}
val executor = Executors.newCachedThreadPool()
executor.execute(execution)
internalLock.lock()
try executionToEnableSpace
finally internalLock.unlock()
putElementBarrier.await(2, TimeUnit.SECONDS)
executor.shutdownNow()
assertThat(putElement.get()).isTrue()
}
private def concurrentPerformPollUntilElementIsAvailable(executionToAddElementToQueue: => Unit, queue: BlockingQueue[Element], elementToBeAdded: Element) {
val polledElement = new AtomicReference[Element]()
val reachedLockBarrier = new CountDownLatch(1)
val polledElementBarrier = new CountDownLatch(1)
val internalLock = extractInternalLockFrom(queue)
val execution = new Runnable {
def run() {
internalLock.lock()
try {
reachedLockBarrier.countDown()
val element = queue.poll(30, TimeUnit.SECONDS)
polledElement.set(element)
polledElementBarrier.countDown()
} finally internalLock.unlock()
}
}
val executor = Executors.newCachedThreadPool()
executor.execute(execution)
internalLock.lock()
try executionToAddElementToQueue
finally internalLock.unlock()
polledElementBarrier.await(2, TimeUnit.SECONDS)
assertThat(polledElement.get()).isSameAs(elementToBeAdded)
}
private def concurrentPerformTakeUntilElementIsAvailable(executionToAddElementToQueue: => Unit, queue: BlockingQueue[Element], elementToBeAdded: Element) {
val takenElement = new AtomicReference[Element]()
val reachedLockBarrier = new CountDownLatch(1)
val takenElementBarrier = new CountDownLatch(1)
val internalLock = extractInternalLockFrom(queue)
val execution = new Runnable {
def run() {
internalLock.lock()
try {
reachedLockBarrier.countDown()
val element = queue.take()
takenElement.set(element)
takenElementBarrier.countDown()
} finally internalLock.unlock()
}
}
val executor = Executors.newCachedThreadPool()
executor.execute(execution)
internalLock.lock()
try executionToAddElementToQueue
finally internalLock.unlock()
takenElementBarrier.await(2, TimeUnit.SECONDS)
assertThat(takenElement.get()).isSameAs(elementToBeAdded)
}
private def extractInternalLockFrom(queue: BlockingQueue[Element]): ReentrantLock = {
val field = queue.getClass.getDeclaredField("gakesson$util$concurrent$scala$BoundedBlockingQueue$$lock")
field.setAccessible(true)
field.get(queue).asInstanceOf[ReentrantLock]
}
private def verifyAndOfferAllElements(numberOfElements: Int, queue: BlockingQueue[Element]): List[Element] = {
val createdElements = createElements(numberOfElements)
createdElements.foreach(x => (if (!queue.offer(x)) fail("Should have offered the specified element")))
createdElements
}
private def createElements(numberOfElements: Int): List[Element] = {
@tailrec def createOne(list: List[Element] = Nil, n: Int = 0): List[Element] = {
if (n < numberOfElements) {
val newList = list ::: List(new Element())
createOne(newList, n + 1)
} else list ::: Nil
}
val elements = createOne()
Random.shuffle(elements)
}
private def createQueueToWrap(): Queue[Element] = new LinkedList[Element]()
class Element(elementId: Int = elementCounter.incrementAndGet()) {
def getElementId(): Int = elementId
override def toString: String = "Element with ID=" + elementId
}
trait ExecutionInjection {
def apply()
}
}