|
const size_t & | get_num_entries () const |
|
| Cache (size_t(*hash_fct)(const Key &), const size_t &size) |
|
Cache_Entry * | search (const Key &key) |
|
Cache_Entry * | search_next (Cache_Entry *cache_entry) |
|
Cache_Entry * | insert (const Key &key, const Data &data) Exception_Prototypes(std |
|
void | lock_entry (Cache_Entry *cache_entry) Exception_Prototypes(std |
|
void | unlock_entry (Cache_Entry *cache_entry) Exception_Prototypes(std |
|
void | remove (Cache_Entry *cache_entry) Exception_Prototypes(std |
|
void | expand (const size_t &plus_size) Exception_Prototypes(std |
|
const size_t & | capacity () const |
|
const size_t & | size () const |
|
const size_t & | get_num_locked () const |
|
const size_t & | get_num_busy_slots () const |
|
La documentación para esta clase fue generada a partir del siguiente fichero: