snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2025-07-26 16:21:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

add the possibility to sort by descending order on geoPoint

Browse Source
This commit is contained in:
Tamo
2021-09-13 14:27:14 +02:00
committed by Irevoire
parent 91ce4d1721
commit c695a1ffd2
2 changed files with 42 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
milli/src/search/criteria/geo.rs
View File

@ -10,6 +10,7 @@ use crate::{GeoPoint, Index, Result};
pub struct Geo<'t> {
index: &'t Index,
rtxn: &'t heed::RoTxn<'t>,
ascending: bool,
parent: Box<dyn Criterion + 't>,
candidates: Box<dyn Iterator<Item = RoaringBitmap>>,
allowed_candidates: RoaringBitmap,
@ -19,11 +20,30 @@ pub struct Geo<'t> {
}
impl<'t> Geo<'t> {
pub fn new(
pub fn asc(
index: &'t Index,
rtxn: &'t heed::RoTxn<'t>,
parent: Box<dyn Criterion + 't>,
point: [f64; 2],
) -> Result<Self> {
Self::new(index, rtxn, parent, point, true)
}
pub fn desc(
index: &'t Index,
rtxn: &'t heed::RoTxn<'t>,
parent: Box<dyn Criterion + 't>,
point: [f64; 2],
) -> Result<Self> {
Self::new(index, rtxn, parent, point, false)
}
fn new(
index: &'t Index,
rtxn: &'t heed::RoTxn<'t>,
parent: Box<dyn Criterion + 't>,
point: [f64; 2],
ascending: bool,
) -> Result<Self> {
let candidates = Box::new(iter::empty());
let allowed_candidates = index.geo_faceted_documents_ids(rtxn)?;
@ -33,6 +53,7 @@ impl<'t> Geo<'t> {
Ok(Self {
index,
rtxn,
ascending,
parent,
candidates,
allowed_candidates,
@ -89,9 +110,12 @@ impl Criterion for Geo<'_> {
}
self.allowed_candidates = &candidates - params.excluded_candidates;
self.candidates = match rtree {
Some(rtree) => {
geo_point(rtree, self.allowed_candidates.clone(), self.point)
}
Some(rtree) => geo_point(
rtree,
self.allowed_candidates.clone(),
self.point,
self.ascending,
),
None => Box::new(std::iter::empty()),
};
}
@ -106,6 +130,7 @@ fn geo_point(
rtree: &RTree<GeoPoint>,
mut candidates: RoaringBitmap,
point: [f64; 2],
ascending: bool,
) -> Box<dyn Iterator<Item = RoaringBitmap>> {
let mut results = Vec::new();
for point in rtree.nearest_neighbor_iter(&point) {
@ -117,5 +142,9 @@ fn geo_point(
}
}
Box::new(results.into_iter())
if ascending {
Box::new(results.into_iter())
} else {
Box::new(results.into_iter().rev())
}
}