| addNewEntryToCache(iterator it) const | AddrRangeMap< V, max_cache_size > | inlineprivate |
| begin() const | AddrRangeMap< V, max_cache_size > | inline |
| begin() | AddrRangeMap< V, max_cache_size > | inline |
| cache | AddrRangeMap< V, max_cache_size > | mutableprivate |
| clear() | AddrRangeMap< V, max_cache_size > | inline |
| const_iterator typedef | AddrRangeMap< V, max_cache_size > | |
| contains(const AddrRange &r) const | AddrRangeMap< V, max_cache_size > | inline |
| contains(const AddrRange &r) | AddrRangeMap< V, max_cache_size > | inline |
| contains(Addr r) const | AddrRangeMap< V, max_cache_size > | inline |
| contains(Addr r) | AddrRangeMap< V, max_cache_size > | inline |
| empty() const | AddrRangeMap< V, max_cache_size > | inline |
| end() const | AddrRangeMap< V, max_cache_size > | inline |
| end() | AddrRangeMap< V, max_cache_size > | inline |
| erase(iterator p) | AddrRangeMap< V, max_cache_size > | inline |
| erase(iterator p, iterator q) | AddrRangeMap< V, max_cache_size > | inline |
| find(const AddrRange &r, std::function< bool(const AddrRange)> cond) | AddrRangeMap< V, max_cache_size > | inlineprivate |
| find(const AddrRange &r, std::function< bool(const AddrRange)> cond) const | AddrRangeMap< V, max_cache_size > | inlineprivate |
| insert(const AddrRange &r, const V &d) | AddrRangeMap< V, max_cache_size > | inline |
| intersects(const AddrRange &r) const | AddrRangeMap< V, max_cache_size > | inline |
| intersects(const AddrRange &r) | AddrRangeMap< V, max_cache_size > | inline |
| iterator typedef | AddrRangeMap< V, max_cache_size > | |
| RangeMap typedef | AddrRangeMap< V, max_cache_size > | private |
| size() const | AddrRangeMap< V, max_cache_size > | inline |
| tree | AddrRangeMap< V, max_cache_size > | private |