Search

Home

Sort by

Searched defs:fromIndex (Results 1 - 14 of 14) sorted by relevance

/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A D	ConcurrentModTest.java	`647 public void removeRange(int fromIndex, int toIndex) { argument 648 super.removeRange(fromIndex, toIndex);`
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/
H A D	InnerNodeImpl.java	`168 private void refreshIndices(int fromIndex) { argument 169 for (int i = fromIndex; i < children.size(); i++) {`
/libcore/ojluni/src/main/java/java/lang/
H A D	StringBuilder.java	`379 public int indexOf(String str, int fromIndex) { argument 381 str.toCharArray(), 0, str.length(), fromIndex); 394 public int lastIndexOf(String str, int fromIndex) { argument 396 str.toCharArray(), 0, str.length(), fromIndex);`
H A D	AbstractStringBuilder.java	`1319 * k >= Math.min(fromIndex, str.length()) && 1325 * @param fromIndex the index from which to start the search. 1331 public int indexOf(String str, int fromIndex) { argument 1333 str.toCharArray(), 0, str.length(), fromIndex); 1363 * k <= Math.min(fromIndex, str.length()) && 1369 * @param fromIndex the index to start the search from. 1375 public int lastIndexOf(String str, int fromIndex) { argument 1377 str.toCharArray(), 0, str.length(), fromIndex);`
H A D	StringBuffer.java	`529 public synchronized int indexOf(String str, int fromIndex) { argument 531 str.toCharArray(), 0, str.length(), fromIndex); 547 public synchronized int lastIndexOf(String str, int fromIndex) { argument 549 str.toCharArray(), 0, str.length(), fromIndex);`
H A D	String.java	1412 * object at an index no smaller than <code>fromIndex</code>, then 1417 * (this.charAt(<i>k</i>) == ch) && (<i>k</i> >= fromIndex) 1422 * (this.codePointAt(<i>k</i>) == ch) && (<i>k</i> >= fromIndex) 1425 * string at or after position <code>fromIndex</code>, then 1429 * There is no restriction on the value of <code>fromIndex</code>. If it 1439 * @param fromIndex the index to start the search from. 1442 * than or equal to <code>fromIndex</code>, or <code>-1</code> 1445 public int indexOf(int ch, int fromIndex) { argument 1447 if (fromIndex < 0) { 1448 fromIndex 1473 indexOfSupplementary(int ch, int fromIndex) argument 1548 lastIndexOf(int ch, int fromIndex) argument 1567 lastIndexOfSupplementary(int ch, int fromIndex) argument 1615 indexOf(String str, int fromIndex) argument 1628 indexOf(String source, String target, int fromIndex) argument 1679 indexOf(char[] source, int sourceOffset, int sourceCount, char[] target, int targetOffset, int targetCount, int fromIndex) argument 1752 lastIndexOf(String str, int fromIndex) argument 1769 lastIndexOf(String source, String target, int fromIndex) argument 1828 lastIndexOf(char[] source, int sourceOffset, int sourceCount, char[] target, int targetOffset, int targetCount, int fromIndex) argument [all...]
/libcore/ojluni/src/main/java/java/util/
H A D	List.java	`569 * <tt>fromIndex</tt>, inclusive, and <tt>toIndex</tt>, exclusive. (If 570 * <tt>fromIndex</tt> and <tt>toIndex</tt> are equal, the returned list is 594 * @param fromIndex low endpoint (inclusive) of the subList 598 * (<tt>fromIndex < 0 \|\| toIndex > size \|\| 599 * fromIndex > toIndex</tt>) 601 List<E> subList(int fromIndex, int toIndex); argument`
H A D	AbstractList.java	227 * 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 D	BitSet.java	352 * Checks that fromIndex ... toIndex is a valid range of bit indices. 354 private static void checkRange(int fromIndex, int toIndex) { argument 355 if (fromIndex < 0) 356 throw new IndexOutOfBoundsException("fromIndex < 0: " + fromIndex); 359 if (fromIndex > toIndex) 360 throw new IndexOutOfBoundsException("fromIndex: " + fromIndex + 386 * Sets each bit from the specified {@code fromIndex} (inclusive) to the 390 * @param fromIndex inde 397 flip(int fromIndex, int toIndex) argument 474 set(int fromIndex, int toIndex) argument 518 set(int fromIndex, int toIndex, boolean value) argument 557 clear(int fromIndex, int toIndex) argument 638 get(int fromIndex, int toIndex) argument 701 nextSetBit(int fromIndex) argument 731 nextClearBit(int fromIndex) argument 775 previousSetBit(int fromIndex) argument 813 previousClearBit(int fromIndex) argument [all...]
H A D	Spliterators.java	163 * @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 D	ArrayList.java	605 * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive. 607 * This call shortens the list by {@code (toIndex - fromIndex)} elements. 608 * (If {@code toIndex==fromIndex}, this operation has no effect.) 610 * @throws IndexOutOfBoundsException if {@code fromIndex} or 612 * ({@code fromIndex < 0 \|\| 613 * fromIndex >= size() \|\| 615 * toIndex < fromIndex}) 617 protected void removeRange(int fromIndex, int toIndex) { argument 618 // Android-changed : Throw an IOOBE if toIndex < fromIndex as documented. 621 if (toIndex < fromIndex) { 978 subList(int fromIndex, int toIndex) argument 983 subListRangeCheck(int fromIndex, int toIndex, int size) argument 999 SubList(AbstractList<E> parent, int offset, int fromIndex, int toIndex) argument 1053 removeRange(int fromIndex, int toIndex) argument 1208 subList(int fromIndex, int toIndex) argument [all...]
H A D	Arrays.java	131 * to be sorted extends from the index {@code fromIndex}, inclusive, to 132 * the index {@code toIndex}, exclusive. If {@code fromIndex == toIndex}, 142 * @param fromIndex the index of the first element, inclusive, to be sorted 145 * @throws IllegalArgumentException if {@code fromIndex > toIndex} 147 * if {@code fromIndex < 0} or {@code toIndex > a.length} 149 public static void sort(int[] a, int fromIndex, int toIndex) { argument 150 rangeCheck(a.length, fromIndex, toIndex); 151 DualPivotQuicksort.sort(a, fromIndex, toIndex - 1, null, 0, 0); 171 * to be sorted extends from the index {@code fromIndex}, inclusive, to 172 * the index {@code toIndex}, exclusive. If {@code fromIndex 189 sort(long[] a, int fromIndex, int toIndex) argument 229 sort(short[] a, int fromIndex, int toIndex) argument 269 sort(char[] a, int fromIndex, int toIndex) argument 309 sort(byte[] a, int fromIndex, int toIndex) argument 365 sort(float[] a, int fromIndex, int toIndex) argument 421 sort(double[] a, int fromIndex, int toIndex) argument 483 parallelSort(byte[] a, int fromIndex, int toIndex) argument 553 parallelSort(char[] a, int fromIndex, int toIndex) argument 623 parallelSort(short[] a, int fromIndex, int toIndex) argument 693 parallelSort(int[] a, int fromIndex, int toIndex) argument 763 parallelSort(long[] a, int fromIndex, int toIndex) argument 849 parallelSort(float[] a, int fromIndex, int toIndex) argument 935 parallelSort(double[] a, int fromIndex, int toIndex) argument 1041 parallelSort(T[] a, int fromIndex, int toIndex) argument 1148 parallelSort(T[] a, int fromIndex, int toIndex, Comparator<? super T> cmp) argument 1320 sort(Object[] a, int fromIndex, int toIndex) argument 1329 legacyMergeSort(Object[] a, int fromIndex, int toIndex) argument 1514 sort(T[] a, int fromIndex, int toIndex, Comparator<? super T> c) argument 1528 legacyMergeSort(T[] a, int fromIndex, int toIndex, Comparator<? super T> c) argument 1589 rangeCheck(int length, int fromIndex, int toIndex) argument 1643 parallelPrefix(T[] array, int fromIndex, int toIndex, BinaryOperator<T> op) argument 1688 parallelPrefix(long[] array, int fromIndex, int toIndex, LongBinaryOperator op) argument 1736 parallelPrefix(double[] array, int fromIndex, int toIndex, DoubleBinaryOperator op) argument 1781 parallelPrefix(int[] array, int fromIndex, int toIndex, IntBinaryOperator op) argument 1847 binarySearch(long[] a, int fromIndex, int toIndex, long key) argument 1854 binarySearch0(long[] a, int fromIndex, int toIndex, long key) argument 1928 binarySearch(int[] a, int fromIndex, int toIndex, int key) argument 1935 binarySearch0(int[] a, int fromIndex, int toIndex, int key) argument 2009 binarySearch(short[] a, int fromIndex, int toIndex, short key) argument 2016 binarySearch0(short[] a, int fromIndex, int toIndex, short key) argument 2090 binarySearch(char[] a, int fromIndex, int toIndex, char key) argument 2097 binarySearch0(char[] a, int fromIndex, int toIndex, char key) argument 2171 binarySearch(byte[] a, int fromIndex, int toIndex, byte key) argument 2178 binarySearch0(byte[] a, int fromIndex, int toIndex, byte key) argument 2254 binarySearch(double[] a, int fromIndex, int toIndex, double key) argument 2261 binarySearch0(double[] a, int fromIndex, int toIndex, double key) argument 2345 binarySearch(float[] a, int fromIndex, int toIndex, float key) argument 2352 binarySearch0(float[] a, int fromIndex, int toIndex, float key) argument 2451 binarySearch(Object[] a, int fromIndex, int toIndex, Object key) argument 2458 binarySearch0(Object[] a, int fromIndex, int toIndex, Object key) argument 2552 binarySearch(T[] a, int fromIndex, int toIndex, T key, Comparator<? super T> c) argument 2559 binarySearch0(T[] a, int fromIndex, int toIndex, T key, Comparator<? super T> c) argument 2892 fill(long[] a, int fromIndex, int toIndex, long val) argument 2927 fill(int[] a, int fromIndex, int toIndex, int val) argument 2962 fill(short[] a, int fromIndex, int toIndex, short val) argument 2997 fill(char[] a, int fromIndex, int toIndex, char val) argument 3032 fill(byte[] a, int fromIndex, int toIndex, byte val) argument 3067 fill(boolean[] a, int fromIndex, int toIndex, boolean val) argument 3103 fill(double[] a, int fromIndex, int toIndex,double val) argument 3138 fill(float[] a, int fromIndex, int toIndex, float val) argument 3177 fill(Object[] a, int fromIndex, int toIndex, Object val) argument [all...]
H A D	Vector.java	1004 * 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 D	Collections.java	1349 public List<E> subList(int fromIndex, int toIndex) { argument 1350 return new UnmodifiableList<>(list.subList(fromIndex, toIndex)); 1382 public List<E> subList(int fromIndex, int toIndex) { argument 1384 list.subList(fromIndex, toIndex)); 2178 public List<E> subList(int fromIndex, int toIndex) { argument 2180 return new SynchronizedList<>(list.subList(fromIndex, toIndex), 2228 public List<E> subList(int fromIndex, int toIndex) { argument 2231 list.subList(fromIndex, toIndex), mutex); 2917 public List<E> subList(int fromIndex, int toIndex) { argument 2918 return new CheckedList<>(list.subList(fromIndex, toInde 2960 subList(int fromIndex, int toIndex) argument 4251 subList(int fromIndex, int toIndex) argument [all...]

Completed in 170 milliseconds