LLVM 20.0.0git
|
#include "llvm/ADT/IntervalMap.h"
Public Member Functions | |
const KeyT & | start (unsigned i) const |
const KeyT & | stop (unsigned i) const |
const ValT & | value (unsigned i) const |
KeyT & | start (unsigned i) |
KeyT & | stop (unsigned i) |
ValT & | value (unsigned i) |
unsigned | findFrom (unsigned i, unsigned Size, KeyT x) const |
findFrom - Find the first interval after i that may contain x. | |
unsigned | safeFind (unsigned i, KeyT x) const |
safeFind - Find an interval that is known to exist. | |
ValT | safeLookup (KeyT x, ValT NotFound) const |
safeLookup - Lookup mapped value for a safe key. | |
unsigned | insertFrom (unsigned &Pos, unsigned Size, KeyT a, KeyT b, ValT y) |
insertFrom - Add mapping of [a;b] to y if possible, coalescing as much as possible. | |
Public Member Functions inherited from llvm::IntervalMapImpl::NodeBase< std::pair< KeyT, KeyT >, ValT, N > | |
void | copy (const NodeBase< std::pair< KeyT, KeyT >, ValT, M > &Other, unsigned i, unsigned j, unsigned Count) |
copy - Copy elements from another node. | |
void | moveLeft (unsigned i, unsigned j, unsigned Count) |
moveLeft - Move elements to the left. | |
void | moveRight (unsigned i, unsigned j, unsigned Count) |
moveRight - Move elements to the right. | |
void | erase (unsigned i, unsigned j, unsigned Size) |
erase - Erase elements [i;j). | |
void | erase (unsigned i, unsigned Size) |
erase - Erase element at i. | |
void | shift (unsigned i, unsigned Size) |
shift - Shift elements [i;size) 1 position to the right. | |
void | transferToLeftSib (unsigned Size, NodeBase &Sib, unsigned SSize, unsigned Count) |
transferToLeftSib - Transfer elements to a left sibling node. | |
void | transferToRightSib (unsigned Size, NodeBase &Sib, unsigned SSize, unsigned Count) |
transferToRightSib - Transfer elements to a right sibling node. | |
int | adjustFromLeftSib (unsigned Size, NodeBase &Sib, unsigned SSize, int Add) |
adjustFromLeftSib - Adjust the number if elements in this node by moving elements to or from a left sibling node. | |
Additional Inherited Members | |
Public Types inherited from llvm::IntervalMapImpl::NodeBase< std::pair< KeyT, KeyT >, ValT, N > | |
enum | |
Public Attributes inherited from llvm::IntervalMapImpl::NodeBase< std::pair< KeyT, KeyT >, ValT, N > | |
std::pair< KeyT, KeyT > | first [N] |
ValT | second [N] |
Definition at line 566 of file IntervalMap.h.
|
inline |
findFrom - Find the first interval 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 582 of file IntervalMap.h.
References assert(), N, Size, and llvm::IntervalMapImpl::LeafNode< KeyT, ValT, N, Traits >::stop().
Referenced by llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator::advanceTo(), llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator::find(), and llvm::IntervalMap< KeyT, ValT, N, Traits >::insert().
unsigned llvm::IntervalMapImpl::LeafNode< KeyT, ValT, N, Traits >::insertFrom | ( | unsigned & | Pos, |
unsigned | Size, | ||
KeyT | a, | ||
KeyT | b, | ||
ValT | y | ||
) |
insertFrom - Add mapping of [a;b] to y if possible, coalescing as much as possible.
This may cause the node to grow by 1, or it may cause the node to shrink because of coalescing.
Pos | Starting index = insertFrom(0, size, a) |
Size | Number of elements in node. |
a | Interval start. |
b | Interval stop. |
y | Value be mapped. |
Definition at line 629 of file IntervalMap.h.
References assert(), llvm::erase(), N, Size, and value.
Referenced by llvm::IntervalMap< KeyT, ValT, N, Traits >::insert(), and llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator::insert().
|
inline |
safeFind - Find an interval that is known to exist.
This is the same as findFrom except is it assumed that x is at least within range of the last interval.
i | Starting index for the search. |
x | Key to search for. |
Definition at line 597 of file IntervalMap.h.
References assert(), N, and llvm::IntervalMapImpl::LeafNode< KeyT, ValT, N, Traits >::stop().
Referenced by llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator::pathFillFind(), and llvm::IntervalMapImpl::LeafNode< KeyT, ValT, N, Traits >::safeLookup().
|
inline |
safeLookup - Lookup mapped value for a safe key.
It is assumed that x is within range of the last entry.
x | Key to search for. |
NotFound | Value to return if x is not in any interval. |
Definition at line 611 of file IntervalMap.h.
References llvm::IntervalMapImpl::LeafNode< KeyT, ValT, N, Traits >::safeFind(), llvm::IntervalMapImpl::LeafNode< KeyT, ValT, N, Traits >::start(), and value.
Referenced by llvm::IntervalMap< KeyT, ValT, N, Traits >::lookup().
Definition at line 572 of file IntervalMap.h.
References llvm::IntervalMapImpl::NodeBase< std::pair< KeyT, KeyT >, ValT, N >::first.
|
inline |
Definition at line 568 of file IntervalMap.h.
References llvm::IntervalMapImpl::NodeBase< std::pair< KeyT, KeyT >, ValT, N >::first.
Referenced by llvm::IntervalMapImpl::LeafNode< KeyT, ValT, N, Traits >::safeLookup(), llvm::IntervalMap< KeyT, ValT, N, Traits >::start(), and llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator::unsafeStart().
Definition at line 573 of file IntervalMap.h.
References llvm::IntervalMapImpl::NodeBase< std::pair< KeyT, KeyT >, ValT, N >::first.
|
inline |
Definition at line 569 of file IntervalMap.h.
References llvm::IntervalMapImpl::NodeBase< std::pair< KeyT, KeyT >, ValT, N >::first.
Referenced by llvm::IntervalMapImpl::LeafNode< KeyT, ValT, N, Traits >::findFrom(), llvm::IntervalMapImpl::LeafNode< KeyT, ValT, N, Traits >::safeFind(), llvm::IntervalMap< KeyT, ValT, N, Traits >::stop(), llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator::treeAdvanceTo(), and llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator::unsafeStop().
Definition at line 574 of file IntervalMap.h.
References llvm::IntervalMapImpl::NodeBase< std::pair< KeyT, KeyT >, ValT, N >::second.
|
inline |
Definition at line 570 of file IntervalMap.h.
References llvm::IntervalMapImpl::NodeBase< std::pair< KeyT, KeyT >, ValT, N >::second.
Referenced by llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator::unsafeValue().