/libcore/luni/src/test/java/libcore/javax/net/ssl/ |
H A D | KeyStoreBuilderParametersTest.java | 43 assertEquals(1, ksbp.getParameters().size()); 67 assertEquals(2, ksbp.getParameters().size());
|
/libcore/ojluni/src/main/java/java/io/ |
H A D | ExpiringCache.java | 68 return size() > MAX_ENTRIES; 116 String[] keys = new String[keySet.size()];
|
/libcore/ojluni/src/main/java/java/lang/ |
H A D | ThreadLocal.java | 295 private int size = 0; field in class:ThreadLocal.ThreadLocalMap 298 * The next size value at which to resize. 332 size = 1; 359 size++; 444 int sz = ++size; 558 size--; 570 size--; 628 * Re-pack and/or re-size the table. First scan the entire 630 * shrink the size of the table, double the table size [all...] |
H A D | ProcessEnvironment.java | 228 public int size() {return m.size();} method in class:ProcessEnvironment.StringEnvironment 270 int count = m.size() * 2; // For added '=' and NUL 290 envc[0] = m.size(); 324 public int size() {return s.size();} method in class:ProcessEnvironment.StringEntrySet 366 public int size() {return c.size();} method in class:ProcessEnvironment.StringValues 393 public int size() {return s.size();} method in class:ProcessEnvironment.StringKeySet [all...] |
/libcore/ojluni/src/main/java/java/security/cert/ |
H A D | CertPathValidatorException.java | 145 * certPath.getCertificates().size()) } 168 * certPath.getCertificates().size()) } 182 (certPath != null && index >= certPath.getCertificates().size())) { 241 (certPath != null && index >= certPath.getCertificates().size())) {
|
/libcore/ojluni/src/main/java/sun/security/provider/certpath/ |
H A D | PKIXMasterCertPathValidator.java | 73 int cpSize = reversedCertList.size(); 107 for (int j = 0; j < certPathCheckers.size(); j++) {
|
/libcore/ojluni/src/main/native/ |
H A D | FileDispatcherImpl.c | 145 jobject fdo, jlong size) 148 ftruncate64(fdval(env, fdo), size), 164 jboolean block, jlong pos, jlong size, 173 if (size == (jlong)java_lang_Long_MAX_VALUE) { 176 fl.l_len = (off64_t)size; 202 jobject fdo, jlong pos, jlong size) 210 if (size == (jlong)java_lang_Long_MAX_VALUE) { 213 fl.l_len = (off64_t)size; 144 FileDispatcherImpl_truncate0(JNIEnv *env, jobject this, jobject fdo, jlong size) argument 163 FileDispatcherImpl_lock0(JNIEnv *env, jobject this, jobject fdo, jboolean block, jlong pos, jlong size, jboolean shared) argument 201 FileDispatcherImpl_release0(JNIEnv *env, jobject this, jobject fdo, jlong pos, jlong size) argument
|
/libcore/support/src/test/java/org/apache/harmony/security/tests/support/ |
H A D | SystemScope.java | 73 * @see java.security.IdentityScope#size() 75 public int size() { method in class:SystemScope 76 return names.size();
|
/libcore/support/src/test/java/tests/support/ |
H A D | Support_UnmodifiableCollectionTest.java | 86 // size 88 "UnmodifiableCollectionTest - returned wrong size. Wanted 100, got: " 89 + col.size(), col.size() == 100);
|
/libcore/dom/src/test/java/org/w3c/domts/ |
H A D | DOMTestInnerClass.java | 177 public int size(Collection collection) { method in class:DOMTestInnerClass 178 return test.size(collection); 181 public int size(NamedNodeMap collection) { method in class:DOMTestInnerClass 182 return test.size(collection); 185 public int size(NodeList collection) { method in class:DOMTestInnerClass 186 return test.size(collection);
|
/libcore/luni/src/test/java/tests/java/sql/ |
H A D | StressTest.java | 113 maxConnections, vc.size()); 134 assertEquals("Unable to create a connection", numTasks, vc.size()); 166 for (int i = 0; i < vc.size(); ++i) { 207 assertEquals("Unable to create a connection", numConnections, vc.size()); 263 for (; i < vc.size(); ++i) { 267 assertEquals("Unable to close a connection", vc.size(), i);
|
/libcore/ojluni/src/main/java/sun/nio/ch/ |
H A D | FileLockTable.java | 152 checkList(list, fl.position(), fl.size()); 183 while (index < list.size()) { 204 while (index < list.size()) { 235 for (int index=0; index<list.size(); index++) { 248 private void checkList(List<FileLockReference> list, long position, long size) argument 254 if (fl != null && fl.overlaps(position, size))
|
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
H A D | CollectionAndMapModifyStreamTest.java | 79 ArrayBlockingQueue<Integer> arrayBlockingQueue = new ArrayBlockingQueue<>(content.size()); 90 Object[][] params = new Object[collections.size()][]; 91 for (int i = 0; i < collections.size(); i++) { 104 assertEquals(result.length, c.size()); 126 // maps.put(TreeMap.class.getName() + ".headMap()", () -> new TreeMap<>(content).headMap(content.size() - 1)); 127 // maps.put(TreeMap.class.getName() + ".descendingMap().headMap()", () -> new TreeMap<>(content).descendingMap().tailMap(content.size() - 1, false)); 134 Object[][] params = new Object[maps.size()][]; 166 assertEquals(result.length, c.size());
|
H A D | ToArrayOpTest.java | 66 // Retain the size of the source 70 assertTrue(objects.length == data.size()); 75 // Retain the size of the source 79 assertTrue(objects.length == data.size()); 84 // Double the size of the source 85 // Fixed size optimizations will not be used 90 assertTrue(objects.length == data.size() * 2); 95 // Reduce the size of the source 96 // Fixed size optimizations will not be used 130 if (data.size() > [all...] |
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | Streams.java | 120 // Ensure ranges of size > Integer.MAX_VALUE report the correct size 138 long size = estimateSize(); 139 return size <= 1 142 : new RangeIntSpliterator(from, from = from + splitPoint(size), 0); 146 * The spliterator size below which the spliterator will be split 147 * at the mid-point to produce balanced splits. Above this size the 166 * size is above BALANCED_SPLIT_THRESHOLD. 170 private int splitPoint(long size) { argument 171 int d = (size < BALANCED_SPLIT_THRESHOL 294 splitPoint(long size) argument [all...] |
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | ArraysTest.java | 4271 PrimitiveIntArrayList(int size) { argument 4272 array = new int[size]; 4289 PrimitiveLongArrayList(int size) { argument 4290 array = new long[size]; 4307 PrimitiveDoubleArrayList(int size) { argument 4308 array = new double[size]; 4555 private void test_parallelSort$B(int size) { argument 4556 if (size % 256 != 0) { 4557 fail("test_parallelSort$B size needs to be dividable by 256"); 4559 int mul256Count = size / 25 4591 test_parallelSort$BII(int size) argument 4665 test_parallelSort$C(int size) argument 4691 test_parallelSort$CII(int size) argument 4766 test_parallelSort$S(int size) argument 4792 test_parallelSort$SII(int size) argument 4867 test_parallelSort$I(int size) argument 4893 test_parallelSort$III(int size) argument 4968 test_parallelSort$J(int size) argument 4993 test_parallelSort$JII(int size) argument 5068 test_parallelSort$D(int size) argument 5094 test_parallelSort$DII(int size) argument 5169 test_parallelSort$F(int size) argument 5195 test_parallelSort$FII(int size) argument 5271 test_parallelSort$Ljava_lang_Comparable(int size) argument 5306 test_parallelSort$Ljava_lang_ComparableII(int size) argument 5382 test_parallelSort$Ljava_lang_ObjectLjava_util_Comparator(int size) argument 5417 test_parallelSort$Ljava_lang_ObjectLjava_util_ComparatorII(int size) argument [all...] |
H A D | TreeMapExtendTest.java | 81 assertEquals(0, treeMap.size()); 122 assertEquals(0, treeMap.values().size()); 134 assertEquals(tm.size(), treeMap.size()); 155 assertEquals(subMap_default.size(), treeMap.size()); 164 assertEquals(0, tm.size()); 177 assertEquals(0, subMap_default.size()); 327 assertEquals(9, entrySet.size()); 331 assertEquals(8, entrySet.size()); [all...] |
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | PriorityQueueTest.java | 40 * Returns a new queue of given size containing consecutive 51 assertEquals(n, q.size()); 59 assertEquals(0, new PriorityQueue(SIZE).size()); 147 * size changes when elements added and removed 152 assertEquals(SIZE - i, q.size()); 156 assertEquals(i, q.size()); 210 assertEquals(i, q.size()); 361 assertEquals(0, q.size()); 396 assertEquals(SIZE - i, q.size()); 409 assertEquals(SIZE - i, q.size()); [all...] |
/libcore/ojluni/src/main/java/java/util/ |
H A D | ArraysParallelSortHelpers.java | 39 * if array size is small, just use a sequential quicksort (via Arrays.sort) 116 final int base, size, wbase, gran; field in class:ArraysParallelSortHelpers.FJObject.Sorter 118 Sorter(CountedCompleter<?> par, T[] a, T[] w, int base, int size, argument 122 this.a = a; this.w = w; this.base = base; this.size = size; 130 int b = this.base, n = this.size, wb = this.wbase, g = this.gran; 238 final int base, size, wbase, gran; field in class:ArraysParallelSortHelpers.FJByte.Sorter 240 int size, int wbase, int gran) { 242 this.a = a; this.w = w; this.base = base; this.size = size; 239 Sorter(CountedCompleter<?> par, byte[] a, byte[] w, int base, int size, int wbase, int gran) argument 349 final int base, size, wbase, gran; field in class:ArraysParallelSortHelpers.FJChar.Sorter 350 Sorter(CountedCompleter<?> par, char[] a, char[] w, int base, int size, int wbase, int gran) argument 460 final int base, size, wbase, gran; field in class:ArraysParallelSortHelpers.FJShort.Sorter 461 Sorter(CountedCompleter<?> par, short[] a, short[] w, int base, int size, int wbase, int gran) argument 571 final int base, size, wbase, gran; field in class:ArraysParallelSortHelpers.FJInt.Sorter 572 Sorter(CountedCompleter<?> par, int[] a, int[] w, int base, int size, int wbase, int gran) argument 682 final int base, size, wbase, gran; field in class:ArraysParallelSortHelpers.FJLong.Sorter 683 Sorter(CountedCompleter<?> par, long[] a, long[] w, int base, int size, int wbase, int gran) argument 793 final int base, size, wbase, gran; field in class:ArraysParallelSortHelpers.FJFloat.Sorter 794 Sorter(CountedCompleter<?> par, float[] a, float[] w, int base, int size, int wbase, int gran) argument 904 final int base, size, wbase, gran; field in class:ArraysParallelSortHelpers.FJDouble.Sorter 905 Sorter(CountedCompleter<?> par, double[] a, double[] w, int base, int size, int wbase, int gran) argument [all...] |
H A D | WeakHashMap.java | 74 * is possible for the <tt>size</tt> method to return smaller values over 164 private int size; field in class:WeakHashMap 167 * The next size value at which to resize (capacity * load factor). 254 this(Math.max((int) (m.size() / DEFAULT_LOAD_FACTOR) + 1, 318 size--; 342 public int size() { method in class:WeakHashMap 343 if (size == 0) 346 return size; 356 return size() == 0; 447 if (++size > 859 public int size() { method in class:WeakHashMap.KeySet 908 public int size() { method in class:WeakHashMap.Values 961 public int size() { method in class:WeakHashMap.EntrySet [all...] |
H A D | Collections.java | 169 Arrays.sort(((ArrayList) list).elementData, 0, list.size()); 238 Arrays.sort(((ArrayList) list).elementData, 0, list.size(), (Comparator) c); 274 * element greater than the key, or <tt>list.size()</tt> if all 285 if (list instanceof RandomAccess || list.size()<BINARYSEARCH_THRESHOLD) 294 int high = list.size()-1; 315 int high = list.size()-1; 378 * element greater than the key, or <tt>list.size()</tt> if all 392 if (list instanceof RandomAccess || list.size()<BINARYSEARCH_THRESHOLD) 400 int high = l.size()-1; 419 int high = l.size() 1103 public int size() {return c.size();} method in class:Collections.UnmodifiableCollection 1434 public int size() {return m.size();} method in class:Collections.UnmodifiableMap 1859 public int size() { method in class:Collections.SynchronizedCollection 2301 public int size() { method in class:Collections.SynchronizedMap 2621 public int size() { return c.size(); } method in class:Collections.CheckedCollection 3055 public int size() { return m.size(); } method in class:Collections.CheckedMap 3187 public int size() { return s.size(); } method in class:Collections.CheckedMap.CheckedEntrySet 3595 public int size() {return 0;} method in class:Collections.EmptySet 3675 public int size() {return 0;} method in class:Collections.EmptyList 3770 public int size() {return 0;} method in class:Collections.EmptyMap 3956 public int size() {return 1;} method in class:Collections.SingletonSet 4005 public int size() {return 1;} method in class:Collections.SingletonList 4068 public int size() {return 1;} method in class:Collections.SingletonMap 4205 public int size() { method in class:Collections.CopiesList 4656 public int size() { return m.size(); } method in class:Collections.SetFromMap 4736 public int size() { return q.size(); } method in class:Collections.AsLIFOQueue [all...] |
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/io/ |
H A D | BufferedInputStreamTest.java | 118 // Create buffer with hald size of file and fill it. 155 MockBufferedInputStream(InputStream is, int size) throws IOException { argument 156 super(is, size); 391 int size = 2 395 byte[] contents = new byte[size]; 399 if (pos >= size) { 407 if (pos >= size) { 421 return size - pos;
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/org/xml/sax/helpers/ |
H A D | ParserAdapterTest.java | 225 assertEquals(logger.size(), 1); 231 assertEquals(logger.size(), 2); 243 assertEquals(logger.size(), 1); 255 assertEquals(logger.size(), 1); 303 assertEquals(logger.size(), 1); 317 assertEquals(logger.size(), 1); 329 assertEquals(logger.size(), 1);
|
/libcore/ojluni/src/main/java/sun/security/jca/ |
H A D | ProviderList.java | 101 int n = list.size(); 115 ProviderConfig[] configs = new ProviderConfig[providerList.size() - 1]; 143 public int size() { 223 public int size() { method in class:ProviderList 426 } else if ((services != null) && (services.size() > index)) { 460 public int size() { method in class:ProviderList.ServiceList 463 n = services.size(); 473 // override isEmpty() and iterator() to not call size()
|
/libcore/ojluni/src/main/java/sun/security/x509/ |
H A D | NameConstraintsExtension.java | 93 for (int i = 0; i < excluded.size(); i++) { 103 for (int i = 0; i < permitted.size(); i++) { 470 for (int i = 0; i < altNames.size(); i++) { 496 if (excluded != null && excluded.size() > 0) { 498 for (int i = 0; i < excluded.size(); i++) { 524 if (permitted != null && permitted.size() > 0) { 528 for (int i = 0; i < permitted.size(); i++) {
|