kdtree-simd 0.6.1-alpha.0

K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup
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

use std::ops::{Add, AddAssign, Div, DivAssign, Mul, MulAssign, Sub, SubAssign};

define_ty!(F32x4, f32, f32, f32, f32);
impl_minimal!(F32x4, f32, 4, x0, x1, x2, x3);

impl F32x4 {
    pub fn from_slice(slice: &[f32]) -> F32x4 {
        assert!(slice.len() >= Self::lanes());
        unsafe {
            F32x4(
                *slice.get_unchecked(0),
                *slice.get_unchecked(1),
                *slice.get_unchecked(2),
                *slice.get_unchecked(3),
            )
        }
    }

    pub fn horizontal_add(self) -> f32 {
        self.0 + self.1 + self.2 + self.3
    }
}

impl_op4!(Mul, mul, F32x4, *);
impl_op4!(assn MulAssign, mul_assign, F32x4, *=);
impl_op4!(Div, div, F32x4, /);
impl_op4!(assn DivAssign, div_assign, F32x4, /=);
impl_op4!(Add, add, F32x4, +);
impl_op4!(assn AddAssign, add_assign, F32x4, +=);
impl_op4!(Sub, sub, F32x4, -);
impl_op4!(assn SubAssign, sub_assign, F32x4, -=);

impl_euclidean!(F32x4, f32);