Read‐only bidirectional iterator over coalesced intervals in an IntervalMap.
Synopsis
Declared in <llvm/ADT/IntervalMap.h>
class const_iterator;
Type Aliases
Name |
Description |
Distance type for iterator arithmetic. |
|
Bidirectional traversal category. |
|
Pointer to the mapped value type (not used for dereference). |
|
Reference to the mapped value at the current interval. |
|
Mapped value type yielded by the iterator. |
Member Functions
Name |
Description |
|
const_iterator ‐ Create an iterator that isn't pointing anywhere. |
Move to the first interval with stop >= x, or end(). |
|
atBegin ‐ Return true if the current position is the first map entry. |
|
find ‐ Move to the first interval with stop >= x, or end(). This is a full search from the root, the current position is ignored. |
|
goToBegin ‐ Move to the first interval in map. |
|
goToEnd ‐ Move beyond the last interval in map. |
|
Dereference to the mapped value of the current interval. |
|
Increment operators |
|
Decrement operators |
|
setMap ‐ Change the map iterated over. This call must be followed by a call to goToBegin(), goToEnd(), or find() |
|
start ‐ Return the beginning of the current interval. |
|
stop ‐ Return the end of the current interval. |
|
valid ‐ Return true if the current position is valid, false for end(). |
|
value ‐ Return the mapped value at the current interval. |
|
Return true if both iterators refer to the same map position. |
|
Return true if the iterators refer to different positions. |
Protected Member Functions
Name |
Description |
|
Construct an iterator bound to |
Return true if the map uses a branched (non‐inline) root. |
|
Complete the path by searching downward for |
|
Initialize the path root entry at slot |
|
Advance to |
|
Find |
|
unsafeStart ‐ Writable access to start() for iterator. |
|
unsafeStop ‐ Writable access to stop() for iterator. |
|
unsafeValue ‐ Writable access to value() for iterator. |
Protected Data Members
Friends
Name |
Description |
Coalescing map from key intervals to values, stored as a compact B+‐tree. |