code: function ( obj, arg ) {
  		var min = 0,
  		    max = obj.length - 1,
  		    idx, val;
  
  		while ( min <= max ) {
  			idx = Math.floor( ( min + max ) / 2 );
  			val = obj[idx];
  
  			if ( val < arg ) {
  				min = idx + 1;
  			}
  			else if ( val > arg ) {
  				max = idx - 1;
  			}
  			else {
  				return idx;
  			}
  		}
  
  		return -1;
  	}
docs: Preforms a binary search on a sorted Array
  
  @method binIndex
  @param  {Array} obj Array to search
  @param  {Mixed} arg Value to find index of
  @return {Number}    Index of `arg` within `obj`