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
|
/*
* This file is licensed under the MIT License, part of Roughly Enough Items.
* Copyright (c) 2018, 2019, 2020 shedaniel
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
package me.shedaniel.rei.server;
import it.unimi.dsi.fastutil.ints.IntArrayList;
import it.unimi.dsi.fastutil.ints.IntList;
import net.minecraft.container.Container;
import net.minecraft.entity.player.PlayerEntity;
import net.minecraft.inventory.Inventory;
import net.minecraft.item.Item;
import net.minecraft.item.ItemStack;
import net.minecraft.recipe.Ingredient;
import net.minecraft.server.network.ServerPlayerEntity;
import net.minecraft.util.Identifier;
import net.minecraft.util.collection.DefaultedList;
import java.util.*;
public class InputSlotCrafter<C extends Inventory> implements RecipeGridAligner<Integer>, ContainerContext {
protected Container container;
protected ContainerInfo containerInfo;
private List<StackAccessor> gridStacks;
private List<StackAccessor> inventoryStacks;
private ServerPlayerEntity player;
private InputSlotCrafter(Container container, ContainerInfo<? extends Container> containerInfo) {
this.container = container;
this.containerInfo = containerInfo;
}
public static <C extends Inventory> void start(Identifier category, Container craftingContainer_1, ServerPlayerEntity player, Map<Integer, List<ItemStack>> map, boolean hasShift) {
ContainerInfo<? extends Container> containerInfo = Objects.requireNonNull(ContainerInfoHandler.getContainerInfo(category, craftingContainer_1.getClass()), "Container Info does not exist on the server!");
new InputSlotCrafter<C>(craftingContainer_1, containerInfo).fillInputSlots(player, map, hasShift);
}
private void fillInputSlots(ServerPlayerEntity player, Map<Integer, List<ItemStack>> map, boolean hasShift) {
this.player = player;
this.inventoryStacks = this.containerInfo.getInventoryStacks(this);
this.gridStacks = this.containerInfo.getGridStacks(this);
player.skipPacketSlotUpdates = true;
// Return the already placed items on the grid
this.returnInputs();
RecipeFinder recipeFinder = new RecipeFinder();
this.containerInfo.getRecipeFinderPopulator().populate(this).accept(recipeFinder);
DefaultedList<Ingredient> ingredients = DefaultedList.of();
map.entrySet().stream().sorted(Comparator.comparingInt(Map.Entry::getKey)).forEach(entry -> {
ingredients.add(Ingredient.ofItems(entry.getValue().stream().map(ItemStack::getItem).toArray(Item[]::new)));
});
if (recipeFinder.findRecipe(ingredients, null)) {
this.fillInputSlots(recipeFinder, ingredients, hasShift);
} else {
this.returnInputs();
player.skipPacketSlotUpdates = false;
this.containerInfo.markDirty(this);
throw new NotEnoughMaterialsException();
}
player.skipPacketSlotUpdates = false;
this.containerInfo.markDirty(this);
}
@Override
public void acceptAlignedInput(Iterator<Integer> iterator_1, StackAccessor gridSlot, int craftsAmount) {
ItemStack toBeTakenStack = RecipeFinder.getStackFromId(iterator_1.next());
if (!toBeTakenStack.isEmpty()) {
for (int i = 0; i < craftsAmount; ++i) {
this.fillInputSlot(gridSlot, toBeTakenStack);
}
}
}
protected void fillInputSlot(StackAccessor slot, ItemStack toBeTakenStack) {
int takenSlotIndex = this.method_7371(toBeTakenStack);
if (takenSlotIndex != -1) {
ItemStack takenStack = this.inventoryStacks.get(takenSlotIndex).getItemStack().copy();
if (!takenStack.isEmpty()) {
if (takenStack.getCount() > 1) {
this.inventoryStacks.get(takenSlotIndex).takeStack(1);
} else {
this.inventoryStacks.get(takenSlotIndex).setItemStack(ItemStack.EMPTY);
}
takenStack.setCount(1);
if (!slot.canPlace(takenStack)) {
return;
}
if (slot.getItemStack().isEmpty()) {
slot.setItemStack(takenStack);
} else {
slot.getItemStack().increment(1);
}
}
}
}
protected void fillInputSlots(RecipeFinder recipeFinder, DefaultedList<Ingredient> ingredients, boolean hasShift) {
int recipeCrafts = recipeFinder.countRecipeCrafts(ingredients, null);
int amountToFill = this.getAmountToFill(hasShift, recipeCrafts, false);
IntList intList_1 = new IntArrayList();
if (recipeFinder.findRecipe(ingredients, intList_1, amountToFill)) {
int finalCraftsAmount = amountToFill;
for (int itemId : intList_1) {
finalCraftsAmount = Math.min(finalCraftsAmount, RecipeFinder.getStackFromId(itemId).getMaxCount());
}
if (recipeFinder.findRecipe(ingredients, intList_1, finalCraftsAmount)) {
this.returnInputs();
this.alignRecipeToGrid(gridStacks, intList_1.iterator(), finalCraftsAmount);
}
}
}
protected int getAmountToFill(boolean hasShift, int recipeCrafts, boolean boolean_2) {
int amountToFill = 1;
if (hasShift) {
amountToFill = recipeCrafts;
} else if (boolean_2) {
amountToFill = 64;
for (StackAccessor stackAccessor : gridStacks) {
ItemStack itemStack = stackAccessor.getItemStack();
if (!itemStack.isEmpty() && amountToFill > itemStack.getCount()) {
amountToFill = itemStack.getCount();
}
}
if (amountToFill < 64) {
++amountToFill;
}
}
return amountToFill;
}
protected void returnInputs() {
this.containerInfo.getGridCleanHandler().clean(this);
}
public int method_7371(ItemStack itemStack) {
boolean rejectedModification = false;
for (int i = 0; i < inventoryStacks.size(); i++) {
ItemStack itemStack1 = this.inventoryStacks.get(i).getItemStack();
if (!itemStack1.isEmpty() && areItemsEqual(itemStack, itemStack1) && !itemStack1.isDamaged() && !itemStack1.hasEnchantments() && !itemStack1.hasCustomName()) {
if (!this.inventoryStacks.get(i).allowModification(player)) {
rejectedModification = true;
} else {
return i;
}
}
}
if (rejectedModification) {
throw new IllegalStateException("Unable to take item from inventory due to slot not allowing modification! Item requested: " + itemStack);
}
return -1;
}
private static boolean areItemsEqual(ItemStack stack1, ItemStack stack2) {
return stack1.getItem() == stack2.getItem() && ItemStack.areTagsEqual(stack1, stack2);
}
private int getFreeInventorySlots() {
int int_1 = 0;
for (StackAccessor inventoryStack : inventoryStacks) {
if (inventoryStack.getItemStack().isEmpty()) {
++int_1;
}
}
return int_1;
}
@Override
public Container getContainer() {
return container;
}
@Override
public PlayerEntity getPlayerEntity() {
return player;
}
@Override
public ContainerInfo getContainerInfo() {
return containerInfo;
}
public static class NotEnoughMaterialsException extends RuntimeException {}
}
|
