-
-
Notifications
You must be signed in to change notification settings - Fork 21
/
Graph.ck
128 lines (108 loc) · 3.05 KB
/
Graph.ck
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
/*
LiCK Library for ChucK.
Copyright (c) 2007-2012 held jointly by the individual authors.
This file is part of LiCK.
LiCK is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
LiCK is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with LiCK. If not, see <http://www.gnu.org/licenses/>.
*/
public class Graph
{
ArrayList nodes;
ArrayList edges;
fun int n()
{
return nodes.size();
}
fun int e()
{
return edges.size();
}
fun void clear()
{
nodes.clear();
edges.clear();
}
fun Node createNode(Object value)
{
Node node;
value @=> node.value;
nodes.add(node);
return node;
}
fun Edge createEdge(Node source, Node target, Object value)
{
Edge edge;
source @=> edge.source;
target @=> edge.target;
value @=> edge.value;
source.outEdges.add(edge);
target.inEdges.add(edge);
return edge;
}
fun void forEachNode(UnaryProcedure procedure)
{
nodes.forEach(procedure);
}
fun void forEachNode(UnaryPredicate predicate, UnaryProcedure procedure)
{
nodes.forEach(predicate, procedure);
}
fun void forEachNodeValue(UnaryProcedure procedure)
{
nodes.iterator() @=> Iterator iterator;
while (iterator.hasNext())
{
iterator.next() @=> Object value;
procedure.run(value);
}
}
fun void forEachNodeValue(UnaryPredicate predicate, UnaryProcedure procedure)
{
nodes.iterator() @=> Iterator iterator;
while (iterator.hasNext())
{
iterator.next() @=> Object value;
if (predicate.test(value))
{
procedure.run(value);
}
}
}
fun void forEachEdge(UnaryProcedure procedure)
{
edges.forEach(procedure);
}
fun void forEachEdge(UnaryPredicate predicate, UnaryProcedure procedure)
{
edges.forEach(predicate, procedure);
}
fun void forEachEdgeValue(UnaryProcedure procedure)
{
edges.iterator() @=> Iterator iterator;
while (iterator.hasNext())
{
iterator.next() @=> Object value;
procedure.run(value);
}
}
fun void forEachEdgeValue(UnaryPredicate predicate, UnaryProcedure procedure)
{
edges.iterator() @=> Iterator iterator;
while (iterator.hasNext())
{
iterator.next() @=> Object value;
if (predicate.test(value))
{
procedure.run(value);
}
}
}
}