Home
last modified time | relevance | path

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

12

/libcore/ojluni/src/main/java/java/util/
DSplittableRandom.java834 final long fence; field in SplittableRandom.RandomIntsSpliterator
837 RandomIntsSpliterator(SplittableRandom rng, long index, long fence, in RandomIntsSpliterator() argument
839 this.rng = rng; this.index = index; this.fence = fence; in RandomIntsSpliterator()
844 long i = index, m = (i + fence) >>> 1; in trySplit()
850 return fence - index; in estimateSize()
860 long i = index, f = fence; in tryAdvance()
871 long i = index, f = fence; in forEachRemaining()
890 final long fence; field in SplittableRandom.RandomLongsSpliterator
893 RandomLongsSpliterator(SplittableRandom rng, long index, long fence, in RandomLongsSpliterator() argument
895 this.rng = rng; this.index = index; this.fence = fence; in RandomLongsSpliterator()
[all …]
DRandom.java1001 final long fence; field in Random.RandomIntsSpliterator
1004 RandomIntsSpliterator(Random rng, long index, long fence, in RandomIntsSpliterator() argument
1006 this.rng = rng; this.index = index; this.fence = fence; in RandomIntsSpliterator()
1011 long i = index, m = (i + fence) >>> 1; in trySplit()
1017 return fence - index; in estimateSize()
1027 long i = index, f = fence; in tryAdvance()
1038 long i = index, f = fence; in forEachRemaining()
1056 final long fence; field in Random.RandomLongsSpliterator
1059 RandomLongsSpliterator(Random rng, long index, long fence, in RandomLongsSpliterator() argument
1061 this.rng = rng; this.index = index; this.fence = fence; in RandomLongsSpliterator()
[all …]
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()
902 private final int fence; // one past last index field in Spliterators.ArraySpliterator
925 … public ArraySpliterator(Object[] array, int origin, int fence, int additionalCharacteristics) { in ArraySpliterator() argument
928 this.fence = fence; in ArraySpliterator()
934 int lo = index, mid = (lo + fence) >>> 1; in trySplit()
946 if ((a = array).length >= (hi = fence) && in forEachRemaining()
[all …]
DArrayDeque.java611 private int fence = tail; field in ArrayDeque.DeqIterator
620 return cursor != fence; in hasNext()
624 if (cursor == fence) in next()
630 if (tail != fence || result == null) in next()
642 fence = tail; in remove()
651 int m = a.length - 1, f = fence, i = cursor; in forEachRemaining()
673 private int fence = head; field in ArrayDeque.DescendingIterator
677 return cursor != fence; in hasNext()
681 if (cursor == fence) in next()
686 if (head != fence || result == null) in next()
[all …]
DArrayPrefixHelpers.java110 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.CumulateTask
118 this.lo = this.origin = lo; this.hi = this.fence = hi; in CumulateTask()
127 T[] array, int origin, int fence, int threshold, in CumulateTask() argument
131 this.origin = origin; this.fence = fence; in CumulateTask()
141 int th = threshold, org = origin, fnc = fence, l, h; in compute()
262 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.LongCumulateTask
270 this.lo = this.origin = lo; this.hi = this.fence = hi; in LongCumulateTask()
279 long[] array, int origin, int fence, int threshold, in LongCumulateTask() argument
283 this.origin = origin; this.fence = fence; in LongCumulateTask()
293 int th = threshold, org = origin, fnc = fence, l, h; in compute()
[all …]
DWeakHashMap.java1066 int fence; // -1 until first use; then one past last index field in WeakHashMap.WeakHashMapSpliterator
1071 int fence, int est, in WeakHashMapSpliterator() argument
1075 this.fence = fence; in WeakHashMapSpliterator()
1082 if ((hi = fence) < 0) { in getFence()
1086 hi = fence = m.table.length; in getFence()
1100 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in KeySpliterator() argument
1102 super(m, origin, fence, est, expectedModCount); in KeySpliterator()
1118 if ((hi = fence) < 0) { in forEachRemaining()
1120 hi = fence = tab.length; in forEachRemaining()
1180 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument
[all …]
DPriorityQueue.java826 private int fence; // -1 until first use field in PriorityQueue.PriorityQueueSpliterator
830 PriorityQueueSpliterator(PriorityQueue<E> pq, int origin, int fence, in PriorityQueueSpliterator() argument
834 this.fence = fence; in PriorityQueueSpliterator()
840 if ((hi = fence) < 0) { in getFence()
842 hi = fence = pq.size; in getFence()
861 if ((hi = fence) < 0) { in forEachRemaining()
DAbstractList.java654 private int fence; // -1 until used; then one past last index field in AbstractList.RandomAccessSpliterator
665 this.fence = -1; in RandomAccessSpliterator()
673 int origin, int fence) { in RandomAccessSpliterator() argument
676 this.fence = fence; in RandomAccessSpliterator()
685 if ((hi = fence) < 0) { in getFence()
689 hi = fence = lst.size(); in getFence()
DTreeMap.java1693 TreeMapEntry<K,V> fence) { in SubMapIterator() argument
1697 fenceKey = fence == null ? UNBOUNDED : fence.key; in SubMapIterator()
1753 TreeMapEntry<K,V> fence) { in SubMapEntryIterator() argument
1754 super(first, fence); in SubMapEntryIterator()
1766 TreeMapEntry<K,V> fence) { in DescendingSubMapEntryIterator() argument
1767 super(last, fence); in DescendingSubMapEntryIterator()
1782 TreeMapEntry<K,V> fence) { in SubMapKeyIterator() argument
1783 super(first, fence); in SubMapKeyIterator()
1820 TreeMapEntry<K,V> fence) { in DescendingSubMapKeyIterator() argument
1821 super(last, fence); in DescendingSubMapKeyIterator()
[all …]
DIdentityHashMap.java1386 int fence; // -1 until first use; then one past last index field in IdentityHashMap.IdentityHashMapSpliterator
1391 int fence, int est, int expectedModCount) { in IdentityHashMapSpliterator() argument
1394 this.fence = fence; in IdentityHashMapSpliterator()
1401 if ((hi = fence) < 0) { in getFence()
1404 hi = fence = map.table.length; in getFence()
1418 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, in KeySpliterator() argument
1420 super(map, origin, fence, est, expectedModCount); in KeySpliterator()
1468 return (fence < 0 || est == map.size ? SIZED : 0) | Spliterator.DISTINCT; in characteristics()
1475 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument
1477 super(m, origin, fence, est, expectedModCount); in ValueSpliterator()
[all …]
DVector.java1367 private int fence; // -1 until used; then one past last index field in VectorSpliterator
1371 VectorSpliterator(Vector<E> list, Object[] array, int origin, int fence, in VectorSpliterator() argument
1376 this.fence = fence; in VectorSpliterator()
1382 if ((hi = fence) < 0) { in getFence()
1386 hi = fence = list.elementCount; in getFence()
1421 if ((hi = fence) < 0) { in forEachRemaining()
1425 hi = fence = lst.elementCount; in forEachRemaining()
DArrayList.java1327 private int fence; // -1 until used; then one past last index field in ArrayListSpliterator
1331 ArrayListSpliterator(ArrayList<E> list, int origin, int fence, in ArrayListSpliterator() argument
1335 this.fence = fence; in ArrayListSpliterator()
1342 if ((hi = fence) < 0) { in getFence()
1344 hi = fence = 0; in getFence()
1347 hi = fence = lst.size; in getFence()
1381 if ((hi = fence) < 0) { in forEachRemaining()
DHashMap.java1485 int fence; // one past last index field in HashMap.HashMapSpliterator
1490 int fence, int est, in HashMapSpliterator() argument
1494 this.fence = fence; in HashMapSpliterator()
1501 if ((hi = fence) < 0) { in getFence()
1506 hi = fence = (tab == null) ? 0 : tab.length; in getFence()
1520 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, in KeySpliterator() argument
1522 super(m, origin, fence, est, expectedModCount); in KeySpliterator()
1538 if ((hi = fence) < 0) { in forEachRemaining()
1540 hi = fence = (tab == null) ? 0 : tab.length; in forEachRemaining()
1584 return (fence < 0 || est == map.size ? Spliterator.SIZED : 0) | in characteristics()
[all …]
/libcore/ojluni/src/main/java/java/util/stream/
DStreamSpliterators.java621 long fence; field in StreamSpliterators.AbstractWrappingSpliterator.SliceSpliterator
623 SliceSpliterator(T_SPLITR s, long sliceOrigin, long sliceFence, long origin, long fence) { in SliceSpliterator() argument
629 this.fence = fence; in SliceSpliterator()
632 …t T_SPLITR makeSpliterator(T_SPLITR s, long sliceOrigin, long sliceFence, long origin, long fence); in makeSpliterator() argument
635 if (sliceOrigin >= fence) in trySplit()
638 if (index >= fence) in trySplit()
665 fence = leftSplitFence; in trySplit()
681 return (sliceOrigin < fence) in estimateSize()
682 ? fence - Math.max(sliceOrigin, index) : 0; in estimateSize()
698 long sliceOrigin, long sliceFence, long origin, long fence) { in OfRef() argument
[all …]
DNodes.java1832 protected int index, fence;
1892 fence = index + (int) length;
1920 if (index >= fence) {
1952 if (index >= fence) {
1984 if (index >= fence) {
2016 if (index >= fence) {
/libcore/ojluni/src/main/java/java/util/concurrent/
DThreadLocalRandom.java743 final long fence; field in ThreadLocalRandom.RandomIntsSpliterator
746 RandomIntsSpliterator(long index, long fence, in RandomIntsSpliterator() argument
748 this.index = index; this.fence = fence; in RandomIntsSpliterator()
753 long i = index, m = (i + fence) >>> 1; in trySplit()
759 return fence - index; in estimateSize()
769 long i = index, f = fence; in tryAdvance()
780 long i = index, f = fence; in forEachRemaining()
798 final long fence; field in ThreadLocalRandom.RandomLongsSpliterator
801 RandomLongsSpliterator(long index, long fence, in RandomLongsSpliterator() argument
803 this.index = index; this.fence = fence; in RandomLongsSpliterator()
[all …]
DPriorityBlockingQueue.java939 int fence; field in PriorityBlockingQueue.PBQSpliterator
942 int index, int fence) { in PBQSpliterator() argument
946 this.fence = fence; in PBQSpliterator()
951 if ((hi = fence) < 0) in getFence()
952 hi = fence = (array = queue.toArray()).length; in getFence()
968 fence = (a = queue.toArray()).length; in forEachRemaining()
969 if ((hi = fence) <= a.length && in forEachRemaining()
DConcurrentSkipListMap.java3306 final K fence; // exclusive upper bound for keys, or null if to end field in ConcurrentSkipListMap.CSLMSpliterator
3311 Node<K,V> origin, K fence, int est) { in CSLMSpliterator() argument
3313 this.current = origin; this.fence = fence; this.est = est; in CSLMSpliterator()
3322 Node<K,V> origin, K fence, int est) { in KeySpliterator() argument
3323 super(comparator, row, origin, fence, est); in KeySpliterator()
3329 K f = fence; in trySplit()
3351 K f = fence; in forEachRemaining()
3366 K f = fence; in tryAdvance()
3410 Node<K,V> origin, K fence, int est) { in ValueSpliterator() argument
3411 super(comparator, row, origin, fence, est); in ValueSpliterator()
[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
DArrayList.java243 java.util.ArrayList<E> list, int origin, int fence, int expectedModCount) { in ArrayListSpliterator() argument
273 private int fence; field in ArrayList.ArrayListSpliterator
/libcore/ojluni/annotations/hiddenapi/java/util/concurrent/
DPriorityBlockingQueue.java276 int fence) { in PBQSpliterator() argument
306 int fence; field in PriorityBlockingQueue.PBQSpliterator

12