Home
last modified time | relevance | path

Searched refs:origin (Results 1 – 23 of 23) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
DSplittableRandom.java265 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 …]
DRandom.java244 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 …]
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 …]
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()
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 …]
DPriorityQueue.java830 PriorityQueueSpliterator(PriorityQueue<E> pq, int origin, int fence, in PriorityQueueSpliterator() argument
833 this.index = origin; in PriorityQueueSpliterator()
DAbstractList.java673 int origin, int fence) { in RandomAccessSpliterator() argument
675 this.index = origin; in RandomAccessSpliterator()
DTreeMap.java2710 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, in TreeMapSpliterator() argument
2713 this.current = origin; in TreeMapSpliterator()
2743 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, in KeySpliterator() argument
2745 super(tree, origin, fence, side, est, expectedModCount); in KeySpliterator()
2821 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, in DescendingKeySpliterator() argument
2823 super(tree, origin, fence, side, est, expectedModCount); in DescendingKeySpliterator()
2894 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, in ValueSpliterator() argument
2896 super(tree, origin, fence, side, est, expectedModCount); in ValueSpliterator()
2966 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, in EntrySpliterator() argument
2968 super(tree, origin, fence, side, est, expectedModCount); in EntrySpliterator()
DArrayDeque.java926 DeqSpliterator(ArrayDeque<E> deq, int origin, int fence) { in DeqSpliterator() argument
928 this.index = origin; in DeqSpliterator()
DVector.java1371 VectorSpliterator(Vector<E> list, Object[] array, int origin, int fence, in VectorSpliterator() argument
1375 this.index = origin; in VectorSpliterator()
DArrayList.java1331 ArrayListSpliterator(ArrayList<E> list, int origin, int fence, in ArrayListSpliterator() argument
1334 this.index = origin; in ArrayListSpliterator()
/libcore/ojluni/src/main/java/java/util/concurrent/
DThreadLocalRandom.java210 final long internalNextLong(long origin, long bound) { in internalNextLong() argument
212 if (origin < bound) { in internalNextLong()
213 long n = bound - origin, m = n - 1; in internalNextLong()
215 r = (r & m) + origin; in internalNextLong()
221 r += origin; in internalNextLong()
224 while (r < origin || r >= bound) in internalNextLong()
239 final int internalNextInt(int origin, int bound) { in internalNextInt() argument
241 if (origin < bound) { in internalNextInt()
242 int n = bound - origin, m = n - 1; in internalNextInt()
244 r = (r & m) + origin; in internalNextInt()
[all …]
DConcurrentSkipListMap.java3311 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()
3410 Node<K,V> origin, K fence, int est) { in ValueSpliterator() argument
3411 super(comparator, row, origin, fence, est); in ValueSpliterator()
3497 Node<K,V> origin, K fence, int est) { in EntrySpliterator() argument
3498 super(comparator, row, origin, fence, est); in EntrySpliterator()
/libcore/luni/src/test/java/libcore/java/util/
DRandomTest.java79 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/
DRandom.java62 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 …]
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
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
DArrayDeque.java258 DeqSpliterator(java.util.ArrayDeque<E> deq, int origin, int fence) { in DeqSpliterator() argument
DPriorityQueue.java237 java.util.PriorityQueue<E> pq, int origin, int fence, int expectedModCount) { in PriorityQueueSpliterator() argument
DVector.java358 int origin, in VectorSpliterator() argument
DArrayList.java243 java.util.ArrayList<E> list, int origin, int fence, int expectedModCount) { in ArrayListSpliterator() argument
/libcore/ojluni/src/main/java/java/nio/
DCharBufferSpliterator.java48 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/
DStreamSpliterators.java623 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/luni/src/test/java/org/apache/harmony/luni/tests/internal/net/www/protocol/https/
DHttpsURLConnectionTest.java996 public static synchronized void log(String origin, String message) { in log() argument
998 System.out.println("[" + origin + "]: " + message); in log()
/libcore/benchmarks/libs/
Dcaliper.jar.txt142 origin of the Work and reproducing the content of the NOTICE file.