Expand description
LruCache implementation port from github.com/facebook/rocksdb. The class LruCache is
thread-safe, because every operation on cache will be protected by a spin lock.
Structsยง
- Cacheable
Entry - Clean
Cache Guard - LruCache
- LruCache
Shard - LruHandle
- An entry is a variable length heap-allocated structure. Entries are referenced by cache and/or by any external entity. The cache keeps all its entries in a hash table. Some elements are also stored on LRU list.
- LruHandle
Table
Enumsยง
- Cache
Priority - Lookup
Response lookup_with_request_dedup.awaitcan directly returnResult<CacheableEntry<K, T>, E>, but if we do not want to wait when cache hit does not happen, we can directly calllookup_with_request_dedupwhich will return aLookupResponsewhich containsReceiver<CacheableEntry<K, T>>orJoinHandle<Result<CacheableEntry<K, T>, E>>when cache hit does not happen.- Lookup
Result
Constantsยง
- DEFAULT_
OBJECT_ ๐POOL_ SIZE - IN_
CACHE ๐ - IN_
HIGH_ ๐PRI_ POOL - IN_LRU ๐
- IS_
HIGH_ ๐PRI - REVERSE_
IN_ ๐CACHE - REVERSE_
IN_ ๐LRU
Traitsยง
Type Aliasesยง
- Request
Queue ๐