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
|
/*
* Roughly Enough Items by Danielshe.
* Licensed under the MIT License.
*/
package me.shedaniel.rei.impl;
import com.google.common.collect.Lists;
import me.shedaniel.rei.api.EntryRegistry;
import me.shedaniel.rei.api.EntryStack;
import me.shedaniel.rei.api.annotations.Internal;
import net.minecraft.item.Item;
import net.minecraft.item.ItemStack;
import net.minecraft.util.DefaultedList;
import it.unimi.dsi.fastutil.Hash;
import it.unimi.dsi.fastutil.objects.ObjectOpenCustomHashSet;
import it.unimi.dsi.fastutil.objects.ObjectSets;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.List;
import java.util.Set;
import java.util.concurrent.CopyOnWriteArrayList;
@Deprecated
@Internal
public class EntryRegistryImpl implements EntryRegistry {
private final CopyOnWriteArrayList<EntryStack> entries = Lists.newCopyOnWriteArrayList();
private final Set<EntryStack> entrySet = ObjectSets.synchronize(new ObjectOpenCustomHashSet<>(new Hash.Strategy<EntryStack>() {
@Override
public int hashCode(EntryStack entry) {
return entry == null ? 0 : entry.hashOfAll();
}
@Override
public boolean equals(EntryStack a, EntryStack b) {
if (a == null || b == null) {
return a == b;
} else {
boolean result = a.equalsAll(b);
assert result == b.equalsAll(a) : "a.equalsAll(b) != b.equalsAll(a); (a = " + a + ", b = " + b + ")";
return result;
}
}
}));
@Override
public List<EntryStack> getStacksList() {
return entries;
}
@Override
public ItemStack[] getAllStacksFromItem(Item item) {
DefaultedList<ItemStack> list = DefaultedList.of();
list.add(item.getStackForRender());
item.appendStacks(item.getGroup(), list);
ItemStack[] array = list.toArray(new ItemStack[0]);
Arrays.sort(array, (a, b) -> ItemStack.areEqualIgnoreDamage(a, b) ? 0 : 1);
return array;
}
@Override
@Deprecated
public void registerEntryAfter(EntryStack afterEntry, EntryStack stack, boolean checkAlreadyContains) {
if (stack.isEmpty()) return;
boolean isNew = entrySet.add(stack);
if (checkAlreadyContains && !isNew) {
return;
}
if (afterEntry == null) {
entries.add(stack);
} else {
int last = entries.size();
for (int i = 0; i < entries.size(); i++)
if (entries.get(i).equalsAll(afterEntry))
last = i + 1;
entries.add(last, stack);
}
}
@Override
public void registerEntriesAfter(EntryStack afterStack, Collection<? extends EntryStack> stacks) {
List<EntryStack> nonDuplicates = new ArrayList<>();
for (EntryStack stack : stacks) {
if (entrySet.add(stack)) {
nonDuplicates.add(stack);
}
}
int index = entries.size();
if (afterStack != null) {
for (int i = index - 1; i >= 0; i--) {
if (entries.get(i).equalsAll(afterStack)) {
index = i + 1;
break;
}
}
}
entries.addAll(index, nonDuplicates);
}
@Override
public void registerEntriesAfter(EntryStack afterStack, EntryStack... stacks) {
registerEntriesAfter(afterStack, Arrays.asList(stacks));
}
}
|
