RAIDA
1.9.0
|
User level interface to RangeSet. More...
#include <IRangeSetROOT.h>
Public Member Functions | |
virtual | ~IRangeSetROOT () |
Destructor. | |
virtual const std::vector < double > & | lowerBounds () |
Return array of lower Bounds for the current set of ranges. More... | |
virtual const std::vector < double > & | upperBounds () |
Return array of upper Bounds for the current set of ranges. More... | |
virtual void | include (double xMin, double xMax) |
Add [xMin, xMax] interval to existing set of valid ranges. More... | |
virtual void | exclude (double xMin, double xMax) |
Exclude [xMin, xMax] interval from the existing set of valid ranges. More... | |
virtual void | includeAll () |
Set full range (from MINUS_INF to PLUS_INF ). | |
virtual void | excludeAll () |
Set empty range. | |
virtual bool | isInRange (double point) |
virtual int | size () |
Return current number of disjoint ranges (non-overlapping intervals). More... | |
virtual double | PLUS_INF () |
virtual double | MINUS_INF () |
Public Member Functions inherited from AIDA::IRangeSet | |
virtual | ~IRangeSet () |
Destructor. | |
User level interface to RangeSet.
Proposed rules for ranges:
|
virtual |
Exclude [xMin, xMax] interval from the existing set of valid ranges.
xMin | - lower bound of range to be excluded |
xMax | - upper bound of range to be excluded |
Implements AIDA::IRangeSet.
|
virtual |
Add [xMin, xMax] interval to existing set of valid ranges.
xMin | - lower bound of a new valid range |
xMax | - upper bound of a new valid range |
Implements AIDA::IRangeSet.
|
virtual |
Return array of lower Bounds for the current set of ranges.
Implements AIDA::IRangeSet.
|
virtual |
Return current number of disjoint ranges (non-overlapping intervals).
Note: it is not always equal to the number of times user set the range
Implements AIDA::IRangeSet.
|
virtual |
Return array of upper Bounds for the current set of ranges.
Implements AIDA::IRangeSet.