Map of integer values onto normalized, non‐overlapping address ranges.
Synopsis
Declared in <llvm/ADT/AddressRanges.h>
class AddressRangesMap
: public AddressRangesBase<AddressRangeValuePair>
Description
This class keeps a sorted vector of AddressRangeValuePair objects and can perform insertions and searches efficiently. Intersecting([100,200),] [150,300)) ranges are split into non‐conflicting parts([100,200),]] [200,300)). Adjacent([100,200), [200,300)) address ranges are not combined]]] during insertion.
Base Classes
Name |
Description |
Base class for sorted, non‐overlapping address range collections. |
Member Functions
Name |
Description |
Return an iterator to the first stored range. |
|
Remove all ranges from the collection. |
|
|
|
Return true if the collection holds no ranges. |
|
Return an iterator past the last stored range. |
|
Return the stored entry that contains |
|
Map |
|
Return the range entry at index |
|
Reserve capacity for at least |
|
Return the number of stored ranges. |
|
Return true if both collections store the same ranges in order. |
Protected Type Aliases
Name |
Description |
Sorted vector of address‐range‐like entries. |
Protected Member Functions
Name |
Description |
Find a stored range that fully contains []`Start,` |