#include <sorted_interval_list.h>
Represents a closed interval [start, end]. We must have start <= end.
Definition at line 34 of file sorted_interval_list.h.
◆ ClosedInterval() [1/2]
operations_research::ClosedInterval::ClosedInterval |
( |
| ) |
|
|
inline |
◆ ClosedInterval() [2/2]
operations_research::ClosedInterval::ClosedInterval |
( |
int64_t | s, |
|
|
int64_t | e ) |
|
inline |
◆ DebugString()
std::string operations_research::ClosedInterval::DebugString |
( |
| ) |
const |
◆ operator<()
bool operations_research::ClosedInterval::operator< |
( |
const ClosedInterval & | other | ) |
const |
|
inline |
Because we mainly manipulate vector of disjoint intervals, we only need to sort by the start. We do not care about the order in which interval with the same start appear since they will always be merged into one interval.
Definition at line 49 of file sorted_interval_list.h.
◆ operator==()
bool operations_research::ClosedInterval::operator== |
( |
const ClosedInterval & | other | ) |
const |
|
inline |
◆ AbslHashValue
◆ end
int64_t operations_research::ClosedInterval::end = 0 |
◆ start
int64_t operations_research::ClosedInterval::start = 0 |
The documentation for this struct was generated from the following files: