Searched refs:count (Results 151 - 175 of 257) sorted by relevance

1234567891011

/libcore/jsr166-tests/src/test/java/jsr166/
H A DConcurrentSkipListMapTest.java187 int count = 1;
192 ++count;
194 assertEquals(5, count);
206 int count = 1;
211 ++count;
213 assertEquals(5, count);
225 int count = 1;
230 ++count;
232 assertEquals(5, count);
244 int count
[all...]
H A DTreeMapTest.java186 int count = 1;
191 ++count;
193 assertEquals(5, count);
205 int count = 1;
210 ++count;
212 assertEquals(5, count);
224 int count = 1;
229 ++count;
231 assertEquals(5, count);
243 int count
[all...]
/libcore/luni/src/main/native/
H A Dorg_apache_harmony_xml_ExpatParser.cpp620 int count = 0; local
621 while (attributes[count * 2]) count++;
625 parsingContext->attributeCount = count;
639 env->CallVoidMethod(javaParser, startElementMethod, uri, localName, qName, attributesAddress, count);
1244 * @param count number of attributes
1246 static jlong ExpatParser_cloneAttributes(JNIEnv* env, jobject, jlong address, jint count) { argument
1248 count *= 2;
1251 int arraySize = (count + 1) * sizeof(char*);
1253 int stringLengths[count];
[all...]
/libcore/ojluni/src/main/java/java/io/
H A DRandomAccessFile.java473 int count = this.read(b, off + n, len - n);
474 if (count < 0)
476 n += count;
/libcore/ojluni/src/main/java/java/net/
H A DAbstractPlainSocketImpl.java436 * @param count the amount of time to listen for connections
438 protected synchronized void listen(int count) throws IOException { argument
439 socketListen(count);
678 * If the use count goes to -1 then the socket is closed.
770 abstract void socketListen(int count) argument
H A DSocksSocketImpl.java122 int count;
124 count = ((SocketInputStream)in).read(data, received, len - received, remainingMillis(deadlineMillis));
128 if (count < 0)
130 received += count;
H A DPlainSocketImpl.java169 void socketListen(int count) throws IOException { argument
175 Libcore.os.listen(fd, count);
/libcore/ojluni/src/main/java/java/util/
H A DLocale.java2092 int count = 0;
2098 ++count;
2102 if (count == 1) {
2107 ++count;
2111 if (count == 1) {
2113 } else if (count == 2) {
2118 ++count;
2122 if (count == 1) {
2124 } else if (count == 2 || count
[all...]
H A DTimeZone.java456 private static void appendNumber(StringBuilder builder, int count, int value) { argument
458 for (int i = 0; i < count - string.length(); i++) {
/libcore/ojluni/src/main/java/sun/security/util/
H A DDerOutputStream.java94 putLength(out.count);
95 write(out.buf, 0, out.count);
118 write(value.buf, 1, value.count-1);
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/
H A DForEachOpTest.java60 AtomicInteger count = new AtomicInteger(0);
61 s.forEach(e -> count.incrementAndGet());
62 return count.get();
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/zip/
H A DZipOutputStreamTest.java201 int count = 0;
202 while (count != b.length && (r = zis.read(b, count, b.length)) != -1) {
203 count += r;
/libcore/luni/src/test/java/libcore/java/io/
H A DOldReaderTest.java116 @Override public int read(char[] buf, int offset, int count) { argument
/libcore/ojluni/src/main/java/java/lang/
H A DProcessEnvironment.java271 int count = m.size() * 2; // For added '=' and NUL
273 count += entry.getKey().getBytes().length;
274 count += entry.getValue().getBytes().length;
277 byte[] block = new byte[count];
H A DCharacter.java5214 * the text range count as one code point each.
5250 * subarray and the {@code count} argument specifies the
5252 * surrogates within the subarray count as one code point each.
5257 * @param count the length of the subarray in {@code char}s
5261 * {@code count} is negative, or if {@code offset +
5262 * count} is larger than the length of the given array.
5265 public static int codePointCount(char[] a, int offset, int count) { argument
5266 if (count > a.length - offset || offset < 0 || count < 0) {
5269 return codePointCountImpl(a, offset, count);
5272 codePointCountImpl(char[] a, int offset, int count) argument
5374 offsetByCodePoints(char[] a, int start, int count, int index, int codePointOffset) argument
5383 offsetByCodePointsImpl(char[]a, int start, int count, int index, int codePointOffset) argument
[all...]
/libcore/ojluni/src/main/java/sun/misc/
H A DURLClassPath.java613 int count = 0;
622 urls[count++] = ParseUtil.fileToEncodedURL(f);
626 if (urls.length != count) {
627 URL[] tmp = new URL[count];
628 System.arraycopy(urls, 0, tmp, 0, count);
1085 int count = 0;
1098 while(count < size) {
1099 String jarName = jarFiles[count++];
1185 // If the count is unchanged, we are done.
1186 } while(count < jarFilesLis
[all...]
/libcore/xml/src/main/java/org/xmlpull/v1/sax2/
H A DDriver.java376 final int count = pp.getNamespaceCount(depth + 1);
377 for (int i = countPrev; i < count; i++)
430 int count = pp.getNamespaceCount(pp.getDepth() - 1);
432 for (int i = count - 1; i >= countPrev; i--)
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/lang/
H A DSystemTest.java269 int count = 10;
272 while (!ranFinalize && count-- > 0) {
/libcore/luni/src/test/java/libcore/java/lang/reflect/
H A DConstructorTest.java61 int count = constructor.getParameterCount();
62 assertEquals(1, count);
/libcore/luni/src/test/java/libcore/java/nio/channels/
H A DSelectorTest.java60 int count = selector.select();
61 assertEquals(0, count);
/libcore/luni/src/test/java/libcore/java/util/zip/
H A DZipEntryTest.java47 private static String makeString(int count, String s) { argument
49 for (int i = 0; i < count; ++i) {
/libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/
H A DDoubleNodeTest.java135 double[] copy = new double[(int) n.count()];
143 List<Double> l = new ArrayList<>((int) n.count());
H A DIntNodeTest.java135 int[] copy = new int[(int) n.count()];
143 List<Integer> l = new ArrayList<>((int) n.count());
H A DLongNodeTest.java135 long[] copy = new long[(int) n.count()];
143 List<Long> l = new ArrayList<>((int) n.count());
H A DNodeTest.java113 Integer[] copy = new Integer[(int) n.count()];
121 List<Integer> l = new ArrayList<>((int) n.count());

Completed in 1383 milliseconds

1234567891011