lk_math 0.5.1

Collection of reusable mathematical tools.
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

use super::vector::Vector;

pub struct LineIterator<const B: bool, const C: usize> {
    step_options: Vec<Vector<C, i32>>,
    at: Vector<C, i32>,
    end: Vector<C, i32>,
}

impl<const B: bool, const C: usize> LineIterator<B, C> {
    pub fn new(start: Vector<C, i32>, end: Vector<C, i32>) -> Self {
        LineIterator {
            at: start,
            end,
            step_options: vec![],
        }
    }
}
impl<const B: bool, const C: usize> Iterator for LineIterator<B, C> {
    type Item = Vector<C, i32>;

    fn next(&mut self) -> Option<Self::Item> {
        if self.step_options.is_empty() {
            if self.at == self.end {
                self.step_options.push(Vector::all(0));
                if B {
                    return Some(self.at);
                } else {
                    return None;
                }
            }

            let mut dir = self.end - self.at;
            for i in 0..C {
                if dir.values[i] > 0 {
                    dir.values[i] = 1;
                }
                if dir.values[i] < 0 {
                    dir.values[i] = -1;
                }
            }

            for i in 0..C {
                if dir.values[i] != 0 {
                    #[allow(clippy::unnecessary_to_owned)]
                    for mut opt in self.step_options.to_vec() {
                        debug_assert_eq!(opt.values[i], 0);
                        opt.values[i] = dir.values[i];
                        self.step_options.push(opt);
                    }

                    let mut values = [0; C];
                    values[i] = dir.values[i];
                    self.step_options.push(Vector::new(values));
                }
            }

            Some(self.at)
        } else if self.at != self.end {
            let delta = self.end - self.at;
            let best_step = *self
                .step_options
                .iter()
                .max_by_key(|step| delta.inner(**step))
                .unwrap();
            self.at += best_step;

            if !B && self.at == self.end {
                return None;
            }

            Some(self.at)
        } else {
            None
        }
    }
}

// pub type LineIterator2 = LineIterator<2>;
// pub type LineIterator3 = LineIterator<3>;

// impl<const C: usize> Iterator for LineIterator<C> {
//     type Item = Vector<C, i32>;
//
//     fn next(&mut self) -> Option<Self::Item> {
//         if self.step_options.is_empty() {
//             let dir = self.end - self.at;
//             match dir.x().cmp(&0) {
//                 std::cmp::Ordering::Less => {
//                     self.step_options.push(V2::from_xy(-1, 0));
//                     match dir.y().cmp(&0) {
//                         std::cmp::Ordering::Less => {
//                             self.step_options.push(V2::from_xy(0, -1));
//                             self.step_options.push(V2::from_xy(-1, -1));
//                         }
//                         std::cmp::Ordering::Equal => (),
//                         std::cmp::Ordering::Greater => {
//                             self.step_options.push(V2::from_xy(0, 1));
//                             self.step_options.push(V2::from_xy(-1, 1));
//                         }
//                     };
//                 }
//                 std::cmp::Ordering::Equal => {
//                     match dir.y().cmp(&0) {
//                         std::cmp::Ordering::Less => self.step_options.push(V2::from_xy(0, -1)),
//                         std::cmp::Ordering::Equal => (),
//                         std::cmp::Ordering::Greater => self.step_options.push(V2::from_xy(0, 1)),
//                     };
//                 }
//                 std::cmp::Ordering::Greater => {
//                     self.step_options.push(V2::from_xy(1, 0));
//                     match dir.y().cmp(&0) {
//                         std::cmp::Ordering::Less => {
//                             self.step_options.push(V2::from_xy(0, -1));
//                             self.step_options.push(V2::from_xy(1, -1));
//                         }
//                         std::cmp::Ordering::Equal => (),
//                         std::cmp::Ordering::Greater => {
//                             self.step_options.push(V2::from_xy(0, 1));
//                             self.step_options.push(V2::from_xy(1, 1));
//                         }
//                     };
//                 }
//             }
//
//             Some(self.at)
//         } else if self.at != self.end {
//             let delta = self.end - self.at;
//             let best_step = *self
//                 .step_options
//                 .iter()
//                 .max_by_key(|step| delta.inner(**step))
//                 .unwrap();
//             self.at += best_step;
//
//             Some(self.at)
//         } else {
//             None
//         }
//     }
// }