introduce bitloops

This commit is contained in:
mike
2026-01-21 06:19:49 +01:00
parent ebcbc9b33c
commit dd53009e69
4 changed files with 15 additions and 21 deletions

View File

@@ -14,10 +14,10 @@ import static puzzle.SwedishGenerator.*;
public final class Masker {
public static final rci[] IT = Neighbors9x8.IT;
public static final long[] PATH_LO = Neighbors9x8.PATH_LO;
public static final long[] PATH_HI = Neighbors9x8.PATH_HI;
public static final long MASK_LO = -1L;
public static final long MASK_HI = Neighbors9x8.MASK_HI;//(1L << (SIZE - 64)) - 1;
public static final long[] PATH_LO = Neighbors9x8.PATH_LO;
public static final long[] PATH_HI = Neighbors9x8.PATH_HI;
public static final long MASK_LO = -1L;
public static final long MASK_HI = Neighbors9x8.MASK_HI;//(1L << (SIZE - 64)) - 1;
private final Rng rng;
private final int[] stack;
private final Clues cache;
@@ -650,7 +650,7 @@ public final class Masker {
//@formatter:on
@AllArgsConstructor
@Accessors(fluent = true)
public static final class Clues {
public static final class Clues {
@Getter long lo, hi, vlo, vhi, rlo, rhi, xlo, xhi;
public static Clues createEmpty() { return new Clues(0, 0, 0, 0, 0, 0, 0, 0); }