|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface IRangeSet
User level interface to RangeSet. Proposed rules for ranges: - By default (no arguments) RangeSet object is created with one valid range: (-infinity, +infinity). - size=0 means no valid ranges (isInRange(double point) will return false for any point). It also can be used to check if any range is set - RangeSet include valid interval only if size!=0. - RangeSet can be smart, e.g merge overlapping valid ranges. So size() does not always equal to the number of times user call include method.
| Method Summary | |
|---|---|
void |
exclude(double xMin,
double xMax)
Exclude [xMin, xMax] interval from the existing set of valid ranges |
void |
excludeAll()
Set empty range. |
void |
include(double xMin,
double xMax)
Add [xMin, xMax] interval to existing set of valid ranges |
void |
includeAll()
Set full range (from MINUS_INF to PLUS_INF ). |
boolean |
isInRange(double point)
|
double[] |
lowerBounds()
Return array of lower Bounds for the current set of ranges |
double |
MINUS_INF()
|
double |
PLUS_INF()
|
int |
size()
Return current number of disjoint ranges (non-overlapping intervals). |
double[] |
upperBounds()
Return array of upper Bounds for the current set of ranges |
| Method Detail |
|---|
double[] lowerBounds()
double[] upperBounds()
void include(double xMin,
double xMax)
xMin - - lower bound of a new valid rangexMax - - upper bound of a new valid range
void exclude(double xMin,
double xMax)
xMin - - lower bound of range to be excludedxMax - - upper bound of range to be excludedvoid includeAll()
void excludeAll()
boolean isInRange(double point)
int size()
double PLUS_INF()
double MINUS_INF()
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||