| /libcore/jsr166-tests/src/test/java/jsr166/ |
| D | PriorityQueueTest.java | 59 assertEquals(0, new PriorityQueue(SIZE).size()); in testConstructor1()
87 new PriorityQueue(Arrays.asList(new Integer[SIZE])); in testConstructor4()
96 Integer[] ints = new Integer[SIZE]; in testConstructor5()
97 for (int i = 0; i < SIZE - 1; ++i) in testConstructor5()
109 Integer[] ints = new Integer[SIZE]; in testConstructor6()
110 for (int i = 0; i < SIZE; ++i) in testConstructor6()
113 for (int i = 0; i < SIZE; ++i) in testConstructor6()
122 PriorityQueue q = new PriorityQueue(SIZE, cmp); in testConstructor7()
124 Integer[] ints = new Integer[SIZE]; in testConstructor7()
125 for (int i = 0; i < SIZE; ++i) in testConstructor7()
[all …]
|
| D | PriorityBlockingQueueTest.java | 87 new PriorityBlockingQueue(SIZE).remainingCapacity()); in testConstructor1()
114 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); in testConstructor4()
125 Integer[] ints = new Integer[SIZE]; in testConstructor5()
126 for (int i = 0; i < SIZE - 1; ++i) in testConstructor5()
139 Integer[] ints = new Integer[SIZE]; in testConstructor6()
140 for (int i = 0; i < SIZE; ++i) in testConstructor6()
143 for (int i = 0; i < SIZE; ++i) in testConstructor6()
152 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp); in testConstructor7()
154 Integer[] ints = new Integer[SIZE]; in testConstructor7()
155 for (int i = 0; i < SIZE; ++i) in testConstructor7()
[all …]
|
| D | ArrayBlockingQueueTest.java | 75 assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity()); in testConstructor1()
102 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); in testConstructor4()
104 new ArrayBlockingQueue(SIZE, false, elements); in testConstructor4()
113 Integer[] ints = new Integer[SIZE]; in testConstructor5()
114 for (int i = 0; i < SIZE - 1; ++i) in testConstructor5()
118 new ArrayBlockingQueue(SIZE, false, elements); in testConstructor5()
127 Integer[] ints = new Integer[SIZE]; in testConstructor6()
128 for (int i = 0; i < SIZE; ++i) in testConstructor6()
132 new ArrayBlockingQueue(SIZE - 1, false, elements); in testConstructor6()
141 Integer[] ints = new Integer[SIZE]; in testConstructor7()
[all …]
|
| D | LinkedBlockingQueueTest.java | 77 assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity()); in testConstructor1()
105 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); in testConstructor4()
117 Integer[] ints = new Integer[SIZE]; in testConstructor5()
118 for (int i = 0; i < SIZE - 1; ++i) in testConstructor5()
131 Integer[] ints = new Integer[SIZE]; in testConstructor6()
132 for (int i = 0; i < SIZE; ++i) in testConstructor6()
135 for (int i = 0; i < SIZE; ++i) in testConstructor6()
158 BlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity()
159 for (int i = 0; i < SIZE; ++i) { in testRemainingCapacity()
161 assertEquals(SIZE, q.size() + q.remainingCapacity()); in testRemainingCapacity()
[all …]
|
| D | LinkedListTest.java | 66 Integer[] ints = new Integer[SIZE]; in testConstructor6()
67 for (int i = 0; i < SIZE; ++i) in testConstructor6()
70 for (int i = 0; i < SIZE; ++i) in testConstructor6()
92 LinkedList q = populatedQueue(SIZE); in testSize()
93 for (int i = 0; i < SIZE; ++i) { in testSize()
94 assertEquals(SIZE - i, q.size()); in testSize()
97 for (int i = 0; i < SIZE; ++i) { in testSize()
127 for (int i = 0; i < SIZE; ++i) { in testAdd()
149 Integer[] ints = new Integer[SIZE]; in testAddAll5()
150 for (int i = 0; i < SIZE; ++i) in testAddAll5()
[all …]
|
| D | ConcurrentLinkedQueueTest.java | 69 new ConcurrentLinkedQueue(Arrays.asList(new Integer[SIZE])); in testConstructor4()
78 Integer[] ints = new Integer[SIZE]; in testConstructor5()
79 for (int i = 0; i < SIZE - 1; ++i) in testConstructor5()
91 Integer[] ints = new Integer[SIZE]; in testConstructor6()
92 for (int i = 0; i < SIZE; ++i) in testConstructor6()
95 for (int i = 0; i < SIZE; ++i) in testConstructor6()
117 ConcurrentLinkedQueue q = populatedQueue(SIZE); in testSize()
118 for (int i = 0; i < SIZE; ++i) { in testSize()
119 assertEquals(SIZE - i, q.size()); in testSize()
122 for (int i = 0; i < SIZE; ++i) { in testSize()
[all …]
|
| D | LinkedBlockingDequeTest.java | 37 return new LinkedBlockingDeque(SIZE); in emptyCollection()
87 LinkedBlockingDeque q = populatedDeque(SIZE); in testSize()
88 for (int i = 0; i < SIZE; ++i) { in testSize()
89 assertEquals(SIZE - i, q.size()); in testSize()
92 for (int i = 0; i < SIZE; ++i) { in testSize()
142 LinkedBlockingDeque q = populatedDeque(SIZE); in testPollFirst()
143 for (int i = 0; i < SIZE; ++i) { in testPollFirst()
153 LinkedBlockingDeque q = populatedDeque(SIZE); in testPollLast()
154 for (int i = SIZE - 1; i >= 0; --i) { in testPollLast()
164 LinkedBlockingDeque q = populatedDeque(SIZE); in testPeekFirst()
[all …]
|
| D | DelayQueueTest.java | 174 new DelayQueue(Arrays.asList(new PDelay[SIZE])); in testConstructor4()
183 PDelay[] a = new PDelay[SIZE]; in testConstructor5()
184 for (int i = 0; i < SIZE - 1; ++i) in testConstructor5()
196 PDelay[] ints = new PDelay[SIZE]; in testConstructor6()
197 for (int i = 0; i < SIZE; ++i) in testConstructor6()
200 for (int i = 0; i < SIZE; ++i) in testConstructor6()
223 BlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity()
224 for (int i = 0; i < SIZE; ++i) { in testRemainingCapacity()
226 assertEquals(SIZE - i, q.size()); in testRemainingCapacity()
229 for (int i = 0; i < SIZE; ++i) { in testRemainingCapacity()
[all …]
|
| D | ConcurrentLinkedDequeTest.java | 72 new ConcurrentLinkedDeque(Arrays.asList(new Integer[SIZE])); in testConstructor4()
81 Integer[] ints = new Integer[SIZE]; in testConstructor5()
82 for (int i = 0; i < SIZE - 1; ++i) in testConstructor5()
94 Integer[] ints = new Integer[SIZE]; in testConstructor6()
95 for (int i = 0; i < SIZE; ++i) in testConstructor6()
98 for (int i = 0; i < SIZE; ++i) in testConstructor6()
120 ConcurrentLinkedDeque q = populatedDeque(SIZE); in testSize()
121 for (int i = 0; i < SIZE; ++i) { in testSize()
122 assertEquals(SIZE - i, q.size()); in testSize()
125 for (int i = 0; i < SIZE; ++i) { in testSize()
[all …]
|
| D | ArrayDequeTest.java | 68 new ArrayDeque(Arrays.asList(new Integer[SIZE])); in testConstructor4()
77 Integer[] ints = new Integer[SIZE]; in testConstructor5()
78 for (int i = 0; i < SIZE - 1; ++i) in testConstructor5()
90 Integer[] ints = new Integer[SIZE]; in testConstructor6()
91 for (int i = 0; i < SIZE; ++i) in testConstructor6()
94 for (int i = 0; i < SIZE; ++i) in testConstructor6()
116 ArrayDeque q = populatedDeque(SIZE); in testSize()
117 for (int i = 0; i < SIZE; ++i) { in testSize()
118 assertEquals(SIZE - i, q.size()); in testSize()
121 for (int i = 0; i < SIZE; ++i) { in testSize()
[all …]
|
| D | AtomicIntegerArrayTest.java | 33 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); in testConstructor()
34 for (int i = 0; i < SIZE; i++) in testConstructor()
64 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); in testIndexing()
65 for (int index : new int[] { -1, SIZE }) { in testIndexing()
101 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); in testGetSet()
102 for (int i = 0; i < SIZE; i++) { in testGetSet()
116 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); in testGetLazySet()
117 for (int i = 0; i < SIZE; i++) { in testGetLazySet()
131 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); in testCompareAndSet()
132 for (int i = 0; i < SIZE; i++) { in testCompareAndSet()
[all …]
|
| D | AtomicLongArrayTest.java | 32 AtomicLongArray aa = new AtomicLongArray(SIZE); in testConstructor()
33 for (int i = 0; i < SIZE; i++) in testConstructor()
63 AtomicLongArray aa = new AtomicLongArray(SIZE); in testIndexing()
64 for (int index : new int[] { -1, SIZE }) { in testIndexing()
100 AtomicLongArray aa = new AtomicLongArray(SIZE); in testGetSet()
101 for (int i = 0; i < SIZE; i++) { in testGetSet()
115 AtomicLongArray aa = new AtomicLongArray(SIZE); in testGetLazySet()
116 for (int i = 0; i < SIZE; i++) { in testGetLazySet()
130 AtomicLongArray aa = new AtomicLongArray(SIZE); in testCompareAndSet()
131 for (int i = 0; i < SIZE; i++) { in testCompareAndSet()
[all …]
|
| D | ConcurrentHashMap8Test.java | 563 static final int SIZE = 10000; field in ConcurrentHashMap8Test
568 longMap = new ConcurrentHashMap<Long, Long>(SIZE); in longMap()
569 for (int i = 0; i < SIZE; ++i) in longMap()
591 assertEquals(adder.sum(), SIZE * (SIZE - 1) / 2); in testForEachKeySequentially()
601 assertEquals(adder.sum(), SIZE * (SIZE - 1)); in testForEachValueSequentially()
611 assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); in testForEachSequentially()
621 assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); in testForEachEntrySequentially()
631 assertEquals(adder.sum(), SIZE * (SIZE - 1) / 2); in testForEachKeyInParallel()
641 assertEquals(adder.sum(), SIZE * (SIZE - 1)); in testForEachValueInParallel()
651 assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); in testForEachInParallel()
[all …]
|
| D | LinkedTransferQueueTest.java | 86 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); in testConstructor3()
98 Integer[] ints = new Integer[SIZE]; in testConstructor4()
99 for (int i = 0; i < SIZE - 1; ++i) in testConstructor4()
112 Integer[] ints = new Integer[SIZE]; in testConstructor5()
113 for (int i = 0; i < SIZE; ++i) { in testConstructor5()
125 assertTrue(Arrays.equals(q.toArray(new Object[SIZE]), in testConstructor5()
126 intList.toArray(new Object[SIZE]))); in testConstructor5()
127 for (int i = 0; i < SIZE; ++i) { in testConstructor5()
136 BlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity()
137 for (int i = 0; i < SIZE; ++i) { in testRemainingCapacity()
[all …]
|
| D | TreeSubSetTest.java | 125 NavigableSet q = populatedSet(SIZE); in testSize()
126 for (int i = 0; i < SIZE; ++i) { in testSize()
127 assertEquals(SIZE - i, q.size()); in testSize()
130 for (int i = 0; i < SIZE; ++i) { in testSize()
192 Integer[] ints = new Integer[SIZE]; in testAddAll2()
205 Integer[] ints = new Integer[SIZE]; in testAddAll3()
206 for (int i = 0; i < SIZE - 1; ++i) in testAddAll3()
207 ints[i] = new Integer(i + SIZE); in testAddAll3()
219 Integer[] ints = new Integer[SIZE]; in testAddAll5()
220 for (int i = 0; i < SIZE; ++i) in testAddAll5()
[all …]
|
| D | ConcurrentSkipListSubSetTest.java | 128 NavigableSet q = populatedSet(SIZE); in testSize()
129 for (int i = 0; i < SIZE; ++i) { in testSize()
130 assertEquals(SIZE - i, q.size()); in testSize()
133 for (int i = 0; i < SIZE; ++i) { in testSize()
195 Integer[] ints = new Integer[SIZE]; in testAddAll2()
208 Integer[] ints = new Integer[SIZE]; in testAddAll3()
209 for (int i = 0; i < SIZE - 1; ++i) in testAddAll3()
210 ints[i] = new Integer(i + SIZE); in testAddAll3()
222 Integer[] ints = new Integer[SIZE]; in testAddAll5()
223 for (int i = 0; i < SIZE; ++i) in testAddAll5()
[all …]
|
| D | AtomicReferenceArrayTest.java | 32 AtomicReferenceArray<Integer> aa = new AtomicReferenceArray<Integer>(SIZE); in testConstructor()
33 for (int i = 0; i < SIZE; i++) { in testConstructor()
79 AtomicReferenceArray<Integer> aa = new AtomicReferenceArray<Integer>(SIZE); in testIndexing()
80 for (int index : new int[] { -1, SIZE }) { in testIndexing()
108 AtomicReferenceArray aa = new AtomicReferenceArray(SIZE); in testGetSet()
109 for (int i = 0; i < SIZE; i++) { in testGetSet()
123 AtomicReferenceArray aa = new AtomicReferenceArray(SIZE); in testGetLazySet()
124 for (int i = 0; i < SIZE; i++) { in testGetLazySet()
138 AtomicReferenceArray aa = new AtomicReferenceArray(SIZE); in testCompareAndSet()
139 for (int i = 0; i < SIZE; i++) { in testCompareAndSet()
[all …]
|
| D | CopyOnWriteArrayListTest.java | 69 Integer[] ints = new Integer[SIZE]; in testConstructor2()
70 for (int i = 0; i < SIZE - 1; ++i) in testConstructor2()
73 for (int i = 0; i < SIZE; ++i) in testConstructor2()
81 Integer[] ints = new Integer[SIZE]; in testConstructor3()
82 for (int i = 0; i < SIZE - 1; ++i) in testConstructor3()
85 for (int i = 0; i < SIZE; ++i) in testConstructor3()
117 CopyOnWriteArrayList full = populatedArray(SIZE); in testAddIfAbsent()
119 assertEquals(SIZE, full.size()); in testAddIfAbsent()
126 CopyOnWriteArrayList full = populatedArray(SIZE); in testAddIfAbsent2()
135 CopyOnWriteArrayList full = populatedArray(SIZE); in testClear()
[all …]
|
| D | TreeSetTest.java | 44 static final int SIZE = 20; field in TreeSetTest
99 new TreeSet(Arrays.asList(new Integer[SIZE])); in testConstructor4()
108 Integer[] ints = new Integer[SIZE]; in testConstructor5()
109 for (int i = 0; i < SIZE - 1; ++i) in testConstructor5()
121 Integer[] ints = new Integer[SIZE]; in testConstructor6()
122 for (int i = 0; i < SIZE; ++i) in testConstructor6()
125 for (int i = 0; i < SIZE; ++i) in testConstructor6()
136 Integer[] ints = new Integer[SIZE]; in testConstructor7()
137 for (int i = 0; i < SIZE; ++i) in testConstructor7()
140 for (int i = SIZE - 1; i >= 0; --i) in testConstructor7()
[all …]
|
| D | ConcurrentSkipListSetTest.java | 95 new ConcurrentSkipListSet(Arrays.asList(new Integer[SIZE])); in testConstructor4()
104 Integer[] ints = new Integer[SIZE]; in testConstructor5()
105 for (int i = 0; i < SIZE - 1; ++i) in testConstructor5()
117 Integer[] ints = new Integer[SIZE]; in testConstructor6()
118 for (int i = 0; i < SIZE; ++i) in testConstructor6()
121 for (int i = 0; i < SIZE; ++i) in testConstructor6()
132 Integer[] ints = new Integer[SIZE]; in testConstructor7()
133 for (int i = 0; i < SIZE; ++i) in testConstructor7()
136 for (int i = SIZE - 1; i >= 0; --i) in testConstructor7()
158 ConcurrentSkipListSet q = populatedSet(SIZE); in testSize()
[all …]
|
| D | CopyOnWriteArraySetTest.java | 66 Integer[] ints = new Integer[SIZE]; in testConstructor3()
67 for (int i = 0; i < SIZE - 1; ++i) in testConstructor3()
70 for (int i = 0; i < SIZE; ++i) in testConstructor3()
229 Integer[] elements = new Integer[SIZE]; in testIterator()
230 for (int i = 0; i < SIZE; i++) in testIterator()
236 for (int j = 0; j < SIZE; j++) { in testIterator()
316 Integer[] elements = new Integer[SIZE]; in testToArray()
317 for (int i = 0; i < SIZE; i++) in testToArray()
337 a = new Integer[SIZE / 2]; in testToArray2()
344 Integer[] elements = new Integer[SIZE]; in testToArray2()
[all …]
|
| D | AbstractQueueTest.java | 147 Integer[] ints = new Integer[SIZE]; in testAddAll2()
160 Integer[] ints = new Integer[SIZE]; in testAddAll3()
161 for (int i = 0; i < SIZE - 1; ++i) in testAddAll3()
174 Integer[] ints = new Integer[SIZE]; in testAddAll4()
175 for (int i = 0; i < SIZE; ++i) in testAddAll4()
|
| /libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/ |
| D | SliceSpliteratorTest.java | 175 … Spliterator.OfDouble s = Arrays.spliterator(LongStream.range(0, SIZE).asDoubleStream().toArray()); in sliceSpliteratorDataProvider()
186 static final int SIZE = 256; field in SliceSpliteratorTest
192 setContext("size", SIZE); in testSliceSpliterator()
193 for (int skip = 0; skip < SIZE; skip += STEP) { in testSliceSpliterator()
195 for (int limit = 0; limit < SIZE; limit += STEP) { in testSliceSpliterator()
197 r.test(SIZE, skip, limit); in testSliceSpliterator()
|
| /libcore/ojluni/src/main/java/java/lang/ |
| D | Short.java | 471 public static final int SIZE = 16; field in Short
479 public static final int BYTES = SIZE / Byte.SIZE;
|
| D | Byte.java | 510 public static final int SIZE = 8; field in Byte
518 public static final int BYTES = SIZE / Byte.SIZE;
|