| /libcore/ojluni/src/main/java/java/util/ |
| H A D | Spliterators.java | 1260 private long est; // size estimate field in class:Spliterators.AbstractSpliterator
1267 * @param est the estimated size of this spliterator if known, otherwise
1273 protected AbstractSpliterator(long est, int additionalCharacteristics) { argument
1274 this.est = est;
1310 long s = est;
1321 if (est != Long.MAX_VALUE)
1322 est -= j;
1338 return est;
1383 private long est; // siz field in class:Spliterators.AbstractIntSpliterator
1396 AbstractIntSpliterator(long est, int additionalCharacteristics) argument
1493 private long est; // size estimate field in class:Spliterators.AbstractLongSpliterator
1506 AbstractLongSpliterator(long est, int additionalCharacteristics) argument
1603 private long est; // size estimate field in class:Spliterators.AbstractDoubleSpliterator
1616 AbstractDoubleSpliterator(long est, int additionalCharacteristics) argument
1697 private long est; // size estimate field in class:Spliterators.IteratorSpliterator
1848 private long est; // size estimate field in class:Spliterators.IntIteratorSpliterator
1942 private long est; // size estimate field in class:Spliterators.LongIteratorSpliterator
2036 private long est; // size estimate field in class:Spliterators.DoubleIteratorSpliterator
[all...] |
| H A D | IdentityHashMap.java | 1390 int est; // size estimate field in class:IdentityHashMap.IdentityHashMapSpliterator
1394 int fence, int est, int expectedModCount) {
1398 this.est = est;
1405 est = map.size;
1414 return (long) est;
1421 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, argument
1423 super(map, origin, fence, est, expectedModCount);
1429 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1,
1471 return (fence < 0 || est
1393 IdentityHashMapSpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, int expectedModCount) argument
1478 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1537 EntrySpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...] |
| H A D | LinkedList.java | 1180 int est; // size estimate; -1 until first needed field in class:LinkedList.LLSpliterator
1181 int expectedModCount; // initialized when est set
1184 LLSpliterator(LinkedList<E> list, int est, int expectedModCount) { argument
1186 this.est = est;
1193 if ((s = est) < 0) {
1195 s = est = 0;
1199 s = est = lst.size;
1221 est = s - j;
1232 est
[all...] |
| H A D | WeakHashMap.java | 1043 int est; // size estimate field in class:WeakHashMap.WeakHashMapSpliterator
1047 int fence, int est,
1052 this.est = est;
1060 est = m.size();
1069 return (long) est;
1076 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, argument
1078 super(m, origin, fence, est, expectedModCount);
1084 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1,
1156 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, argument
1046 WeakHashMapSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1233 EntrySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...] |
| H A D | HashMap.java | 903 int est; // size estimate field in class:HashMap.HashMapSpliterator
907 int fence, int est,
912 this.est = est;
920 est = m.size;
930 return (long) est;
937 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, argument
939 super(m, origin, fence, est, expectedModCount);
945 new KeySpliterator<>(map, lo, index = mid, est >>>= 1,
1001 return (fence < 0 || est
906 HashMapSpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1010 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1082 EntrySpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...] |
| H A D | TreeMap.java | 2722 int est; // size estimate (exact only for top-level) field in class:TreeMap.TreeMapSpliterator
2727 int side, int est, int expectedModCount) {
2732 this.est = est;
2738 if ((s = est) < 0) {
2741 s = est = t.size;
2745 s = est = 0;
2760 int side, int est, int expectedModCount) {
2761 super(tree, origin, fence, side, est, expectedModCount);
2765 if (est <
2725 TreeMapSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2758 KeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2836 DescendingKeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2909 ValueSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2981 EntrySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| H A D | LinkedBlockingQueue.java | 806 long est; // size estimate field in class:LinkedBlockingQueue.LBQSpliterator
809 this.est = queue.size();
812 public long estimateSize() { return est; }
837 est = 0L;
840 else if ((est -= i) < 0L)
841 est = 0L;
|
| H A D | LinkedBlockingDeque.java | 1107 long est; // size estimate field in class:LinkedBlockingDeque.LBDSpliterator
1110 this.est = queue.size();
1113 public long estimateSize() { return est; }
1139 est = 0L;
1142 else if ((est -= i) < 0L)
1143 est = 0L;
|
| H A D | ConcurrentSkipListMap.java | 3280 int est; // pseudo-size estimate field in class:ConcurrentSkipListMap.CSLMSpliterator
3282 Node<K,V> origin, K fence, int est) {
3284 this.current = origin; this.fence = fence; this.est = est;
3287 public final long estimateSize() { return (long)est; }
3293 Node<K,V> origin, K fence, int est) {
3294 super(comparator, row, origin, fence, est);
3311 est -= est >>> 2;
3312 return new KeySpliterator<K,V>(cmp, r, e, sk, est);
3281 CSLMSpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
3292 KeySpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
3380 ValueSpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
3467 EntrySpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
[all...] |
| H A D | ConcurrentHashMap.java | 3541 long est; // size estimate field in class:ConcurrentHashMap.KeySpliterator
3543 long est) {
3545 this.est = est;
3552 f, est >>>= 1);
3570 public long estimateSize() { return est; }
3580 long est; // size estimate field in class:ConcurrentHashMap.ValueSpliterator
3582 long est) {
3584 this.est = est;
3542 KeySpliterator(Node<K,V>[] tab, int size, int index, int limit, long est) argument
3581 ValueSpliterator(Node<K,V>[] tab, int size, int index, int limit, long est) argument
3619 long est; // size estimate field in class:ConcurrentHashMap.EntrySpliterator
3620 EntrySpliterator(Node<K,V>[] tab, int size, int index, int limit, long est, ConcurrentHashMap<K,V> map) argument
[all...] |