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

feat: Introduce binary group by in the query builder

Browse Source
This commit is contained in:
Clément Renault 2019-01-10 20:13:40 +01:00
parent 3d820a27ee
commit 78786a0007
No known key found for this signature in database
GPG Key ID: 0151CDAB43460DAE
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Cargo.toml
View File

@ -30,7 +30,7 @@ rev = "306e201"
[dependencies.group-by]
git = "https://github.com/Kerollmops/group-by.git"
rev = "f1f5d8f"
rev = "5a113fe"
[features]
default = ["simd"]

6
src/rank/query_builder.rs
View File

@ -4,7 +4,7 @@ use std::error::Error;
use std::hash::Hash;
use std::rc::Rc;
use group_by::GroupByMut;
use group_by::BinaryGroupByMut;
use hashbrown::HashMap;
use fst::Streamer;
use rocksdb::DB;
@ -154,7 +154,7 @@ where D: Deref<Target=DB>,
group.sort_unstable_by(|a, b| criterion.evaluate(a, b, view));
for group in GroupByMut::new(group, |a, b| criterion.eq(a, b, view)) {
for group in BinaryGroupByMut::new(group, |a, b| criterion.eq(a, b, view)) {
documents_seen += group.len();
groups.push(group);
@ -231,7 +231,7 @@ where D: Deref<Target=DB>,
group.sort_unstable_by(|a, b| criterion.evaluate(a, b, view));
for group in GroupByMut::new(group, |a, b| criterion.eq(a, b, view)) {
for group in BinaryGroupByMut::new(group, |a, b| criterion.eq(a, b, view)) {
// we must compute the real distinguished len of this sub-group
for document in group.iter() {
let filter_accepted = match &self.inner.filter {