searchengines-web/MeiliSearch
searchengines-web/MeiliSearch
1
0
Fork 0
mirror of https://github.com/meilisearch/MeiliSearch synced 2024-12-01 17:15:46 +01:00
Code Issues Releases Wiki Activity

chore: remove repetitive words

Browse Source 
Signed-off-by: shuangcui <fliter@qq.com>
This commit is contained in:
shuangcui 2024-03-14 21:28:55 +08:00
parent 0b7bebeeb6
commit 5c95b5c933
3 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
meilisearch/src/search.rs
View File

@ -530,7 +530,7 @@ pub fn perform_search(
// The attributes to retrieve are the ones explicitly marked as to retrieve (all by default), // The attributes to retrieve are the ones explicitly marked as to retrieve (all by default),
// but these attributes must be also be present // but these attributes must be also be present
// - in the fields_ids_map // - in the fields_ids_map
// - in the the displayed attributes // - in the displayed attributes
let to_retrieve_ids: BTreeSet<_> = query let to_retrieve_ids: BTreeSet<_> = query
.attributes_to_retrieve .attributes_to_retrieve
.as_ref() .as_ref()

4
milli/src/search/facet/facet_range_search.rs
View File

@ -168,7 +168,7 @@ impl<'t, 'b, 'bitmap> FacetRangeSearch<'t, 'b, 'bitmap> {
} }
// should we stop? // should we stop?
// We should if the the search range doesn't include any // We should if the search range doesn't include any
// element from the previous key or its successors // element from the previous key or its successors
let should_stop = { let should_stop = {
match self.right { match self.right {
@ -232,7 +232,7 @@ impl<'t, 'b, 'bitmap> FacetRangeSearch<'t, 'b, 'bitmap> {
} }
// should we stop? // should we stop?
// We should if the the search range doesn't include any // We should if the search range doesn't include any
// element from the previous key or its successors // element from the previous key or its successors
let should_stop = { let should_stop = {
match self.right { match self.right {

2
milli/src/search/new/tests/typo_proximity.rs
View File

@ -5,7 +5,7 @@ The typo ranking rule should transform the query graph such that it only contain
the combinations of word derivations that it used to compute its bucket. the combinations of word derivations that it used to compute its bucket.
The proximity ranking rule should then look for proximities only between those specific derivations. The proximity ranking rule should then look for proximities only between those specific derivations.
For example, given the the search query `beautiful summer` and the dataset: For example, given the search query `beautiful summer` and the dataset:
```text ```text
{ "id": 0, "text": "beautigul summer...... beautiful day in the summer" } { "id": 0, "text": "beautigul summer...... beautiful day in the summer" }
{ "id": 1, "text": "beautiful summer" } { "id": 1, "text": "beautiful summer" }