mirror of
https://github.com/meilisearch/MeiliSearch
synced 2025-07-04 12:27:13 +02:00
WIP
This commit is contained in:
parent
384fdc2df4
commit
a86aeba411
3 changed files with 4 additions and 0 deletions
|
@ -150,6 +150,7 @@ fn get_ranking_rules_for_query_graph_search<'ctx>(
|
|||
crate::Criterion::Typo
|
||||
| crate::Criterion::Attribute
|
||||
| crate::Criterion::Proximity
|
||||
// TODO: no exactness
|
||||
| crate::Criterion::Exactness => {
|
||||
if !words {
|
||||
ranking_rules.push(Box::new(Words::new(terms_matching_strategy)));
|
||||
|
|
|
@ -216,6 +216,7 @@ impl QueryTerm {
|
|||
///
|
||||
/// This excludes synonyms, split words, and words stored in the prefix databases.
|
||||
pub fn all_phrases(&'_ self) -> impl Iterator<Item = Interned<Phrase>> + Clone + '_ {
|
||||
todo!("self.phrase");
|
||||
self.split_words.iter().chain(self.synonyms.iter()).copied()
|
||||
}
|
||||
pub fn is_empty(&self) -> bool {
|
||||
|
|
|
@ -15,6 +15,8 @@ mod proximity;
|
|||
/// Implementation of the `typo` ranking rule
|
||||
mod typo;
|
||||
|
||||
mod attribute_rank;
|
||||
|
||||
use std::hash::Hash;
|
||||
|
||||
pub use condition_docids_cache::ConditionDocIdsCache;
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue