Gather data

src/test/java/puzzle/ExportFormatTest.java

@@ -0,0 +1,94 @@
+package puzzle;
+
+import org.junit.jupiter.api.Test;
+import puzzle.ExportFormat.ExportedPuzzle;
+import puzzle.ExportFormat.Rewards;
+import puzzle.Main.PuzzleResult;
+import puzzle.SwedishGenerator.FillResult;
+import puzzle.SwedishGenerator.Grid;
+import puzzle.SwedishGenerator.Lemma;
+
+import java.util.HashMap;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+public class ExportFormatTest {
+
+    @Test
+    void testExportFormatFromFilled() {
+        var swe = new SwedishGenerator();
+        var grid = SwedishGenerator.makeEmptyGrid();
+        
+        // Place a '2' (right) at (0,0)
+        grid.setCharAt(0, 0, '2');
+        // This creates a slot starting at (0,1)
+        
+        var clueMap = new HashMap<Integer, Lemma>();
+        // key = (r << 8) | (c << 4) | d
+        int key = (0 << 8) | (0 << 4) | 2;
+        Lemma lemma = new Lemma("TEST", 1, "A test word");
+        clueMap.put(key, lemma);
+        
+        // Manually fill the grid letters for "TEST" at (0,1), (0,2), (0,3), (0,4)
+        grid.setCharAt(0, 1, 'T');
+        grid.setCharAt(0, 2, 'E');
+        grid.setCharAt(0, 3, 'S');
+        grid.setCharAt(0, 4, 'T');
+        // Terminate the slot at (0,5) with another digit to avoid it extending to MAX_WORD_LENGTH
+        grid.setCharAt(0, 5, '1');
+        
+        var fillResult = new FillResult(true, grid, clueMap, null);
+        var puzzleResult = new PuzzleResult(swe, null, null, fillResult);
+        
+        Rewards rewards = new Rewards(10, 5, 1);
+        ExportedPuzzle exported = ExportFormat.exportFormatFromFilled(puzzleResult, 2, rewards);
+        
+        assertNotNull(exported);
+        assertEquals(2, exported.difficulty());
+        assertEquals(rewards, exported.rewards());
+        
+        // Check words
+        assertEquals(1, exported.words().length);
+        var w = exported.words()[0];
+        assertEquals("TEST", w.word());
+        assertEquals("h", w.direction());
+        
+        // The bounding box should include (0,0) for the arrow and (0,1)-(0,4) for the word.
+        // minR=0, maxR=0, minC=0, maxC=4
+        // startRow = 0 - minR = 0
+        // startCol = 1 - minC = 1
+        assertEquals(0, w.startRow());
+        assertEquals(1, w.startCol());
+        assertEquals(0, w.arrowRow());
+        assertEquals(0, w.arrowCol());
+        
+        // Check gridv2
+        // It should be 1 row, containing "2TEST" -> but letters are mapped, digits are not explicitly in letterAt.
+        // Wait, look at exportFormatFromFilled logic:
+        // row.append(letterAt.getOrDefault(pack(r, c), '#'));
+        // letterAt only contains letters from placed words.
+        // arrow cells are NOT in letterAt unless they are also part of a word (unlikely).
+        // So (0,0) should be '#'
+        assertEquals(1, exported.gridv2().size());
+        assertEquals("#TEST", exported.gridv2().get(0));
+    }
+    
+    @Test
+    void testExportFormatEmpty() {
+        var swe = new SwedishGenerator();
+        var grid = SwedishGenerator.makeEmptyGrid();
+        var fillResult = new FillResult(true, grid, new HashMap<>(), null);
+        var puzzleResult = new PuzzleResult(swe, null, null, fillResult);
+        
+        ExportedPuzzle exported = ExportFormat.exportFormatFromFilled(puzzleResult, 1, new Rewards(0,0,0));
+        
+        assertNotNull(exported);
+        assertEquals(0, exported.words().length);
+        // Should return full grid with '#'
+        assertEquals(SwedishGenerator.R, exported.gridv2().size());
+        for (String row : exported.gridv2()) {
+            assertEquals(SwedishGenerator.C, row.length());
+            assertTrue(row.matches("#+"));
+        }
+    }
+}