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
|
/*
* esodata - data structures and other things, of varying utility
* Copyright 2022, Ben Culkin
*
* This program 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.
*
* This program 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 this program. If not, see <https://www.gnu.org/licenses/>.
*/
package bjc.data;
import java.util.*;
import java.util.Map.Entry;
/**
* Represents a Petri net, a device oft used for modeling concurrent processes.
*
* @author bjcul
*
* @param <Label> The type labeling the nodes and transitions in this net.
*/
public class PetriNet<Label> {
private Map<Label, Integer> nodes;
private Map<Label, PetriTransition<Label>> transitions;
/**
* Create a new Petri net
*/
public PetriNet() {
nodes = new HashMap<>();
transitions = new HashMap<>();
}
/**
* Merge this Petri net for another.
*
* @param net The other Petri net.
*/
public void merge(PetriNet<Label> net) {
for (Entry<Label, Integer> node : net.nodes.entrySet()) {
int value = node.getValue();
nodes.merge(node.getKey(), value, (k, v) -> v + value);
}
for (Entry<Label, PetriTransition<Label>> transition : net.transitions.entrySet()) {
PetriTransition<Label> value = transition.getValue();
transitions.merge(transition.getKey(), value, (k, v) -> {
v.merge(value);
return v;
});
}
}
/**
* Create a Petri net from merging others.
*
* @param <Label> The type of the labels in the Petri net
* @param nets The nets to merge
*
* @return A net formed by merging all of the provided ones.
*/
@SafeVarargs
public static <Label> PetriNet<Label> merged(PetriNet<Label>... nets) {
PetriNet<Label> result = new PetriNet<>();
for (PetriNet<Label> net : nets) {
result.merge(net);
}
return result;
}
@Override
public String toString() {
return String.format("PetriNet [nodes=%s, transitions=%s]", nodes, transitions);
}
@Override
public int hashCode() {
return Objects.hash(nodes, transitions);
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
PetriNet<?> other = (PetriNet<?>) obj;
return Objects.equals(nodes, other.nodes) && Objects.equals(transitions, other.transitions);
}
}
|
