| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/ |
| H A 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 …]
|
| H A 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()
|
| H A 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()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.base/share/classes/java/util/ |
| H A 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 …]
|
| H A 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()
|
| H A 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()
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/ |
| H A 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 …]
|
| H A D | ArrayDeque.java | 927 private int getFence() { // force initialization in getFence() method in ArrayDeque.DeqSpliterator
937 int t = getFence(), h = index, n = deq.elements.length; in trySplit()
951 int m = a.length - 1, f = getFence(), i = index; in forEachRemaining()
966 int m = a.length - 1, f = getFence(), i = index; in tryAdvance()
979 int n = getFence() - index; in estimateSize()
|
| H A 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()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.base/share/classes/java/util/ |
| H A 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 …]
|
| H A 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()
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.base/share/classes/java/util/ |
| H A D | IdentityHashMap.java | 1406 final int getFence() { // initialize fence and size on first use in getFence() method in IdentityHashMap.IdentityHashMapSpliterator
1417 getFence(); // force init in estimateSize()
1431 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1444 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1460 int hi = getFence(); in tryAdvance()
1488 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1500 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1517 int hi = getFence(); in tryAdvance()
1547 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1559 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
[all …]
|
| H A 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()
|
| H A D | WeakHashMap.java | 1085 final int getFence() { // initialize fence and size on first use in getFence() method in WeakHashMap.WeakHashMapSpliterator
1097 getFence(); // force init in estimateSize()
1111 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1156 if (tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
1191 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1234 if (tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
1268 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit()
1316 if (tab.length >= (hi = getFence()) && index >= 0) { in tryAdvance()
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.base/share/classes/java/util/ |
| H A D | IdentityHashMap.java | 1398 final int getFence() { // initialize fence and size on first use in getFence() method in IdentityHashMap.IdentityHashMapSpliterator
1409 getFence(); // force init in estimateSize()
1423 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1436 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1452 int hi = getFence(); in tryAdvance()
1480 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1492 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1509 int hi = getFence(); in tryAdvance()
1539 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1551 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
[all …]
|
| H A 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()
|
| H A 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()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/ |
| H A 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 …]
|
| H A 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()
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.base/share/classes/java/util/ |
| H A D | IdentityHashMap.java | 1406 final int getFence() { // initialize fence and size on first use in getFence() method in IdentityHashMap.IdentityHashMapSpliterator
1417 getFence(); // force init in estimateSize()
1431 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1444 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1460 int hi = getFence(); in tryAdvance()
1488 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1500 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1517 int hi = getFence(); in tryAdvance()
1547 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1559 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
[all …]
|
| H A 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()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.base/share/classes/java/util/ |
| H A D | IdentityHashMap.java | 1404 final int getFence() { // initialize fence and size on first use in getFence() method in IdentityHashMap.IdentityHashMapSpliterator
1415 getFence(); // force init in estimateSize()
1429 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1442 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1458 int hi = getFence(); in tryAdvance()
1486 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1498 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1515 int hi = getFence(); in tryAdvance()
1545 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit()
1557 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
[all …]
|
| H A 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()
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/ |
| H A 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 …]
|
| H A D | ArrayDeque.java | 927 private int getFence() { // force initialization in getFence() method in ArrayDeque.DeqSpliterator
937 int t = getFence(), h = index, n = deq.elements.length; in trySplit()
951 int m = a.length - 1, f = getFence(), i = index; in forEachRemaining()
966 int m = a.length - 1, f = getFence(), i = index; in tryAdvance()
979 int n = getFence() - index; in estimateSize()
|