Searched refs:size (Results 176 - 200 of 628) sorted by relevance

1234567891011>>

/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DWeakHashMapTest.java45 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 DEnumMapTest.java390 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 DAbstractListTest.java52 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 DRefSortedMap.java114 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/dalvik/system/
H A DSocketTaggingTest.java101 assertEquals(1, tagger.getLiveDescriptors().size());
111 assertEquals(1, tagger.getLiveDescriptors().size());
121 assertEquals(1, tagger.getLiveDescriptors().size());
131 assertEquals(1, tagger.getLiveDescriptors().size());
141 assertEquals(1, tagger.getLiveDescriptors().size());
/libcore/ojluni/src/main/java/java/security/cert/
H A DCertificateRevokedException.java183 * @serialData the size of the extensions map (int), followed by all of
194 // Write out the size (number of mappings) of the extensions map
195 oos.writeInt(extensions.size());
224 // Read in the size (number of mappings) of the extensions map
226 int size = ois.readInt();
227 if (size == 0) {
230 extensions = new HashMap<String, Extension>(size);
234 for (int i = 0; i < size; i++) {
/libcore/ojluni/src/main/java/java/lang/reflect/
H A DArray.java728 * Equivalent to {@code new componentType[size]}.
733 * if {@code size < 0}
735 private static Object newArray(Class<?> componentType, int size) throws NegativeArraySizeException { argument
737 return createObjectArray(componentType, size);
739 return new char[size];
741 return new int[size];
743 return new byte[size];
745 return new boolean[size];
747 return new short[size];
749 return new long[size];
[all...]
/libcore/ojluni/src/main/java/java/util/zip/
H A DZipInputStream.java128 remaining = entry.size;
324 e.size = get32(tmpbuf, LOCLEN);
332 if (e.csize == ZIP64_MAGICVAL || e.size == ZIP64_MAGICVAL) {
339 // compressed file size fields
342 // rare, it's possible the entry size happens to be
347 e.size = get64(bb, off);
387 e.size = get64(tmpbuf, ZIP64_EXTLEN - ZIP64_EXTCRC);
393 e.size = get64(tmpbuf, ZIP64_EXTLEN);
401 e.size = get32(tmpbuf, EXTLEN - EXTCRC);
407 e.size
[all...]
H A DInflaterInputStream.java77 * buffer size.
80 * @param size the input buffer size
81 * @exception IllegalArgumentException if size is <= 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.
105 * Creates a new input stream with a default decompressor and buffer size
[all...]
/libcore/jsr166-tests/src/test/java/jsr166/
H A DTreeMapTest.java47 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 DConcurrentSkipListSubMapTest.java48 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/luni/src/test/java/libcore/java/util/
H A DOldTreeMapTest.java108 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 DOldTreeSetTest.java38 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/ojluni/src/main/java/java/nio/
H A DDirectByteBuffer.java388 int size = rem >> 1;
392 size,
393 size,
470 int size = rem >> 1;
474 size,
475 size,
552 int size = rem >> 2;
556 size,
557 size,
634 int size
[all...]
H A DBuffer.java195 * The log base 2 of the element size of this buffer. Each typed subclass
556 static void checkBounds(int off, int len, int size) { // package-private argument
557 if ((off | len | (off + len) | (size - (off + len))) < 0)
560 "off=" + off + ", len=" + len + " out of bounds (size=" + size + ")");
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/jar/
H A DAttributesTest.java88 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 DTreeSet.java206 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 DAbstractMap.java81 * <p>This implementation returns <tt>entrySet().size()</tt>.
83 public int size() { method in class:AbstractMap
84 return entrySet().size();
90 * <p>This implementation returns <tt>size() == 0</tt>.
93 return size() == 0;
103 * implementation requires linear time in the size of the map.
133 * implementation requires linear time in the size of the map; many
164 * implementation requires linear time in the size of the map; many
216 * size of the map; many implementations will override this method.
307 * 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 DDistinctOpTest.java89 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 DJSONArray.java129 return values.size();
262 while (values.size() <= index) {
293 throw new JSONException("Index " + index + " out of range [0.." + values.size() + ")");
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 DVMRuntime.java115 * be resized so that (size of live objects) / (size of heap) is
125 * be resized so that (size of live objects) / (size of heap) is
188 public long setMinimumHeapSize(long size) { argument
221 public boolean trackExternalAllocation(long size) { argument
230 public void trackExternalFree(long size) {} argument
261 * Returns an array of at least minLength, but potentially larger. The increased size comes from
275 * up to the maximum heap size.
/libcore/luni/src/test/java/libcore/java/util/zip/
H A DZip64FileTest.java43 assertEquals(65550, zf.size());
71 assertEquals(5, zf.size());
94 assertEquals(1, zf.size());
/libcore/luni/src/test/java/libcore/util/
H A DCollectionUtilsTest.java43 assertEquals(4, refs.size());
48 assertEquals(3, refs.size());
59 assertEquals(2, refs.size());
/libcore/ojluni/src/main/java/java/lang/
H A DProcessImpl.java70 int size = args.length; // For added NUL bytes
73 size += args[i].length;
75 byte[] argBlock = new byte[size];
/libcore/ojluni/src/main/java/sun/security/provider/certpath/
H A DAdjacencyList.java140 if (theList.get(v.getIndex()).size() != 0)
176 if (possibles.size() == 1) {
209 if (theList.get(v.getIndex()).size() != 0) {

Completed in 1122 milliseconds

1234567891011>>