Tolan/frontend/node_modules/underscore/amd/_binarySearch.js

define(['./_getLength'], function (_getLength) {

  // Iteratively cut `array` in half to figure out the index at which `obj` should
  // be inserted so as to maintain the order defined by `compare`.
  function binarySearch(array, obj, iteratee, compare) {
    var value = iteratee(obj);
    var low = 0, high = _getLength(array);
    while (low < high) {
      var mid = Math.floor((low + high) / 2);
      if (compare(iteratee(array[mid]), value)) low = mid + 1; else high = mid;
    }
    return low;
  }

  return binarySearch;

});