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
// use claim::debug_assert_ok;
use std::iter::Zip;
use std::ops::*;

use crate::data::line_segment::*;
use crate::data::Point;

pub struct Iter<'a, T: 'a, P: 'a> {
  pub(crate) iter: Zip<std::slice::Iter<'a, Point<T, 2>>, std::slice::Iter<'a, P>>,
}
impl<'a, T, P> Iterator for Iter<'a, T, P> {
  type Item = (&'a Point<T, 2>, &'a P);
  fn next(&mut self) -> Option<(&'a Point<T, 2>, &'a P)> {
    self.iter.next()
  }
}

pub struct IterMut<'a, T: 'a, P: 'a> {
  pub(crate) points: std::slice::IterMut<'a, Point<T, 2>>,
  pub(crate) meta: std::slice::IterMut<'a, P>,
}

impl<'a, T, P> Iterator for IterMut<'a, T, P> {
  type Item = (&'a mut Point<T, 2>, &'a mut P);
  fn next(&mut self) -> Option<(&'a mut Point<T, 2>, &'a mut P)> {
    Some((self.points.next()?, self.meta.next()?))
  }
}

pub struct EdgeIter<'a, T: 'a, P: 'a, const N: usize> {
  pub(crate) at: usize,
  pub(crate) points: &'a [Point<T, N>],
  pub(crate) meta: &'a [P],
}

impl<'a, T, P, const N: usize> Iterator for EdgeIter<'a, T, P, N> {
  type Item = LineSegmentView<'a, T, P, N>;
  fn next(&mut self) -> Option<LineSegmentView<'a, T, P, N>> {
    if self.at >= self.points.len() {
      return None;
    }
    let this_point = self.points.index(self.at);
    let this_meta = self.meta.index(self.at);
    let next_point = self.points.index((self.at + 1) % self.points.len());
    let next_meta = self.meta.index((self.at + 1) % self.points.len());
    self.at += 1;
    Some(LineSegmentView(
      EndPoint::Open((this_point, this_meta)),
      EndPoint::Closed((next_point, next_meta)),
    ))
  }
}