Searched refs:fromIndex (Results 1 - 16 of 16) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
H A DBitSet.java358 * Checks that fromIndex ... toIndex is a valid range of bit indices.
360 private static void checkRange(int fromIndex, int toIndex) { argument
361 if (fromIndex < 0)
362 throw new IndexOutOfBoundsException("fromIndex < 0: " + fromIndex);
365 if (fromIndex > toIndex)
366 throw new IndexOutOfBoundsException("fromIndex: " + fromIndex +
392 * Sets each bit from the specified {@code fromIndex} (inclusive) to the
396 * @param fromIndex inde
403 flip(int fromIndex, int toIndex) argument
480 set(int fromIndex, int toIndex) argument
524 set(int fromIndex, int toIndex, boolean value) argument
563 clear(int fromIndex, int toIndex) argument
644 get(int fromIndex, int toIndex) argument
710 nextSetBit(int fromIndex) argument
740 nextClearBit(int fromIndex) argument
784 previousSetBit(int fromIndex) argument
822 previousClearBit(int fromIndex) argument
[all...]
H A DAbstractList.java227 * index)} or {@code removeRange(int fromIndex, int toIndex)} is
479 * {@code (fromIndex < 0 || toIndex > size)}
481 * {@code (fromIndex > toIndex)}
483 public List<E> subList(int fromIndex, int toIndex) { argument
485 new RandomAccessSubList<>(this, fromIndex, toIndex) :
486 new SubList<>(this, fromIndex, toIndex));
547 * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive.
549 * This call shortens the list by {@code (toIndex - fromIndex)} elements.
550 * (If {@code toIndex==fromIndex}, this operation has no effect.)
559 * {@code fromIndex}, an
567 removeRange(int fromIndex, int toIndex) argument
618 SubList(AbstractList<E> list, int fromIndex, int toIndex) argument
666 removeRange(int fromIndex, int toIndex) argument
749 subList(int fromIndex, int toIndex) argument
774 RandomAccessSubList(AbstractList<E> list, int fromIndex, int toIndex) argument
778 subList(int fromIndex, int toIndex) argument
[all...]
H A DArrays.java111 * Checks that {@code fromIndex} and {@code toIndex} are in
114 private static void rangeCheck(int arrayLength, int fromIndex, int toIndex) { argument
115 if (fromIndex > toIndex) {
117 "fromIndex(" + fromIndex + ") > toIndex(" + toIndex + ")");
119 if (fromIndex < 0) {
120 throw new ArrayIndexOutOfBoundsException(fromIndex);
166 * to be sorted extends from the index {@code fromIndex}, inclusive, to
167 * the index {@code toIndex}, exclusive. If {@code fromIndex == toIndex},
177 * @param fromIndex th
184 sort(int[] a, int fromIndex, int toIndex) argument
224 sort(long[] a, int fromIndex, int toIndex) argument
264 sort(short[] a, int fromIndex, int toIndex) argument
304 sort(char[] a, int fromIndex, int toIndex) argument
344 sort(byte[] a, int fromIndex, int toIndex) argument
400 sort(float[] a, int fromIndex, int toIndex) argument
456 sort(double[] a, int fromIndex, int toIndex) argument
518 parallelSort(byte[] a, int fromIndex, int toIndex) argument
588 parallelSort(char[] a, int fromIndex, int toIndex) argument
658 parallelSort(short[] a, int fromIndex, int toIndex) argument
728 parallelSort(int[] a, int fromIndex, int toIndex) argument
798 parallelSort(long[] a, int fromIndex, int toIndex) argument
884 parallelSort(float[] a, int fromIndex, int toIndex) argument
970 parallelSort(double[] a, int fromIndex, int toIndex) argument
1076 parallelSort(T[] a, int fromIndex, int toIndex) argument
1183 parallelSort(T[] a, int fromIndex, int toIndex, Comparator<? super T> cmp) argument
1306 sort(Object[] a, int fromIndex, int toIndex) argument
1488 sort(T[] a, int fromIndex, int toIndex, Comparator<? super T> c) argument
1542 parallelPrefix(T[] array, int fromIndex, int toIndex, BinaryOperator<T> op) argument
1587 parallelPrefix(long[] array, int fromIndex, int toIndex, LongBinaryOperator op) argument
1635 parallelPrefix(double[] array, int fromIndex, int toIndex, DoubleBinaryOperator op) argument
1680 parallelPrefix(int[] array, int fromIndex, int toIndex, IntBinaryOperator op) argument
1746 binarySearch(long[] a, int fromIndex, int toIndex, long key) argument
1753 binarySearch0(long[] a, int fromIndex, int toIndex, long key) argument
1827 binarySearch(int[] a, int fromIndex, int toIndex, int key) argument
1834 binarySearch0(int[] a, int fromIndex, int toIndex, int key) argument
1908 binarySearch(short[] a, int fromIndex, int toIndex, short key) argument
1915 binarySearch0(short[] a, int fromIndex, int toIndex, short key) argument
1989 binarySearch(char[] a, int fromIndex, int toIndex, char key) argument
1996 binarySearch0(char[] a, int fromIndex, int toIndex, char key) argument
2070 binarySearch(byte[] a, int fromIndex, int toIndex, byte key) argument
2077 binarySearch0(byte[] a, int fromIndex, int toIndex, byte key) argument
2153 binarySearch(double[] a, int fromIndex, int toIndex, double key) argument
2160 binarySearch0(double[] a, int fromIndex, int toIndex, double key) argument
2244 binarySearch(float[] a, int fromIndex, int toIndex, float key) argument
2251 binarySearch0(float[] a, int fromIndex, int toIndex, float key) argument
2350 binarySearch(Object[] a, int fromIndex, int toIndex, Object key) argument
2357 binarySearch0(Object[] a, int fromIndex, int toIndex, Object key) argument
2455 binarySearch(T[] a, int fromIndex, int toIndex, T key, Comparator<? super T> c) argument
2462 binarySearch0(T[] a, int fromIndex, int toIndex, T key, Comparator<? super T> c) argument
2795 fill(long[] a, int fromIndex, int toIndex, long val) argument
2830 fill(int[] a, int fromIndex, int toIndex, int val) argument
2865 fill(short[] a, int fromIndex, int toIndex, short val) argument
2900 fill(char[] a, int fromIndex, int toIndex, char val) argument
2935 fill(byte[] a, int fromIndex, int toIndex, byte val) argument
2970 fill(boolean[] a, int fromIndex, int toIndex, boolean val) argument
3006 fill(double[] a, int fromIndex, int toIndex,double val) argument
3041 fill(float[] a, int fromIndex, int toIndex, float val) argument
3080 fill(Object[] a, int fromIndex, int toIndex, Object val) argument
[all...]
H A DArrayList.java106 // Android-changed: Inlined methods; CME in iterators; throw AIOOBE when toIndex < fromIndex.
117 * Throw AIOOBE when toIndex < fromIndex.
631 * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive.
633 * This call shortens the list by {@code (toIndex - fromIndex)} elements.
634 * (If {@code toIndex==fromIndex}, this operation has no effect.)
636 * @throws IndexOutOfBoundsException if {@code fromIndex} or
638 * ({@code fromIndex < 0 ||
639 * fromIndex >= size() ||
641 * toIndex < fromIndex})
643 protected void removeRange(int fromIndex, in argument
1007 subList(int fromIndex, int toIndex) argument
1012 subListRangeCheck(int fromIndex, int toIndex, int size) argument
1028 SubList(AbstractList<E> parent, int offset, int fromIndex, int toIndex) argument
1082 removeRange(int fromIndex, int toIndex) argument
1237 subList(int fromIndex, int toIndex) argument
[all...]
H A DJumboEnumSet.java55 int fromIndex = from.ordinal() >>> 6;
58 if (fromIndex == toIndex) {
59 elements[fromIndex] = (-1L >>> (from.ordinal() - to.ordinal() - 1))
62 elements[fromIndex] = (-1L << from.ordinal());
63 for (int i = fromIndex + 1; i < toIndex; i++)
H A DList.java698 * <tt>fromIndex</tt>, inclusive, and <tt>toIndex</tt>, exclusive. (If
699 * <tt>fromIndex</tt> and <tt>toIndex</tt> are equal, the returned list is
723 * @param fromIndex low endpoint (inclusive) of the subList
727 * (<tt>fromIndex &lt; 0 || toIndex &gt; size ||
728 * fromIndex &gt; toIndex</tt>)
730 List<E> subList(int fromIndex, int toIndex); argument
H A DSpliterators.java163 * @param fromIndex The least index (inclusive) to cover
170 * @throws ArrayIndexOutOfBoundsException if {@code fromIndex} is negative,
171 * {@code toIndex} is less than {@code fromIndex}, or
175 public static <T> Spliterator<T> spliterator(Object[] array, int fromIndex, int toIndex, argument
177 checkFromToBounds(Objects.requireNonNull(array).length, fromIndex, toIndex);
178 return new ArraySpliterator<>(array, fromIndex, toIndex, additionalCharacteristics);
225 * @param fromIndex The least index (inclusive) to cover
232 * @throws ArrayIndexOutOfBoundsException if {@code fromIndex} is negative,
233 * {@code toIndex} is less than {@code fromIndex}, or
237 public static Spliterator.OfInt spliterator(int[] array, int fromIndex, in argument
303 spliterator(long[] array, int fromIndex, int toIndex, int additionalCharacteristics) argument
369 spliterator(double[] array, int fromIndex, int toIndex, int additionalCharacteristics) argument
[all...]
H A DVector.java1004 * Returns a view of the portion of this List between fromIndex,
1005 * inclusive, and toIndex, exclusive. (If fromIndex and toIndex are
1029 * @param fromIndex low endpoint (inclusive) of the subList
1033 * {@code (fromIndex < 0 || toIndex > size)}
1035 * {@code (fromIndex > toIndex)}
1037 public synchronized List<E> subList(int fromIndex, int toIndex) { argument
1038 return Collections.synchronizedList(super.subList(fromIndex, toIndex),
1044 * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive.
1046 * This call shortens the list by {@code (toIndex - fromIndex)} elements.
1047 * (If {@code toIndex==fromIndex}, thi
1049 removeRange(int fromIndex, int toIndex) argument
[all...]
H A DCollections.java1407 public List<E> subList(int fromIndex, int toIndex) { argument
1408 return new UnmodifiableList<>(list.subList(fromIndex, toIndex));
1440 public List<E> subList(int fromIndex, int toIndex) { argument
1442 list.subList(fromIndex, toIndex));
2492 public List<E> subList(int fromIndex, int toIndex) { argument
2494 return new SynchronizedList<>(list.subList(fromIndex, toIndex),
2542 public List<E> subList(int fromIndex, int toIndex) { argument
2545 list.subList(fromIndex, toIndex), mutex);
3520 public List<E> subList(int fromIndex, int toIndex) { argument
3521 return new CheckedList<>(list.subList(fromIndex, toInde
3556 subList(int fromIndex, int toIndex) argument
5100 subList(int fromIndex, int toIndex) argument
[all...]
/libcore/ojluni/src/main/java/java/lang/
H A DString.java1508 * object at an index no smaller than {@code fromIndex}, then
1513 * (this.charAt(<i>k</i>) == ch) {@code &&} (<i>k</i> &gt;= fromIndex)
1518 * (this.codePointAt(<i>k</i>) == ch) {@code &&} (<i>k</i> &gt;= fromIndex)
1521 * string at or after position {@code fromIndex}, then
1525 * There is no restriction on the value of {@code fromIndex}. If it
1535 * @param fromIndex the index to start the search from.
1538 * than or equal to {@code fromIndex}, or {@code -1}
1541 public int indexOf(int ch, int fromIndex) { argument
1543 if (fromIndex < 0) {
1544 fromIndex
1567 indexOfSupplementary(int ch, int fromIndex) argument
1642 lastIndexOf(int ch, int fromIndex) argument
1661 lastIndexOfSupplementary(int ch, int fromIndex) argument
1709 indexOf(String str, int fromIndex) argument
1725 indexOf(String source, String target, int fromIndex) argument
1779 indexOf(char[] source, int sourceOffset, int sourceCount, char[] target, int targetOffset, int targetCount, int fromIndex) argument
1852 lastIndexOf(String str, int fromIndex) argument
1868 lastIndexOf(String source, String target, int fromIndex) argument
1930 lastIndexOf(char[] source, int sourceOffset, int sourceCount, char[] target, int targetOffset, int targetCount, int fromIndex) argument
[all...]
H A DStringBuilder.java385 public int indexOf(String str, int fromIndex) { argument
386 return super.indexOf(str, fromIndex);
395 public int lastIndexOf(String str, int fromIndex) { argument
396 return super.lastIndexOf(str, fromIndex);
H A DStringBuffer.java635 public synchronized int indexOf(String str, int fromIndex) { argument
636 return super.indexOf(str, fromIndex);
652 public synchronized int lastIndexOf(String str, int fromIndex) { argument
653 return super.lastIndexOf(str, fromIndex);
H A DAbstractStringBuilder.java1368 * k >= Math.min(fromIndex, this.length()) &&
1374 * @param fromIndex the index from which to start the search.
1378 public int indexOf(String str, int fromIndex) { argument
1380 str.toCharArray(), 0, str.length(), fromIndex);
1408 * k <= Math.min(fromIndex, this.length()) &&
1414 * @param fromIndex the index to start the search from.
1418 public int lastIndexOf(String str, int fromIndex) { argument
1420 str.toCharArray(), 0, str.length(), fromIndex);
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DCopyOnWriteArrayList.java551 * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive.
553 * This call shortens the list by {@code (toIndex - fromIndex)} elements.
554 * (If {@code toIndex==fromIndex}, this operation has no effect.)
556 * @param fromIndex index of first element to be removed
558 * @throws IndexOutOfBoundsException if fromIndex or toIndex out of range
559 * ({@code fromIndex < 0 || toIndex > size() || toIndex < fromIndex})
561 void removeRange(int fromIndex, int toIndex) { argument
566 if (fromIndex < 0 || toIndex > len || toIndex < fromIndex)
1159 subList(int fromIndex, int toIndex) argument
1194 COWSubList(CopyOnWriteArrayList<E> list, int fromIndex, int toIndex) argument
1299 subList(int fromIndex, int toIndex) argument
[all...]
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/
H A DInnerNodeImpl.java168 private void refreshIndices(int fromIndex) { argument
169 for (int i = fromIndex; i < children.size(); i++) {
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DConcurrentModTest.java647 public void removeRange(int fromIndex, int toIndex) { argument
648 super.removeRange(fromIndex, toIndex);

Completed in 823 milliseconds