code: function binaryFindLarger(item, list) {
  	var min = 0;
  	var max = list.length - 1;
  	var guess;
  
  	var bitwise = (max <= 2147483647) ? true : false;
  	if (bitwise) {
  		while (min <= max) {
  			guess = (min + max) >> 1;
  			if (list[guess] === item) { return guess; }
  			else {
  				if (list[guess] < item) { min = guess + 1; }
  				else { max = guess - 1; }
  			}
  		}
  	} else {
  		while (min <= max) {
  			guess = Math.floor((min + max) / 2);
  			if (list[guess] === item) { return guess; }
  			else {
  				if (list[guess] < item) { min = guess + 1; }
  				else { max = guess - 1; }
  			}
  		}
  	}
  
  	return (min == list.length) ? null : min;
  
  //	return -1;
  }
docs: based on https://github.com/Olical/binary-search /* istanbul ignore next