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

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

use crate::graph::{AttributeData, AttributeSemantic, GltfGraph, GraphData, GraphEdge, GraphNode};
use petgraph::graph::{EdgeReference, NodeIndex};
use petgraph::visit::EdgeRef;

use super::accessor::Accessor;

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

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

    fn data(&self) -> AttributeData {
        match self.node.data() {
            GraphData::Attribute(data) => data,
            _ => panic!("data is not an attribute"),
        }
    }

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

    pub fn semantic(&self) -> AttributeSemantic {
        self.data().semantic
    }

    pub fn set_semantic(&mut self, semantic: AttributeSemantic) {
        let mut data = self.data();
        data.semantic = semantic;
        self.set_data(data);
    }

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

    pub fn set_accessor(&mut self, accessor: Option<Accessor>) {
        let mut graph = self.node.graph.borrow_mut();

        // Remove existing accessor
        match find_accessor_edge(&graph, self.node.index) {
            Some(edge) => self.node.graph.borrow_mut().remove_edge(edge.id()),
            None => None,
        };

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

fn find_accessor_edge(graph: &GltfGraph, index: NodeIndex) -> Option<EdgeReference<GraphEdge>> {
    graph
        .edges_directed(index, petgraph::Direction::Outgoing)
        .find_map(|edge| match edge.weight() {
            GraphEdge::Accessor => Some(edge),
            _ => None,
        })
}