| java.lang.Object com.ibm.richtext.styledtext.FastIntBinarySearch
FastIntBinarySearch | final class FastIntBinarySearch (Code) | | This class searches a segment of an array of integers. The segment
must be sorted in ascending order (but this class does not verify this).
Also, this class aliases the array; if the array is modified later the
search results are undefined.
|
Method Summary | |
public int | findIndex(int value) Return the index in the array of the first element which is at least
as large as value. | public void | setData(int data) | public void | setData(int data, int firstValidIndex, int validLength) |
FastIntBinarySearch | public FastIntBinarySearch(int data)(Code) | | |
FastIntBinarySearch | public FastIntBinarySearch(int data, int firstValidIndex, int validLength)(Code) | | |
findIndex | public int findIndex(int value)(Code) | | Return the index in the array of the first element which is at least
as large as value. If value is larger than the largest
element in the array the last valid index in the array is returned.
|
setData | public void setData(int data)(Code) | | |
setData | public void setData(int data, int firstValidIndex, int validLength)(Code) | | |
|
|