kiddo 5.0.3

A high-performance, flexible, ergonomic k-d tree library. Ideal for geo- and astro- nearest-neighbour and k-nearest-neighbor queries
Documentation 
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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267

#[cfg(feature = "serde")]
pub(crate) mod array {
    use core::option::Option::None;
    use serde::{
        de::{SeqAccess, Visitor},
        ser::SerializeTuple,
        Deserialize, Deserializer, Serialize, Serializer,
    };
    use std::marker::PhantomData;

    pub fn serialize<S: Serializer, T: Serialize, const N: usize>(
        data: &[T; N],
        ser: S,
    ) -> Result<S::Ok, S::Error> {
        let mut s = ser.serialize_tuple(N)?;
        for item in data {
            s.serialize_element(item)?;
        }
        s.end()
    }

    struct ArrayVisitor<T, const N: usize>(PhantomData<T>);

    impl<'de, T, const N: usize> Visitor<'de> for ArrayVisitor<T, N>
    where
        T: Copy + Default + Deserialize<'de>,
    {
        type Value = [T; N];

        fn expecting(&self, formatter: &mut std::fmt::Formatter) -> std::fmt::Result {
            formatter.write_str(&format!("an array of length {}", N))
        }

        #[inline]
        fn visit_seq<A>(self, mut seq: A) -> Result<Self::Value, A::Error>
        where
            A: SeqAccess<'de>,
        {
            // can be optimized using MaybeUninit
            //let mut data = Vec::with_capacity(N);
            let mut data = [T::default(); N];

            for item in data.iter_mut().take(N) {
                match (seq.next_element())? {
                    Some(val) => {
                        // data.push(val);
                        *item = val;
                    }
                    None => return Err(serde::de::Error::invalid_length(N, &self)),
                }
            }

            Ok(data)
        }
    }
    pub fn deserialize<'de, D, T, const N: usize>(deserializer: D) -> Result<[T; N], D::Error>
    where
        D: Deserializer<'de>,
        T: Copy + Default + Deserialize<'de>,
    {
        deserializer.deserialize_tuple(N, ArrayVisitor::<T, N>(PhantomData))
    }
}

/*#[cfg(feature = "serde")]
pub(crate) mod array_of_2ples {
    use core::option::Option::None;
    use serde::{
        de::{SeqAccess, Visitor},
        ser::SerializeTuple,
        Deserialize, Deserializer, Serialize, Serializer,
    };
    use std::marker::PhantomData;

    pub fn serialize<S: Serializer, T: Serialize, const N: usize>(
        data: &[(T, T); N],
        ser: S,
    ) -> Result<S::Ok, S::Error> {
        let mut s = ser.serialize_tuple(N * 2)?;
        for item in data {
            s.serialize_element(&item.0)?;
            s.serialize_element(&item.1)?;
        }
        s.end()
    }

    struct Array2PleVisitor<T, const N: usize>(PhantomData<T>);

    impl<'de, T, const N: usize> Visitor<'de> for Array2PleVisitor<T, N>
    where
        T: Copy + Default + Deserialize<'de>,
    {
        type Value = [(T, T); N];

        fn expecting(&self, formatter: &mut std::fmt::Formatter) -> std::fmt::Result {
            formatter.write_str(&format!("an array of 2ples of length {}", N))
        }

        #[inline]
        fn visit_seq<A>(self, mut seq: A) -> Result<Self::Value, A::Error>
        where
            A: SeqAccess<'de>,
        {
            // can be optimized using MaybeUninit
            // let mut data: Vec<(T, T)> = Vec::with_capacity(N);
            let mut data = [(T::default(), T::default()); N];

            for idx in 0..N {
                match (seq.next_element::<T>())? {
                    Some(val_0) => match (seq.next_element::<T>())? {
                        Some(val_1) => {
                            // data.push((val_0, val_1));
                            data[idx].0 = val_0;
                            data[idx].1 = val_1;
                        }
                        None => return Err(serde::de::Error::invalid_length(N, &self)),
                    },
                    None => return Err(serde::de::Error::invalid_length(N, &self)),
                }
            }
            // match data.try_into() {
            //     Ok(arr) => Ok(arr),
            //     Err(_) => unreachable!(),
            // }

            Ok(data)
        }
    }
    pub fn deserialize<'de, D, T, const N: usize>(deserializer: D) -> Result<[(T, T); N], D::Error>
    where
        D: Deserializer<'de>,
        T: Copy + Default + Deserialize<'de>,
    {
        deserializer.deserialize_tuple(N * 2, Array2PleVisitor::<T, N>(PhantomData))
    }
}*/

#[cfg(feature = "serde")]
pub(crate) mod array_of_arrays {
    use core::option::Option::None;
    use serde::{
        de::{SeqAccess, Visitor},
        ser::SerializeTuple,
        Deserialize, Deserializer, Serialize, Serializer,
    };
    use std::marker::PhantomData;

    pub fn serialize<S: Serializer, T: Serialize, const N: usize, const K: usize>(
        data: &[[T; K]; N],
        ser: S,
    ) -> Result<S::Ok, S::Error> {
        let mut s = ser.serialize_tuple(N * K)?;
        for item in data {
            for elem in item.iter().take(K) {
                s.serialize_element(elem)?;
            }
        }
        s.end()
    }

    struct ArrayArrayVisitor<T, const N: usize, const K: usize>(PhantomData<T>);

    impl<'de, T, const N: usize, const K: usize> Visitor<'de> for ArrayArrayVisitor<T, N, K>
    where
        T: Copy + Default + Deserialize<'de>,
    {
        type Value = [[T; K]; N];

        fn expecting(&self, formatter: &mut std::fmt::Formatter) -> std::fmt::Result {
            formatter.write_str(&format!("an array of arrays, dimensions of {}x{}", K, N))
        }

        #[inline]
        fn visit_seq<A>(self, mut seq: A) -> Result<Self::Value, A::Error>
        where
            A: SeqAccess<'de>,
        {
            // can be optimized using MaybeUninit
            // let mut data: Vec<(T, T)> = Vec::with_capacity(N);
            let mut data = [[T::default(); K]; N];

            for item in data.iter_mut().take(N) {
                for elem in item.iter_mut().take(K) {
                    match (seq.next_element::<T>())? {
                        Some(val) => {
                            *elem = val;
                        }
                        None => return Err(serde::de::Error::invalid_length(N, &self)),
                    }
                }
            }

            Ok(data)
        }
    }
    pub fn deserialize<'de, D, T, const N: usize, const K: usize>(
        deserializer: D,
    ) -> Result<[[T; K]; N], D::Error>
    where
        D: Deserializer<'de>,
        T: Copy + Default + Deserialize<'de>,
    {
        deserializer.deserialize_tuple(N * K, ArrayArrayVisitor::<T, N, K>(PhantomData))
    }
}

#[cfg(feature = "serde")]
pub(crate) mod array_of_vecs {
    use core::option::Option::None;
    use serde::{
        de::{SeqAccess, Visitor},
        ser::SerializeTuple,
        Deserialize, Deserializer, Serialize, Serializer,
    };
    use std::marker::PhantomData;

    pub fn serialize<S: Serializer, T: Serialize, const N: usize>(
        data: &[Vec<T>; N],
        ser: S,
    ) -> Result<S::Ok, S::Error> {
        let mut s = ser.serialize_tuple(N)?;
        for item in data {
            s.serialize_element(item)?;
        }
        s.end()
    }

    struct ArrayVecVisitor<T, const N: usize>(PhantomData<T>);

    impl<'de, T, const N: usize> Visitor<'de> for ArrayVecVisitor<T, N>
    where
        T: Copy + Default + Deserialize<'de>,
    {
        type Value = [Vec<T>; N];

        fn expecting(&self, formatter: &mut std::fmt::Formatter) -> std::fmt::Result {
            formatter.write_str(&format!("an array of vecs, dimension of {}", N))
        }

        #[inline]
        fn visit_seq<A>(self, mut seq: A) -> Result<Self::Value, A::Error>
        where
            A: SeqAccess<'de>,
        {
            // can be optimized using MaybeUninit
            let mut data = array_init::array_init(|_| Vec::new());

            for item in data.iter_mut().take(N) {
                match (seq.next_element::<Vec<T>>())? {
                    Some(val) => {
                        *item = val;
                    }
                    None => return Err(serde::de::Error::invalid_length(N, &self)),
                }
            }

            Ok(data)
        }
    }
    pub fn deserialize<'de, D, T, const N: usize>(deserializer: D) -> Result<[Vec<T>; N], D::Error>
    where
        D: Deserializer<'de>,
        T: Copy + Default + Deserialize<'de>,
    {
        deserializer.deserialize_tuple(N, ArrayVecVisitor::<T, N>(PhantomData))
    }
}