| /libcore/ojluni/src/main/java/java/util/ |
| D | AbstractList.java | 682 private int getFence() { // initialize fence to size on first use in getFence() method in AbstractList.RandomAccessSpliterator
695 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
703 int hi = getFence(), i = index; in tryAdvance()
716 int hi = getFence(); in forEachRemaining()
726 return (long) (getFence() - index); in estimateSize()
|
| D | IdentityHashMap.java | 1399 final int getFence() { // initialize fence and size on first use in getFence() method in IdentityHashMap.IdentityHashMapSpliterator
1410 getFence(); // force init in estimateSize()
1424 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1437 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1453 int hi = getFence(); in tryAdvance()
1481 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1493 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1510 int hi = getFence(); in tryAdvance()
1540 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1552 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
[all …]
|
| D | ArrayDeque.java | 932 private int getFence() { // force initialization in getFence() method in ArrayDeque.DeqSpliterator
942 int t = getFence(), h = index, n = deq.elements.length; in trySplit()
956 int m = a.length - 1, f = getFence(), i = index; in forEachRemaining()
971 int m = a.length - 1, f = getFence(), i = index; in tryAdvance()
984 int n = getFence() - index; in estimateSize()
|
| D | PriorityQueue.java | 838 private int getFence() { // initialize fence to size on first use in getFence() method in PriorityQueue.PriorityQueueSpliterator
848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
887 int hi = getFence(), lo = index; in tryAdvance()
902 return (long) (getFence() - index); in estimateSize()
|
| D | WeakHashMap.java | 1080 final int getFence() { // initialize fence and size on first use in getFence() method in WeakHashMap.WeakHashMapSpliterator
1092 getFence(); // force init in estimateSize()
1106 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1151 if (tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
1186 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1229 if (tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
1263 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1311 if (tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
|
| D | Vector.java | 1380 private int getFence() { // initialize on first use in getFence() method in VectorSpliterator
1393 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1404 if (getFence() > (i = index)) { in tryAdvance()
1441 return (long) (getFence() - index); in estimateSize()
|
| D | ArrayList.java | 1339 private int getFence() { // initialize fence to size on first use in getFence() method in ArrayListSpliterator
1354 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1363 int hi = getFence(), i = index; in tryAdvance()
1400 return (long) (getFence() - index); in estimateSize()
|
| D | HashMap.java | 1499 final int getFence() { // initialize fence and size on first use in getFence() method in HashMap.HashMapSpliterator
1512 getFence(); // force init in estimateSize()
1526 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1566 if (tab != null && tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
1598 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1638 if (tab != null && tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
1669 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1709 if (tab != null && tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | PriorityBlockingQueue.java | 949 final int getFence() { in getFence() method in PriorityBlockingQueue.PBQSpliterator
957 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
978 if (getFence() > index && index >= 0) { in tryAdvance()
986 public long estimateSize() { return (long)(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
|