/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
D | ArraysTest.java | 75 for (int counter = 0; counter < arraySize; counter++) { in test_asList$Ljava_lang_Object() 78 convertedList.get(counter) == objectArray[counter]); in test_asList$Ljava_lang_Object() 90 for (int counter = 0; counter < arraySize; counter++) { in test_asList$Ljava_lang_Object() 93 convertedList.get(counter) == myArray[counter]); in test_asList$Ljava_lang_Object() 109 for (byte counter = 0; counter < arraySize; counter++) in test_binarySearch$BB() 111 Arrays.binarySearch(byteArray, counter) == counter); in test_binarySearch$BB() 117 for (byte counter = 0; counter < arraySize; counter++) in test_binarySearch$BB() 118 byteArray[counter] -= 50; in test_binarySearch$BB() 119 for (byte counter = 0; counter < arraySize; counter++) in test_binarySearch$BB() 122 Arrays.binarySearch(byteArray, (byte) (counter - 50)) == counter); in test_binarySearch$BB() [all …]
|
D | EmptyStackExceptionTest.java | 34 for (int counter = 0; counter < objArray.length + 1; counter++) in test_Constructor() 47 for (int counter = 0; counter < objArray.length; counter++) { in setUp() 48 objArray[counter] = new Integer(counter); in setUp() 52 for (int counter = 0; counter < objArray.length; counter++) { in setUp() 53 s.push(objArray[counter]); in setUp()
|
D | RandomTest.java | 53 for (int counter = 0; counter < 100; counter++) in test_nextBoolean() 73 for (int counter = 1; counter < randomBytes.length; counter++) in test_nextBytes$B() 74 if (randomBytes[counter] != firstByte) in test_nextBytes$B() 90 for (int counter = 0; counter < 100; counter++) { in test_nextDouble() 114 for (int counter = 0; counter < 100; counter++) { in test_nextFloat() 137 for (int counter = 0; counter < 100; counter++) { in test_nextGaussian() 160 for (int counter = 0; counter < 100; counter++) { in test_nextInt() 180 for (int counter = 0; counter < 100; counter++) { in test_nextIntI() 204 for (int counter = 0; counter < 100; counter++) { in test_nextLong() 228 for (int counter = 0; counter < randomArray.length; counter++) { in test_setSeedJ() [all …]
|
D | TreeSetTest.java | 60 for (int counter = 0; counter < objArray.length; counter++) in test_ConstructorLjava_util_Collection() 62 .contains(objArray[counter])); in test_ConstructorLjava_util_Collection() 94 for (int counter = 0; counter < objArray.length; counter++) in test_ConstructorLjava_util_SortedSet() 96 anotherTreeSet.contains(objArray[counter])); in test_ConstructorLjava_util_SortedSet() 273 for (int counter = startPos; counter < endPos; counter++) in test_subSetLjava_lang_ObjectLjava_lang_Object() 275 aSubSet.contains(objArray[counter])); in test_subSetLjava_lang_ObjectLjava_lang_Object()
|
D | ConcurrentModificationExceptionTest.java | 57 for (int counter = 0; counter < 50; counter++) in test_Constructor() 58 myCollection.add(new Integer(counter)); in test_Constructor()
|
D | Arrays2Test.java | 121 for (int counter = 0; counter < reversedArray.length; counter++) { in test_sort$D() 122 reversedArray[counter] = (reversedArray.length - counter - 1); in test_sort$D() 125 for (int counter = 0; counter < reversedArray.length; counter++) { in test_sort$D() 127 reversedArray[counter] == counter); in test_sort$D() 158 for (int counter = 0; counter < reversedArray.length; counter++) { in test_sort$F() 159 reversedArray[counter] = (reversedArray.length - counter - 1); in test_sort$F() 162 for (int counter = 0; counter < reversedArray.length; counter++) { in test_sort$F() 164 reversedArray[counter] == counter); in test_sort$F()
|
D | IdentityHashMap2Test.java | 92 for (int counter = 0; counter < hmSize; counter++) in test_ConstructorLjava_util_Map() 93 myMap.put(objArray2[counter], objArray[counter]); in test_ConstructorLjava_util_Map() 95 for (int counter = 0; counter < hmSize; counter++) in test_ConstructorLjava_util_Map() 97 .get(objArray2[counter]) == hm2.get(objArray2[counter])); in test_ConstructorLjava_util_Map() 133 for (int counter = 0; counter < hmSize; counter++) in test_clone() 135 .get(objArray2[counter]) == hm2.get(objArray2[counter])); in test_clone()
|
D | HashMapTest.java | 155 for (int counter = 0; counter < hmSize; counter++) in test_ConstructorLjava_util_Map() 156 myMap.put(objArray2[counter], objArray[counter]); in test_ConstructorLjava_util_Map() 158 for (int counter = 0; counter < hmSize; counter++) in test_ConstructorLjava_util_Map() 160 .get(objArray2[counter]) == hm2.get(objArray2[counter])); in test_ConstructorLjava_util_Map() 196 for (int counter = 0; counter < hmSize; counter++) in test_clone() 198 .get(objArray2[counter]) == hm2.get(objArray2[counter])); in test_clone()
|
D | LinkedHashMapTest.java | 123 for (int counter = 0; counter < hmSize; counter++) in test_ConstructorLjava_util_Map() 124 myMap.put(objArray2[counter], objArray[counter]); in test_ConstructorLjava_util_Map() 126 for (int counter = 0; counter < hmSize; counter++) in test_ConstructorLjava_util_Map() 128 .get(objArray2[counter]) == hm2.get(objArray2[counter])); in test_ConstructorLjava_util_Map() 367 for (int counter = 0; counter < hmSize; counter++) in test_clone() 369 .get(objArray2[counter]) == hm2.get(objArray2[counter])); in test_clone()
|
D | HashSetTest.java | 86 for (int counter = 0; counter < objArray.length; counter++) in test_ConstructorLjava_util_Collection() 88 .contains(objArray[counter])); in test_ConstructorLjava_util_Collection()
|
D | IdentityHashMapTest.java | 98 for (int counter = 0; counter < hmSize; counter++) in test_ConstructorLjava_util_Map() 99 myMap.put(objArray2[counter], objArray[counter]); in test_ConstructorLjava_util_Map() 101 for (int counter = 0; counter < hmSize; counter++) in test_ConstructorLjava_util_Map() 103 .get(objArray2[counter]) == hm2.get(objArray2[counter])); in test_ConstructorLjava_util_Map() 137 for (int counter = 0; counter < hmSize; counter++) in test_clone() 139 .get(objArray2[counter]) == hm2.get(objArray2[counter])); in test_clone()
|
D | StringTokenizerTest.java | 115 for (int counter = 0; counter < 5; counter++) { in test_hasMoreTokens()
|
D | LinkedHashSetTest.java | 96 for (int counter = 0; counter < objArray.length; counter++) in test_ConstructorLjava_util_Collection() 98 .contains(objArray[counter])); in test_ConstructorLjava_util_Collection()
|
/libcore/support/src/test/java/tests/support/ |
D | Support_UnmodifiableCollectionTest.java | 78 for (int counter = 0; it.hasNext(); counter++) { in runTest() 82 + counter + " got: " + nextValue, in runTest() 83 nextValue == counter); in runTest() 94 for (int counter = 0; it.hasNext(); counter++) { in runTest() 97 objArray[counter] == it.next()); in runTest() 103 for (int counter = 0; it.hasNext(); counter++) { in runTest() 106 objArray[counter] == it.next()); in runTest()
|
D | Support_ListTest.java | 41 for (int counter = 0; counter < 100; counter++) { in runTest() 43 elem = list.get(counter); in runTest() 46 .equals(new Integer(counter))); in runTest() 117 for (int counter = 0; li.hasNext(); counter++) { in runTest() 121 .equals(new Integer(counter))); in runTest()
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/net/ |
D | PasswordAuthenticationTest.java | 39 for (int counter = password.length - 1; counter >= 0; counter--) in test_ConstructorLjava_lang_String$C() 41 returnedPassword[counter] == password[counter]); in test_ConstructorLjava_lang_String$C()
|
/libcore/luni/src/test/java/libcore/java/util/ |
D | OldTreeSetTest.java | 40 for (int counter = 0; counter < objArray.length; counter++) in test_ConstructorLjava_util_Collection() 42 .contains(objArray[counter])); in test_ConstructorLjava_util_Collection() 187 for (int counter = startPos; counter < endPos; counter++) in test_subSetLjava_lang_ObjectLjava_lang_Object() 189 aSubSet.contains(objArray[counter])); in test_subSetLjava_lang_ObjectLjava_lang_Object()
|
D | OldTreeMapTest.java | 399 for (int counter = 100; counter < 109; counter++) { in test_subMapLjava_lang_ObjectLjava_lang_Object() 401 objArray[counter].toString()).equals(objArray[counter])); in test_subMapLjava_lang_ObjectLjava_lang_Object()
|
/libcore/luni/src/main/java/java/net/ |
D | NetworkInterface.java | 318 for (int counter = 0; counter < interfaces.length; counter++) { in getNetworkInterfacesList() 320 if (done[counter]) { in getNetworkInterfacesList() 325 for (int counter2 = counter; counter2 < interfaces.length; counter2++) { in getNetworkInterfacesList() 329 if (interfaces[counter2].name.startsWith(interfaces[counter].name + ":")) { in getNetworkInterfacesList() 330 interfaces[counter].children.add(interfaces[counter2]); in getNetworkInterfacesList() 331 interfaces[counter2].parent = interfaces[counter]; in getNetworkInterfacesList() 332 interfaces[counter].addresses.addAll(interfaces[counter2].addresses); in getNetworkInterfacesList() 336 result.add(interfaces[counter]); in getNetworkInterfacesList() 337 done[counter] = true; in getNetworkInterfacesList()
|
/libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/ |
D | SHA1PRNG_SecureRandomImpl.java | 142 private transient long counter; field in SHA1PRNG_SecureRandomImpl 181 counter = COUNTER_BASE; in SHA1PRNG_SecureRandomImpl() 370 seed[lastWord] = (int) (counter >>> 32); in engineNextBytes() 371 seed[lastWord + 1] = (int) (counter & 0xFFFFFFFF); in engineNextBytes() 376 seed[lastWord] |= (int) ((counter >>> RIGHT1[n]) & MASK[n]); in engineNextBytes() 377 seed[lastWord + 1] = (int) ((counter >>> RIGHT2[n]) & 0xFFFFFFFF); in engineNextBytes() 378 seed[lastWord + 2] = (int) ((counter << LEFT[n]) | END_FLAGS[n]); in engineNextBytes() 396 counter++; in engineNextBytes() 434 oos.writeLong(counter); 502 counter = ois.readLong();
|
/libcore/luni/src/test/java/tests/security/ |
D | SecureRandomTest.java | 31 private int counter = 0; field in SecureRandomTest 67 random.setSeed(System.currentTimeMillis()+counter); in getRandomBytes() 68 counter++; in getRandomBytes()
|
/libcore/luni/src/test/java/libcore/java/lang/ref/ |
D | FinalizeTest.java | 133 public void createChainedFinalizer(final AtomicInteger counter, final AtomicBoolean keepGoing) { in createChainedFinalizer() argument 136 int count = counter.incrementAndGet(); in createChainedFinalizer() 139 createChainedFinalizer(counter, keepGoing); // recursive! in createChainedFinalizer()
|
/libcore/luni/src/test/java/libcore/java/net/ |
D | OldSocketImplFactoryTest.java | 66 int counter = 0; in setUp() local 69 counter++; in setUp() 74 if(counter == 1) { in setUp()
|
D | OldDatagramSocketImplFactoryTest.java | 85 int counter = 0; in setUp() local 88 counter++; in setUp() 93 if(counter == 1) { in setUp()
|
/libcore/luni/src/test/java/libcore/java/lang/ |
D | OldThreadTest.java | 282 assertTrue(countersYeld.counter == c.counter); in test_yield() 287 public int counter = 0; field in OldThreadTest.Counter 299 counter ++; in run()
|