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

/libcore/ojluni/src/main/java/java/util/
H A DRandom.java1005 final long fence; field in class:Random.RandomIntsSpliterator
1008 RandomIntsSpliterator(Random rng, long index, long fence, argument
1010 this.rng = rng; this.index = index; this.fence = fence;
1015 long i = index, m = (i + fence) >>> 1;
1021 return fence - index;
1031 long i = index, f = fence;
1042 long i = index, f = fence;
1060 final long fence; field in class:Random.RandomLongsSpliterator
1063 RandomLongsSpliterator(Random rng, long index, long fence, argument
1116 final long fence; field in class:Random.RandomDoublesSpliterator
1119 RandomDoublesSpliterator(Random rng, long index, long fence, double origin, double bound) argument
[all...]
H A DSplittableRandom.java835 final long fence; field in class:SplittableRandom.RandomIntsSpliterator
838 RandomIntsSpliterator(SplittableRandom rng, long index, long fence, argument
840 this.rng = rng; this.index = index; this.fence = fence;
845 long i = index, m = (i + fence) >>> 1;
851 return fence - index;
861 long i = index, f = fence;
872 long i = index, f = fence;
891 final long fence; field in class:SplittableRandom.RandomLongsSpliterator
894 RandomLongsSpliterator(SplittableRandom rng, long index, long fence, argument
948 final long fence; field in class:SplittableRandom.RandomDoublesSpliterator
951 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.java604 private int fence = tail; field in class:ArrayDeque.DeqIterator
613 return cursor != fence;
617 if (cursor == fence)
623 if (tail != fence || result == null)
635 fence = tail;
644 int m = a.length - 1, f = fence, i = cursor;
662 * for fence.
666 private int fence = head; field in class:ArrayDeque.DescendingIterator
670 return cursor != fence;
674 if (cursor == fence)
915 private int fence; // -1 until first use field in class:ArrayDeque.DeqSpliterator
919 DeqSpliterator(ArrayDeque<E> deq, int origin, int fence) argument
[all...]
H A DArrayPrefixHelpers.java81 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.CumulateTask
89 this.lo = this.origin = lo; this.hi = this.fence = hi;
98 T[] array, int origin, int fence, int threshold,
102 this.origin = origin; this.fence = fence;
112 int th = threshold, org = origin, fnc = fence, l, h;
233 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.LongCumulateTask
241 this.lo = this.origin = lo; this.hi = this.fence = hi;
250 long[] array, int origin, int fence, int threshold,
254 this.origin = origin; this.fence
97 CumulateTask(CumulateTask<T> parent, BinaryOperator<T> function, T[] array, int origin, int fence, int threshold, int lo, int hi) argument
249 LongCumulateTask(LongCumulateTask parent, LongBinaryOperator function, long[] array, int origin, int fence, int threshold, int lo, int hi) argument
383 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.DoubleCumulateTask
399 DoubleCumulateTask(DoubleCumulateTask parent, DoubleBinaryOperator function, double[] array, int origin, int fence, int threshold, int lo, int hi) argument
533 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.IntCumulateTask
549 IntCumulateTask(IntCumulateTask parent, IntBinaryOperator function, int[] array, int origin, int fence, int threshold, int lo, int hi) argument
[all...]
H A DWeakHashMap.java1042 int fence; // -1 until first use; then one past last index field in class:WeakHashMap.WeakHashMapSpliterator
1047 int fence, int est,
1051 this.fence = fence;
1056 final int getFence() { // initialize fence and size on first use
1058 if ((hi = fence) < 0) {
1062 hi = fence = m.table.length;
1076 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, argument
1078 super(m, origin, fence, est, expectedModCount);
1094 if ((hi = fence) <
1046 WeakHashMapSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1156 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1233 EntrySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...]
H A DHashMap.java902 int fence; // one past last index field in class:HashMap.HashMapSpliterator
907 int fence, int est,
911 this.fence = fence;
916 final int getFence() { // initialize fence and size on first use
918 if ((hi = fence) < 0) {
923 hi = fence = (tab == null) ? 0 : tab.length;
937 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, argument
939 super(m, origin, fence, est, expectedModCount);
955 if ((hi = fence) <
906 HashMapSpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1010 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1082 EntrySpliterator(HashMap<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.java1389 int fence; // -1 until first use; then one past last index field in class:IdentityHashMap.IdentityHashMapSpliterator
1391 int expectedModCount; // initialized when fence set
1394 int fence, int est, int expectedModCount) {
1397 this.fence = fence;
1402 final int getFence() { // initialize fence and size on first use
1404 if ((hi = fence) < 0) {
1407 hi = fence = map.table.length;
1421 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, argument
1423 super(map, origin, fence, es
1393 IdentityHashMapSpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, int expectedModCount) argument
1478 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1537 EntrySpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...]
H A DTreeMap.java1356 * Dummy value serving as unmatchable fence key for unbounded
1494 /** Returns the absolute high fence for ascending traversal */
1501 /** Return the absolute low fence for descending traversal */
1713 TreeMapEntry<K,V> fence) {
1717 fenceKey = fence == null ? UNBOUNDED : fence.key;
1773 TreeMapEntry<K,V> fence) {
1774 super(first, fence);
1786 TreeMapEntry<K,V> fence) {
1787 super(last, fence);
1712 SubMapIterator(TreeMapEntry<K,V> first, TreeMapEntry<K,V> fence) argument
1772 SubMapEntryIterator(TreeMapEntry<K,V> first, TreeMapEntry<K,V> fence) argument
1785 DescendingSubMapEntryIterator(TreeMapEntry<K,V> last, TreeMapEntry<K,V> fence) argument
1801 SubMapKeyIterator(TreeMapEntry<K,V> first, TreeMapEntry<K,V> fence) argument
1839 DescendingSubMapKeyIterator(TreeMapEntry<K,V> last, TreeMapEntry<K,V> fence) argument
2720 TreeMapEntry<K,V> fence; // one past last, or null field in class:TreeMap.TreeMapSpliterator
2725 TreeMapSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2758 KeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2836 DescendingKeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2909 ValueSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2981 EntrySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
[all...]
H A DVector.java1285 private int fence; // -1 until used; then one past last index field in class:Vector.VectorSpliterator
1286 private int expectedModCount; // initialized when fence set
1289 VectorSpliterator(Vector<E> list, Object[] array, int origin, int fence, argument
1294 this.fence = fence;
1300 if ((hi = fence) < 0) {
1304 hi = fence = list.elementCount;
1339 if ((hi = fence) < 0) {
1343 hi = fence = lst.elementCount;
H A DArrayList.java1274 * initialize fence and expectedModCount until the latest
1298 private int fence; // -1 until used; then one past last index field in class:ArrayList.ArrayListSpliterator
1299 private int expectedModCount; // initialized when fence set
1302 ArrayListSpliterator(ArrayList<E> list, int origin, int fence, argument
1306 this.fence = fence;
1310 private int getFence() { // initialize fence to size on first use
1313 if ((hi = fence) < 0) {
1315 hi = fence = 0;
1318 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/luni/src/main/java/java/util/concurrent/
H A DThreadLocalRandom.java713 final long fence; field in class:ThreadLocalRandom.RandomIntsSpliterator
716 RandomIntsSpliterator(long index, long fence, argument
718 this.index = index; this.fence = fence;
723 long i = index, m = (i + fence) >>> 1;
729 return fence - index;
739 long i = index, f = fence;
750 long i = index, f = fence;
768 final long fence; field in class:ThreadLocalRandom.RandomLongsSpliterator
771 RandomLongsSpliterator(long index, long fence, argument
824 final long fence; field in class:ThreadLocalRandom.RandomDoublesSpliterator
827 RandomDoublesSpliterator(long index, long fence, double origin, double bound) argument
[all...]
H A DPriorityBlockingQueue.java910 int fence; field in class:PriorityBlockingQueue.PBQSpliterator
913 int index, int fence) {
917 this.fence = fence;
922 if ((hi = fence) < 0)
923 hi = fence = (array = queue.toArray()).length;
939 fence = (a = queue.toArray()).length;
940 if ((hi = fence) <= a.length &&
912 PBQSpliterator(PriorityBlockingQueue<E> queue, Object[] array, int index, int fence) argument
H A DConcurrentSkipListMap.java3277 final K fence; // exclusive upper bound for keys, or null if to end field in class:ConcurrentSkipListMap.CSLMSpliterator
3282 Node<K,V> origin, K fence, int est) {
3284 this.current = origin; this.fence = fence; this.est = est;
3293 Node<K,V> origin, K fence, int est) {
3294 super(comparator, row, origin, fence, est);
3300 K f = fence;
3322 K f = fence;
3337 K f = fence;
3381 Node<K,V> origin, K fence, in
3281 CSLMSpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
3292 KeySpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
3380 ValueSpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
3467 EntrySpliterator(Comparator<? super K> comparator, Index<K,V> row, Node<K,V> origin, K fence, int est) argument
[all...]

Completed in 269 milliseconds