From 5446859dee2d38faecc2b83c054e8f011f6e5a06 Mon Sep 17 00:00:00 2001
From: loic <git-account@loicguegan.fr>
Date: Thu, 22 Sep 2016 20:00:51 +0200
Subject: Begin javafx

---
 src/main/java/model/LineAlgorithm.java | 91 ++++++++++++++++++++++++++++++++++
 1 file changed, 91 insertions(+)
 create mode 100644 src/main/java/model/LineAlgorithm.java

(limited to 'src/main/java/model/LineAlgorithm.java')

diff --git a/src/main/java/model/LineAlgorithm.java b/src/main/java/model/LineAlgorithm.java
new file mode 100644
index 0000000..024db5c
--- /dev/null
+++ b/src/main/java/model/LineAlgorithm.java
@@ -0,0 +1,91 @@
+package model;
+
+/**
+ * Created by loic on 21/09/16.
+ */
+public class LineAlgorithm {
+
+
+
+    public static int[] mergeRight(int[] line){
+
+        line=gravityRight(line);
+
+        for(int i=(line.length-1);i>=0;i--){
+            if(i>0){
+                int a=line[i];
+                int b=line[i-1];
+                if(a==b && a!=-1){
+                    line[i]=a+b;
+                    line[i-1]=-1;
+                    i--;
+                }
+            }
+        }
+
+        line=gravityRight(line);
+
+        return line;
+    }
+
+
+    private static int[] gravityRight(int[] line){
+        for(int i=0;i<line.length;i++) {
+            for (int j = (line.length - 1); j >= 0; j--) {
+                int a = line[j];
+                if (j > 0) {
+                    int b = line[j - 1];
+                    if (a == -1) {
+                        line[j] = b;
+                        line[j - 1] = -1;
+                    }
+                }
+            }
+        }
+        return line;
+    }
+
+
+    public static int[] clearLine(int[] line){
+        for(int i=0;i<line.length;i++){
+            line[i]=-1;
+        }
+        return line;
+    }
+
+    public static int[] reverseLine(int[] line){
+        int[] reversedLine=new int[line.length];
+
+        int j=0;
+        for(int i=(line.length-1);i>=0;i--){
+            reversedLine[j]=line[i];
+            j++;
+        }
+
+        return reversedLine;
+    }
+
+    public static boolean linesIsEquals(int[] line1, int[] line2){
+        if(line1.length!=line2.length){
+            return false;
+        }
+        else {
+            for (int i=0;i<line1.length;i++){
+                if(line1[i]!=line2[i]){
+                    return false;
+                }
+            }
+        }
+        return true;
+
+    }
+
+    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----------");
+
+    }
+}
-- 
cgit v1.2.3