searchengines-web/MeiliSearch
searchengines-web/MeiliSearch
1
0
Fork 0
mirror of https://github.com/meilisearch/MeiliSearch synced 2024-11-23 05:14:27 +01:00
Code Issues Releases Wiki Activity

Fxi some logs

Browse Source
This commit is contained in:
Clément Renault 2024-09-25 15:57:50 +02:00
parent e97041f7d0
commit 29a7623c3f
No known key found for this signature in database
GPG Key ID: F250A4C4E3AE5F5F
1 changed files with 9 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
milli/src/update/new/extract/cache.rs
View File

@ -9,9 +9,11 @@ use super::lru::Lru;
use crate::update::del_add::{DelAdd, KvWriterDelAdd}; use crate::update::del_add::{DelAdd, KvWriterDelAdd};
use crate::CboRoaringBitmapCodec; use crate::CboRoaringBitmapCodec;
const KEY_SIZE: usize = 8;
#[derive(Debug)] #[derive(Debug)]
pub struct CboCachedSorter<MF> { pub struct CboCachedSorter<MF> {
cache: Lru<SmallVec<[u8; 8]>, DelAddRoaringBitmap>, cache: Lru<SmallVec<[u8; KEY_SIZE]>, DelAddRoaringBitmap>,
sorter: Sorter<MF>, sorter: Sorter<MF>,
deladd_buffer: Vec<u8>, deladd_buffer: Vec<u8>,
cbo_buffer: Vec<u8>, cbo_buffer: Vec<u8>,
@ -40,7 +42,7 @@ impl<MF: MergeFunction> CboCachedSorter<MF> {
} }
None => { None => {
self.total_insertions += 1; self.total_insertions += 1;
self.fitted_in_key += (key.len() <= 20) as usize; self.fitted_in_key += (key.len() <= KEY_SIZE) as usize;
let value = DelAddRoaringBitmap::new_del_u32(n); let value = DelAddRoaringBitmap::new_del_u32(n);
if let Some((key, deladd)) = self.cache.push(key.into(), value) { if let Some((key, deladd)) = self.cache.push(key.into(), value) {
self.write_entry(key, deladd)?; self.write_entry(key, deladd)?;
@ -62,7 +64,7 @@ impl<MF: MergeFunction> CboCachedSorter<MF> {
} }
None => { None => {
self.total_insertions += 1; self.total_insertions += 1;
self.fitted_in_key += (key.len() <= 20) as usize; self.fitted_in_key += (key.len() <= KEY_SIZE) as usize;
let value = DelAddRoaringBitmap::new_del(bitmap); let value = DelAddRoaringBitmap::new_del(bitmap);
if let Some((key, deladd)) = self.cache.push(key.into(), value) { if let Some((key, deladd)) = self.cache.push(key.into(), value) {
self.write_entry(key, deladd)?; self.write_entry(key, deladd)?;
@ -80,7 +82,7 @@ impl<MF: MergeFunction> CboCachedSorter<MF> {
} }
None => { None => {
self.total_insertions += 1; self.total_insertions += 1;
self.fitted_in_key += (key.len() <= 20) as usize; self.fitted_in_key += (key.len() <= KEY_SIZE) as usize;
let value = DelAddRoaringBitmap::new_add_u32(n); let value = DelAddRoaringBitmap::new_add_u32(n);
if let Some((key, deladd)) = self.cache.push(key.into(), value) { if let Some((key, deladd)) = self.cache.push(key.into(), value) {
self.write_entry(key, deladd)?; self.write_entry(key, deladd)?;
@ -102,7 +104,7 @@ impl<MF: MergeFunction> CboCachedSorter<MF> {
} }
None => { None => {
self.total_insertions += 1; self.total_insertions += 1;
self.fitted_in_key += (key.len() <= 20) as usize; self.fitted_in_key += (key.len() <= KEY_SIZE) as usize;
let value = DelAddRoaringBitmap::new_add(bitmap); let value = DelAddRoaringBitmap::new_add(bitmap);
if let Some((key, deladd)) = self.cache.push(key.into(), value) { if let Some((key, deladd)) = self.cache.push(key.into(), value) {
self.write_entry(key, deladd)?; self.write_entry(key, deladd)?;
@ -121,7 +123,7 @@ impl<MF: MergeFunction> CboCachedSorter<MF> {
} }
None => { None => {
self.total_insertions += 1; self.total_insertions += 1;
self.fitted_in_key += (key.len() <= 20) as usize; self.fitted_in_key += (key.len() <= KEY_SIZE) as usize;
let value = DelAddRoaringBitmap::new_del_add_u32(n); let value = DelAddRoaringBitmap::new_del_add_u32(n);
if let Some((key, deladd)) = self.cache.push(key.into(), value) { if let Some((key, deladd)) = self.cache.push(key.into(), value) {
self.write_entry(key, deladd)?; self.write_entry(key, deladd)?;
@ -177,7 +179,7 @@ impl<MF: MergeFunction> CboCachedSorter<MF> {
} }
eprintln!( eprintln!(
"LruCache stats: {} <= 20 bytes ({}%) on a total of {} insertions", "LruCache stats: {} <= {KEY_SIZE} bytes ({}%) on a total of {} insertions",
self.fitted_in_key, self.fitted_in_key,
(self.fitted_in_key as f32 / self.total_insertions as f32) * 100.0, (self.fitted_in_key as f32 / self.total_insertions as f32) * 100.0,
self.total_insertions, self.total_insertions,