concurrent/ArrayBlockingQueue/WhiteBox.java

195         int capacity = q.remainingCapacity();
196         int n = rnd.nextInt(capacity + 1);
233         int capacity = rnd.nextInt(2, 10);
234         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
237         for (int i = 0; i < capacity; i++)
240         for (int i = 0; i < capacity; i++) {
244             q.add(capacity + i);
262         int capacity = rnd.nextInt(2, 10);
263         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
266         for (int i = 0; i < capacity; i++)
269         for (int i = 0; i < capacity; i++) {
273             q.add(capacity+i);
275         for (int i = 0; i < capacity; i++)
292         int capacity = rnd.nextInt(2, 10);
293         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
295         for (int i = 0; i < capacity; i++)
298         for (int i = capacity; i < 3 * capacity; i++) {
304         for (int i = 3 * capacity; i < 4 * capacity; i++) {
305             assertEquals(trackedIterators(q), its.subList(capacity,2*capacity));
328         int capacity = rnd.nextInt(10, 20);
329         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
332         for (int i = 1; i < 2 * capacity; i++) {
354         int capacity = rnd.nextInt(1, 10);
355         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
368         int capacity = rnd.nextInt(3, 10);
369         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
372         for (int i = 0; i < capacity; i++)
374         for (int i = 0; i < capacity; i++) {
381         q.remove(capacity - 1);
383         for (int i = 1; i < capacity - 1; i++) {
384             q.remove(capacity - i - 1);
385             Iterator it = its.get(capacity - i);
387             assertEquals(attachedIterators(q), its.subList(0, capacity - i));
389             assertEquals(it.next(), capacity - i);
409         int capacity = 2 * rnd.nextInt(2, 10);
410         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
413         for (int i = 0; i < capacity/2; i++) {
417         assertEquals(takeIndex(q), capacity/2);
418         for (int i = 0; i < capacity; i++)
420         for (int i = 0; i < capacity; i++) {
432             for (int i = 0; i < capacity; i+=2) assertTrue(q.remove(i));
435             for (int i = capacity - 2; i >= 0; i-=2) assertTrue(q.remove(i));
449         for (int i = 0; i < capacity; i++) {
455                 for (int j = i+1; j < capacity; j += 2)
464                 for (int j = i+2; j < capacity; j += 2)
477         int capacity = rnd.nextInt(1, 10);
478         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
481         for (int i = 0; i < capacity; i++) q.add(i);
482         for (int i = 0; i < capacity; i++) its.add(q.iterator());
487             assertEquals(trackedIterators.size(), capacity);
498         int capacity = rnd.nextInt(10, 20);
499         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
503         final int size = 1 + rnd.nextInt(capacity);
529         int capacity = rnd.nextInt(10, 20);
530         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
539         for (int i = 0; i < capacity; i++)
562         int capacity = rnd.nextInt(10, 20);
563         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
565         for (int i = 0; i < capacity/2; i++) {
569         assertEquals(takeIndex(q), capacity/2);
570         for (int i = 0; i < capacity; i++)
572         for (int i = 0; i < capacity; i++) {
579         for (int i = capacity - 1; i >= 0; i--) {
634         int capacity = rnd.nextInt(10, 20);
635         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
639         for (int i = 0; i < capacity; i++)
641         for (int i = 0; i < 2 * capacity + 1; i++) {
646         for (int i = 0; i < 2 * capacity + 1; i++) {
648             for (int j = 0; j < capacity/2; j++)
653         for (int i = capacity; i < 3 * capacity; i++) {
660             int victim = i - capacity;
668             if (victim >= capacity/2)
670             assertEquals(capacity/2, it.next());
671             if (victim > capacity/2)
673             for (int j = Math.max(victim, capacity/2 + 1); j < i; j++) {
699         if (rnd.nextBoolean()) assertEquals(capacity/2, itMid.next());
702         assertEquals(capacity, q.size());
711         int capacity = rnd.nextInt(10, 20);
712         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
714         for (int i = 0; i < capacity; i++) {
716             assertEquals(capacity, q.size() + q.remainingCapacity());
719         for (int i = 0; i < (capacity + (capacity >> 1)); i++) {
721             assertEquals(capacity, q.size() + q.remainingCapacity());
725             assertEquals(capacity, q.size() + q.remainingCapacity());
726             q.add(capacity + i);
728         for (int i = 0; i < capacity; i++) {
730             assertEquals(capacity, q.size() + q.remainingCapacity());
731             int expected = i + capacity + (capacity >> 1);
740         int capacity = rnd.nextInt(2, 10);
741         ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
743         int size = rnd.nextInt(1, capacity + 1);