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

- Cleaned up the code I added recently to return a list of cards sharing the highest cmc. Thanks for the assistence Max!

Browse Source
This commit is contained in:
moomarc
2013-03-19 14:18:47 +00:00
parent 37126549cc
commit 9333d4fe4f
1 changed files with 10 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
src/main/java/forge/CardLists.java
View File

@@ -264,35 +264,20 @@ public class CardLists {
* Given a List<Card> cardList, return a List<Card> that are tied for having the highest CMC.
*
* @param cardList the Card List to be filtered.
* @return CardList the list of Cards sharing the highest CMC.
* @return the list of Cards sharing the highest CMC.
*/
public static List<Card> getCardsWithHighestCMC(Iterable<Card> cardList) {
final List<Card> tiedForHighest = new ArrayList<Card>();
int highest = 0;
for (final Card crd : cardList) {
if (crd.isSplitCard()) {
if (crd.getCMC(Card.SplitCMCMode.LeftSplitCMC) > highest) {
highest = crd.getCMC(Card.SplitCMCMode.LeftSplitCMC);
int curCmc = crd.isSplitCard() ? Math.max(crd.getCMC(Card.SplitCMCMode.LeftSplitCMC), crd.getCMC(Card.SplitCMCMode.RightSplitCMC)) : crd.getCMC();
if (curCmc > highest) {
highest = curCmc;
tiedForHighest.clear();
tiedForHighest.add(crd);
} else if (crd.getCMC(Card.SplitCMCMode.LeftSplitCMC) == highest && !tiedForHighest.contains(crd)) {
tiedForHighest.add(crd);
}
if (crd.getCMC(Card.SplitCMCMode.RightSplitCMC) > highest) {
highest = crd.getCMC(Card.SplitCMCMode.RightSplitCMC);
tiedForHighest.clear();
if (curCmc >= highest) {
tiedForHighest.add(crd);
} else if (crd.getCMC(Card.SplitCMCMode.RightSplitCMC) == highest && !tiedForHighest.contains(crd)) {
tiedForHighest.add(crd);
}
} else {
if (crd.getCMC() > highest) {
highest = crd.getCMC();
tiedForHighest.clear();
tiedForHighest.add(crd);
} else if (crd.getCMC() == highest && !tiedForHighest.contains(crd)) {
tiedForHighest.add(crd);
}
}
}
return tiedForHighest;