Home
last modified time | relevance | path

Searched refs:est (Results 1 – 13 of 13) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
DSpliterators.java1260 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 …]
DIdentityHashMap.java1390 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<K,V>(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 …]
DHashMap.java903 int est; // size estimate field in HashMap.HashMapSpliterator
907 int fence, int est, in HashMapSpliterator() argument
912 this.est = est; in HashMapSpliterator()
920 est = m.size; in getFence()
930 return (long) est; in estimateSize()
937 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, in KeySpliterator() argument
939 super(m, origin, fence, est, expectedModCount); in KeySpliterator()
945 new KeySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1001 return (fence < 0 || est == map.size ? Spliterator.SIZED : 0) | in characteristics()
1010 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument
[all …]
DWeakHashMap.java1043 int est; // size estimate field in WeakHashMap.WeakHashMapSpliterator
1047 int fence, int est, in WeakHashMapSpliterator() argument
1052 this.est = est; in WeakHashMapSpliterator()
1060 est = m.size(); in getFence()
1069 return (long) est; in estimateSize()
1076 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in KeySpliterator() argument
1078 super(m, origin, fence, est, expectedModCount); in KeySpliterator()
1084 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
1156 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument
1158 super(m, origin, fence, est, expectedModCount); in ValueSpliterator()
[all …]
DLinkedList.java1180 int est; // size estimate; -1 until first needed field in LinkedList.LLSpliterator
1184 LLSpliterator(LinkedList<E> list, int est, int expectedModCount) { in LLSpliterator() argument
1186 this.est = est; in LLSpliterator()
1193 if ((s = est) < 0) { in getEst()
1195 s = est = 0; in getEst()
1199 s = est = lst.size; in getEst()
1221 est = s - j; in trySplit()
1232 est = 0; in forEachRemaining()
1247 --est; in tryAdvance()
DTreeMap.java2722 int est; // size estimate (exact only for top-level) field in TreeMap.TreeMapSpliterator
2727 int side, int est, int expectedModCount) { in TreeMapSpliterator() argument
2732 this.est = est; in TreeMapSpliterator()
2738 if ((s = est) < 0) { in getEstimate()
2741 s = est = t.size; in getEstimate()
2745 s = est = 0; in getEstimate()
2760 int side, int est, int expectedModCount) { in KeySpliterator() argument
2761 super(tree, origin, fence, side, est, expectedModCount); in KeySpliterator()
2765 if (est < 0) in trySplit()
2778 (tree, e, current = s, -1, est >>>= 1, expectedModCount); in trySplit()
[all …]
DCollections.java3901 long est = 1;
3911 if (est > 0) {
3912 est--;
3926 return est;
/libcore/ojluni/src/main/java/java/util/stream/
DAbstractTask.java184 long est = sizeEstimate / LEAF_TARGET; in suggestTargetSize() local
185 return est > 0L ? est : 1L; in suggestTargetSize()
/libcore/luni/src/test/resources/
Dblob.c2 …int occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.
/libcore/luni/src/main/java/java/util/concurrent/
DLinkedBlockingQueue.java806 long est; // size estimate field in LinkedBlockingQueue.LBQSpliterator
809 this.est = queue.size(); in LBQSpliterator()
812 public long estimateSize() { return est; } in estimateSize()
837 est = 0L; in trySplit()
840 else if ((est -= i) < 0L) in trySplit()
841 est = 0L; in trySplit()
DLinkedBlockingDeque.java1107 long est; // size estimate field in LinkedBlockingDeque.LBDSpliterator
1110 this.est = queue.size(); in LBDSpliterator()
1113 public long estimateSize() { return est; } in estimateSize()
1139 est = 0L; in trySplit()
1142 else if ((est -= i) < 0L) in trySplit()
1143 est = 0L; in trySplit()
DConcurrentSkipListMap.java3280 int est; // pseudo-size estimate field in ConcurrentSkipListMap.CSLMSpliterator
3282 Node<K,V> origin, K fence, int est) { in CSLMSpliterator() argument
3284 this.current = origin; this.fence = fence; this.est = est; in CSLMSpliterator()
3287 public final long estimateSize() { return (long)est; } in estimateSize()
3293 Node<K,V> origin, K fence, int est) { in KeySpliterator() argument
3294 super(comparator, row, origin, fence, est); in KeySpliterator()
3311 est -= est >>> 2; in trySplit()
3312 return new KeySpliterator<K,V>(cmp, r, e, sk, est); in trySplit()
3381 Node<K,V> origin, K fence, int est) { in ValueSpliterator() argument
3382 super(comparator, row, origin, fence, est); in ValueSpliterator()
[all …]
DConcurrentHashMap.java3541 long est; // size estimate field in ConcurrentHashMap.KeySpliterator
3543 long est) { in KeySpliterator() argument
3545 this.est = est; in KeySpliterator()
3552 f, est >>>= 1); in trySplit()
3570 public long estimateSize() { return est; } in estimateSize()
3580 long est; // size estimate field in ConcurrentHashMap.ValueSpliterator
3582 long est) { in ValueSpliterator() argument
3584 this.est = est; in ValueSpliterator()
3591 f, est >>>= 1); in trySplit()
3609 public long estimateSize() { return est; } in estimateSize()
[all …]