package puzzle;

import module java.base;
import lombok.AllArgsConstructor;
import lombok.val;
import precomp.Neighbors9x8;
import precomp.Neighbors9x8.rci;

import static java.lang.Long.*;
import static puzzle.SwedishGenerator.*;

public final class Masker {
   
   public static final rci[]  IT         = Neighbors9x8.IT;
   private final       Rng    rng;
   private final       int[]  stack;
   private final       Clues  cache;
   private final       int[]  activeCIdx = new int[SwedishGenerator.SIZE];
   private final       long[] activeSLo  = new long[SwedishGenerator.SIZE];
   private final       long[] activeSHi  = new long[SwedishGenerator.SIZE];
   private final       long[] adjLo      = new long[SwedishGenerator.SIZE];
   private final       long[] adjHi      = new long[SwedishGenerator.SIZE];
   
   public Masker(Rng rng, int[] stack, Clues cache) {
      this.rng   = rng;
      this.stack = stack;
      this.cache = cache;
   }
   
   public static final int[][] MUTATE_RI = new int[SwedishGenerator.SIZE][625];
   
   static {
      for (int i = 0; i < SwedishGenerator.SIZE; i++) {
         int k = 0;
         for (int dr1 = -2; dr1 <= 2; dr1++)
            for (int dr2 = -2; dr2 <= 2; dr2++)
               for (int dc1 = -2; dc1 <= 2; dc1++)
                  for (int dc2 = -2; dc2 <= 2; dc2++) {
                     val ti = IT[i];
                     MUTATE_RI[i][k++] = offset(clamp(ti.r() + dr1 + dr2, 0, R - 1),
                                                clamp(ti.c() + dc1 + dc2, 0, C - 1));
                  }
      }
   }
   // slice ray to stop before first clue, depending on direction monotonicity
   // right/down => increasing indices; up/left => decreasing indices
   // first clue is highest index among hits (hi first, then lo)
   private static void processSlotRev(Clues c, SlotVisitor visitor, int key) {
      long rayLo = PATH_LO[key];
      long rayHi = PATH_HI[key];
      // only consider clue cells
      long hitsLo = rayLo & c.lo;
      long hitsHi = rayHi & c.hi;
      
      if (hitsHi != X) {
         int  msb  = 63 - numberOfLeadingZeros(hitsHi);
         long stop = 1L << msb;
         rayHi &= -(stop << 1); // keep bits > stop
         rayLo = 0;                   // lo indices are below stop
      } else if (hitsLo != X) {
         int  msb  = 63 - numberOfLeadingZeros(hitsLo);
         long stop = 1L << msb;
         rayLo &= -(stop << 1);
      }
      if (Long.bitCount(rayLo) + Long.bitCount(rayHi) >= MIN_LEN)
         visitor.visit(key, rayLo, rayHi);
   }
   private static boolean validSlotRev(long lo, long hi, int min, int key) {
      long rayLo = PATH_LO[key];
      long rayHi = PATH_HI[key];
      // only consider clue cells
      long hitsLo = rayLo & lo;
      long hitsHi = rayHi & hi;
      
      if (hitsHi != X) return (Long.bitCount(rayHi & -(1L << 63 - numberOfLeadingZeros(hitsHi) << 1)) >= min);
      else if (hitsLo != X) return (Long.bitCount(rayLo & -(1L << 63 - numberOfLeadingZeros(hitsLo) << 1)) + Long.bitCount(rayHi) >= min);
      else return (Long.bitCount(rayLo) + Long.bitCount(rayHi) >= min);
   }
   private static boolean validSlot(long lo, long hi, int min, int key) {
      long rayLo  = PATH_LO[key];
      long rayHi  = PATH_HI[key];
      long hitsLo = rayLo & lo;
      long hitsHi = rayHi & hi;
      
      if (hitsLo != X) return (Long.bitCount(rayLo & ((1L << numberOfTrailingZeros(hitsLo)) - 1)) >= min);
      else if (hitsHi != X) return (Long.bitCount(rayLo) + Long.bitCount(rayHi & ((1L << numberOfTrailingZeros(hitsHi)) - 1)) >= min);
      else return (Long.bitCount(rayLo) + Long.bitCount(rayHi) >= min);
   }
   private static void processSlot(Clues c, SlotVisitor visitor, int key) {
      long rayLo  = PATH_LO[key];
      long rayHi  = PATH_HI[key];
      long hitsLo = rayLo & c.lo;
      long hitsHi = rayHi & c.hi;
      
      if (hitsLo != X) {
         long stop = 1L << numberOfTrailingZeros(hitsLo);
         rayLo &= (stop - 1);
         rayHi = 0;
      } else if (hitsHi != X) {
         long stop = 1L << numberOfTrailingZeros(hitsHi);
         rayHi &= (stop - 1);
      }
      if (Long.bitCount(rayLo) + Long.bitCount(rayHi) >= MIN_LEN)
         visitor.visit(key, rayLo, rayHi);
   }
   public static Slot[] extractSlots(Clues grid, DictEntry[] index) {
      var slots = new ArrayList<Slot>(grid.clueCount());
      grid.forEachSlot((key, lo, hi) -> slots.add(Slot.from(key, lo, hi, Objects.requireNonNull(index[Slot.length(lo, hi)]))));
      return slots.toArray(Slot[]::new);
   }
   public static Slotinfo[] slots(Clues mask, DictEntry[] index) {
      var slots = Masker.extractSlots(mask, index);
      return Masker.scoreSlots(slots);
   }
   public static Slotinfo[] scoreSlots(Slot[] slots) {
      val        count    = new byte[SwedishGenerator.SIZE];
      Slotinfo[] slotInfo = new Slotinfo[slots.length];
      for (var s : slots) {
         for (long b = s.lo; b != X; b &= b - 1) count[numberOfTrailingZeros(b)]++;
         for (long b = s.hi; b != X; b &= b - 1) count[64 | numberOfTrailingZeros(b)]++;
      }
      for (int i = 0; i < slots.length; i++) {
         var slot = slots[i];
         slotInfo[i] = new Slotinfo(slot.key, slot.lo, slot.hi, slotScore(count, slot.lo, slot.hi), new Assign(), slot.entry);
      }
      return slotInfo;
   }
   public static int slotScore(byte[] count, long lo, long hi) {
      int cross = 0;
      for (long b = lo; b != X; b &= b - 1) cross += (count[numberOfTrailingZeros(b)] - 1);
      for (long b = hi; b != X; b &= b - 1) cross += (count[64 | numberOfTrailingZeros(b)] - 1);
      return cross * 10 + Slot.length(lo, hi);
   }
   public static int clamp(int x, int a, int b) { return Math.max(a, Math.min(b, x)); }
   public static int offset(int r, int c)       { return r | (c << 3); }
   
   public long maskFitness(final Clues grid, int clueSize) {
      
      long    cHLo     = 0L, cHHi = 0L, cVLo = 0L, cVHi = 0L;
      long    cHLo2    = 0L, cHHi2 = 0L, cVLo2 = 0L, cVHi2 = 0L;
      long    lo_cl    = grid.lo, hi_cl = grid.hi;
      long    penalty  = (((long) Math.abs(grid.clueCount() - clueSize)) * 16000L);
      boolean hasSlots = false;
      if (!grid.isValid(2)) return 1_000_000_000L;
      
      int numClues = 0;
      for (long bits = lo_cl; bits != X; bits &= bits - 1) {
         long lsb     = bits & -bits;
         int  clueIdx = numberOfTrailingZeros(lsb);
         int  dir     = grid.getDir(clueIdx);
         int  key     = Slot.packSlotKey(clueIdx, dir);
         long rLo     = PATH_LO[key], rHi = PATH_HI[key];
         long hLo     = rLo & lo_cl, hHi = rHi & hi_cl;
         if (Slotinfo.increasing(key)) {
            if (hLo != X) {
               rLo &= ((1L << numberOfTrailingZeros(hLo)) - 1);
               rHi = 0;
            } else if (hHi != X) rHi &= ((1L << numberOfTrailingZeros(hHi)) - 1);
         } else if (hHi != X) {
            int msb = 63 - numberOfLeadingZeros(hHi);
            rHi &= -(1L << msb << 1);
            rLo = 0;
         } else if (hLo != X) {
            int msb = 63 - numberOfLeadingZeros(hLo);
            rLo &= -(1L << msb << 1);
         }
         
         activeCIdx[numClues] = clueIdx;
         activeSLo[numClues]  = rLo;
         activeSHi[numClues]  = rHi;
         numClues++;
         
         if ((rLo | rHi) != X) {
            hasSlots = true;
            if (Slot.horiz(key)) {
               cHLo2 |= (cHLo & rLo);
               cHHi2 |= (cHHi & rHi);
               cHLo |= rLo;
               cHHi |= rHi;
            } else {
               cVLo2 |= (cVLo & rLo);
               cVHi2 |= (cVHi & rHi);
               cVLo |= rLo;
               cVHi |= rHi;
            }
            if ((bitCount(rLo) + bitCount(rHi)) < MIN_LEN) penalty += 8000;
         } else penalty += 25000;
      }
      for (long bits = hi_cl; bits != X; bits &= bits - 1) {
         long lsb     = bits & -bits;
         int  clueIdx = numberOfTrailingZeros(lsb);
         int  dir     = grid.getDir(64 | clueIdx);
         int  key     = Slot.packSlotKey(64 | clueIdx, dir);
         long rLo     = PATH_LO[key], rHi = PATH_HI[key];
         long hLo     = rLo & lo_cl, hHi = rHi & hi_cl;
         if (Slotinfo.increasing(key)) {
            if (hLo != X) {
               rLo &= ((1L << numberOfTrailingZeros(hLo)) - 1);
               rHi = 0;
            } else if (hHi != X) rHi &= ((1L << numberOfTrailingZeros(hHi)) - 1);
         } else if (hHi != X) {
            int msb = 63 - numberOfLeadingZeros(hHi);
            rHi &= -(1L << msb << 1);
            rLo = 0;
         } else if (hLo != X) {
            int msb = 63 - numberOfLeadingZeros(hLo);
            rLo &= -(1L << msb << 1);
         }
         
         activeCIdx[numClues] = 64 | clueIdx;
         activeSLo[numClues]  = rLo;
         activeSHi[numClues]  = rHi;
         numClues++;
         
         if ((rLo | rHi) != X) {
            hasSlots = true;
            if (Slot.horiz(key)) {
               cHLo2 |= (cHLo & rLo);
               cHHi2 |= (cHHi & rHi);
               cHLo |= rLo;
               cHHi |= rHi;
            } else {
               cVLo2 |= (cVLo & rLo);
               cVHi2 |= (cVHi & rHi);
               cVLo |= rLo;
               cVHi |= rHi;
            }
            if ((bitCount(rLo) + bitCount(rHi)) < MIN_LEN) penalty += 8000;
         } else penalty += 25000;
      }
      
      if (!hasSlots) return 1_000_000_000L;
      
      // Connectiviteitscheck
      for (int i = 0; i < numClues; i++) {
         adjLo[i] = 0;
         adjHi[i] = 0;
      }
      for (int i = 0; i < numClues; i++) {
         for (int j = i + 1; j < numClues; j++) {
            boolean connected = false;
            // 1. Intersectie
            if (((activeSLo[i] & activeSLo[j]) | (activeSHi[i] & activeSHi[j])) != 0) {
               connected = true;
            }
            
            if (connected) {
               if (j < 64) adjLo[i] |= (1L << j);
               else adjHi[i] |= (1L << (j - 64));
               if (i < 64) adjLo[j] |= (1L << i);
               else adjHi[j] |= (1L << (i - 64));
            }
         }
      }
      
      if (numClues > 0) {
         long reachedLo = 1L, reachedHi = 0L;
         stack[0] = 0;
         int sp = 1;
         while (sp > 0) {
            int  cur = stack[--sp];
            long nLo = adjLo[cur] & ~reachedLo;
            long nHi = adjHi[cur] & ~reachedHi;
            while (nLo != 0) {
               long lsb = nLo & -nLo;
               int  idx = numberOfTrailingZeros(lsb);
                             reachedLo |= lsb;
               stack[sp++] = idx;
                             nLo &= ~lsb;
            }
            while (nHi != 0) {
               long lsb = nHi & -nHi;
               int  idx = 64 | numberOfTrailingZeros(lsb);
                             reachedHi |= lsb;
               stack[sp++] = idx;
                             nHi &= ~lsb;
            }
         }
         int count = bitCount(reachedLo) + bitCount(reachedHi);
         if (count < numClues) {
            penalty += (numClues - count) * 4000;
            penalty += 20000;
         }
      }
      
      for (long bits = ~lo_cl & MASK_LO; bits != X; bits &= bits - 1) {
         int clueIdx = numberOfTrailingZeros(bits);
         var rci     = IT[clueIdx];
         if ((4 - rci.nbrCount()) + bitCount(rci.n1() & lo_cl) + bitCount(rci.n2() & hi_cl) >= 3) penalty += 400;
         boolean h = (cHLo & (1L << clueIdx)) != X;
         boolean v = (cVLo & (1L << clueIdx)) != X;
         if (!h && !v) penalty += 5000;
         else if (h && v) { /* ok */ } else if (((h ? cHLo2 : cVLo2) & (1L << clueIdx)) != X) penalty += 600;
         else penalty += 200;
      }
      for (long bits = ~hi_cl & MASK_HI; bits != X; bits &= bits - 1) {
         int clueIdx = numberOfTrailingZeros(bits);
         var rci     = IT[64 | clueIdx];
         if ((4 - rci.nbrCount()) + bitCount(rci.n1() & lo_cl) + bitCount(rci.n2() & hi_cl) >= 3) penalty += 400;
         boolean h = (cHHi & (1L << clueIdx)) != X;
         boolean v = (cVHi & (1L << clueIdx)) != X;
         if (!h && !v)
            penalty += 5000;
         else if (h && v) { /* ok */ } else if (((h ? cHHi2 : cVHi2) & (1L << clueIdx)) != X) penalty += 600;
         else penalty += 200;
      }
      
      return penalty;
   }
   
   public Clues randomMask(final int clueSize) {
      var g = Clues.createEmpty();
      for (int placed = 0, guard = 0, ri; placed < clueSize && guard < 4000; guard++) {
         
         ri = rng.randint0_SIZE();
         if (isLo(ri)) {
            if (g.isClueLo(ri)) continue;
            var d_idx = rng.randint2bitByte();
            int key   = Slot.packSlotKey(ri, d_idx);
            if (g.hasRoomForClue(key, OFFSETS_D_IDX[key])) {
               g.setClueLo(1L << ri, d_idx);
               if (g.isValid(MIN_LEN)) placed++;
               else g.clearClueLo(~(1L << ri));
            }
         } else {
            if (g.isClueHi(ri)) continue;
            var d_idx = rng.randint2bitByte();
            int key   = Slot.packSlotKey(ri, d_idx);
            if (g.hasRoomForClue(key, OFFSETS_D_IDX[key])) {
               g.setClueHi(1L << (ri & 63), d_idx);
               if (g.isValid(MIN_LEN)) placed++;
               else g.clearClueHi(~(1L << (ri & 63)));
            }
         }
         
      }
      return g;
   }
   
   public Clues mutate(Clues c) {
      var bytes = MUTATE_RI[rng.randint0_SIZE()];
      for (int k = 0, ri; k < 4; k++) {
         ri = bytes[rng.randint0_624()];
         if (c.notClue(ri)) { // ADD
            byte d   = rng.randint2bitByte();
            int  key = Slot.packSlotKey(ri, d);
            if (c.hasRoomForClue(key, OFFSETS_D_IDX[key])) {
               if (isLo(ri)) {
                  c.setClueLo(1L << ri, d);
                  if (!c.isValid(MIN_LEN)) c.clearClueLo(~(1L << ri));
               } else {
                  c.setClueHi(1L << (ri & 63), d);
                  if (!c.isValid(MIN_LEN)) c.clearClueHi(~(1L << (ri & 63)));
               }
            }
         } else { // HAS CLUE
            int op = rng.randint(10);
            if (op < 2) { // REMOVE
               if (isLo(ri)) c.clearClueLo(~(1L << ri));
               else c.clearClueHi(~(1L << (ri & 63)));
            } else if (op < 5) { // CHANGE DIRECTION
               byte d   = rng.randint2bitByte();
               int  key = Slot.packSlotKey(ri, d);
               if (c.hasRoomForClue(key, OFFSETS_D_IDX[key])) {
                  byte oldD = c.getDir(ri);
                  if (isLo(ri)) {
                     c.setClueLo(1L << ri, d);
                     if (!c.isValid(MIN_LEN)) c.setClueLo(1L << ri, oldD);
                  } else {
                     c.setClueHi(1L << (ri & 63), d);
                     if (!c.isValid(MIN_LEN)) c.setClueHi(1L << (ri & 63), oldD);
                  }
               }
            } else { // MOVE
               int nri = bytes[rng.randint0_624()];
               if (c.notClue(nri)) {
                  byte d    = c.getDir(ri);
                  int  nkey = Slot.packSlotKey(nri, d);
                  if (c.hasRoomForClue(nkey, OFFSETS_D_IDX[nkey])) {
                     if (isLo(ri)) c.clearClueLo(~(1L << ri));
                     else c.clearClueHi(~(1L << (ri & 63)));
                     if (isLo(nri)) c.setClueLo(1L << nri, d);
                     else c.setClueHi(1L << (nri & 63), d);
                     if (!c.isValid(MIN_LEN)) {
                        if (isLo(nri)) c.clearClueLo(~(1L << nri));
                        else c.clearClueHi(~(1L << (nri & 63)));
                        if (isLo(ri)) c.setClueLo(1L << ri, d);
                        else c.setClueHi(1L << (ri & 63), d);
                     }
                  }
               }
            }
         }
      }
      return c;
   }
   
   public Clues crossover(Clues a, Clues other) {
      
      var theta = rng.nextFloat() * Math.PI;
      var nc    = Math.cos(theta);
      var nr    = Math.sin(theta);
      
      long maskLo = 0, maskHi = 0;
      for (var rci : IT)
         if ((rci.cross_r()) * nc + (rci.cross_c()) * nr < 0) {
            int i = rci.i();
            if ((i & 64) == 0) maskLo |= (1L << i);
            else maskHi |= (1L << (i - 64));
         }
      var c = new Clues(
              (a.lo & ~maskLo) | (other.lo & maskLo),
              (a.hi & ~maskHi) | (other.hi & maskHi),
              (a.vlo & ~maskLo) | (other.vlo & maskLo),
              (a.vhi & ~maskHi) | (other.vhi & maskHi),
              (a.rlo & ~maskLo) | (other.rlo & maskLo),
              (a.rhi & ~maskHi) | (other.rhi & maskHi),
              (a.xlo & ~maskLo) | (other.xlo & maskLo),
              (a.xhi & ~maskHi) | (other.xhi & maskHi));
      int guard = 0;
      while (!c.isValid(MIN_LEN) && guard++ < 3) {
         for (var l = c.lo & ~c.rlo & ~c.vlo; l != X; l &= l - 1) clearCluesLo(c, numberOfTrailingZeros(l), 0);
         for (var l = c.lo & ~c.rlo & c.vlo; l != X; l &= l - 1) clearCluesLo(c, numberOfTrailingZeros(l), 1);
         for (var l = c.lo & c.rlo & ~c.vlo; l != X; l &= l - 1) clearCluesLo(c, numberOfTrailingZeros(l), 2);
         for (var l = c.lo & c.rlo & c.vlo; l != X; l &= l - 1) clearCluesLo(c, numberOfTrailingZeros(l), 3);
         for (var h = c.hi & ~c.rhi & ~c.vhi; h != X; h &= h - 1) clearCluesHi(c, numberOfTrailingZeros(h), 0);
         for (var h = c.hi & ~c.rhi & c.vhi; h != X; h &= h - 1) clearCluesHi(c, numberOfTrailingZeros(h), 1);
         for (var h = c.hi & c.rhi & ~c.vhi; h != X; h &= h - 1) clearCluesHi(c, (numberOfTrailingZeros(h)), 2);
         for (var h = c.hi & c.rhi & c.vhi; h != X; h &= h - 1) clearCluesHi(c, (numberOfTrailingZeros(h)), 3);
      }
      return c;
   }
   
   public static void clearCluesLo(Clues out, int idx, int d) {
      int key = Slot.packSlotKey(idx, d);
      if (!out.hasRoomForClue(key, OFFSETS_D_IDX[key])) out.clearClueLo(~(1L << idx));
   }
   
   public static void clearCluesHi(Clues out, int idx, int d) {
      int key = Slot.packSlotKey(64 | idx, d);
      if (!out.hasRoomForClue(key, OFFSETS_D_IDX[key])) out.clearClueHi(~(1L << idx));
   }
   
   public Clues hillclimb(Clues start, int clue_size, int limit) {
      var best  = start;
      var bestF = maskFitness(best, clue_size);
      var fails = 0;
      
      while (fails < limit) {
         cache.from(best);
         var cand = mutate(best);
         var f    = maskFitness(cand, clue_size);
         if (f < bestF) {
            best  = cand;
            bestF = f;
            fails = 0;
         } else {
            best.from(cache);
            fails++;
         }
      }
      return best;
   }
   
   public Clues generateMask(int clueSize, int popSize, int gens, int offspring) {
      class GridAndFit {
         
         Clues grid;
         long  fite = -1;
         GridAndFit(Clues grid) { this.grid = grid; }
         long fit() {
            if (fite == -1) this.fite = maskFitness(grid, clueSize);
            return this.fite;
         }
      }
      if (Main.VERBOSE) System.out.println("generateMask init pop: " + popSize + " clueSize: " + clueSize);
      GridAndFit[] pop = new GridAndFit[popSize];
      for (int i = 0; i < popSize; i++) {
         if (Thread.currentThread().isInterrupted()) return null;
         pop[i] = new GridAndFit(hillclimb(randomMask(clueSize), clueSize, 180));
      }
      
      for (int gen = 0; gen < gens; gen++) {
         if (Thread.currentThread().isInterrupted()) break;
         GridAndFit[] children = new GridAndFit[offspring];
         int childCount = 0;
         for (int k = 0; k < offspring; k++) {
            if (Thread.currentThread().isInterrupted()) break;
            GridAndFit p1    = rng.rand(pop);
            GridAndFit p2    = rng.rand(pop);
            Clues      child = crossover(p1.grid, p2.grid);
            children[k] = new GridAndFit(hillclimb(child, clueSize, 70));
            childCount++;
         }
         
         GridAndFit[] combined = new GridAndFit[pop.length + childCount];
         System.arraycopy(pop, 0, combined, 0, pop.length);
         System.arraycopy(children, 0, combined, pop.length, childCount);
         Arrays.sort(combined, Comparator.comparingLong(GridAndFit::fit));
         
         GridAndFit[] next = new GridAndFit[offspring];
         int nextCount = 0;
         for (GridAndFit cand : combined) {
            if (nextCount >= offspring) break;
            boolean ok = true;
            for (int i = 0; i < nextCount; i++)
               if (cand.grid.similarity(next[i].grid) > 0.92) {
                  ok = false;
                  break;
               }
            if (ok) next[nextCount++] = cand;
         }
         pop = nextCount == offspring ? next : Arrays.copyOf(next, nextCount);
         
         if (Main.VERBOSE && (gen & 15) == 15) System.out.println("  gen " + gen + "/" + gens + " bestFitness=" + pop[0].fit());
      }
      if (pop.length == 0) return null;
      GridAndFit best = pop[0];
      for (int i = 1; i < pop.length; i++) {
         GridAndFit x = pop[i];
         if (x.fit() < best.fit()) best = x;
      }
      return best.grid;
   }
   //@formatter:off
   @FunctionalInterface public interface SlotVisitor { void visit(int key, long lo, long hi); }
   //@formatter:on
   @AllArgsConstructor
   public static class Clues {
      
      long lo, hi, vlo, vhi, rlo, rhi, xlo, xhi;
      public static Clues createEmpty() { return new Clues(0, 0, 0, 0, 0, 0, 0, 0); }
      
      public boolean cluelessLo(int idx) {
         if (!isClueLo(idx)) return false;
         clearClueLo(~(1L << idx));
         return true;
      }
      public boolean cluelessHi(int idx) {
         if (!isClueHi(idx)) return false;
         clearClueHi(~(1L << (idx & 63)));
         return true;
      }
      public boolean hasRoomForClue(int key, long packed) {
         if (packed == X || !notClue(packed & 0x7FL) || !notClue((packed >>> 7) & 0x7FL)) return false;
         if (Slotinfo.increasing(key)) if (!validSlot(lo, hi, MIN_LEN, key)) return false;
         return validSlotRev(lo, hi, MIN_LEN, key);
      }
      
      public void setClueLo(long mask, byte idx) {
         lo |= mask;
         if ((idx & 1) != 0) vlo |= mask;
         else vlo &= ~mask;
         if ((idx & 2) != 0) rlo |= mask;
         else rlo &= ~mask;
         if ((idx & 4) != 0) xlo |= mask;
         else xlo &= ~mask;
      }
      public void setClueHi(long mask, byte idx) {
         hi |= mask;
         if ((idx & 1) != 0) vhi |= mask;
         else vhi &= ~mask;
         if ((idx & 2) != 0) rhi |= mask;
         else rhi &= ~mask;
         if ((idx & 4) != 0) xhi |= mask;
         else xhi &= ~mask;
      }
      public void clearClueLo(long mask) {
         lo &= mask;
         vlo &= mask;
         rlo &= mask;
         xlo &= mask;
      }
      public void clearClueHi(long mask) {
         hi &= mask;
         vhi &= mask;
         rhi &= mask;
         xhi &= mask;
      }
      public boolean isClueLo(int index) { return ((lo >>> index) & 1L) != X; }
      public boolean isClueHi(int index) { return ((hi >>> (index & 63)) & 1L) != X; }
      public boolean notClue(long index) { return ((index & 64) == 0) ? ((lo >>> index) & 1L) == X : ((hi >>> (index & 63)) & 1L) == X; }
      public boolean notClue(int index)  { return ((index & 64) == 0) ? ((lo >>> index) & 1L) == X : ((hi >>> (index & 63)) & 1L) == X; }
      
      public int clueCount()             { return bitCount(lo) + bitCount(hi); }
      public double similarity(Clues b) {
         long matchLo = (~(lo ^ b.lo)) & (~lo | (~(vlo ^ b.vlo) & ~(rlo ^ b.rlo) & ~(xlo ^ b.xlo)));
         long matchHi = (~(hi ^ b.hi)) & (~hi | (~(vhi ^ b.vhi) & ~(rhi ^ b.rhi) & ~(xhi ^ b.xhi)));
         
         return (bitCount(matchLo & MASK_LO) + bitCount(matchHi & MASK_HI)) / SIZED;
      }
      public Grid toGrid() { return new Grid(new byte[SwedishGenerator.SIZE], lo, hi); }
      public boolean isValid(int minLen) {
         for (var l = lo & ~xlo & ~rlo & vlo; l != X; l &= l - 1) if (!validSlot(lo, hi, minLen, Slot.packSlotKey(numberOfTrailingZeros(l), 1))) return false;
         for (var l = lo & ~xlo & ~rlo & ~vlo; l != X; l &= l - 1) if (!validSlot(lo, hi, minLen, Slot.packSlotKey(numberOfTrailingZeros(l), 0))) return false;
         for (var l = lo & ~xlo & rlo & ~vlo; l != X; l &= l - 1) if (!validSlotRev(lo, hi, minLen, Slot.packSlotKey(numberOfTrailingZeros(l), 2))) return false;
         for (var l = lo & ~xlo & rlo & vlo; l != X; l &= l - 1) if (!validSlotRev(lo, hi, minLen, Slot.packSlotKey(numberOfTrailingZeros(l), 3))) return false;
         for (var l = lo & xlo & ~rlo & ~vlo; l != X; l &= l - 1) if (!validSlot(lo, hi, minLen, Slot.packSlotKey(numberOfTrailingZeros(l), 4))) return false;
         
         for (var h = hi & ~xhi & ~rhi & vhi; h != X; h &= h - 1) if (!validSlot(lo, hi, minLen, Slot.packSlotKey(64 | numberOfTrailingZeros(h), 1))) return false;
         for (var h = hi & ~xhi & ~rhi & ~vhi; h != X; h &= h - 1) if (!validSlot(lo, hi, minLen, Slot.packSlotKey(64 | numberOfTrailingZeros(h), 0))) return false;
         for (var h = hi & ~xhi & rhi & ~vhi; h != X; h &= h - 1) if (!validSlotRev(lo, hi, minLen, Slot.packSlotKey((64 | numberOfTrailingZeros(h)), 2))) return false;
         for (var h = hi & ~xhi & rhi & vhi; h != X; h &= h - 1) if (!validSlotRev(lo, hi, minLen, Slot.packSlotKey((64 | numberOfTrailingZeros(h)), 3))) return false;
         for (var h = hi & xhi & ~rhi & ~vhi; h != X; h &= h - 1) if (!validSlot(lo, hi, minLen, Slot.packSlotKey(64 | numberOfTrailingZeros(h), 4))) return false;
         return true;
      }
      public void forEachSlot(SlotVisitor visitor) {
         for (var l = lo & ~xlo & ~rlo & vlo; l != X; l &= l - 1) processSlot(this, visitor, Slot.packSlotKey(numberOfTrailingZeros(l), 1));
         for (var l = lo & ~xlo & ~rlo & ~vlo; l != X; l &= l - 1) processSlot(this, visitor, Slot.packSlotKey(numberOfTrailingZeros(l), 0));
         for (var l = lo & ~xlo & rlo & ~vlo; l != X; l &= l - 1) processSlotRev(this, visitor, Slot.packSlotKey(numberOfTrailingZeros(l), 2));
         for (var l = lo & ~xlo & rlo & vlo; l != X; l &= l - 1) processSlotRev(this, visitor, Slot.packSlotKey(numberOfTrailingZeros(l), 3));
         for (var l = lo & xlo & ~rlo & ~vlo; l != X; l &= l - 1) processSlot(this, visitor, Slot.packSlotKey(numberOfTrailingZeros(l), 4));
         
         for (var h = hi & ~xhi & ~rhi & vhi; h != X; h &= h - 1) processSlot(this, visitor, Slot.packSlotKey(64 | numberOfTrailingZeros(h), 1));
         for (var h = hi & ~xhi & ~rhi & ~vhi; h != X; h &= h - 1) processSlot(this, visitor, Slot.packSlotKey(64 | numberOfTrailingZeros(h), 0));
         for (var h = hi & ~xhi & rhi & ~vhi; h != X; h &= h - 1) processSlotRev(this, visitor, Slot.packSlotKey((64 | numberOfTrailingZeros(h)), 2));
         for (var h = hi & ~xhi & rhi & vhi; h != X; h &= h - 1) processSlotRev(this, visitor, Slot.packSlotKey((64 | numberOfTrailingZeros(h)), 3));
         for (var h = hi & xhi & ~rhi & ~vhi; h != X; h &= h - 1) processSlot(this, visitor, Slot.packSlotKey(64 | numberOfTrailingZeros(h), 4));
      }
      public Clues from(Clues best) {
         lo  = best.lo;
         hi  = best.hi;
         vlo = best.vlo;
         vhi = best.vhi;
         rlo = best.rlo;
         rhi = best.rhi;
         xlo = best.xlo;
         xhi = best.xhi;
         return this;
      }
      public byte getDir(int index) {
         if ((index & 64) == 0) {
            int v = (vlo & (1L << index)) != 0 ? 1 : 0;
            int r = (rlo & (1L << index)) != 0 ? 1 : 0;
            int x = (xlo & (1L << index)) != 0 ? 1 : 0;
            return (byte) ((x << 2) | (r << 1) | v);
         } else {
            int v = (vhi & (1L << (index & 63))) != 0 ? 1 : 0;
            int r = (rhi & (1L << (index & 63))) != 0 ? 1 : 0;
            int x = (xhi & (1L << (index & 63))) != 0 ? 1 : 0;
            return (byte) ((x << 2) | (r << 1) | v);
         }
      }
   }
   
   public record Slot(int key, long lo, long hi, DictEntry entry) {
      
      static final int BIT_FOR_DIR = 3;
      public static Slot from(int key, long lo, long hi, DictEntry entry) { return new Slot(key, lo, hi, entry); }
      public static int length(long lo, long hi)                          { return bitCount(lo) + bitCount(hi); }
      public static int clueIndex(int key)                                { return key >>> BIT_FOR_DIR; }
      public static int dir(int key)                                      { return key & 7; }
      public static boolean horiz(int d)                                  { return (d & 1) != 0 && (d & 4) == 0; }
      public static int packSlotKey(int idx, int d)                       { return (idx << BIT_FOR_DIR) | d; }
   }
}