neocturne/JRummikub
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Fix Cyclomatic Complexity in classify (Qualtitätsmanagement rules!)

Browse source 
git-svn-id: svn://sunsvr01.isp.uni-luebeck.de/swproj13/trunk@243 72836036-5685-4462-b002-a69064685172
This commit is contained in:
Ida Massow 2011-05-16 21:02:58 +02:00
parent f7aace7234
commit 57227570fe
1 changed files with 1 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
src/jrummikub/model/StoneSet.java
View file

@ -78,12 +78,7 @@ public class StoneSet implements Iterable<Stone>, Sizeable {
if (nonJoker2 == -1) { if (nonJoker2 == -1) {
// Z first // Z first
if (nonJoker1 == 0 && stones.get(nonJoker1).getValue() < 12) { if (nonJoker1 == 0 && stones.get(nonJoker1).getValue() < 12) {
int origValue = stones.get(nonJoker1).getValue(); return new Pair<Type, Integer>(RUN, isValidRun(nonJoker1));
int value = 0;
for (int i = 0; i < stones.size(); i++) {
value += origValue + i;
}
return new Pair<Type, Integer>(RUN, value);
} else { } else {
int value = stones.get(nonJoker1).getValue() * stones.size(); int value = stones.get(nonJoker1).getValue() * stones.size();
return new Pair<Type, Integer>(GROUP, value); return new Pair<Type, Integer>(GROUP, value);