code: function _histc( vector, edges ) {
  		
  		var id, counts = [];
  
  		// Initialize our counts vector: (all zeros)
  		for ( var i = -1; i < edges.length; i++ ) {
  			counts[ i+1 ] = 0;
  		} // end FOR i
  
  		// For each value in the vector, find where the value resides along the edge vector:
  		for ( var j = 0; j < vector.length; j++ ) {
  
  			// Perform a binary search to find the index where the value equals or exceeds the corresponding value in the edge vector:
  			id = binarysearch( edges, vector[ j ] );
  
  			// Update the counts for a bin:
  			counts[ id+1 ] += 1;
  
  		} // end FOR i
  
  		// Return the counts:
  		return counts;
  
  	}
docs: end FUNCTION binary_search() HISTC //