searchengines-web/MeiliSearch
searchengines-web/MeiliSearch
1
0
Fork 0
mirror of https://github.com/meilisearch/MeiliSearch synced 2024-06-30 00:02:57 +02:00
Code Issues Releases Wiki Activity

Add comments to help read the facet_values branchings

Browse Source
This commit is contained in:
Clément Renault 2021-01-27 14:44:16 +01:00
parent 2e00740515
commit 9c8a654079
No known key found for this signature in database
GPG Key ID: 92ADA4E935E71FA4
1 changed files with 8 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/search/facet/facet_distribution.rs
View File

@ -63,7 +63,11 @@ impl<'a> FacetDistribution<'a> {
) -> heed::Result<BTreeMap<FacetValue, u64>>
{
if let Some(candidates) = self.candidates.as_ref() {
// Classic search, candidates were specified, we must return
// facet values only related to those candidates.
if candidates.len() <= CANDIDATES_THRESHOLD || facet_type == FacetType::String {
// There is a small amount of candidates OR we ask for facet string values so we
// decide to iterate over the facet values of each one of them, one by one.
let mut key_buffer = vec![field_id];
match facet_type {
FacetType::String => {
@ -116,6 +120,8 @@ impl<'a> FacetDistribution<'a> {
},
}
} else {
// There is too much documents, we use the facet levels to move throught
// the facet values, to find the candidates and values associated.
let iter = match facet_type {
FacetType::String => unreachable!(),
FacetType::Float => {
@ -148,6 +154,8 @@ impl<'a> FacetDistribution<'a> {
Ok(facet_values)
}
} else {
// Placeholder search, a.k.a. no candidates were specified. We iterate throught the
// facet values one by one and iterate on the facet level 0 for numbers.
let db = self.index.facet_field_id_value_docids;
let iter = match facet_type {
FacetType::String => {