| /libcore/ojluni/src/main/java/java/util/ |
| D | Spliterators.java | 1260 private long est; // size estimate field in Spliterators.AbstractSpliterator
1273 protected AbstractSpliterator(long est, int additionalCharacteristics) { in AbstractSpliterator() argument
1274 this.est = est; in AbstractSpliterator()
1310 long s = est; in trySplit()
1321 if (est != Long.MAX_VALUE) in trySplit()
1322 est -= j; in trySplit()
1338 return est; in estimateSize()
1383 private long est; // size estimate field in Spliterators.AbstractIntSpliterator
1396 protected AbstractIntSpliterator(long est, int additionalCharacteristics) { in AbstractIntSpliterator() argument
1397 this.est = est; in AbstractIntSpliterator()
[all …]
|
| D | IdentityHashMap.java | 1387 int est; // size estimate field in IdentityHashMap.IdentityHashMapSpliterator
1391 int fence, int est, int expectedModCount) { in IdentityHashMapSpliterator() argument
1395 this.est = est; in IdentityHashMapSpliterator()
1402 est = map.size; in getFence()
1411 return (long) est; in estimateSize()
1418 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, in KeySpliterator() argument
1420 super(map, origin, fence, est, expectedModCount); in KeySpliterator()
1426 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
1468 return (fence < 0 || est == map.size ? SIZED : 0) | Spliterator.DISTINCT; in characteristics()
1475 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument
[all …]
|
| D | WeakHashMap.java | 1067 int est; // size estimate field in WeakHashMap.WeakHashMapSpliterator
1071 int fence, int est, in WeakHashMapSpliterator() argument
1076 this.est = est; in WeakHashMapSpliterator()
1084 est = m.size(); in getFence()
1093 return (long) est; in estimateSize()
1100 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in KeySpliterator() argument
1102 super(m, origin, fence, est, expectedModCount); in KeySpliterator()
1108 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
1180 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument
1182 super(m, origin, fence, est, expectedModCount); in ValueSpliterator()
[all …]
|
| D | LinkedList.java | 1179 int est; // size estimate; -1 until first needed field in LinkedList.LLSpliterator
1183 LLSpliterator(LinkedList<E> list, int est, int expectedModCount) { in LLSpliterator() argument
1185 this.est = est; in LLSpliterator()
1192 if ((s = est) < 0) { in getEst()
1194 s = est = 0; in getEst()
1198 s = est = lst.size; in getEst()
1220 est = s - j; in trySplit()
1231 est = 0; in forEachRemaining()
1246 --est; in tryAdvance()
|
| D | TreeMap.java | 2706 int est; // size estimate (exact only for top-level) field in TreeMap.TreeMapSpliterator
2711 int side, int est, int expectedModCount) { in TreeMapSpliterator() argument
2716 this.est = est; in TreeMapSpliterator()
2722 if ((s = est) < 0) { in getEstimate()
2725 s = est = t.size; in getEstimate()
2729 s = est = 0; in getEstimate()
2744 int side, int est, int expectedModCount) { in KeySpliterator() argument
2745 super(tree, origin, fence, side, est, expectedModCount); in KeySpliterator()
2749 if (est < 0) in trySplit()
2762 (tree, e, current = s, -1, est >>>= 1, expectedModCount); in trySplit()
[all …]
|
| D | HashMap.java | 1486 int est; // size estimate field in HashMap.HashMapSpliterator
1490 int fence, int est, in HashMapSpliterator() argument
1495 this.est = est; in HashMapSpliterator()
1503 est = m.size; in getFence()
1513 return (long) est; in estimateSize()
1520 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, in KeySpliterator() argument
1522 super(m, origin, fence, est, expectedModCount); in KeySpliterator()
1528 new KeySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1584 return (fence < 0 || est == map.size ? Spliterator.SIZED : 0) | in characteristics()
1592 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument
[all …]
|
| D | Collections.java | 4762 long est = 1;
4772 if (est > 0) {
4773 est--;
4787 return est;
|
| /libcore/ojluni/src/main/java/java/util/stream/ |
| D | AbstractTask.java | 184 long est = sizeEstimate / LEAF_TARGET; in suggestTargetSize() local
185 return est > 0L ? est : 1L; in suggestTargetSize()
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | LinkedBlockingQueue.java | 835 long est; // size estimate field in LinkedBlockingQueue.LBQSpliterator
838 this.est = queue.size(); in LBQSpliterator()
841 public long estimateSize() { return est; } in estimateSize()
866 est = 0L; in trySplit()
869 else if ((est -= i) < 0L) in trySplit()
870 est = 0L; in trySplit()
|
| D | LinkedBlockingDeque.java | 1136 long est; // size estimate field in LinkedBlockingDeque.LBDSpliterator
1139 this.est = queue.size(); in LBDSpliterator()
1142 public long estimateSize() { return est; } in estimateSize()
1168 est = 0L; in trySplit()
1171 else if ((est -= i) < 0L) in trySplit()
1172 est = 0L; in trySplit()
|
| D | ConcurrentSkipListMap.java | 3309 int est; // pseudo-size estimate field in ConcurrentSkipListMap.CSLMSpliterator
3311 Node<K,V> origin, K fence, int est) { in CSLMSpliterator() argument
3313 this.current = origin; this.fence = fence; this.est = est; in CSLMSpliterator()
3316 public final long estimateSize() { return (long)est; } in estimateSize()
3322 Node<K,V> origin, K fence, int est) { in KeySpliterator() argument
3323 super(comparator, row, origin, fence, est); in KeySpliterator()
3340 est -= est >>> 2; in trySplit()
3341 return new KeySpliterator<K,V>(cmp, r, e, sk, est); in trySplit()
3410 Node<K,V> origin, K fence, int est) { in ValueSpliterator() argument
3411 super(comparator, row, origin, fence, est); in ValueSpliterator()
[all …]
|
| D | ConcurrentHashMap.java | 3572 long est; // size estimate field in ConcurrentHashMap.KeySpliterator
3574 long est) { in KeySpliterator() argument
3576 this.est = est; in KeySpliterator()
3583 f, est >>>= 1); in trySplit()
3601 public long estimateSize() { return est; } in estimateSize()
3611 long est; // size estimate field in ConcurrentHashMap.ValueSpliterator
3613 long est) { in ValueSpliterator() argument
3615 this.est = est; in ValueSpliterator()
3622 f, est >>>= 1); in trySplit()
3640 public long estimateSize() { return est; } in estimateSize()
[all …]
|
| /libcore/luni/src/test/resources/ |
| D | blob.c | 2 …int occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.
|
| /libcore/ojluni/annotations/hiddenapi/java/util/ |
| D | HashMap.java | 340 java.util.HashMap<K, V> m, int origin, int fence, int est, int expectedModCount) { in EntrySpliterator() argument
396 java.util.HashMap<K, V> m, int origin, int fence, int est, int expectedModCount) { in HashMapSpliterator() argument
410 int est; field in HashMap.HashMapSpliterator
475 java.util.HashMap<K, V> m, int origin, int fence, int est, int expectedModCount) { in KeySpliterator() argument
652 java.util.HashMap<K, V> m, int origin, int fence, int est, int expectedModCount) { in ValueSpliterator() argument
|
| D | LinkedList.java | 305 LLSpliterator(java.util.LinkedList<E> list, int est, int expectedModCount) { in LLSpliterator() argument
341 int est; field in LinkedList.LLSpliterator
|
| /libcore/ojluni/annotations/hiddenapi/java/util/concurrent/ |
| D | LinkedBlockingQueue.java | 278 long est; field in LinkedBlockingQueue.LBQSpliterator
|
| D | LinkedBlockingDeque.java | 420 long est; field in LinkedBlockingDeque.LBDSpliterator
|