grabapl 0.0.4

A library for graph-based programming languages, with pluggable type systems and a focus on visible intermediate states.
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

use crate::util::semantics::{NodeValue, TestSemantics};
use grabapl::prelude::ConcreteGraph;
use grabapl::{NodeKey, Semantics};

pub fn list_to_value_vec_generic<S: Semantics>(
    graph: &ConcreteGraph<S>,
    head: NodeKey,
) -> Vec<S::NodeConcrete> {
    let mut values = vec![];
    let mut current = Some(head);
    while let Some(current_key) = current.take() {
        let val = graph.get_node_attr(current_key).unwrap();
        values.push(val.clone());

        // get next node in the list, if one exists
        let mut out_nodes_current = graph.out_edges(current_key);
        if let Some((next_node, _)) = out_nodes_current.next() {
            current = Some(next_node);
        }
    }
    values
}

pub fn list_to_value_vec(graph: &ConcreteGraph<TestSemantics>, head: NodeKey) -> Vec<NodeValue> {
    list_to_value_vec_generic::<TestSemantics>(graph, head)
}