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
|
package kekztech;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.UUID;
import net.minecraft.item.ItemStack;
import net.minecraft.tileentity.TileEntity;
import net.minecraft.world.World;
public class ItemDistributionNetworkController implements Comparable<ItemDistributionNetworkController> {
private static final HashSet<ItemDistributionNetworkController> instances = new HashSet<>();
private final UUID uuid = UUID.randomUUID();
private final LinkedList<IConduit> conduits = new LinkedList<>();
private final boolean[] slotDirections = new boolean[15];
private final ItemStack[] networkedItemStacks = new ItemStack[15];
//private final HashMap<String, IConduit> sources = new HashMap<>(); // k = resource name, v = source conduit
public ItemDistributionNetworkController() {
}
/**
* Places a new conduit as it's own network. Merges with adjacent networks automatically.
*
* @param conduit
* The conduit to be placed
*/
public static void placeConduit(IConduit conduit) {
conduit.setNetwork(new ItemDistributionNetworkController());
conduit.getNetwork().addConduit(conduit);
final TileEntity te = (TileEntity) conduit;
final int x = te.xCoord;
final int y = te.yCoord;
final int z = te.zCoord;
// Search for adjacent Networks on all six sides
final HashSet<ItemDistributionNetworkController> networks = new HashSet<>();
final World world = te.getWorldObj();
final TileEntity te1x = world.getTileEntity(x + 1, y, z);
final TileEntity te0x = world.getTileEntity(x - 1, y, z);
final TileEntity te1y = world.getTileEntity(x, y + 1, z);
final TileEntity te0y = world.getTileEntity(x, y - 1, z);
final TileEntity te1z = world.getTileEntity(x, y, z + 1);
final TileEntity te0z = world.getTileEntity(x, y, z - 1);
if(te1x != null && te1x instanceof IConduit) {
final IConduit c = (IConduit) te1x;
networks.add(c.getNetwork());
}
if(te0x != null && te0x instanceof IConduit) {
final IConduit c = (IConduit) te0x;
networks.add(c.getNetwork());
}
if(te1y != null && te1y instanceof IConduit) {
final IConduit c = (IConduit) te1y;
networks.add(c.getNetwork());
}
if(te0y != null && te0y instanceof IConduit) {
final IConduit c = (IConduit) te0y;
networks.add(c.getNetwork());
}
if(te1z != null && te1z instanceof IConduit) {
final IConduit c = (IConduit) te1z;
networks.add(c.getNetwork());
}
if(te0z != null && te0z instanceof IConduit) {
final IConduit c = (IConduit) te0z;
networks.add(c.getNetwork());
}
// Return prematurely if no adjacent network was found
if(networks.size() == 0) {
return;
}
// Sort networks by descending size
final LinkedList<ItemDistributionNetworkController> networkList = new LinkedList<>();
networkList.addAll(networks);
Collections.sort(networkList, Collections.reverseOrder());
// Larger networks consume smaller networks to reduce copying around data
while(networkList.size() > 1) {
final ItemDistributionNetworkController l = networkList.get(networkList.size() - 2);
final ItemDistributionNetworkController r = networkList.getLast();
l.appendNetwork(r);
networkList.removeLast();
}
}
/**
* Deletes this conduit and breaks up adjacent networks into separate networks.
*
* @param conduit
* Conduit to be removed.
*/
public static void destroyConduit(IConduit conduit) {
}
public void run() {
}
@Override
public boolean equals(Object o) {
if(o instanceof ItemDistributionNetworkController) {
final ItemDistributionNetworkController network = (ItemDistributionNetworkController) o;
return uuid.equals(network.getUUID());
} else {
return false;
}
}
@Override
public int compareTo(ItemDistributionNetworkController o) {
return (int) Math.signum(o.getSize() - this.getSize());
}
public UUID getUUID() {
return uuid;
}
public int getSize() {
return conduits.size();
}
/**
* Find out if this slot is designated as input and can accept an item into the network.
*
* Slots are numbered left to right, then top to bottom and start at zero.
* For example, the second slot in the second row, would have a slot number of five.
*
* @param slot:
* Slot number.
* @return whether this slot can accept input or not.
*/
public boolean isInputSlot(int slot) {
if(slot >= slotDirections.length) {
return false;
}
return slotDirections[slot];
}
/**
* Return the ItemStack that is contained in the given slot number.
*
* Slots are numbered left to right, then top to bottom and start at zero.
* For example, the second slot in the second row, would have a slot number of five.
*
* @param slot:
* Slot number.
* @return ItemStack at given slot number.
*/
public ItemStack getStackInSlot(int slot) {
if(slot >= networkedItemStacks.length) {
return null;
}
return networkedItemStacks[slot];
}
public void setStackInSlot(int slot, ItemStack itemStack) {
if(slot < networkedItemStacks.length && isInputSlot(slot)) {
networkedItemStacks[slot] = itemStack;
}
}
/**
* Register a new conduit to this network.
*
* @param conduit
* New conduit.
*/
private void addConduit(IConduit conduit) {
conduits.add(conduit);
}
/**
* Merge another network with this one if they have been connected by a new conduit.
*
* @param network
* Network to merge with this one.
*/
private void appendNetwork(ItemDistributionNetworkController network) {
}
private void updateSource() {
}
}
|
