/libcore/ojluni/src/test/java/util/stream/testlib/org/openjdk/testlib/java/util/stream/ |
H A D | SpliteratorTestHelper.java | 444 int count = 0; 446 ++count; 450 assertEquals(sizeIfKnown, count); 533 assertTrue(iteration++ < MAXIMUM_STACK_CAPACITY, "Exceeded maximum stack modification count of 1 << 18");
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | CompletableFuture.java | 2365 int count = 0; 2367 ++count; 2368 return count; 2383 int count = 0; // avoid call to getNumberOfDependents in case disabled 2385 ++count; 2388 ((count == 0) ? 2390 "[Not completed, " + count + " dependents]") :
|
H A D | ConcurrentSkipListMap.java | 1624 * number of elements requires traversing them all to count them. 1633 long count = 0; 1636 ++count; 1638 return (count >= Integer.MAX_VALUE) ? Integer.MAX_VALUE : (int) count; 2844 long count = 0; 2849 ++count; 2851 return count >= Integer.MAX_VALUE ? Integer.MAX_VALUE : (int)count;
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/nio/channels/ |
H A D | DatagramChannelTest.java | 1902 int count = 0; 1905 while (total < dataSize && (count = receiver.read(targetBuf)) != -1) { 1906 total = total + count; 2019 int count = 0; 2023 while (total < CAPACITY_NORMAL && (count = channel2.read(targetBuf)) != -1) { 2024 total = total + count;
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | EnumSetTest.java | 127 for (HugeEnumCount count : set) { 128 assertEquals(count, (HugeEnumCount) array[count.ordinal()]); 135 for (HugeEnumCount count : set) { 136 assertEquals(count, (HugeEnumCount) array[count.ordinal()]);
|
H A D | CalendarTest.java | 572 int count = 6; 573 int[] fields = new int[count]; 574 int[] defaults = new int[count];
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/zip/ |
H A D | ZipFileTest.java | 408 assertEquals(6, zfile.stream().count());
|
/libcore/luni/src/test/java/libcore/java/nio/file/ |
H A D | WatchServiceTest.java | 101 assertEquals(expectedEventResult.expectedCount, event.count());
|
/libcore/luni/src/test/java/libcore/java/sql/ |
H A D | OldPreparedStatementTest.java | 2283 public Object getArray(long index, int count) throws SQLException { argument 2287 public Object getArray(long index, int count, Map<String, Class<?>> map) argument 2308 public ResultSet getResultSet(long index, int count) argument 2313 public ResultSet getResultSet(long index, int count, argument
|
H A D | OldStatementTest.java | 790 int count = st.executeUpdate(queries1[i]); 791 assertTrue(count > 0); 1163 // Does not return null on update count > 0 (not a select statement)
|
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | DoublePipeline.java | 449 public final long count() { method in class:DoublePipeline
|
H A D | LongPipeline.java | 427 public final long count() { method in class:LongPipeline
|
H A D | IntPipeline.java | 429 public final long count() { method in class:IntPipeline
|
H A D | ReferencePipeline.java | 527 public final long count() { method in class:ReferencePipeline
|
H A D | StreamSpliterators.java | 165 boolean hasNext = nextToConsume < buffer.count(); 205 while (buffer.count() == 0) {
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/ |
H A D | BidiTest.java | 958 final int count = bi.getRunCount(); 959 for (int i = 0; i < count; i++) {
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | JSR166TestCase.java | 680 int count = Thread.enumerate(survivors); 681 for (int i = 0; i < count; i++) {
|
H A D | ThreadPoolExecutorSubclassTest.java | 766 final int count = 5; 780 for (int i = 0; i < count; i++) 793 assertEquals(count - poolSize, queuedTasks.size());
|
H A D | ThreadPoolExecutorTest.java | 651 final int count = 5; 665 for (int i = 0; i < count; i++) 678 assertEquals(count - poolSize, queuedTasks.size());
|
/libcore/ojluni/src/main/java/java/util/logging/ |
H A D | LogManager.java | 159 // count to allow for cases where the same listener is registered many times. 431 // increment the registration count if already registered 470 // remove from map if registration count is 1, otherwise 471 // just decrement its count 1109 // The same config gives us a better decreased weak ref count 1110 // than increased weak ref count in the LoggerWeakRefLeak test. 1446 int count = entry.getValue().intValue(); 1447 for (int i = 0; i < count; i++) {
|
/libcore/ojluni/src/main/native/ |
H A D | jni_util.c | 913 jint count) 918 for (i=0; i<count; i++) { 912 JNU_CopyObjectArray(JNIEnv *env, jobjectArray dst, jobjectArray src, jint count) argument
|
/libcore/luni/src/main/native/ |
H A D | libcore_io_Linux.cpp | 1872 size_t count = 0; // Some trailing array elements may be irrelevant. (See below.) local 1882 fds[count].fd = jniGetFDFromFileDescriptor(env, javaFd.get()); 1883 fds[count].events = env->GetShortField(javaStruct.get(), eventsFid); 1884 ++count; 1888 for (size_t i = 0; i < count; ++i) { 1897 rc = poll(fds.get(), count, timeoutMs); 1934 for (size_t i = 0; i < count; ++i) {
|
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | LocaleTest.java | 214 int count = 0; 217 ++count; 220 assertEquals(1, count);
|
/libcore/ojluni/src/main/java/java/io/ |
H A D | ObjectInputStream.java | 2342 int count = read(b, off + n, len - n); 2343 if (count < 0) { 2346 n += count;
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | Arrays.java | 129 * Checks that the range described by {@code offset} and {@code count} doesn't exceed 133 public static void checkOffsetAndCount(int arrayLength, int offset, int count) { argument 134 if ((offset | count) < 0 || offset > arrayLength || arrayLength - offset < count) { 136 count);
|