advanceTo(KeyT x) | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
atBegin() const | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
branched() const | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inlineprotected |
const_iterator(const IntervalMap &map) | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inlineexplicitprotected |
const_iterator()=default | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | |
difference_type typedef | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | |
erase() | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | |
find(KeyT x) | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
goToBegin() | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
goToEnd() | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
insert(KeyT a, KeyT b, ValT y) | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | |
IntervalMap | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | friend |
iterator()=default | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | |
iterator_category typedef | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | |
map | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | protected |
operator!=(const const_iterator &RHS) const | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
operator*() const | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
operator++() | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | inline |
operator++(int) | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | inline |
operator--() | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | inline |
operator--(int) | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | inline |
operator==(const const_iterator &RHS) const | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
path | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | protected |
pathFillFind(KeyT x) | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | protected |
pointer typedef | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | |
reference typedef | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | |
setMap(const IntervalMap &m) | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
setRoot(unsigned Offset) | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inlineprotected |
setStart(KeyT a) | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | |
setStartUnchecked(KeyT a) | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | inline |
setStop(KeyT b) | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | |
setStopUnchecked(KeyT b) | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | inline |
setValue(ValT x) | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | |
setValueUnchecked(ValT x) | llvm::IntervalMap< KeyT, ValT, N, Traits >::iterator | inline |
start() const | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
stop() const | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
treeAdvanceTo(KeyT x) | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | protected |
treeFind(KeyT x) | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | protected |
unsafeStart() const | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inlineprotected |
unsafeStop() const | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inlineprotected |
unsafeValue() const | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inlineprotected |
valid() const | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
value() const | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | inline |
value_type typedef | llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator | |