Lines Matching refs:size
104 // ensure the list either contains the numbers from 0 to size-1 or
105 // the numbers from size to 2*size -1
124 // size or not, and the min number of iterations to run
127 colSize = c.size();
143 // starting at the value size to 2*size - 1
144 // else the list with be filled starting at 0 to size - 1
184 // ensure the list either contains the numbers from 0 to size-1 or
185 // the numbers from size to 2*size -1
206 // size or not, and the min number of iterations to run
210 mapSize = m.size();
230 // starting at the value size to 2*size - 1
231 // else the list with be filled starting at 0 to size - 1
262 final int llSize = ll.size();
283 final int rSize = myReversedLinkedList.size();
325 final int llSize = ll.size();
420 final int size = ll.size();
422 assertEquals("Fill modified list size", size, ll.size());
428 assertEquals("Fill with nulls modified list size", size, ll.size());
514 assertEquals("Returned list of incorrect size", 100, l.size());
574 final int llSize = ll.size();
619 final int size = list.size();
626 for (int i = 0; i < size - 1; i++) {
634 index = 30031 * i % (size + 1); // 30031 is a large prime
677 assertEquals("Wrong size", 1, single.size());
695 final int llSize = ll.size();
696 final int rllSize = reversedLinkedList.size();
731 final int llSize = myll.size();
885 for (int i = 0; i < smallList.size(); i++) {
900 for (int i = 0; i < smallList.size(); i++) {
970 // rotate with positive distance that is larger than list size
975 // rotate with negative distance that is larger than list size
997 for (int i = 0; i < list.size(); i++) {
1245 int size = al.size();
1246 assertEquals("Wrong size", ll.size(), size);
1248 for (int i = 0; i < size; i++) {
1630 assertTrue("Returned collection is of incorrect size", c.size() == ll
1631 .size());
1689 assertTrue("Returned list is of incorrect size", c.size() == ll.size());
1757 assertTrue("Returned map is of incorrect size", c.size() == hm.size());
1835 assertTrue("Returned set is of incorrect size", c.size() == s.size());
1881 assertTrue("Returned map is of incorrect size", c.size() == tm.size());
1914 assertTrue("Returned set is of incorrect size", c.size() == ss.size());
1959 assertEquals(1, single.size());
1980 assertEquals(1, single.size());
2095 assertEquals(100, map.size());
2097 assertEquals(100, set.size());
2156 assertEquals(100, deque.size());
2157 assertEquals(100, que.size());
2161 assertEquals(0, deque.size());
2162 assertEquals(0, que.size());
2166 assertEquals(100, deque.size());
2167 assertEquals(100, que.size());
2175 assertEquals(0, deque.size());
2176 assertEquals(0, que.size());
2273 // size
2274 assertTrue("Size should return 100, returned: " + map.size(), map.size() == 100);
2299 assertEquals(100, referenceEntrySet.size());
2300 assertEquals(100, entrySet.size());
2338 // size
2339 assertEquals("Returned wrong size.", 100, keySet.size());
2348 assertEquals(set1.size(), set1TypedArray1.length);
2365 assertEquals(set1.size(), entryCount);
2369 // set1.toArray(new T[size])
2370 T[] parameterArray1 = createArray(elementType, set1.size());
2377 assertEquals(set1.size(), set1UntypedArray.length);
2382 assertEquals(set1.size(), set2TypedArray1.length);
2385 // set2.toArray(new T[size])
2386 T[] parameterArray2 = createArray(elementType, set2.size());
2401 private static <T> T[] createArray(Class<?> elementType, int size) {
2402 return (T[]) Array.newInstance(elementType, size);