Class for an interval.
More...
#include <interval.hh>
|
| Interval () |
| Defail constructor. More...
|
|
| Interval (int lower) |
| Constructor returning the interval (lower, ∞) More...
|
|
| Interval (int lower, int upper) |
| Constructor returning the interval (lower, upper) More...
|
|
| Interval (Bounds lower, Bounds upper) |
|
void | plus (std::vector< std::shared_ptr< Interval >> &plusIntervals) |
| The Kleene plus operator on intervals in [Dima'00]. More...
|
|
bool | contain (double value) const |
|
◆ Interval() [1/3]
Defail constructor.
By defalt the it returns the interval [0,∞)
◆ Interval() [2/3]
Interval::Interval |
( |
int |
lower | ) |
|
|
inline |
Constructor returning the interval (lower, ∞)
- Parameters
-
◆ Interval() [3/3]
Interval::Interval |
( |
int |
lower, |
|
|
int |
upper |
|
) |
| |
|
inline |
Constructor returning the interval (lower, upper)
- Parameters
-
[in] | lower | the lower bound |
[in] | upper | the upper bound |
◆ plus()
void Interval::plus |
( |
std::vector< std::shared_ptr< Interval >> & |
plusIntervals | ) |
|
|
inline |
The Kleene plus operator on intervals in [Dima'00].
For an interval \(I\), the Kleen plus closure \(I^+\) of \(I\) is a set of intervals satisfying the following.
\[ \bigcup_{i \in N} I^i = \bigcup_{I' \in I^+} I' \]
- [Dima'00]: Dima C. (2000) Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. In: Reichel H., Tison S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg
- Parameters
-
[out] | plusIntervals | the result |
The documentation for this struct was generated from the following file: