docs: public static int binarySearch(Sortable data) {
      int value = data.size();
      int lower = 0;
      int upper = data.size();
      while (lower < upper) {
        int mid = (lower + upper) >> 1;
        if (data.isLess(mid, value)) {
          lower = mid + 1;
        } else {
          upper = mid;
        }
      }
      return lower;
    }