@eifi1/ui-kit 0.10.0 → 0.12.0

package/dist/lib/qr-encode.js

@@ -0,0 +1,338 @@
+"use client";
+const LEVELS = ["L", "M", "Q", "H"];
+const FORMAT_BITS = { L: 1, M: 0, Q: 3, H: 2 };
+const ECC_CODEWORDS_PER_BLOCK = [
+  [-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],
+  [-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28],
+  [-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],
+  [-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
+];
+const NUM_ERROR_CORRECTION_BLOCKS = [
+  [-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25],
+  [-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49],
+  [-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68],
+  [-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81]
+];
+function encodeQr(text, options = {}) {
+  const bytes = Array.from(new TextEncoder().encode(text));
+  let level = LEVELS.indexOf(options.errorCorrection ?? "M");
+  let version = 1;
+  let usedBits;
+  for (; ; version++) {
+    const countBits = version <= 9 ? 8 : 16;
+    usedBits = bytes.length < 1 << countBits ? 4 + countBits + bytes.length * 8 : Infinity;
+    if (usedBits <= dataCodewords(version, level) * 8) break;
+    if (version >= 40) throw new RangeError("QR data too long");
+  }
+  if (options.boostErrorCorrection ?? true) {
+    for (let higher = level + 1; higher < LEVELS.length; higher++) {
+      if (usedBits <= dataCodewords(version, higher) * 8) level = higher;
+    }
+  }
+  const bits = [];
+  const append = (value, length) => {
+    for (let i = length - 1; i >= 0; i--) bits.push(value >>> i & 1);
+  };
+  append(4, 4);
+  append(bytes.length, version <= 9 ? 8 : 16);
+  for (const b of bytes) append(b, 8);
+  const capacity = dataCodewords(version, level) * 8;
+  append(0, Math.min(4, capacity - bits.length));
+  append(0, (8 - bits.length % 8) % 8);
+  for (let pad = 236; bits.length < capacity; pad ^= 236 ^ 17) append(pad, 8);
+  const data = [];
+  for (let i = 0; i < bits.length; i += 8) {
+    let byte = 0;
+    for (let j = 0; j < 8; j++) byte = byte << 1 | bits[i + j];
+    data.push(byte);
+  }
+  const grid = new Grid(version, LEVELS[level]);
+  grid.drawFunctionPatterns();
+  grid.drawCodewords(interleaveWithEcc(data, version, level));
+  let bestMask = 0;
+  let bestPenalty = Infinity;
+  for (let mask = 0; mask < 8; mask++) {
+    grid.applyMask(mask);
+    grid.drawFormatBits(mask);
+    const penalty = grid.penalty();
+    if (penalty < bestPenalty) {
+      bestMask = mask;
+      bestPenalty = penalty;
+    }
+    grid.applyMask(mask);
+  }
+  grid.applyMask(bestMask);
+  grid.drawFormatBits(bestMask);
+  return {
+    version,
+    size: grid.size,
+    errorCorrection: LEVELS[level],
+    mask: bestMask,
+    modules: grid.modules
+  };
+}
+function rawDataModules(version) {
+  let result = (16 * version + 128) * version + 64;
+  if (version >= 2) {
+    const numAlign = Math.floor(version / 7) + 2;
+    result -= (25 * numAlign - 10) * numAlign - 55;
+    if (version >= 7) result -= 36;
+  }
+  return result;
+}
+function dataCodewords(version, level) {
+  return Math.floor(rawDataModules(version) / 8) - ECC_CODEWORDS_PER_BLOCK[level][version] * NUM_ERROR_CORRECTION_BLOCKS[level][version];
+}
+function interleaveWithEcc(data, version, level) {
+  const numBlocks = NUM_ERROR_CORRECTION_BLOCKS[level][version];
+  const eccLen = ECC_CODEWORDS_PER_BLOCK[level][version];
+  const rawCodewords = Math.floor(rawDataModules(version) / 8);
+  const numShortBlocks = numBlocks - rawCodewords % numBlocks;
+  const shortBlockLen = Math.floor(rawCodewords / numBlocks);
+  const divisor = reedSolomonDivisor(eccLen);
+  const blocks = [];
+  for (let i = 0, k = 0; i < numBlocks; i++) {
+    const block = data.slice(k, k + shortBlockLen - eccLen + (i < numShortBlocks ? 0 : 1));
+    k += block.length;
+    const ecc = reedSolomonRemainder(block, divisor);
+    if (i < numShortBlocks) block.push(0);
+    blocks.push(block.concat(ecc));
+  }
+  const result = [];
+  for (let i = 0; i < blocks[0].length; i++) {
+    blocks.forEach((block, j) => {
+      if (i !== shortBlockLen - eccLen || j >= numShortBlocks) result.push(block[i]);
+    });
+  }
+  return result;
+}
+function gfMultiply(x, y) {
+  let z = 0;
+  for (let i = 7; i >= 0; i--) {
+    z = z << 1 ^ (z >>> 7) * 285;
+    z ^= (y >>> i & 1) * x;
+  }
+  return z;
+}
+function reedSolomonDivisor(degree) {
+  const result = new Array(degree).fill(0);
+  result[degree - 1] = 1;
+  let root = 1;
+  for (let i = 0; i < degree; i++) {
+    for (let j = 0; j < degree; j++) {
+      result[j] = gfMultiply(result[j], root);
+      if (j + 1 < degree) result[j] ^= result[j + 1];
+    }
+    root = gfMultiply(root, 2);
+  }
+  return result;
+}
+function reedSolomonRemainder(data, divisor) {
+  const result = new Array(divisor.length).fill(0);
+  for (const b of data) {
+    const factor = b ^ result.shift();
+    result.push(0);
+    divisor.forEach((coef, i) => {
+      result[i] ^= gfMultiply(coef, factor);
+    });
+  }
+  return result;
+}
+const bit = (value, i) => (value >>> i & 1) !== 0;
+class Grid {
+  size;
+  modules;
+  reserved;
+  version;
+  level;
+  constructor(version, level) {
+    this.version = version;
+    this.level = level;
+    this.size = version * 4 + 17;
+    this.modules = Array.from({ length: this.size }, () => new Array(this.size).fill(false));
+    this.reserved = Array.from({ length: this.size }, () => new Array(this.size).fill(false));
+  }
+  set(x, y, dark) {
+    this.modules[y][x] = dark;
+    this.reserved[y][x] = true;
+  }
+  drawFunctionPatterns() {
+    const { size } = this;
+    for (let i = 0; i < size; i++) {
+      this.set(6, i, i % 2 === 0);
+      this.set(i, 6, i % 2 === 0);
+    }
+    this.drawFinder(3, 3);
+    this.drawFinder(size - 4, 3);
+    this.drawFinder(3, size - 4);
+    const align = this.alignmentPositions();
+    const n = align.length;
+    for (let i = 0; i < n; i++) {
+      for (let j = 0; j < n; j++) {
+        const corner = i === 0 && j === 0 || i === 0 && j === n - 1 || i === n - 1 && j === 0;
+        if (!corner) this.drawAlignment(align[i], align[j]);
+      }
+    }
+    this.drawFormatBits(0);
+    this.drawVersion();
+  }
+  drawFinder(x, y) {
+    for (let dy = -4; dy <= 4; dy++) {
+      for (let dx = -4; dx <= 4; dx++) {
+        const dist = Math.max(Math.abs(dx), Math.abs(dy));
+        const xx = x + dx;
+        const yy = y + dy;
+        if (xx >= 0 && xx < this.size && yy >= 0 && yy < this.size) {
+          this.set(xx, yy, dist !== 2 && dist !== 4);
+        }
+      }
+    }
+  }
+  drawAlignment(x, y) {
+    for (let dy = -2; dy <= 2; dy++) {
+      for (let dx = -2; dx <= 2; dx++) {
+        this.set(x + dx, y + dy, Math.max(Math.abs(dx), Math.abs(dy)) !== 1);
+      }
+    }
+  }
+  alignmentPositions() {
+    if (this.version === 1) return [];
+    const numAlign = Math.floor(this.version / 7) + 2;
+    const step = Math.floor((this.version * 8 + numAlign * 3 + 5) / (numAlign * 4 - 4)) * 2;
+    const result = [6];
+    for (let pos = this.size - 7; result.length < numAlign; pos -= step) result.splice(1, 0, pos);
+    return result;
+  }
+  drawFormatBits(mask) {
+    const data = FORMAT_BITS[this.level] << 3 | mask;
+    let rem = data;
+    for (let i = 0; i < 10; i++) rem = rem << 1 ^ (rem >>> 9) * 1335;
+    const bits = (data << 10 | rem) ^ 21522;
+    const { size } = this;
+    for (let i = 0; i <= 5; i++) this.set(8, i, bit(bits, i));
+    this.set(8, 7, bit(bits, 6));
+    this.set(8, 8, bit(bits, 7));
+    this.set(7, 8, bit(bits, 8));
+    for (let i = 9; i < 15; i++) this.set(14 - i, 8, bit(bits, i));
+    for (let i = 0; i < 8; i++) this.set(size - 1 - i, 8, bit(bits, i));
+    for (let i = 8; i < 15; i++) this.set(8, size - 15 + i, bit(bits, i));
+    this.set(8, size - 8, true);
+  }
+  drawVersion() {
+    if (this.version < 7) return;
+    let rem = this.version;
+    for (let i = 0; i < 12; i++) rem = rem << 1 ^ (rem >>> 11) * 7973;
+    const bits = this.version << 12 | rem;
+    for (let i = 0; i < 18; i++) {
+      const dark = bit(bits, i);
+      const a = this.size - 11 + i % 3;
+      const b = Math.floor(i / 3);
+      this.set(a, b, dark);
+      this.set(b, a, dark);
+    }
+  }
+  /** The zig-zag placement: two-module columns, right to left, alternating up and down. */
+  drawCodewords(data) {
+    const { size } = this;
+    let i = 0;
+    for (let right = size - 1; right >= 1; right -= 2) {
+      if (right === 6) right = 5;
+      for (let vert = 0; vert < size; vert++) {
+        for (let j = 0; j < 2; j++) {
+          const x = right - j;
+          const upward = (right + 1 & 2) === 0;
+          const y = upward ? size - 1 - vert : vert;
+          if (!this.reserved[y][x] && i < data.length * 8) {
+            this.modules[y][x] = bit(data[i >>> 3], 7 - (i & 7));
+            i++;
+          }
+        }
+      }
+    }
+  }
+  applyMask(mask) {
+    for (let y = 0; y < this.size; y++) {
+      for (let x = 0; x < this.size; x++) {
+        if (!this.reserved[y][x] && maskBit(mask, x, y)) this.modules[y][x] = !this.modules[y][x];
+      }
+    }
+  }
+  penalty() {
+    const { size, modules } = this;
+    let result = 0;
+    const line = (get) => {
+      for (let a = 0; a < size; a++) {
+        let runColor = false;
+        let run = 0;
+        const history = [0, 0, 0, 0, 0, 0, 0];
+        for (let b = 0; b < size; b++) {
+          if (get(a, b) === runColor) {
+            run++;
+            if (run === 5) result += 3;
+            else if (run > 5) result++;
+          } else {
+            this.addHistory(run, history);
+            if (!runColor) result += this.countFinderLike(history) * 40;
+            runColor = get(a, b);
+            run = 1;
+          }
+        }
+        if (runColor) {
+          this.addHistory(run, history);
+          run = 0;
+        }
+        this.addHistory(run + size, history);
+        result += this.countFinderLike(history) * 40;
+      }
+    };
+    line((y, x) => modules[y][x]);
+    line((x, y) => modules[y][x]);
+    for (let y = 0; y < size - 1; y++) {
+      for (let x = 0; x < size - 1; x++) {
+        const c = modules[y][x];
+        if (c === modules[y][x + 1] && c === modules[y + 1][x] && c === modules[y + 1][x + 1]) {
+          result += 3;
+        }
+      }
+    }
+    let dark = 0;
+    for (const row of modules) for (const m of row) if (m) dark++;
+    const total = size * size;
+    result += (Math.ceil(Math.abs(dark * 20 - total * 10) / total) - 1) * 10;
+    return result;
+  }
+  addHistory(run, history) {
+    if (history[0] === 0) run += this.size;
+    history.pop();
+    history.unshift(run);
+  }
+  countFinderLike(h) {
+    const n = h[1];
+    const core = n > 0 && h[2] === n && h[3] === n * 3 && h[4] === n && h[5] === n;
+    return (core && h[0] >= n * 4 && h[6] >= n ? 1 : 0) + (core && h[6] >= n * 4 && h[0] >= n ? 1 : 0);
+  }
+}
+function maskBit(mask, x, y) {
+  switch (mask) {
+    case 0:
+      return (x + y) % 2 === 0;
+    case 1:
+      return y % 2 === 0;
+    case 2:
+      return x % 3 === 0;
+    case 3:
+      return (x + y) % 3 === 0;
+    case 4:
+      return (Math.floor(x / 3) + Math.floor(y / 2)) % 2 === 0;
+    case 5:
+      return x * y % 2 + x * y % 3 === 0;
+    case 6:
+      return (x * y % 2 + x * y % 3) % 2 === 0;
+    default:
+      return ((x + y) % 2 + x * y % 3) % 2 === 0;
+  }
+}
+export {
+  encodeQr
+};
+//# sourceMappingURL=qr-encode.js.map

package/dist/lib/qr-encode.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/lib/qr-encode.ts"],"sourcesContent":["/**\n * A QR code encoder: text in, a square of dark / light modules out (ISO/IEC 18004).\n *\n * WHY IT IS IN THE KIT rather than a dependency. `TwoFactorSetting` needs one QR code —\n * an `otpauth://` URI, around 100–200 bytes — and every app that shows it was pulling\n * in `qrcode.react` plus `react-dom/server` to render that one code to a static SVG\n * string, then base64-encoding it so the kit could draw it back as an `<img>`.\n * A dependency here would land in all three apps whether they show 2FA or not; an\n * optional peer would mean a lazy import and a loading state for something that is\n * a few hundred lines of arithmetic. So it is those lines: pure, no imports, no module\n * state beyond two constant tables, safe under `sideEffects: false`, and\n * tree-shaken out of every app that never renders a {@link QrCode}.\n *\n * Scope, chosen for what the kit renders: BYTE mode only (UTF-8), all 40 versions,\n * all four error-correction levels, automatic version and mask selection. Numeric,\n * alphanumeric and Kanji modes are denser for their alphabets but would not shrink an\n * otpauth URI (lower-case letters are not in the alphanumeric set). The algorithm and\n * its penalty rules follow the reference implementation by Project Nayuki (MIT),\n * which is also what `qrcode.react` wraps — so for the same input, level and boost\n * the modules match that library's output exactly (the test suite pins a matrix).\n */\n\nexport type QrErrorCorrection = \"L\" | \"M\" | \"Q\" | \"H\";\n\nexport interface QrEncodeOptions {\n  /** How much of the code may be damaged and still read. Default `\"M\"` (~15 %). */\n  errorCorrection?: QrErrorCorrection;\n  /** Raise the level as far as the chosen version still fits, for free. Default true. */\n  boostErrorCorrection?: boolean;\n}\n\nexport interface QrMatrix {\n  /** 1–40. */\n  version: number;\n  /** Modules per side: `version * 4 + 17`. */\n  size: number;\n  /** The level actually used — higher than asked when boosted. */\n  errorCorrection: QrErrorCorrection;\n  /** 0–7. */\n  mask: number;\n  /** `modules[y][x]`, true = dark. No quiet zone: the renderer adds its own. */\n  modules: boolean[][];\n}\n\nconst LEVELS: QrErrorCorrection[] = [\"L\", \"M\", \"Q\", \"H\"];\n/** The two format-information bits per level (not in ordinal order: M is 00). */\nconst FORMAT_BITS: Record<QrErrorCorrection, number> = { L: 1, M: 0, Q: 3, H: 2 };\n\n// Index 0 is padding; rows are L, M, Q, H.\nconst ECC_CODEWORDS_PER_BLOCK: readonly (readonly number[])[] = [\n  [-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],\n  [-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28],\n  [-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],\n  [-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],\n];\nconst NUM_ERROR_CORRECTION_BLOCKS: readonly (readonly number[])[] = [\n  [-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25],\n  [-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49],\n  [-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68],\n  [-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81],\n];\n\n/** Encode `text` (as UTF-8 bytes). Throws a `RangeError` past version 40's capacity. */\nexport function encodeQr(text: string, options: QrEncodeOptions = {}): QrMatrix {\n  const bytes = Array.from(new TextEncoder().encode(text));\n  let level = LEVELS.indexOf(options.errorCorrection ?? \"M\");\n\n  // The smallest version that holds the data at the requested level.\n  let version = 1;\n  let usedBits: number;\n  for (; ; version++) {\n    const countBits = version <= 9 ? 8 : 16;\n    usedBits = bytes.length < 1 << countBits ? 4 + countBits + bytes.length * 8 : Infinity;\n    if (usedBits <= dataCodewords(version, level) * 8) break;\n    if (version >= 40) throw new RangeError(\"QR data too long\");\n  }\n  if (options.boostErrorCorrection ?? true) {\n    for (let higher = level + 1; higher < LEVELS.length; higher++) {\n      if (usedBits <= dataCodewords(version, higher) * 8) level = higher;\n    }\n  }\n\n  // Mode, count, data; then terminator, byte padding and the 0xEC/0x11 fill.\n  const bits: number[] = [];\n  const append = (value: number, length: number) => {\n    for (let i = length - 1; i >= 0; i--) bits.push((value >>> i) & 1);\n  };\n  append(0b0100, 4);\n  append(bytes.length, version <= 9 ? 8 : 16);\n  for (const b of bytes) append(b, 8);\n  const capacity = dataCodewords(version, level) * 8;\n  append(0, Math.min(4, capacity - bits.length));\n  append(0, (8 - (bits.length % 8)) % 8);\n  for (let pad = 0xec; bits.length < capacity; pad ^= 0xec ^ 0x11) append(pad, 8);\n\n  const data: number[] = [];\n  for (let i = 0; i < bits.length; i += 8) {\n    let byte = 0;\n    for (let j = 0; j < 8; j++) byte = (byte << 1) | bits[i + j];\n    data.push(byte);\n  }\n\n  const grid = new Grid(version, LEVELS[level]);\n  grid.drawFunctionPatterns();\n  grid.drawCodewords(interleaveWithEcc(data, version, level));\n\n  let bestMask = 0;\n  let bestPenalty = Infinity;\n  for (let mask = 0; mask < 8; mask++) {\n    grid.applyMask(mask);\n    grid.drawFormatBits(mask);\n    const penalty = grid.penalty();\n    if (penalty < bestPenalty) {\n      bestMask = mask;\n      bestPenalty = penalty;\n    }\n    grid.applyMask(mask); // XOR again undoes it\n  }\n  grid.applyMask(bestMask);\n  grid.drawFormatBits(bestMask);\n\n  return {\n    version,\n    size: grid.size,\n    errorCorrection: LEVELS[level],\n    mask: bestMask,\n    modules: grid.modules,\n  };\n}\n\nfunction rawDataModules(version: number): number {\n  let result = (16 * version + 128) * version + 64;\n  if (version >= 2) {\n    const numAlign = Math.floor(version / 7) + 2;\n    result -= (25 * numAlign - 10) * numAlign - 55;\n    if (version >= 7) result -= 36;\n  }\n  return result;\n}\n\nfunction dataCodewords(version: number, level: number): number {\n  return (\n    Math.floor(rawDataModules(version) / 8) -\n    ECC_CODEWORDS_PER_BLOCK[level][version] * NUM_ERROR_CORRECTION_BLOCKS[level][version]\n  );\n}\n\n/** Split into blocks, append each block's Reed–Solomon codewords, interleave. */\nfunction interleaveWithEcc(data: number[], version: number, level: number): number[] {\n  const numBlocks = NUM_ERROR_CORRECTION_BLOCKS[level][version];\n  const eccLen = ECC_CODEWORDS_PER_BLOCK[level][version];\n  const rawCodewords = Math.floor(rawDataModules(version) / 8);\n  const numShortBlocks = numBlocks - (rawCodewords % numBlocks);\n  const shortBlockLen = Math.floor(rawCodewords / numBlocks);\n  const divisor = reedSolomonDivisor(eccLen);\n\n  const blocks: number[][] = [];\n  for (let i = 0, k = 0; i < numBlocks; i++) {\n    const block = data.slice(k, k + shortBlockLen - eccLen + (i < numShortBlocks ? 0 : 1));\n    k += block.length;\n    const ecc = reedSolomonRemainder(block, divisor);\n    if (i < numShortBlocks) block.push(0); // placeholder, skipped below\n    blocks.push(block.concat(ecc));\n  }\n\n  const result: number[] = [];\n  for (let i = 0; i < blocks[0].length; i++) {\n    blocks.forEach((block, j) => {\n      if (i !== shortBlockLen - eccLen || j >= numShortBlocks) result.push(block[i]);\n    });\n  }\n  return result;\n}\n\nfunction gfMultiply(x: number, y: number): number {\n  let z = 0;\n  for (let i = 7; i >= 0; i--) {\n    z = (z << 1) ^ ((z >>> 7) * 0x11d);\n    z ^= ((y >>> i) & 1) * x;\n  }\n  return z;\n}\n\nfunction reedSolomonDivisor(degree: number): number[] {\n  const result = new Array<number>(degree).fill(0);\n  result[degree - 1] = 1;\n  let root = 1;\n  for (let i = 0; i < degree; i++) {\n    for (let j = 0; j < degree; j++) {\n      result[j] = gfMultiply(result[j], root);\n      if (j + 1 < degree) result[j] ^= result[j + 1];\n    }\n    root = gfMultiply(root, 0x02);\n  }\n  return result;\n}\n\nfunction reedSolomonRemainder(data: number[], divisor: number[]): number[] {\n  const result = new Array<number>(divisor.length).fill(0);\n  for (const b of data) {\n    const factor = b ^ (result.shift() as number);\n    result.push(0);\n    divisor.forEach((coef, i) => {\n      result[i] ^= gfMultiply(coef, factor);\n    });\n  }\n  return result;\n}\n\nconst bit = (value: number, i: number) => ((value >>> i) & 1) !== 0;\n\nclass Grid {\n  readonly size: number;\n  readonly modules: boolean[][];\n  private readonly reserved: boolean[][];\n  private readonly version: number;\n  private readonly level: QrErrorCorrection;\n\n  constructor(version: number, level: QrErrorCorrection) {\n    this.version = version;\n    this.level = level;\n    this.size = version * 4 + 17;\n    this.modules = Array.from({ length: this.size }, () => new Array<boolean>(this.size).fill(false));\n    this.reserved = Array.from({ length: this.size }, () => new Array<boolean>(this.size).fill(false));\n  }\n\n  private set(x: number, y: number, dark: boolean) {\n    this.modules[y][x] = dark;\n    this.reserved[y][x] = true;\n  }\n\n  drawFunctionPatterns() {\n    const { size } = this;\n    for (let i = 0; i < size; i++) {\n      this.set(6, i, i % 2 === 0);\n      this.set(i, 6, i % 2 === 0);\n    }\n    this.drawFinder(3, 3);\n    this.drawFinder(size - 4, 3);\n    this.drawFinder(3, size - 4);\n    const align = this.alignmentPositions();\n    const n = align.length;\n    for (let i = 0; i < n; i++) {\n      for (let j = 0; j < n; j++) {\n        const corner = (i === 0 && j === 0) || (i === 0 && j === n - 1) || (i === n - 1 && j === 0);\n        if (!corner) this.drawAlignment(align[i], align[j]);\n      }\n    }\n    this.drawFormatBits(0); // reserves the area; redrawn once the mask is chosen\n    this.drawVersion();\n  }\n\n  private drawFinder(x: number, y: number) {\n    for (let dy = -4; dy <= 4; dy++) {\n      for (let dx = -4; dx <= 4; dx++) {\n        const dist = Math.max(Math.abs(dx), Math.abs(dy));\n        const xx = x + dx;\n        const yy = y + dy;\n        if (xx >= 0 && xx < this.size && yy >= 0 && yy < this.size) {\n          this.set(xx, yy, dist !== 2 && dist !== 4);\n        }\n      }\n    }\n  }\n\n  private drawAlignment(x: number, y: number) {\n    for (let dy = -2; dy <= 2; dy++) {\n      for (let dx = -2; dx <= 2; dx++) {\n        this.set(x + dx, y + dy, Math.max(Math.abs(dx), Math.abs(dy)) !== 1);\n      }\n    }\n  }\n\n  private alignmentPositions(): number[] {\n    if (this.version === 1) return [];\n    const numAlign = Math.floor(this.version / 7) + 2;\n    const step = Math.floor((this.version * 8 + numAlign * 3 + 5) / (numAlign * 4 - 4)) * 2;\n    const result = [6];\n    for (let pos = this.size - 7; result.length < numAlign; pos -= step) result.splice(1, 0, pos);\n    return result;\n  }\n\n  drawFormatBits(mask: number) {\n    const data = (FORMAT_BITS[this.level] << 3) | mask;\n    let rem = data;\n    for (let i = 0; i < 10; i++) rem = (rem << 1) ^ ((rem >>> 9) * 0x537);\n    const bits = ((data << 10) | rem) ^ 0x5412;\n    const { size } = this;\n    for (let i = 0; i <= 5; i++) this.set(8, i, bit(bits, i));\n    this.set(8, 7, bit(bits, 6));\n    this.set(8, 8, bit(bits, 7));\n    this.set(7, 8, bit(bits, 8));\n    for (let i = 9; i < 15; i++) this.set(14 - i, 8, bit(bits, i));\n    for (let i = 0; i < 8; i++) this.set(size - 1 - i, 8, bit(bits, i));\n    for (let i = 8; i < 15; i++) this.set(8, size - 15 + i, bit(bits, i));\n    this.set(8, size - 8, true); // the always-dark module\n  }\n\n  private drawVersion() {\n    if (this.version < 7) return;\n    let rem = this.version;\n    for (let i = 0; i < 12; i++) rem = (rem << 1) ^ ((rem >>> 11) * 0x1f25);\n    const bits = (this.version << 12) | rem;\n    for (let i = 0; i < 18; i++) {\n      const dark = bit(bits, i);\n      const a = this.size - 11 + (i % 3);\n      const b = Math.floor(i / 3);\n      this.set(a, b, dark);\n      this.set(b, a, dark);\n    }\n  }\n\n  /** The zig-zag placement: two-module columns, right to left, alternating up and down. */\n  drawCodewords(data: number[]) {\n    const { size } = this;\n    let i = 0;\n    for (let right = size - 1; right >= 1; right -= 2) {\n      if (right === 6) right = 5; // skip the vertical timing column\n      for (let vert = 0; vert < size; vert++) {\n        for (let j = 0; j < 2; j++) {\n          const x = right - j;\n          const upward = ((right + 1) & 2) === 0;\n          const y = upward ? size - 1 - vert : vert;\n          if (!this.reserved[y][x] && i < data.length * 8) {\n            this.modules[y][x] = bit(data[i >>> 3], 7 - (i & 7));\n            i++;\n          }\n        }\n      }\n    }\n  }\n\n  applyMask(mask: number) {\n    for (let y = 0; y < this.size; y++) {\n      for (let x = 0; x < this.size; x++) {\n        if (!this.reserved[y][x] && maskBit(mask, x, y)) this.modules[y][x] = !this.modules[y][x];\n      }\n    }\n  }\n\n  penalty(): number {\n    const { size, modules } = this;\n    let result = 0;\n    const line = (get: (a: number, b: number) => boolean) => {\n      for (let a = 0; a < size; a++) {\n        let runColor = false;\n        let run = 0;\n        const history = [0, 0, 0, 0, 0, 0, 0];\n        for (let b = 0; b < size; b++) {\n          if (get(a, b) === runColor) {\n            run++;\n            if (run === 5) result += 3;\n            else if (run > 5) result++;\n          } else {\n            this.addHistory(run, history);\n            if (!runColor) result += this.countFinderLike(history) * 40;\n            runColor = get(a, b);\n            run = 1;\n          }\n        }\n        if (runColor) {\n          this.addHistory(run, history);\n          run = 0;\n        }\n        this.addHistory(run + size, history);\n        result += this.countFinderLike(history) * 40;\n      }\n    };\n    line((y, x) => modules[y][x]);\n    line((x, y) => modules[y][x]);\n\n    for (let y = 0; y < size - 1; y++) {\n      for (let x = 0; x < size - 1; x++) {\n        const c = modules[y][x];\n        if (c === modules[y][x + 1] && c === modules[y + 1][x] && c === modules[y + 1][x + 1]) {\n          result += 3;\n        }\n      }\n    }\n\n    let dark = 0;\n    for (const row of modules) for (const m of row) if (m) dark++;\n    const total = size * size;\n    result += (Math.ceil(Math.abs(dark * 20 - total * 10) / total) - 1) * 10;\n    return result;\n  }\n\n  private addHistory(run: number, history: number[]) {\n    if (history[0] === 0) run += this.size; // the light border before the first run\n    history.pop();\n    history.unshift(run);\n  }\n\n  private countFinderLike(h: number[]): number {\n    const n = h[1];\n    const core = n > 0 && h[2] === n && h[3] === n * 3 && h[4] === n && h[5] === n;\n    return (core && h[0] >= n * 4 && h[6] >= n ? 1 : 0) + (core && h[6] >= n * 4 && h[0] >= n ? 1 : 0);\n  }\n}\n\nfunction maskBit(mask: number, x: number, y: number): boolean {\n  switch (mask) {\n    case 0:\n      return (x + y) % 2 === 0;\n    case 1:\n      return y % 2 === 0;\n    case 2:\n      return x % 3 === 0;\n    case 3:\n      return (x + y) % 3 === 0;\n    case 4:\n      return (Math.floor(x / 3) + Math.floor(y / 2)) % 2 === 0;\n    case 5:\n      return ((x * y) % 2) + ((x * y) % 3) === 0;\n    case 6:\n      return (((x * y) % 2) + ((x * y) % 3)) % 2 === 0;\n    default:\n      return (((x + y) % 2) + ((x * y) % 3)) % 2 === 0;\n  }\n}\n"],"mappings":";AA4CA,MAAM,SAA8B,CAAC,KAAK,KAAK,KAAK,GAAG;AAEvD,MAAM,cAAiD,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE;AAGhF,MAAM,0BAA0D;AAAA,EAC9D,CAAC,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA,EAClK,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA,EACnK,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA,EACnK,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AACrK;AACA,MAAM,8BAA8D;AAAA,EAClE,CAAC,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA,EAC5I,CAAC,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA,EACrJ,CAAC,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA,EACxJ,CAAC,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAC3J;AAGO,SAAS,SAAS,MAAc,UAA2B,CAAC,GAAa;AAC9E,QAAM,QAAQ,MAAM,KAAK,IAAI,YAAY,EAAE,OAAO,IAAI,CAAC;AACvD,MAAI,QAAQ,OAAO,QAAQ,QAAQ,mBAAmB,GAAG;AAGzD,MAAI,UAAU;AACd,MAAI;AACJ,WAAS,WAAW;AAClB,UAAM,YAAY,WAAW,IAAI,IAAI;AACrC,eAAW,MAAM,SAAS,KAAK,YAAY,IAAI,YAAY,MAAM,SAAS,IAAI;AAC9E,QAAI,YAAY,cAAc,SAAS,KAAK,IAAI,EAAG;AACnD,QAAI,WAAW,GAAI,OAAM,IAAI,WAAW,kBAAkB;AAAA,EAC5D;AACA,MAAI,QAAQ,wBAAwB,MAAM;AACxC,aAAS,SAAS,QAAQ,GAAG,SAAS,OAAO,QAAQ,UAAU;AAC7D,UAAI,YAAY,cAAc,SAAS,MAAM,IAAI,EAAG,SAAQ;AAAA,IAC9D;AAAA,EACF;AAGA,QAAM,OAAiB,CAAC;AACxB,QAAM,SAAS,CAAC,OAAe,WAAmB;AAChD,aAAS,IAAI,SAAS,GAAG,KAAK,GAAG,IAAK,MAAK,KAAM,UAAU,IAAK,CAAC;AAAA,EACnE;AACA,SAAO,GAAQ,CAAC;AAChB,SAAO,MAAM,QAAQ,WAAW,IAAI,IAAI,EAAE;AAC1C,aAAW,KAAK,MAAO,QAAO,GAAG,CAAC;AAClC,QAAM,WAAW,cAAc,SAAS,KAAK,IAAI;AACjD,SAAO,GAAG,KAAK,IAAI,GAAG,WAAW,KAAK,MAAM,CAAC;AAC7C,SAAO,IAAI,IAAK,KAAK,SAAS,KAAM,CAAC;AACrC,WAAS,MAAM,KAAM,KAAK,SAAS,UAAU,OAAO,MAAO,GAAM,QAAO,KAAK,CAAC;AAE9E,QAAM,OAAiB,CAAC;AACxB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACvC,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,QAAQ,QAAQ,IAAK,KAAK,IAAI,CAAC;AAC3D,SAAK,KAAK,IAAI;AAAA,EAChB;AAEA,QAAM,OAAO,IAAI,KAAK,SAAS,OAAO,KAAK,CAAC;AAC5C,OAAK,qBAAqB;AAC1B,OAAK,cAAc,kBAAkB,MAAM,SAAS,KAAK,CAAC;AAE1D,MAAI,WAAW;AACf,MAAI,cAAc;AAClB,WAAS,OAAO,GAAG,OAAO,GAAG,QAAQ;AACnC,SAAK,UAAU,IAAI;AACnB,SAAK,eAAe,IAAI;AACxB,UAAM,UAAU,KAAK,QAAQ;AAC7B,QAAI,UAAU,aAAa;AACzB,iBAAW;AACX,oBAAc;AAAA,IAChB;AACA,SAAK,UAAU,IAAI;AAAA,EACrB;AACA,OAAK,UAAU,QAAQ;AACvB,OAAK,eAAe,QAAQ;AAE5B,SAAO;AAAA,IACL;AAAA,IACA,MAAM,KAAK;AAAA,IACX,iBAAiB,OAAO,KAAK;AAAA,IAC7B,MAAM;AAAA,IACN,SAAS,KAAK;AAAA,EAChB;AACF;AAEA,SAAS,eAAe,SAAyB;AAC/C,MAAI,UAAU,KAAK,UAAU,OAAO,UAAU;AAC9C,MAAI,WAAW,GAAG;AAChB,UAAM,WAAW,KAAK,MAAM,UAAU,CAAC,IAAI;AAC3C,eAAW,KAAK,WAAW,MAAM,WAAW;AAC5C,QAAI,WAAW,EAAG,WAAU;AAAA,EAC9B;AACA,SAAO;AACT;AAEA,SAAS,cAAc,SAAiB,OAAuB;AAC7D,SACE,KAAK,MAAM,eAAe,OAAO,IAAI,CAAC,IACtC,wBAAwB,KAAK,EAAE,OAAO,IAAI,4BAA4B,KAAK,EAAE,OAAO;AAExF;AAGA,SAAS,kBAAkB,MAAgB,SAAiB,OAAyB;AACnF,QAAM,YAAY,4BAA4B,KAAK,EAAE,OAAO;AAC5D,QAAM,SAAS,wBAAwB,KAAK,EAAE,OAAO;AACrD,QAAM,eAAe,KAAK,MAAM,eAAe,OAAO,IAAI,CAAC;AAC3D,QAAM,iBAAiB,YAAa,eAAe;AACnD,QAAM,gBAAgB,KAAK,MAAM,eAAe,SAAS;AACzD,QAAM,UAAU,mBAAmB,MAAM;AAEzC,QAAM,SAAqB,CAAC;AAC5B,WAAS,IAAI,GAAG,IAAI,GAAG,IAAI,WAAW,KAAK;AACzC,UAAM,QAAQ,KAAK,MAAM,GAAG,IAAI,gBAAgB,UAAU,IAAI,iBAAiB,IAAI,EAAE;AACrF,SAAK,MAAM;AACX,UAAM,MAAM,qBAAqB,OAAO,OAAO;AAC/C,QAAI,IAAI,eAAgB,OAAM,KAAK,CAAC;AACpC,WAAO,KAAK,MAAM,OAAO,GAAG,CAAC;AAAA,EAC/B;AAEA,QAAM,SAAmB,CAAC;AAC1B,WAAS,IAAI,GAAG,IAAI,OAAO,CAAC,EAAE,QAAQ,KAAK;AACzC,WAAO,QAAQ,CAAC,OAAO,MAAM;AAC3B,UAAI,MAAM,gBAAgB,UAAU,KAAK,eAAgB,QAAO,KAAK,MAAM,CAAC,CAAC;AAAA,IAC/E,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEA,SAAS,WAAW,GAAW,GAAmB;AAChD,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,QAAK,KAAK,KAAO,MAAM,KAAK;AAC5B,UAAO,MAAM,IAAK,KAAK;AAAA,EACzB;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,QAA0B;AACpD,QAAM,SAAS,IAAI,MAAc,MAAM,EAAE,KAAK,CAAC;AAC/C,SAAO,SAAS,CAAC,IAAI;AACrB,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAO,CAAC,IAAI,WAAW,OAAO,CAAC,GAAG,IAAI;AACtC,UAAI,IAAI,IAAI,OAAQ,QAAO,CAAC,KAAK,OAAO,IAAI,CAAC;AAAA,IAC/C;AACA,WAAO,WAAW,MAAM,CAAI;AAAA,EAC9B;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,MAAgB,SAA6B;AACzE,QAAM,SAAS,IAAI,MAAc,QAAQ,MAAM,EAAE,KAAK,CAAC;AACvD,aAAW,KAAK,MAAM;AACpB,UAAM,SAAS,IAAK,OAAO,MAAM;AACjC,WAAO,KAAK,CAAC;AACb,YAAQ,QAAQ,CAAC,MAAM,MAAM;AAC3B,aAAO,CAAC,KAAK,WAAW,MAAM,MAAM;AAAA,IACtC,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEA,MAAM,MAAM,CAAC,OAAe,OAAgB,UAAU,IAAK,OAAO;AAElE,MAAM,KAAK;AAAA,EACA;AAAA,EACA;AAAA,EACQ;AAAA,EACA;AAAA,EACA;AAAA,EAEjB,YAAY,SAAiB,OAA0B;AACrD,SAAK,UAAU;AACf,SAAK,QAAQ;AACb,SAAK,OAAO,UAAU,IAAI;AAC1B,SAAK,UAAU,MAAM,KAAK,EAAE,QAAQ,KAAK,KAAK,GAAG,MAAM,IAAI,MAAe,KAAK,IAAI,EAAE,KAAK,KAAK,CAAC;AAChG,SAAK,WAAW,MAAM,KAAK,EAAE,QAAQ,KAAK,KAAK,GAAG,MAAM,IAAI,MAAe,KAAK,IAAI,EAAE,KAAK,KAAK,CAAC;AAAA,EACnG;AAAA,EAEQ,IAAI,GAAW,GAAW,MAAe;AAC/C,SAAK,QAAQ,CAAC,EAAE,CAAC,IAAI;AACrB,SAAK,SAAS,CAAC,EAAE,CAAC,IAAI;AAAA,EACxB;AAAA,EAEA,uBAAuB;AACrB,UAAM,EAAE,KAAK,IAAI;AACjB,aAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,WAAK,IAAI,GAAG,GAAG,IAAI,MAAM,CAAC;AAC1B,WAAK,IAAI,GAAG,GAAG,IAAI,MAAM,CAAC;AAAA,IAC5B;AACA,SAAK,WAAW,GAAG,CAAC;AACpB,SAAK,WAAW,OAAO,GAAG,CAAC;AAC3B,SAAK,WAAW,GAAG,OAAO,CAAC;AAC3B,UAAM,QAAQ,KAAK,mBAAmB;AACtC,UAAM,IAAI,MAAM;AAChB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAM,SAAU,MAAM,KAAK,MAAM,KAAO,MAAM,KAAK,MAAM,IAAI,KAAO,MAAM,IAAI,KAAK,MAAM;AACzF,YAAI,CAAC,OAAQ,MAAK,cAAc,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,MACpD;AAAA,IACF;AACA,SAAK,eAAe,CAAC;AACrB,SAAK,YAAY;AAAA,EACnB;AAAA,EAEQ,WAAW,GAAW,GAAW;AACvC,aAAS,KAAK,IAAI,MAAM,GAAG,MAAM;AAC/B,eAAS,KAAK,IAAI,MAAM,GAAG,MAAM;AAC/B,cAAM,OAAO,KAAK,IAAI,KAAK,IAAI,EAAE,GAAG,KAAK,IAAI,EAAE,CAAC;AAChD,cAAM,KAAK,IAAI;AACf,cAAM,KAAK,IAAI;AACf,YAAI,MAAM,KAAK,KAAK,KAAK,QAAQ,MAAM,KAAK,KAAK,KAAK,MAAM;AAC1D,eAAK,IAAI,IAAI,IAAI,SAAS,KAAK,SAAS,CAAC;AAAA,QAC3C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,cAAc,GAAW,GAAW;AAC1C,aAAS,KAAK,IAAI,MAAM,GAAG,MAAM;AAC/B,eAAS,KAAK,IAAI,MAAM,GAAG,MAAM;AAC/B,aAAK,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,EAAE,GAAG,KAAK,IAAI,EAAE,CAAC,MAAM,CAAC;AAAA,MACrE;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,qBAA+B;AACrC,QAAI,KAAK,YAAY,EAAG,QAAO,CAAC;AAChC,UAAM,WAAW,KAAK,MAAM,KAAK,UAAU,CAAC,IAAI;AAChD,UAAM,OAAO,KAAK,OAAO,KAAK,UAAU,IAAI,WAAW,IAAI,MAAM,WAAW,IAAI,EAAE,IAAI;AACtF,UAAM,SAAS,CAAC,CAAC;AACjB,aAAS,MAAM,KAAK,OAAO,GAAG,OAAO,SAAS,UAAU,OAAO,KAAM,QAAO,OAAO,GAAG,GAAG,GAAG;AAC5F,WAAO;AAAA,EACT;AAAA,EAEA,eAAe,MAAc;AAC3B,UAAM,OAAQ,YAAY,KAAK,KAAK,KAAK,IAAK;AAC9C,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,IAAI,IAAK,OAAO,OAAO,KAAO,QAAQ,KAAK;AAC/D,UAAM,QAAS,QAAQ,KAAM,OAAO;AACpC,UAAM,EAAE,KAAK,IAAI;AACjB,aAAS,IAAI,GAAG,KAAK,GAAG,IAAK,MAAK,IAAI,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC;AACxD,SAAK,IAAI,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC;AAC3B,SAAK,IAAI,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC;AAC3B,SAAK,IAAI,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC;AAC3B,aAAS,IAAI,GAAG,IAAI,IAAI,IAAK,MAAK,IAAI,KAAK,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC;AAC7D,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,MAAK,IAAI,OAAO,IAAI,GAAG,GAAG,IAAI,MAAM,CAAC,CAAC;AAClE,aAAS,IAAI,GAAG,IAAI,IAAI,IAAK,MAAK,IAAI,GAAG,OAAO,KAAK,GAAG,IAAI,MAAM,CAAC,CAAC;AACpE,SAAK,IAAI,GAAG,OAAO,GAAG,IAAI;AAAA,EAC5B;AAAA,EAEQ,cAAc;AACpB,QAAI,KAAK,UAAU,EAAG;AACtB,QAAI,MAAM,KAAK;AACf,aAAS,IAAI,GAAG,IAAI,IAAI,IAAK,OAAO,OAAO,KAAO,QAAQ,MAAM;AAChE,UAAM,OAAQ,KAAK,WAAW,KAAM;AACpC,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,YAAM,OAAO,IAAI,MAAM,CAAC;AACxB,YAAM,IAAI,KAAK,OAAO,KAAM,IAAI;AAChC,YAAM,IAAI,KAAK,MAAM,IAAI,CAAC;AAC1B,WAAK,IAAI,GAAG,GAAG,IAAI;AACnB,WAAK,IAAI,GAAG,GAAG,IAAI;AAAA,IACrB;AAAA,EACF;AAAA;AAAA,EAGA,cAAc,MAAgB;AAC5B,UAAM,EAAE,KAAK,IAAI;AACjB,QAAI,IAAI;AACR,aAAS,QAAQ,OAAO,GAAG,SAAS,GAAG,SAAS,GAAG;AACjD,UAAI,UAAU,EAAG,SAAQ;AACzB,eAAS,OAAO,GAAG,OAAO,MAAM,QAAQ;AACtC,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,gBAAM,IAAI,QAAQ;AAClB,gBAAM,UAAW,QAAQ,IAAK,OAAO;AACrC,gBAAM,IAAI,SAAS,OAAO,IAAI,OAAO;AACrC,cAAI,CAAC,KAAK,SAAS,CAAC,EAAE,CAAC,KAAK,IAAI,KAAK,SAAS,GAAG;AAC/C,iBAAK,QAAQ,CAAC,EAAE,CAAC,IAAI,IAAI,KAAK,MAAM,CAAC,GAAG,KAAK,IAAI,EAAE;AACnD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,UAAU,MAAc;AACtB,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,eAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,YAAI,CAAC,KAAK,SAAS,CAAC,EAAE,CAAC,KAAK,QAAQ,MAAM,GAAG,CAAC,EAAG,MAAK,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC;AAAA,MAC1F;AAAA,IACF;AAAA,EACF;AAAA,EAEA,UAAkB;AAChB,UAAM,EAAE,MAAM,QAAQ,IAAI;AAC1B,QAAI,SAAS;AACb,UAAM,OAAO,CAAC,QAA2C;AACvD,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,YAAI,WAAW;AACf,YAAI,MAAM;AACV,cAAM,UAAU,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACpC,iBAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,cAAI,IAAI,GAAG,CAAC,MAAM,UAAU;AAC1B;AACA,gBAAI,QAAQ,EAAG,WAAU;AAAA,qBAChB,MAAM,EAAG;AAAA,UACpB,OAAO;AACL,iBAAK,WAAW,KAAK,OAAO;AAC5B,gBAAI,CAAC,SAAU,WAAU,KAAK,gBAAgB,OAAO,IAAI;AACzD,uBAAW,IAAI,GAAG,CAAC;AACnB,kBAAM;AAAA,UACR;AAAA,QACF;AACA,YAAI,UAAU;AACZ,eAAK,WAAW,KAAK,OAAO;AAC5B,gBAAM;AAAA,QACR;AACA,aAAK,WAAW,MAAM,MAAM,OAAO;AACnC,kBAAU,KAAK,gBAAgB,OAAO,IAAI;AAAA,MAC5C;AAAA,IACF;AACA,SAAK,CAAC,GAAG,MAAM,QAAQ,CAAC,EAAE,CAAC,CAAC;AAC5B,SAAK,CAAC,GAAG,MAAM,QAAQ,CAAC,EAAE,CAAC,CAAC;AAE5B,aAAS,IAAI,GAAG,IAAI,OAAO,GAAG,KAAK;AACjC,eAAS,IAAI,GAAG,IAAI,OAAO,GAAG,KAAK;AACjC,cAAM,IAAI,QAAQ,CAAC,EAAE,CAAC;AACtB,YAAI,MAAM,QAAQ,CAAC,EAAE,IAAI,CAAC,KAAK,MAAM,QAAQ,IAAI,CAAC,EAAE,CAAC,KAAK,MAAM,QAAQ,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG;AACrF,oBAAU;AAAA,QACZ;AAAA,MACF;AAAA,IACF;AAEA,QAAI,OAAO;AACX,eAAW,OAAO,QAAS,YAAW,KAAK,IAAK,KAAI,EAAG;AACvD,UAAM,QAAQ,OAAO;AACrB,eAAW,KAAK,KAAK,KAAK,IAAI,OAAO,KAAK,QAAQ,EAAE,IAAI,KAAK,IAAI,KAAK;AACtE,WAAO;AAAA,EACT;AAAA,EAEQ,WAAW,KAAa,SAAmB;AACjD,QAAI,QAAQ,CAAC,MAAM,EAAG,QAAO,KAAK;AAClC,YAAQ,IAAI;AACZ,YAAQ,QAAQ,GAAG;AAAA,EACrB;AAAA,EAEQ,gBAAgB,GAAqB;AAC3C,UAAM,IAAI,EAAE,CAAC;AACb,UAAM,OAAO,IAAI,KAAK,EAAE,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM;AAC7E,YAAQ,QAAQ,EAAE,CAAC,KAAK,IAAI,KAAK,EAAE,CAAC,KAAK,IAAI,IAAI,MAAM,QAAQ,EAAE,CAAC,KAAK,IAAI,KAAK,EAAE,CAAC,KAAK,IAAI,IAAI;AAAA,EAClG;AACF;AAEA,SAAS,QAAQ,MAAc,GAAW,GAAoB;AAC5D,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,cAAQ,IAAI,KAAK,MAAM;AAAA,IACzB,KAAK;AACH,aAAO,IAAI,MAAM;AAAA,IACnB,KAAK;AACH,aAAO,IAAI,MAAM;AAAA,IACnB,KAAK;AACH,cAAQ,IAAI,KAAK,MAAM;AAAA,IACzB,KAAK;AACH,cAAQ,KAAK,MAAM,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,MAAM;AAAA,IACzD,KAAK;AACH,aAAS,IAAI,IAAK,IAAO,IAAI,IAAK,MAAO;AAAA,IAC3C,KAAK;AACH,cAAU,IAAI,IAAK,IAAO,IAAI,IAAK,KAAM,MAAM;AAAA,IACjD;AACE,eAAU,IAAI,KAAK,IAAO,IAAI,IAAK,KAAM,MAAM;AAAA,EACnD;AACF;","names":[]}

package/dist/rhf/fields.d.ts

@@ -0,0 +1,241 @@
+import * as react from 'react';
+import { ReactNode, ReactElement } from 'react';
+import { FieldValues, FieldPath, ControllerProps, ControllerRenderProps, ControllerFieldState } from 'react-hook-form';
+import { aH as SelectProps, aw as InputProps, aQ as TextareaProps } from '../kit-labels-v3biUF1L.js';
+import { NumberFieldProps } from '../components/number-field.js';
+import { DatePickerProps } from '../components/date-picker.js';
+import { CheckboxProps } from '../components/checkbox.js';
+import { EntityComboboxProps } from '../components/entity-combobox.js';
+import { ComboboxProps } from '../components/combobox.js';
+import { ComboClearValue } from '../components/combobox-core.js';
+import '../components/data-table-labels.js';
+import '../components/mini-calendar.js';
+import '../components/calendar-heatmap.js';
+import '../components/popover.js';
+import '../components/chip.js';
+import 'lucide-react';
+import '../components/field-sync.js';
+import '../components/tooltip.js';
+import '../hooks/use-anchored-rect.js';
+import '../lib/clipping.js';
+import '../wizard/types.js';
+import '../tour/tour.js';
+import '../search/command-palette.js';
+import '../search/global-search.js';
+import '../search/search-index.js';
+import '../components/month-picker.js';
+import '../components/page-contents.js';
+import '../components/series-chart-labels.js';
+import '../components/pie-chart-labels.js';
+import '../components/sparkline.js';
+import '../components/stat-tile.js';
+import '../components/signature-pad.js';
+import '../components/password-strength.js';
+import '../components/danger-confirm.js';
+import '../components/swatch-picker.js';
+import '../components/tile-radio.js';
+import '../components/icon-picker.js';
+import '../components/dialog-frame.js';
+import '../components/modal.js';
+import '../hooks/use-search-param-state.js';
+import '../components/measured-grid.js';
+import '../feedback/feedback-attachment.js';
+import '../feedback/feedback-dialog.js';
+import '../feedback/feedback-thread.js';
+import '../feedback/feedback-inbox.js';
+import '../components/account-settings-labels.js';
+import '../components/confirm-dialog.js';
+import '../components/floating-panel.js';
+import '../components/bulk-action-bar.js';
+import '../components/list.js';
+import '../components/breadcrumbs.js';
+import '../components/toast.js';
+import '../components/description-list.js';
+import '../components/line-items.js';
+import '../components/progress-bar.js';
+import '../components/signed-amount.js';
+import '../components/error-boundary.js';
+import '../components/authed-image.js';
+import '../hooks/use-authed-src.js';
+import '../components/image-grid.js';
+import '../components/lightbox.js';
+import '../components/number-input.js';
+import '../components/calculator.js';
+import '../components/numpad-sheet.js';
+import '../hooks/use-anchored-panel.js';
+
+/** What every bound field takes. */
+interface RhfFieldBaseProps<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues> {
+    name: TName;
+    /** `form.control`. Optional under `<Form {...form}>`; pass it to type-check `name`. */
+    control?: ControllerProps<TFieldValues, TName, TTransformed>["control"];
+    /** react-hook-form's `rules` (`required`, `min`, `validate` …). */
+    rules?: ControllerProps<TFieldValues, TName, TTransformed>["rules"];
+    /** A {@link FormLabel} above the field. Omitted: no label — name the control with
+     *  an `aria-label` instead. */
+    label?: ReactNode;
+    /** Standing advice under the field ("As printed on the card"), attached to the
+     *  control with `aria-describedby`. */
+    hint?: ReactNode;
+    /** Draws the label's required mark and sets `aria-required` where the control
+     *  takes it. Whether the field IS required is `rules`' or the resolver's to say. */
+    required?: boolean;
+    /** Disables the field — through react-hook-form, so its value is left out of the
+     *  submitted values as a disabled input's would be. */
+    disabled?: boolean;
+    /** Classes for the item's box (a `grid gap-1`). */
+    className?: string;
+}
+/** What {@link RhfField}'s `render` receives. */
+interface RhfFieldRenderContext<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>> {
+    field: ControllerRenderProps<TFieldValues, TName>;
+    fieldState: ControllerFieldState;
+    /** The field has an error: pass it to the control's `invalid` so it paints. */
+    invalid: boolean;
+    /** The error's message, if any. */
+    error: string | undefined;
+    /** The control's id, which the label points at. `FormControl` sets it on the
+     *  rendered element already; this is for a control that routes it elsewhere. */
+    id: string;
+    /** The label's id, for a control that is named with `aria-labelledby`. */
+    labelId: string;
+    /** The ids of the rendered hint and message, if any. */
+    describedBy: string | undefined;
+}
+interface RhfFieldProps<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues> extends RhfFieldBaseProps<TFieldValues, TName, TTransformed> {
+    /** The control. Wrapped in {@link FormControl} (its `id`, `aria-describedby` and
+     *  `aria-invalid`) unless `asControl` is false. */
+    render: (ctx: RhfFieldRenderContext<TFieldValues, TName>) => ReactElement;
+    /** `false`: render the control as is, for one that wires its own ids from the
+     *  context. Default `true`. */
+    asControl?: boolean;
+    /** `false`: no {@link FormMessage}, for a control that renders its own error (its
+     *  `error` prop). Default `true`. */
+    message?: boolean;
+    /** `false`: no {@link FormLabel}, for a control that carries its label itself (a
+     *  checkbox). Default `true`. */
+    showLabel?: boolean;
+}
+/**
+ * The shell every bound field is built on: label, control, hint and message around
+ * a `render` of your own.
+ *
+ * ```tsx
+ * <RhfField name="address" label="Address" render={({ field, invalid }) => (
+ *   <AddressAutocomplete value={field.value ?? ""} onChange={field.onChange} invalid={invalid} />
+ * )} />
+ * ```
+ */
+declare function RhfField<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues>({ name, control, rules, label, hint, required, disabled, className, render, asControl, message, showLabel, }: RhfFieldProps<TFieldValues, TName, TTransformed>): react.JSX.Element;
+type OwnInputProps = Omit<InputProps, "name" | "value" | "defaultValue" | "onChange" | "onBlur" | "ref" | "label" | "error" | "invalid" | "className" | "disabled" | "required">;
+type RhfTextFieldProps<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues> = RhfFieldBaseProps<TFieldValues, TName, TTransformed> & OwnInputProps;
+/** A text {@link Input} — `type` for email, tel, password, url. Stores the string. */
+declare function RhfTextField<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues>({ name, control, rules, label, hint, required, disabled, className, ...inputProps }: RhfTextFieldProps<TFieldValues, TName, TTransformed>): react.JSX.Element;
+type OwnTextareaProps = Omit<TextareaProps, "name" | "value" | "defaultValue" | "onChange" | "onBlur" | "ref" | "label" | "error" | "invalid" | "className" | "disabled" | "required"> & {
+    /** Classes for the `<textarea>`. */
+    inputClassName?: string;
+};
+type RhfTextareaProps<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues> = RhfFieldBaseProps<TFieldValues, TName, TTransformed> & OwnTextareaProps;
+/** A multi-line {@link Textarea}; takes `rows`. Stores the string. */
+declare function RhfTextarea<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues>({ name, control, rules, label, hint, required, disabled, className, inputClassName, ...areaProps }: RhfTextareaProps<TFieldValues, TName, TTransformed>): react.JSX.Element;
+type RhfNumberFieldProps<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues> = RhfFieldBaseProps<TFieldValues, TName, TTransformed> & Pick<NumberFieldProps, "digits" | "min" | "max" | "step" | "calculator" | "unit" | "unitPlacement" | "placeholder" | "inputClassName" | "locale" | "ariaLabel" | "autoFocus"> & {
+    /** What an emptied field stores. Default `null`; `""` for a schema written
+     *  against a native number input (`z.coerce.number()` over `""`). */
+    emptyValue?: null | "";
+    /** `false`: an emptied field snaps back to its last number instead of storing
+     *  `emptyValue`. Default `true`. */
+    nullable?: boolean;
+};
+/**
+ * The kit's {@link NumberField}: a parsed, rounded (`digits`) and clamped (`min` /
+ * `max`) number, committed on blur or Enter in the locale's decimal mark. Stores a
+ * number, or `emptyValue` when emptied.
+ */
+declare function RhfNumberField<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues>({ name, control, rules, label, hint, required, disabled, className, emptyValue, nullable, ...numberProps }: RhfNumberFieldProps<TFieldValues, TName, TTransformed>): react.JSX.Element;
+type RhfMoneyFieldProps<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues> = RhfFieldBaseProps<TFieldValues, TName, TTransformed> & {
+    placeholder?: string;
+    /** The currency chip's code ("CHF"). */
+    currency?: string;
+    /** Makes the chip a currency picker. Bind it to another field with
+     *  `useController`, or to state. */
+    onCurrencyChange?: (code: string) => void;
+    /** Colours the figure for the direction of money. */
+    tone?: "neutral" | "outflow" | "inflow";
+    align?: "start" | "center";
+    ariaLabel?: string;
+    autoFocus?: boolean;
+    /**
+     * What the form stores: `"number"` (default) — `12.5`, or `emptyValue` while the
+     * field is empty — or `"string"`, the field's own text ("12.50") for a schema that
+     * parses it itself. A half-typed sum ("12+") leaves the stored number as it was
+     * until it resolves.
+     */
+    valueAs?: "number" | "string";
+    /** What an emptied field stores when `valueAs` is `"number"`. Default `null`. */
+    emptyValue?: null | "";
+};
+/**
+ * The kit's {@link AmountInput}: a money figure with its currency chip and the
+ * calculator ("1200+80" resolves on blur or Enter). Stores a number by default — see
+ * `valueAs`.
+ */
+declare function RhfMoneyField<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues>({ name, control, rules, label, hint, required, disabled, className, ...amountProps }: RhfMoneyFieldProps<TFieldValues, TName, TTransformed>): react.JSX.Element;
+type RhfDateFieldProps<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues> = RhfFieldBaseProps<TFieldValues, TName, TTransformed> & Omit<DatePickerProps, "value" | "onChange" | "label" | "invalid" | "disabled" | "className" | "id"> & {
+    /** Classes for the picker. Default `w-full`. */
+    inputClassName?: string;
+    /** What a cleared date stores. Default `""`, the empty ISO string; `null` for a
+     *  nullable schema. */
+    emptyValue?: "" | null;
+};
+/** The kit's {@link DatePicker}, holding an ISO `"YYYY-MM-DD"` string. */
+declare function RhfDateField<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues>({ name, control, rules, label, hint, required, disabled, className, inputClassName, emptyValue, ...pickerProps }: RhfDateFieldProps<TFieldValues, TName, TTransformed>): react.JSX.Element;
+interface RhfSelectOption {
+    value: string | number;
+    label: ReactNode;
+    disabled?: boolean;
+}
+type RhfSelectProps<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues> = RhfFieldBaseProps<TFieldValues, TName, TTransformed> & Pick<SelectProps, "size" | "autoFocus" | "aria-label"> & {
+    /** The options, as data. Or pass `<option>` children. */
+    options?: readonly RhfSelectOption[];
+    children?: ReactNode;
+    /** A first, empty option ("Choose…"), selected while the value is empty. */
+    placeholder?: string;
+    /** Store `Number(value)` rather than the option's string. An empty choice still
+     *  stores `""`. */
+    valueAsNumber?: boolean;
+    /** Classes for the select. Default `w-full`. */
+    selectClassName?: string;
+};
+/** A native {@link Select}, from `options` or `<option>` children. */
+declare function RhfSelect<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues>({ name, control, rules, label, hint, required, disabled, className, options, children, placeholder, valueAsNumber, selectClassName, ...selectProps }: RhfSelectProps<TFieldValues, TName, TTransformed>): react.JSX.Element;
+type RhfCheckboxProps<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues> = RhfFieldBaseProps<TFieldValues, TName, TTransformed> & Pick<CheckboxProps, "inputClassName" | "autoFocus" | "aria-label">;
+/**
+ * The kit's {@link Checkbox}, label beside the box and `hint` under it (the
+ * checkbox's own `description`). Stores a boolean. `required` is the native one here
+ * — see Checkbox — so a `<form>` refuses to submit it unticked.
+ */
+declare function RhfCheckbox<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues>({ name, control, rules, label, hint, required, disabled, className, ...boxProps }: RhfCheckboxProps<TFieldValues, TName, TTransformed>): react.JSX.Element;
+type RhfComboboxProps<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, V extends string | number = string | number, TTransformed = TFieldValues> = RhfFieldBaseProps<TFieldValues, TName, TTransformed> & Pick<EntityComboboxProps<V>, "options" | "loadOptions" | "loading" | "placeholder" | "searchPlaceholder" | "emptyLabel" | "clearable" | "clearLabel" | "onCreate" | "createLabel" | "filter" | "minChars" | "debounceMs"> & {
+    /** What a clear stores — the picker's `clearValue`. Default `null`; `""` for a
+     *  schema that spells "no choice" as an empty string. */
+    clearValue?: ComboClearValue;
+    /** Classes for the picker. */
+    comboClassName?: string;
+};
+/**
+ * The kit's {@link EntityCombobox}: an id-keyed pick from `options` or `loadOptions`.
+ * Stores the option's `value`, or `clearValue` on a clear (only offered with
+ * `clearable`).
+ */
+declare function RhfCombobox<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, V extends string | number = string | number, TTransformed = TFieldValues>({ name, control, rules, label, hint, required, disabled, className, clearValue, comboClassName, ...comboProps }: RhfComboboxProps<TFieldValues, TName, V, TTransformed>): react.JSX.Element;
+type RhfTextComboboxProps<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues> = RhfFieldBaseProps<TFieldValues, TName, TTransformed> & Pick<ComboboxProps, "options" | "placeholder" | "groupBy" | "maxSuggestions" | "searchPlaceholder" | "createLabel" | "optionAdornment" | "autoFocus" | "aria-label"> & {
+    /** Classes for the combobox. */
+    comboClassName?: string;
+};
+/**
+ * The kit's free-text {@link Combobox}: type anything, or pick one of `options`.
+ * Stores the string.
+ */
+declare function RhfTextCombobox<TFieldValues extends FieldValues = FieldValues, TName extends FieldPath<TFieldValues> = FieldPath<TFieldValues>, TTransformed = TFieldValues>({ name, control, rules, label, hint, required, disabled, className, comboClassName, ...comboProps }: RhfTextComboboxProps<TFieldValues, TName, TTransformed>): react.JSX.Element;
+
+export { RhfCheckbox, type RhfCheckboxProps, RhfCombobox, type RhfComboboxProps, RhfDateField, type RhfDateFieldProps, RhfField, type RhfFieldBaseProps, type RhfFieldProps, type RhfFieldRenderContext, RhfMoneyField, type RhfMoneyFieldProps, RhfNumberField, type RhfNumberFieldProps, RhfSelect, type RhfSelectOption, type RhfSelectProps, RhfTextCombobox, type RhfTextComboboxProps, RhfTextField, type RhfTextFieldProps, RhfTextarea, type RhfTextareaProps };