docs: function binarySearch(o, v, i, compareFunction){
      var h = o.length, l = -1, m
      while(h - l > 1)
          if(compareFunction(o[m = h + l >> 1], v) < 1) l = m
          else h = m
      return o[h] != v ? i ? h : -1 : h
  }