snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2024-11-22 01:57:41 +08:00
Code Issues Actions 9 Packages Projects Releases Wiki Activity

Fix a bug in the Lru

Browse Source
This commit is contained in:
Clément Renault 2024-09-25 16:01:08 +02:00
parent 29a7623c3f
commit 5f53935c8a
No known key found for this signature in database
GPG Key ID: F250A4C4E3AE5F5F
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
milli/src/update/new/extract/lru.rs
View File

@ -121,7 +121,7 @@ struct FixedSizeListNode<T> {
#[derive(Debug)]
struct FixedSizeList<T> {
nodes: Box<[Option<FixedSizeListNode<T>>]>,
/// The next None in the nodes.
/// The first `None` in the nodes.
next_free: usize,
// TODO Also, we probably do not need one of the front and back cursors.
front: usize,
@ -145,7 +145,7 @@ impl<T> FixedSizeList<T> {
#[inline]
fn len(&self) -> usize {
self.nodes.len() - self.next_free
self.next_free
}
#[inline]
@ -168,8 +168,9 @@ impl<T> FixedSizeList<T> {
if self.is_full() {
None
} else {
let current_free = self.next_free;
self.next_free += 1;
Some(self.next_free)
Some(current_free)
}
}