/libcore/ojluni/src/main/java/java/util/ |
H A D | SplittableRandom.java | 225 static final String BAD_RANGE = "bound must be greater than origin"; 252 * the public nextX(origin, bound) methods. These exist mainly to 259 * origin is greater than bound, acts as unbounded form of 262 * @param origin the least value, unless greater than bound 263 * @param bound the upper bound (exclusive), must not equal origin 266 final long internalNextLong(long origin, long bound) { argument 294 if (origin < bound) { 295 long n = bound - origin, m = n - 1; 297 r = (r & m) + origin; 303 r += origin; 321 internalNextInt(int origin, int bound) argument 349 internalNextDouble(double origin, double bound) argument 448 nextInt(int origin, int bound) argument 500 nextLong(long origin, long bound) argument 545 nextDouble(double origin, double bound) argument 836 final int origin; field in class:SplittableRandom.RandomIntsSpliterator 838 RandomIntsSpliterator(SplittableRandom rng, long index, long fence, int origin, int bound) argument 892 final long origin; field in class:SplittableRandom.RandomLongsSpliterator 894 RandomLongsSpliterator(SplittableRandom rng, long index, long fence, long origin, long bound) argument 949 final double origin; field in class:SplittableRandom.RandomDoublesSpliterator 951 RandomDoublesSpliterator(SplittableRandom rng, long index, long fence, double origin, double bound) argument [all...] |
H A D | Random.java | 96 static final String BadRange = "bound must be greater than origin"; 237 * origin is greater than bound, acts as unbounded form of 240 * @param origin the least value, unless greater than bound 241 * @param bound the upper bound (exclusive), must not equal origin 244 final long internalNextLong(long origin, long bound) { argument 246 if (origin < bound) { 247 long n = bound - origin, m = n - 1; 249 r = (r & m) + origin; 255 r += origin; 258 while (r < origin || 275 internalNextInt(int origin, int bound) argument 301 internalNextDouble(double origin, double bound) argument 1006 final int origin; field in class:Random.RandomIntsSpliterator 1008 RandomIntsSpliterator(Random rng, long index, long fence, int origin, int bound) argument 1061 final long origin; field in class:Random.RandomLongsSpliterator 1063 RandomLongsSpliterator(Random rng, long index, long fence, long origin, long bound) argument 1117 final double origin; field in class:Random.RandomDoublesSpliterator 1119 RandomDoublesSpliterator(Random rng, long index, long fence, double origin, double bound) argument [all...] |
H A D | ArrayPrefixHelpers.java | 81 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 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 D | Spliterators.java | 379 * @param origin The inclusive start index 385 private static void checkFromToBounds(int arrayLength, int origin, int fence) { argument 386 if (origin > fence) { 388 "origin(" + origin + ") > fence(" + fence + ")"); 390 if (origin < 0) { 391 throw new ArrayIndexOutOfBoundsException(origin); 919 * @param origin the least index (inclusive) to cover 925 public ArraySpliterator(Object[] array, int origin, int fence, int additionalCharacteristics) { argument 927 this.index = origin; 1010 IntArraySpliterator(int[] array, int origin, int fence, int additionalCharacteristics) argument 1093 LongArraySpliterator(long[] array, int origin, int fence, int additionalCharacteristics) argument 1176 DoubleArraySpliterator(double[] array, int origin, int fence, int additionalCharacteristics) argument [all...] |
H A D | IdentityHashMap.java | 1393 IdentityHashMapSpliterator(IdentityHashMap<K,V> map, int origin, argument 1396 this.index = origin; 1421 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, argument 1423 super(map, origin, fence, est, expectedModCount); 1478 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, argument 1480 super(m, origin, fence, est, expectedModCount); 1537 EntrySpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, argument 1539 super(m, origin, fence, est, expectedModCount);
|
H A D | WeakHashMap.java | 1046 WeakHashMapSpliterator(WeakHashMap<K,V> m, int origin, argument 1050 this.index = origin; 1076 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, argument 1078 super(m, origin, fence, est, expectedModCount); 1156 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, argument 1158 super(m, origin, fence, est, expectedModCount); 1233 EntrySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, argument 1235 super(m, origin, fence, est, expectedModCount);
|
H A D | HashMap.java | 906 HashMapSpliterator(HashMap<K,V> m, int origin, argument 910 this.index = origin; 937 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, argument 939 super(m, origin, fence, est, expectedModCount); 1010 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est, argument 1012 super(m, origin, fence, est, expectedModCount); 1082 EntrySpliterator(HashMap<K,V> m, int origin, int fence, int est, argument 1084 super(m, origin, fence, est, expectedModCount);
|
H A D | PriorityQueue.java | 830 PriorityQueueSpliterator(PriorityQueue<E> pq, int origin, int fence, argument 833 this.index = origin;
|
H A D | TreeMap.java | 2694 * origin and continues up to but not including a given fence (or 2696 * split uses the root as left-fence/right-origin. From there, 2698 * child, also serving as origin for the split-off spliterator. 2699 * Left-hands are symmetric. Descending versions place the origin 2726 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, 2729 this.current = origin; 2759 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, 2761 super(tree, origin, fence, side, est, expectedModCount); 2837 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, 2839 super(tree, origin, fenc 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 D | ArrayDeque.java | 919 DeqSpliterator(ArrayDeque<E> deq, int origin, int fence) { argument 921 this.index = origin;
|
H A D | Vector.java | 1289 VectorSpliterator(Vector<E> list, Object[] array, int origin, int fence, argument 1293 this.index = origin;
|
H A D | ArrayList.java | 1302 ArrayListSpliterator(ArrayList<E> list, int origin, int fence, argument 1305 this.index = origin;
|
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | RandomTest.java | 79 final int origin = 128, bound = 256; 84 rands[i] = rand.nextInt(bound - origin) + origin; 87 int[] streamRands = new Random(0).ints(origin, bound).limit(limit).toArray(); 98 final int origin = 128, bound = 256; 103 rands[i] = rand.nextInt(bound - origin) + origin; 106 int[] streamRands = new Random(0).ints(size, origin, bound).toArray(); 108 assertEquals(size, new Random(0).ints(size, origin, bound).count()); 154 final int origin [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ThreadLocalRandom.java | 174 * origin is greater than bound, acts as unbounded form of 177 * @param origin the least value, unless greater than bound 178 * @param bound the upper bound (exclusive), must not equal origin 181 final long internalNextLong(long origin, long bound) { argument 183 if (origin < bound) { 184 long n = bound - origin, m = n - 1; 186 r = (r & m) + origin; 192 r += origin; 195 while (r < origin || r >= bound) 206 * @param origin th 210 internalNextInt(int origin, int bound) argument 238 internalNextDouble(double origin, double bound) argument 293 nextInt(int origin, int bound) argument 344 nextLong(long origin, long bound) argument 389 nextDouble(double origin, double bound) argument 714 final int origin; field in class:ThreadLocalRandom.RandomIntsSpliterator 716 RandomIntsSpliterator(long index, long fence, int origin, int bound) argument 769 final long origin; field in class:ThreadLocalRandom.RandomLongsSpliterator 771 RandomLongsSpliterator(long index, long fence, long origin, long bound) argument 825 final double origin; field in class:ThreadLocalRandom.RandomDoublesSpliterator 827 RandomDoublesSpliterator(long index, long fence, double origin, double bound) argument [all...] |
H A D | ForkJoinPool.java | 419 * pseudorandom permutation order by randomly selecting an origin 1929 * @param r a random seed for origin index 1936 origin = m & r, idx = origin, 1968 else if ((idx = (idx + step) & m) == origin) { 2011 origin = r & m, k = origin, // first queue to scan 2022 origin = k; // reset 2035 k = origin = r & m; // move and restart 2038 else if ((k = (k + step) & m) == origin) { [all...] |
H A D | ConcurrentSkipListMap.java | 3279 Node<K,V> current; // current traversal node; initialize at origin 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); 3368 for (;;) { // ensure h corresponds to origin p 3381 Node<K,V> origin, K fence, int est) { 3382 super(comparator, row, origin, fence, est); 3468 Node<K,V> origin, K fence, int est) { 3469 super(comparator, row, origin, fenc 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...] |
/libcore/ojluni/src/main/java/java/nio/ |
H A D | CharBufferSpliterator.java | 48 CharBufferSpliterator(CharBuffer buffer, int origin, int limit) { argument 49 assert origin <= limit; 51 this.index = (origin <= limit) ? origin : limit;
|
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | StreamSpliterators.java | 623 SliceSpliterator(T_SPLITR s, long sliceOrigin, long sliceFence, long origin, long fence) { argument 628 this.index = origin; 632 protected abstract T_SPLITR makeSpliterator(T_SPLITR s, long sliceOrigin, long sliceFence, long origin, long fence); argument 698 long sliceOrigin, long sliceFence, long origin, long fence) { 699 super(s, sliceOrigin, sliceFence, origin, fence); 705 long origin, long fence) { 706 return new OfRef<>(s, sliceOrigin, sliceFence, origin, fence); 767 long sliceOrigin, long sliceFence, long origin, long fence) { 768 super(s, sliceOrigin, sliceFence, origin, fence); 827 long sliceOrigin, long sliceFence, long origin, lon 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 [all...] |
/libcore/luni/src/test/java/org/apache/harmony/luni/tests/internal/net/www/protocol/https/ |
H A D | HttpsURLConnectionTest.java | 994 public static synchronized void log(String origin, String message) { argument 996 System.out.println("[" + origin + "]: " + message);
|