prod/service-worker-28ddbc7ef7a575da0539a0f05f4bfdae.js
function binarySearch(arr, item, comparator) {
  var low = 0;
  var high = arr.length;
  var mid;
  while (low < high) {
    mid = (low + high) >>> 1;
    if (comparator(arr[mid], item) < 0) {
      low = mid + 1;
    } else {
      high = mid;
    }
  }
  return low;
}
function binarySearch(arr, item, comparator) {
  var low = 0;
  var high = arr.length;
  var mid;
  while (low < high) {
    mid = (low + high) >>> 1;
    if (comparator(arr[mid], item) < 0) {
      low = mid + 1;
    } else {
      high = mid;
    }
  }
  return low;
}
function binarySearch ( arr , item , comparator ) { var low = 0 ; var high = arr . length ; var mid ; while ( low < high ) { mid = ( low + high ) >>> 1 ; if ( comparator ( arr [ mid ] , item ) < 0 ) { low = mid + 1 ; } else { high = mid ; } } return low ; }
classic binary search
classic binary search