violin 0.3.0

decentralized network coordinate system using the vivaldi algorithm
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

macro_rules! impl_vec {
    ($t:ty) => {
        impl<const N: usize> Vector for $t {
            const LEN: usize = N;

            fn difference(&self, other: &Self) -> Self {
                let mut ret = Self::default();
                for (n, (s, r)) in ret
                    .inner
                    .iter_mut()
                    .zip(self.inner.iter().zip(other.inner.iter()))
                {
                    *n = s - r;
                }
                ret
            }

            fn magnitude2(&self) -> f64 {
                let mut term: f64 = 0.0;
                for n in self.inner.iter() {
                    term += n * n;
                }
                term
            }
        }

        impl<const N: usize> Add<$t> for $t {
            type Output = $t;

            fn add(self, rhs: Self) -> Self::Output {
                let mut ret = Self::default();
                for (n, (s, r)) in ret
                    .inner
                    .iter_mut()
                    .zip(self.inner.iter().zip(rhs.inner.iter()))
                {
                    *n = s + r;
                }
                ret
            }
        }

        impl<const N: usize> AsRef<[f64]> for $t {
            fn as_ref(&self) -> &[f64] { self.inner.as_ref() }
        }

        impl<const N: usize> AsMut<[f64]> for $t {
            fn as_mut(&mut self) -> &mut [f64] { self.inner.as_mut() }
        }

        impl<const N: usize> AddAssign<$t> for $t {
            fn add_assign(&mut self, rhs: $t) {
                for (s, r) in self.inner.iter_mut().zip(rhs.inner.iter()) {
                    *s += r;
                }
            }
        }

        impl<const N: usize> Mul<f64> for $t {
            type Output = $t;

            fn mul(self, rhs: f64) -> Self {
                let mut ret = Self::default();
                for (n, s) in ret.inner.iter_mut().zip(self.inner.iter()) {
                    *n = s * rhs;
                }
                ret
            }
        }

        impl<const N: usize> Div<f64> for $t {
            type Output = $t;

            fn div(self, rhs: f64) -> Self {
                let mut ret = Self::default();
                for (n, s) in ret.inner.iter_mut().zip(self.inner.iter()) {
                    *n = s / rhs;
                }
                ret
            }
        }
    };
}