public ApproximateSort_F64(double minValue, double maxValue, int numBins) { this.numBins = numBins; setRange(minValue,maxValue); }
public ApproximateSort_F64(double minValue, double maxValue, int numBins) { this.numBins = numBins; setRange(minValue,maxValue); }
/** * Examines the list and computes the range from it */ public void computeRange( double input[] , int start , int length ) { if( length == 0 ) { divisor = 0; return; } double min,max; min = max = input[start]; for( int i = 1; i < length; i++ ) { double val = input[start+i]; if( val < min ) min = val; else if( val > max ) max = val; } setRange(min,max); }
/** * Examines the list and computes the range from it */ public void computeRange( double input[] , int start , int length ) { if( length == 0 ) { divisor = 0; return; } double min,max; min = max = input[start]; for( int i = 1; i < length; i++ ) { double val = input[start+i]; if( val < min ) min = val; else if( val > max ) max = val; } setRange(min,max); }
/** * Examines the list and computes the range from it */ public void computeRange( SortableParameter_F64 input[] , int start , int length ) { if( length == 0 ) { divisor = 0; return; } double min,max; min = max = input[start].sortValue; for( int i = 1; i < length; i++ ) { double val = input[start+i].sortValue; if( val < min ) min = val; else if( val > max ) max = val; } setRange(min,max); }
/** * Examines the list and computes the range from it */ public void computeRange( SortableParameter_F64 input[] , int start , int length ) { if( length == 0 ) { divisor = 0; return; } double min,max; min = max = input[start].sortValue; for( int i = 1; i < length; i++ ) { double val = input[start+i].sortValue; if( val < min ) min = val; else if( val > max ) max = val; } setRange(min,max); }