aboutsummaryrefslogtreecommitdiff
path: root/api/src/main/java/me/shedaniel/rei/server/RecipeFinder.java
diff options
context:
space:
mode:
Diffstat (limited to 'api/src/main/java/me/shedaniel/rei/server/RecipeFinder.java')
-rw-r--r--api/src/main/java/me/shedaniel/rei/server/RecipeFinder.java341
1 files changed, 341 insertions, 0 deletions
diff --git a/api/src/main/java/me/shedaniel/rei/server/RecipeFinder.java b/api/src/main/java/me/shedaniel/rei/server/RecipeFinder.java
new file mode 100644
index 000000000..5fa12c775
--- /dev/null
+++ b/api/src/main/java/me/shedaniel/rei/server/RecipeFinder.java
@@ -0,0 +1,341 @@
+/*
+ * 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 com.google.common.collect.Lists;
+import it.unimi.dsi.fastutil.ints.*;
+import net.minecraft.core.NonNullList;
+import net.minecraft.core.Registry;
+import net.minecraft.world.item.Item;
+import net.minecraft.world.item.ItemStack;
+import net.minecraft.world.item.crafting.Ingredient;
+import org.jetbrains.annotations.ApiStatus;
+import org.jetbrains.annotations.Nullable;
+
+import java.util.ArrayList;
+import java.util.BitSet;
+import java.util.List;
+
+@ApiStatus.Internal
+public class RecipeFinder {
+ public final Int2IntMap idToAmountMap = new Int2IntOpenHashMap();
+
+ public static int getItemId(ItemStack itemStack_1) {
+ return Registry.ITEM.getId(itemStack_1.getItem());
+ }
+
+ public static ItemStack getStackFromId(int int_1) {
+ return int_1 == 0 ? ItemStack.EMPTY : new ItemStack(Item.byId(int_1));
+ }
+
+ public void addNormalItem(ItemStack itemStack_1) {
+ if (!itemStack_1.isDamaged() && !itemStack_1.isEnchanted() && !itemStack_1.hasCustomHoverName()) {
+ this.addItem(itemStack_1);
+ }
+
+ }
+
+ public void addItem(ItemStack itemStack_1) {
+ this.addItem(itemStack_1, 64);
+ }
+
+ public void addItem(ItemStack itemStack_1, int int_1) {
+ if (!itemStack_1.isEmpty()) {
+ int itemId = getItemId(itemStack_1);
+ int itemCount = Math.min(int_1, itemStack_1.getCount());
+ this.addItem(itemId, itemCount);
+ }
+
+ }
+
+ public boolean contains(int itemId) {
+ return this.idToAmountMap.get(itemId) > 0;
+ }
+
+ /**
+ * Takes an amount from the finder
+ *
+ * @return the amount taken
+ */
+ public int take(int itemId, int amount) {
+ int mapAmount = this.idToAmountMap.get(itemId);
+ if (mapAmount >= amount) {
+ this.idToAmountMap.put(itemId, mapAmount - amount);
+ return itemId;
+ } else {
+ return 0;
+ }
+ }
+
+ private void addItem(int itemId, int itemCount) {
+ this.idToAmountMap.put(itemId, this.idToAmountMap.get(itemId) + itemCount);
+ }
+
+ public boolean findRecipe(NonNullList<Ingredient> ingredients, @Nullable IntList intList_1) {
+ return this.findRecipe(ingredients, intList_1, 1);
+ }
+
+ public boolean findRecipe(NonNullList<Ingredient> ingredients, @Nullable IntList intList_1, int int_1) {
+ return (new RecipeFinder.Filter(ingredients)).find(int_1, intList_1);
+ }
+
+ public int countRecipeCrafts(NonNullList<Ingredient> ingredients, @Nullable IntList intList_1) {
+ return this.countRecipeCrafts(ingredients, Integer.MAX_VALUE, intList_1);
+ }
+
+ public int countRecipeCrafts(NonNullList<Ingredient> ingredients, int int_1, @Nullable IntList intList_1) {
+ return (new RecipeFinder.Filter(ingredients)).countCrafts(int_1, intList_1);
+ }
+
+ public void clear() {
+ this.idToAmountMap.clear();
+ }
+
+ class Filter {
+ private final List<Ingredient> ingredients = Lists.newArrayList();
+ private final int ingredientCount;
+ private final int[] usableIngredientItemIds;
+ private final int usableIngredientSize;
+ private final BitSet bitSet;
+ private final IntList field_7557 = new IntArrayList();
+ private final NonNullList<Ingredient> ingredientsInput;
+
+ public Filter(NonNullList<Ingredient> ingredientsInput) {
+ this.ingredientsInput = ingredientsInput;
+ this.ingredients.addAll(new ArrayList<>(ingredientsInput));
+ this.ingredients.removeIf(Ingredient::isEmpty);
+ this.ingredientCount = this.ingredients.size();
+ this.usableIngredientItemIds = this.getUsableIngredientItemIds();
+ this.usableIngredientSize = this.usableIngredientItemIds.length;
+ this.bitSet = new BitSet(this.ingredientCount + this.usableIngredientSize + this.ingredientCount + this.ingredientCount * this.usableIngredientSize);
+
+ for (int ingredientIndex = 0; ingredientIndex < this.ingredients.size(); ++ingredientIndex) {
+ IntList possibleStacks = this.ingredients.get(ingredientIndex).getStackingIds();
+
+ // Loops over usable ingredients
+ for (int usableIngredientIndex = 0; usableIngredientIndex < this.usableIngredientSize; ++usableIngredientIndex) {
+ if (possibleStacks.contains(this.usableIngredientItemIds[usableIngredientIndex])) {
+ this.bitSet.set(this.method_7420(true, usableIngredientIndex, ingredientIndex));
+ }
+ }
+ }
+
+ }
+
+ @SuppressWarnings("deprecation")
+ public boolean find(int int_1, @Nullable IntList intList_1) {
+ if (int_1 <= 0) {
+ return true;
+ } else {
+ int int_2;
+ for (int_2 = 0; this.method_7423(int_1); ++int_2) {
+ RecipeFinder.this.take(this.usableIngredientItemIds[this.field_7557.getInt(0)], int_1);
+ int int_3 = this.field_7557.size() - 1;
+ this.method_7421(this.field_7557.getInt(int_3));
+
+ for (int int_4 = 0; int_4 < int_3; ++int_4) {
+ this.method_7414((int_4 & 1) == 0, this.field_7557.get(int_4), this.field_7557.get(int_4 + 1));
+ }
+
+ this.field_7557.clear();
+ this.bitSet.clear(0, this.ingredientCount + this.usableIngredientSize);
+ }
+
+ boolean boolean_1 = int_2 == this.ingredientCount;
+ boolean boolean_2 = boolean_1 && intList_1 != null;
+ if (boolean_2) {
+ intList_1.clear();
+ }
+
+ this.bitSet.clear(0, this.ingredientCount + this.usableIngredientSize + this.ingredientCount);
+ int int_5 = 0;
+ List<Ingredient> list_1 = new ArrayList<>(ingredientsInput);
+
+ for (Ingredient ingredient : list_1) {
+ if (boolean_2 && ingredient.isEmpty()) {
+ intList_1.add(0);
+ } else {
+ for (int int_7 = 0; int_7 < this.usableIngredientSize; ++int_7) {
+ if (this.method_7425(false, int_5, int_7)) {
+ this.method_7414(true, int_7, int_5);
+ RecipeFinder.this.addItem(this.usableIngredientItemIds[int_7], int_1);
+ if (boolean_2) {
+ intList_1.add(this.usableIngredientItemIds[int_7]);
+ }
+ }
+ }
+
+ ++int_5;
+ }
+ }
+
+ return boolean_1;
+ }
+ }
+
+ private int[] getUsableIngredientItemIds() {
+ IntCollection intCollection_1 = new IntAVLTreeSet();
+
+ for (Ingredient ingredient_1 : this.ingredients) {
+ intCollection_1.addAll(ingredient_1.getStackingIds());
+ }
+
+ IntIterator intIterator_1 = intCollection_1.iterator();
+
+ while (intIterator_1.hasNext()) {
+ if (!RecipeFinder.this.contains(intIterator_1.nextInt())) {
+ intIterator_1.remove();
+ }
+ }
+
+ return intCollection_1.toIntArray();
+ }
+
+ private boolean method_7423(int int_1) {
+ int usableIngredientSize = this.usableIngredientSize;
+
+ for (int int_3 = 0; int_3 < usableIngredientSize; ++int_3) {
+ if (RecipeFinder.this.idToAmountMap.get(this.usableIngredientItemIds[int_3]) >= int_1) {
+ this.method_7413(false, int_3);
+
+ while (!this.field_7557.isEmpty()) {
+ int int_4 = this.field_7557.size();
+ boolean boolean_1 = (int_4 & 1) == 1;
+ int int_5 = this.field_7557.getInt(int_4 - 1);
+ if (!boolean_1 && !this.method_7416(int_5)) {
+ break;
+ }
+
+ int int_6 = boolean_1 ? this.ingredientCount : usableIngredientSize;
+
+ int int_8;
+ for (int_8 = 0; int_8 < int_6; ++int_8) {
+ if (!this.method_7426(boolean_1, int_8) && this.method_7418(boolean_1, int_5, int_8) && this.method_7425(boolean_1, int_5, int_8)) {
+ this.method_7413(boolean_1, int_8);
+ break;
+ }
+ }
+
+ int_8 = this.field_7557.size();
+ if (int_8 == int_4) {
+ this.field_7557.removeInt(int_8 - 1);
+ }
+ }
+
+ if (!this.field_7557.isEmpty()) {
+ return true;
+ }
+ }
+ }
+
+ return false;
+ }
+
+ private boolean method_7416(int int_1) {
+ return this.bitSet.get(this.method_7419(int_1));
+ }
+
+ private void method_7421(int int_1) {
+ this.bitSet.set(this.method_7419(int_1));
+ }
+
+ private int method_7419(int int_1) {
+ return this.ingredientCount + this.usableIngredientSize + int_1;
+ }
+
+ private boolean method_7418(boolean boolean_1, int int_1, int int_2) {
+ return this.bitSet.get(this.method_7420(boolean_1, int_1, int_2));
+ }
+
+ private boolean method_7425(boolean boolean_1, int int_1, int int_2) {
+ return boolean_1 != this.bitSet.get(1 + this.method_7420(boolean_1, int_1, int_2));
+ }
+
+ private void method_7414(boolean boolean_1, int int_1, int int_2) {
+ this.bitSet.flip(1 + this.method_7420(boolean_1, int_1, int_2));
+ }
+
+ private int method_7420(boolean boolean_1, int int_1, int int_2) {
+ int int_3 = boolean_1 ? int_1 * this.ingredientCount + int_2 : int_2 * this.ingredientCount + int_1;
+ return this.ingredientCount + this.usableIngredientSize + this.ingredientCount + 2 * int_3;
+ }
+
+ private void method_7413(boolean boolean_1, int int_1) {
+ this.bitSet.set(this.method_7424(boolean_1, int_1));
+ this.field_7557.add(int_1);
+ }
+
+ private boolean method_7426(boolean boolean_1, int int_1) {
+ return this.bitSet.get(this.method_7424(boolean_1, int_1));
+ }
+
+ private int method_7424(boolean boolean_1, int int_1) {
+ return (boolean_1 ? 0 : this.ingredientCount) + int_1;
+ }
+
+ public int countCrafts(int int_1, @Nullable IntList intList_1) {
+ int int_2 = 0;
+ int int_3 = Math.min(int_1, this.method_7415()) + 1;
+
+ while (true) {
+ while (true) {
+ int int_4 = (int_2 + int_3) / 2;
+ if (this.find(int_4, null)) {
+ if (int_3 - int_2 <= 1) {
+ if (int_4 > 0) {
+ this.find(int_4, intList_1);
+ }
+
+ return int_4;
+ }
+
+ int_2 = int_4;
+ } else {
+ int_3 = int_4;
+ }
+ }
+ }
+ }
+
+ @SuppressWarnings("deprecation")
+ private int method_7415() {
+ int int_1 = Integer.MAX_VALUE;
+
+ for (Ingredient ingredient_1 : this.ingredients) {
+ int int_2 = 0;
+
+ int int_3;
+ for (IntListIterator var5 = ingredient_1.getStackingIds().iterator(); var5.hasNext(); int_2 = Math.max(int_2, RecipeFinder.this.idToAmountMap.get(int_3))) {
+ int_3 = var5.next();
+ }
+
+ if (int_1 > 0) {
+ int_1 = Math.min(int_1, int_2);
+ }
+ }
+
+ return int_1;
+ }
+ }
+} \ No newline at end of file