mirror of
https://github.com/meilisearch/MeiliSearch
synced 2024-11-30 00:34:26 +01:00
Add some integration tests on the sort criterion
This commit is contained in:
Loïc Lecrenier
parent
098c410612
commit
f37c86e0b2
@ -294,3 +294,202 @@ fn iterative_facet_string_ordered_iter<'t>(
|
|||||||
|
|
||||||
Ok(vec.into_iter())
|
Ok(vec.into_iter())
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[cfg(test)]
|
||||||
|
mod tests {
|
||||||
|
use std::str::FromStr;
|
||||||
|
|
||||||
|
use big_s::S;
|
||||||
|
use maplit::hashset;
|
||||||
|
|
||||||
|
use crate::index::tests::TempIndex;
|
||||||
|
use crate::{AscDesc, Filter, Search, SearchResult};
|
||||||
|
|
||||||
|
// Note that in this test, only the iterative sort algorithms are used. Set the CANDIDATES_THESHOLD
|
||||||
|
// constant to 0 to ensure that the other sort algorithms are also correct.
|
||||||
|
#[test]
|
||||||
|
fn sort_criterion_placeholder() {
|
||||||
|
let index = TempIndex::new();
|
||||||
|
|
||||||
|
index
|
||||||
|
.update_settings(|settings| {
|
||||||
|
settings.set_primary_key("id".to_owned());
|
||||||
|
settings
|
||||||
|
.set_sortable_fields(maplit::hashset! { S("id"), S("mod_10"), S("mod_20") });
|
||||||
|
settings.set_criteria(vec!["sort".to_owned()]);
|
||||||
|
})
|
||||||
|
.unwrap();
|
||||||
|
|
||||||
|
let mut docs = vec![];
|
||||||
|
for i in 0..100 {
|
||||||
|
docs.push(
|
||||||
|
serde_json::json!({ "id": i, "mod_10": format!("{}", i % 10), "mod_20": i % 20 }),
|
||||||
|
);
|
||||||
|
}
|
||||||
|
|
||||||
|
index.add_documents(documents!(docs)).unwrap();
|
||||||
|
|
||||||
|
let all_ids = (0..100).collect::<Vec<_>>();
|
||||||
|
|
||||||
|
let rtxn = index.read_txn().unwrap();
|
||||||
|
|
||||||
|
let mut search = Search::new(&rtxn, &index);
|
||||||
|
search.sort_criteria(vec![AscDesc::from_str("mod_10:desc").unwrap()]);
|
||||||
|
search.limit(100);
|
||||||
|
|
||||||
|
let SearchResult { mut documents_ids, .. } = search.execute().unwrap();
|
||||||
|
insta::assert_snapshot!(format!("{documents_ids:?}"), @"[9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 8, 18, 28, 38, 48, 58, 68, 78, 88, 98, 7, 17, 27, 37, 47, 57, 67, 77, 87, 97, 6, 16, 26, 36, 46, 56, 66, 76, 86, 96, 5, 15, 25, 35, 45, 55, 65, 75, 85, 95, 4, 14, 24, 34, 44, 54, 64, 74, 84, 94, 3, 13, 23, 33, 43, 53, 63, 73, 83, 93, 2, 12, 22, 32, 42, 52, 62, 72, 82, 92, 1, 11, 21, 31, 41, 51, 61, 71, 81, 91, 0, 10, 20, 30, 40, 50, 60, 70, 80, 90]");
|
||||||
|
documents_ids.sort();
|
||||||
|
assert_eq!(all_ids, documents_ids);
|
||||||
|
|
||||||
|
let mut search = Search::new(&rtxn, &index);
|
||||||
|
search.sort_criteria(vec![
|
||||||
|
AscDesc::from_str("mod_10:desc").unwrap(),
|
||||||
|
AscDesc::from_str("id:desc").unwrap(),
|
||||||
|
]);
|
||||||
|
search.limit(100);
|
||||||
|
|
||||||
|
let SearchResult { mut documents_ids, .. } = search.execute().unwrap();
|
||||||
|
insta::assert_snapshot!(format!("{documents_ids:?}"), @"[99, 89, 79, 69, 59, 49, 39, 29, 19, 9, 98, 88, 78, 68, 58, 48, 38, 28, 18, 8, 97, 87, 77, 67, 57, 47, 37, 27, 17, 7, 96, 86, 76, 66, 56, 46, 36, 26, 16, 6, 95, 85, 75, 65, 55, 45, 35, 25, 15, 5, 94, 84, 74, 64, 54, 44, 34, 24, 14, 4, 93, 83, 73, 63, 53, 43, 33, 23, 13, 3, 92, 82, 72, 62, 52, 42, 32, 22, 12, 2, 91, 81, 71, 61, 51, 41, 31, 21, 11, 1, 90, 80, 70, 60, 50, 40, 30, 20, 10, 0]");
|
||||||
|
documents_ids.sort();
|
||||||
|
assert_eq!(all_ids, documents_ids);
|
||||||
|
|
||||||
|
let mut search = Search::new(&rtxn, &index);
|
||||||
|
search.sort_criteria(vec![
|
||||||
|
AscDesc::from_str("mod_10:desc").unwrap(),
|
||||||
|
AscDesc::from_str("mod_20:asc").unwrap(),
|
||||||
|
]);
|
||||||
|
search.limit(100);
|
||||||
|
|
||||||
|
let SearchResult { mut documents_ids, .. } = search.execute().unwrap();
|
||||||
|
insta::assert_snapshot!(format!("{documents_ids:?}"), @"[9, 29, 49, 69, 89, 19, 39, 59, 79, 99, 8, 28, 48, 68, 88, 18, 38, 58, 78, 98, 7, 27, 47, 67, 87, 17, 37, 57, 77, 97, 6, 26, 46, 66, 86, 16, 36, 56, 76, 96, 5, 25, 45, 65, 85, 15, 35, 55, 75, 95, 4, 24, 44, 64, 84, 14, 34, 54, 74, 94, 3, 23, 43, 63, 83, 13, 33, 53, 73, 93, 2, 22, 42, 62, 82, 12, 32, 52, 72, 92, 1, 21, 41, 61, 81, 11, 31, 51, 71, 91, 0, 20, 40, 60, 80, 10, 30, 50, 70, 90]");
|
||||||
|
documents_ids.sort();
|
||||||
|
assert_eq!(all_ids, documents_ids);
|
||||||
|
|
||||||
|
let mut search = Search::new(&rtxn, &index);
|
||||||
|
search.sort_criteria(vec![
|
||||||
|
AscDesc::from_str("mod_10:desc").unwrap(),
|
||||||
|
AscDesc::from_str("mod_20:desc").unwrap(),
|
||||||
|
]);
|
||||||
|
search.limit(100);
|
||||||
|
|
||||||
|
let SearchResult { mut documents_ids, .. } = search.execute().unwrap();
|
||||||
|
insta::assert_snapshot!(format!("{documents_ids:?}"), @"[19, 39, 59, 79, 99, 9, 29, 49, 69, 89, 18, 38, 58, 78, 98, 8, 28, 48, 68, 88, 17, 37, 57, 77, 97, 7, 27, 47, 67, 87, 16, 36, 56, 76, 96, 6, 26, 46, 66, 86, 15, 35, 55, 75, 95, 5, 25, 45, 65, 85, 14, 34, 54, 74, 94, 4, 24, 44, 64, 84, 13, 33, 53, 73, 93, 3, 23, 43, 63, 83, 12, 32, 52, 72, 92, 2, 22, 42, 62, 82, 11, 31, 51, 71, 91, 1, 21, 41, 61, 81, 10, 30, 50, 70, 90, 0, 20, 40, 60, 80]");
|
||||||
|
documents_ids.sort();
|
||||||
|
assert_eq!(all_ids, documents_ids);
|
||||||
|
|
||||||
|
let mut search = Search::new(&rtxn, &index);
|
||||||
|
search.sort_criteria(vec![
|
||||||
|
AscDesc::from_str("mod_10:desc").unwrap(),
|
||||||
|
AscDesc::from_str("mod_20:desc").unwrap(),
|
||||||
|
AscDesc::from_str("id:desc").unwrap(),
|
||||||
|
]);
|
||||||
|
search.limit(100);
|
||||||
|
|
||||||
|
let SearchResult { mut documents_ids, .. } = search.execute().unwrap();
|
||||||
|
insta::assert_snapshot!(format!("{documents_ids:?}"), @"[99, 79, 59, 39, 19, 89, 69, 49, 29, 9, 98, 78, 58, 38, 18, 88, 68, 48, 28, 8, 97, 77, 57, 37, 17, 87, 67, 47, 27, 7, 96, 76, 56, 36, 16, 86, 66, 46, 26, 6, 95, 75, 55, 35, 15, 85, 65, 45, 25, 5, 94, 74, 54, 34, 14, 84, 64, 44, 24, 4, 93, 73, 53, 33, 13, 83, 63, 43, 23, 3, 92, 72, 52, 32, 12, 82, 62, 42, 22, 2, 91, 71, 51, 31, 11, 81, 61, 41, 21, 1, 90, 70, 50, 30, 10, 80, 60, 40, 20, 0]");
|
||||||
|
documents_ids.sort();
|
||||||
|
assert_eq!(all_ids, documents_ids);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Note that in this test, only the iterative sort algorithms are used. Set the CANDIDATES_THESHOLD
|
||||||
|
// constant to 0 to ensure that the other sort algorithms are also correct.
|
||||||
|
#[test]
|
||||||
|
fn sort_criterion_non_placeholder() {
|
||||||
|
let index = TempIndex::new();
|
||||||
|
|
||||||
|
index
|
||||||
|
.update_settings(|settings| {
|
||||||
|
settings.set_primary_key("id".to_owned());
|
||||||
|
settings.set_filterable_fields(hashset! { S("id"), S("mod_10"), S("mod_20") });
|
||||||
|
settings.set_sortable_fields(hashset! { S("id"), S("mod_10"), S("mod_20") });
|
||||||
|
settings.set_criteria(vec!["sort".to_owned()]);
|
||||||
|
})
|
||||||
|
.unwrap();
|
||||||
|
|
||||||
|
let mut docs = vec![];
|
||||||
|
for i in 0..100 {
|
||||||
|
docs.push(
|
||||||
|
serde_json::json!({ "id": i, "mod_10": format!("{}", i % 10), "mod_20": i % 20 }),
|
||||||
|
);
|
||||||
|
}
|
||||||
|
|
||||||
|
index.add_documents(documents!(docs)).unwrap();
|
||||||
|
|
||||||
|
let rtxn = index.read_txn().unwrap();
|
||||||
|
|
||||||
|
let mut search = Search::new(&rtxn, &index);
|
||||||
|
search.filter(
|
||||||
|
Filter::from_str("mod_10 IN [1, 0, 2] OR mod_20 IN [10, 13] OR id IN [5, 6]")
|
||||||
|
.unwrap()
|
||||||
|
.unwrap(),
|
||||||
|
);
|
||||||
|
search.sort_criteria(vec![
|
||||||
|
AscDesc::from_str("mod_10:desc").unwrap(),
|
||||||
|
AscDesc::from_str("mod_20:asc").unwrap(),
|
||||||
|
AscDesc::from_str("id:desc").unwrap(),
|
||||||
|
]);
|
||||||
|
search.limit(100);
|
||||||
|
|
||||||
|
let SearchResult { mut documents_ids, .. } = search.execute().unwrap();
|
||||||
|
// The order should be in increasing value of the id modulo 10, followed by increasing value of the id modulo 20, followed by decreasing value of the id
|
||||||
|
insta::assert_snapshot!(format!("{documents_ids:?}"), @"[6, 5, 93, 73, 53, 33, 13, 82, 62, 42, 22, 2, 92, 72, 52, 32, 12, 81, 61, 41, 21, 1, 91, 71, 51, 31, 11, 80, 60, 40, 20, 0, 90, 70, 50, 30, 10]");
|
||||||
|
let expected_ids = (0..100)
|
||||||
|
.filter(|id| {
|
||||||
|
[1, 0, 2].contains(&(id % 10))
|
||||||
|
|| [10, 13].contains(&(id % 20))
|
||||||
|
|| [5, 6].contains(id)
|
||||||
|
})
|
||||||
|
.collect::<Vec<_>>();
|
||||||
|
documents_ids.sort();
|
||||||
|
assert_eq!(expected_ids, documents_ids);
|
||||||
|
|
||||||
|
let mut search = Search::new(&rtxn, &index);
|
||||||
|
search.filter(
|
||||||
|
Filter::from_str("mod_10 IN [7, 8, 0] OR mod_20 IN [1, 15, 16] OR id IN [0, 4]")
|
||||||
|
.unwrap()
|
||||||
|
.unwrap(),
|
||||||
|
);
|
||||||
|
search.sort_criteria(vec![
|
||||||
|
AscDesc::from_str("mod_10:asc").unwrap(),
|
||||||
|
AscDesc::from_str("mod_20:asc").unwrap(),
|
||||||
|
AscDesc::from_str("id:desc").unwrap(),
|
||||||
|
]);
|
||||||
|
search.limit(100);
|
||||||
|
|
||||||
|
let SearchResult { mut documents_ids, .. } = search.execute().unwrap();
|
||||||
|
// The order should be in increasing value of the id modulo 10, followed by increasing value of the id modulo 20, followed by decreasing value of the id
|
||||||
|
insta::assert_snapshot!(format!("{documents_ids:?}"), @"[80, 60, 40, 20, 0, 90, 70, 50, 30, 10, 81, 61, 41, 21, 1, 4, 95, 75, 55, 35, 15, 96, 76, 56, 36, 16, 87, 67, 47, 27, 7, 97, 77, 57, 37, 17, 88, 68, 48, 28, 8, 98, 78, 58, 38, 18]");
|
||||||
|
let expected_ids = (0..100)
|
||||||
|
.filter(|id| {
|
||||||
|
[7, 8, 0].contains(&(id % 10))
|
||||||
|
|| [1, 15, 16].contains(&(id % 20))
|
||||||
|
|| [0, 4].contains(id)
|
||||||
|
})
|
||||||
|
.collect::<Vec<_>>();
|
||||||
|
documents_ids.sort();
|
||||||
|
assert_eq!(expected_ids, documents_ids);
|
||||||
|
|
||||||
|
let mut search = Search::new(&rtxn, &index);
|
||||||
|
search.filter(
|
||||||
|
Filter::from_str("mod_10 IN [1, 0, 2] OR mod_20 IN [10, 13] OR id IN [5, 6]")
|
||||||
|
.unwrap()
|
||||||
|
.unwrap(),
|
||||||
|
);
|
||||||
|
search.sort_criteria(vec![AscDesc::from_str("id:desc").unwrap()]);
|
||||||
|
search.limit(100);
|
||||||
|
|
||||||
|
let SearchResult { documents_ids, .. } = search.execute().unwrap();
|
||||||
|
// The order should be in decreasing value of the id
|
||||||
|
let mut expected_ids = (0..100)
|
||||||
|
.filter(|id| {
|
||||||
|
[1, 0, 2].contains(&(id % 10))
|
||||||
|
|| [10, 13].contains(&(id % 20))
|
||||||
|
|| [5, 6].contains(id)
|
||||||
|
})
|
||||||
|
.collect::<Vec<_>>();
|
||||||
|
expected_ids.sort();
|
||||||
|
expected_ids.reverse();
|
||||||
|
assert_eq!(expected_ids, documents_ids);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user