diff options
Diffstat (limited to 'src/main/java/model/LineAlgorithm.java')
| -rw-r--r-- | src/main/java/model/LineAlgorithm.java | 43 |
1 files changed, 30 insertions, 13 deletions
diff --git a/src/main/java/model/LineAlgorithm.java b/src/main/java/model/LineAlgorithm.java index 0d0364b..a15dd68 100644 --- a/src/main/java/model/LineAlgorithm.java +++ b/src/main/java/model/LineAlgorithm.java @@ -5,10 +5,13 @@ package model; */ public class LineAlgorithm { - - private int score=0; + /** + * Do a right move on the line + * @param line + * @return + */ public int[] mergeRight(int[] line){ line=gravityRight(line); @@ -31,7 +34,11 @@ public class LineAlgorithm { return line; } - + /** + * Push all entry to the right side + * @param line + * @return + */ private static int[] gravityRight(int[] line){ for(int i=0;i<line.length;i++) { for (int j = (line.length - 1); j >= 0; j--) { @@ -48,7 +55,11 @@ public class LineAlgorithm { return line; } - + /** + * Clear a line (all to -1) + * @param line + * @return + */ public static int[] clearLine(int[] line){ for(int i=0;i<line.length;i++){ line[i]=-1; @@ -56,6 +67,11 @@ public class LineAlgorithm { return line; } + /** + * Reverse the line passed in parameters + * @param line + * @return + */ public static int[] reverseLine(int[] line){ int[] reversedLine=new int[line.length]; @@ -68,6 +84,12 @@ public class LineAlgorithm { return reversedLine; } + /** + * Return true if two line are equals + * @param line1 + * @param line2 + * @return + */ public static boolean linesIsEquals(int[] line1, int[] line2){ if(line1.length!=line2.length){ return false; @@ -83,15 +105,10 @@ public class LineAlgorithm { } - public static void printLine(int[] line){ - System.out.println("----------"); - for(int i=0;i<line.length;i++){ - System.out.print(line[i]); - } - System.out.println("\n----------"); - - } - + /** + * Get the current score + * @return + */ public int getScore() { return score; } |
