reliq 0.3.6

A portable library of primitive-like constructs.
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

use super::*;

::modwire::expose!(
    pub error
    pub set
    pub ty
);

type Q<const A: u8, B, C> = q::Q<A, B, q::DefaultMode, C>;

#[repr(transparent)]
#[derive(Debug)]
#[derive(Clone)]
#[derive(Copy)]
#[derive(PartialEq)]
#[derive(Eq)]
#[derive(::serde::Serialize)]
#[derive(::serde::Deserialize)]
pub struct Point<const A: u8, const B: usize, C, D = q::DefaultEngine>
where
    C: ops::Int,
    C: ops::Prim,
    D: q::Engine,
    (): q::SupportedPrecision<A>,
    (): q::SupportedInt<C>,
    (): q::Supported<A, C> {
    pub(crate) dimensions: array::Array<B, Q<A, C, D>>
}

impl<const A: u8, const B: usize, C, D> Point<A, B, C, D>
where
    C: ops::Int,
    C: ops::Prim,
    D: q::Engine,
    (): q::SupportedPrecision<A>,
    (): q::SupportedInt<C>,
    (): q::Supported<A, C> {
    pub const fn len(&self) -> usize {
        B
    }

    pub fn dimension(&self, k: usize) -> Option<&Q<A, C, D>> {
        self.dimensions.get(k).ok()
    }
}

impl<const A: u8, const B: usize, C, D> Point<A, B, C, D>
where
    C: ops::Int,
    C: ops::Prim,
    C: ops::Signed,
    D: q::Engine,
    (): q::SupportedPrecision<A>,
    (): q::SupportedInt<C>,
    (): q::Supported<A, C> {
    pub fn distance_between(self, rhs: Self) -> Result<Q<A, C, D>> {
        let mut sum: Q<A, C, D> = C::AS_0.into();
        let rhs_iter: array::Iter<_, _> = rhs.dimensions.into_iter();
        for (x_0, x_1) in self.dimensions.into_iter().zip(rhs_iter) {
            let dn: Q<A, C, D> = (x_0 - x_1)?;
            let dn: Q<A, C, D> = (dn * dn)?;
            sum = (sum + dn)?;
        }
        let ret: Q<A, C, D> = sum.sqrt()?;
        Ok(ret)
    }

    pub fn nearest<E>(self, set: E) -> Result<Option<(Q<A, C, D>, Self)>> 
    where
        E: Into<Set<A, B, C, D>> {
        let set: Set<A, B, C, D> = set.into();
        let mut best: Option<(Q<A, C, D>, Self)> = None;
        for candidate in set.points.into_iter() {
            let distance = self.distance_between(candidate)?;
            match &mut best {
                None => best = Some((distance, candidate)),
                Some((best_dist, best_point)) => {
                    if distance < *best_dist {
                        *best_dist = distance;
                        *best_point = candidate;
                    }
                }
            }
        }

        Ok(best)
    }
}

impl<const A: u8, const B: usize, C, D> Default for Point<A, B, C, D>
where
    C: ops::Int,
    C: ops::Prim,
    D: q::Engine,
    (): q::SupportedPrecision<A>,
    (): q::SupportedInt<C>,
    (): q::Supported<A, C> {
    fn default() -> Self {
        let mut dimensions: array::Array<B, Q<A, C, D>> = array::Array::default();
        for _ in 0..B {
            let zero: Q<A, C, D> = C::AS_0.into();
            dimensions.push(zero).unwrap();
        }
        Self {
            dimensions: array::Array::default()
        }
    }
}

impl<const A: u8, const B: usize, C, D, E> From<array::Array<B, E>> for Point<A, B, C, D>
where
    C: ops::Int,
    C: ops::Prim,
    D: q::Engine,
    E: Into<Q<A, C, D>>,
    E: Copy,
    (): q::SupportedPrecision<A>,
    (): q::SupportedInt<C>,
    (): q::Supported<A, C> {
    fn from(value: array::Array<B, E>) -> Self {
        let mut dimensions: array::Array<B, Q<A, C, D>> = array::Array::default();
        for item in value {
            let item: Q<A, C, D> = item.into();
            dimensions.push(item).ok();
        }
        Self {
            dimensions
        }
    }
}

impl<const A: u8, const B: usize, C, D, E> From<[E; B]> for Point<A, B, C, D>
where
    C: ops::Int,
    C: ops::Prim,
    D: q::Engine,
    E: Into<Q<A, C, D>>,
    (): q::SupportedPrecision<A>,
    (): q::SupportedInt<C>,
    (): q::Supported<A, C> {
    fn from(value: [E; B]) -> Self {
        let value: [Q<A, C, D>; B] = value.map(|item| {
            item.into()
        });
        let dimensions: array::Array<B, Q<A, C, D>> = value.into();
        Self {
            dimensions
        }
    }
}