introduce bitloops
This commit is contained in:
@@ -79,7 +79,7 @@ public class SwedishGeneratorTest {
|
||||
assertFalse(grid.isDigitAt(0));
|
||||
assertTrue(grid.isDigitAt(Grid.offset(0, 1)));
|
||||
assertFalse(grid.isLetterAt(Grid.offset(0, 1)));
|
||||
assertTrue(grid.isLetterAt( 0));
|
||||
assertTrue(grid.isLetterAt(0));
|
||||
assertFalse(grid.isLetterAt(Grid.offset(0, 1)));
|
||||
|
||||
var copy = grid.deepCopyGrid();
|
||||
@@ -110,8 +110,8 @@ public class SwedishGeneratorTest {
|
||||
var l8a = new Lemma("INERENAE", 1);
|
||||
|
||||
var l1 = new Lemma("APPLE", 5);
|
||||
Assertions.assertArrayEquals("APPLE".getBytes(StandardCharsets.US_ASCII), l1.word());
|
||||
assertEquals(5, l1.word().length);
|
||||
Assertions.assertEquals(Lemma.pack("APPLE".getBytes(StandardCharsets.US_ASCII)), l1.word());
|
||||
assertEquals(5, l1.len());
|
||||
assertEquals(5, l1.simpel());
|
||||
assertEquals((byte) 'A', l1.byteAt(0));
|
||||
|
||||
@@ -123,7 +123,7 @@ public class SwedishGeneratorTest {
|
||||
|
||||
var entry3 = dict.index()[3];
|
||||
assertEquals(1, entry3.words().size());
|
||||
Assertions.assertArrayEquals("AXE".getBytes(StandardCharsets.US_ASCII), entry3.words().getFirst().word());
|
||||
assertEquals(Lemma.pack("AXE".getBytes(StandardCharsets.US_ASCII)), entry3.words().getFirst().word());
|
||||
|
||||
// Check pos indexing
|
||||
// AXE: A at 0, X at 1, E at 2
|
||||
@@ -279,7 +279,7 @@ public class SwedishGeneratorTest {
|
||||
|
||||
// 1. Successful placement in empty grid
|
||||
assertTrue(placeWord(grid, s, w1, undoBuffer, 0));
|
||||
assertEquals('A', grid.byteAt( 0));
|
||||
assertEquals('A', grid.byteAt(0));
|
||||
assertEquals('B', grid.byteAt(Grid.offset(0, 1)));
|
||||
assertEquals('C', grid.byteAt(Grid.offset(0, 2)));
|
||||
assertEquals(0b111L, undoBuffer[0]);
|
||||
|
||||
Reference in New Issue
Block a user