| /libcore/ojluni/src/main/java/java/util/ |
| D | AbstractList.java | 684 private int getFence() { // initialize fence to size on first use in getFence() method in AbstractList.RandomAccessSpliterator
697 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
705 int hi = getFence(), i = index; in tryAdvance()
718 int hi = getFence(); in forEachRemaining()
728 return (long) (getFence() - index); in estimateSize()
|
| D | IdentityHashMap.java | 1402 final int getFence() { // initialize fence and size on first use in getFence() method in IdentityHashMap.IdentityHashMapSpliterator
1413 getFence(); // force init in estimateSize()
1427 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1440 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1456 int hi = getFence(); in tryAdvance()
1484 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1496 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1513 int hi = getFence(); in tryAdvance()
1543 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1555 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
[all …]
|
| D | WeakHashMap.java | 1081 final int getFence() { // initialize fence and size on first use in getFence() method in WeakHashMap.WeakHashMapSpliterator
1093 getFence(); // force init in estimateSize()
1107 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1152 if (tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
1187 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1230 if (tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
1264 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1312 if (tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
|
| D | BitSet.java | 1244 private int getFence() { in stream() method in BitSet.BitSetSpliterator
1263 int hi = getFence(); in stream()
1284 int hi = getFence(); in stream()
1321 int hi = getFence(); in stream()
1353 getFence(); // force init in stream()
|
| D | Vector.java | 1451 private int getFence() { // initialize on first use in getFence() method in VectorSpliterator
1464 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1473 if (getFence() > (i = index)) { in tryAdvance()
1486 final int hi = getFence(); in forEachRemaining()
1496 return getFence() - index; in estimateSize()
|
| D | ArrayList.java | 1538 private int getFence() { // initialize fence to size on first use in spliterator() method
1548 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in spliterator()
1556 int hi = getFence(), i = index; in spliterator()
1593 return getFence() - index; in spliterator()
1680 private int getFence() { // initialize fence to size on first use
1690 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1698 int hi = getFence(), i = index;
1735 return getFence() - index;
|
| D | ArrayDeque.java | 826 private int getFence() { // force initialization in getFence() method in ArrayDeque.DeqSpliterator
838 return ((n = sub(getFence(), i = cursor, es.length) >> 1) <= 0) in trySplit()
846 final int end = getFence(), cursor = this.cursor; in forEachRemaining()
876 return sub(getFence(), cursor, elements.length); in estimateSize()
|
| D | PriorityQueue.java | 852 private int getFence() { // initialize fence to size on first use in getFence() method in PriorityQueue.PriorityQueueSpliterator
862 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
900 return getFence() - index; in estimateSize()
|
| D | HashMap.java | 1660 final int getFence() { // initialize fence and size on first use in getFence() method in HashMap.HashMapSpliterator
1673 getFence(); // force init in estimateSize()
1687 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1727 if (tab != null && tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
1759 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1799 if (tab != null && tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
1830 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1870 if (tab != null && tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | PriorityBlockingQueue.java | 951 private int getFence() { in getFence() method in PriorityBlockingQueue.PBQSpliterator
958 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
965 final int hi = getFence(), lo = index; in forEachRemaining()
974 if (getFence() > index && index >= 0) { in tryAdvance()
981 public long estimateSize() { return getFence() - index; } in estimateSize()
|
| /libcore/ojluni/annotations/hiddenapi/java/util/ |
| D | ArrayDeque.java | 262 private int getFence() { in getFence() method in ArrayDeque.DeqSpliterator
|
| D | PriorityQueue.java | 241 private int getFence() { in getFence() method in PriorityQueue.PriorityQueueSpliterator
|
| D | Vector.java | 364 private int getFence() { in getFence() method in Vector.VectorSpliterator
|
| D | ArrayList.java | 247 private int getFence() { in getFence() method in ArrayList.ArrayListSpliterator
|
| D | HashMap.java | 400 final int getFence() { in getFence() method in HashMap.HashMapSpliterator
|
| /libcore/ojluni/annotations/hiddenapi/java/util/concurrent/ |
| D | PriorityBlockingQueue.java | 280 int getFence() { in getFence() method in PriorityBlockingQueue.PBQSpliterator
|