Merge pull request 'Set the matrix size of a new piece to its minimum size' (#45) from matrixMinimumSize into master

Reviewed-on: #45
Reviewed-by: Mat_02 <diletomatteo@gmail.com>

app/src/main/java/school_project/Piece.java

@@ -55,6 +55,8 @@ public class Piece extends Shape{
      */
     public void RotateRight(int times){
         while(times > 0) {
+            height = matrix.length;
+            width = matrix[0].length;
             boolean[][] temp_matrix = new boolean[width][height];
             for (int i = 0; i < width; i++) {
                 for (int j = 0; j < height; j++) {
@@ -70,9 +72,10 @@ public class Piece extends Shape{
     public boolean equals(Object obj) {
         if(obj instanceof Piece){
             Piece pieceObj = (Piece) obj;
-            if( pieceObj.getPosition().equals(this.getPosition()) && pieceObj.getShape().equals(getShape())) {
-                return true;
+            if (pieceObj.getPosition() != null && this.getPosition() != null){
+                return pieceObj.getPosition().equals(this.getPosition()) && pieceObj.getShape().equals(getShape());
             }
+            return pieceObj.getShape().equals(getShape());
         }
         return false;
     }

app/src/main/java/school_project/Shape.java

@@ -1,6 +1,8 @@
 package school_project;
 
 
+import school_project.Utils.Array;
+
 import java.io.Serializable;
 
 /**
@@ -21,14 +23,52 @@ public class Shape implements Serializable, Cloneable{
     }
 
     public void setShape(boolean[][] matrix) throws IllegalArgumentException{
-        height = matrix.length;
-        width = matrix[0].length;
 
         for (boolean[] row: matrix){
-            if(row.length != width){
+            if(row.length != matrix[0].length){
                 throw new IllegalArgumentException("The argument should be a square matrix");
             }
         }
+
+        for (int i = 0; i < matrix.length; i++) {
+            if(!Array.isRowOnlyFalse(matrix, i)) {
+                for (int j = 0; j < i; j++) {
+                    matrix = Array.MatrixRemoveRow(matrix, 0);
+                }
+                break;
+            }
+        }
+
+        for (int i = matrix.length-1; i >= 0; i--) {
+            if(!Array.isRowOnlyFalse(matrix, i)) {
+                for (int j = matrix.length-1; j > i; j--) {
+                    matrix = Array.MatrixRemoveRow(matrix, j);
+                }
+                break;
+            }
+        }
+
+        for (int i = 0; i < matrix[0].length; i++) {
+            if(!Array.isColumnOnlyFalse(matrix, i)) {
+                for (int j = 0; j < i; j++) {
+                    matrix = Array.MatrixRemoveColumn(matrix, 0);
+                }
+                break;
+            }
+        }
+
+        for (int i = matrix[0].length-1; i >= 0; i--){
+            if(!Array.isColumnOnlyFalse(matrix, i)) {
+                for (int j = matrix[0].length-1; j > i; j--) {
+                    matrix = Array.MatrixRemoveColumn(matrix, j);
+                }
+                break;
+            }
+        }
+
+        height = matrix.length;
+        width = matrix[0].length;
+
         this.matrix = matrix;
     }
 

app/src/main/java/school_project/Utils/Array.java

@@ -10,4 +10,52 @@ public class Array{
         }
         return ret;
     }
+
+    public static boolean[][] MatrixRemoveRow(boolean[][] o, int row){
+        boolean[][] newMatrix = new boolean[o.length - 1][o[0].length];
+        int newRow = 0;
+        for (int i = 0; i < o.length; i++) {
+            if(i == row)
+                i++;
+            if(i >= o.length)
+                continue;
+            newMatrix[newRow] = o[i];
+            newRow++;
+        }
+        return newMatrix;
+    }
+
+    public static boolean[][] MatrixRemoveColumn(boolean[][] o, int col){
+        boolean[][] newMatrix = new boolean[o.length][o[0].length - 1];
+        for (int i = 0; i < o.length; i++) {
+            int newCol = 0;
+            for(int j = 0; j < o[0].length; j++){
+                if(j == col)
+                    j++;
+                if(j >= o[0].length)
+                    continue;
+                newMatrix[i][newCol] = o[i][j];
+                newCol++;
+            }
+        }
+        return newMatrix;
+    }
+
+    public static boolean isRowOnlyFalse(boolean[][] o, int row){
+        boolean mark = true;
+        for (int i = 0; i < o[row].length; i++) {
+            if(o[row][i])
+                mark = false;
+        }
+        return mark;
+    }
+
+    public static boolean isColumnOnlyFalse(boolean[][] o, int column){
+        boolean mark = true;
+        for (int i = 0; i < o.length; i++) {
+            if(o[i][column])
+                mark = false;
+        }
+        return mark;
+    }
 }