portmatching 0.3.3

Fast Graph Matching for Port Graphs
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

use portgraph::PortView;

use crate::{EdgeProperty, HashSet, PatternID};

use super::{EdgePredicate, OutPort, ScopeAutomaton, StateID, Symbol};

impl<PNode: Clone, PEdge: EdgeProperty> ScopeAutomaton<PNode, PEdge> {
    pub(super) fn outputs(&self, state: StateID) -> impl Iterator<Item = OutPort> + '_ {
        self.graph.outputs(state.0).map(move |p| {
            let offset = self.graph.port_offset(p).expect("invalid port").index();
            OutPort(state, offset)
        })
    }

    #[allow(unused)]
    pub(crate) fn n_states(&self) -> usize {
        self.graph.node_count()
    }

    pub(super) fn predicate(&self, edge: OutPort) -> &EdgePredicate<PNode, PEdge, PEdge::OffsetID> {
        let OutPort(state, offset) = edge;
        let port = self.graph.output(state.0, offset).unwrap();
        let Some(transition) = self.weights[port].as_ref() else {
            panic!("Invalid outgoing port transition");
        };
        &transition.predicate
    }

    pub(super) fn scope(&self, state: StateID) -> &HashSet<Symbol> {
        &self.weights[state.0].as_ref().expect("invalid state").scope
    }

    pub(super) fn matches(&self, state: StateID) -> impl Iterator<Item = PatternID> + '_ {
        self.weights[state.0]
            .as_ref()
            .expect("invalid state")
            .matches
            .iter()
            .copied()
    }

    pub(super) fn is_deterministic(&self, state: StateID) -> bool {
        self.weights[state.0]
            .as_ref()
            .expect("invalid state")
            .deterministic
    }

    #[allow(unused)]
    pub(crate) fn states(&self) -> impl Iterator<Item = StateID> + '_ {
        self.graph.nodes_iter().map(StateID)
    }
}