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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
|
package coffee.liz.ecs;
import coffee.liz.ecs.model.Component;
import coffee.liz.ecs.model.Entity;
import coffee.liz.ecs.model.Query;
import coffee.liz.ecs.model.System;
import coffee.liz.ecs.model.World;
import lombok.RequiredArgsConstructor;
import lombok.extern.log4j.Log4j2;
import java.time.Duration;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Set;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.stream.Collectors;
/** World that updates in {@link System#getDependencies()} topological order. */
@Log4j2
@RequiredArgsConstructor
public class DAGWorld<T> implements World<T> {
/** All entities in the world. */
protected final Set<Entity> entities = Collections.synchronizedSet(new HashSet<>());
/** Cache mapping component types to entities having that component. */
private final Map<Class<? extends Component>, Set<Entity>> componentCache = Collections
.synchronizedMap(new HashMap<>());
/** Deterministic ID's for spawned entities. */
private final AtomicInteger nextEntityId = new AtomicInteger(0);
/** All registered systems. */
protected final Map<Class<? extends System<T>>, System<T>> systems;
/** Ordered list of systems for execution. */
private final List<System<T>> systemExecutionOrder;
@SafeVarargs
public DAGWorld(final System<T>... systems) {
this.systems = singletonClazzMap(systems);
this.systemExecutionOrder = buildExecutionOrder(Arrays.asList(systems));
log.debug("Executing in order: {}", systemExecutionOrder);
}
@Override
public Entity createEntity() {
final Entity entity = Entity.builder().id(nextEntityId.incrementAndGet()).build();
entities.add(entity);
return entity;
}
@Override
public void removeEntity(final Entity entity) {
entity.getComponentMap().keySet().forEach(componentType -> {
final Set<Entity> cachedEntities = componentCache.get(componentType);
if (cachedEntities != null) {
cachedEntities.remove(entity);
}
});
entities.remove(entity);
}
@Override
public Set<Entity> resolve(final Query query) {
final Set<Class<? extends Component>> components = query.queryingComponents();
return switch (query.filter()) {
case ALL_OF -> resolveAllOf(components);
case ANY_OF -> resolveAnyOf(components);
case NONE_OF -> resolveNoneOf(components);
};
}
@Override
public void update(final T state, final Duration duration) {
systemExecutionOrder.forEach(system -> {
refreshComponentCache();
system.update(this, state, duration);
});
refreshComponentCache();
}
@SuppressWarnings("unchecked")
@Override
public <S extends System<T>> S getSystem(final Class<S> system) {
return (S) systems.get(system);
}
private void refreshComponentCache() {
componentCache.clear();
entities.forEach(entity -> entity.getComponentMap().keySet().forEach(
componentType -> componentCache.computeIfAbsent(componentType, _ -> new HashSet<>()).add(entity)));
}
private Set<Entity> resolveAllOf(final Set<Class<? extends Component>> components) {
if (components.isEmpty()) {
return Set.copyOf(entities);
}
final Class<? extends Component> firstType = components.iterator().next();
final Set<Entity> candidates = componentCache.get(firstType);
if (candidates == null) {
return Collections.emptySet();
}
return candidates.stream().filter(entity -> components.stream().allMatch(entity::has))
.collect(Collectors.toSet());
}
private Set<Entity> resolveAnyOf(final Set<Class<? extends Component>> components) {
if (components.isEmpty()) {
return Collections.emptySet();
}
return entities.stream().filter(entity -> components.stream().anyMatch(entity::has))
.collect(Collectors.toSet());
}
private Set<Entity> resolveNoneOf(final Set<Class<? extends Component>> components) {
if (components.isEmpty()) {
return Set.copyOf(entities);
}
return entities.stream().filter(entity -> components.stream().noneMatch(entity::has))
.collect(Collectors.toSet());
}
private List<System<T>> buildExecutionOrder(final Collection<System<T>> systems) {
if (systems.isEmpty()) {
return Collections.emptyList();
}
final Map<Class<?>, System<T>> systemMap = systems.stream()
.collect(Collectors.toMap(System::getClass, system -> system, (_, b) -> b, LinkedHashMap::new));
final Map<Class<?>, Integer> inDegree = new LinkedHashMap<>();
final Map<Class<?>, Set<Class<?>>> adjacencyList = new LinkedHashMap<>();
systems.forEach(system -> {
final Class<?> systemClass = system.getClass();
inDegree.put(systemClass, 0);
adjacencyList.put(systemClass, new HashSet<>());
});
systems.forEach(system -> {
system.getDependencies().forEach(dependency -> {
if (systemMap.containsKey(dependency)) {
adjacencyList.get(dependency).add(system.getClass());
inDegree.merge(system.getClass(), 1, Integer::sum);
}
});
});
// Kahn's algorithm
final List<System<T>> result = new ArrayList<>();
final Queue<Class<?>> queue = new LinkedList<>(
inDegree.entrySet().stream().filter(entry -> entry.getValue() == 0).map(Map.Entry::getKey).toList());
while (!queue.isEmpty()) {
final Class<?> currentClass = queue.poll();
result.add(systemMap.get(currentClass));
adjacencyList.getOrDefault(currentClass, Collections.emptySet()).forEach(dependent -> {
final int newInDegree = inDegree.get(dependent) - 1;
inDegree.put(dependent, newInDegree);
if (newInDegree == 0) {
queue.add(dependent);
}
});
}
if (result.size() != systems.size()) {
throw new IllegalStateException("Circular dependency detected in systems");
}
return Collections.unmodifiableList(result);
}
@Override
public void dispose() {
for (final System<T> system : systemExecutionOrder) {
system.dispose();
}
componentCache.clear();
entities.clear();
}
@SuppressWarnings("unchecked")
private static <T> Map<Class<? extends T>, T> singletonClazzMap(final T... singletons) {
final boolean areSingletons = Arrays.stream(singletons).map(t -> (Class<? extends System<T>>) t.getClass())
.distinct().count() == singletons.length;
if (!areSingletons) {
throw new IllegalArgumentException("Only one instance may be used per clazz");
}
return Arrays.stream(singletons).map(t -> Map.entry((Class<? extends T>) t.getClass(), t))
.collect(Collectors.toMap(Map.Entry::getKey, Map.Entry::getValue));
}
}
|
