Base class for sorted, non-overlapping address range collections.
Declared in <llvm/ADT/AddressRanges.h>
template<typename T>
class AddressRangesBase;
This class keeps a sorted vector of AddressRange-like objects and can perform searches efficiently. The address ranges are always sorted and never contain any invalid, empty or intersected address ranges.
| Name | Description |
|---|---|
begin | Return an iterator to the first stored range. |
clear | Remove all ranges from the collection. |
contains | contains overloads |
empty | Return true if the collection holds no ranges. |
end | Return an iterator past the last stored range. |
getRangeThatContains | Return the stored entry that contains Addr, if any. |
operator[] | Return the range entry at index I. |
reserve | Reserve capacity for at least Capacity range entries. |
size | Return the number of stored ranges. |
operator== | Return true if both collections store the same ranges in order. |
| Name | Description |
|---|---|
Collection | Sorted vector of address-range-like entries. |
| Name | Description |
|---|---|
find | Find a stored range that fully contains []Start, End). |
| Name | Description |
|---|---|
Ranges | Storage for the normalized, non-overlapping ranges. |
| Name | Description |
|---|---|
AddressRanges | Address range collection that merges intersecting and adjacent ranges. |
AddressRangesMap | Map of integer values onto normalized, non-overlapping address ranges. |