Files
NotEnoughItems/src/main/java/codechicken/nei/recipe/CatalystInfoList.java
T
miozune 6609911d96 Add a way to compare NBT leniently (#209)
* Fix itemstack comparator not handling NBT leniently
* add util function to PositionedStack
2022-02-07 12:12:26 -08:00

71 lines
2.1 KiB
Java

package codechicken.nei.recipe;
import codechicken.nei.NEIClientConfig;
import codechicken.nei.NEIServerUtils;
import com.google.common.collect.ForwardingList;
import net.minecraft.item.ItemStack;
import javax.annotation.Nonnull;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
// Do not directly extend ArrayList, see Effective Java Item 16
public class CatalystInfoList extends ForwardingList<CatalystInfo> {
private final String handlerID;
private final List<CatalystInfo> catalystInfoList = new ArrayList<>();
public CatalystInfoList(String handlerID) {
this.handlerID = handlerID;
}
public CatalystInfoList(String handlerID, CatalystInfo catalystInfo) {
this(handlerID);
add(catalystInfo);
}
@Override
protected List<CatalystInfo> delegate() {
return catalystInfoList;
}
@Override
public boolean add(@Nonnull CatalystInfo catalystInfo) {
if (contains(catalystInfo)) {
NEIClientConfig.logger.info(String.format("catalyst %s is already registered to handler %s", catalystInfo.getStack().getDisplayName(), handlerID));
return false;
}
super.add(catalystInfo);
return true;
}
@Override
public boolean contains(Object object) {
if (object instanceof CatalystInfo) {
ItemStack stack = ((CatalystInfo) object).getStack();
return contains(stack);
}
return false;
}
public boolean contains(ItemStack stack) {
return catalystInfoList.stream().anyMatch(c -> NEIServerUtils.areStacksSameTypeCraftingWithNBT(c.getStack(), stack));
}
public boolean remove(ItemStack stack) {
Iterator<CatalystInfo> iter = catalystInfoList.iterator();
while (iter.hasNext()) {
ItemStack next = iter.next().getStack();
if (NEIServerUtils.areStacksSameTypeCraftingWithNBT(next, stack)) {
iter.remove();
return true;
}
}
return false;
}
public void sort() {
super.sort((c1, c2) -> c2.getPriority() - c1.getPriority());
}
}