Generate all available steps

Author: seajer

src/main/java/com/google/hashcode/entity/Pizza.java

@@ -55,5 +55,9 @@ public String toString() {
                 //TODO fix human readable output   "\n" + IoUtils.convertToHumanReadableTable(cells) +
                 "\n" + sliceInstruction.toString();
     }
-
+    
+    public boolean cotnainsAllCells(Slice slice){
+    	return slice.cells.stream().allMatch(cell->this.cells.contains(cell));
+    }
+    		
 }

src/main/java/com/google/hashcode/entity/Slice.java

@@ -79,6 +79,54 @@ public boolean isValid(Pizza pizza) {
                 "\npassed validation: " + isPassedSliceInstructions);
         return isPassedSliceInstructions;
     }
+    
+    public Slice generateAbowe(Slice slice){
+    	List<Cell> cells = new ArrayList<Cell>();
+		int maxX = slice.maxX();
+		int minX = slice.minX();
+		int minY = slice.minY();
+		for(int i = minX; i <= maxX; i++){
+			Cell cell = new Cell(minY-1, i, null);
+			cells.add(cell);
+		}
+    	return new Slice(cells);
+    }
+    
+    public Slice generateBelow(Slice slice){
+    	List<Cell> cells = new ArrayList<Cell>();
+		int maxX = slice.maxX();
+		int minX = slice.minX();
+		int maxY = slice.maxY();
+		for(int i = minX; i <= maxX; i++){
+			Cell cell = new Cell(maxY+1, i, null);
+			cells.add(cell);
+		}
+    	return new Slice(cells);
+    }
+    
+    public Slice generateLeft(Slice slice){
+    	List<Cell> cells = new ArrayList<Cell>();
+		int minX = slice.minX();
+		int minY = slice.minY();
+		int maxY = slice.maxY();
+		for(int i = minY; i <= maxY; i++){
+			Cell cell = new Cell(i, minX-1, null);
+			cells.add(cell);
+		}
+    	return new Slice(cells);
+    }
+    
+    public Slice generateRight(Slice slice){
+    	List<Cell> cells = new ArrayList<Cell>();
+		int maxX = slice.maxX();
+		int minY = slice.minY();
+		int maxY = slice.maxY();
+		for(int i = minY; i <= maxY; i++){
+			Cell cell = new Cell(i, maxX+1, null);
+			cells.add(cell);
+		}
+    	return new Slice(cells);
+    }
 
 }
 

src/main/java/com/google/hashcode/entity/Step.java

@@ -8,7 +8,13 @@
  */
 public class Step {
 
-    public Slice startPosition;
+    public Step(Slice startPosition, Slice delta) {
+		super();
+		this.startPosition = startPosition;
+		this.delta = delta;
+	}
 
-    public Cell delta;
+	public Slice startPosition;
+
+    public Slice delta;
 }

src/main/java/com/google/hashcode/utils/DFSMethods.java

@@ -68,7 +68,18 @@ public static Optional<Slice> rightStep(Pizza pizza, Slice slice) {
      */
     List<Step> getAvailableSteps(Pizza pizza, List<Slice> output) {
         //TODO implement.For each slice find all available steps. We DON'T change the pizza on this stage
-        return new ArrayList<>();
+    	List<Step> allSteps = new ArrayList<Step>();
+        for (Slice slice : output) {
+        	Slice left = slice.generateLeft(slice);
+        	Slice right = slice.generateRight(slice);
+        	Slice abowe = slice.generateAbowe(slice);
+        	Slice belowe = slice.generateBelow(slice);
+        	if(pizza.cotnainsAllCells(left))allSteps.add(new Step(slice, left));
+        	if(pizza.cotnainsAllCells(right))allSteps.add(new Step(slice, right));
+        	if(pizza.cotnainsAllCells(abowe))allSteps.add(new Step(slice, abowe));
+        	if(pizza.cotnainsAllCells(belowe))allSteps.add(new Step(slice, belowe));
+		}
+    	return allSteps;
     }
 
     Slice performStep(Pizza pizza, List<Step> steps) {

src/test/java/com/google/hashcode/utils/DFSMethodsTest.java

@@ -8,8 +8,10 @@
 import org.junit.Test;
 
 import java.io.File;
+import java.io.IOException;
 import java.util.ArrayList;
 import java.util.Arrays;
+import java.util.List;
 
 import static com.google.hashcode.utils.InputFiles.EXAMPLE_INPUT_FILE_PATH;
 import static org.junit.Assert.*;
@@ -31,7 +33,17 @@ public void rightStep() throws Exception {
         ArrayList<Cell> expectedPizzaCells = new ArrayList<>(pizza.getCells());
         expectedPizzaCells.removeAll(expectedSlice.cells);
         assertEquals(expectedPizzaCells,pizza.getCells());
-
+    }
+    
+    @Test
+    public void getAvailableSteps() throws IOException{
+    	Pizza pizza = new Pizza(new File(EXAMPLE_INPUT_FILE_PATH), IoUtils.parsePizza(EXAMPLE_INPUT_FILE_PATH), IoUtils.parseSliceInstructions(EXAMPLE_INPUT_FILE_PATH));
+    	Slice a = new Slice(new Cell(1, 1, Ingredient.MUSHROOM));
+    	Slice b = new Slice(new Cell(0, 0, Ingredient.MUSHROOM));
+    	List<Slice> slices = new ArrayList<Slice>();
+    	slices.add(a);
+    	slices.add(b);
+    	// generate expected slices
     }
 
 }