private int search(final int value) throws IOException {
      if (isIndexLeaf() && isHashedLeaf()) {
        return hashIndex(value);
      }
      return ObjectUtils.binarySearch(0, getChildrenCount(), mid -> {
        return Integer.compare(keyAt(mid), value);
      });
    }
private int search(final int value)