Searched refs:size (Results 226 - 250 of 667) sorted by relevance

1234567891011>>

/libcore/support/src/test/java/org/apache/harmony/security/tests/support/
H A DSystemScope.java73 * @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 DSupport_UnmodifiableCollectionTest.java86 // 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 DDOMTestInnerClass.java177 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 DStressTest.java113 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 DFileLockTable.java152 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 DCollectionAndMapModifyStreamTest.java79 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 DToArrayOpTest.java66 // 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 DStreams.java120 // 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...]
H A DReduceOps.java74 public void begin(long size) {
112 public void begin(long size) {
163 public void begin(long size) {
214 public void begin(long size) {
252 public void begin(long size) {
294 public void begin(long size) {
350 public void begin(long size) {
388 public void begin(long size) {
430 public void begin(long size) {
486 public void begin(long size) {
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DArraysTest.java4274 PrimitiveIntArrayList(int size) { argument
4275 array = new int[size];
4292 PrimitiveLongArrayList(int size) { argument
4293 array = new long[size];
4310 PrimitiveDoubleArrayList(int size) { argument
4311 array = new double[size];
4558 private void test_parallelSort$B(int size) { argument
4559 if (size % 256 != 0) {
4560 fail("test_parallelSort$B size needs to be dividable by 256");
4562 int mul256Count = size / 25
4594 test_parallelSort$BII(int size) argument
4668 test_parallelSort$C(int size) argument
4694 test_parallelSort$CII(int size) argument
4769 test_parallelSort$S(int size) argument
4795 test_parallelSort$SII(int size) argument
4870 test_parallelSort$I(int size) argument
4896 test_parallelSort$III(int size) argument
4971 test_parallelSort$J(int size) argument
4996 test_parallelSort$JII(int size) argument
5071 test_parallelSort$D(int size) argument
5097 test_parallelSort$DII(int size) argument
5172 test_parallelSort$F(int size) argument
5198 test_parallelSort$FII(int size) argument
5274 test_parallelSort$Ljava_lang_Comparable(int size) argument
5309 test_parallelSort$Ljava_lang_ComparableII(int size) argument
5385 test_parallelSort$Ljava_lang_ObjectLjava_util_Comparator(int size) argument
5420 test_parallelSort$Ljava_lang_ObjectLjava_util_ComparatorII(int size) argument
[all...]
H A DTreeMapExtendTest.java81 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 DPriorityQueueTest.java40 * 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...]
H A DLinkedBlockingQueueTest.java57 * Returns a new queue of given size containing consecutive
68 assertEquals(n, q.size());
161 assertEquals(SIZE, q.size() + q.remainingCapacity());
166 assertEquals(SIZE, q.size() + q.remainingCapacity());
274 assertEquals(SIZE, q.size());
296 assertEquals(SIZE, q.size());
545 assertEquals(0, q.size());
582 assertEquals(SIZE - i, q.size());
595 assertEquals(SIZE - i, q.size());
709 assertEquals(0, q.size());
[all...]
/libcore/ojluni/src/main/java/java/lang/
H A DProcessEnvironment.java229 public int size() {return m.size();} method in class:ProcessEnvironment.StringEnvironment
271 int count = m.size() * 2; // For added '=' and NUL
291 envc[0] = m.size();
325 public int size() {return s.size();} method in class:ProcessEnvironment.StringEntrySet
367 public int size() {return c.size();} method in class:ProcessEnvironment.StringValues
394 public int size() {return s.size();} method in class:ProcessEnvironment.StringKeySet
[all...]
/libcore/ojluni/src/main/java/java/util/
H A DArraysParallelSortHelpers.java39 * 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 DWeakHashMap.java75 * is possible for the <tt>size</tt> method to return smaller values over
165 private int size; field in class:WeakHashMap
168 * The next size value at which to resize (capacity * load factor).
255 this(Math.max((int) (m.size() / DEFAULT_LOAD_FACTOR) + 1,
336 size--;
360 public int size() { method in class:WeakHashMap
361 if (size == 0)
364 return size;
374 return size() == 0;
465 if (++size >
880 public int size() { method in class:WeakHashMap.KeySet
933 public int size() { method in class:WeakHashMap.Values
986 public int size() { method in class:WeakHashMap.EntrySet
[all...]
H A DCollections.java205 Arrays.sort((T[]) ((ArrayList) list).elementData, 0, list.size(), c);
243 * element greater than the key, or <tt>list.size()</tt> if all
254 if (list instanceof RandomAccess || list.size()<BINARYSEARCH_THRESHOLD)
263 int high = list.size()-1;
284 int high = list.size()-1;
347 * element greater than the key, or <tt>list.size()</tt> if all
361 if (list instanceof RandomAccess || list.size()<BINARYSEARCH_THRESHOLD)
369 int high = l.size()-1;
388 int high = l.size()-1;
417 int size
1072 public int size() {return c.size();} method in class:Collections.UnmodifiableCollection
1492 public int size() {return m.size();} method in class:Collections.UnmodifiableMap
2058 public int size() { method in class:Collections.SynchronizedCollection
2615 public int size() { method in class:Collections.SynchronizedMap
3095 public int size() { return c.size(); } method in class:Collections.CheckedCollection
3651 public int size() { return m.size(); } method in class:Collections.CheckedMap
3783 public int size() { return s.size(); } method in class:Collections.CheckedMap.CheckedEntrySet
4364 public int size() {return 0;} method in class:Collections.EmptySet
4487 public int size() {return 0;} method in class:Collections.EmptyList
4622 public int size() {return 0;} method in class:Collections.EmptyMap
4808 public int size() {return 1;} method in class:Collections.SingletonSet
4857 public int size() {return 1;} method in class:Collections.SingletonList
4921 public int size() {return 1;} method in class:Collections.SingletonMap
5054 public int size() { method in class:Collections.CopiesList
5505 public int size() { return m.size(); } method in class:Collections.SetFromMap
5585 public int size() { return q.size(); } method in class:Collections.AsLIFOQueue
[all...]
H A DArrayDeque.java196 allocateElements(c.size());
566 public int size() { method in class:ArrayDeque
782 * size of this deque.
817 int size = (tail - head) + (wrap ? elements.length : 0);
818 int firstLeg = size - (wrap ? tail : 0);
820 if (size > len) {
821 a = (T[]) Arrays.copyOfRange(elements, head, head + size,
825 if (size < len)
826 a[size] = null;
858 * @serialData The current size ({
[all...]
H A DSpliterators.java172 * {@code toIndex} is greater than the array size
234 * {@code toIndex} is greater than the array size
300 * {@code toIndex} is greater than the array size
366 * {@code toIndex} is greater than the array size
403 * reporting its {@link java.util.Collection#size()} as its initial size.
426 * as the source of elements, and with a given initially reported size.
436 * size is not equal to the actual number of elements in the source.
440 * @param size The number of elements in the source, to be reported as
449 long size,
448 spliterator(Iterator<? extends T> iterator, long size, int characteristics) argument
505 spliterator(PrimitiveIterator.OfInt iterator, long size, int characteristics) argument
562 spliterator(PrimitiveIterator.OfLong iterator, long size, int characteristics) argument
619 spliterator(PrimitiveIterator.OfDouble iterator, long size, int characteristics) argument
1728 IteratorSpliterator(Iterator<? extends T> iterator, long size, int characteristics) argument
1861 IntIteratorSpliterator(PrimitiveIterator.OfInt iterator, long size, int characteristics) argument
1955 LongIteratorSpliterator(PrimitiveIterator.OfLong iterator, long size, int characteristics) argument
2049 DoubleIteratorSpliterator(PrimitiveIterator.OfDouble iterator, long size, int characteristics) argument
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/io/
H A DBufferedInputStreamTest.java118 // 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 DParserAdapterTest.java225 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 DProviderList.java102 int n = list.size();
116 ProviderConfig[] configs = new ProviderConfig[providerList.size() - 1];
144 public int size() {
224 public int size() { method in class:ProviderList
427 } else if ((services != null) && (services.size() > index)) {
461 public int size() { method in class:ProviderList.ServiceList
464 n = services.size();
474 // override isEmpty() and iterator() to not call size()
/libcore/ojluni/src/main/java/sun/security/x509/
H A DNameConstraintsExtension.java93 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++) {
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/
H A DInnerNodeImpl.java52 return insertChildAt(newChild, children.size());
70 return (!children.isEmpty() ? children.get(children.size() - 1) : null);
74 if (parent == null || index + 1 >= parent.children.size()) {
82 return children.size() != 0;
169 for (int i = fromIndex; i < children.size(); i++) {
/libcore/metrictests/memory/host/src/libcore/heapmetrics/
H A DHeapCategorization.java305 // Placeholders have no retained size and so can be ignored.
335 * Increments the stored size for the given category by the retain size of the given rooted
339 Size size = Size.ZERO;
341 size = size.plus(rooted.getRetainedSize(heap));
344 sizesByCategory.put(category, sizesByCategory.get(category).plus(size));
346 sizesByCategory.put(category, size);

Completed in 608 milliseconds

1234567891011>>