docs: function _hist2c( data, xEdges, yEdges ) {
  
  		var id1, id2, counts = [];
  
  		// Initialize our counts array: (all zeros):
  		for ( var i = -1; i < xEdges.length; i++ ) {
  			counts[ i+1 ] = [];
  			for ( var j = -1; j < yEdges.length; j++ ) {
  				counts[ i+1 ][ j+1 ] = 0;
  			} // end FOR i
  		} // end FOR j
  
  		// For each value in the data array, find where the value resides along the edge vector in each dimension:
  		for ( var k = 0; k < data.length; k++ ) {
  
  			for ( var n = 0; n < data[ k ].length; n++ ) {
  
  				// Perform a binary search along each dimension to find the index where the value equals or exceeds the corresponding value in the edge vector:
  				id1 = binarysearch( xEdges, data[ k ][ n ][ 0 ] );
  				id2 = binarysearch( yEdges, data[ k ][ n ][ 1 ] );
  
  				// Update the counts for the bin:
  				counts[ id1+1 ][ id2+1 ] += 1;
  
  			} // end FOR n
  
  		} // end FOR k
  
  		// Return the counts:
  		return counts;
  
  	}