goko 0.5.5

A lock-free, eventually consistent, concurrent covertree.
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134

/*
* 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.
*/

use crate::NodeAddress;
use std::cmp::Ordering::{self, Less};
use std::f32;

#[derive(Clone, Copy, Debug)]
pub(crate) struct QueryAddress {
    pub(crate) min_dist: f32,
    pub(crate) dist_to_center: f32,
    pub(crate) address: NodeAddress,
}

impl PartialEq for QueryAddress {
    fn eq(&self, other: &QueryAddress) -> bool {
        other.address == self.address
    }
}

impl Eq for QueryAddress {}

impl Ord for QueryAddress {
    fn cmp(&self, other: &QueryAddress) -> Ordering {
        self.partial_cmp(&other).unwrap_or(Ordering::Less)
    }
}

impl PartialOrd for QueryAddress {
    fn partial_cmp(&self, other: &QueryAddress) -> Option<Ordering> {
        // Backwards to make it a max heap.
        match other
            .min_dist
            .partial_cmp(&self.min_dist)
            .unwrap_or(Ordering::Equal)
        {
            Ordering::Greater => Some(Ordering::Greater),
            Ordering::Less => Some(Ordering::Less),
            Ordering::Equal => match other.address.0.cmp(&self.address.0) {
                Ordering::Greater => Some(Ordering::Greater),
                Ordering::Less => Some(Ordering::Less),
                Ordering::Equal => other.dist_to_center.partial_cmp(&self.dist_to_center),
            },
        }
    }
}

#[derive(Clone, Copy, Debug)]
pub(crate) struct QueryAddressRev {
    pub(crate) min_dist: f32,
    pub(crate) dist_to_center: f32,
    pub(crate) address: NodeAddress,
}

impl PartialEq for QueryAddressRev {
    fn eq(&self, other: &QueryAddressRev) -> bool {
        other.address == self.address
    }
}

impl Eq for QueryAddressRev {}

impl Ord for QueryAddressRev {
    fn cmp(&self, other: &QueryAddressRev) -> Ordering {
        self.partial_cmp(&other).unwrap_or(Ordering::Less)
    }
}

impl PartialOrd for QueryAddressRev {
    fn partial_cmp(&self, other: &QueryAddressRev) -> Option<Ordering> {
        // Backwards to make it a max heap.
        match self
            .min_dist
            .partial_cmp(&other.min_dist)
            .unwrap_or(Ordering::Equal)
        {
            Ordering::Greater => Some(Ordering::Greater),
            Ordering::Less => Some(Ordering::Less),
            Ordering::Equal => match self.address.0.cmp(&other.address.0) {
                Ordering::Greater => Some(Ordering::Greater),
                Ordering::Less => Some(Ordering::Less),
                Ordering::Equal => self.dist_to_center.partial_cmp(&other.dist_to_center),
            },
        }
    }
}

#[derive(Clone, Copy, Debug)]
pub(crate) struct QuerySingleton {
    pub(crate) dist: f32,
    pub(crate) index: usize,
}

impl QuerySingleton {
    pub(crate) fn new(index: usize, dist: f32) -> QuerySingleton {
        QuerySingleton { dist, index }
    }
}

impl PartialEq for QuerySingleton {
    fn eq(&self, other: &QuerySingleton) -> bool {
        other.index == self.index
    }
}

impl Eq for QuerySingleton {}

impl Ord for QuerySingleton {
    fn cmp(&self, other: &QuerySingleton) -> Ordering {
        self.partial_cmp(&other).unwrap_or(Less)
    }
}

impl PartialOrd for QuerySingleton {
    fn partial_cmp(&self, other: &QuerySingleton) -> Option<Ordering> {
        self.dist.partial_cmp(&other.dist)
    }
}