redo

2026-01-23 20:33:36 +01:00
parent fa3e8ef1ed
commit 73192f5905
8 changed files with 132 additions and 116 deletions
--- a/src/main/java/puzzle/Riddle.java
+++ b/src/main/java/puzzle/Riddle.java
@@ -0,0 +1,86 @@
+package puzzle;
+
+import lombok.AllArgsConstructor;
+import lombok.experimental.Delegate;
+import lombok.val;
+import puzzle.Masker.Slot;
+import puzzle.Meta.ShardLem;
+import puzzle.SwedishGenerator.Lemma;
+import puzzle.SwedishGenerator.Slotinfo;
+import java.util.Arrays;
+import static precomp.Const9x8.CLUE_DOWN0;
+import static precomp.Const9x8.CLUE_LEFT3;
+import static precomp.Const9x8.CLUE_LEFT_TOP4;
+import static precomp.Const9x8.CLUE_NONE;
+import static precomp.Const9x8.CLUE_RIGHT1;
+import static precomp.Const9x8.CLUE_RIGHT_TOP5;
+import static precomp.Const9x8.CLUE_UP2;
+public class Riddle {
+   
+   @AllArgsConstructor
+   enum Clue {
+      DOWN0(CLUE_DOWN0, 'B', 'b'),
+      RIGHT1(CLUE_RIGHT1, 'A', 'a'),
+      UP2(CLUE_UP2, 'C', 'c'),
+      LEFT3(CLUE_LEFT3, 'D', 'd'),
+      LEFT_TOP4(CLUE_LEFT_TOP4, 'E', 'e'),
+      RIGHT_TOP5(CLUE_RIGHT_TOP5, 'F', 'f'),
+      NONE(CLUE_NONE, '?', '?');
+      final byte dir;
+      final char slotChar, clueChar;
+      private static final Clue[] CLUES = new Clue[]{ DOWN0, RIGHT1, UP2, LEFT3, LEFT_TOP4, RIGHT_TOP5, NONE, NONE, NONE };
+      public static Clue from(int dir) { return CLUES[dir]; }
+   }
+   
+   public record Vestigium(int index, int clue) { }
+   
+   record Placed(long lemma, int slotKey, rci[] cells) {
+      
+      public static final char   HORIZONTAL = 'h';
+      static final        char   VERTICAL   = 'v';
+      static final        char[] DIRECTION  = { Placed.VERTICAL, Placed.HORIZONTAL, Placed.VERTICAL, Placed.HORIZONTAL, Placed.VERTICAL, Placed.VERTICAL };
+      
+      public int arrowCol()       { return cells[0].c(); }
+      public int arrowRow()       { return cells[0].r(); }
+      public int startRow()       { return cells[1].r(); }
+      public int startCol()       { return cells[1].c(); }
+      public boolean isReversed() { return !Slotinfo.increasing(slotKey); }
+      public char direction()     { return DIRECTION[Slot.dir(slotKey)]; }
+   }
+   
+   public record ExportedPuzzle(String[] grid, WordOut[] words, int difficulty, Rewards rewards) { }
+   
+   public record Rewards(int coins, int stars, int hints) { }
+   
+   public record WordOut(String word, int[] cell, int startRow, int startCol, char direction, int arrowRow, int arrowCol, boolean isReversed, int complex, String[] clue) {
+      
+      record ShaLemma(String word, @Delegate ShardLem rec) { }
+      private static ShaLemma lookup(long w, byte[] bytes) {
+         
+         try {
+            val rec = Meta.lookupSilent(w);
+            System.out.println("\nQuery: w=" + w + " -> i=" + rec.mmap());
+            var word1 = Lemma.asWord(w, bytes);
+            System.out.println("  word=" + word1 + "\n" + "  simpel=" + rec.simpel() + "\n" + "  clues=" + Arrays.toString(rec.clues()));
+            return new ShaLemma(word1, rec);
+         } catch (Exception e) {
+            throw new RuntimeException(e);
+         }
+      }
+      static long reverse(long w) {
+         int  L       = Lemma.unpackSize(w) + 1;
+         long letters = w & Lemma.LETTER_MASK;
+         long rev     = 0;
+         for (int i = 0; i < L; i++) {
+            long letter = (letters >>> (5 * i)) & 31;
+            rev |= (letter << (5 * (L - 1 - i)));
+         }
+         return (w & ~Lemma.LETTER_MASK) | rev;
+      }
+      public WordOut(long l, int startRow, int startCol, char d, int arrowRow, int arrowCol, boolean isReversed, byte[] bytes) {
+         val meta = lookup(isReversed ? reverse(l) : l, bytes);
+         this(meta.word, new int[]{ arrowRow, arrowCol, startRow, startCol }, startRow, startCol, d, arrowRow, arrowCol, isReversed,
+              meta.simpel(), meta.clues());
+      }
+   }
+}