/** * Finds index of given element in inclusive index range. Returns negative * value if element is not found. */ public int find(E element, int low, int high) { while (low <= high) { int mid = (low + high) >>> 1; int delta = compare(mid, element); if (delta < 0) { low = mid + 1; } else if (delta > 0) { high = mid - 1; } else { return mid; } } // not found return -(low + 1); }
/** * Finds very first index of given element in inclusive index range. Returns negative * value if element is not found. */ public int findFirst(E o, int low, int high) { int ndx = -1; while (low <= high) { int mid = (low + high) >>> 1; int delta = compare(mid, o); if (delta < 0) { low = mid + 1; } else { if (delta == 0) { ndx = mid; } high = mid - 1; } } if (ndx == -1) { return -(low + 1); } return ndx; }
/** * Finds very last index of given element in inclusive index range. Returns negative * value if element is not found. */ public int findLast(E o, int low, int high) { int ndx = -1; while (low <= high) { int mid = (low + high) >>> 1; int delta = compare(mid, o); if (delta > 0) { high = mid - 1; } else { if (delta == 0) { ndx = mid; } low = mid + 1; } } if (ndx == -1) { return -(low + 1); } return ndx; }
/** * Finds index of given element in inclusive index range. Returns negative * value if element is not found. */ public int find(final E element, int low, int high) { while (low <= high) { int mid = (low + high) >>> 1; int delta = compare(mid, element); if (delta < 0) { low = mid + 1; } else if (delta > 0) { high = mid - 1; } else { return mid; } } // not found return -(low + 1); }
/** * Finds very last index of given element in inclusive index range. Returns negative * value if element is not found. */ public int findLast(final E o, int low, int high) { int ndx = -1; while (low <= high) { int mid = (low + high) >>> 1; int delta = compare(mid, o); if (delta > 0) { high = mid - 1; } else { if (delta == 0) { ndx = mid; } low = mid + 1; } } if (ndx == -1) { return -(low + 1); } return ndx; }
/** * Finds very first index of given element in inclusive index range. Returns negative * value if element is not found. */ public int findFirst(final E o, int low, int high) { int ndx = -1; while (low <= high) { int mid = (low + high) >>> 1; int delta = compare(mid, o); if (delta < 0) { low = mid + 1; } else { if (delta == 0) { ndx = mid; } high = mid - 1; } } if (ndx == -1) { return -(low + 1); } return ndx; }
/** * Finds index of given element in inclusive index range. Returns negative * value if element is not found. */ public int find(final E element, int low, int high) { while (low <= high) { int mid = (low + high) >>> 1; int delta = compare(mid, element); if (delta < 0) { low = mid + 1; } else if (delta > 0) { high = mid - 1; } else { return mid; } } // not found return -(low + 1); }
/** * Finds index of given element in inclusive index range. Returns negative * value if element is not found. */ public int find(E element, int low, int high) { while (low <= high) { int mid = (low + high) >>> 1; int delta = compare(mid, element); if (delta < 0) { low = mid + 1; } else if (delta > 0) { high = mid - 1; } else { return mid; } } // not found return -(low + 1); }
/** * Finds very first index of given element in inclusive index range. Returns negative * value if element is not found. */ public int findFirst(E o, int low, int high) { int ndx = -1; while (low <= high) { int mid = (low + high) >>> 1; int delta = compare(mid, o); if (delta < 0) { low = mid + 1; } else { if (delta == 0) { ndx = mid; } high = mid - 1; } } if (ndx == -1) { return -(low + 1); } return ndx; }
/** * Finds very first index of given element in inclusive index range. Returns negative * value if element is not found. */ public int findFirst(final E o, int low, int high) { int ndx = -1; while (low <= high) { int mid = (low + high) >>> 1; int delta = compare(mid, o); if (delta < 0) { low = mid + 1; } else { if (delta == 0) { ndx = mid; } high = mid - 1; } } if (ndx == -1) { return -(low + 1); } return ndx; }
/** * Finds very last index of given element in inclusive index range. Returns negative * value if element is not found. */ public int findLast(E o, int low, int high) { int ndx = -1; while (low <= high) { int mid = (low + high) >>> 1; int delta = compare(mid, o); if (delta > 0) { high = mid - 1; } else { if (delta == 0) { ndx = mid; } low = mid + 1; } } if (ndx == -1) { return -(low + 1); } return ndx; }
/** * Finds very last index of given element in inclusive index range. Returns negative * value if element is not found. */ public int findLast(final E o, int low, int high) { int ndx = -1; while (low <= high) { int mid = (low + high) >>> 1; int delta = compare(mid, o); if (delta > 0) { high = mid - 1; } else { if (delta == 0) { ndx = mid; } low = mid + 1; } } if (ndx == -1) { return -(low + 1); } return ndx; }