Histogram Pretty was built to identify reasonable histogram bucket sizing for charting applications. It tries to follow a combination of the R base graphics histogram logic and D3. I've chosen the Freedman and Diaconis (1981) Rule, which limits the influence of outliers in bucket width selection. This seems to significantly improve binning for dynamic charting where the data is often filtered into irregular subsets.
var vector = ... // vector extraction logic
var hist = histogram(vector);
The vector
should be an array of numeric values. Optionally, you may
also pass an options object with one of two values:
-
copy
If truthy, will copy the array withvector.slice()
prior to internally sorting the vector. It is true by default, but if mutability is acceptable can be set to true. -
pretty
If truthy, will round bin sizing to a factor of 2, 5 or 10 within the relevant scale of the bin size. It is true by default. Otherwise the raw bin size as returned by the Freedman-Diaconis Rule will be returned.
The histogram
function returns an object with three values:
size
- the bin widthfun
- a binning function. This is simply:function(d) { return h * Math.floor(d / h); }
Whereh
is thesize
.tickRange
will return a function to compute ticks for visual display on a chart axis. Some charting libraries (such as d3) do not take into account the discretization when identify axis ticks. This function will always break on a bin boundary. CalltickRange(n)
with a requested number of ticks as appropriate for the chart display. The function will return approximatelyn
ticks as an array of breaks in the units of the vector.