LLVM API Documentation
#include <IntervalMap.h>
Additional Inherited Members | |
![]() | |
enum | |
![]() | |
NodeRef | first [N] |
KeyT | second [N] |
Definition at line 180 of file IntervalMap.h.
|
inline |
findFrom - Find the first subtree after i that may contain x.
i | Starting index for the search. |
Size | Number of elements in node. |
x | Key to search for. |
Definition at line 711 of file IntervalMap.h.
|
inline |
insert - Insert a new (subtree, stop) pair.
i | Insert position, following entries will be shifted. |
Size | Number of elements in node. |
Node | Subtree to insert. |
Stop | Last key in subtree. |
Definition at line 746 of file IntervalMap.h.
|
inline |
safeFind - Find a subtree that is known to exist. This is the same as findFrom except is it assumed that x is in range.
i | Starting index for the search. |
x | Key to search for. |
Definition at line 725 of file IntervalMap.h.
|
inline |
safeLookup - Get the subtree containing x, Assuming that x is in range.
x | Key to search for. |
Definition at line 737 of file IntervalMap.h.
|
inline |
Definition at line 699 of file IntervalMap.h.
Referenced by llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator::treeAdvanceTo().
|
inline |
Definition at line 702 of file IntervalMap.h.
|
inline |
Definition at line 700 of file IntervalMap.h.
|
inline |
Definition at line 703 of file IntervalMap.h.