code: function (target, array) {
      var index = this.findLowerBound(target, array)
      return index >= 0 ? array[index] : null
    }
docs: /*
  Binary Search:
  Assumes that @arg array is sorted increasingly
  return largest array[i] such that array[i] <= target; return null if array[0] > target || array is empty