Searched refs:counter (Results 1 - 25 of 44) sorted by relevance

12

/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DEmptyStackExceptionTest.java34 for (int counter = 0; counter < objArray.length + 1; counter++)
47 for (int counter = 0; counter < objArray.length; counter++) {
48 objArray[counter] = new Integer(counter);
52 for (int counter = 0; counter < objArra
[all...]
H A DArraysTest.java86 for (int counter = 0; counter < arraySize; counter++) {
89 convertedList.get(counter) == objectArray[counter]);
101 for (int counter = 0; counter < arraySize; counter++) {
104 convertedList.get(counter) == myArray[counter]);
[all...]
H A DRandomTest.java65 for (int counter = 0; counter < 100; counter++)
85 for (int counter = 1; counter < randomBytes.length; counter++)
86 if (randomBytes[counter] != firstByte)
102 for (int counter = 0; counter < 100; counter
[all...]
H A DConcurrentModificationExceptionTest.java57 for (int counter = 0; counter < 50; counter++)
58 myCollection.add(new Integer(counter));
H A DTreeSetTest.java66 for (int counter = 0; counter < objArray.length; counter++)
68 .contains(objArray[counter]));
100 for (int counter = 0; counter < objArray.length; counter++)
102 anotherTreeSet.contains(objArray[counter]));
279 for (int counter = startPos; counter < endPo
[all...]
H A DIdentityHashMap2Test.java92 for (int counter = 0; counter < hmSize; counter++)
93 myMap.put(objArray2[counter], objArray[counter]);
95 for (int counter = 0; counter < hmSize; counter++)
97 .get(objArray2[counter]) == hm2.get(objArray2[counter]));
[all...]
H A DArrays2Test.java123 for (int counter = 0; counter < reversedArray.length; counter++) {
124 reversedArray[counter] = (reversedArray.length - counter - 1);
127 for (int counter = 0; counter < reversedArray.length; counter++) {
129 reversedArray[counter] == counter);
[all...]
H A DTimerTest.java405 assertTrue("Multiple tasks should have incremented counter 4 times not "
493 assertTrue("Multiple tasks should have incremented counter 4 times not "
605 assertTrue("Multiple tasks should have incremented counter 24 times not "
728 assertTrue("Multiple tasks should have incremented counter 24 times not "
1031 final AtomicLong counter = new AtomicLong();
1036 counter.incrementAndGet();
1047 assertTrue(counter.get() > 0);
1069 final AtomicLong counter = new AtomicLong();
1074 counter.incrementAndGet();
1091 final AtomicLong counter
1113 private final AtomicLong counter; field in class:TimerTest.IncrementCounterTaskAndPossiblyThrowAfter
1118 IncrementCounterTaskAndPossiblyThrowAfter( AtomicLong counter, int incrementAmount, boolean willThrow) argument
[all...]
H A DStringTokenizerTest.java115 for (int counter = 0; counter < 5; counter++) {
H A DHashSetTest.java92 for (int counter = 0; counter < objArray.length; counter++)
94 .contains(objArray[counter]));
H A DHashMapTest.java160 for (int counter = 0; counter < hmSize; counter++)
161 myMap.put(objArray2[counter], objArray[counter]);
163 for (int counter = 0; counter < hmSize; counter++)
165 .get(objArray2[counter]) == hm2.get(objArray2[counter]));
[all...]
H A DLinkedHashMapTest.java129 for (int counter = 0; counter < hmSize; counter++)
130 myMap.put(objArray2[counter], objArray[counter]);
132 for (int counter = 0; counter < hmSize; counter++)
134 .get(objArray2[counter]) == hm2.get(objArray2[counter]));
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/net/
H A DPasswordAuthenticationTest.java39 for (int counter = password.length - 1; counter >= 0; counter--)
41 returnedPassword[counter] == password[counter]);
/libcore/support/src/test/java/tests/support/
H A DSupport_UnmodifiableCollectionTest.java78 for (int counter = 0; it.hasNext(); counter++) {
82 + counter + " got: " + nextValue,
83 nextValue == counter);
94 for (int counter = 0; it.hasNext(); counter++) {
97 objArray[counter] == it.next());
103 for (int counter = 0; it.hasNext(); counter++) {
106 objArray[counter]
[all...]
H A DSupport_ListTest.java41 for (int counter = 0; counter < 100; counter++) {
43 elem = list.get(counter);
46 .equals(new Integer(counter)));
117 for (int counter = 0; li.hasNext(); counter++) {
121 .equals(new Integer(counter)));
/libcore/jsr166-tests/src/test/java/jsr166/
H A DThreadLocalRandom8Test.java76 LongAdder counter = new LongAdder();
80 counter.reset();
81 r.ints(size).parallel().forEach(x -> counter.increment());
82 assertEquals(size, counter.sum());
91 LongAdder counter = new LongAdder();
95 counter.reset();
96 r.longs(size).parallel().forEach(x -> counter.increment());
97 assertEquals(size, counter.sum());
106 LongAdder counter = new LongAdder();
110 counter
[all...]
/libcore/luni/src/main/java/java/nio/charset/
H A DModifiedUtf8.java38 long counter = 0;
43 counter++;
45 counter++;
48 counter += 2;
50 counter += 3;
55 if (shortLength && counter > 0xffff) {
59 return counter;
/libcore/ojluni/src/main/java/java/text/
H A DCharacterIteratorFieldDelegate.java118 for (int counter = 0; counter < iCount; counter++) {
119 iterators[counter] = ((AttributedString)attributedStrings.
120 get(counter)).getIterator();
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/
H A DSequentialOpTest.java55 AtomicInteger counter = new AtomicInteger();
59 (UnaryOperator<Stream<Integer>>) s -> s.peek(e -> { counter.incrementAndGet(); }),
60 (UnaryOperator<Stream<Integer>>) s -> s.map(id).peek(e -> { counter.incrementAndGet(); }).sequential().map(id),
61 (UnaryOperator<Stream<Integer>>) s -> s.map(id).peek(e -> { counter.incrementAndGet(); }).parallel().map(id),
63 counter.incrementAndGet();
65 (UnaryOperator<Stream<Integer>>) s -> s.parallel().map(id).peek(e -> { counter.incrementAndGet(); }).map(id)
74 counter.set(0);
76 assertEquals(0, counter.get());
79 assertEquals(0, counter.get());
83 assertTrue(data.size() == 0 || counter
[all...]
/libcore/luni/src/test/java/tests/security/
H A DSecureRandomTest.java31 private int counter = 0; field in class:SecureRandomTest
67 random.setSeed(System.currentTimeMillis()+counter);
68 counter++;
/libcore/luni/src/test/java/libcore/java/util/
H A DOldTreeSetTest.java40 for (int counter = 0; counter < objArray.length; counter++)
42 .contains(objArray[counter]));
187 for (int counter = startPos; counter < endPos; counter++)
189 aSubSet.contains(objArray[counter]));
/libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/
H A DSHA1PRNG_SecureRandomImpl.java62 // MASK - mask to select counter's bytes after shift to right
85 // COUNTER_BASE - initial value to set to "counter" before computing "nextBytes(..)";
142 private transient long counter; field in class:SHA1PRNG_SecureRandomImpl
181 counter = COUNTER_BASE;
271 * the current seed with a 64-bit counter appended is used to compute new bits.
272 * The counter is incremented by 1 for each 20-byte output. <BR>
315 // seed bytes < 48 - remaining bytes are enough for all, 8 counter bytes,
317 // 48 < seed bytes < 56 - remaining 9 bytes are for 0x80 and 8 counter bytes
319 // seed bytes > 55 - extra frame contains both counter's bytes
370 seed[lastWord] = (int) (counter >>> 3
[all...]
/libcore/luni/src/test/java/libcore/java/lang/ref/
H A DFinalizeTest.java138 public void createChainedFinalizer(final AtomicInteger counter, final AtomicBoolean keepGoing) { argument
141 int count = counter.incrementAndGet();
144 createChainedFinalizer(counter, keepGoing); // recursive!
/libcore/luni/src/test/java/libcore/java/net/
H A DOldSocketImplFactoryTest.java66 int counter = 0;
69 counter++;
74 if(counter == 1) {
H A DOldDatagramSocketImplFactoryTest.java85 int counter = 0;
88 counter++;
93 if(counter == 1) {

Completed in 961 milliseconds

12