prod/service-worker-28ddbc7ef7a575da0539a0f05f4bfdae.js
function insertSorted(arr, item, comparator) {
  var idx = binarySearch(arr, item, comparator);
  arr.splice(idx, 0, item);
}
function insertSorted(arr, item, comparator) {
  var idx = binarySearch(arr, item, comparator);
  arr.splice(idx, 0, item);
}
function insertSorted ( arr , item , comparator ) { var idx = binarySearch ( arr , item , comparator ) ; arr . splice ( idx , 0 , item ) ; }
assuming the arr is sorted, insert the item in the proper place
assuming the arr is sorted insert the item in the proper place