Searched refs:EntryCache (Results 1 – 5 of 5) sorted by relevance
62 StatusWithSize EntryCache::Find(FlashPartition& partition, in Find()120 EntryMetadata EntryCache::AddNew(const KeyDescriptor& descriptor, in AddNew()132 Status EntryCache::AddNewOrUpdateExisting(const KeyDescriptor& descriptor, in AddNewOrUpdateExisting()183 size_t EntryCache::present_entries() const { in present_entries()195 int EntryCache::FindIndex(uint32_t key_hash) const { in FindIndex()204 void EntryCache::AddAddressIfRoom(size_t descriptor_index, in AddAddressIfRoom()216 std::span<EntryCache::Address> EntryCache::addresses( in addresses()228 EntryCache::Address* EntryCache::ResetAddresses(size_t descriptor_index, in ResetAddresses()
37 EntryCache::AddressList<kMaxEntries, kRedundancy> addresses_;39 EntryCache entries_;171 EntryCache::iterator it = static_cast<const EntryCache&>(entries_).begin(); in TEST_F()183 EntryCache::const_iterator it = entries_.cbegin(); in TEST_F()191 EntryCache::const_iterator it = entries_.begin(); in TEST_F()
478 internal::EntryCache::const_iterator cache_iterator = entry_cache_.begin(); in begin()
73 friend class EntryCache;85 class EntryCache {123 friend class EntryCache;125 constexpr Iterator(const EntryCache* entry_cache, KeyDescriptor* descriptor) in Iterator()128 const EntryCache* entry_cache_;147 constexpr EntryCache(Vector<KeyDescriptor>& descriptors, in EntryCache() function
247 const internal::EntryCache::const_iterator& item_iterator) in Item()253 internal::EntryCache::const_iterator iterator_;288 const internal::EntryCache::const_iterator& item_iterator) in iterator()527 internal::EntryCache entry_cache_;624 internal::EntryCache::AddressList<kRedundancy, kMaxEntries> addresses_;