introduce bitloops
This commit is contained in:
@@ -68,21 +68,21 @@ public class SwedishGeneratorTest {
|
||||
@Test
|
||||
void testGrid() {
|
||||
var grid = Grid.createEmpty();
|
||||
grid.setByteAt(0, (byte) 'A');
|
||||
grid.setLetter(0, (byte) 'A');
|
||||
grid.setClue(Grid.offset(0, 1), (byte) '1');
|
||||
|
||||
assertEquals('A', grid.byteAt(0));
|
||||
assertEquals(1, grid.digitAt(Grid.offset(0, 1)));
|
||||
assertTrue(grid.isLetterAt(0));
|
||||
assertFalse(grid.isDigitAt(0));
|
||||
assertTrue(grid.isDigitAt(Grid.offset(0, 1)));
|
||||
assertFalse(grid.isClue(0));
|
||||
assertTrue(grid.isClue(Grid.offset(0, 1)));
|
||||
assertFalse(grid.isLetterAt(Grid.offset(0, 1)));
|
||||
assertTrue(grid.isLetterAt(0));
|
||||
assertFalse(grid.isLetterAt(Grid.offset(0, 1)));
|
||||
|
||||
var copy = grid.deepCopyGrid();
|
||||
assertEquals('A', copy.byteAt(0));
|
||||
copy.setByteAt(0, (byte) 'B');
|
||||
copy.setLetter(0, (byte) 'B');
|
||||
assertEquals('B', copy.byteAt(0));
|
||||
assertEquals('A', grid.byteAt(0));
|
||||
}
|
||||
@@ -333,7 +333,7 @@ public class SwedishGeneratorTest {
|
||||
|
||||
// 4. Partial placement then conflict (rollback)
|
||||
grid = Grid.createEmpty();
|
||||
grid.setByteAt(Grid.offset(0, 2), (byte) 'X'); // Conflict at the end
|
||||
grid.setLetter(Grid.offset(0, 2), (byte) 'X'); // Conflict at the end
|
||||
assertFalse(placeWord(grid, s, w1, undoBuffer, 3));
|
||||
// Verify grid is still empty (except for 'X')
|
||||
assertEquals(DASH, grid.byteAt(Grid.offset(0, 0)));
|
||||
|
||||
Reference in New Issue
Block a user