| Clear() | cache::LruMap< T, U, Hash, Equal > | inline |
| Emplace(const T &key, Args &&... args) | cache::LruMap< T, U, Hash, Equal > | inline |
| Erase(const T &key) | cache::LruMap< T, U, Hash, Equal > | inline |
| Get(const T &key) | cache::LruMap< T, U, Hash, Equal > | inline |
| GetCapacity() const (defined in cache::LruMap< T, U, Hash, Equal >) | cache::LruMap< T, U, Hash, Equal > | inline |
| GetLeastUsed() | cache::LruMap< T, U, Hash, Equal > | inline |
| GetOr(const T &key, const U &default_value) | cache::LruMap< T, U, Hash, Equal > | inline |
| GetSize() const (defined in cache::LruMap< T, U, Hash, Equal >) | cache::LruMap< T, U, Hash, Equal > | inline |
| GetTransparent(const Key &key) | cache::LruMap< T, U, Hash, Equal > | inline |
| LruMap(size_t max_size, const Hash &hash=Hash(), const Equal &equal=Equal()) (defined in cache::LruMap< T, U, Hash, Equal >) | cache::LruMap< T, U, Hash, Equal > | inlineexplicit |
| LruMap(LruMap &&lru) noexcept=default (defined in cache::LruMap< T, U, Hash, Equal >) | cache::LruMap< T, U, Hash, Equal > | |
| LruMap(const LruMap &lru)=delete (defined in cache::LruMap< T, U, Hash, Equal >) | cache::LruMap< T, U, Hash, Equal > | |
| operator=(LruMap &&lru) noexcept=default (defined in cache::LruMap< T, U, Hash, Equal >) | cache::LruMap< T, U, Hash, Equal > | |
| operator=(const LruMap &lru)=delete (defined in cache::LruMap< T, U, Hash, Equal >) | cache::LruMap< T, U, Hash, Equal > | |
| Put(const T &key, U value) | cache::LruMap< T, U, Hash, Equal > | inline |
| SetMaxSize(size_t new_max_size) | cache::LruMap< T, U, Hash, Equal > | inline |
| VisitAll(Function &&func) const | cache::LruMap< T, U, Hash, Equal > | inline |
| VisitAll(Function &&func) | cache::LruMap< T, U, Hash, Equal > | inline |
