snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2025-10-11 06:06:32 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix one and for all the ARC cache

Browse Source
This commit is contained in:
Clément Renault
2024-07-21 22:32:14 +02:00
parent b03ec3f603
commit 2b7b18fb5f
1 changed files with 6 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
milli/src/update/index_documents/cache.rs
View File

@@ -306,9 +306,10 @@ impl<K: Eq + Hash + Clone, V> ArcCache<K, V> {
return evicted; return evicted;
} }
// TODO not sure that I understand
if self.frequent_set.contains(&key) { if self.frequent_set.contains(&key) {
self.frequent_set.get(&key); if let Some(evicted_entry) = self.frequent_set.push(key, value) {
evicted.push(evicted_entry);
}
return evicted; return evicted;
} }
@@ -335,7 +336,9 @@ impl<K: Eq + Hash + Clone, V> ArcCache<K, V> {
}; };
self.p = (self.p + delta).min(self.capacity.get()); self.p = (self.p + delta).min(self.capacity.get());
self.replace(&key); if let Some(evicted_entry) = self.replace(&key) {
evicted.push(evicted_entry);
}
self.recent_evicted.pop(&key); self.recent_evicted.pop(&key);
if let Some(evicted_entry) = self.frequent_set.push(key, value) { if let Some(evicted_entry) = self.frequent_set.push(key, value) {
evicted.push(evicted_entry); evicted.push(evicted_entry);