Searched defs:getFence (Results 1 - 8 of 8) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
H A DArrayDeque.java926 private int getFence() { // force initialization method in class:ArrayDeque.DeqSpliterator
936 int t = getFence(), h = index, n = deq.elements.length;
950 int m = a.length - 1, f = getFence(), i = index;
965 int m = a.length - 1, f = getFence(), i = index;
978 int n = getFence() - index;
H A DPriorityQueue.java838 private int getFence() { // initialize fence to size on first use method in class:PriorityQueue.PriorityQueueSpliterator
848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
887 int hi = getFence(), lo = index;
902 return (long) (getFence() - index);
H A DArrayList.java1339 private int getFence() { // initialize fence to size on first use method in class:ArrayList.ArrayListSpliterator
1354 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1363 int hi = getFence(), i = index;
1400 return (long) (getFence() - index);
H A DIdentityHashMap.java1399 final int getFence() { // initialize fence and size on first use method in class:IdentityHashMap.IdentityHashMapSpliterator
1410 getFence(); // force init
1424 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1;
1437 (i = index) >= 0 && (index = hi = getFence()) <= a.length) {
1453 int hi = getFence();
1481 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1;
1493 (i = index) >= 0 && (index = hi = getFence()) <= a.length) {
1510 int hi = getFence();
1540 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1;
1552 (i = index) >= 0 && (index = hi = getFence()) <
[all...]
H A DVector.java1372 private int getFence() { // initialize on first use method in class:Vector.VectorSpliterator
1385 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1396 if (getFence() > (i = index)) {
1433 return (long) (getFence() - index);
H A DWeakHashMap.java1080 final int getFence() { // initialize fence and size on first use method in class:WeakHashMap.WeakHashMapSpliterator
1092 getFence(); // force init
1106 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1151 if (tab.length >= (hi = getFence()) && index >= 0) {
1186 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1229 if (tab.length >= (hi = getFence()) && index >= 0) {
1263 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1311 if (tab.length >= (hi = getFence()) && index >= 0) {
H A DHashMap.java1499 final int getFence() { // initialize fence and size on first use method in class:HashMap.HashMapSpliterator
1512 getFence(); // force init
1526 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1566 if (tab != null && tab.length >= (hi = getFence()) && index >= 0) {
1598 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1638 if (tab != null && tab.length >= (hi = getFence()) && index >= 0) {
1669 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1709 if (tab != null && tab.length >= (hi = getFence()) && index >= 0) {
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DPriorityBlockingQueue.java949 final int getFence() { method in class:PriorityBlockingQueue.PBQSpliterator
957 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
978 if (getFence() > index && index >= 0) {
986 public long estimateSize() { return (long)(getFence() - index); }

Completed in 127 milliseconds