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
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

use std::hash::Hash;

use crate::{
    math::Transformable,
    mesh::{EuclideanMeshType, MeshType},
};

use super::CurvedEdgeType;

/// A trait that defines how the payload of an edge should behave.
pub trait EdgePayload: Clone + std::fmt::Debug + PartialEq {
    /// Returns a new default instance without any meaningful data.
    fn allocate() -> Self;

    /// Returns true if the payload is empty.
    fn is_empty(&self) -> bool;
}

/// The default edge payload can be safely constructed with a default constructor.
/// For example, when extruding, it is ok for all new edges to have the same default payload.
pub trait DefaultEdgePayload: EdgePayload + Default {}

/// An empty edge payload if you don't need any additional information.
#[derive(Debug, Clone, Copy, PartialEq, Default, Hash)]
pub struct EmptyEdgePayload<T: MeshType> {
    _phantom: std::marker::PhantomData<T>,
}

impl<T: MeshType> EdgePayload for EmptyEdgePayload<T> {
    fn allocate() -> Self {
        Self {
            _phantom: std::marker::PhantomData,
        }
    }
    fn is_empty(&self) -> bool {
        true
    }
}

impl<T: MeshType> DefaultEdgePayload for EmptyEdgePayload<T> {}

impl<const D: usize, T: EuclideanMeshType<D>> Transformable<D> for EmptyEdgePayload<T> {
    type Rot = T::Rot;
    type S = T::S;
    type Trans = T::Trans;
    type Vec = T::Vec;

    fn transform(&mut self, _: &Self::Trans) -> &mut Self {
        self
    }

    fn lerp(&mut self, _: &Self, _: Self::S) -> &mut Self {
        self
    }
}

/// A curved edge payload with nothing else
#[derive(Debug, Default, Clone, PartialEq)]
pub struct CurvedEdgePayload<const D: usize, T: EuclideanMeshType<D>> {
    curve: CurvedEdgeType<D, T>,
}

impl<const D: usize, T: EuclideanMeshType<D>> CurvedEdgePayload<D, T> {
    /// Returns the curve type of the edge
    pub fn curve_type(&self) -> CurvedEdgeType<D, T> {
        self.curve
    }

    /// Sets the curve type of the edge
    pub fn set_curve_type(&mut self, curve_type: CurvedEdgeType<D, T>) {
        self.curve = curve_type;
    }
}

// TODO: somehow make sure the twin is never curved or has the same curve type
// TODO: make sure edge payloads are printed even for winged edges
impl<const D: usize, T: EuclideanMeshType<D>> EdgePayload for CurvedEdgePayload<D, T> {
    fn allocate() -> Self {
        Default::default()
    }
    fn is_empty(&self) -> bool {
        match self.curve {
            CurvedEdgeType::Linear => true,
            _ => false,
        }
    }
}

impl<const D: usize, T: EuclideanMeshType<D>> DefaultEdgePayload for CurvedEdgePayload<D, T> {}

impl<const D: usize, T: EuclideanMeshType<D>> Transformable<D> for CurvedEdgePayload<D, T> {
    type Rot = T::Rot;
    type S = T::S;
    type Trans = T::Trans;
    type Vec = T::Vec;

    fn transform(&mut self, t: &Self::Trans) -> &mut Self {
        match &mut self.curve {
            CurvedEdgeType::Linear => {}
            CurvedEdgeType::QuadraticBezier(control_point) => {
                control_point.transform(t);
            }
            CurvedEdgeType::CubicBezier(control_point1, control_point2) => {
                control_point1.transform(t);
                control_point2.transform(t);
            }
        }
        self
    }

    fn lerp(&mut self, _other: &Self, _t: Self::S) -> &mut Self {
        match &mut self.curve {
            CurvedEdgeType::Linear => {}
            CurvedEdgeType::QuadraticBezier(_cp) => {
                todo!();
            }
            CurvedEdgeType::CubicBezier(_cp1, _cp2) => {
                todo!();
            }
        }
        self
    }
}