Cross Reference: /libcore/ojluni/src/main/java/java/util/Spliterators.java

Lines Matching defs:index
163      * @param fromIndex The least index (inclusive) to cover
164      * @param toIndex One past the greatest index to cover
225      * @param fromIndex The least index (inclusive) to cover
226      * @param toIndex One past the greatest index to cover
291      * @param fromIndex The least index (inclusive) to cover
292      * @param toIndex One past the greatest index to cover
357      * @param fromIndex The least index (inclusive) to cover
358      * @param toIndex One past the greatest index to cover
376      * Validate inclusive start index and exclusive end index against the length
379      * @param origin The inclusive start index
380      * @param fence The exclusive end index
381      * @throws ArrayIndexOutOfBoundsException if the start index is greater than
382      * the end index, if the start index is negative, or the end index is
901         private int index;        // current index, modified on advance/split
902         private final int fence;  // one past last index
919          * @param origin the least index (inclusive) to cover
920          * @param fence one past the greatest index to cover
927             this.index = origin;
934             int lo = index, mid = (lo + fence) >>> 1;
937                    : new ArraySpliterator<>(array, lo, index = mid, characteristics);
947                 (i = index) >= 0 && i < (index = hi)) {
956             if (index >= 0 && index < fence) {
957                 @SuppressWarnings("unchecked") T e = (T) array[index++];
965         public long estimateSize() { return (long)(fence - index); }
986         private int index;        // current index, modified on advance/split
987         private final int fence;  // one past last index
1004          * @param origin the least index (inclusive) to cover
1005          * @param fence one past the greatest index to cover
1012             this.index = origin;
1019             int lo = index, mid = (lo + fence) >>> 1;
1022                    : new IntArraySpliterator(array, lo, index = mid, characteristics);
1031                 (i = index) >= 0 && i < (index = hi)) {
1040             if (index >= 0 && index < fence) {
1041                 action.accept(array[index++]);
1048         public long estimateSize() { return (long)(fence - index); }
1069         private int index;        // current index, modified on advance/split
1070         private final int fence;  // one past last index
1087          * @param origin the least index (inclusive) to cover
1088          * @param fence one past the greatest index to cover
1095             this.index = origin;
1102             int lo = index, mid = (lo + fence) >>> 1;
1105                    : new LongArraySpliterator(array, lo, index = mid, characteristics);
1114                 (i = index) >= 0 && i < (index = hi)) {
1123             if (index >= 0 && index < fence) {
1124                 action.accept(array[index++]);
1131         public long estimateSize() { return (long)(fence - index); }
1152         private int index;        // current index, modified on advance/split
1153         private final int fence;  // one past last index
1170          * @param origin the least index (inclusive) to cover
1171          * @param fence one past the greatest index to cover
1178             this.index = origin;
1185             int lo = index, mid = (lo + fence) >>> 1;
1188                    : new DoubleArraySpliterator(array, lo, index = mid, characteristics);
1197                 (i = index) >= 0 && i < (index = hi)) {
1206             if (index >= 0 && index < fence) {
1207                 action.accept(array[index++]);
1214         public long estimateSize() { return (long)(fence - index); }