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
|
/*
* 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.api;
import me.shedaniel.rei.RoughlyEnoughItemsCore;
import net.fabricmc.api.EnvType;
import net.fabricmc.api.Environment;
import net.minecraft.item.Item;
import net.minecraft.item.ItemStack;
import org.jetbrains.annotations.ApiStatus;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
import java.util.Arrays;
import java.util.Collection;
import java.util.List;
import java.util.function.Predicate;
import java.util.stream.Collectors;
import java.util.stream.Stream;
@Environment(EnvType.CLIENT)
public interface EntryRegistry {
/**
* @return the api instance of {@link me.shedaniel.rei.impl.EntryRegistryImpl}
*/
@NotNull
static EntryRegistry getInstance() {
return RoughlyEnoughItemsCore.getEntryRegistry();
}
/**
* Gets the current modifiable stacks list
*
* @return a stacks list
*/
@Deprecated
@ApiStatus.ScheduledForRemoval
@NotNull
default List<EntryStack> getStacksList() {
return getEntryStacks().collect(Collectors.toList());
}
@NotNull
Stream<EntryStack> getEntryStacks();
@NotNull
List<EntryStack> getPreFilteredList();
@ApiStatus.Experimental
void refilter();
@NotNull
List<ItemStack> appendStacksForItem(@NotNull Item item);
/**
* Gets all possible stacks from an item
*
* @param item the item to find
* @return the array of possible stacks
*/
@NotNull
ItemStack[] getAllStacksFromItem(@NotNull Item item);
default void registerEntry(@NotNull EntryStack stack) {
registerEntryAfter(null, stack);
}
/**
* Registers an new stack to the entry list
*
* @param afterEntry the stack to put after
* @param stack the stack to register
*/
void registerEntryAfter(@Nullable EntryStack afterEntry, @NotNull EntryStack stack);
/**
* Registers an new stack to the entry list
*
* @param afterEntry the stack to put after
* @param stack the stack to register
* @param checkAlreadyContains whether the list should check if it is already on the list
* @see #queueRegisterEntryAfter(EntryStack, Collection) for a faster method
*/
@Deprecated
@ApiStatus.ScheduledForRemoval
default void registerEntryAfter(@Nullable EntryStack afterEntry, @NotNull EntryStack stack, boolean checkAlreadyContains) {
registerEntryAfter(afterEntry, stack);
}
@Deprecated
@ApiStatus.ScheduledForRemoval
default void queueRegisterEntryAfter(@Nullable EntryStack afterEntry, @NotNull Collection<@NotNull ? extends EntryStack> stacks) {
registerEntriesAfter(afterEntry, stacks);
}
/**
* Registers multiple stacks to the item list
*
* @param afterStack the stack to put after
* @param stacks the stacks to register
*/
default void registerEntriesAfter(@Nullable EntryStack afterStack, @NotNull EntryStack... stacks) {
registerEntriesAfter(afterStack, Arrays.asList(stacks));
}
/**
* Registers multiple stacks to the item list
*
* @param afterStack the stack to put after
* @param stacks the stacks to register
*/
void registerEntriesAfter(@Nullable EntryStack afterStack, @NotNull Collection<@NotNull ? extends EntryStack> stacks);
/**
* Registers multiple stacks to the item list
*
* @param stacks the stacks to register
*/
default void registerEntries(@NotNull EntryStack... stacks) {
registerEntriesAfter(null, stacks);
}
/**
* Checks if a stack is already registered
*
* @param stack the stack to check
* @return whether the stack has been registered
*/
boolean alreadyContain(EntryStack stack);
@ApiStatus.Experimental
void removeEntry(EntryStack stack);
@ApiStatus.Experimental
void removeEntryIf(Predicate<EntryStack> stackPredicate);
}
|
