gltf_kun 0.0.2

Extensible library for building glTF toolchains.
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
148
149
150
151

use std::{cell::RefCell, rc::Rc};

use petgraph::graph::{EdgeReference, NodeIndex};

use crate::graph::{GltfGraph, GraphData, GraphEdge, GraphNode, NodeData};
use petgraph::visit::EdgeRef;

use super::{
    mesh::Mesh,
    scene::Scene,
    util::{add_child, children},
};

pub enum NodeParent {
    Scene(Scene),
    Node(Node),
}

impl NodeParent {
    fn from_index(graph: &Rc<RefCell<GltfGraph>>, index: NodeIndex) -> Option<Self> {
        match graph.borrow()[index] {
            GraphData::Scene(_) => Some(NodeParent::Scene(Scene::new(graph.clone(), index))),
            GraphData::Node(_) => Some(NodeParent::Node(Node::new(graph.clone(), index))),
            _ => None,
        }
    }
}

pub struct Node {
    pub(crate) node: GraphNode,
}

impl Node {
    pub fn new(graph: Rc<RefCell<GltfGraph>>, index: NodeIndex) -> Self {
        Self {
            node: GraphNode::new(graph, index),
        }
    }

    fn data(&self) -> NodeData {
        match self.node.data() {
            GraphData::Node(data) => data,
            _ => panic!("data is not a node"),
        }
    }

    fn set_data(&mut self, data: NodeData) {
        self.node.set_data(GraphData::Node(data));
    }

    fn find_parent_edge(graph: &GltfGraph, index: NodeIndex) -> Option<EdgeReference<GraphEdge>> {
        graph
            .edges_directed(index, petgraph::Direction::Incoming)
            .find(|edge| matches!(edge.weight(), GraphEdge::Child))
    }

    pub fn name(&self) -> Option<String> {
        self.data().name
    }

    pub fn set_name(&mut self, name: Option<String>) {
        let mut data = self.data();
        data.name = name;
        self.set_data(data);
    }

    pub fn translation(&self) -> [f32; 3] {
        self.data().translation
    }

    pub fn set_translation(&mut self, translation: [f32; 3]) {
        let mut data = self.data();
        data.translation = translation;
        self.set_data(data);
    }

    pub fn rotation(&self) -> [f32; 4] {
        self.data().rotation
    }

    pub fn set_rotation(&mut self, rotation: [f32; 4]) {
        let mut data = self.data();
        data.rotation = rotation;
        self.set_data(data);
    }

    pub fn scale(&self) -> [f32; 3] {
        self.data().scale
    }

    pub fn set_scale(&mut self, scale: [f32; 3]) {
        let mut data = self.data();
        data.scale = scale;
        self.set_data(data);
    }

    pub fn parent(&self) -> Option<NodeParent> {
        let graph = self.node.graph.borrow();
        let edge = match Self::find_parent_edge(&graph, self.node.index) {
            Some(edge) => edge,
            None => return None,
        };

        NodeParent::from_index(&self.node.graph, edge.source())
    }

    pub fn remove_parent(&mut self) {
        let graph = self.node.graph.borrow();
        let edge = Self::find_parent_edge(&graph, self.node.index);

        if let Some(edge) = edge {
            self.node.graph.borrow_mut().remove_edge(edge.id());
        }
    }

    pub fn children(&self) -> Vec<Node> {
        children(&self.node.graph, self.node.index)
    }

    pub fn add_child(&mut self, child: &mut Node) {
        add_child(&self.node.graph, self.node.index, child);
    }

    pub fn mesh(&self) -> Option<Mesh> {
        find_mesh_edge(&self.node.graph.borrow(), self.node.index)
            .map(|edge| Mesh::new(self.node.graph.clone(), edge.target()))
    }

    pub fn set_mesh(&mut self, mesh: Option<Mesh>) {
        // Remove existing mesh
        match find_mesh_edge(&self.node.graph.borrow(), self.node.index) {
            Some(edge) => self.node.graph.borrow_mut().remove_edge(edge.id()),
            None => None,
        };

        // Add new mesh
        if let Some(mesh) = mesh {
            self.node.graph.borrow_mut().add_edge(
                self.node.index,
                mesh.node.index,
                GraphEdge::Mesh,
            );
        }
    }
}

fn find_mesh_edge(graph: &GltfGraph, index: NodeIndex) -> Option<EdgeReference<GraphEdge>> {
    graph
        .edges_directed(index, petgraph::Direction::Outgoing)
        .find(|edge| matches!(edge.weight(), GraphEdge::Mesh))
}