This library provides an implementation of a balanced histogram. Users can specify the maximum number of elements for the histogram bins. Whenever a bin exceeds this maximum, it is split into two to ensure that the maximum number of elements stay withing the bounds.

How to use

Include the header into you code. The histogram class, i.e. balancing_histogram::hist<T, N>, builds a balanced histogram of elements of type T such that none of the bins exceeds N elements. Note that T should be supported by numeric_limits.

The histogram class supports the following methods:

1. void insert(T elem): Inserts an element of type T in the histogram

2. void increment(T elem, std::size_t count): Increments the count for elem of type T by count

3. std::vector<T> get_bin_boundaries(): Returns the boundries of the bins. This vector contains the smallest values in each of the bins sorted from lowest to highest

4. void print(): Prints the histogram on stdout