#include <Histogram.h>
Inheritance diagram for HistogramBin< T >:
Public Member Functions | |
HistogramBin (const HistogramBin< T > &toCopy) | |
HistogramBin (const T &lower, const T &upper, bool lowerIncl=false, bool upperIncl=true) | |
Create a new HistogramBin. | |
virtual HistogramBin< T > * | clone (void) const |
virtual double | getValue (void) const |
return the 'count' of items in the bin | |
virtual bool | isInBin (const T &value) const |
Check whether an item belongs in this bin. | |
virtual std::string | toString (void) const |
virtual void | addValue (const T &value) throw ( ValueOutOfRangeException ) |
Add a value to the bin. | |
virtual void | clear (void) |
Clear the value of the bin. | |
Protected Attributes | |
T | lowerBound |
bool | lowerInclusive |
T | upperBound |
bool | upperInclusive |
double | binValue |
double | increment |
T | Type of value which the histogram bin contains; e.g. a histogram over packet counts would be a HistogramBin<int>. Must support Strict Weak Ordering - briefly, T::operator< must be implemented, and for two values of T T1 and T2, ( ! T1 < T2 ) and ( ! T2 < T1 ) iff T1 == T2. |
|
Create a new HistogramBin. Default behaviour is for the bin to be (lower,upper] - i.e. lower is not part of the bin, upper is. This means that a set of consecutive bins with default behaviour will cover all values in range without duplication, and with boundary values being put in the lower bin.
|
|
Add a value to the bin.
|
|
return the 'count' of items in the bin
|