Searched refs:fence (Results 1 - 18 of 18) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
H A DRandom.java1001 final long fence; field in class:Random.RandomIntsSpliterator
1004 RandomIntsSpliterator(Random rng, long index, long fence, argument
1006 this.rng = rng; this.index = index; this.fence = fence;
1011 long i = index, m = (i + fence) >>> 1;
1017 return fence - index;
1027 long i = index, f = fence;
1038 long i = index, f = fence;
1056 final long fence; field in class:Random.RandomLongsSpliterator
1059 RandomLongsSpliterator(Random rng, long index, long fence, argument
1112 final long fence; field in class:Random.RandomDoublesSpliterator
1115 RandomDoublesSpliterator(Random rng, long index, long fence, double origin, double bound) argument
[all...]
H A DSplittableRandom.java834 final long fence; field in class:SplittableRandom.RandomIntsSpliterator
837 RandomIntsSpliterator(SplittableRandom rng, long index, long fence, argument
839 this.rng = rng; this.index = index; this.fence = fence;
844 long i = index, m = (i + fence) >>> 1;
850 return fence - index;
860 long i = index, f = fence;
871 long i = index, f = fence;
890 final long fence; field in class:SplittableRandom.RandomLongsSpliterator
893 RandomLongsSpliterator(SplittableRandom rng, long index, long fence, argument
947 final long fence; field in class:SplittableRandom.RandomDoublesSpliterator
950 RandomDoublesSpliterator(SplittableRandom rng, long index, long fence, double origin, double bound) argument
[all...]
H A DSpliterators.java380 * @param fence The exclusive end index
385 private static void checkFromToBounds(int arrayLength, int origin, int fence) { argument
386 if (origin > fence) {
388 "origin(" + origin + ") > fence(" + fence + ")");
393 if (fence > arrayLength) {
394 throw new ArrayIndexOutOfBoundsException(fence);
902 private final int fence; // one past last index field in class:Spliterators.ArraySpliterator
920 * @param fence one past the greatest index to cover
925 public ArraySpliterator(Object[] array, int origin, int fence, in argument
987 private final int fence; // one past last index field in class:Spliterators.IntArraySpliterator
1010 IntArraySpliterator(int[] array, int origin, int fence, int additionalCharacteristics) argument
1070 private final int fence; // one past last index field in class:Spliterators.LongArraySpliterator
1093 LongArraySpliterator(long[] array, int origin, int fence, int additionalCharacteristics) argument
1153 private final int fence; // one past last index field in class:Spliterators.DoubleArraySpliterator
1176 DoubleArraySpliterator(double[] array, int origin, int fence, int additionalCharacteristics) argument
[all...]
H A DArrayDeque.java605 private int fence = tail; field in class:ArrayDeque.DeqIterator
614 return cursor != fence;
618 if (cursor == fence)
624 if (tail != fence || result == null)
636 fence = tail;
645 int m = a.length - 1, f = fence, i = cursor;
663 * for fence.
667 private int fence = head; field in class:ArrayDeque.DescendingIterator
671 return cursor != fence;
675 if (cursor == fence)
916 private int fence; // -1 until first use field in class:ArrayDeque.DeqSpliterator
920 DeqSpliterator(ArrayDeque<E> deq, int origin, int fence) argument
[all...]
H A DArrayPrefixHelpers.java110 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.CumulateTask
118 this.lo = this.origin = lo; this.hi = this.fence = hi;
127 T[] array, int origin, int fence, int threshold,
131 this.origin = origin; this.fence = fence;
141 int th = threshold, org = origin, fnc = fence, l, h;
262 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.LongCumulateTask
270 this.lo = this.origin = lo; this.hi = this.fence = hi;
279 long[] array, int origin, int fence, int threshold,
283 this.origin = origin; this.fence
126 CumulateTask(CumulateTask<T> parent, BinaryOperator<T> function, T[] array, int origin, int fence, int threshold, int lo, int hi) argument
278 LongCumulateTask(LongCumulateTask parent, LongBinaryOperator function, long[] array, int origin, int fence, int threshold, int lo, int hi) argument
412 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.DoubleCumulateTask
428 DoubleCumulateTask(DoubleCumulateTask parent, DoubleBinaryOperator function, double[] array, int origin, int fence, int threshold, int lo, int hi) argument
562 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.IntCumulateTask
578 IntCumulateTask(IntCumulateTask parent, IntBinaryOperator function, int[] array, int origin, int fence, int threshold, int lo, int hi) argument
[all...]
H A DWeakHashMap.java1066 int fence; // -1 until first use; then one past last index field in class:WeakHashMap.WeakHashMapSpliterator
1071 int fence, int est,
1075 this.fence = fence;
1080 final int getFence() { // initialize fence and size on first use
1082 if ((hi = fence) < 0) {
1086 hi = fence = m.table.length;
1100 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, argument
1102 super(m, origin, fence, est, expectedModCount);
1118 if ((hi = fence) <
1070 WeakHashMapSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1180 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1257 EntrySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...]
H A DPriorityQueue.java826 private int fence; // -1 until first use field in class:PriorityQueue.PriorityQueueSpliterator
827 private int expectedModCount; // initialized when fence set
830 PriorityQueueSpliterator(PriorityQueue<E> pq, int origin, int fence, argument
834 this.fence = fence;
838 private int getFence() { // initialize fence to size on first use
840 if ((hi = fence) < 0) {
842 hi = fence = pq.size;
861 if ((hi = fence) < 0) {
H A DIdentityHashMap.java1386 int fence; // -1 until first use; then one past last index field in class:IdentityHashMap.IdentityHashMapSpliterator
1388 int expectedModCount; // initialized when fence set
1391 int fence, int est, int expectedModCount) {
1394 this.fence = fence;
1399 final int getFence() { // initialize fence and size on first use
1401 if ((hi = fence) < 0) {
1404 hi = fence = map.table.length;
1418 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, argument
1420 super(map, origin, fence, es
1390 IdentityHashMapSpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, int expectedModCount) argument
1475 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1534 EntrySpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...]
H A DTreeMap.java1336 * Dummy value serving as unmatchable fence key for unbounded
1474 /** Returns the absolute high fence for ascending traversal */
1481 /** Return the absolute low fence for descending traversal */
1693 TreeMapEntry<K,V> fence) {
1697 fenceKey = fence == null ? UNBOUNDED : fence.key;
1753 TreeMapEntry<K,V> fence) {
1754 super(first, fence);
1766 TreeMapEntry<K,V> fence) {
1767 super(last, fence);
1692 SubMapIterator(TreeMapEntry<K,V> first, TreeMapEntry<K,V> fence) argument
1752 SubMapEntryIterator(TreeMapEntry<K,V> first, TreeMapEntry<K,V> fence) argument
1765 DescendingSubMapEntryIterator(TreeMapEntry<K,V> last, TreeMapEntry<K,V> fence) argument
1781 SubMapKeyIterator(TreeMapEntry<K,V> first, TreeMapEntry<K,V> fence) argument
1819 DescendingSubMapKeyIterator(TreeMapEntry<K,V> last, TreeMapEntry<K,V> fence) argument
2704 TreeMapEntry<K,V> fence; // one past last, or null field in class:TreeMap.TreeMapSpliterator
2709 TreeMapSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2742 KeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2820 DescendingKeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2893 ValueSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2965 EntrySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
[all...]
H A DVector.java1359 private int fence; // -1 until used; then one past last index field in class:Vector.VectorSpliterator
1360 private int expectedModCount; // initialized when fence set
1363 VectorSpliterator(Vector<E> list, Object[] array, int origin, int fence, argument
1368 this.fence = fence;
1374 if ((hi = fence) < 0) {
1378 hi = fence = list.elementCount;
1413 if ((hi = fence) < 0) {
1417 hi = fence = lst.elementCount;
H A DHashMap.java1485 int fence; // one past last index field in class:HashMap.HashMapSpliterator
1490 int fence, int est,
1494 this.fence = fence;
1499 final int getFence() { // initialize fence and size on first use
1501 if ((hi = fence) < 0) {
1506 hi = fence = (tab == null) ? 0 : tab.length;
1520 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, argument
1522 super(m, origin, fence, est, expectedModCount);
1538 if ((hi = fence) <
1489 HashMapSpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1592 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1663 EntrySpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...]
H A DArrayList.java1303 * initialize fence and expectedModCount until the latest
1327 private int fence; // -1 until used; then one past last index field in class:ArrayList.ArrayListSpliterator
1328 private int expectedModCount; // initialized when fence set
1331 ArrayListSpliterator(ArrayList<E> list, int origin, int fence, argument
1335 this.fence = fence;
1339 private int getFence() { // initialize fence to size on first use
1342 if ((hi = fence) < 0) {
1344 hi = fence = 0;
1347 hi = fence
[all...]
/libcore/ojluni/src/main/java/java/util/stream/
H A DStreamSpliterators.java621 long fence; field in class:StreamSpliterators.SliceSpliterator
623 SliceSpliterator(T_SPLITR s, long sliceOrigin, long sliceFence, long origin, long fence) { argument
629 this.fence = fence;
632 protected abstract T_SPLITR makeSpliterator(T_SPLITR s, long sliceOrigin, long sliceFence, long origin, long fence); argument
635 if (sliceOrigin >= fence)
638 if (index >= fence)
665 fence = leftSplitFence;
681 return (sliceOrigin < fence)
682 ? fence
697 OfRef(Spliterator<T> s, long sliceOrigin, long sliceFence, long origin, long fence) argument
703 makeSpliterator(Spliterator<T> s, long sliceOrigin, long sliceFence, long origin, long fence) argument
766 OfPrimitive(T_SPLITR s, long sliceOrigin, long sliceFence, long origin, long fence) argument
826 OfInt(Spliterator.OfInt s, long sliceOrigin, long sliceFence, long origin, long fence) argument
832 makeSpliterator(Spliterator.OfInt s, long sliceOrigin, long sliceFence, long origin, long fence) argument
850 OfLong(Spliterator.OfLong s, long sliceOrigin, long sliceFence, long origin, long fence) argument
856 makeSpliterator(Spliterator.OfLong s, long sliceOrigin, long sliceFence, long origin, long fence) argument
874 OfDouble(Spliterator.OfDouble s, long sliceOrigin, long sliceFence, long origin, long fence) argument
880 makeSpliterator(Spliterator.OfDouble s, long sliceOrigin, long sliceFence, long origin, long fence) argument
1464 forEach(Consumer<? super T> action, long fence) argument
1481 forEach(T_CONS action, long fence) argument
1498 forEach(IntConsumer action, long fence) argument
1519 forEach(LongConsumer action, long fence) argument
1540 forEach(DoubleConsumer action, long fence) argument
[all...]
H A DNodes.java1832 protected int index, fence; field in class:Nodes.SizedCollectorTask
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/
H A DThreadLocalRandom.java742 final long fence; field in class:ThreadLocalRandom.RandomIntsSpliterator
745 RandomIntsSpliterator(long index, long fence, argument
747 this.index = index; this.fence = fence;
752 long i = index, m = (i + fence) >>> 1;
758 return fence - index;
768 long i = index, f = fence;
779 long i = index, f = fence;
797 final long fence; field in class:ThreadLocalRandom.RandomLongsSpliterator
800 RandomLongsSpliterator(long index, long fence, argument
853 final long fence; field in class:ThreadLocalRandom.RandomDoublesSpliterator
856 RandomDoublesSpliterator(long index, long fence, double origin, double bound) argument
[all...]
H A DPriorityBlockingQueue.java939 int fence; field in class:PriorityBlockingQueue.PBQSpliterator
942 int index, int fence) {
946 this.fence = fence;
951 if ((hi = fence) < 0)
952 hi = fence = (array = queue.toArray()).length;
968 fence = (a = queue.toArray()).length;
969 if ((hi = fence) <= a.length &&
941 PBQSpliterator(PriorityBlockingQueue<E> queue, Object[] array, int index, int fence) argument
H A DConcurrentSkipListMap.java3306 final K fence; // exclusive upper bound for keys, or null if to end field in class:ConcurrentSkipListMap.CSLMSpliterator
3311 Node<K,V> origin, K fence, int est) {
3313 this.current = origin; this.fence = fence; this.est = est;
3322 Node<K,V> origin, K fence, int est) {
3323 super(comparator, row, origin, fence, est);
3329 K f = fence;
3351 K f = fence;
3366 K f = fence;
3410 Node<K,V> origin, K fence, in
3310 CSLMSpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
3321 KeySpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
3409 ValueSpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
3496 EntrySpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
[all...]
H A DCopyOnWriteArrayList.java185 * @param fence one past last index to search
189 int index, int fence) {
191 for (int i = index; i < fence; i++)
195 for (int i = index; i < fence; i++)
188 indexOf(Object o, Object[] elements, int index, int fence) argument

Completed in 904 milliseconds