Home
last modified time | relevance | path

Searched refs:ll (Results 1 – 11 of 11) sorted by relevance

/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DLinkedListTest.java43 LinkedList ll; field in LinkedListTest
64 new Support_ListTest("", ll).runTest(); in test_Constructor()
77 assertTrue("Incorrect LinkedList constructed", new LinkedList(ll) in test_ConstructorLjava_util_Collection()
78 .equals(ll)); in test_ConstructorLjava_util_Collection()
94 ll.add(50, o = "Test"); in test_addILjava_lang_Object()
95 assertTrue("Failed to add Object>: " + ll.get(50).toString(), ll in test_addILjava_lang_Object()
98 ll.get(51) == objArray[50] && (ll.get(52) == objArray[51])); in test_addILjava_lang_Object()
99 ll.add(50, null); in test_addILjava_lang_Object()
100 assertNull("Did not add null correctly", ll.get(50)); in test_addILjava_lang_Object()
103 ll.add(-1, "Test"); in test_addILjava_lang_Object()
[all …]
DCollectionsTest.java59 private LinkedList ll; field in CollectionsTest
263 final int llSize = ll.size(); in test_binarySearchLjava_util_ListLjava_lang_Object()
272 assertEquals("Returned incorrect binary search item position", ll in test_binarySearchLjava_util_ListLjava_lang_Object()
273 .get(i), ll.get(Collections.binarySearch(ll, ll in test_binarySearchLjava_util_ListLjava_lang_Object()
315 Collections.copy(null, ll); in test_copyLjava_util_ListLjava_util_List()
321 Collections.copy(ll, null); in test_copyLjava_util_ListLjava_util_List()
326 final int llSize = ll.size(); in test_copyLjava_util_ListLjava_util_List()
327 ll.set(25, null); in test_copyLjava_util_ListLjava_util_List()
334 Collections.copy(al, ll); in test_copyLjava_util_ListLjava_util_List()
336 assertEquals("Elements do not match after copying collection", ll in test_copyLjava_util_ListLjava_util_List()
[all …]
DAbstractListTest.java167 List ll = new LinkedList(); in test_subListII() local
169 ll.add(new Integer(i)); in test_subListII()
173 !(ll.subList(3, 7) instanceof RandomAccess)); in test_subListII()
DEnumSetTest.java45 … J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, aa, bb, cc, dd, ee, ff, gg, hh, ii, jj, kk, ll, enumConstant
53 …, W{}, X{}, Y{}, Z{}, aa{}, bb{}, cc{}, dd{}, ee{}, ff{}, gg{}, hh{}, ii{}, jj{}, kk{}, ll{}, mm{}, enumConstant
57 …K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, aa, bb, cc, dd, ee, ff, gg, hh, ii, jj, kk, ll, mm, enumConstant
715 result = set.contains(EnumFoo.ll); in test_contains_LObject()
761 result = hugeSet.contains(HugeEnum.ll); in test_contains_LObject()
/libcore/ojluni/src/main/native/
Djlong_md.h49 #define jlong_ltz(ll) ((ll)<0) argument
50 #define jlong_gez(ll) ((ll)>=0) argument
51 #define jlong_gtz(ll) ((ll)>0) argument
/libcore/ojluni/src/main/java/java/util/stream/
DDoublePipeline.java405 (ll, d) -> {
406 Collectors.sumWithCompensation(ll, d);
407 ll[2] += d;
409 (ll, rr) -> {
410 Collectors.sumWithCompensation(ll, rr[0]);
411 Collectors.sumWithCompensation(ll, rr[1]);
412 ll[2] += rr[2];
447 (ll, d) -> {
448 ll[2]++;
449 Collectors.sumWithCompensation(ll, d);
[all …]
DIntPipeline.java452 (ll, i) -> {
453 ll[0]++;
454 ll[1] += i;
456 (ll, rr) -> {
457 ll[0] += rr[0];
458 ll[1] += rr[1];
DLongPipeline.java429 (ll, i) -> {
430 ll[0]++;
431 ll[1] += i;
433 (ll, rr) -> {
434 ll[0] += rr[0];
435 ll[1] += rr[1];
/libcore/luni/src/test/java/libcore/java/util/
DOldListIteratorTest.java247 LinkedList ll = new LinkedList(); in setUp() local
249 ll.add(objArray[i]); in setUp()
251 l = ll.listIterator(); in setUp()
DOldCollectionsTest.java70 LinkedList<String> ll = lls; in test_binarySearchLjava_util_ListLjava_lang_ObjectLjava_util_Comparator() local
73 Collections.binarySearch(ll, new Integer(10), null); in test_binarySearchLjava_util_ListLjava_lang_ObjectLjava_util_Comparator()
103 LinkedList ll = lls; in test_binarySearchLjava_util_ListLjava_lang_Object() local
106 Collections.binarySearch(ll, new Integer(10)); in test_binarySearchLjava_util_ListLjava_lang_Object()
/libcore/tools/testmapping/
DREADME10 3. Do that two more times. We'll use best-of-three timings, since sometimes a
32 becomes too long, we'll have to find a way to simplify it, by rolling up to a