procedural_modelling 0.4.2

A framework-agnostic Procedural Modelling crate.
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

use super::Vec2;
use crate::math::{Polygon, Scalar};
use nalgebra::SVector;

/// A polygon in 2D space.
#[derive(Clone, Debug, PartialEq)]
pub struct Polygon2d<S: Scalar> {
    vertices: Vec<SVector<S, 2>>,
}

impl<S: Scalar> Polygon<Vec2<S>> for Polygon2d<S> {
    fn from_points(points: &[Vec2<S>]) -> Self {
        Self {
            vertices: points.to_vec(),
        }
    }

    fn points(&self) -> &[Vec2<S>] {
        &self.vertices
    }

    fn num_points(&self) -> usize {
        self.vertices.len()
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::math::Polygon;

    #[test]
    fn test_polygon2d() {
        for points in [
            vec![
                Vec2::new(0.0, 0.0),
                Vec2::new(1.0, 0.0),
                Vec2::new(1.0, 1.0),
                Vec2::new(0.0, 1.0),
            ],
            vec![],
            vec![Vec2::new(0.0, 0.0)],
        ] {
            let polygon = Polygon2d::from_points(&points);
            assert_eq!(polygon.num_points(), points.len());
            assert_eq!(polygon.points(), points.as_slice());
        }
    }
}