Home
last modified time | relevance | path

Searched refs:fence (Results 1 – 25 of 30) sorted by relevance

12

/libcore/ojluni/src/main/java/jdk/internal/util/random/
DRandomSupport.java917 public final long fence; field in RandomSupport.RandomSpliterator
924 public RandomSpliterator(long index, long fence) { in RandomSpliterator() argument
925 this.index = index; this.fence = fence; in RandomSpliterator()
934 return fence - index; in estimateSize()
969 long index, long fence, int origin, int bound) { in RandomIntsSpliterator() argument
970 super(index, fence); in RandomIntsSpliterator()
976 long i = index, m = (i + fence) >>> 1; in trySplit()
985 long i = index, f = fence; in tryAdvance()
996 long i = index, f = fence; in forEachRemaining()
1027 long index, long fence, long origin, long bound) { in RandomLongsSpliterator() argument
[all …]
/libcore/ojluni/src/main/java/java/util/stream/
DStreamSpliterators.java619 long fence; field in StreamSpliterators.AbstractWrappingSpliterator.SliceSpliterator
621 SliceSpliterator(T_SPLITR s, long sliceOrigin, long sliceFence, long origin, long fence) { in SliceSpliterator() argument
627 this.fence = fence; in SliceSpliterator()
630 …t T_SPLITR makeSpliterator(T_SPLITR s, long sliceOrigin, long sliceFence, long origin, long fence); in makeSpliterator() argument
633 if (sliceOrigin >= fence) in trySplit()
636 if (index >= fence) in trySplit()
663 fence = leftSplitFence; in trySplit()
679 return (sliceOrigin < fence) in estimateSize()
680 ? fence - Math.max(sliceOrigin, index) : 0; in estimateSize()
696 long sliceOrigin, long sliceFence, long origin, long fence) { in OfRef() argument
[all …]
/libcore/ojluni/src/main/java/java/lang/
DStringLatin1.java618 private final int fence; // one past last index field in StringLatin1.LinesSpliterator
627 this.fence = start + length; in LinesSpliterator()
631 for (int current = start; current < fence; current++) { in indexOfLineSeparator()
637 return fence; in indexOfLineSeparator()
641 if (start < fence) { in skipLineSeparator()
644 if (next < fence && value[next] == '\n') { in skipLineSeparator()
650 return fence; in skipLineSeparator()
665 if (index != fence) { in tryAdvance()
677 while (index != fence) { in forEachRemaining()
684 int half = (fence + index) >>> 1; in trySplit()
[all …]
DStringUTF16.java1016 private final int fence; // one past last index
1036 this.fence = start + length;
1040 for (int current = start; current < fence; current++) {
1046 return fence;
1050 if (start < fence) {
1053 if (next < fence && getChar(value, next) == '\n') {
1059 return fence;
1074 if (index != fence) {
1086 while (index != fence) {
1093 int half = (fence + index) >>> 1;
[all …]
DStackStreamFactory.java555 throw new NoSuchElementException("origin=" + origin + " fence=" + fence); in nextStackFrame()
823 throw new NoSuchElementException("origin=" + origin + " fence=" + fence); in nextStackFrame()
859 int fence; // index to the last frame in the current batch field in StackStreamFactory.FrameBuffer
867 this.fence = 0; in FrameBuffer()
935 return origin >= fence || (origin == START_POS && fence == 0); in isEmpty()
943 fence = 0; in freeze()
951 return origin > 0 && (fence == 0 || origin < fence || fence == currentBatchSize); in isActive()
959 throw new NoSuchElementException("origin=" + origin + " fence=" + fence); in next()
966 Objects.toString(c), index, fence); in next()
976 throw new NoSuchElementException("origin=" + origin + " fence=" + fence); in get()
[all …]
/libcore/ojluni/src/main/java/java/util/
DSpliterators.java385 private static void checkFromToBounds(int arrayLength, int origin, int fence) { in checkFromToBounds() argument
386 if (origin > fence) { in checkFromToBounds()
388 "origin(" + origin + ") > fence(" + fence + ")"); in checkFromToBounds()
393 if (fence > arrayLength) { in checkFromToBounds()
394 throw new ArrayIndexOutOfBoundsException(fence); in checkFromToBounds()
946 private final int fence; // one past last index field in Spliterators.ArraySpliterator
969 … public ArraySpliterator(Object[] array, int origin, int fence, int additionalCharacteristics) { in ArraySpliterator() argument
972 this.fence = fence; in ArraySpliterator()
978 int lo = index, mid = (lo + fence) >>> 1; in trySplit()
990 if ((a = array).length >= (hi = fence) && in forEachRemaining()
[all …]
DArrayPrefixHelpers.java115 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.CumulateTask
123 this.lo = this.origin = lo; this.hi = this.fence = hi; in CumulateTask()
132 T[] array, int origin, int fence, int threshold, in CumulateTask() argument
136 this.origin = origin; this.fence = fence; in CumulateTask()
146 int th = threshold, org = origin, fnc = fence, l, h; in compute()
269 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.LongCumulateTask
277 this.lo = this.origin = lo; this.hi = this.fence = hi; in LongCumulateTask()
286 long[] array, int origin, int fence, int threshold, in LongCumulateTask() argument
290 this.origin = origin; this.fence = fence; in LongCumulateTask()
300 int th = threshold, org = origin, fnc = fence, l, h; in compute()
[all …]
DPriorityQueue.java842 private int fence; // -1 until first use field in PriorityQueue.PriorityQueueSpliterator
846 PriorityQueueSpliterator(int origin, int fence, int expectedModCount) { in PriorityQueueSpliterator() argument
848 this.fence = fence; in PriorityQueueSpliterator()
854 if ((hi = fence) < 0) { in getFence()
856 hi = fence = size; in getFence()
870 if (fence < 0) { fence = size; expectedModCount = modCount; } in forEachRemaining()
873 for (i = index, index = hi = fence; i < hi; i++) { in forEachRemaining()
885 if (fence < 0) { fence = size; expectedModCount = modCount; } in tryAdvance()
887 if ((i = index) < fence) { in tryAdvance()
DWeakHashMap.java1067 int fence; // -1 until first use; then one past last index field in WeakHashMap.WeakHashMapSpliterator
1072 int fence, int est, in WeakHashMapSpliterator() argument
1076 this.fence = fence; in WeakHashMapSpliterator()
1083 if ((hi = fence) < 0) { in getFence()
1087 hi = fence = m.table.length; in getFence()
1101 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in KeySpliterator() argument
1103 super(m, origin, fence, est, expectedModCount); in KeySpliterator()
1119 if ((hi = fence) < 0) { in forEachRemaining()
1121 hi = fence = tab.length; in forEachRemaining()
1181 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument
[all …]
DAbstractList.java656 private int fence; // -1 until used; then one past last index field in AbstractList.RandomAccessSpliterator
667 this.fence = -1; in RandomAccessSpliterator()
675 int origin, int fence) { in RandomAccessSpliterator() argument
678 this.fence = fence; in RandomAccessSpliterator()
687 if ((hi = fence) < 0) { in getFence()
691 hi = fence = lst.size(); in getFence()
DIdentityHashMap.java1389 int fence; // -1 until first use; then one past last index field in IdentityHashMap.IdentityHashMapSpliterator
1394 int fence, int est, int expectedModCount) { in IdentityHashMapSpliterator() argument
1397 this.fence = fence; in IdentityHashMapSpliterator()
1404 if ((hi = fence) < 0) { in getFence()
1407 hi = fence = map.table.length; in getFence()
1421 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, in KeySpliterator() argument
1423 super(map, origin, fence, est, expectedModCount); in KeySpliterator()
1471 return (fence < 0 || est == map.size ? SIZED : 0) | Spliterator.DISTINCT; in characteristics()
1478 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument
1480 super(m, origin, fence, est, expectedModCount); in ValueSpliterator()
[all …]
DTreeMap.java2041 TreeMapEntry<K,V> fence) { in SubMapIterator() argument
2045 fenceKey = fence == null ? UNBOUNDED : fence.key; in SubMapIterator()
2101 TreeMapEntry<K,V> fence) { in SubMapEntryIterator() argument
2102 super(first, fence); in SubMapEntryIterator()
2114 TreeMapEntry<K,V> fence) { in DescendingSubMapEntryIterator() argument
2115 super(last, fence); in DescendingSubMapEntryIterator()
2130 TreeMapEntry<K,V> fence) { in SubMapKeyIterator() argument
2131 super(first, fence); in SubMapKeyIterator()
2168 TreeMapEntry<K,V> fence) { in DescendingSubMapKeyIterator() argument
2169 super(last, fence); in DescendingSubMapKeyIterator()
[all …]
DArrayDeque.java809 private int fence; // -1 until first use field in ArrayDeque.DeqSpliterator
814 this.fence = -1; in DeqSpliterator()
818 DeqSpliterator(int origin, int fence) { in DeqSpliterator() argument
822 this.fence = fence; in DeqSpliterator()
828 if ((t = fence) < 0) { in getFence()
829 t = fence = tail; in getFence()
865 if (fence < 0) { fence = tail; cursor = head; } // late-binding in tryAdvance()
867 if ((i = cursor) == fence) in tryAdvance()
DBitSet.java1230 private int fence; // -1 until used; then one past last bit index in stream() field in BitSet.BitSetSpliterator
1237 BitSetSpliterator(int origin, int fence, int est, boolean root) { in stream() argument
1239 this.fence = fence; in stream()
1246 if ((hi = fence) < 0) { in stream()
1250 hi = fence = (wordsInUse >= wordIndex(Integer.MAX_VALUE)) in stream()
1331 hi = fence = (hi < Integer.MAX_VALUE || !get(Integer.MAX_VALUE)) in stream()
DArrayList.java1535 private int fence = -1; // -1 until used; then one past last index in spliterator() local
1540 if ((hi = fence) < 0) { in spliterator()
1542 hi = fence = offset + size; in spliterator()
1574 if ((hi = fence) < 0) { in spliterator()
1670 private int fence; // -1 until used; then one past last index
1674 ArrayListSpliterator(int origin, int fence, int expectedModCount) {
1676 this.fence = fence;
1682 if ((hi = fence) < 0) {
1684 hi = fence = size;
1716 if ((hi = fence) < 0) {
DVector.java1439 private int fence; // -1 until used; then one past last index field in VectorSpliterator
1443 VectorSpliterator(Object[] array, int origin, int fence, in VectorSpliterator() argument
1447 this.fence = fence; in VectorSpliterator()
1453 if ((hi = fence) < 0) { in getFence()
1457 hi = fence = elementCount; in getFence()
DHashMap.java1646 int fence; // one past last index field in HashMap.HashMapSpliterator
1651 int fence, int est, in HashMapSpliterator() argument
1655 this.fence = fence; in HashMapSpliterator()
1662 if ((hi = fence) < 0) { in getFence()
1667 hi = fence = (tab == null) ? 0 : tab.length; in getFence()
1681 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, in KeySpliterator() argument
1683 super(m, origin, fence, est, expectedModCount); in KeySpliterator()
1699 if ((hi = fence) < 0) { in forEachRemaining()
1701 hi = fence = (tab == null) ? 0 : tab.length; in forEachRemaining()
1745 return (fence < 0 || est == map.size ? Spliterator.SIZED : 0) | in characteristics()
[all …]
/libcore/ojluni/annotations/hiddenapi/java/util/
DRandom.java221 java.util.Random rng, long index, long fence, double origin, double bound) { in RandomDoublesSpliterator() argument
251 final long fence; field in Random.RandomDoublesSpliterator
254 fence = 0;
275 RandomIntsSpliterator(java.util.Random rng, long index, long fence, int origin, int bound) { in RandomIntsSpliterator() argument
305 final long fence; field in Random.RandomIntsSpliterator
308 fence = 0;
330 java.util.Random rng, long index, long fence, long origin, long bound) { in RandomLongsSpliterator() argument
360 final long fence; field in Random.RandomLongsSpliterator
363 fence = 0;
DArrayDeque.java250 private int fence; field in ArrayDeque.DeqIterator
258 DeqSpliterator(java.util.ArrayDeque<E> deq, int origin, int fence) { in DeqSpliterator() argument
292 private int fence; field in ArrayDeque.DeqSpliterator
318 private int fence; field in ArrayDeque.DescendingIterator
DPriorityQueue.java237 java.util.PriorityQueue<E> pq, int origin, int fence, int expectedModCount) { in PriorityQueueSpliterator() argument
267 private int fence; field in PriorityQueue.PriorityQueueSpliterator
DHashMap.java340 java.util.HashMap<K, V> m, int origin, int fence, int est, int expectedModCount) { in EntrySpliterator() argument
396 java.util.HashMap<K, V> m, int origin, int fence, int est, int expectedModCount) { in HashMapSpliterator() argument
414 int fence; field in HashMap.HashMapSpliterator
475 java.util.HashMap<K, V> m, int origin, int fence, int est, int expectedModCount) { in KeySpliterator() argument
652 java.util.HashMap<K, V> m, int origin, int fence, int est, int expectedModCount) { in ValueSpliterator() argument
DVector.java359 int fence, in VectorSpliterator() argument
392 private int fence; field in Vector.VectorSpliterator
/libcore/ojluni/src/main/java/java/math/
DMathContext.java190 int fence = val.indexOf(' '); // could be -1 in MathContext() local
192 setPrecision = Integer.parseInt(val.substring(10, fence)); in MathContext()
194 if (!val.startsWith("roundingMode=", fence+1)) in MathContext()
196 off = fence + 1 + 13; in MathContext()
/libcore/ojluni/src/main/java/java/util/concurrent/
DPriorityBlockingQueue.java941 int fence; field in PriorityBlockingQueue.PBQSpliterator
945 PBQSpliterator(Object[] array, int index, int fence) { in PBQSpliterator() argument
948 this.fence = fence; in PBQSpliterator()
953 fence = (array = toArray()).length; in getFence()
954 return fence; in getFence()
/libcore/ojluni/annotations/hiddenapi/java/util/concurrent/
DPriorityBlockingQueue.java276 int fence) { in PBQSpliterator() argument
306 int fence; field in PriorityBlockingQueue.PBQSpliterator

12