function _GEA(a, l, h, y) {
  var i = h + 1;
  while (l <= h) {
    var m = (l + h) >>> 1,
      x = a[m];
    if (x >= y) {
      i = m;
      h = m - 1;
    } else {
      l = m + 1;
    }
  }
  return i;
}
Binary Search Bounds
https://github.com/mikolalysenko/binary-search-bounds
Mikola Lysenko

Inlined because of Content Security Policy issue caused by the use of `new Function(...)` syntax.
Issue reported here: https://github.com/mikolalysenko/binary-search-bounds/issues/5