-
Notifications
You must be signed in to change notification settings - Fork 1.3k
/
BatchPropagator.java
255 lines (223 loc) · 9.16 KB
/
BatchPropagator.java
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
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
/*
* Copyright 2013 MovingBlocks
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.terasology.world.propagation;
import com.google.common.collect.Maps;
import com.google.common.collect.Sets;
import org.terasology.math.Region3i;
import org.terasology.math.Side;
import org.terasology.math.TeraMath;
import org.terasology.math.Vector3i;
import org.terasology.world.block.Block;
import org.terasology.world.chunks.Chunk;
import java.util.Arrays;
import java.util.Map;
import java.util.Set;
/**
* Batch propagator that works on a set of changed blocks
*
* @author Immortius
*/
public class BatchPropagator {
private static final byte NO_VALUE = 0;
private PropagationRules rules;
private PropagatorWorldView world;
private Set<Vector3i>[] reduceQueues;
private Set<Vector3i>[] increaseQueues;
private Map<Side, Vector3i> chunkEdgeDeltas = Maps.newEnumMap(Side.class);
public BatchPropagator(PropagationRules rules, PropagatorWorldView world) {
this.world = world;
this.rules = rules;
for (Side side : Side.values()) {
Vector3i delta = new Vector3i(side.getVector3i());
if (delta.x < 0) {
delta.x += Chunk.SIZE_X;
} else if (delta.x > 0) {
delta.x -= Chunk.SIZE_X;
}
if (delta.y < 0) {
delta.y += Chunk.SIZE_Y;
} else if (delta.y > 0) {
delta.y -= Chunk.SIZE_Y;
}
if (delta.z < 0) {
delta.z += Chunk.SIZE_Z;
} else if (delta.z > 0) {
delta.z -= Chunk.SIZE_Z;
}
chunkEdgeDeltas.put(side, delta);
}
increaseQueues = new Set[rules.getMaxValue()];
reduceQueues = new Set[rules.getMaxValue()];
for (int i = 0; i < rules.getMaxValue(); ++i) {
increaseQueues[i] = Sets.newLinkedHashSet();
reduceQueues[i] = Sets.newLinkedHashSet();
}
}
public void process(BlockChange... changes) {
process(Arrays.asList(changes));
}
public void process(Iterable<BlockChange> blockChanges) {
for (BlockChange blockChange : blockChanges) {
reviewChange(blockChange);
}
processReduction();
processIncrease();
cleanUp();
}
private void reviewChange(BlockChange blockChange) {
byte newValue = rules.getBlockValue(blockChange.getTo());
byte existingValue = world.getValueAt(blockChange.getPosition());
if (newValue > existingValue) {
increase(blockChange.getPosition(), newValue);
}
byte oldValue = rules.getBlockValue(blockChange.getFrom());
if (newValue < oldValue) {
reduce(blockChange.getPosition(), oldValue);
}
for (Side side : Side.values()) {
PropagationComparison comparison = rules.comparePropagation(blockChange.getTo(), blockChange.getFrom(), side);
if (comparison.isRestricting() && existingValue > 0) {
reduce(blockChange.getPosition(), existingValue);
Vector3i adjPos = side.getAdjacentPos(blockChange.getPosition());
byte adjValue = world.getValueAt(adjPos);
if (adjValue == rules.propagateValue(existingValue, side, blockChange.getFrom())) {
reduce(adjPos, adjValue);
}
} else if (comparison.isPermitting()) {
if (existingValue > 0) {
queueSpreadValue(blockChange.getPosition(), existingValue);
}
Vector3i adjPos = side.getAdjacentPos(blockChange.getPosition());
byte adjValue = world.getValueAt(adjPos);
if (adjValue != PropagatorWorldView.UNAVAILABLE) {
queueSpreadValue(adjPos, adjValue);
}
}
}
}
private void processReduction() {
int depth = 0;
while (depth < rules.getMaxValue()) {
byte oldValue = (byte) (rules.getMaxValue() - depth);
Set<Vector3i> toProcess = reduceQueues[depth];
reduceQueues[depth] = Sets.newLinkedHashSetWithExpectedSize(toProcess.size());
for (Vector3i pos : toProcess) {
purge(pos, oldValue);
}
if (reduceQueues[depth].isEmpty()) {
depth++;
}
}
}
private void purge(Vector3i pos, byte oldValue) {
Block block = world.getBlockAt(pos);
increaseQueues[rules.getMaxValue() - oldValue].remove(pos);
if (rules.getBlockValue(block) > 0) {
increase(pos, rules.getBlockValue(block));
} else {
world.setValueAt(pos, NO_VALUE);
}
for (Side side : Side.values()) {
byte expectedValue = rules.propagateValue(oldValue, side, block);
Vector3i adjPos = side.getAdjacentPos(pos);
if (rules.canSpreadOutOf(block, side)) {
byte adjValue = world.getValueAt(adjPos);
if (adjValue == expectedValue) {
Block adjBlock = world.getBlockAt(adjPos);
if (rules.canSpreadInto(adjBlock, side.reverse())) {
reduce(adjPos, expectedValue);
}
} else if (adjValue > 0) {
queueSpreadValue(adjPos, adjValue);
}
}
}
}
private void processIncrease() {
int depth = 0;
while (depth < rules.getMaxValue() - 1) {
byte value = (byte) (rules.getMaxValue() - depth);
Set<Vector3i> toProcess = increaseQueues[depth];
increaseQueues[depth] = Sets.newLinkedHashSetWithExpectedSize(toProcess.size());
for (Vector3i pos : toProcess) {
push(pos, value);
}
if (increaseQueues[depth].isEmpty()) {
depth++;
}
}
}
private void push(Vector3i pos, byte value) {
Block block = world.getBlockAt(pos);
for (Side side : Side.values()) {
byte spreadValue = rules.propagateValue(value, side, block);
Vector3i adjPos = side.getAdjacentPos(pos);
if (rules.canSpreadOutOf(block, side)) {
byte adjValue = world.getValueAt(adjPos);
if (adjValue < spreadValue && adjValue != PropagatorWorldView.UNAVAILABLE) {
Block adjBlock = world.getBlockAt(adjPos);
if (rules.canSpreadInto(adjBlock, side.reverse())) {
increase(adjPos, spreadValue);
}
}
}
}
}
private void cleanUp() {
for (Set<Vector3i> queue : increaseQueues) {
queue.clear();
}
}
private void increase(Vector3i position, byte value) {
world.setValueAt(position, value);
queueSpreadValue(position, value);
}
private void queueSpreadValue(Vector3i position, byte value) {
if (value > 1) {
increaseQueues[rules.getMaxValue() - value].add(position);
}
}
private void reduce(Vector3i position, byte oldValue) {
if (oldValue > 0) {
reduceQueues[rules.getMaxValue() - oldValue].add(position);
}
}
public void propagateBetween(Chunk chunk, Chunk adjChunk, Side side) {
Region3i edgeRegion = TeraMath.getEdgeRegion(Region3i.createFromMinAndSize(Vector3i.zero(), Chunk.CHUNK_SIZE), side);
Vector3i adjPos = new Vector3i();
for (Vector3i pos : edgeRegion) {
adjPos.set(pos);
adjPos.add(chunkEdgeDeltas.get(side));
Block block = chunk.getBlock(pos);
byte value = rules.getValue(chunk, pos);
Block adjBlock = adjChunk.getBlock(adjPos);
byte adjValue = rules.getValue(adjChunk, adjPos);
byte expectedAdjValue = rules.propagateValue(value, side, block);
if (rules.canSpreadOutOf(block, side) && rules.canSpreadInto(adjBlock, side.reverse()) && adjValue < expectedAdjValue) {
rules.setValue(adjChunk, adjPos, expectedAdjValue);
queueSpreadValue(adjChunk.getBlockWorldPos(adjPos), expectedAdjValue);
}
byte expectedValue = rules.propagateValue(adjValue, side.reverse(), adjBlock);
if (rules.canSpreadInto(block, side) && rules.canSpreadOutOf(adjBlock, side.reverse()) && value < expectedValue) {
rules.setValue(chunk, pos, expectedValue);
queueSpreadValue(chunk.getBlockWorldPos(pos), expectedValue);
}
}
}
public void propagateFrom(Vector3i pos, Block block) {
queueSpreadValue(pos, rules.getBlockValue(block));
}
}