Home
last modified time | relevance | path

Searched refs:SIZE (Results 1 – 25 of 42) sorted by relevance

12

/libcore/jsr166-tests/src/test/java/jsr166/
DPriorityQueueTest.java48 assertEquals(0, new PriorityQueue(SIZE).size()); in testConstructor1()
76 Integer[] ints = new Integer[SIZE]; in testConstructor4()
87 Integer[] ints = new Integer[SIZE]; in testConstructor5()
88 for (int i = 0; i < SIZE-1; ++i) in testConstructor5()
99 Integer[] ints = new Integer[SIZE]; in testConstructor6()
100 for (int i = 0; i < SIZE; ++i) in testConstructor6()
103 for (int i = 0; i < SIZE; ++i) in testConstructor6()
112 PriorityQueue q = new PriorityQueue(SIZE, cmp); in testConstructor7()
114 Integer[] ints = new Integer[SIZE]; in testConstructor7()
115 for (int i = 0; i < SIZE; ++i) in testConstructor7()
[all …]
DPriorityBlockingQueueTest.java59 assertEquals(NOCAP, new PriorityBlockingQueue(SIZE).remainingCapacity()); in testConstructor1()
86 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); in testConstructor4()
97 Integer[] ints = new Integer[SIZE]; in testConstructor5()
98 for (int i = 0; i < SIZE-1; ++i) in testConstructor5()
111 Integer[] ints = new Integer[SIZE]; in testConstructor6()
112 for (int i = 0; i < SIZE; ++i) in testConstructor6()
115 for (int i = 0; i < SIZE; ++i) in testConstructor6()
124 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp); in testConstructor7()
126 Integer[] ints = new Integer[SIZE]; in testConstructor7()
127 for (int i = 0; i < SIZE; ++i) in testConstructor7()
[all …]
DArrayBlockingQueueTest.java46 assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity()); in testConstructor1()
73 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); in testConstructor4()
75 new ArrayBlockingQueue(SIZE, false, elements); in testConstructor4()
84 Integer[] ints = new Integer[SIZE]; in testConstructor5()
85 for (int i = 0; i < SIZE-1; ++i) in testConstructor5()
89 new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); in testConstructor5()
98 Integer[] ints = new Integer[SIZE]; in testConstructor6()
99 for (int i = 0; i < SIZE; ++i) in testConstructor6()
103 new ArrayBlockingQueue(SIZE - 1, false, elements); in testConstructor6()
112 Integer[] ints = new Integer[SIZE]; in testConstructor7()
[all …]
DConcurrentLinkedQueueTest.java57 Integer[] ints = new Integer[SIZE]; in testConstructor4()
68 Integer[] ints = new Integer[SIZE]; in testConstructor5()
69 for (int i = 0; i < SIZE-1; ++i) in testConstructor5()
80 Integer[] ints = new Integer[SIZE]; in testConstructor6()
81 for (int i = 0; i < SIZE; ++i) in testConstructor6()
84 for (int i = 0; i < SIZE; ++i) in testConstructor6()
106 ConcurrentLinkedQueue q = populatedQueue(SIZE); in testSize()
107 for (int i = 0; i < SIZE; ++i) { in testSize()
108 assertEquals(SIZE-i, q.size()); in testSize()
111 for (int i = 0; i < SIZE; ++i) { in testSize()
[all …]
DLinkedBlockingQueueTest.java48 assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity()); in testConstructor1()
76 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); in testConstructor4()
88 Integer[] ints = new Integer[SIZE]; in testConstructor5()
89 for (int i = 0; i < SIZE-1; ++i) in testConstructor5()
102 Integer[] ints = new Integer[SIZE]; in testConstructor6()
103 for (int i = 0; i < SIZE; ++i) in testConstructor6()
106 for (int i = 0; i < SIZE; ++i) in testConstructor6()
129 LinkedBlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity()
130 for (int i = 0; i < SIZE; ++i) { in testRemainingCapacity()
132 assertEquals(SIZE-i, q.size()); in testRemainingCapacity()
[all …]
DLinkedBlockingDequeTest.java60 LinkedBlockingDeque q = populatedDeque(SIZE); in testSize()
61 for (int i = 0; i < SIZE; ++i) { in testSize()
62 assertEquals(SIZE-i, q.size()); in testSize()
65 for (int i = 0; i < SIZE; ++i) { in testSize()
115 LinkedBlockingDeque q = populatedDeque(SIZE); in testPollFirst()
116 for (int i = 0; i < SIZE; ++i) { in testPollFirst()
126 LinkedBlockingDeque q = populatedDeque(SIZE); in testPollLast()
127 for (int i = SIZE-1; i >= 0; --i) { in testPollLast()
137 LinkedBlockingDeque q = populatedDeque(SIZE); in testPeekFirst()
138 for (int i = 0; i < SIZE; ++i) { in testPeekFirst()
[all …]
DLinkedListTest.java55 Integer[] ints = new Integer[SIZE]; in testConstructor6()
56 for (int i = 0; i < SIZE; ++i) in testConstructor6()
59 for (int i = 0; i < SIZE; ++i) in testConstructor6()
81 LinkedList q = populatedQueue(SIZE); in testSize()
82 for (int i = 0; i < SIZE; ++i) { in testSize()
83 assertEquals(SIZE-i, q.size()); in testSize()
86 for (int i = 0; i < SIZE; ++i) { in testSize()
114 for (int i = 0; i < SIZE; ++i) { in testAdd()
136 Integer[] ints = new Integer[SIZE]; in testAddAll5()
137 for (int i = 0; i < SIZE; ++i) in testAddAll5()
[all …]
DDelayQueueTest.java150 PDelay[] ints = new PDelay[SIZE]; in testConstructor4()
161 PDelay[] ints = new PDelay[SIZE]; in testConstructor5()
162 for (int i = 0; i < SIZE-1; ++i) in testConstructor5()
173 PDelay[] ints = new PDelay[SIZE]; in testConstructor6()
174 for (int i = 0; i < SIZE; ++i) in testConstructor6()
177 for (int i = 0; i < SIZE; ++i) in testConstructor6()
201 DelayQueue q = populatedQueue(SIZE); in testRemainingCapacity()
202 for (int i = 0; i < SIZE; ++i) { in testRemainingCapacity()
204 assertEquals(SIZE-i, q.size()); in testRemainingCapacity()
207 for (int i = 0; i < SIZE; ++i) { in testRemainingCapacity()
[all …]
DConcurrentLinkedDequeTest.java59 Integer[] ints = new Integer[SIZE]; in testConstructor4()
70 Integer[] ints = new Integer[SIZE]; in testConstructor5()
71 for (int i = 0; i < SIZE-1; ++i) in testConstructor5()
82 Integer[] ints = new Integer[SIZE]; in testConstructor6()
83 for (int i = 0; i < SIZE; ++i) in testConstructor6()
86 for (int i = 0; i < SIZE; ++i) in testConstructor6()
108 ConcurrentLinkedDeque q = populatedDeque(SIZE); in testSize()
109 for (int i = 0; i < SIZE; ++i) { in testSize()
110 assertEquals(SIZE-i, q.size()); in testSize()
113 for (int i = 0; i < SIZE; ++i) { in testSize()
[all …]
DArrayDequeTest.java57 Integer[] ints = new Integer[SIZE]; in testConstructor4()
68 Integer[] ints = new Integer[SIZE]; in testConstructor5()
69 for (int i = 0; i < SIZE-1; ++i) in testConstructor5()
80 Integer[] ints = new Integer[SIZE]; in testConstructor6()
81 for (int i = 0; i < SIZE; ++i) in testConstructor6()
84 for (int i = 0; i < SIZE; ++i) in testConstructor6()
106 ArrayDeque q = populatedDeque(SIZE); in testSize()
107 for (int i = 0; i < SIZE; ++i) { in testSize()
108 assertEquals(SIZE-i, q.size()); in testSize()
111 for (int i = 0; i < SIZE; ++i) { in testSize()
[all …]
DAtomicLongArrayTest.java21 AtomicLongArray aa = new AtomicLongArray(SIZE); in testConstructor()
22 for (int i = 0; i < SIZE; i++) in testConstructor()
52 AtomicLongArray aa = new AtomicLongArray(SIZE); in testIndexing()
53 for (int index : new int[] { -1, SIZE }) { in testIndexing()
89 AtomicLongArray aa = new AtomicLongArray(SIZE); in testGetSet()
90 for (int i = 0; i < SIZE; i++) { in testGetSet()
104 AtomicLongArray aa = new AtomicLongArray(SIZE); in testGetLazySet()
105 for (int i = 0; i < SIZE; i++) { in testGetLazySet()
119 AtomicLongArray aa = new AtomicLongArray(SIZE); in testCompareAndSet()
120 for (int i = 0; i < SIZE; i++) { in testCompareAndSet()
[all …]
DAtomicIntegerArrayTest.java21 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); in testConstructor()
22 for (int i = 0; i < SIZE; i++) in testConstructor()
52 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); in testIndexing()
53 for (int index : new int[] { -1, SIZE }) { in testIndexing()
89 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); in testGetSet()
90 for (int i = 0; i < SIZE; i++) { in testGetSet()
104 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); in testGetLazySet()
105 for (int i = 0; i < SIZE; i++) { in testGetLazySet()
119 AtomicIntegerArray aa = new AtomicIntegerArray(SIZE); in testCompareAndSet()
120 for (int i = 0; i < SIZE; i++) { in testCompareAndSet()
[all …]
DLinkedTransferQueueTest.java58 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); in testConstructor3()
70 Integer[] ints = new Integer[SIZE]; in testConstructor4()
71 for (int i = 0; i < SIZE-1; ++i) in testConstructor4()
84 Integer[] ints = new Integer[SIZE]; in testConstructor5()
85 for (int i = 0; i < SIZE; ++i) { in testConstructor5()
97 assertTrue(Arrays.equals(q.toArray(new Object[SIZE]), in testConstructor5()
98 intList.toArray(new Object[SIZE]))); in testConstructor5()
99 for (int i = 0; i < SIZE; ++i) { in testConstructor5()
108 LinkedTransferQueue<Integer> q = populatedQueue(SIZE); in testRemainingCapacity()
109 for (int i = 0; i < SIZE; ++i) { in testRemainingCapacity()
[all …]
DTreeSubSetTest.java114 NavigableSet q = populatedSet(SIZE); in testSize()
115 for (int i = 0; i < SIZE; ++i) { in testSize()
116 assertEquals(SIZE-i, q.size()); in testSize()
119 for (int i = 0; i < SIZE; ++i) { in testSize()
183 Integer[] ints = new Integer[SIZE]; in testAddAll2()
196 Integer[] ints = new Integer[SIZE]; in testAddAll3()
197 for (int i = 0; i < SIZE-1; ++i) in testAddAll3()
198 ints[i] = new Integer(i+SIZE); in testAddAll3()
209 Integer[] ints = new Integer[SIZE]; in testAddAll5()
210 for (int i = 0; i < SIZE; ++i) in testAddAll5()
[all …]
DCopyOnWriteArrayListTest.java58 Integer[] ints = new Integer[SIZE]; in testConstructor2()
59 for (int i = 0; i < SIZE-1; ++i) in testConstructor2()
62 for (int i = 0; i < SIZE; ++i) in testConstructor2()
70 Integer[] ints = new Integer[SIZE]; in testConstructor3()
71 for (int i = 0; i < SIZE-1; ++i) in testConstructor3()
74 for (int i = 0; i < SIZE; ++i) in testConstructor3()
109 CopyOnWriteArrayList full = populatedArray(SIZE); in testAddIfAbsent()
111 assertEquals(SIZE, full.size()); in testAddIfAbsent()
118 CopyOnWriteArrayList full = populatedArray(SIZE); in testAddIfAbsent2()
127 CopyOnWriteArrayList full = populatedArray(SIZE); in testClear()
[all …]
DConcurrentSkipListSubSetTest.java122 NavigableSet q = populatedSet(SIZE); in testSize()
123 for (int i = 0; i < SIZE; ++i) { in testSize()
124 assertEquals(SIZE-i, q.size()); in testSize()
127 for (int i = 0; i < SIZE; ++i) { in testSize()
191 Integer[] ints = new Integer[SIZE]; in testAddAll2()
204 Integer[] ints = new Integer[SIZE]; in testAddAll3()
205 for (int i = 0; i < SIZE-1; ++i) in testAddAll3()
206 ints[i] = new Integer(i+SIZE); in testAddAll3()
217 Integer[] ints = new Integer[SIZE]; in testAddAll5()
218 for (int i = 0; i < SIZE; ++i) in testAddAll5()
[all …]
DAtomicReferenceArrayTest.java21 AtomicReferenceArray<Integer> aa = new AtomicReferenceArray<Integer>(SIZE); in testConstructor()
22 for (int i = 0; i < SIZE; i++) { in testConstructor()
68 AtomicReferenceArray<Integer> aa = new AtomicReferenceArray<Integer>(SIZE); in testIndexing()
69 for (int index : new int[] { -1, SIZE }) { in testIndexing()
97 AtomicReferenceArray aa = new AtomicReferenceArray(SIZE); in testGetSet()
98 for (int i = 0; i < SIZE; i++) { in testGetSet()
112 AtomicReferenceArray aa = new AtomicReferenceArray(SIZE); in testGetLazySet()
113 for (int i = 0; i < SIZE; i++) { in testGetLazySet()
127 AtomicReferenceArray aa = new AtomicReferenceArray(SIZE); in testCompareAndSet()
128 for (int i = 0; i < SIZE; i++) { in testCompareAndSet()
[all …]
DTreeSetTest.java33 static final int SIZE = 20; field in TreeSetTest
88 Integer[] ints = new Integer[SIZE]; in testConstructor4()
99 Integer[] ints = new Integer[SIZE]; in testConstructor5()
100 for (int i = 0; i < SIZE-1; ++i) in testConstructor5()
111 Integer[] ints = new Integer[SIZE]; in testConstructor6()
112 for (int i = 0; i < SIZE; ++i) in testConstructor6()
115 for (int i = 0; i < SIZE; ++i) in testConstructor6()
126 Integer[] ints = new Integer[SIZE]; in testConstructor7()
127 for (int i = 0; i < SIZE; ++i) in testConstructor7()
130 for (int i = SIZE-1; i >= 0; --i) in testConstructor7()
[all …]
DCopyOnWriteArraySetTest.java56 Integer[] ints = new Integer[SIZE]; in testConstructor3()
57 for (int i = 0; i < SIZE-1; ++i) in testConstructor3()
60 for (int i = 0; i < SIZE; ++i) in testConstructor3()
180 Integer[] elements = new Integer[SIZE]; in testIterator()
181 for (int i = 0; i < SIZE; i++) in testIterator()
187 for (int j = 0; j < SIZE; j++) { in testIterator()
265 Integer[] elements = new Integer[SIZE]; in testToArray()
266 for (int i = 0; i < SIZE; i++) in testToArray()
286 a = new Integer[SIZE/2]; in testToArray2()
293 Integer[] elements = new Integer[SIZE]; in testToArray2()
[all …]
DConcurrentSkipListSetTest.java84 Integer[] ints = new Integer[SIZE]; in testConstructor4()
95 Integer[] ints = new Integer[SIZE]; in testConstructor5()
96 for (int i = 0; i < SIZE-1; ++i) in testConstructor5()
107 Integer[] ints = new Integer[SIZE]; in testConstructor6()
108 for (int i = 0; i < SIZE; ++i) in testConstructor6()
111 for (int i = 0; i < SIZE; ++i) in testConstructor6()
122 Integer[] ints = new Integer[SIZE]; in testConstructor7()
123 for (int i = 0; i < SIZE; ++i) in testConstructor7()
126 for (int i = SIZE-1; i >= 0; --i) in testConstructor7()
148 ConcurrentSkipListSet q = populatedSet(SIZE); in testSize()
[all …]
DAbstractQueueTest.java137 Integer[] ints = new Integer[SIZE]; in testAddAll2()
150 Integer[] ints = new Integer[SIZE]; in testAddAll3()
151 for (int i = 0; i < SIZE-1; ++i) in testAddAll3()
164 Integer[] ints = new Integer[SIZE]; in testAddAll4()
165 for (int i = 0; i < SIZE; ++i) in testAddAll4()
DPriorityBlockingQueueInitialCapacityTest.java17 return new PriorityBlockingQueue(SIZE); in emptyCollection()
DArrayBlockingQueueNotFairTest.java17 return new ArrayBlockingQueue(SIZE, false); in emptyCollection()
DLinkedBlockingQueueBoundedTest.java17 return new LinkedBlockingQueue(SIZE); in emptyCollection()
DLinkedBlockingDequeBoundedTest.java15 return new LinkedBlockingDeque(SIZE); in emptyCollection()

12