1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49

/*
* Licensed to Elasticsearch B.V. under one or more contributor
* license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright
* ownership. Elasticsearch B.V. licenses this file to you under
* the Apache License, Version 2.0 (the "License"); you may
* not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
*  http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied.  See the License for the
* specific language governing permissions and limitations
* under the License.
*/

//! Tools and data structures for assisting cover tree queries.

use crate::NodeAddress;
use pointcloud::*;

pub(crate) mod query_items;

pub(crate) mod knn_query_heap;
pub use knn_query_heap::KnnQueryHeap;
pub(crate) mod trace_query_heap;
pub use trace_query_heap::MultiscaleQueryHeap;

/// If you have a algorithm that does local brute force KNN on just the children,
/// implement this to use the node fn
pub trait RoutingQueryHeap {
    /// Shoves data in.
    fn push_nodes(
        &mut self,
        indexes: &[NodeAddress],
        dists: &[f32],
        parent_address: Option<NodeAddress>,
    );
}

/// If you have a algorithm that does local brute force KNN on just the singletons,
/// implement this to use the node fn
pub trait SingletonQueryHeap {
    /// Shove a bunch of single points onto the heap
    fn push_outliers(&mut self, indexes: &[PointIndex], dists: &[f32]);
}