| /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 | 1387 int est; // size estimate field in class:IdentityHashMap.IdentityHashMapSpliterator
1391 int fence, int est, int expectedModCount) {
1395 this.est = est;
1402 est = map.size;
1411 return (long) est;
1418 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, argument
1420 super(map, origin, fence, est, expectedModCount);
1426 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1,
1468 return (fence < 0 || est
1390 IdentityHashMapSpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, int expectedModCount) argument
1475 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1534 EntrySpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...] |
| H A D | LinkedList.java | 1179 int est; // size estimate; -1 until first needed field in class:LinkedList.LLSpliterator
1180 int expectedModCount; // initialized when est set
1183 LLSpliterator(LinkedList<E> list, int est, int expectedModCount) { argument
1185 this.est = est;
1192 if ((s = est) < 0) {
1194 s = est = 0;
1198 s = est = lst.size;
1220 est = s - j;
1231 est
[all...] |
| H A D | WeakHashMap.java | 1067 int est; // size estimate field in class:WeakHashMap.WeakHashMapSpliterator
1071 int fence, int est,
1076 this.est = est;
1084 est = m.size();
1093 return (long) est;
1100 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, argument
1102 super(m, origin, fence, est, expectedModCount);
1108 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1,
1180 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, argument
1070 WeakHashMapSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1257 EntrySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...] |
| H A D | TreeMap.java | 2706 int est; // size estimate (exact only for top-level) field in class:TreeMap.TreeMapSpliterator
2711 int side, int est, int expectedModCount) {
2716 this.est = est;
2722 if ((s = est) < 0) {
2725 s = est = t.size;
2729 s = est = 0;
2744 int side, int est, int expectedModCount) {
2745 super(tree, origin, fence, side, est, expectedModCount);
2749 if (est <
2709 TreeMapSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2742 KeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2820 DescendingKeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2893 ValueSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2965 EntrySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
[all...] |
| H A D | HashMap.java | 1486 int est; // size estimate field in class:HashMap.HashMapSpliterator
1490 int fence, int est,
1495 this.est = est;
1503 est = m.size;
1513 return (long) est;
1520 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, argument
1522 super(m, origin, fence, est, expectedModCount);
1528 new KeySpliterator<>(map, lo, index = mid, est >>>= 1,
1584 return (fence < 0 || est
1489 HashMapSpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1592 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1663 EntrySpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...] |
| H A D | Collections.java | 4753 long est = 1;
4763 if (est > 0) {
4764 est--;
4778 return est;
|
| /libcore/ojluni/src/main/java/java/util/stream/ |
| H A D | AbstractTask.java | 184 long est = sizeEstimate / LEAF_TARGET;
185 return est > 0L ? est : 1L;
|
| /libcore/luni/src/test/resources/ |
| H A D | blob.c | 2 Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| H A D | LinkedBlockingQueue.java | 835 long est; // size estimate field in class:LinkedBlockingQueue.LBQSpliterator
838 this.est = queue.size();
841 public long estimateSize() { return est; }
866 est = 0L;
869 else if ((est -= i) < 0L)
870 est = 0L;
|
| H A D | LinkedBlockingDeque.java | 1136 long est; // size estimate field in class:LinkedBlockingDeque.LBDSpliterator
1139 this.est = queue.size();
1142 public long estimateSize() { return est; }
1168 est = 0L;
1171 else if ((est -= i) < 0L)
1172 est = 0L;
|
| H A D | ConcurrentSkipListMap.java | 3309 int est; // pseudo-size estimate field in class:ConcurrentSkipListMap.CSLMSpliterator
3311 Node<K,V> origin, K fence, int est) {
3313 this.current = origin; this.fence = fence; this.est = est;
3316 public final long estimateSize() { return (long)est; }
3322 Node<K,V> origin, K fence, int est) {
3323 super(comparator, row, origin, fence, est);
3340 est -= est >>> 2;
3341 return new KeySpliterator<K,V>(cmp, r, e, sk, est);
3310 CSLMSpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
3321 KeySpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
3409 ValueSpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
3496 EntrySpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
[all...] |
| H A D | ConcurrentHashMap.java | 3570 long est; // size estimate field in class:ConcurrentHashMap.KeySpliterator
3572 long est) {
3574 this.est = est;
3581 f, est >>>= 1);
3599 public long estimateSize() { return est; }
3609 long est; // size estimate field in class:ConcurrentHashMap.ValueSpliterator
3611 long est) {
3613 this.est = est;
3571 KeySpliterator(Node<K,V>[] tab, int size, int index, int limit, long est) argument
3610 ValueSpliterator(Node<K,V>[] tab, int size, int index, int limit, long est) argument
3648 long est; // size estimate field in class:ConcurrentHashMap.EntrySpliterator
3649 EntrySpliterator(Node<K,V>[] tab, int size, int index, int limit, long est, ConcurrentHashMap<K,V> map) argument
[all...] |