#include <Cache.h>
|
| Cache () |
|
| Cache (const Cache &)=default |
|
| Cache (Cache &&)=default |
|
Cache & | operator= (const Cache &)=default |
|
Cache & | operator= (Cache &&)=default |
|
size_t | size () const |
| How many entries are stored in the cache? More...
|
|
bool | Has (const KEY &k) const |
| Determine if a specific key is already in the cache. More...
|
|
void | Clear () |
| Erase contents of cache. More...
|
|
void | Erase (const KEY &k) |
| Erase a specific entry from cache. More...
|
|
T | Get (KEY k, const std::function< T(KEY k)> &calc_fun) |
| Lookup a specific key; provide a function to use if value is not in cahce. More...
|
|
const T & | GetRef (const KEY &k, const std::function< T(const KEY &k)> &calc_fun) |
| A version of Get that allows calls with const references instead of pass-by-value. More...
|
|
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
Function to test if two values are identical.
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
Type we are using to look up values.
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
Contents of the value we look up.
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
void emp::Cache< KEY, T, HASH, PRED, ALLOC >::Clear |
( |
| ) |
|
|
inline |
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
void emp::Cache< KEY, T, HASH, PRED, ALLOC >::Erase |
( |
const KEY & |
k | ) |
|
|
inline |
Erase a specific entry from cache.
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
T emp::Cache< KEY, T, HASH, PRED, ALLOC >::Get |
( |
KEY |
k, |
|
|
const std::function< T(KEY k)> & |
calc_fun |
|
) |
| |
|
inline |
Lookup a specific key; provide a function to use if value is not in cahce.
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
const T& emp::Cache< KEY, T, HASH, PRED, ALLOC >::GetRef |
( |
const KEY & |
k, |
|
|
const std::function< T(const KEY &k)> & |
calc_fun |
|
) |
| |
|
inline |
A version of Get that allows calls with const references instead of pass-by-value.
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
bool emp::Cache< KEY, T, HASH, PRED, ALLOC >::Has |
( |
const KEY & |
k | ) |
const |
|
inline |
Determine if a specific key is already in the cache.
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
Cache& emp::Cache< KEY, T, HASH, PRED, ALLOC >::operator= |
( |
const Cache< KEY, T, HASH, PRED, ALLOC > & |
| ) |
|
|
default |
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
template<class KEY , class T , class HASH = std::hash<KEY>, class PRED = std::equal_to<KEY>, class ALLOC = std::allocator< std::pair<const KEY,T> >>
size_t emp::Cache< KEY, T, HASH, PRED, ALLOC >::size |
( |
| ) |
const |
|
inline |
How many entries are stored in the cache?
The documentation for this class was generated from the following file: