binarySearch
Searches the specified array for the specified object using the binary search algorithm. The array must be sorted into ascending order according to the natural ordering of its elements (as by the .sort method) prior to making this call. If it is not sorted, the results are undefined. (If the array contains elements that are not mutually comparable (for example, strings and integers), it cannot be sorted according to the natural ordering of its elements, hence results are undefined.) If the array contains multiple elements equal to the specified object, there is no guarantee which one will be found.
Return
index of the search key, if it is contained in the array; otherwise, (-(*insertion point*) - 1). The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
Parameters
the array to be searched
the value to be searched for
Throws
if the search key is not comparable to the elements of the array.
Searches a range of the specified array for the specified object using the binary search algorithm. The range must be sorted into ascending order according to the natural ordering of its elements (as by the .sort method) prior to making this call. If it is not sorted, the results are undefined. (If the range contains elements that are not mutually comparable (for example, strings and integers), it cannot be sorted according to the natural ordering of its elements, hence results are undefined.) If the range contains multiple elements equal to the specified object, there is no guarantee which one will be found.
Return
index of the search key, if it is contained in the array within the specified range; otherwise, (-(*insertion point*) - 1). The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or toIndex if all elements in the range are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
Since
1.6
Parameters
the array to be searched
the index of the first element (inclusive) to be searched
the index of the last element (exclusive) to be searched
the value to be searched for
Throws
if the search key is not comparable to the elements of the array within the specified range.
if fromIndex > toIndex
if fromIndex < 0 or toIndex > a.length
Searches the specified array of ints for the specified value using the binary search algorithm. The array must be sorted (as by the .sort method) prior to making this call. If it is not sorted, the results are undefined. If the array contains multiple elements with the specified value, there is no guarantee which one will be found.
Return
index of the search key, if it is contained in the array; otherwise, (-(*insertion point*) - 1). The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
Parameters
the array to be searched
the value to be searched for
Searches a range of the specified array of ints for the specified value using the binary search algorithm. The range must be sorted (as by the .sort method) prior to making this call. If it is not sorted, the results are undefined. If the range contains multiple elements with the specified value, there is no guarantee which one will be found.
Return
index of the search key, if it is contained in the array within the specified range; otherwise, (-(*insertion point*) - 1). The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or toIndex if all elements in the range are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
Since
1.6
Parameters
the array to be searched
the index of the first element (inclusive) to be searched
the index of the last element (exclusive) to be searched
the value to be searched for
Throws
if fromIndex > toIndex
if fromIndex < 0 or toIndex > a.length
Searches a range of the specified array of floats for the specified value using the binary search algorithm. The range must be sorted (as by the .sort method) prior to making this call. If it is not sorted, the results are undefined. If the range contains multiple elements with the specified value, there is no guarantee which one will be found. This method considers all NaN values to be equivalent and equal.
Return
index of the search key, if it is contained in the array within the specified range; otherwise, (-(*insertion point*) - 1). The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or toIndex if all elements in the range are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
Since
1.6
Parameters
the array to be searched
the index of the first element (inclusive) to be searched
the index of the last element (exclusive) to be searched
the value to be searched for
Throws
if fromIndex > toIndex
if fromIndex < 0 or toIndex > a.length