gltf_kun 0.0.10

Graph-based glTF processing 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
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
141
142
143
144
145
146
147

use petgraph::graph::NodeIndex;

use crate::graph::{Edge, Extensions, Graph, GraphNodeEdges, GraphNodeWeight, Weight};

use super::{node::NodeEdge, primitive::Primitive, GltfEdge, GltfWeight, Node};

#[derive(Clone, Debug, PartialEq, Eq)]
pub enum MeshEdge {
    Primitive,
    Material,
}

impl<'a> TryFrom<&'a Edge> for &'a MeshEdge {
    type Error = ();
    fn try_from(value: &'a Edge) -> Result<Self, Self::Error> {
        match value {
            Edge::Gltf(GltfEdge::Mesh(edge)) => Ok(edge),
            _ => Err(()),
        }
    }
}

impl From<MeshEdge> for Edge {
    fn from(edge: MeshEdge) -> Self {
        Self::Gltf(GltfEdge::Mesh(edge))
    }
}

#[derive(Clone, Debug, Default)]
pub struct MeshWeight {
    pub name: Option<String>,
    pub extras: gltf::json::Extras,

    pub weights: Vec<f32>,
}

impl From<MeshWeight> for Weight {
    fn from(weight: MeshWeight) -> Self {
        Self::Gltf(GltfWeight::Mesh(weight))
    }
}

impl<'a> TryFrom<&'a Weight> for &'a MeshWeight {
    type Error = ();
    fn try_from(value: &'a Weight) -> Result<Self, Self::Error> {
        match value {
            Weight::Gltf(GltfWeight::Mesh(weight)) => Ok(weight),
            _ => Err(()),
        }
    }
}

impl<'a> TryFrom<&'a mut Weight> for &'a mut MeshWeight {
    type Error = ();
    fn try_from(value: &'a mut Weight) -> Result<Self, Self::Error> {
        match value {
            Weight::Gltf(GltfWeight::Mesh(weight)) => Ok(weight),
            _ => Err(()),
        }
    }
}

#[derive(Copy, Clone, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]
pub struct Mesh(pub NodeIndex);

impl From<NodeIndex> for Mesh {
    fn from(index: NodeIndex) -> Self {
        Self(index)
    }
}

impl From<Mesh> for NodeIndex {
    fn from(mesh: Mesh) -> Self {
        mesh.0
    }
}

impl GraphNodeWeight<MeshWeight> for Mesh {}
impl GraphNodeEdges for Mesh {}
impl Extensions for Mesh {}

impl Mesh {
    /// Returns any Nodes using this Mesh.
    pub fn nodes(&self, graph: &Graph) -> Vec<Node> {
        self.edge_sources(graph, &NodeEdge::Mesh)
    }

    pub fn primitives(&self, graph: &Graph) -> Vec<Primitive> {
        self.edge_targets(graph, &MeshEdge::Primitive)
    }
    pub fn add_primitive(&self, graph: &mut Graph, primitive: &Primitive) {
        self.add_edge_target(graph, MeshEdge::Primitive, *primitive);
    }
    pub fn remove_primitive(&self, graph: &mut Graph, primitive: &Primitive) {
        self.remove_edge_target(graph, MeshEdge::Primitive, *primitive);
    }
    pub fn create_primitive(&self, graph: &mut Graph) -> Primitive {
        self.create_edge_target(graph, MeshEdge::Primitive)
    }
}

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

    #[test]
    fn nodes() {
        let mut graph = Graph::default();

        let mesh = Mesh::new(&mut graph);
        let node_1 = Node::new(&mut graph);
        let node_2 = Node::new(&mut graph);

        node_1.set_mesh(&mut graph, Some(mesh));
        assert_eq!(mesh.nodes(&graph), vec![node_1]);

        node_2.set_mesh(&mut graph, Some(mesh));
        assert_eq!(mesh.nodes(&graph), vec![node_1, node_2]);

        node_1.set_mesh(&mut graph, None);
        assert_eq!(mesh.nodes(&graph), vec![node_2]);

        node_2.set_mesh(&mut graph, None);
        assert!(mesh.nodes(&graph).is_empty());
    }

    #[test]
    fn primitives() {
        let mut graph = Graph::default();

        let mesh = Mesh::new(&mut graph);
        let primitive_1 = Primitive::new(&mut graph);
        let primitive_2 = Primitive::new(&mut graph);

        mesh.add_primitive(&mut graph, &primitive_1);
        assert_eq!(mesh.primitives(&graph), vec![primitive_1]);

        mesh.add_primitive(&mut graph, &primitive_2);
        assert_eq!(mesh.primitives(&graph), vec![primitive_1, primitive_2]);

        mesh.remove_primitive(&mut graph, &primitive_1);
        assert_eq!(mesh.primitives(&graph), vec![primitive_2]);

        mesh.remove_primitive(&mut graph, &primitive_2);
        assert!(mesh.primitives(&graph).is_empty());
    }
}