/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | PriorityQueueTest.java | 59 assertEquals(0, new PriorityQueue(SIZE).size()); 87 new PriorityQueue(Arrays.asList(new Integer[SIZE])); 96 Integer[] ints = new Integer[SIZE]; 97 for (int i = 0; i < SIZE - 1; ++i) 109 Integer[] ints = new Integer[SIZE]; 110 for (int i = 0; i < SIZE; ++i) 113 for (int i = 0; i < SIZE; ++i) 122 PriorityQueue q = new PriorityQueue(SIZE, cmp); 124 Integer[] ints = new Integer[SIZE]; 125 for (int i = 0; i < SIZE; [all...] |
H A D | PriorityBlockingQueueTest.java | 41 // return new PriorityBlockingQueue(SIZE); 87 new PriorityBlockingQueue(SIZE).remainingCapacity()); 114 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); 125 Integer[] ints = new Integer[SIZE]; 126 for (int i = 0; i < SIZE - 1; ++i) 139 Integer[] ints = new Integer[SIZE]; 140 for (int i = 0; i < SIZE; ++i) 143 for (int i = 0; i < SIZE; ++i) 152 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp); 154 Integer[] ints = new Integer[SIZE]; [all...] |
H A D | ConcurrentLinkedQueueTest.java | 69 new ConcurrentLinkedQueue(Arrays.asList(new Integer[SIZE])); 78 Integer[] ints = new Integer[SIZE]; 79 for (int i = 0; i < SIZE - 1; ++i) 91 Integer[] ints = new Integer[SIZE]; 92 for (int i = 0; i < SIZE; ++i) 95 for (int i = 0; i < SIZE; ++i) 117 ConcurrentLinkedQueue q = populatedQueue(SIZE); 118 for (int i = 0; i < SIZE; ++i) { 119 assertEquals(SIZE - i, q.size()); 122 for (int i = 0; i < SIZE; [all...] |
H A D | ArrayBlockingQueueTest.java | 34 // return new ArrayBlockingQueue(SIZE, true); 40 // return new ArrayBlockingQueue(SIZE, false); 75 assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity()); 102 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); 104 new ArrayBlockingQueue(SIZE, false, elements); 113 Integer[] ints = new Integer[SIZE]; 114 for (int i = 0; i < SIZE - 1; ++i) 118 new ArrayBlockingQueue(SIZE, false, elements); 127 Integer[] ints = new Integer[SIZE]; [all...] |
H A D | ArrayBlockingQueueFairTest.java | 22 return new ArrayBlockingQueue(SIZE, true);
|
H A D | ArrayBlockingQueueNonFairTest.java | 17 return new ArrayBlockingQueue(SIZE, false);
|
H A D | LinkedBlockingDequeBoundedTest.java | 15 return new LinkedBlockingDeque(SIZE);
|
H A D | LinkedBlockingQueueBoundedTest.java | 17 return new LinkedBlockingQueue(SIZE);
|
H A D | PriorityBlockingQueueInitialCapacityTest.java | 17 return new PriorityBlockingQueue(SIZE);
|
H A D | AtomicIntegerArrayTest.java | 33 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 34 for (int i = 0; i < SIZE; i++) 64 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 65 for (int index : new int[] { -1, SIZE }) { 101 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 102 for (int i = 0; i < SIZE; i++) { 116 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 117 for (int i = 0; i < SIZE; i++) { 131 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); 132 for (int i = 0; i < SIZE; [all...] |
H A D | AtomicLongArrayTest.java | 32 AtomicLongArray aa = new AtomicLongArray(SIZE); 33 for (int i = 0; i < SIZE; i++) 63 AtomicLongArray aa = new AtomicLongArray(SIZE); 64 for (int index : new int[] { -1, SIZE }) { 100 AtomicLongArray aa = new AtomicLongArray(SIZE); 101 for (int i = 0; i < SIZE; i++) { 115 AtomicLongArray aa = new AtomicLongArray(SIZE); 116 for (int i = 0; i < SIZE; i++) { 130 AtomicLongArray aa = new AtomicLongArray(SIZE); 131 for (int i = 0; i < SIZE; [all...] |
H A D | LinkedListTest.java | 66 Integer[] ints = new Integer[SIZE]; 67 for (int i = 0; i < SIZE; ++i) 70 for (int i = 0; i < SIZE; ++i) 92 LinkedList q = populatedQueue(SIZE); 93 for (int i = 0; i < SIZE; ++i) { 94 assertEquals(SIZE - i, q.size()); 97 for (int i = 0; i < SIZE; ++i) { 127 for (int i = 0; i < SIZE; ++i) { 149 Integer[] ints = new Integer[SIZE]; 150 for (int i = 0; i < SIZE; [all...] |
H A D | LinkedBlockingDequeTest.java | 37 return new LinkedBlockingDeque(SIZE); 87 LinkedBlockingDeque q = populatedDeque(SIZE); 88 for (int i = 0; i < SIZE; ++i) { 89 assertEquals(SIZE - i, q.size()); 92 for (int i = 0; i < SIZE; ++i) { 142 LinkedBlockingDeque q = populatedDeque(SIZE); 143 for (int i = 0; i < SIZE; ++i) { 153 LinkedBlockingDeque q = populatedDeque(SIZE); 154 for (int i = SIZE - 1; i >= 0; --i) { 164 LinkedBlockingDeque q = populatedDeque(SIZE); [all...] |
H A D | LinkedBlockingQueueTest.java | 40 // return new LinkedBlockingQueue(SIZE); 77 assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity()); 105 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); 117 Integer[] ints = new Integer[SIZE]; 118 for (int i = 0; i < SIZE - 1; ++i) 131 Integer[] ints = new Integer[SIZE]; 132 for (int i = 0; i < SIZE; ++i) 135 for (int i = 0; i < SIZE; ++i) 158 BlockingQueue q = populatedQueue(SIZE); [all...] |
H A D | ArrayDequeTest.java | 68 new ArrayDeque(Arrays.asList(new Integer[SIZE])); 77 Integer[] ints = new Integer[SIZE]; 78 for (int i = 0; i < SIZE - 1; ++i) 90 Integer[] ints = new Integer[SIZE]; 91 for (int i = 0; i < SIZE; ++i) 94 for (int i = 0; i < SIZE; ++i) 116 ArrayDeque q = populatedDeque(SIZE); 117 for (int i = 0; i < SIZE; ++i) { 118 assertEquals(SIZE - i, q.size()); 121 for (int i = 0; i < SIZE; [all...] |
H A D | ConcurrentLinkedDequeTest.java | 72 new ConcurrentLinkedDeque(Arrays.asList(new Integer[SIZE])); 81 Integer[] ints = new Integer[SIZE]; 82 for (int i = 0; i < SIZE - 1; ++i) 94 Integer[] ints = new Integer[SIZE]; 95 for (int i = 0; i < SIZE; ++i) 98 for (int i = 0; i < SIZE; ++i) 120 ConcurrentLinkedDeque q = populatedDeque(SIZE); 121 for (int i = 0; i < SIZE; ++i) { 122 assertEquals(SIZE - i, q.size()); 125 for (int i = 0; i < SIZE; [all...] |
H A D | ConcurrentHashMap8Test.java | 563 static final int SIZE = 10000; field in class:ConcurrentHashMap8Test 568 longMap = new ConcurrentHashMap<Long, Long>(SIZE); 569 for (int i = 0; i < SIZE; ++i) 591 assertEquals(adder.sum(), SIZE * (SIZE - 1) / 2); 601 assertEquals(adder.sum(), SIZE * (SIZE - 1)); 611 assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); 621 assertEquals(adder.sum(), 3 * SIZE * (SIZ [all...] |
H A D | LinkedTransferQueueTest.java | 85 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); 97 Integer[] ints = new Integer[SIZE]; 98 for (int i = 0; i < SIZE - 1; ++i) 111 Integer[] ints = new Integer[SIZE]; 112 for (int i = 0; i < SIZE; ++i) { 124 assertTrue(Arrays.equals(q.toArray(new Object[SIZE]), 125 intList.toArray(new Object[SIZE]))); 126 for (int i = 0; i < SIZE; ++i) { 135 BlockingQueue q = populatedQueue(SIZE); 136 for (int i = 0; i < SIZE; [all...] |
H A D | DelayQueueTest.java | 174 new DelayQueue(Arrays.asList(new PDelay[SIZE])); 183 PDelay[] a = new PDelay[SIZE]; 184 for (int i = 0; i < SIZE - 1; ++i) 196 PDelay[] ints = new PDelay[SIZE]; 197 for (int i = 0; i < SIZE; ++i) 200 for (int i = 0; i < SIZE; ++i) 223 BlockingQueue q = populatedQueue(SIZE); 224 for (int i = 0; i < SIZE; ++i) { 226 assertEquals(SIZE - i, q.size()); 229 for (int i = 0; i < SIZE; [all...] |
H A D | AtomicReferenceArrayTest.java | 32 AtomicReferenceArray<Integer> aa = new AtomicReferenceArray<Integer>(SIZE); 33 for (int i = 0; i < SIZE; i++) { 79 AtomicReferenceArray<Integer> aa = new AtomicReferenceArray<Integer>(SIZE); 80 for (int index : new int[] { -1, SIZE }) { 108 AtomicReferenceArray aa = new AtomicReferenceArray(SIZE); 109 for (int i = 0; i < SIZE; i++) { 123 AtomicReferenceArray aa = new AtomicReferenceArray(SIZE); 124 for (int i = 0; i < SIZE; i++) { 138 AtomicReferenceArray aa = new AtomicReferenceArray(SIZE); 139 for (int i = 0; i < SIZE; [all...] |
H A D | TreeSubSetTest.java | 125 NavigableSet q = populatedSet(SIZE); 126 for (int i = 0; i < SIZE; ++i) { 127 assertEquals(SIZE - i, q.size()); 130 for (int i = 0; i < SIZE; ++i) { 192 Integer[] ints = new Integer[SIZE]; 205 Integer[] ints = new Integer[SIZE]; 206 for (int i = 0; i < SIZE - 1; ++i) 207 ints[i] = new Integer(i + SIZE); 219 Integer[] ints = new Integer[SIZE]; 220 for (int i = 0; i < SIZE; [all...] |
H A D | ConcurrentSkipListSubSetTest.java | 128 NavigableSet q = populatedSet(SIZE); 129 for (int i = 0; i < SIZE; ++i) { 130 assertEquals(SIZE - i, q.size()); 133 for (int i = 0; i < SIZE; ++i) { 195 Integer[] ints = new Integer[SIZE]; 208 Integer[] ints = new Integer[SIZE]; 209 for (int i = 0; i < SIZE - 1; ++i) 210 ints[i] = new Integer(i + SIZE); 222 Integer[] ints = new Integer[SIZE]; 223 for (int i = 0; i < SIZE; [all...] |
H A D | TreeSetTest.java | 44 static final int SIZE = 20; field in class:TreeSetTest 99 new TreeSet(Arrays.asList(new Integer[SIZE])); 108 Integer[] ints = new Integer[SIZE]; 109 for (int i = 0; i < SIZE - 1; ++i) 121 Integer[] ints = new Integer[SIZE]; 122 for (int i = 0; i < SIZE; ++i) 125 for (int i = 0; i < SIZE; ++i) 136 Integer[] ints = new Integer[SIZE]; 137 for (int i = 0; i < SIZE; ++i) 140 for (int i = SIZE [all...] |
H A D | ConcurrentSkipListSetTest.java | 95 new ConcurrentSkipListSet(Arrays.asList(new Integer[SIZE])); 104 Integer[] ints = new Integer[SIZE]; 105 for (int i = 0; i < SIZE - 1; ++i) 117 Integer[] ints = new Integer[SIZE]; 118 for (int i = 0; i < SIZE; ++i) 121 for (int i = 0; i < SIZE; ++i) 132 Integer[] ints = new Integer[SIZE]; 133 for (int i = 0; i < SIZE; ++i) 136 for (int i = SIZE - 1; i >= 0; --i) 158 ConcurrentSkipListSet q = populatedSet(SIZE); [all...] |
H A D | AbstractQueueTest.java | 147 Integer[] ints = new Integer[SIZE]; 160 Integer[] ints = new Integer[SIZE]; 161 for (int i = 0; i < SIZE - 1; ++i) 174 Integer[] ints = new Integer[SIZE]; 175 for (int i = 0; i < SIZE; ++i)
|