code: int binarySearch(int fromIndex, int toIndex, long key, long value) {
  		if (ind.isUnique()) {
  			return binarySearchUnique(fromIndex, toIndex, key);
  		}
  		return binarySearchNonUnique(fromIndex, toIndex, key, value);
  	}
docs: Binary search.
  
  @param toIndex Exclusive, search stops at (toIndex-1).
  @param value For non-unique trees, the value is taken into account as well.