package puzzle;

public final class DictDataL5 {
  private DictDataL5() {}

  static final int LEN = 5;
  static final int ROWS = 130;
  static final int COLS = 70;
  static final int WORDS_LEN = 4434;
  static final int POS_LEN = 9100;

  private static long[] words() {
    long[] out = new long[WORDS_LEN];
    int k = 0;
    k = copy(out, k, DictDataL5W0.DATA);
    return out;
  }

  private static long[] posFlat() {
    long[] out = new long[POS_LEN];
    int k = 0;
    k = copy(out, k, DictDataL5P0.DATA);
    k = copy(out, k, DictDataL5P1.DATA);
    return out;
  }

  public static SwedishGenerator.DictEntry entry() {
    long[] wds = words();
    long[] flat = posFlat();
    long[][] pos = reshape(flat, ROWS, COLS);
    return new SwedishGenerator.DictEntry(wds, pos, wds.length, (wds.length + 63) >>> 6);
  }

  private static int copy(long[] dst, int at, long[] src) {
    System.arraycopy(src, 0, dst, at, src.length);
    return at + src.length;
  }

  private static long[][] reshape(long[] flat, int rows, int cols) {
    long[][] out = new long[rows][cols];
    int k = 0;
    for (int r = 0; r < rows; r++) {
      System.arraycopy(flat, k, out[r], 0, cols);
      k += cols;
    }
    return out;
  }
}