LibQuicR
Loading...
Searching...
No Matches
quicr::Cache< K, T > Member List

This is the complete list of members for quicr::Cache< K, T >, including all inherited members.

Advance()quicr::Cache< K, T >inlineprotected
bucket_index_quicr::Cache< K, T >protected
buckets_quicr::Cache< K, T >protected
Cache(size_t duration, size_t interval, std::shared_ptr< TickService > tick_service)quicr::Cache< K, T >inline
Cache()=deletequicr::Cache< K, T >
Cache(const Cache &)=defaultquicr::Cache< K, T >
Cache(Cache &&) noexcept=defaultquicr::Cache< K, T >
cache_quicr::Cache< K, T >protected
Clear() noexceptquicr::Cache< K, T >inline
Contains(const K &key) noexceptquicr::Cache< K, T >inline
Contains(const K &start_key, const K &end_key) noexceptquicr::Cache< K, T >inline
current_ticks_quicr::Cache< K, T >protected
duration_quicr::Cache< K, T >protected
Empty() const noexceptquicr::Cache< K, T >inline
First() noexceptquicr::Cache< K, T >inline
Get(const K &key) noexceptquicr::Cache< K, T >inline
Get(const K &start_key, const K &end_key) noexceptquicr::Cache< K, T >inline
Insert(const K &key, const T &value, size_t ttl)quicr::Cache< K, T >inline
Insert(const K &key, T &&value, size_t ttl)quicr::Cache< K, T >inline
InternalInsert(const K &key, Value value, size_t ttl)quicr::Cache< K, T >inlineprotected
interval_quicr::Cache< K, T >protected
Last() noexceptquicr::Cache< K, T >inline
operator=(const Cache &)=defaultquicr::Cache< K, T >
operator=(Cache &&) noexcept=defaultquicr::Cache< K, T >
Size() const noexceptquicr::Cache< K, T >inline
tick_service_quicr::Cache< K, T >protected
total_buckets_quicr::Cache< K, T >protected