snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2024-11-23 02:27:40 +08:00
Code Issues Actions 9 Packages Projects Releases Wiki Activity

Divide the max-memory parameter by the number of sorters in the store

Browse Source
This commit is contained in:
Clément Renault 2020-10-08 17:27:53 +02:00
parent fb2c402ae1
commit b342a86c15
No known key found for this signature in database
GPG Key ID: 92ADA4E935E71FA4
1 changed files with 5 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/bin/indexer.rs
View File

@ -6,7 +6,7 @@ use std::iter::FromIterator;
use std::path::PathBuf;
use std::sync::mpsc::sync_channel;
use std::time::Instant;
use std::{iter, thread};
use std::{cmp, iter, thread};
use anyhow::{Context, bail};
use bstr::ByteSlice as _;
@ -28,6 +28,7 @@ use milli::tokenizer::{simple_tokenizer, only_token};
use milli::{SmallVec32, Index, Position, DocumentId};
const LMDB_MAX_KEY_LENGTH: usize = 511;
const ONE_KILOBYTE: usize = 1024 * 1024;
const MAX_POSITION: usize = 1000;
const MAX_ATTRIBUTES: usize = u32::max_value() as usize / MAX_POSITION;
@ -227,6 +228,9 @@ impl Store {
chunk_compression_level: Option<u32>,
) -> anyhow::Result<Store>
{
// We divide the max memory by the number of sorter the Store have.
let max_memory = max_memory.map(|mm| cmp::max(ONE_KILOBYTE, mm / 3));
let main_sorter = create_sorter(
main_merge,
chunk_compression_type,