gltf_kun 0.0.7

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

use petgraph::{
    stable_graph::{EdgeReference, NodeIndex},
    visit::EdgeRef,
};

use super::{Edge, Graph, Weight};

/// A node in the graph with a weight.
pub trait GraphNodeWeight<W>: Copy + Into<NodeIndex> + From<NodeIndex>
where
    W: Default + Into<Weight>,
    for<'a> &'a W: TryFrom<&'a Weight>,
    for<'a> &'a mut W: TryFrom<&'a mut Weight>,
{
    fn new(graph: &mut Graph) -> Self {
        let index = graph.add_node(W::default().into());
        Self::from(index)
    }

    fn get<'a>(&self, graph: &'a Graph) -> &'a W {
        self.try_get(graph).expect("Weight not found")
    }
    fn get_mut<'a>(&mut self, graph: &'a mut Graph) -> &'a mut W {
        self.try_get_mut(graph).expect("Weight not found")
    }
    fn try_get<'a>(&self, graph: &'a Graph) -> Option<&'a W> {
        graph.node_weight((*self).into())?.try_into().ok()
    }
    fn try_get_mut<'a>(&mut self, graph: &'a mut Graph) -> Option<&'a mut W> {
        graph.node_weight_mut((*self).into())?.try_into().ok()
    }

    fn take(&mut self, graph: &mut Graph) -> W {
        let weight = self.get_mut(graph);
        std::mem::take(weight)
    }
}

/// A node in the graph with outgoing edges.
pub trait GraphNodeEdges<E>: Copy + Into<NodeIndex>
where
    for<'a> &'a E: TryFrom<&'a Edge> + PartialEq,
    Edge: From<E>,
{
    fn find_edge<'a>(&'a self, graph: &'a Graph, edge: &E) -> Option<EdgeReference<Edge>> {
        graph
            .edges_directed((*self).into(), petgraph::Direction::Outgoing)
            .find(|edge_ref| {
                let e: &E = match edge_ref.weight().try_into() {
                    Ok(e) => e,
                    Err(_) => return false,
                };

                e == edge
            })
    }
    fn find_edge_target<T: From<NodeIndex>>(&self, graph: &Graph, edge: &E) -> Option<T> {
        self.find_edge(graph, edge)
            .map(|edge_ref| edge_ref.target().into())
    }
    fn set_edge_target<T: Into<NodeIndex>>(&self, graph: &mut Graph, edge: E, target: Option<T>) {
        let found_edge = self.find_edge(graph, &edge).map(|edge_ref| edge_ref.id());

        if let Some(found_edge) = found_edge {
            graph.remove_edge(found_edge);
        }

        if let Some(target) = target {
            graph.add_edge((*self).into(), target.into(), edge.into());
        }
    }

    fn find_edges<'a>(
        &'a self,
        graph: &'a Graph,
        edge: &E,
    ) -> impl Iterator<Item = EdgeReference<Edge>> {
        graph
            .edges_directed((*self).into(), petgraph::Direction::Outgoing)
            .filter(|edge_ref| {
                let e: &E = match edge_ref.weight().try_into() {
                    Ok(e) => e,
                    Err(_) => return false,
                };

                e == edge
            })
    }
    fn edge_targets_iter<'a, T: From<NodeIndex>>(
        &'a self,
        graph: &'a Graph,
        edge: &'a E,
    ) -> impl Iterator<Item = T> {
        self.find_edges(graph, edge)
            .map(|edge_ref| edge_ref.target().into())
    }
    fn edge_targets<'a, T: From<NodeIndex> + Ord>(
        &'a self,
        graph: &'a Graph,
        edge: &'a E,
    ) -> Vec<T> {
        let mut vec = self.edge_targets_iter(graph, edge).collect::<Vec<_>>();
        vec.sort();
        vec
    }
    fn add_edge_target<T: Into<NodeIndex>>(&self, graph: &mut Graph, edge: E, target: T) {
        graph.add_edge((*self).into(), target.into(), edge.into());
    }
    fn remove_edge_target<T: Into<NodeIndex>>(&self, graph: &mut Graph, edge: E, target: T) {
        let target_idx: NodeIndex = target.into();

        let found_edge = self
            .find_edges(graph, &edge)
            .find(|edge_ref| edge_ref.target() == target_idx);

        if let Some(found_edge) = found_edge {
            graph.remove_edge(found_edge.id());
        }
    }
    fn create_edge_target<W, T: GraphNodeWeight<W>>(&self, graph: &mut Graph, edge: E) -> T
    where
        W: Default + Into<Weight>,
        for<'a> &'a W: TryFrom<&'a Weight>,
        for<'a> &'a mut W: TryFrom<&'a mut Weight>,
    {
        let target = T::new(graph);
        self.add_edge_target(graph, edge, target);
        target
    }
}