dsmc 0.1.6

Digitalservo Motion Control Library
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

use std::ops::{Add, AddAssign, Deref, DerefMut, Mul, MulAssign};
use num_traits::Float;

mod dka_method;
pub use dka_method::dka_method;

mod vieta_formula;
pub use vieta_formula::vieta_formula;

/// Coefficients of a decending polynomial
#[derive(Debug, Clone, PartialEq)]
pub struct Polynomial<T>(pub Vec<T>);

impl<T: Float> Polynomial<T> {
    pub fn new() -> Self {
        Polynomial(vec![])
    }

    pub fn zeros(degree: usize) -> Self {
        Polynomial(vec![T::zero(); degree + 1])
    }
}

impl<T: Float> Deref for Polynomial<T> {
    type Target = Vec<T>;
    fn deref(&self) -> &Self::Target {
        &self.0
    }
}

impl<T: Float> DerefMut for Polynomial<T> {
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.0
    }
}

impl<T: Float + AddAssign> Add for &Polynomial<T> {
    type Output = Polynomial<T>;
    fn add(self, rhs: &Polynomial<T>) -> Polynomial<T> {
        let max_len = self.len().max(rhs.len());
        let mut result = vec![T::zero(); max_len];

        // Coefficients are descending-order (index 0 = highest degree), so operands of
        // different lengths must be aligned by degree from the constant-term end.
        for (slot, &v) in result.iter_mut().rev().zip(self.iter().rev()) {
            *slot += v;
        }
        for (slot, &v) in result.iter_mut().rev().zip(rhs.iter().rev()) {
            *slot += v;
        }
        Polynomial(result)
    }
}

impl<T: Float + AddAssign> AddAssign<&Polynomial<T>> for Polynomial<T> {
    fn add_assign(&mut self, rhs: &Polynomial<T>) {
        let max_len = self.len().max(rhs.len());
        if self.len() < max_len {
            // Prepend (not append) zeros, since index 0 is the highest degree.
            self.0.splice(0..0, std::iter::repeat(T::zero()).take(max_len - self.len()));
        }
        let offset = self.len() - rhs.len();
        for (i, &v) in rhs.iter().enumerate() {
            self[offset + i] += v;
        }
    }
}

impl<T: Float + AddAssign> Mul for &Polynomial<T> {
    type Output = Polynomial<T>;
    fn mul(self, rhs: &Polynomial<T>) -> Polynomial<T> {
        if self.is_empty() || rhs.is_empty() {
            return Polynomial(vec![T::zero()]);
        }
        let mut result = vec![T::zero(); self.len() + rhs.len() - 1];
        for (i, &ai) in self.iter().enumerate() {
            for (j, &bj) in rhs.iter().enumerate() {
                result[i + j] += ai * bj;
            }
        }
        Polynomial(result)
    }
}

impl<T: Float + MulAssign> Mul<T> for &Polynomial<T> {
    type Output = Polynomial<T>;
    fn mul(self, rhs: T) -> Polynomial<T> {
        Polynomial(self.iter().map(|&x| x * rhs).collect())
    }
}

impl<T: Float + MulAssign> Mul<T> for Polynomial<T> {
    type Output = Polynomial<T>;
    fn mul(self, rhs: T) -> Polynomial<T> {
        &self * rhs
    }
}

impl<T: Float + MulAssign> MulAssign<T> for Polynomial<T> {
    fn mul_assign(&mut self, rhs: T) {
        for x in self.iter_mut() {
            *x *= rhs;
        }
    }
}

impl<T: Float + AddAssign> MulAssign<&Polynomial<T>> for Polynomial<T> {
    fn mul_assign(&mut self, rhs: &Polynomial<T>) {
        let result = &*self * rhs;
        self.0 = result.0;
    }
}