Searched defs:origin (Results 1 - 17 of 17) sorted by relevance

/libcore/ojluni/src/main/java/java/nio/
H A DCharBufferSpliterator.java48 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/
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
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 DRandom.java96 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
1002 final int origin; field in class:Random.RandomIntsSpliterator
1004 RandomIntsSpliterator(Random rng, long index, long fence, int origin, int bound) argument
1057 final long origin; field in class:Random.RandomLongsSpliterator
1059 RandomLongsSpliterator(Random rng, long index, long fence, long origin, long bound) argument
1113 final double origin; field in class:Random.RandomDoublesSpliterator
1115 RandomDoublesSpliterator(Random rng, long index, long fence, double origin, double bound) argument
[all...]
H A DSpliterators.java379 * @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 DSplittableRandom.java224 static final String BAD_RANGE = "bound must be greater than origin";
251 * the public nextX(origin, bound) methods. These exist mainly to
258 * origin is greater than bound, acts as unbounded form of
261 * @param origin the least value, unless greater than bound
262 * @param bound the upper bound (exclusive), must not equal origin
265 final long internalNextLong(long origin, long bound) { argument
293 if (origin < bound) {
294 long n = bound - origin, m = n - 1;
296 r = (r & m) + origin;
302 r += origin;
320 internalNextInt(int origin, int bound) argument
348 internalNextDouble(double origin, double bound) argument
447 nextInt(int origin, int bound) argument
499 nextLong(long origin, long bound) argument
544 nextDouble(double origin, double bound) argument
835 final int origin; field in class:SplittableRandom.RandomIntsSpliterator
837 RandomIntsSpliterator(SplittableRandom rng, long index, long fence, int origin, int bound) argument
891 final long origin; field in class:SplittableRandom.RandomLongsSpliterator
893 RandomLongsSpliterator(SplittableRandom rng, long index, long fence, long origin, long bound) argument
948 final double origin; field in class:SplittableRandom.RandomDoublesSpliterator
950 RandomDoublesSpliterator(SplittableRandom rng, long index, long fence, double origin, double bound) argument
[all...]
H A DArrayDeque.java920 DeqSpliterator(ArrayDeque<E> deq, int origin, int fence) { argument
922 this.index = origin;
H A DPriorityQueue.java830 PriorityQueueSpliterator(PriorityQueue<E> pq, int origin, int fence, argument
833 this.index = origin;
H A DArrayList.java1331 ArrayListSpliterator(ArrayList<E> list, int origin, int fence, argument
1334 this.index = origin;
H A DIdentityHashMap.java1390 IdentityHashMapSpliterator(IdentityHashMap<K,V> map, int origin, argument
1393 this.index = origin;
1418 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, argument
1420 super(map, origin, fence, est, expectedModCount);
1475 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, argument
1477 super(m, origin, fence, est, expectedModCount);
1534 EntrySpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, argument
1536 super(m, origin, fence, est, expectedModCount);
H A DVector.java1363 VectorSpliterator(Vector<E> list, Object[] array, int origin, int fence, argument
1367 this.index = origin;
H A DWeakHashMap.java1070 WeakHashMapSpliterator(WeakHashMap<K,V> m, int origin, argument
1074 this.index = origin;
1100 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, argument
1102 super(m, origin, fence, est, expectedModCount);
1180 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, argument
1182 super(m, origin, fence, est, expectedModCount);
1257 EntrySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, argument
1259 super(m, origin, fence, est, expectedModCount);
H A DHashMap.java1489 HashMapSpliterator(HashMap<K,V> m, int origin, argument
1493 this.index = origin;
1520 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, argument
1522 super(m, origin, fence, est, expectedModCount);
1592 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est, argument
1594 super(m, origin, fence, est, expectedModCount);
1663 EntrySpliterator(HashMap<K,V> m, int origin, int fence, int est, argument
1665 super(m, origin, fence, est, expectedModCount);
H A DTreeMap.java2678 * origin and continues up to but not including a given fence (or
2680 * split uses the root as left-fence/right-origin. From there,
2682 * child, also serving as origin for the split-off spliterator.
2683 * Left-hands are symmetric. Descending versions place the origin
2710 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence,
2713 this.current = origin;
2743 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence,
2745 super(tree, origin, fence, side, est, expectedModCount);
2821 TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence,
2823 super(tree, origin, fenc
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...]
/libcore/luni/src/test/java/org/apache/harmony/luni/tests/internal/net/www/protocol/https/
H A DHttpsURLConnectionTest.java996 public static synchronized void log(String origin, String message) { argument
998 System.out.println("[" + origin + "]: " + message);
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DThreadLocalRandom.java203 * origin is greater than bound, acts as unbounded form of
206 * @param origin the least value, unless greater than bound
207 * @param bound the upper bound (exclusive), must not equal origin
210 final long internalNextLong(long origin, long bound) { argument
212 if (origin < bound) {
213 long n = bound - origin, m = n - 1;
215 r = (r & m) + origin;
221 r += origin;
224 while (r < origin || r >= bound)
235 * @param origin th
239 internalNextInt(int origin, int bound) argument
267 internalNextDouble(double origin, double bound) argument
322 nextInt(int origin, int bound) argument
373 nextLong(long origin, long bound) argument
418 nextDouble(double origin, double bound) argument
743 final int origin; field in class:ThreadLocalRandom.RandomIntsSpliterator
745 RandomIntsSpliterator(long index, long fence, int origin, int bound) argument
798 final long origin; field in class:ThreadLocalRandom.RandomLongsSpliterator
800 RandomLongsSpliterator(long index, long fence, long origin, long bound) argument
854 final double origin; field in class:ThreadLocalRandom.RandomDoublesSpliterator
856 RandomDoublesSpliterator(long index, long fence, double origin, double bound) argument
[all...]
H A DConcurrentSkipListMap.java3308 Node<K,V> current; // current traversal node; initialize at origin
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);
3397 for (;;) { // ensure h corresponds to origin p
3410 Node<K,V> origin, K fence, int est) {
3411 super(comparator, row, origin, fence, est);
3497 Node<K,V> origin, K fence, int est) {
3498 super(comparator, row, origin, fenc
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...]
/libcore/ojluni/src/main/java/java/util/stream/
H A DStreamSpliterators.java623 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...]

Completed in 201 milliseconds