@eifi1/ui-kit 0.51.4 → 0.51.6

package/dist/lib/phone.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/lib/phone.ts"],"sourcesContent":["/**\n * Phone numbers — E.164 in, grouped out — for kastlan's contacts, without a\n * libphonenumber dependency.\n *\n * kastlan stored whatever was typed (\"079 …\", \"+41 (0)79 …\", \"0041 79 …\") and could\n * neither dial nor de-duplicate it. What it needs is one canonical form to store —\n * E.164, \"+41210000001\" — and a readable one to show. libphonenumber gets both right\n * for every country, at ~150 kB of metadata in every app's bundle; the kit's apps are\n * Swiss and their neighbours, so this is **light per-country rules** for the six that\n * matter and a generic shape check for the rest:\n *\n *  - **CH, LI, DE, AT, FR, IT**: the national trunk prefix is dropped (a leading 0 —\n *    but NOT for Italy, whose fixed-line numbers keep their 0 after +39, and not for\n *    Liechtenstein, which has none), and the remaining national number has to be a\n *    plausible length for the country.\n *  - **Anything else** typed with its own \"+\" (or \"00\"): the digits, 8 to 15 in all,\n *    are taken as an E.164 number as they stand.\n *\n * **The limitation:** a plausible length is not a valid number. There is no check of\n * area codes or number ranges, so a well-formed number that does not exist passes, and\n * a German or Austrian number (whose area codes run from one to five digits) is\n * grouped only where the split is known (mobile prefixes, the largest cities) and\n * otherwise shown in one block. A number these rules cannot read is not an error —\n * {@link parsePhone} returns `null` and the field keeps the text as typed.\n */\n\n/** The countries with their own rules. */\nexport type PhoneCountryCode = \"CH\" | \"LI\" | \"DE\" | \"AT\" | \"FR\" | \"IT\";\n\n/** A country with rules, or `\"other\"`: a number typed with its own \"+\". */\nexport type PhoneCountry = PhoneCountryCode | \"other\";\n\ninterface CountryRule {\n  /** The country calling code, without the \"+\". */\n  dial: string;\n  /** A national number starts with a trunk 0 that is dropped after the country code. */\n  trunk: boolean;\n  /** The national significant number itself may start with 0 (Italy's fixed lines). */\n  zeroStart?: boolean;\n  /** The national significant number's length, inclusive. */\n  min: number;\n  max: number;\n  /** Groups for display, given the national significant number. */\n  group: (nsn: string) => string[];\n}\n\n/** `nsn` cut into the given sizes; whatever is left is one last group. */\nfunction cut(nsn: string, sizes: number[]): string[] {\n  const out: string[] = [];\n  let at = 0;\n  for (const size of sizes) {\n    if (at >= nsn.length) break;\n    out.push(nsn.slice(at, at + size));\n    at += size;\n  }\n  if (at < nsn.length) out.push(nsn.slice(at));\n  return out;\n}\n\nconst RULES: Record<PhoneCountryCode, CountryRule> = {\n  // 9 digits, 2-3-2-2 (\"21 000 00 01\"); the 08xx/09xx service numbers 3-3-3.\n  CH: {\n    dial: \"41\",\n    trunk: true,\n    min: 9,\n    max: 9,\n    group: (n) => (/^[89]/.test(n) ? cut(n, [3, 3, 3]) : cut(n, [2, 3, 2, 2])),\n  },\n  // 7 digits, 3-2-2 (\"100 00 01\"), and 9 for some mobile ranges (3-3-3). No trunk prefix.\n  LI: {\n    dial: \"423\",\n    trunk: false,\n    min: 7,\n    max: 9,\n    group: (n) => (n.length === 7 ? cut(n, [3, 2, 2]) : n.length === 9 ? cut(n, [3, 3, 3]) : [n]),\n  },\n  // Area codes of two to five digits: only the mobile prefixes and the four\n  // two-digit cities are split; anything else is one block rather than a wrong split.\n  DE: {\n    dial: \"49\",\n    trunk: true,\n    min: 6,\n    max: 13,\n    group: (n) =>\n      /^15/.test(n)\n        ? cut(n, [4])\n        : /^1[67]/.test(n)\n          ? cut(n, [3])\n          : /^(30|40|69|89)/.test(n)\n            ? cut(n, [2])\n            : [n],\n  },\n  // Vienna is \"1\"; mobile numbers start 6xx; other area codes vary, so one block.\n  AT: {\n    dial: \"43\",\n    trunk: true,\n    min: 6,\n    max: 13,\n    group: (n) => (/^6/.test(n) ? cut(n, [3]) : /^1/.test(n) ? cut(n, [1]) : [n]),\n  },\n  // 9 digits, 1-2-2-2-2 (\"1 99 00 00 01\").\n  FR: { dial: \"33\", trunk: true, min: 9, max: 9, group: (n) => cut(n, [1, 2, 2, 2, 2]) },\n  // The 0 of a fixed line is part of the number (\"+39 06 …\"); mobiles start with 3.\n  IT: {\n    dial: \"39\",\n    trunk: false,\n    zeroStart: true,\n    min: 6,\n    max: 11,\n    group: (n) => (/^3/.test(n) ? cut(n, [3, 3]) : /^0[26]/.test(n) ? cut(n, [2, 4]) : [n]),\n  },\n};\n\n/** The country calling codes with rules, \"+\" left off: `{ CH: \"41\", … }`. */\nexport const PHONE_DIAL_CODES: Readonly<Record<PhoneCountryCode, string>> = Object.freeze({\n  CH: RULES.CH.dial,\n  LI: RULES.LI.dial,\n  DE: RULES.DE.dial,\n  AT: RULES.AT.dial,\n  FR: RULES.FR.dial,\n  IT: RULES.IT.dial,\n});\n\n/** The countries with rules, in the order a picker offers them by default. */\nexport const PHONE_COUNTRIES: readonly PhoneCountryCode[] = Object.freeze([\"CH\", \"LI\", \"DE\", \"AT\", \"FR\", \"IT\"]);\n\n/** Longest dial code first, so \"+423\" is Liechtenstein before anything shorter. */\nconst BY_DIAL = [...PHONE_COUNTRIES].sort((a, b) => RULES[b].dial.length - RULES[a].dial.length);\n\n/** What {@link parsePhone} reads out of a number. */\nexport interface ParsedPhone {\n  /** The number in E.164: \"+\", the country code, the national number. */\n  e164: string;\n  /** The country whose rules read it, or `null` for a generic \"+…\" number. */\n  country: PhoneCountryCode | null;\n  /** The national significant number — the digits after the country code. For a\n   *  generic number, every digit after the \"+\" (the country code is not split off). */\n  national: string;\n}\n\n/** A national significant number that passes `rule`, or `null`. */\nfunction national(digits: string, rule: CountryRule): string | null {\n  const nsn = rule.trunk && digits.startsWith(\"0\") ? digits.slice(1) : digits;\n  // A national number starts with 0 only where 0 is part of it (Italy's fixed lines).\n  if (nsn.startsWith(\"0\") && !rule.zeroStart) return null;\n  if (nsn.length < rule.min || nsn.length > rule.max) return null;\n  return nsn;\n}\n\n/**\n * Read a typed number. With a leading \"+\" or \"00\" the number carries its own country\n * code — one of the six with rules, or any other (8–15 digits in all, the E.164\n * limit). Without one it is a national number of `country` (default `\"CH\"`), its\n * trunk 0 optional; with `country=\"other\"` a number without \"+\" cannot be read.\n *\n * Spaces, hyphens, dots, slashes and parentheses are ignored (\"(030) 1234567\"), and\n * so is the \"(0)\" of \"+41 (0)21 …\". Anything else — a letter, an extension (\"ext. 12\"), a note —\n * and the result is `null`: the text is not a number these rules can read, and a field\n * keeps it as it is rather than guess.\n */\nexport function parsePhone(input: string, country: PhoneCountry = \"CH\"): ParsedPhone | null {\n  const text = input.trim();\n  if (text === \"\" || !/^\\+?[\\d\\s().\\-/]+$/.test(text)) return null;\n  let digits = text.replace(/\\D/g, \"\");\n  let international = text.startsWith(\"+\");\n  if (!international && digits.startsWith(\"00\")) {\n    international = true;\n    digits = digits.slice(2);\n  }\n  if (international) {\n    // \"+41 (0)21 …\": the bracketed trunk prefix written for callers inside the country.\n    digits = text.replace(/\\(\\s*0\\s*\\)/g, \"\").replace(/\\D/g, \"\").replace(/^00/, \"\");\n    if (digits.startsWith(\"0\")) return null;\n    const known = BY_DIAL.find((c) => digits.startsWith(RULES[c].dial));\n    if (known) {\n      const rule = RULES[known];\n      const nsn = national(digits.slice(rule.dial.length), rule);\n      return nsn === null ? null : { e164: `+${rule.dial}${nsn}`, country: known, national: nsn };\n    }\n    if (digits.length < 8 || digits.length > 15) return null;\n    return { e164: `+${digits}`, country: null, national: digits };\n  }\n  if (country === \"other\") return null;\n  const rule = RULES[country];\n  const nsn = national(digits, rule);\n  return nsn === null ? null : { e164: `+${rule.dial}${nsn}`, country, national: nsn };\n}\n\n/** The national number grouped by its country's rules (\"21 000 00 01\"). */\nexport function formatNationalPhone(nsn: string, country: PhoneCountryCode): string {\n  return RULES[country].group(nsn).join(\" \");\n}\n\n/**\n * A number for display: an E.164 number (or anything {@link parsePhone} reads with a\n * \"+\") grouped by its country's rules — \"+41 21 000 00 01\" — and a generic one as\n * \"+\" and its digits. Anything it cannot read comes back exactly as it went in, so a\n * list of contacts can format every row without first sorting out the free text.\n */\nexport function formatPhone(value: string): string {\n  const parsed = value.trim().startsWith(\"+\") ? parsePhone(value, \"other\") : null;\n  if (!parsed) return value;\n  if (!parsed.country) return parsed.e164;\n  return `+${RULES[parsed.country].dial} ${formatNationalPhone(parsed.national, parsed.country)}`;\n}\n\n/** Whether `value` is in E.164 shape: \"+\" and 8–15 digits, nothing else. Shape only —\n *  what {@link PhoneInput} emits for every number it could read. */\nexport function isE164(value: string): boolean {\n  return /^\\+[1-9]\\d{7,14}$/.test(value);\n}\n"],"mappings":";AA+CA,SAAS,IAAI,KAAa,OAA2B;AACnD,QAAM,MAAgB,CAAC;AACvB,MAAI,KAAK;AACT,aAAW,QAAQ,OAAO;AACxB,QAAI,MAAM,IAAI,OAAQ;AACtB,QAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,CAAC;AACjC,UAAM;AAAA,EACR;AACA,MAAI,KAAK,IAAI,OAAQ,KAAI,KAAK,IAAI,MAAM,EAAE,CAAC;AAC3C,SAAO;AACT;AAEA,MAAM,QAA+C;AAAA;AAAA,EAEnD,IAAI;AAAA,IACF,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO,CAAC,MAAO,QAAQ,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;AAAA,EAC1E;AAAA;AAAA,EAEA,IAAI;AAAA,IACF,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO,CAAC,MAAO,EAAE,WAAW,IAAI,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,WAAW,IAAI,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AAAA,EAC7F;AAAA;AAAA;AAAA,EAGA,IAAI;AAAA,IACF,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO,CAAC,MACN,MAAM,KAAK,CAAC,IACR,IAAI,GAAG,CAAC,CAAC,CAAC,IACV,SAAS,KAAK,CAAC,IACb,IAAI,GAAG,CAAC,CAAC,CAAC,IACV,iBAAiB,KAAK,CAAC,IACrB,IAAI,GAAG,CAAC,CAAC,CAAC,IACV,CAAC,CAAC;AAAA,EACd;AAAA;AAAA,EAEA,IAAI;AAAA,IACF,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO,CAAC,MAAO,KAAK,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAAA,EAC7E;AAAA;AAAA,EAEA,IAAI,EAAE,MAAM,MAAM,OAAO,MAAM,KAAK,GAAG,KAAK,GAAG,OAAO,CAAC,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE;AAAA;AAAA,EAErF,IAAI;AAAA,IACF,MAAM;AAAA,IACN,OAAO;AAAA,IACP,WAAW;AAAA,IACX,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO,CAAC,MAAO,KAAK,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,SAAS,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AAAA,EACvF;AACF;AAGO,MAAM,mBAA+D,OAAO,OAAO;AAAA,EACxF,IAAI,MAAM,GAAG;AAAA,EACb,IAAI,MAAM,GAAG;AAAA,EACb,IAAI,MAAM,GAAG;AAAA,EACb,IAAI,MAAM,GAAG;AAAA,EACb,IAAI,MAAM,GAAG;AAAA,EACb,IAAI,MAAM,GAAG;AACf,CAAC;AAGM,MAAM,kBAA+C,OAAO,OAAO,CAAC,MAAM,MAAM,MAAM,MAAM,MAAM,IAAI,CAAC;AAG9G,MAAM,UAAU,CAAC,GAAG,eAAe,EAAE,KAAK,CAAC,GAAG,MAAM,MAAM,CAAC,EAAE,KAAK,SAAS,MAAM,CAAC,EAAE,KAAK,MAAM;AAc/F,SAAS,SAAS,QAAgB,MAAkC;AAClE,QAAM,MAAM,KAAK,SAAS,OAAO,WAAW,GAAG,IAAI,OAAO,MAAM,CAAC,IAAI;AAErE,MAAI,IAAI,WAAW,GAAG,KAAK,CAAC,KAAK,UAAW,QAAO;AACnD,MAAI,IAAI,SAAS,KAAK,OAAO,IAAI,SAAS,KAAK,IAAK,QAAO;AAC3D,SAAO;AACT;AAaO,SAAS,WAAW,OAAe,UAAwB,MAA0B;AAC1F,QAAM,OAAO,MAAM,KAAK;AACxB,MAAI,SAAS,MAAM,CAAC,qBAAqB,KAAK,IAAI,EAAG,QAAO;AAC5D,MAAI,SAAS,KAAK,QAAQ,OAAO,EAAE;AACnC,MAAI,gBAAgB,KAAK,WAAW,GAAG;AACvC,MAAI,CAAC,iBAAiB,OAAO,WAAW,IAAI,GAAG;AAC7C,oBAAgB;AAChB,aAAS,OAAO,MAAM,CAAC;AAAA,EACzB;AACA,MAAI,eAAe;AAEjB,aAAS,KAAK,QAAQ,gBAAgB,EAAE,EAAE,QAAQ,OAAO,EAAE,EAAE,QAAQ,OAAO,EAAE;AAC9E,QAAI,OAAO,WAAW,GAAG,EAAG,QAAO;AACnC,UAAM,QAAQ,QAAQ,KAAK,CAAC,MAAM,OAAO,WAAW,MAAM,CAAC,EAAE,IAAI,CAAC;AAClE,QAAI,OAAO;AACT,YAAMA,QAAO,MAAM,KAAK;AACxB,YAAMC,OAAM,SAAS,OAAO,MAAMD,MAAK,KAAK,MAAM,GAAGA,KAAI;AACzD,aAAOC,SAAQ,OAAO,OAAO,EAAE,MAAM,IAAID,MAAK,IAAI,GAAGC,IAAG,IAAI,SAAS,OAAO,UAAUA,KAAI;AAAA,IAC5F;AACA,QAAI,OAAO,SAAS,KAAK,OAAO,SAAS,GAAI,QAAO;AACpD,WAAO,EAAE,MAAM,IAAI,MAAM,IAAI,SAAS,MAAM,UAAU,OAAO;AAAA,EAC/D;AACA,MAAI,YAAY,QAAS,QAAO;AAChC,QAAM,OAAO,MAAM,OAAO;AAC1B,QAAM,MAAM,SAAS,QAAQ,IAAI;AACjC,SAAO,QAAQ,OAAO,OAAO,EAAE,MAAM,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI,SAAS,UAAU,IAAI;AACrF;AAGO,SAAS,oBAAoB,KAAa,SAAmC;AAClF,SAAO,MAAM,OAAO,EAAE,MAAM,GAAG,EAAE,KAAK,GAAG;AAC3C;AAQO,SAAS,YAAY,OAAuB;AACjD,QAAM,SAAS,MAAM,KAAK,EAAE,WAAW,GAAG,IAAI,WAAW,OAAO,OAAO,IAAI;AAC3E,MAAI,CAAC,OAAQ,QAAO;AACpB,MAAI,CAAC,OAAO,QAAS,QAAO,OAAO;AACnC,SAAO,IAAI,MAAM,OAAO,OAAO,EAAE,IAAI,IAAI,oBAAoB,OAAO,UAAU,OAAO,OAAO,CAAC;AAC/F;AAIO,SAAS,OAAO,OAAwB;AAC7C,SAAO,oBAAoB,KAAK,KAAK;AACvC;","names":["rule","nsn"]}
+{"version":3,"sources":["../../src/lib/phone.ts"],"sourcesContent":["/**\n * Phone numbers — E.164 in, grouped out — for kastlan's contacts, without a\n * libphonenumber dependency.\n *\n * kastlan stored whatever was typed (\"079 …\", \"+41 (0)79 …\", \"0041 79 …\") and could\n * neither dial nor de-duplicate it. What it needs is one canonical form to store —\n * E.164, \"+41210000001\" — and a readable one to show. libphonenumber gets both right\n * for every country, at ~150 kB of metadata in every app's bundle; the kit's apps are\n * Swiss and their neighbours, so this is **light per-country rules** for the six that\n * matter and a generic shape check for the rest:\n *\n *  - **CH, LI, DE, AT, FR, IT**: the national trunk prefix is dropped (a leading 0 —\n *    but NOT for Italy, whose fixed-line numbers keep their 0 after +39, and not for\n *    Liechtenstein, which has none), and the remaining national number has to be a\n *    plausible length for the country.\n *  - **Anything else** typed with its own \"+\" (or \"00\"): the digits, 8 to 15 in all,\n *    are taken as an E.164 number as they stand.\n *\n * **The limitation:** a plausible length is not a valid number. There is no check of\n * area codes or number ranges, so a well-formed number that does not exist passes, and\n * a German or Austrian number (whose area codes run from one to five digits) is\n * grouped only where the split is known (mobile prefixes, the largest cities) and\n * otherwise shown in one block. A number these rules cannot read is not an error —\n * {@link parsePhone} returns `null` and the field keeps the text as typed.\n */\n\n/** The countries with their own rules. */\nexport type PhoneCountryCode = \"CH\" | \"LI\" | \"DE\" | \"AT\" | \"FR\" | \"IT\";\n\n/** A country with rules, or `\"other\"`: a number typed with its own \"+\". */\nexport type PhoneCountry = PhoneCountryCode | \"other\";\n\ninterface CountryRule {\n  /** The country calling code, without the \"+\". */\n  dial: string;\n  /** A national number starts with a trunk 0 that is dropped after the country code. */\n  trunk: boolean;\n  /** The national significant number itself may start with 0 (Italy's fixed lines). */\n  zeroStart?: boolean;\n  /** The national significant number's length, inclusive. */\n  min: number;\n  max: number;\n  /** Groups for display, given the national significant number. */\n  group: (nsn: string) => string[];\n}\n\n/** `nsn` cut into the given sizes; whatever is left is one last group. */\nfunction cut(nsn: string, sizes: number[]): string[] {\n  const out: string[] = [];\n  let at = 0;\n  for (const size of sizes) {\n    if (at >= nsn.length) break;\n    out.push(nsn.slice(at, at + size));\n    at += size;\n  }\n  if (at < nsn.length) out.push(nsn.slice(at));\n  return out;\n}\n\nconst RULES: Record<PhoneCountryCode, CountryRule> = {\n  // 9 digits, 2-3-2-2 (\"21 000 00 01\"); the 08xx/09xx service numbers 3-3-3.\n  CH: {\n    dial: \"41\",\n    trunk: true,\n    min: 9,\n    max: 9,\n    group: (n) => (/^[89]/.test(n) ? cut(n, [3, 3, 3]) : cut(n, [2, 3, 2, 2])),\n  },\n  // 7 digits, 3-2-2 (\"100 00 01\"), and 9 for some mobile ranges (3-3-3). No trunk prefix.\n  LI: {\n    dial: \"423\",\n    trunk: false,\n    min: 7,\n    max: 9,\n    group: (n) => (n.length === 7 ? cut(n, [3, 2, 2]) : n.length === 9 ? cut(n, [3, 3, 3]) : [n]),\n  },\n  // Area codes of two to five digits: only the mobile prefixes and the four\n  // two-digit cities are split; anything else is one block rather than a wrong split.\n  DE: {\n    dial: \"49\",\n    trunk: true,\n    min: 6,\n    max: 13,\n    group: (n) =>\n      /^15/.test(n) ? cut(n, [4]) : /^1[67]/.test(n) ? cut(n, [3]) : /^(30|40|69|89)/.test(n) ? cut(n, [2]) : [n],\n  },\n  // Vienna is \"1\"; mobile numbers start 6xx; other area codes vary, so one block.\n  AT: {\n    dial: \"43\",\n    trunk: true,\n    min: 6,\n    max: 13,\n    group: (n) => (/^6/.test(n) ? cut(n, [3]) : /^1/.test(n) ? cut(n, [1]) : [n]),\n  },\n  // 9 digits, 1-2-2-2-2 (\"1 99 00 00 01\").\n  FR: { dial: \"33\", trunk: true, min: 9, max: 9, group: (n) => cut(n, [1, 2, 2, 2, 2]) },\n  // The 0 of a fixed line is part of the number (\"+39 06 …\"); mobiles start with 3.\n  IT: {\n    dial: \"39\",\n    trunk: false,\n    zeroStart: true,\n    min: 6,\n    max: 11,\n    group: (n) => (/^3/.test(n) ? cut(n, [3, 3]) : /^0[26]/.test(n) ? cut(n, [2, 4]) : [n]),\n  },\n};\n\n/** The country calling codes with rules, \"+\" left off: `{ CH: \"41\", … }`. */\nexport const PHONE_DIAL_CODES: Readonly<Record<PhoneCountryCode, string>> = Object.freeze({\n  CH: RULES.CH.dial,\n  LI: RULES.LI.dial,\n  DE: RULES.DE.dial,\n  AT: RULES.AT.dial,\n  FR: RULES.FR.dial,\n  IT: RULES.IT.dial,\n});\n\n/** The countries with rules, in the order a picker offers them by default. */\nexport const PHONE_COUNTRIES: readonly PhoneCountryCode[] = Object.freeze([\"CH\", \"LI\", \"DE\", \"AT\", \"FR\", \"IT\"]);\n\n/** Longest dial code first, so \"+423\" is Liechtenstein before anything shorter. */\nconst BY_DIAL = [...PHONE_COUNTRIES].sort((a, b) => RULES[b].dial.length - RULES[a].dial.length);\n\n/** What {@link parsePhone} reads out of a number. */\nexport interface ParsedPhone {\n  /** The number in E.164: \"+\", the country code, the national number. */\n  e164: string;\n  /** The country whose rules read it, or `null` for a generic \"+…\" number. */\n  country: PhoneCountryCode | null;\n  /** The national significant number — the digits after the country code. For a\n   *  generic number, every digit after the \"+\" (the country code is not split off). */\n  national: string;\n}\n\n/** A national significant number that passes `rule`, or `null`. */\nfunction national(digits: string, rule: CountryRule): string | null {\n  const nsn = rule.trunk && digits.startsWith(\"0\") ? digits.slice(1) : digits;\n  // A national number starts with 0 only where 0 is part of it (Italy's fixed lines).\n  if (nsn.startsWith(\"0\") && !rule.zeroStart) return null;\n  if (nsn.length < rule.min || nsn.length > rule.max) return null;\n  return nsn;\n}\n\n/**\n * Read a typed number. With a leading \"+\" or \"00\" the number carries its own country\n * code — one of the six with rules, or any other (8–15 digits in all, the E.164\n * limit). Without one it is a national number of `country` (default `\"CH\"`), its\n * trunk 0 optional; with `country=\"other\"` a number without \"+\" cannot be read.\n *\n * Spaces, hyphens, dots, slashes and parentheses are ignored (\"(030) 1234567\"), and\n * so is the \"(0)\" of \"+41 (0)21 …\". Anything else — a letter, an extension (\"ext. 12\"), a note —\n * and the result is `null`: the text is not a number these rules can read, and a field\n * keeps it as it is rather than guess.\n */\nexport function parsePhone(input: string, country: PhoneCountry = \"CH\"): ParsedPhone | null {\n  const text = input.trim();\n  if (text === \"\" || !/^\\+?[\\d\\s().\\-/]+$/.test(text)) return null;\n  let digits = text.replace(/\\D/g, \"\");\n  let international = text.startsWith(\"+\");\n  if (!international && digits.startsWith(\"00\")) {\n    international = true;\n    digits = digits.slice(2);\n  }\n  if (international) {\n    // \"+41 (0)21 …\": the bracketed trunk prefix written for callers inside the country.\n    digits = text\n      .replace(/\\(\\s*0\\s*\\)/g, \"\")\n      .replace(/\\D/g, \"\")\n      .replace(/^00/, \"\");\n    if (digits.startsWith(\"0\")) return null;\n    const known = BY_DIAL.find((c) => digits.startsWith(RULES[c].dial));\n    if (known) {\n      const rule = RULES[known];\n      const nsn = national(digits.slice(rule.dial.length), rule);\n      return nsn === null ? null : { e164: `+${rule.dial}${nsn}`, country: known, national: nsn };\n    }\n    if (digits.length < 8 || digits.length > 15) return null;\n    return { e164: `+${digits}`, country: null, national: digits };\n  }\n  if (country === \"other\") return null;\n  const rule = RULES[country];\n  const nsn = national(digits, rule);\n  return nsn === null ? null : { e164: `+${rule.dial}${nsn}`, country, national: nsn };\n}\n\n/** The national number grouped by its country's rules (\"21 000 00 01\"). */\nexport function formatNationalPhone(nsn: string, country: PhoneCountryCode): string {\n  return RULES[country].group(nsn).join(\" \");\n}\n\n/**\n * A number for display: an E.164 number (or anything {@link parsePhone} reads with a\n * \"+\") grouped by its country's rules — \"+41 21 000 00 01\" — and a generic one as\n * \"+\" and its digits. Anything it cannot read comes back exactly as it went in, so a\n * list of contacts can format every row without first sorting out the free text.\n */\nexport function formatPhone(value: string): string {\n  const parsed = value.trim().startsWith(\"+\") ? parsePhone(value, \"other\") : null;\n  if (!parsed) return value;\n  if (!parsed.country) return parsed.e164;\n  return `+${RULES[parsed.country].dial} ${formatNationalPhone(parsed.national, parsed.country)}`;\n}\n\n/** Whether `value` is in E.164 shape: \"+\" and 8–15 digits, nothing else. Shape only —\n *  what {@link PhoneInput} emits for every number it could read. */\nexport function isE164(value: string): boolean {\n  return /^\\+[1-9]\\d{7,14}$/.test(value);\n}\n"],"mappings":";AA+CA,SAAS,IAAI,KAAa,OAA2B;AACnD,QAAM,MAAgB,CAAC;AACvB,MAAI,KAAK;AACT,aAAW,QAAQ,OAAO;AACxB,QAAI,MAAM,IAAI,OAAQ;AACtB,QAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,CAAC;AACjC,UAAM;AAAA,EACR;AACA,MAAI,KAAK,IAAI,OAAQ,KAAI,KAAK,IAAI,MAAM,EAAE,CAAC;AAC3C,SAAO;AACT;AAEA,MAAM,QAA+C;AAAA;AAAA,EAEnD,IAAI;AAAA,IACF,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO,CAAC,MAAO,QAAQ,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;AAAA,EAC1E;AAAA;AAAA,EAEA,IAAI;AAAA,IACF,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO,CAAC,MAAO,EAAE,WAAW,IAAI,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,WAAW,IAAI,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AAAA,EAC7F;AAAA;AAAA;AAAA,EAGA,IAAI;AAAA,IACF,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO,CAAC,MACN,MAAM,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,SAAS,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,iBAAiB,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAAA,EAC9G;AAAA;AAAA,EAEA,IAAI;AAAA,IACF,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO,CAAC,MAAO,KAAK,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAAA,EAC7E;AAAA;AAAA,EAEA,IAAI,EAAE,MAAM,MAAM,OAAO,MAAM,KAAK,GAAG,KAAK,GAAG,OAAO,CAAC,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE;AAAA;AAAA,EAErF,IAAI;AAAA,IACF,MAAM;AAAA,IACN,OAAO;AAAA,IACP,WAAW;AAAA,IACX,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO,CAAC,MAAO,KAAK,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,SAAS,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AAAA,EACvF;AACF;AAGO,MAAM,mBAA+D,OAAO,OAAO;AAAA,EACxF,IAAI,MAAM,GAAG;AAAA,EACb,IAAI,MAAM,GAAG;AAAA,EACb,IAAI,MAAM,GAAG;AAAA,EACb,IAAI,MAAM,GAAG;AAAA,EACb,IAAI,MAAM,GAAG;AAAA,EACb,IAAI,MAAM,GAAG;AACf,CAAC;AAGM,MAAM,kBAA+C,OAAO,OAAO,CAAC,MAAM,MAAM,MAAM,MAAM,MAAM,IAAI,CAAC;AAG9G,MAAM,UAAU,CAAC,GAAG,eAAe,EAAE,KAAK,CAAC,GAAG,MAAM,MAAM,CAAC,EAAE,KAAK,SAAS,MAAM,CAAC,EAAE,KAAK,MAAM;AAc/F,SAAS,SAAS,QAAgB,MAAkC;AAClE,QAAM,MAAM,KAAK,SAAS,OAAO,WAAW,GAAG,IAAI,OAAO,MAAM,CAAC,IAAI;AAErE,MAAI,IAAI,WAAW,GAAG,KAAK,CAAC,KAAK,UAAW,QAAO;AACnD,MAAI,IAAI,SAAS,KAAK,OAAO,IAAI,SAAS,KAAK,IAAK,QAAO;AAC3D,SAAO;AACT;AAaO,SAAS,WAAW,OAAe,UAAwB,MAA0B;AAC1F,QAAM,OAAO,MAAM,KAAK;AACxB,MAAI,SAAS,MAAM,CAAC,qBAAqB,KAAK,IAAI,EAAG,QAAO;AAC5D,MAAI,SAAS,KAAK,QAAQ,OAAO,EAAE;AACnC,MAAI,gBAAgB,KAAK,WAAW,GAAG;AACvC,MAAI,CAAC,iBAAiB,OAAO,WAAW,IAAI,GAAG;AAC7C,oBAAgB;AAChB,aAAS,OAAO,MAAM,CAAC;AAAA,EACzB;AACA,MAAI,eAAe;AAEjB,aAAS,KACN,QAAQ,gBAAgB,EAAE,EAC1B,QAAQ,OAAO,EAAE,EACjB,QAAQ,OAAO,EAAE;AACpB,QAAI,OAAO,WAAW,GAAG,EAAG,QAAO;AACnC,UAAM,QAAQ,QAAQ,KAAK,CAAC,MAAM,OAAO,WAAW,MAAM,CAAC,EAAE,IAAI,CAAC;AAClE,QAAI,OAAO;AACT,YAAMA,QAAO,MAAM,KAAK;AACxB,YAAMC,OAAM,SAAS,OAAO,MAAMD,MAAK,KAAK,MAAM,GAAGA,KAAI;AACzD,aAAOC,SAAQ,OAAO,OAAO,EAAE,MAAM,IAAID,MAAK,IAAI,GAAGC,IAAG,IAAI,SAAS,OAAO,UAAUA,KAAI;AAAA,IAC5F;AACA,QAAI,OAAO,SAAS,KAAK,OAAO,SAAS,GAAI,QAAO;AACpD,WAAO,EAAE,MAAM,IAAI,MAAM,IAAI,SAAS,MAAM,UAAU,OAAO;AAAA,EAC/D;AACA,MAAI,YAAY,QAAS,QAAO;AAChC,QAAM,OAAO,MAAM,OAAO;AAC1B,QAAM,MAAM,SAAS,QAAQ,IAAI;AACjC,SAAO,QAAQ,OAAO,OAAO,EAAE,MAAM,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI,SAAS,UAAU,IAAI;AACrF;AAGO,SAAS,oBAAoB,KAAa,SAAmC;AAClF,SAAO,MAAM,OAAO,EAAE,MAAM,GAAG,EAAE,KAAK,GAAG;AAC3C;AAQO,SAAS,YAAY,OAAuB;AACjD,QAAM,SAAS,MAAM,KAAK,EAAE,WAAW,GAAG,IAAI,WAAW,OAAO,OAAO,IAAI;AAC3E,MAAI,CAAC,OAAQ,QAAO;AACpB,MAAI,CAAC,OAAO,QAAS,QAAO,OAAO;AACnC,SAAO,IAAI,MAAM,OAAO,OAAO,EAAE,IAAI,IAAI,oBAAoB,OAAO,UAAU,OAAO,OAAO,CAAC;AAC/F;AAIO,SAAS,OAAO,OAAwB;AAC7C,SAAO,oBAAoB,KAAK,KAAK;AACvC;","names":["rule","nsn"]}

package/dist/lib/qr-encode.js

@@ -2,16 +2,352 @@
 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]
+  [
+    -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]
+  [
+    -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));

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

@@ -1 +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":[]}
+{"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  [\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,\n    30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n  ],\n  [\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,\n    28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\n  ],\n  [\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,\n    30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n  ],\n  [\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,\n    30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n  ],\n];\nconst NUM_ERROR_CORRECTION_BLOCKS: readonly (readonly number[])[] = [\n  [\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,\n    19, 20, 21, 22, 24, 25,\n  ],\n  [\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,\n    33, 35, 37, 38, 40, 43, 45, 47, 49,\n  ],\n  [\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,\n    45, 48, 51, 53, 56, 59, 62, 65, 68,\n  ],\n  [\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,\n    51, 54, 57, 60, 63, 66, 70, 74, 77, 81,\n  ],\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;AAAA,IACE;AAAA,IAAI;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAC/G;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,EAC9C;AAAA,EACA;AAAA,IACE;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAChH;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,EAC9C;AAAA,EACA;AAAA,IACE;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAChH;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,EAC9C;AAAA,EACA;AAAA,IACE;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAChH;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,EAC9C;AACF;AACA,MAAM,8BAA8D;AAAA,EAClE;AAAA,IACE;AAAA,IAAI;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACjH;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,EACtB;AAAA,EACA;AAAA,IACE;AAAA,IAAI;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAC9G;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,EAClC;AAAA,EACA;AAAA,IACE;AAAA,IAAI;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACjH;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,EAClC;AAAA,EACA;AAAA,IACE;AAAA,IAAI;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAC9G;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,EACtC;AACF;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":[]}