static <A> int generalizedBinarySearch2(L<A> l, IF1<A, Int> cmp) {
  ret generalizedBinarySearch2(l, 0, l(l), cmp);
}

static <A> int generalizedBinarySearch2(L<A> l, int fromIndex, int toIndex, IF1<A, Int> cmp) {
  int low = fromIndex;
  int high = toIndex - 1;

  while (low <= high) {
    int mid = (low + high) >>> 1;
    A midVal = l.get(mid);

    int c = cmp.get(midVal);
    if (c < 0)
      low = mid + 1;
    else if (c > 0)
      high = mid - 1;
    else
      ret mid; // key found
  }
  ret -(low + 1);  // key not found.
}

Began life as a copy of #1029231