LLVM: llvm::IntervalMapInfo< T > Struct Template Reference (original) (raw)

#include "[llvm/ADT/IntervalMap.h](IntervalMap%5F8h%5Fsource.html)"

Static Public Member Functions
static bool startLess (const T &x, const T &a)
startLess - Return true if x is not in [a;b].
static bool stopLess (const T &b, const T &x)
stopLess - Return true if x is not in [a;b].
static bool adjacent (const T &a, const T &b)
adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
static bool nonEmpty (const T &a, const T &b)
nonEmpty - Return true if [a;b] is non-empty.

template<typename T>
struct llvm::IntervalMapInfo< T >

Definition at line 141 of file IntervalMap.h.

adjacent()

adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.

This is a+1 == b for closed intervals, a == b for half-open intervals.

Definition at line 156 of file IntervalMap.h.

References T.

nonEmpty()

nonEmpty - Return true if [a;b] is non-empty.

This is a <= b for a closed interval, a < b for [a;b) half-open intervals.

Definition at line 162 of file IntervalMap.h.

References T.

startLess()

startLess - Return true if x is not in [a;b].

This is x < a both for closed intervals and for [a;b) half-open intervals.

Definition at line 144 of file IntervalMap.h.

References T.

stopLess()

stopLess - Return true if x is not in [a;b].

This is b < x for a closed interval, b <= x for [a;b) half-open intervals.

Definition at line 150 of file IntervalMap.h.

References T.


The documentation for this struct was generated from the following file: