|
RAIDA
1.7.0
|
User level interface to RangeSet. More...
#include <IRangeSet.h>
Public Member Functions | |
| virtual | ~IRangeSet () |
| Destructor. | |
| virtual const std::vector < double > & | lowerBounds ()=0 |
| Return array of lower Bounds for the current set of ranges. More... | |
| virtual const std::vector < double > & | upperBounds ()=0 |
| Return array of upper Bounds for the current set of ranges. More... | |
| virtual void | include (double xMin, double xMax)=0 |
| Add [xMin, xMax] interval to existing set of valid ranges. More... | |
| virtual void | exclude (double xMin, double xMax)=0 |
| Exclude [xMin, xMax] interval from the existing set of valid ranges. More... | |
| virtual void | includeAll ()=0 |
| Set full range (from MINUS_INF to PLUS_INF ). | |
| virtual void | excludeAll ()=0 |
| Set empty range. | |
| virtual bool | isInRange (double point)=0 |
| virtual int | size ()=0 |
| Return current number of disjoint ranges (non-overlapping intervals). More... | |
| virtual double | PLUS_INF ()=0 |
| virtual double | MINUS_INF ()=0 |
User level interface to RangeSet.
Proposed rules for ranges:
|
pure 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 |
Implemented in AIDA::IRangeSetROOT.
|
pure 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 |
Implemented in AIDA::IRangeSetROOT.
|
pure virtual |
Return array of lower Bounds for the current set of ranges.
Implemented in AIDA::IRangeSetROOT.
|
pure 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
Implemented in AIDA::IRangeSetROOT.
|
pure virtual |
Return array of upper Bounds for the current set of ranges.
Implemented in AIDA::IRangeSetROOT.
1.8.6