external-repos/forge
1
0
Fork 0
mirror of https://github.com/Card-Forge/forge.git synced 2025-11-19 04:08:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

Few impros for performance in itempool countAll

Browse Source 
This implementation leverages on iterables.filter to filter all keys matching the input condition, which will be iterated for counting.
This commit is contained in:
leriomaggio
2021-08-27 20:05:12 +01:00
parent 7a7b23e593
commit b413b777bf
2 changed files with 15 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
forge-core/src/main/java/forge/util/ItemPool.java
View File

@@ -30,6 +30,7 @@ import java.util.concurrent.ConcurrentHashMap;
import com.google.common.base.Function;
import com.google.common.base.Predicate;
import com.google.common.collect.Iterables;
import forge.item.InventoryItem;
/**
@@ -149,12 +150,14 @@ public class ItemPool<T extends InventoryItem> implements Iterable<Entry<T, Inte
@SuppressWarnings("unchecked")
public final <U extends InventoryItem> int countAll(Predicate<U> condition, Class<U> cls) {
int count = 0;
for (Entry<T, Integer> e : this) {
T item = e.getKey();
if (cls.isInstance(item) && condition.apply((U)item)) {
count += e.getValue();
Iterable<T> matchingKeys = Iterables.filter(this.items.keySet(), new Predicate<T>() {
@Override
public boolean apply(T item) {
return cls.isInstance(item) && condition.apply((U)item);
}
}
});
for (T key : matchingKeys)
count += this.items.get(key);
return count;
}