mirror of
https://github.com/meilisearch/MeiliSearch
synced 2025-07-04 20:37:15 +02:00
feat: Introduce binary group by in the query builder
This commit is contained in:
parent
3d820a27ee
commit
78786a0007
2 changed files with 4 additions and 4 deletions
|
@ -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 {
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue