snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2025-07-31 10:50:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

Speed up graph based ranking rule when a lot of different costs exist

Browse Source
This commit is contained in:
Loïc Lecrenier
2023-05-01 15:33:28 +02:00
parent 3b2c8b9f25
commit 30fb1153cc
3 changed files with 35 additions and 46 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
milli/src/search/new/query_graph.rs
View File

@ -8,7 +8,6 @@ use crate::search::new::interner::Interner;
use crate::Result;
use fxhash::{FxHashMap, FxHasher};
use std::cmp::Ordering;
use std::collections::hash_map::Entry;
use std::collections::BTreeMap;
use std::hash::{Hash, Hasher};
@ -364,8 +363,6 @@ impl QueryGraph {
└──│ b2 │──│ c2 │───│ d │───│ e2 │
└────┘ └────┘ └────┘ └────┘
```
But we accept the first representation as it reduces the size
of the graph and shouldn't cause much problems.
*/
pub fn build_from_paths(
paths: Vec<Vec<(Option<LocatedQueryTermSubset>, LocatedQueryTermSubset)>>,