| /libcore/ojluni/src/main/java/java/util/ |
| D | Spliterators.java | 1304 private long est; // size estimate field in Spliterators.AbstractSpliterator
1317 protected AbstractSpliterator(long est, int additionalCharacteristics) { in AbstractSpliterator() argument
1318 this.est = est; in AbstractSpliterator()
1354 long s = est; in trySplit()
1365 if (est != Long.MAX_VALUE) in trySplit()
1366 est -= j; in trySplit()
1382 return est; in estimateSize()
1427 private long est; // size estimate field in Spliterators.AbstractIntSpliterator
1440 protected AbstractIntSpliterator(long est, int additionalCharacteristics) { in AbstractIntSpliterator() argument
1441 this.est = est; in AbstractIntSpliterator()
[all …]
|
| D | IdentityHashMap.java | 1390 int est; // size estimate field in IdentityHashMap.IdentityHashMapSpliterator
1394 int fence, int est, int expectedModCount) { in IdentityHashMapSpliterator() argument
1398 this.est = est; in IdentityHashMapSpliterator()
1405 est = map.size; in getFence()
1414 return (long) est; in estimateSize()
1421 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, in KeySpliterator() argument
1423 super(map, origin, fence, est, expectedModCount); in KeySpliterator()
1429 new KeySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1471 return (fence < 0 || est == map.size ? SIZED : 0) | Spliterator.DISTINCT; in characteristics()
1478 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument
[all …]
|
| D | WeakHashMap.java | 1068 int est; // size estimate field in WeakHashMap.WeakHashMapSpliterator
1072 int fence, int est, in WeakHashMapSpliterator() argument
1077 this.est = est; in WeakHashMapSpliterator()
1085 est = m.size(); in getFence()
1094 return (long) est; in estimateSize()
1101 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in KeySpliterator() argument
1103 super(m, origin, fence, est, expectedModCount); in KeySpliterator()
1109 new KeySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1181 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument
1183 super(m, origin, fence, est, expectedModCount); in ValueSpliterator()
[all …]
|
| D | TreeMap.java | 3059 int est; // size estimate (exact only for top-level) field in TreeMap.TreeMapSpliterator
3064 int side, int est, int expectedModCount) { in TreeMapSpliterator() argument
3069 this.est = est; in TreeMapSpliterator()
3075 if ((s = est) < 0) { in getEstimate()
3078 s = est = t.size; in getEstimate()
3082 s = est = 0; in getEstimate()
3097 int side, int est, int expectedModCount) { in KeySpliterator() argument
3098 super(tree, origin, fence, side, est, expectedModCount); in KeySpliterator()
3102 if (est < 0) in trySplit()
3115 (tree, e, current = s, -1, est >>>= 1, expectedModCount); in trySplit()
[all …]
|
| D | LinkedList.java | 1193 int est; // size estimate; -1 until first needed field in LinkedList.LLSpliterator
1197 LLSpliterator(LinkedList<E> list, int est, int expectedModCount) { in LLSpliterator() argument
1199 this.est = est; in LLSpliterator()
1206 if ((s = est) < 0) { in getEst()
1208 s = est = 0; in getEst()
1212 s = est = lst.size; in getEst()
1234 est = s - j; in trySplit()
1245 est = 0; in forEachRemaining()
1260 --est; in tryAdvance()
|
| D | BitSet.java | 1231 private int est; // size estimate in stream() field in BitSet.BitSetSpliterator
1237 BitSetSpliterator(int origin, int fence, int est, boolean root) { in stream() argument
1240 this.est = est; in stream()
1253 est = cardinality(); in stream()
1348 return new BitSetSpliterator(lo, mid, est >>>= 1, false); in stream()
1354 return est; in stream()
|
| D | HashMap.java | 1647 int est; // size estimate field in HashMap.HashMapSpliterator
1651 int fence, int est, in HashMapSpliterator() argument
1656 this.est = est; in HashMapSpliterator()
1664 est = m.size; in getFence()
1674 return (long) est; in estimateSize()
1681 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, in KeySpliterator() argument
1683 super(m, origin, fence, est, expectedModCount); in KeySpliterator()
1689 new KeySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1745 return (fence < 0 || est == map.size ? Spliterator.SIZED : 0) | in characteristics()
1753 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument
[all …]
|
| D | Collections.java | 5142 long est = 1;
5152 if (est > 0) {
5153 est--;
5167 return est;
|
| /libcore/ojluni/src/main/java/java/util/stream/ |
| D | AbstractTask.java | 195 long est = sizeEstimate / getLeafTarget(); in suggestTargetSize() local
196 return est > 0L ? est : 1L; in suggestTargetSize()
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ConcurrentSkipListMap.java | 3133 long est; // size estimate field in ConcurrentSkipListMap.CSLMSpliterator
3135 Node<K,V> origin, K fence, long est) { in CSLMSpliterator() argument
3137 this.current = origin; this.fence = fence; this.est = est; in CSLMSpliterator()
3140 public final long estimateSize() { return est; } in estimateSize()
3146 Node<K,V> origin, K fence, long est) { in KeySpliterator() argument
3147 super(comparator, row, origin, fence, est); in KeySpliterator()
3164 est -= est >>> 2; in trySplit()
3165 return new KeySpliterator<K,V>(cmp, r, e, sk, est); in trySplit()
3220 Index<K,V> h; Node<K,V> n; long est; in keySpliterator() local
3224 est = 0L; in keySpliterator()
[all …]
|
| D | LinkedBlockingQueue.java | 875 long est = size(); // size estimate field in LinkedBlockingQueue.LBQSpliterator
879 public long estimateSize() { return est; } in estimateSize()
900 est = 0L; in trySplit()
903 else if ((est -= i) < 0L) in trySplit()
904 est = 0L; in trySplit()
|
| D | LinkedBlockingDeque.java | 1185 long est = size(); // size estimate field in LinkedBlockingDeque.LBDSpliterator
1189 public long estimateSize() { return est; } in estimateSize()
1211 est = 0L; in trySplit()
1214 else if ((est -= i) < 0L) in trySplit()
1215 est = 0L; in trySplit()
|
| D | ConcurrentHashMap.java | 3562 long est; // size estimate field in ConcurrentHashMap.KeySpliterator
3564 long est) { in KeySpliterator() argument
3566 this.est = est; in KeySpliterator()
3573 f, est >>>= 1); in trySplit()
3591 public long estimateSize() { return est; } in estimateSize()
3601 long est; // size estimate field in ConcurrentHashMap.ValueSpliterator
3603 long est) { in ValueSpliterator() argument
3605 this.est = est; in ValueSpliterator()
3612 f, est >>>= 1); in trySplit()
3630 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 | 308 LLSpliterator(java.util.LinkedList<E> list, int est, int expectedModCount) { in LLSpliterator() argument
344 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
|