ttgraph 0.5.0

Typed/Transactional Graph container
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

#![allow(dead_code)]
#![allow(unused_variables)]
#![allow(unused_mut)]

#[cfg(test)]
mod test_group {
  use std::collections::BTreeSet;

  use ttgraph::*;

  #[derive(TypedNode, Debug)]
  struct Node {
    #[group(group1, x)]
    a: NodeIndex,
    #[group(group1, x)]
    b: Vec<NodeIndex>,
    #[group(group2)]
    c: NodeIndex,
    inserted: NodeIndex,
    #[group(group2, x)]
    d: BTreeSet<NodeIndex>,
  }

  impl Default for Node {
    fn default() -> Self {
      Node {
        a: NodeIndex::empty(),
        b: Vec::default(),
        c: NodeIndex::empty(),
        inserted: NodeIndex::empty(),
        d: BTreeSet::default(),
      }
    }
  }

  node_enum! {
    #[derive(Debug)]
    enum Nodes{
      A(Node)
    }
  }

  #[test]
  fn test_link_group() {
    let ctx = Context::new();
    let mut graph = Graph::<Nodes>::new(&ctx);
    let mut trans = Transaction::new(&ctx);

    let x1 = trans.insert(Nodes::A(Node::default()));
    let x2 = trans.insert(Nodes::A(Node::default()));
    let x3 = trans.insert(Nodes::A(Node::default()));
    let x4 = trans.insert(Nodes::A(Node::default()));
    let x5 = trans.insert(Nodes::A(Node {
      a: x1,
      b: vec![x2, x3],
      c: x4,
      inserted: x2,
      d: BTreeSet::from([x1, x3]),
    }));

    graph.commit(trans).unwrap();

    let node = graph.get(x5).unwrap();
    assert_eq!(node.get_links_by_group("group1"), vec![x1, x2, x3]);
    assert_eq!(node.get_links_by_group("group2"), vec![x4, x1, x3]);
    assert_eq!(node.get_links_by_group("x"), vec![x1, x2, x3, x1, x3]);
  }

  #[derive(TypedNode, Debug)]
  struct NodeA {
    a: usize,
  }
  #[derive(TypedNode, Debug)]
  struct NodeB {
    b: usize,
  }
  #[derive(TypedNode, Debug)]
  struct NodeC {
    c: usize,
  }
  #[derive(TypedNode, Debug)]
  struct NodeD {
    d: usize,
  }

  node_enum! {
    #[derive(Debug)]
    enum MultiNodes{
      A(NodeA),
      B(NodeB),
      C(NodeC),
      D(NodeD),
    }
    group!{
      first{A, B},
      second{C, D},
      third{A, D},
      one{B},
      all{A, B, C, D},
    }
  }

  #[test]
  fn test_node_group() {
    let ctx = Context::new();
    let mut graph = Graph::<MultiNodes>::new(&ctx);
    let mut trans = Transaction::new(&ctx);

    let a = trans.insert(MultiNodes::A(NodeA { a: 1 }));
    let b = trans.insert(MultiNodes::B(NodeB { b: 2 }));
    let c = trans.insert(MultiNodes::C(NodeC { c: 3 }));
    let d = trans.insert(MultiNodes::D(NodeD { d: 4 }));

    graph.commit(trans).unwrap();

    assert_eq!(Vec::from_iter(graph.iter_group("first").map(|(x, _)| x)), vec![a, b]);
    assert_eq!(Vec::from_iter(graph.iter_group("second").map(|(x, _)| x)), vec![c, d]);
    assert_eq!(Vec::from_iter(graph.iter_group("third").map(|(x, _)| x)), vec![a, d]);
    assert_eq!(Vec::from_iter(graph.iter_group("one").map(|(x, _)| x)), vec![b]);
    assert_eq!(Vec::from_iter(graph.iter_group("all").map(|(x, _)| x)), vec![a, b, c, d]);
  }

  #[derive(TypedNode)]
  #[phantom_group(b)]
  struct A {
    #[group(a)]
    x: NodeIndex,
  }

  #[derive(TypedNode)]
  struct B {
    #[group(a)]
    x: NodeIndex,
    #[group(b)]
    y: NodeIndex,
  }

  node_enum! {
    enum NodeAB{
      A(A),
      B(B),
    }
    group!{ All{A, B} }
    link_type!{
      All.a : A,
      All.b : B,
    }
  }
}