LSST Applications g063fba187b+cac8b7c890,g0f08755f38+6aee506743,g1653933729+a8ce1bb630,g168dd56ebc+a8ce1bb630,g1a2382251a+b4475c5878,g1dcb35cd9c+8f9bc1652e,g20f6ffc8e0+6aee506743,g217e2c1bcf+73dee94bd0,g28da252d5a+1f19c529b9,g2bbee38e9b+3f2625acfc,g2bc492864f+3f2625acfc,g3156d2b45e+6e55a43351,g32e5bea42b+1bb94961c2,g347aa1857d+3f2625acfc,g35bb328faa+a8ce1bb630,g3a166c0a6a+3f2625acfc,g3e281a1b8c+c5dd892a6c,g3e8969e208+a8ce1bb630,g414038480c+5927e1bc1e,g41af890bb2+8a9e676b2a,g7af13505b9+809c143d88,g80478fca09+6ef8b1810f,g82479be7b0+f568feb641,g858d7b2824+6aee506743,g89c8672015+f4add4ffd5,g9125e01d80+a8ce1bb630,ga5288a1d22+2903d499ea,gb58c049af0+d64f4d3760,gc28159a63d+3f2625acfc,gcab2d0539d+b12535109e,gcf0d15dbbd+46a3f46ba9,gda6a2b7d83+46a3f46ba9,gdaeeff99f8+1711a396fd,ge79ae78c31+3f2625acfc,gef2f8181fd+0a71e47438,gf0baf85859+c1f95f4921,gfa517265be+6aee506743,gfa999e8aa5+17cd334064,w.2024.51
LSST Data Management Base Package
|
Interval
represents a closed interval of the real numbers by its upper and lower bounds.
More...
#include <Interval.h>
Public Member Functions | |
Interval () | |
This constructor creates an empty interval. | |
Interval (Scalar x) | |
This constructor creates a closed interval containing only x. | |
Interval (Scalar x, Scalar y) | |
This constructor creates an interval from the given endpoints. | |
bool | operator== (Interval const &i) const |
Two closed intervals are equal if their endpoints are the same, or both are empty. | |
bool | operator!= (Interval const &i) const |
bool | operator== (Scalar x) const |
A closed interval is equal to a point x if both endpoints equal x. | |
bool | operator!= (Scalar x) const |
Scalar | getA () const |
getA returns the lower endpoint of this interval. | |
Scalar | getB () const |
getB returns the upper endpoint of this interval. | |
bool | isEmpty () const |
isEmpty returns true if this interval does not contain any points. | |
Scalar | getCenter () const |
getCenter returns the center of this interval. | |
Scalar | getSize () const |
getSize returns the size (length, width) of this interval. | |
Interval & | dilateBy (Scalar x) |
For positive x, dilateBy morphologically dilates this interval by [-x,x], which is equivalent to the taking the Minkowski sum with [-x,x]. | |
Interval & | erodeBy (Scalar x) |
Derived | dilatedBy (Scalar x) const |
Derived | erodedBy (Scalar x) const |
bool | contains (Scalar x) const |
bool | contains (Interval const &x) const |
bool | isDisjointFrom (Scalar x) const |
bool | isDisjointFrom (Interval const &x) const |
bool | intersects (Scalar x) const |
bool | intersects (Interval const &x) const |
bool | isWithin (Scalar x) const |
bool | isWithin (Interval const &x) const |
Relationship | relate (Scalar x) const |
Relationship | relate (Interval const &x) const |
Interval & | clipTo (Scalar x) |
Interval & | clipTo (Interval const &x) |
Derived | clippedTo (Scalar x) const |
Derived | clippedTo (Interval const &x) const |
Interval & | expandTo (Scalar x) |
Interval & | expandTo (Interval const &x) |
Derived | expandedTo (Scalar x) const |
Derived | expandedTo (Interval const &x) const |
Interval
represents a closed interval of the real numbers by its upper and lower bounds.
It is parameterized by the Scalar type, which must be constructible from a double.
An interval with identical upper and lower bounds contains a single point, and is equal to that scalar bound.
An interval with an upper bound less than its lower bound is empty (contains no points), as are intervals with NaN as either bound.
Definition at line 55 of file Interval.h.
|
inline |
This constructor creates an empty interval.
Definition at line 58 of file Interval.h.
|
inlineexplicit |
This constructor creates a closed interval containing only x.
Definition at line 61 of file Interval.h.
|
inline |
This constructor creates an interval from the given endpoints.
Definition at line 64 of file Interval.h.
|
inline |
clippedTo
returns the intersection of this interval and x.
Definition at line 192 of file Interval.h.
|
inline |
clippedTo
returns the intersection of this interval and x.
Definition at line 190 of file Interval.h.
|
inline |
clipTo
shrinks this interval until all its points are in x.
Definition at line 177 of file Interval.h.
|
inline |
|
inline |
|
inline |
|
inline |
For positive x, dilateBy
morphologically dilates this interval by [-x,x], which is equivalent to the taking the Minkowski sum with [-x,x].
For negative x, it morphologically erodes this interval by [x,-x]. If x is zero or NaN, or this interval is empty, there is no effect.
Definition at line 237 of file Interval.h.
|
inline |
Definition at line 246 of file Interval.h.
|
inline |
Definition at line 245 of file Interval.h.
|
inline |
Definition at line 247 of file Interval.h.
|
inline |
expandedTo
returns the smallest interval containing the union of this interval and x.
Definition at line 227 of file Interval.h.
|
inline |
expandedTo
returns the smallest interval containing the union of this interval and x.
Definition at line 225 of file Interval.h.
|
inline |
|
inline |
|
inline |
getA
returns the lower endpoint of this interval.
The return value for empty intervals is arbitrary.
Definition at line 83 of file Interval.h.
|
inline |
getB
returns the upper endpoint of this interval.
The return value for empty intervals is arbitrary.
Definition at line 87 of file Interval.h.
|
inline |
getCenter
returns the center of this interval.
It is arbitrary for empty intervals.
Definition at line 96 of file Interval.h.
|
inline |
getSize
returns the size (length, width) of this interval.
It is zero for single-point intervals, and NaN or negative for empty intervals.
Definition at line 100 of file Interval.h.
|
inline |
intersects
returns true if the intersection of this interval and x is non-empty.
Definition at line 139 of file Interval.h.
|
inline |
intersects
returns true if the intersection of this interval and x is non-empty.
Definition at line 137 of file Interval.h.
|
inline |
|
inline |
isDisjointFrom
returns true if the intersection of this interval and x is empty.
Definition at line 122 of file Interval.h.
|
inline |
isEmpty
returns true if this interval does not contain any points.
Definition at line 90 of file Interval.h.
|
inline |
isWithin
returns true if the intersection of this interval and x is this interval.
Definition at line 151 of file Interval.h.
|
inline |
isWithin
returns true if the intersection of this interval and x is this interval.
Definition at line 147 of file Interval.h.
|
inline |
Definition at line 72 of file Interval.h.
|
inline |
Definition at line 79 of file Interval.h.
|
inline |
Two closed intervals are equal if their endpoints are the same, or both are empty.
Definition at line 68 of file Interval.h.
|
inline |
Relationship lsst::sphgeom::Interval< Derived, Scalar >::relate | ( | Interval< Derived, Scalar > const & | x | ) | const |
relate
returns a bitset S describing the spatial relationships between this interval and x. For each relation that holds, the bitwise AND of S and the corresponding Relationship will be non-zero.
Definition at line 276 of file Interval.h.
Relationship lsst::sphgeom::Interval< Derived, Scalar >::relate | ( | Scalar | x | ) | const |
relate
returns a bitset S describing the spatial relationships between this interval and x. For each relation that holds, the bitwise AND of S and the corresponding Relationship will be non-zero.
Definition at line 256 of file Interval.h.