aboutsummaryrefslogtreecommitdiff
path: root/src/main/java/me/shedaniel/rei/utils/CollectionUtils.java
diff options
context:
space:
mode:
Diffstat (limited to 'src/main/java/me/shedaniel/rei/utils/CollectionUtils.java')
-rw-r--r--src/main/java/me/shedaniel/rei/utils/CollectionUtils.java285
1 files changed, 0 insertions, 285 deletions
diff --git a/src/main/java/me/shedaniel/rei/utils/CollectionUtils.java b/src/main/java/me/shedaniel/rei/utils/CollectionUtils.java
deleted file mode 100644
index 33f8ef457..000000000
--- a/src/main/java/me/shedaniel/rei/utils/CollectionUtils.java
+++ /dev/null
@@ -1,285 +0,0 @@
-/*
- * 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.utils;
-
-import com.google.common.collect.Lists;
-import com.google.common.collect.Sets;
-import me.shedaniel.rei.api.EntryStack;
-import net.fabricmc.api.EnvType;
-import net.fabricmc.api.Environment;
-
-import java.util.*;
-import java.util.function.Function;
-import java.util.function.Predicate;
-import java.util.function.Supplier;
-import java.util.stream.Collectors;
-
-public class CollectionUtils {
- public static <A, B> List<B> getOrPutEmptyList(Map<A, List<B>> map, A key) {
- List<B> b = map.get(key);
- if (b != null)
- return b;
- map.put(key, Lists.newArrayList());
- return map.get(key);
- }
-
- public static <T> T findFirstOrNullEquals(List<T> list, T obj) {
- for (T t : list) {
- if (t.equals(obj))
- return t;
- }
- return null;
- }
-
- public static <T, R> List<R> castAndMap(List<T> list, Class<R> castClass) {
- List<R> l = new ArrayList<>();
- for (T t : list) {
- if (castClass.isAssignableFrom(t.getClass()))
- l.add((R) t);
- }
- return l;
- }
-
- public static <T> T findFirstOrNull(List<T> list, Predicate<T> predicate) {
- for (T t : list) {
- if (predicate.test(t))
- return t;
- }
- return null;
- }
-
- public static <T> boolean anyMatch(List<T> list, Predicate<T> predicate) {
- for (T t : list) {
- if (predicate.test(t))
- return true;
- }
- return false;
- }
-
- @Environment(EnvType.CLIENT)
- public static boolean anyMatchEqualsAll(List<EntryStack> list, EntryStack stack) {
- for (EntryStack t : list) {
- if (t.equalsAll(stack))
- return true;
- }
- return false;
- }
-
- @Environment(EnvType.CLIENT)
- public static boolean anyMatchEqualsEntryIgnoreAmount(List<EntryStack> list, EntryStack stack) {
- for (EntryStack t : list) {
- if (t.equalsIgnoreAmount(stack))
- return true;
- }
- return false;
- }
-
- @Environment(EnvType.CLIENT)
- public static EntryStack firstOrNullEqualsAll(List<EntryStack> list, EntryStack stack) {
- for (EntryStack t : list) {
- if (t.equalsAll(stack))
- return t;
- }
- return null;
- }
-
- @Environment(EnvType.CLIENT)
- public static EntryStack findFirstOrNullEqualsEntryIgnoreAmount(Collection<EntryStack> list, EntryStack stack) {
- for (EntryStack t : list) {
- if (t.equalsIgnoreAmount(stack))
- return t;
- }
- return null;
- }
-
- public static <T> List<T> filter(List<T> list, Predicate<T> predicate) {
- List<T> l = Lists.newArrayList();
- for (T t : list) {
- if (predicate.test(t)) {
- l.add(t);
- }
- }
- return l;
- }
-
- public static <T> Set<T> filter(Set<T> list, Predicate<T> predicate) {
- Set<T> l = Sets.newLinkedHashSet();
- for (T t : list) {
- if (predicate.test(t)) {
- l.add(t);
- }
- }
- return l;
- }
-
- public static <T> List<T> filterSetToList(Set<T> list, Predicate<T> predicate) {
- List<T> l = Lists.newArrayList();
- for (T t : list) {
- if (predicate.test(t)) {
- l.add(t);
- }
- }
- return l;
- }
-
- public static <T, R> List<R> map(List<T> list, Function<T, R> function) {
- List<R> l = new ArrayList<>(list.size() + 1);
- for (T t : list) {
- l.add(function.apply(t));
- }
- return l;
- }
-
- public static <T, R> List<R> map(Collection<T> list, Function<T, R> function) {
- List<R> l = new ArrayList<>(list.size() + 1);
- for (T t : list) {
- l.add(function.apply(t));
- }
- return l;
- }
-
- public static <T, R> List<R> mapParallel(Collection<T> list, Function<T, R> function) {
- return list.parallelStream().map(function).collect(Collectors.toList());
- }
-
- public static <T, R, C extends Collection<R>> C mapParallel(Collection<T> list, Function<T, R> function, Supplier<C> supplier) {
- return list.parallelStream().map(function).collect(Collectors.toCollection(supplier));
- }
-
- public static <T, R> List<R> map(T[] list, Function<T, R> function) {
- List<R> l = new ArrayList<>(list.length + 1);
- for (T t : list) {
- l.add(function.apply(t));
- }
- return l;
- }
-
- public static <T, R> Optional<R> mapAndMax(List<T> list, Function<T, R> function, Comparator<R> comparator) {
- if (list.isEmpty())
- return Optional.empty();
- List<R> copyOf = CollectionUtils.map(list, function);
- copyOf.sort(comparator);
- return Optional.ofNullable(copyOf.get(copyOf.size() - 1));
- }
-
- public static <T, R> Optional<R> mapAndMax(T[] list, Function<T, R> function, Comparator<R> comparator) {
- if (list.length <= 0)
- return Optional.empty();
- List<R> copyOf = CollectionUtils.map(list, function);
- copyOf.sort(comparator);
- return Optional.ofNullable(copyOf.get(copyOf.size() - 1));
- }
-
- public static <T> Optional<T> max(List<T> list, Comparator<T> comparator) {
- if (list.isEmpty())
- return Optional.empty();
- ArrayList<T> ts = new ArrayList<>(list);
- ts.sort(comparator);
- return Optional.ofNullable(ts.get(ts.size() - 1));
- }
-
- public static <T> Optional<T> max(T[] list, Comparator<T> comparator) {
- if (list.length <= 0)
- return Optional.empty();
- T[] copyOf = list.clone();
- Arrays.sort(copyOf, comparator);
- return Optional.ofNullable(copyOf[copyOf.length - 1]);
- }
-
- public static String joinToString(List<String> list, String separator) {
- StringJoiner joiner = new StringJoiner(separator);
- for (String t : list) {
- joiner.add(t);
- }
- return joiner.toString();
- }
-
- public static String joinToString(String[] list, String separator) {
- StringJoiner joiner = new StringJoiner(separator);
- for (String t : list) {
- joiner.add(t);
- }
- return joiner.toString();
- }
-
- public static <T> String mapAndJoinToString(List<T> list, Function<T, String> function, String separator) {
- StringJoiner joiner = new StringJoiner(separator);
- for (T t : list) {
- joiner.add(function.apply(t));
- }
- return joiner.toString();
- }
-
- public static <T> String mapAndJoinToString(T[] list, Function<T, String> function, String separator) {
- StringJoiner joiner = new StringJoiner(separator);
- for (T t : list) {
- joiner.add(function.apply(t));
- }
- return joiner.toString();
- }
-
- public static <T, R> List<R> filterAndMap(List<T> list, Predicate<T> predicate, Function<T, R> function) {
- List<R> l = null;
- for (T t : list) {
- if (predicate.test(t)) {
- if (l == null)
- l = Lists.newArrayList();
- l.add(function.apply(t));
- }
- }
- return l == null ? Collections.emptyList() : l;
- }
-
- public static <T> int sumInt(List<T> list, Function<T, Integer> function) {
- int sum = 0;
- for (T t : list) {
- sum += function.apply(t);
- }
- return sum;
- }
-
- public static <T> int sumInt(List<Integer> list) {
- int sum = 0;
- for (int t : list) {
- sum += t;
- }
- return sum;
- }
-
- public static <T> double sumDouble(List<T> list, Function<T, Double> function) {
- double sum = 0;
- for (T t : list) {
- sum += function.apply(t);
- }
- return sum;
- }
-
- public static <T> double sumDouble(List<Double> list) {
- double sum = 0;
- for (double t : list) {
- sum += t;
- }
- return sum;
- }
-}
generated by cgit (git 2.34.1) at 2026-06-22 09:57:08 +0000