Search for documents with longer proximities until we find enough

This commit is contained in:
Kerollmops
2020-09-29 16:07:04 +02:00
parent f277ea134f
commit 54370e228a
2 changed files with 21 additions and 7 deletions

View File

@ -535,6 +535,7 @@ fn merge(key: &[u8], values: &[Vec<u8>]) -> Result<Vec<u8>, ()> {
// TODO merge with the previous values
// TODO store the documents in a compressed MTBL
// TODO prefer using iter.append when possible, it is way faster (4x) to inject ordered entries.
fn lmdb_writer(wtxn: &mut heed::RwTxn, index: &Index, key: &[u8], val: &[u8]) -> anyhow::Result<()> {
if key == WORDS_FST_KEY {
// Write the words fst