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
|
/*
* 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;
public class PetriTransition<Label> {
private final Label name;
private Map<Label, Integer> sources;
private Map<Label, Integer> destinations;
public PetriTransition(Label name) {
this.name = name;
sources = new HashMap<>();
destinations = new HashMap<>();
}
public void addSource(Label lab, int tokens) {
sources.merge(lab, tokens, (k, v) -> v + tokens);
}
public int removeSource(Label lab) {
return sources.remove(lab);
}
public void addDestination(Label lab, int tokens) {
destinations.merge(lab, tokens, (k, v) -> v + tokens);
}
public int removeDestination(Label lab, int tokens) {
return destinations.remove(lab);
}
public boolean apply(Map<Label, Integer> nodes) {
Set<Entry<Label, Integer>> debts = new HashSet<>();
boolean failed = false;
for (Entry<Label, Integer> source : sources.entrySet()) {
Label lab = source.getKey();
int cost = source.getValue();
if (nodes.containsKey(lab)) {
int count = nodes.get(lab);
if (count > cost) {
nodes.put(lab, count - cost);
} else {
failed = true;
break;
}
} else {
throw new IllegalArgumentException("Node " + lab + "missing; needed for transition " + name);
}
}
// If we failed, we may need to re-deposit some tokens
if (failed) {
for (Entry<Label, Integer> debt : debts) {
nodes.computeIfPresent(debt.getKey(), (k, v) -> v + debt.getValue());
}
return false;
}
// NOTE: One possibility would be to use the same loop for both of these, and
// just negate sources by default.
for (Entry<Label, Integer> destination : destinations.entrySet()) {
Label lab = destination.getKey();
int profit = destination.getValue();
if (nodes.containsKey(lab)) {
int count = nodes.get(lab);
if (count > profit) {
nodes.put(lab, count + profit);
} else {
failed = true;
break;
}
} else {
throw new IllegalArgumentException("Node " + lab + "missing; needed for transition " + name);
}
}
return true;
}
public void merge(PetriTransition<Label> transition) {
for (Entry<Label, Integer> source : transition.sources.entrySet()) {
int val = source.getValue();
sources.merge(source.getKey(), val, (k, v) -> v + val);
}
for (Entry<Label, Integer> destination : transition.destinations.entrySet()) {
int val = destination.getValue();
sources.merge(destination.getKey(), val, (k, v) -> v + val);
}
}
@Override
public String toString() {
return String.format("PetriTransition [name=%s, sources=%s, destinations=%s]", name, sources, destinations);
}
@Override
public int hashCode() {
return Objects.hash(destinations, name, sources);
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
PetriTransition<?> other = (PetriTransition<?>) obj;
return Objects.equals(destinations, other.destinations) && Objects.equals(name, other.name)
&& Objects.equals(sources, other.sources);
}
@SafeVarargs
public static <Label> PetriTransition<Label> merged(Label mergeName, PetriTransition<Label>... transitions) {
PetriTransition<Label> result = new PetriTransition<>(mergeName);
for (PetriTransition<Label> transition : transitions) {
result.merge(transition);
}
return result;
}
}
|
