/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | WeakHashMapTest.java | 45 public int size() { method in class:WeakHashMapTest.MockMap 125 assertEquals("Size should be 0", 0, map.size()); 189 assertTrue("Incorrect number of entries returned--wanted 100, got: " + entrySet.size(), 190 entrySet.size() == 100); 211 } while (entrySet.size() != 99 && 214 assertEquals("Incorrect number of keys returned after gc,", 99, entrySet.size()); 243 assertEquals("null key was removed", 1, map.size()); 253 assertEquals("Size should be 0", 0, map.size()); 275 assertEquals("Size should be 99 after remove", 99, whm.size()); 279 * java.util.WeakHashMap#size() [all...] |
H A D | EnumMapTest.java | 390 assertEquals("Wrong size", 1, set.size()); 392 assertEquals("Wrong size", 0, set.size()); 407 assertEquals("Wrong size", 1, set.size()); 418 assertEquals("Wrong size", 1, set.size()); 472 assertEquals("Wrong size", 1, set.size()); [all...] |
H A D | AbstractListTest.java | 52 public int size() { method in class:AbstractListTest.SimpleList 53 return this.arrayList.size(); 120 assertEquals(2, list.size()); 227 public int size() { method in class:AbstractListTest.MockArrayList 228 return list.size(); 362 al1.listIterator(al1.size() + 1); 381 public int size() { method in class:AbstractListTest.MockRemoveFailureArrayList 418 List<Integer> sub = holder.subList(0, holder.size()); 421 sub.size(); 496 sub.size(); [all...] |
H A D | PriorityQueueTest.java | 127 assertEquals(array.length - 1, integerQueue.size()); 136 for (int i = 0; i < integerQueue.size(); i++) { 182 * java.util.PriorityQueue.size() 186 assertEquals(0, integerQueue.size()); 191 assertEquals(array.length, integerQueue.size()); 200 assertEquals(0, queue.size()); 210 assertEquals(0, queue.size()); 221 assertEquals(0, queue.size()); 227 assertEquals(0, queue.size()); 258 assertEquals(0, integerQueue.size()); [all...] |
H A D | RefSortedMap.java | 114 int offset = SubMap.this.size() > 0 ? 116 entries.size(); 122 return offset + 1 < entries.size() 151 public int size() { 182 if (-idx - 1 >= entries.size() || !isInRange(entries.get(-idx - 1).getKey())) { 287 return entries.get(entries.size() - 1).getKey(); 372 public int size() { method in class:RefSortedMap 373 return entries.size(); 382 stream.writeInt(size()); 395 int size [all...] |
/libcore/luni/src/test/java/libcore/java/nio/channels/ |
H A D | AsynchronousFileChannelTest.java | 62 assertEquals(0, channel.size()); 135 private static File createTemporaryFile(int size) throws IOException { argument 136 if (size % 256 != 0) { 137 throw new IllegalArgumentException("size % 256 != 0: " + size); 145 while (bytesWritten < size) { 183 assertEquals(256, afc.size()); 393 assertEquals(9, afc.size()); 405 assertEquals(11, afc.size()); 415 assertEquals(15, afc.size()); [all...] |
/libcore/ojluni/src/main/java/java/security/cert/ |
H A D | CertificateRevokedException.java | 185 * @serialData the size of the extensions map (int), followed by all of 196 // Write out the size (number of mappings) of the extensions map 197 oos.writeInt(extensions.size()); 226 // Read in the size (number of mappings) of the extensions map 228 int size = ois.readInt(); 229 if (size == 0) { 232 extensions = new HashMap<String, Extension>(size); 236 for (int i = 0; i < size; i++) {
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | TreeMapTest.java | 47 assertEquals(5, map.size()); 57 assertEquals(0, map.size()); 169 assertEquals(5, s.size()); 259 assertEquals(5, s.size()); 273 assertEquals(5, s.size()); 292 assertEquals(5, s.size()); 340 assertEquals(5, empty.size()); 354 assertEquals(4, map.size()); 557 * size returns the correct values 562 assertEquals(0, empty.size()); [all...] |
H A D | ConcurrentSkipListSubMapTest.java | 48 assertEquals(7, map.size()); 64 assertEquals(5, map.size()); 86 assertEquals(0, map.size()); 163 assertEquals(5, s.size()); 193 assertEquals(5, s.size()); 249 assertEquals(5, s.size()); 269 assertEquals(5, empty.size()); 338 assertEquals(4, map.size()); 350 assertEquals(4, map.size()); 353 assertEquals(4, map.size()); [all...] |
/libcore/ojluni/src/main/java/sun/invoke/util/ |
H A D | Wrapper.java | 81 static int format(int kind, int size, int slots) { argument 83 assert((size & (size-1)) == 0); // power of two 84 assert((kind == SIGNED) ? (size > 0) : 85 (kind == UNSIGNED) ? (size > 0) : 86 (kind == FLOATING) ? (size == 32 || size == 64) : 88 assert((slots == 2) ? (size == 64) : 89 (slots == 1) ? (size <= 32) : 91 return kind | (size << SIZE_SHIF 101 signed(int size) argument 102 unsigned(int size) argument 103 floating(int size) argument [all...] |
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | OldTreeMapTest.java | 108 assertTrue("Map is incorrect size", myTreeMap.size() == objArray.length); 214 assertEquals("Returned map of incorrect size", 3, head.size()); 250 assertEquals(0, smap.size()); 253 assertEquals(0, keySet.size()); 256 assertEquals(0, entrySet.size()); 259 assertEquals(0, valueCollection.size()); 286 assertEquals(0, treemap.headMap(null).size()); 348 assertTrue("Map incorrect size afte [all...] |
H A D | OldTreeSetTest.java | 38 assertTrue("TreeSet incorrect size", 39 myTreeSet.size() == objArray.length); 77 assertTrue("Added existing element", ts.size() == objArray.length + 1); 96 assertTrue("Incorrect size after add", s.size() == ts.size()); 138 assertEquals("Returned set of incorrect size", 100, s.size()); 186 aSubSet.size() == (endPos - startPos)); 224 assertEquals("Returned set of incorrect size", 10 [all...] |
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/jar/ |
H A D | AttributesTest.java | 88 assertEquals(4, entrySet.size()); 130 assertEquals(4, s.size()); 176 * java.util.jar.Attributes#size() 179 assertEquals("Incorrect size returned", 4, a.size()); 181 assertEquals(0, a.size()); 256 assertEquals(1, attribute.size()); 263 assertEquals(1, attribute.size()); 268 assertEquals(2, attribute.size());
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | TreeSet.java | 206 public int size() { method in class:TreeSet 207 return m.size(); 300 if (m.size()==0 && c.size() > 0 && 491 * (Object), followed by the size of the set (the number of 505 // Write out size 506 s.writeInt(m.size()); 530 // Read in size 531 int size = s.readInt(); 533 tm.readTreeSet(size, [all...] |
H A D | AbstractMap.java | 82 * This implementation returns <tt>entrySet().size()</tt>. 84 public int size() { method in class:AbstractMap 85 return entrySet().size(); 92 * This implementation returns <tt>size() == 0</tt>. 95 return size() == 0; 106 * implementation requires linear time in the size of the map. 137 * implementation requires linear time in the size of the map; many 169 * implementation requires linear time in the size of the map; many 223 * size of the map; many implementations will override this method. 336 * map's <tt>entrySet()</tt> iterator. The <tt>size</t [all...] |
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
H A D | DistinctOpTest.java | 89 assertTrue((data.size() > 0) ? result.size() > 0 : result.size() == 0); 90 assertTrue(result.size() <= data.size()); 125 List::size); 195 assertEquals(l.size(), 1);
|
/libcore/json/src/main/java/org/json/ |
H A D | JSONArray.java | 129 return values.size(); 262 while (values.size() <= index) { 293 throw new JSONException("Index " + index + " out of range [0.." + values.size() + ")", e); 302 if (index < 0 || index >= values.size()) { 313 if (index < 0 || index >= values.size()) { 547 int length = Math.min(names.length(), values.size()); 568 for (int i = 0, size = values.size(); i < size; i++) {
|
/libcore/libart/src/main/java/dalvik/system/ |
H A D | VMRuntime.java | 129 * be resized so that (size of live objects) / (size of heap) is 139 * be resized so that (size of live objects) / (size of heap) is 199 public long setMinimumHeapSize(long size) { argument 232 public boolean trackExternalAllocation(long size) { argument 241 public void trackExternalFree(long size) {} argument 297 * Returns an array of at least minLength, but potentially larger. The increased size comes from 313 * up to the maximum heap size.
|
/libcore/luni/src/test/java/libcore/java/util/zip/ |
H A D | Zip64FileTest.java | 43 assertEquals(65550, zf.size()); 71 assertEquals(5, zf.size()); 94 assertEquals(1, zf.size());
|
/libcore/luni/src/test/java/libcore/libcore/util/ |
H A D | CollectionUtilsTest.java | 45 assertEquals(4, refs.size()); 50 assertEquals(3, refs.size()); 61 assertEquals(2, refs.size());
|
/libcore/ojluni/src/main/java/java/lang/ |
H A D | ProcessImpl.java | 70 int size = args.length; // For added NUL bytes 73 size += args[i].length; 75 byte[] argBlock = new byte[size];
|
/libcore/ojluni/src/main/java/java/nio/ |
H A D | Buffer.java | 198 * The log base 2 of the element size of this buffer. Each typed subclass 584 static void checkBounds(int off, int len, int size) { // package-private argument 585 if ((off | len | (off + len) | (size - (off + len))) < 0) 588 "off=" + off + ", len=" + len + " out of bounds (size=" + size + ")");
|
/libcore/ojluni/src/main/java/java/util/zip/ |
H A D | InflaterInputStream.java | 77 * buffer size. 80 * @param size the input buffer size 81 * @exception IllegalArgumentException if {@code size <= 0} 83 public InflaterInputStream(InputStream in, Inflater inf, int size) { argument 87 } else if (size <= 0) { 88 throw new IllegalArgumentException("buffer size <= 0"); 91 buf = new byte[size]; 96 * default buffer size. 108 * Creates a new input stream with a default decompressor and buffer size [all...] |
/libcore/ojluni/src/main/java/sun/nio/ch/ |
H A D | ServerSocketAdaptor.java | 185 public void setReceiveBufferSize(int size) throws SocketException { argument 186 // size 0 valid for ServerSocketChannel, invalid for ServerSocket 187 if (size <= 0) 188 throw new IllegalArgumentException("size cannot be 0 or negative"); 190 ssc.setOption(StandardSocketOptions.SO_RCVBUF, size);
|
/libcore/ojluni/src/main/java/sun/security/provider/certpath/ |
H A D | AdjacencyList.java | 140 if (theList.get(v.getIndex()).size() != 0) 176 if (possibles.size() == 1) { 209 if (theList.get(v.getIndex()).size() != 0) {
|