/libcore/ojluni/src/main/java/java/util/ |
D | SplittableRandom.java | 265 final long internalNextLong(long origin, long bound) { in internalNextLong() argument 293 if (origin < bound) { in internalNextLong() 294 long n = bound - origin, m = n - 1; in internalNextLong() 296 r = (r & m) + origin; in internalNextLong() 302 r += origin; in internalNextLong() 305 while (r < origin || r >= bound) in internalNextLong() 320 final int internalNextInt(int origin, int bound) { in internalNextInt() argument 322 if (origin < bound) { in internalNextInt() 323 int n = bound - origin, m = n - 1; in internalNextInt() 325 r = (r & m) + origin; in internalNextInt() [all …]
|
D | Random.java | 244 final long internalNextLong(long origin, long bound) { in internalNextLong() argument 246 if (origin < bound) { in internalNextLong() 247 long n = bound - origin, m = n - 1; in internalNextLong() 249 r = (r & m) + origin; in internalNextLong() 255 r += origin; in internalNextLong() 258 while (r < origin || r >= bound) in internalNextLong() 275 final int internalNextInt(int origin, int bound) { in internalNextInt() argument 276 if (origin < bound) { in internalNextInt() 277 int n = bound - origin; in internalNextInt() 279 return nextInt(n) + origin; in internalNextInt() [all …]
|
D | ArrayPrefixHelpers.java | 110 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 …]
|
D | Spliterators.java | 385 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() 390 if (origin < 0) { in checkFromToBounds() 391 throw new ArrayIndexOutOfBoundsException(origin); in checkFromToBounds() 925 … public ArraySpliterator(Object[] array, int origin, int fence, int additionalCharacteristics) { in ArraySpliterator() argument 927 this.index = origin; in ArraySpliterator() 1010 … public IntArraySpliterator(int[] array, int origin, int fence, int additionalCharacteristics) { in IntArraySpliterator() argument 1012 this.index = origin; in IntArraySpliterator() 1093 … public LongArraySpliterator(long[] array, int origin, int fence, int additionalCharacteristics) { in LongArraySpliterator() argument [all …]
|
D | WeakHashMap.java | 1071 WeakHashMapSpliterator(WeakHashMap<K,V> m, int origin, in WeakHashMapSpliterator() argument 1075 this.index = origin; in WeakHashMapSpliterator() 1101 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in KeySpliterator() argument 1103 super(m, origin, fence, est, expectedModCount); in KeySpliterator() 1181 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument 1183 super(m, origin, fence, est, expectedModCount); in ValueSpliterator() 1258 EntrySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, in EntrySpliterator() argument 1260 super(m, origin, fence, est, expectedModCount); in EntrySpliterator()
|
D | IdentityHashMap.java | 1390 IdentityHashMapSpliterator(IdentityHashMap<K,V> map, int origin, in IdentityHashMapSpliterator() argument 1393 this.index = origin; in IdentityHashMapSpliterator() 1418 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, in KeySpliterator() argument 1420 super(map, origin, fence, est, expectedModCount); in KeySpliterator() 1475 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument 1477 super(m, origin, fence, est, expectedModCount); in ValueSpliterator() 1534 EntrySpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, in EntrySpliterator() argument 1536 super(m, origin, fence, est, expectedModCount); in EntrySpliterator()
|
D | PriorityQueue.java | 830 PriorityQueueSpliterator(PriorityQueue<E> pq, int origin, int fence, in PriorityQueueSpliterator() argument 833 this.index = origin; in PriorityQueueSpliterator()
|
D | AbstractList.java | 673 int origin, int fence) { in RandomAccessSpliterator() argument 675 this.index = origin; in RandomAccessSpliterator()
|
D | TreeMap.java | 2703 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, in TreeMapSpliterator() argument 2706 this.current = origin; in TreeMapSpliterator() 2736 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, in KeySpliterator() argument 2738 super(tree, origin, fence, side, est, expectedModCount); in KeySpliterator() 2814 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, in DescendingKeySpliterator() argument 2816 super(tree, origin, fence, side, est, expectedModCount); in DescendingKeySpliterator() 2887 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, in ValueSpliterator() argument 2889 super(tree, origin, fence, side, est, expectedModCount); in ValueSpliterator() 2959 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, in EntrySpliterator() argument 2961 super(tree, origin, fence, side, est, expectedModCount); in EntrySpliterator()
|
D | HashMap.java | 1489 HashMapSpliterator(HashMap<K,V> m, int origin, in HashMapSpliterator() argument 1493 this.index = origin; in HashMapSpliterator() 1520 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, in KeySpliterator() argument 1522 super(m, origin, fence, est, expectedModCount); in KeySpliterator() 1592 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est, in ValueSpliterator() argument 1594 super(m, origin, fence, est, expectedModCount); in ValueSpliterator() 1663 EntrySpliterator(HashMap<K,V> m, int origin, int fence, int est, in EntrySpliterator() argument 1665 super(m, origin, fence, est, expectedModCount); in EntrySpliterator()
|
D | ArrayDeque.java | 926 DeqSpliterator(ArrayDeque<E> deq, int origin, int fence) { in DeqSpliterator() argument 928 this.index = origin; in DeqSpliterator()
|
D | Vector.java | 1371 VectorSpliterator(Vector<E> list, Object[] array, int origin, int fence, in VectorSpliterator() argument 1375 this.index = origin; in VectorSpliterator()
|
D | BitSet.java | 1231 BitSetSpliterator(int origin, int fence, int est, boolean root) { in stream() argument 1232 this.index = origin; in stream()
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
D | ThreadLocalRandom.java | 223 final long internalNextLong(long origin, long bound) { in internalNextLong() argument 225 if (origin < bound) { in internalNextLong() 226 long n = bound - origin, m = n - 1; in internalNextLong() 228 r = (r & m) + origin; in internalNextLong() 234 r += origin; in internalNextLong() 237 while (r < origin || r >= bound) in internalNextLong() 252 final int internalNextInt(int origin, int bound) { in internalNextInt() argument 254 if (origin < bound) { in internalNextInt() 255 int n = bound - origin, m = n - 1; in internalNextInt() 257 r = (r & m) + origin; in internalNextInt() [all …]
|
D | ForkJoinPool.java | 1817 int origin, step; 1819 origin = (r & ~1) & m; // even indices and steps 1823 origin = r & m; 1827 for (int i = origin, oldSum = 0, checkSum = 0;;) { 1839 if ((i = (i + step) & m) == origin) {
|
/libcore/luni/src/test/java/libcore/java/util/ |
D | RandomTest.java | 79 final int origin = 128, bound = 256; in test_ints$II() local 84 rands[i] = rand.nextInt(bound - origin) + origin; in test_ints$II() 87 int[] streamRands = new Random(0).ints(origin, bound).limit(limit).toArray(); in test_ints$II() 98 final int origin = 128, bound = 256; in test_ints$LII() local 103 rands[i] = rand.nextInt(bound - origin) + origin; in test_ints$LII() 106 int[] streamRands = new Random(0).ints(size, origin, bound).toArray(); in test_ints$LII() 108 assertEquals(size, new Random(0).ints(size, origin, bound).count()); in test_ints$LII() 154 final int origin = 128, bound = 256; in test_longs$II() local 159 rands[i] = (rand.nextLong() & 127) + origin; in test_longs$II() 162 long[] streamRands = new Random(0).longs(origin, bound).limit(limit).toArray(); in test_longs$II() [all …]
|
/libcore/ojluni/annotations/hiddenapi/java/util/ |
D | Random.java | 62 final long internalNextLong(long origin, long bound) { in internalNextLong() argument 66 final int internalNextInt(int origin, int bound) { in internalNextInt() argument 70 final double internalNextDouble(double origin, double bound) { in internalNextDouble() argument 221 java.util.Random rng, long index, long fence, double origin, double bound) { in RandomDoublesSpliterator() argument 259 final double origin; field in Random.RandomDoublesSpliterator 262 origin = 0; 275 RandomIntsSpliterator(java.util.Random rng, long index, long fence, int origin, int bound) { in RandomIntsSpliterator() argument 313 final int origin; field in Random.RandomIntsSpliterator 316 origin = 0; 330 java.util.Random rng, long index, long fence, long origin, long bound) { in RandomLongsSpliterator() argument [all …]
|
D | HashMap.java | 340 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 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
|
D | ArrayDeque.java | 258 DeqSpliterator(java.util.ArrayDeque<E> deq, int origin, int fence) { in DeqSpliterator() argument
|
D | PriorityQueue.java | 237 java.util.PriorityQueue<E> pq, int origin, int fence, int expectedModCount) { in PriorityQueueSpliterator() argument
|
D | Vector.java | 358 int origin, in VectorSpliterator() argument
|
D | ArrayList.java | 243 java.util.ArrayList<E> list, int origin, int fence, int expectedModCount) { in ArrayListSpliterator() argument
|
/libcore/ojluni/src/main/java/java/nio/ |
D | CharBufferSpliterator.java | 48 CharBufferSpliterator(CharBuffer buffer, int origin, int limit) { in CharBufferSpliterator() argument 49 assert origin <= limit; in CharBufferSpliterator() local 51 this.index = (origin <= limit) ? origin : limit; in CharBufferSpliterator()
|
/libcore/ojluni/src/main/java/java/util/stream/ |
D | StreamSpliterators.java | 623 SliceSpliterator(T_SPLITR s, long sliceOrigin, long sliceFence, long origin, long fence) { in SliceSpliterator() argument 628 this.index = origin; in SliceSpliterator() 632 …t T_SPLITR makeSpliterator(T_SPLITR s, long sliceOrigin, long sliceFence, long origin, long fence); in makeSpliterator() argument 698 long sliceOrigin, long sliceFence, long origin, long fence) { in OfRef() argument 699 super(s, sliceOrigin, sliceFence, origin, fence); in OfRef() 705 long origin, long fence) { in makeSpliterator() argument 706 return new OfRef<>(s, sliceOrigin, sliceFence, origin, fence); in makeSpliterator() 767 long sliceOrigin, long sliceFence, long origin, long fence) { in OfPrimitive() argument 768 super(s, sliceOrigin, sliceFence, origin, fence); in OfPrimitive() 827 long sliceOrigin, long sliceFence, long origin, long fence) { in OfInt() argument [all …]
|
/libcore/ojluni/src/main/java/java/lang/ |
D | StringUTF16.java | 328 CharsSpliterator(String array, int origin, int fence, int acs) { in CharsSpliterator() argument 331 this.index = origin; in CharsSpliterator() 415 CodePointsSpliterator(String array, int origin, int fence, int acs) { in CodePointsSpliterator() argument 418 this.index = origin; in CodePointsSpliterator()
|