Cachemere
Modular Caching Library for C++
|
▼Ncachemere | Root namespace |
▼Ndetail | |
CTransparentEq | |
▼Nmeasurement | Utilities for measuring cached items |
CCapacityDynamicallyAllocated | Get the size of an object via a user-defined capacity() method |
CSize | Get the size of an object via a user-defined size() method |
CSizeOf | Get the size of an object via sizeof() |
▼Npolicy | |
▼Ndetail | |
CBloomFilter | Probabilistic data structure for representing sets in a space-efficient format |
CCountingBloomFilter | Space-efficient probabilistic data structure to estimate the number of times an item was inserted in a set |
CHashMixer | Functor used for generating a uniform sequence of numbers in a given value range for a given key |
Cbind | Binds a Policy<K, KH, V, Args...> template to a Policy<K, KH, V> template to be used with the cache |
CConstraintCount | Count constraint |
CConstraintMemory | Memory constraint |
▼CEvictionGDSF | Greedy-Dual-Size-Frequency (GDSF) eviction policy |
CVictimIterator | Iterator for iterating over cache items in the order they should be evicted |
▼CEvictionLRU | Least Recently Used (LRU) eviction policy |
CVictimIterator | Iterator for iterating over cache items in the order they should be evicted |
▼CEvictionSegmentedLRU | Segmented Least Recently Used (S-LRU) Eviction Policy |
CVictimIterator | Iterator for iterating over cache items in the order they should be |
CInsertionAlways | Simplest insertion policy. Always accepts insertions |
CInsertionTinyLFU | Tiny Least Frequently Used (TinyLFU) insertion policy |
▼Npresets | Frequently-used cache presets |
CCache | Thread-safe memory-restricted cache |
CItem | A wrapper for items stored in the cache |
CMultiHash | Allows combining hashers for multiple types into a single hashing object |
CMultiHash< Key, KeyHash > |