LLVM: llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator Class Reference (original) (raw)
#include "[llvm/ADT/IntervalMap.h](IntervalMap%5F8h%5Fsource.html)"
| Public Types | |
|---|---|
| using | iterator_category = std::bidirectional_iterator_tag |
| using | value_type = ValT |
| using | difference_type = std::ptrdiff_t |
| using | pointer = value_type * |
| using | reference = value_type & |
| Public Member Functions | |
|---|---|
| const_iterator ()=default | |
| const_iterator - Create an iterator that isn't pointing anywhere. | |
| void | setMap (const IntervalMap &m) |
| setMap - Change the map iterated over. | |
| bool | valid () const |
| valid - Return true if the current position is valid, false for end(). | |
| bool | atBegin () const |
| atBegin - Return true if the current position is the first map entry. | |
| const KeyT & | start () const |
| start - Return the beginning of the current interval. | |
| const KeyT & | stop () const |
| stop - Return the end of the current interval. | |
| const ValT & | value () const |
| value - Return the mapped value at the current interval. | |
| const ValT & | operator* () const |
| bool | operator== (const const_iterator &RHS) const |
| bool | operator!= (const const_iterator &RHS) const |
| void | goToBegin () |
| goToBegin - Move to the first interval in map. | |
| void | goToEnd () |
| goToEnd - Move beyond the last interval in map. | |
| const_iterator & | operator++ () |
| preincrement - Move to the next interval. | |
| const_iterator | operator++ (int) |
| postincrement - Don't do that! | |
| const_iterator & | operator-- () |
| predecrement - Move to the previous interval. | |
| const_iterator | operator-- (int) |
| postdecrement - Don't do that! | |
| void | find (KeyT x) |
| find - Move to the first interval with stop >= x, or end(). | |
| void | advanceTo (KeyT x) |
| advanceTo - Move to the first interval with stop >= x, or end(). |
| Protected Member Functions | |
|---|---|
| const_iterator (const IntervalMap &map) | |
| bool | branched () const |
| void | setRoot (unsigned Offset) |
| void | pathFillFind (KeyT x) |
| pathFillFind - Complete path by searching for x. | |
| void | treeFind (KeyT x) |
| treeFind - Find in a branched tree. | |
| void | treeAdvanceTo (KeyT x) |
| treeAdvanceTo - Find position after the current one. | |
| KeyT & | unsafeStart () const |
| unsafeStart - Writable access to start() for iterator. | |
| KeyT & | unsafeStop () const |
| unsafeStop - Writable access to stop() for iterator. | |
| ValT & | unsafeValue () const |
| unsafeValue - Writable access to value() for iterator. |
| Friends | |
|---|---|
| class | IntervalMap |
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
class llvm::IntervalMap< KeyT, ValT, N, Traits >::const_iterator
Definition at line 1344 of file IntervalMap.h.
◆ difference_type
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ iterator_category
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ pointer
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ value_type
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ const_iterator() [1/2]
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ const_iterator() [2/2]
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
const_iterator - Create an iterator that isn't pointing anywhere.
◆ advanceTo()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ atBegin()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
atBegin - Return true if the current position is the first map entry.
Definition at line 1414 of file IntervalMap.h.
References path.
◆ branched()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ find()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ goToBegin()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ goToEnd()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ operator!=()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ operator*()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ operator++() [1/2]
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ operator++() [2/2]
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ operator--() [1/2]
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ operator--() [2/2]
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ operator==()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ pathFillFind()
◆ setMap()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ setRoot()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ start()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ stop()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ treeAdvanceTo()
◆ treeFind()
◆ unsafeStart()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ unsafeStop()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ unsafeValue()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ valid()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ value()
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ IntervalMap
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
◆ map
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
Definition at line 1356 of file IntervalMap.h.
Referenced by advanceTo(), branched(), const_iterator(), find(), goToBegin(), goToEnd(), operator++(), operator--(), operator==(), pathFillFind(), setMap(), setRoot(), treeAdvanceTo(), and treeFind().
◆ path
template<typename KeyT, typename ValT, unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, typename Traits = IntervalMapInfo>
Definition at line 1360 of file IntervalMap.h.
Referenced by advanceTo(), atBegin(), goToBegin(), operator++(), operator--(), operator==(), pathFillFind(), setRoot(), treeAdvanceTo(), unsafeStart(), unsafeStop(), unsafeValue(), and valid().
The documentation for this class was generated from the following file:
- include/llvm/ADT/IntervalMap.h