@stll/stdnum 0.0.1

package/dist/bic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bic.js","names":[],"sources":["../src/bic.ts"],"sourcesContent":["/** Generate a random valid BIC (8-character). */\nconst generate = (): string => {\n  const randomLetter = (): string =>\n    String.fromCodePoint(65 + randomInt(0, 25));\n  const randomAlphaNum = (): string => {\n    const chars = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789\";\n    return chars[randomInt(0, chars.length - 1)]!;\n  };\n  const countries = [\n    \"DE\",\n    \"GB\",\n    \"US\",\n    \"FR\",\n    \"CH\",\n    \"NL\",\n    \"AT\",\n  ];\n  const country =\n    countries[randomInt(0, countries.length - 1)]!;\n  const bank =\n    randomLetter() +\n    randomLetter() +\n    randomLetter() +\n    randomLetter();\n  const location = randomAlphaNum() + randomAlphaNum();\n  return `${bank}${country}${location}`;\n};\n\n/**\n * BIC (Business Identifier Code).\n *\n * ISO 9362. 8 or 11 character code identifying\n * financial institutions. Format:\n * [A-Z]{4} (institution) + [A-Z]{2} (country) +\n * [0-9A-Z]{2} (location) + [0-9A-Z]{3} (branch,\n * optional).\n *\n * @see https://www.swift.com/\n */\n\nimport { clean } from \"#util/clean\";\nimport { randomInt } from \"#util/generate\";\nimport { err } from \"#util/result\";\n\nimport type { ValidateResult, Validator } from \"./types\";\n\nconst BIC_RE =\n  /^[A-Z]{4}[A-Z]{2}[0-9A-Z]{2}([0-9A-Z]{3})?$/;\n\nconst compact = (value: string): string =>\n  clean(value, \" -\").toUpperCase();\n\nconst validate = (value: string): ValidateResult => {\n  const v = compact(value);\n  if (v.length !== 8 && v.length !== 11) {\n    return err(\n      \"INVALID_LENGTH\",\n      \"BIC must be 8 or 11 characters\",\n    );\n  }\n  if (!BIC_RE.test(v)) {\n    return err(\n      \"INVALID_FORMAT\",\n      \"BIC must be 8 or 11 alphanumeric characters\",\n    );\n  }\n  // Country code at positions 4-5 is already\n  // validated as [A-Z]{2} by the regex above.\n  // SWIFT accepts all ISO 3166-1 alpha-2 codes\n  // plus XK (Kosovo); we don't restrict further.\n  return { valid: true, compact: v };\n};\n\nconst format = (value: string): string => {\n  const v = compact(value);\n  if (v.length === 11) {\n    return `${v.slice(0, 4)} ${v.slice(4, 6)} ${v.slice(6, 8)} ${v.slice(8)}`;\n  }\n  return `${v.slice(0, 4)} ${v.slice(4, 6)} ${v.slice(6)}`;\n};\n\n/** Business Identifier Code (SWIFT/BIC). */\nconst bic: Validator = {\n  name: \"Business Identifier Code\",\n  localName: \"Business Identifier Code\",\n  abbreviation: \"BIC\",\n  aliases: [\"BIC\", \"SWIFT\", \"BIC/SWIFT\"] as const,\n  candidatePattern: \"[A-Z]{6}[A-Z0-9]{2}(?:[A-Z0-9]{3})?\",\n  entityType: \"company\",\n  sourceUrl: \"https://www.swift.com/\",\n  examples: [\"DEUTDEFF\", \"DEUTDEFF500\"] as const,\n  compact,\n  format,\n  validate,\n  generate,\n};\n\nexport default bic;\nexport { compact, format, validate, generate };\n"],"mappings":";;;;;;;;;;;;;;;;AACA,MAAM,iBAAyB;CAC7B,MAAM,qBACJ,OAAO,cAAc,KAAK,UAAU,GAAG,GAAG,CAAC;CAC7C,MAAM,uBAA+B;AAEnC,SADc,uCACD,UAAU,GAAG,GAAiB;;CAE7C,MAAM,YAAY;EAChB;EACA;EACA;EACA;EACA;EACA;EACA;EACD;CACD,MAAM,UACJ,UAAU,UAAU,GAAG,UAAU,SAAS,EAAE;AAO9C,QAAO,GALL,cAAc,GACd,cAAc,GACd,cAAc,GACd,cAAc,GAEC,UADA,gBAAgB,GAAG,gBAAgB;;AAsBtD,MAAM,SACJ;AAEF,MAAM,WAAW,UACf,MAAM,OAAO,KAAK,CAAC,aAAa;AAElC,MAAM,YAAY,UAAkC;CAClD,MAAM,IAAI,QAAQ,MAAM;AACxB,KAAI,EAAE,WAAW,KAAK,EAAE,WAAW,GACjC,QAAO,IACL,kBACA,iCACD;AAEH,KAAI,CAAC,OAAO,KAAK,EAAE,CACjB,QAAO,IACL,kBACA,8CACD;AAMH,QAAO;EAAE,OAAO;EAAM,SAAS;EAAG;;AAGpC,MAAM,UAAU,UAA0B;CACxC,MAAM,IAAI,QAAQ,MAAM;AACxB,KAAI,EAAE,WAAW,GACf,QAAO,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE;AAEzE,QAAO,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE;;;AAIxD,MAAM,MAAiB;CACrB,MAAM;CACN,WAAW;CACX,cAAc;CACd,SAAS;EAAC;EAAO;EAAS;EAAY;CACtC,kBAAkB;CAClB,YAAY;CACZ,WAAW;CACX,UAAU,CAAC,YAAY,cAAc;CACrC;CACA;CACA;CACA;CACD"}

package/dist/br/cnpj.d.ts

@@ -0,0 +1,21 @@
+import { ValidateResult, Validator } from "../types.js";
+
+//#region src/br/cnpj.d.ts
+
+declare const compact: (value: string) => string;
+declare const validate: (value: string) => ValidateResult;
+declare const format: (value: string) => string;
+/** Generate a random valid CNPJ. */
+declare const generate: () => string;
+/**
+ * Brazilian CNPJ (company tax ID).
+ *
+ * Examples sourced from publicly available Brazilian
+ * corporate registries:
+ * - Petrobras: 33.000.167/0001-01
+ * - Banco do Brasil: 00.000.000/0001-91
+ */
+declare const cnpj: Validator;
+//#endregion
+export { compact, cnpj as default, format, generate, validate };
+//# sourceMappingURL=cnpj.d.ts.map

package/dist/br/cnpj.js

@@ -0,0 +1,132 @@
+import { clean } from "../_util/clean.js";
+import { randomDigits } from "../_util/generate.js";
+import { err } from "../_util/result.js";
+//#region src/br/cnpj.ts
+/**
+* CNPJ (Cadastro Nacional da Pessoa Jurídica).
+*
+* Brazilian company tax identification number assigned by
+* the Receita Federal (Federal Revenue Service). The
+* number consists of 14 characters: 8 identifying the
+* company, 4 identifying the establishment (0001 for
+* headquarters), and 2 check digits computed using a
+* weighted modulo 11 algorithm.
+*
+* As of July 2026 the Receita Federal will begin issuing
+* alphanumeric CNPJs (letters A-Z in place of some
+* digits). The check digit algorithm uses ordinal values
+* (0-9 = 0-9, A-Z = 17-42) to support this.
+*
+* Format: NN.NNN.NNN/NNNN-DD (14 characters).
+*
+* @see https://www.gov.br/en/categories/finance-taxes-and-public-management/cpf-cnpj-and-other-records
+* @see https://en.wikipedia.org/wiki/CNPJ
+*/
+const CNPJ_RE = /^[\dA-Z]+$/;
+const compact = (value) => clean(value, " -./").trim().toUpperCase();
+/**
+* Convert a CNPJ character to its numeric value.
+* Digits 0-9 map to 0-9; letters A-Z map to their
+* char code minus 48 (matching python-stdnum's
+* `ord(n) - 48` convention: A=17, B=18, ..., Z=42).
+*/
+const charToValue = (ch) => ch.charCodeAt(0) - 48;
+/**
+* Calculate the two CNPJ check digits using the
+* Receita Federal modulo 11 algorithm.
+*
+* First check digit: weights [5,4,3,2,9,8,7,6,5,4,3,2]
+* applied to the first 12 characters.
+*
+* Second check digit: weights [6,5,4,3,2,9,8,7,6,5,4,3,2]
+* applied to the first 12 characters plus the first
+* check digit.
+*/
+const calcCheckDigits = (number) => {
+	const w1 = [
+		5,
+		4,
+		3,
+		2,
+		9,
+		8,
+		7,
+		6,
+		5,
+		4,
+		3,
+		2
+	];
+	let sum = 0;
+	for (let i = 0; i < 12; i++) sum += (w1[i] ?? 0) * charToValue(number.charAt(i));
+	const d1 = (11 - sum % 11) % 11 % 10;
+	const w2 = [
+		6,
+		5,
+		4,
+		3,
+		2,
+		9,
+		8,
+		7,
+		6,
+		5,
+		4,
+		3,
+		2
+	];
+	sum = 0;
+	for (let i = 0; i < 12; i++) sum += (w2[i] ?? 0) * charToValue(number.charAt(i));
+	sum += (w2[12] ?? 0) * d1;
+	return `${d1}${(11 - sum % 11) % 11 % 10}`;
+};
+const validate = (value) => {
+	const v = compact(value);
+	if (v.length !== 14) return err("INVALID_LENGTH", "CNPJ must be 14 characters");
+	if (!CNPJ_RE.test(v)) return err("INVALID_FORMAT", "CNPJ must contain only digits and uppercase letters");
+	if (v.startsWith("000000000000")) return err("INVALID_FORMAT", "CNPJ base must not be all zeros");
+	if (calcCheckDigits(v) !== v.slice(12)) return err("INVALID_CHECKSUM", "CNPJ check digit mismatch");
+	return {
+		valid: true,
+		compact: v
+	};
+};
+const format = (value) => {
+	const v = compact(value);
+	return `${v.slice(0, 2)}.${v.slice(2, 5)}.${v.slice(5, 8)}/${v.slice(8, 12)}-${v.slice(12)}`;
+};
+/** Generate a random valid CNPJ. */
+const generate = () => {
+	for (;;) {
+		const base = randomDigits(12);
+		if (base === "000000000000") continue;
+		return base + calcCheckDigits(base);
+	}
+};
+/**
+* Brazilian CNPJ (company tax ID).
+*
+* Examples sourced from publicly available Brazilian
+* corporate registries:
+* - Petrobras: 33.000.167/0001-01
+* - Banco do Brasil: 00.000.000/0001-91
+*/
+const cnpj = {
+	name: "Brazilian CNPJ",
+	localName: "Cadastro Nacional da Pessoa Jurídica",
+	abbreviation: "CNPJ",
+	aliases: ["CNPJ", "Cadastro Nacional da Pessoa Jurídica"],
+	candidatePattern: "\\d{2}\\.?\\d{3}\\.?\\d{3}/?\\d{4}-?\\d{2}",
+	country: "BR",
+	entityType: "company",
+	sourceUrl: "https://www.gov.br/receitafederal/",
+	examples: ["33000167000101", "00000000000191"],
+	compact,
+	format,
+	validate,
+	generate
+};
+//#endregion
+export { compact, cnpj as default, format, generate, validate };
+
+//# sourceMappingURL=cnpj.js.map

package/dist/br/cnpj.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cnpj.js","names":[],"sources":["../../src/br/cnpj.ts"],"sourcesContent":["/**\n * CNPJ (Cadastro Nacional da Pessoa Jurídica).\n *\n * Brazilian company tax identification number assigned by\n * the Receita Federal (Federal Revenue Service). The\n * number consists of 14 characters: 8 identifying the\n * company, 4 identifying the establishment (0001 for\n * headquarters), and 2 check digits computed using a\n * weighted modulo 11 algorithm.\n *\n * As of July 2026 the Receita Federal will begin issuing\n * alphanumeric CNPJs (letters A-Z in place of some\n * digits). The check digit algorithm uses ordinal values\n * (0-9 = 0-9, A-Z = 17-42) to support this.\n *\n * Format: NN.NNN.NNN/NNNN-DD (14 characters).\n *\n * @see https://www.gov.br/en/categories/finance-taxes-and-public-management/cpf-cnpj-and-other-records\n * @see https://en.wikipedia.org/wiki/CNPJ\n */\n\nimport { clean } from \"#util/clean\";\nimport { randomDigits } from \"#util/generate\";\nimport { err } from \"#util/result\";\n\nimport type { ValidateResult, Validator } from \"../types\";\n\nconst CNPJ_RE = /^[\\dA-Z]+$/;\n\nconst compact = (value: string): string =>\n  clean(value, \" -./\").trim().toUpperCase();\n\n/**\n * Convert a CNPJ character to its numeric value.\n * Digits 0-9 map to 0-9; letters A-Z map to their\n * char code minus 48 (matching python-stdnum's\n * `ord(n) - 48` convention: A=17, B=18, ..., Z=42).\n */\nconst charToValue = (ch: string): number =>\n  ch.charCodeAt(0) - 48;\n\n/**\n * Calculate the two CNPJ check digits using the\n * Receita Federal modulo 11 algorithm.\n *\n * First check digit: weights [5,4,3,2,9,8,7,6,5,4,3,2]\n * applied to the first 12 characters.\n *\n * Second check digit: weights [6,5,4,3,2,9,8,7,6,5,4,3,2]\n * applied to the first 12 characters plus the first\n * check digit.\n */\nconst calcCheckDigits = (number: string): string => {\n  const w1 = [5, 4, 3, 2, 9, 8, 7, 6, 5, 4, 3, 2];\n  let sum = 0;\n  for (let i = 0; i < 12; i++) {\n    sum += (w1[i] ?? 0) * charToValue(number.charAt(i));\n  }\n  const d1 = ((11 - (sum % 11)) % 11) % 10;\n\n  const w2 = [6, 5, 4, 3, 2, 9, 8, 7, 6, 5, 4, 3, 2];\n  sum = 0;\n  for (let i = 0; i < 12; i++) {\n    sum += (w2[i] ?? 0) * charToValue(number.charAt(i));\n  }\n  // Use the computed d1 (not the stored digit at\n  // number[12]) so both check digits are derived\n  // from the base alone.\n  sum += (w2[12] ?? 0) * d1;\n  const d2 = ((11 - (sum % 11)) % 11) % 10;\n\n  return `${d1}${d2}`;\n};\n\nconst validate = (value: string): ValidateResult => {\n  const v = compact(value);\n  if (v.length !== 14) {\n    return err(\n      \"INVALID_LENGTH\",\n      \"CNPJ must be 14 characters\",\n    );\n  }\n  if (!CNPJ_RE.test(v)) {\n    return err(\n      \"INVALID_FORMAT\",\n      \"CNPJ must contain only digits and uppercase letters\",\n    );\n  }\n  // Reject all-zero base (first 12 chars).\n  // Unlike CPF, we do not reject all-same-digit CNPJs;\n  // python-stdnum only blocks the all-zero base, and\n  // there is no official Receita Federal list of\n  // blocked same-digit CNPJ sequences.\n  if (v.startsWith(\"000000000000\")) {\n    return err(\n      \"INVALID_FORMAT\",\n      \"CNPJ base must not be all zeros\",\n    );\n  }\n  if (calcCheckDigits(v) !== v.slice(12)) {\n    return err(\n      \"INVALID_CHECKSUM\",\n      \"CNPJ check digit mismatch\",\n    );\n  }\n  return { valid: true, compact: v };\n};\n\nconst format = (value: string): string => {\n  const v = compact(value);\n  return `${v.slice(0, 2)}.${v.slice(2, 5)}.${v.slice(5, 8)}/${v.slice(8, 12)}-${v.slice(12)}`;\n};\n\n/** Generate a random valid CNPJ. */\nconst generate = (): string => {\n  for (;;) {\n    const base = randomDigits(12);\n    if (base === \"000000000000\") continue;\n    return base + calcCheckDigits(base);\n  }\n};\n\n/**\n * Brazilian CNPJ (company tax ID).\n *\n * Examples sourced from publicly available Brazilian\n * corporate registries:\n * - Petrobras: 33.000.167/0001-01\n * - Banco do Brasil: 00.000.000/0001-91\n */\nconst cnpj: Validator = {\n  name: \"Brazilian CNPJ\",\n  localName: \"Cadastro Nacional da Pessoa Jurídica\",\n  abbreviation: \"CNPJ\",\n  aliases: [\n    \"CNPJ\",\n    \"Cadastro Nacional da Pessoa Jurídica\",\n  ] as const,\n  candidatePattern:\n    \"\\\\d{2}\\\\.?\\\\d{3}\\\\.?\\\\d{3}/?\\\\d{4}-?\\\\d{2}\",\n  country: \"BR\",\n  entityType: \"company\",\n  sourceUrl: \"https://www.gov.br/receitafederal/\",\n  examples: [\"33000167000101\", \"00000000000191\"] as const,\n  compact,\n  format,\n  validate,\n  generate,\n};\n\nexport default cnpj;\nexport { compact, format, validate, generate };\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AA2BA,MAAM,UAAU;AAEhB,MAAM,WAAW,UACf,MAAM,OAAO,OAAO,CAAC,MAAM,CAAC,aAAa;;;;;;;AAQ3C,MAAM,eAAe,OACnB,GAAG,WAAW,EAAE,GAAG;;;;;;;;;;;;AAarB,MAAM,mBAAmB,WAA2B;CAClD,MAAM,KAAK;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAE;CAC/C,IAAI,MAAM;AACV,MAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IACtB,SAAQ,GAAG,MAAM,KAAK,YAAY,OAAO,OAAO,EAAE,CAAC;CAErD,MAAM,MAAO,KAAM,MAAM,MAAO,KAAM;CAEtC,MAAM,KAAK;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAE;AAClD,OAAM;AACN,MAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IACtB,SAAQ,GAAG,MAAM,KAAK,YAAY,OAAO,OAAO,EAAE,CAAC;AAKrD,SAAQ,GAAG,OAAO,KAAK;AAGvB,QAAO,GAAG,MAFG,KAAM,MAAM,MAAO,KAAM;;AAKxC,MAAM,YAAY,UAAkC;CAClD,MAAM,IAAI,QAAQ,MAAM;AACxB,KAAI,EAAE,WAAW,GACf,QAAO,IACL,kBACA,6BACD;AAEH,KAAI,CAAC,QAAQ,KAAK,EAAE,CAClB,QAAO,IACL,kBACA,sDACD;AAOH,KAAI,EAAE,WAAW,eAAe,CAC9B,QAAO,IACL,kBACA,kCACD;AAEH,KAAI,gBAAgB,EAAE,KAAK,EAAE,MAAM,GAAG,CACpC,QAAO,IACL,oBACA,4BACD;AAEH,QAAO;EAAE,OAAO;EAAM,SAAS;EAAG;;AAGpC,MAAM,UAAU,UAA0B;CACxC,MAAM,IAAI,QAAQ,MAAM;AACxB,QAAO,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG;;;AAI5F,MAAM,iBAAyB;AAC7B,UAAS;EACP,MAAM,OAAO,aAAa,GAAG;AAC7B,MAAI,SAAS,eAAgB;AAC7B,SAAO,OAAO,gBAAgB,KAAK;;;;;;;;;;;AAYvC,MAAM,OAAkB;CACtB,MAAM;CACN,WAAW;CACX,cAAc;CACd,SAAS,CACP,QACA,uCACD;CACD,kBACE;CACF,SAAS;CACT,YAAY;CACZ,WAAW;CACX,UAAU,CAAC,kBAAkB,iBAAiB;CAC9C;CACA;CACA;CACA;CACD"}

package/dist/br/cpf.d.ts

@@ -0,0 +1,14 @@
+import { ValidateResult, Validator } from "../types.js";
+
+//#region src/br/cpf.d.ts
+
+declare const compact: (value: string) => string;
+declare const validate: (value: string) => ValidateResult;
+declare const format: (value: string) => string;
+/** Generate a random valid CPF. */
+declare const generate: () => string;
+/** Brazilian CPF (personal tax ID). */
+declare const cpf: Validator;
+//#endregion
+export { compact, cpf as default, format, generate, validate };
+//# sourceMappingURL=cpf.d.ts.map

package/dist/br/cpf.js

@@ -0,0 +1,83 @@
+import { clean } from "../_util/clean.js";
+import { randomDigits } from "../_util/generate.js";
+import { err } from "../_util/result.js";
+import { isdigits } from "../_util/strings.js";
+//#region src/br/cpf.ts
+/**
+* CPF (Cadastro de Pessoas Físicas).
+*
+* Brazilian personal tax identification number assigned
+* by the Receita Federal (Federal Revenue Service) to
+* individuals. The number consists of 11 digits: 9 base
+* digits followed by 2 check digits computed using a
+* weighted modulo 11 algorithm.
+*
+* Format: NNN.NNN.NNN-DD (11 digits, purely numeric).
+*
+* @see https://www.gov.br/en/categories/finance-taxes-and-public-management/cpf-cnpj-and-other-records
+* @see https://en.wikipedia.org/wiki/CPF_number
+*/
+const compact = (value) => clean(value, " -.").trim();
+/**
+* Calculate the two CPF check digits using the
+* Receita Federal modulo 11 algorithm.
+*
+* First check digit: multiply digits 0..8 by weights
+* 10..2, sum, then (11 - sum % 11) % 11 % 10.
+*
+* Second check digit: multiply digits 0..8 by weights
+* 11..3, add 2 * first check digit, then
+* (11 - sum % 11) % 11 % 10.
+*/
+const calcCheckDigits = (number) => {
+	let sum = 0;
+	for (let i = 0; i < 9; i++) sum += (10 - i) * Number(number[i]);
+	const d1 = (11 - sum % 11) % 11 % 10;
+	sum = 0;
+	for (let i = 0; i < 9; i++) sum += (11 - i) * Number(number[i]);
+	sum += 2 * d1;
+	return `${d1}${(11 - sum % 11) % 11 % 10}`;
+};
+const validate = (value) => {
+	const v = compact(value);
+	if (v.length !== 11) return err("INVALID_LENGTH", "CPF must be 11 digits");
+	if (!isdigits(v)) return err("INVALID_FORMAT", "CPF must contain only digits");
+	if (/^(\d)\1{10}$/.test(v)) return err("INVALID_FORMAT", "CPF must not be a repeated digit sequence");
+	if (calcCheckDigits(v) !== v.slice(9)) return err("INVALID_CHECKSUM", "CPF check digit mismatch");
+	return {
+		valid: true,
+		compact: v
+	};
+};
+const format = (value) => {
+	const v = compact(value);
+	return `${v.slice(0, 3)}.${v.slice(3, 6)}.${v.slice(6, 9)}-${v.slice(9)}`;
+};
+/** Generate a random valid CPF. */
+const generate = () => {
+	for (;;) {
+		const base = randomDigits(9);
+		if (/^(\d)\1{8}$/.test(base)) continue;
+		return base + calcCheckDigits(base);
+	}
+};
+/** Brazilian CPF (personal tax ID). */
+const cpf = {
+	name: "Brazilian CPF",
+	localName: "Cadastro de Pessoas Físicas",
+	abbreviation: "CPF",
+	aliases: ["CPF", "Cadastro de Pessoas Físicas"],
+	candidatePattern: "\\d{3}\\.?\\d{3}\\.?\\d{3}-?\\d{2}",
+	country: "BR",
+	entityType: "person",
+	sourceUrl: "https://www.gov.br/receitafederal/",
+	examples: ["39053344705"],
+	compact,
+	format,
+	validate,
+	generate
+};
+//#endregion
+export { compact, cpf as default, format, generate, validate };
+
+//# sourceMappingURL=cpf.js.map

package/dist/br/cpf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cpf.js","names":[],"sources":["../../src/br/cpf.ts"],"sourcesContent":["/**\n * CPF (Cadastro de Pessoas Físicas).\n *\n * Brazilian personal tax identification number assigned\n * by the Receita Federal (Federal Revenue Service) to\n * individuals. The number consists of 11 digits: 9 base\n * digits followed by 2 check digits computed using a\n * weighted modulo 11 algorithm.\n *\n * Format: NNN.NNN.NNN-DD (11 digits, purely numeric).\n *\n * @see https://www.gov.br/en/categories/finance-taxes-and-public-management/cpf-cnpj-and-other-records\n * @see https://en.wikipedia.org/wiki/CPF_number\n */\n\nimport { clean } from \"#util/clean\";\nimport { randomDigits } from \"#util/generate\";\nimport { err } from \"#util/result\";\nimport { isdigits } from \"#util/strings\";\n\nimport type { ValidateResult, Validator } from \"../types\";\n\nconst compact = (value: string): string =>\n  clean(value, \" -.\").trim();\n\n/**\n * Calculate the two CPF check digits using the\n * Receita Federal modulo 11 algorithm.\n *\n * First check digit: multiply digits 0..8 by weights\n * 10..2, sum, then (11 - sum % 11) % 11 % 10.\n *\n * Second check digit: multiply digits 0..8 by weights\n * 11..3, add 2 * first check digit, then\n * (11 - sum % 11) % 11 % 10.\n */\nconst calcCheckDigits = (number: string): string => {\n  let sum = 0;\n  for (let i = 0; i < 9; i++) {\n    sum += (10 - i) * Number(number[i]);\n  }\n  const d1 = ((11 - (sum % 11)) % 11) % 10;\n\n  sum = 0;\n  for (let i = 0; i < 9; i++) {\n    sum += (11 - i) * Number(number[i]);\n  }\n  sum += 2 * d1;\n  const d2 = ((11 - (sum % 11)) % 11) % 10;\n\n  return `${d1}${d2}`;\n};\n\nconst validate = (value: string): ValidateResult => {\n  const v = compact(value);\n  if (v.length !== 11) {\n    return err(\"INVALID_LENGTH\", \"CPF must be 11 digits\");\n  }\n  if (!isdigits(v)) {\n    return err(\n      \"INVALID_FORMAT\",\n      \"CPF must contain only digits\",\n    );\n  }\n  // All-same-digit CPFs (e.g. 000.000.000-00) pass the\n  // checksum but are not valid registrations.\n  if (/^(\\d)\\1{10}$/.test(v)) {\n    return err(\n      \"INVALID_FORMAT\",\n      \"CPF must not be a repeated digit sequence\",\n    );\n  }\n  if (calcCheckDigits(v) !== v.slice(9)) {\n    return err(\n      \"INVALID_CHECKSUM\",\n      \"CPF check digit mismatch\",\n    );\n  }\n  return { valid: true, compact: v };\n};\n\nconst format = (value: string): string => {\n  const v = compact(value);\n  return `${v.slice(0, 3)}.${v.slice(3, 6)}.${v.slice(6, 9)}-${v.slice(9)}`;\n};\n\n/** Generate a random valid CPF. */\nconst generate = (): string => {\n  for (;;) {\n    const base = randomDigits(9);\n    if (/^(\\d)\\1{8}$/.test(base)) continue;\n    return base + calcCheckDigits(base);\n  }\n};\n\n/** Brazilian CPF (personal tax ID). */\nconst cpf: Validator = {\n  name: \"Brazilian CPF\",\n  localName: \"Cadastro de Pessoas Físicas\",\n  abbreviation: \"CPF\",\n  aliases: [\"CPF\", \"Cadastro de Pessoas Físicas\"] as const,\n  candidatePattern: \"\\\\d{3}\\\\.?\\\\d{3}\\\\.?\\\\d{3}-?\\\\d{2}\",\n  country: \"BR\",\n  entityType: \"person\",\n  sourceUrl: \"https://www.gov.br/receitafederal/\",\n  examples: [\"39053344705\"] as const,\n  compact,\n  format,\n  validate,\n  generate,\n};\n\nexport default cpf;\nexport { compact, format, validate, generate };\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAsBA,MAAM,WAAW,UACf,MAAM,OAAO,MAAM,CAAC,MAAM;;;;;;;;;;;;AAa5B,MAAM,mBAAmB,WAA2B;CAClD,IAAI,MAAM;AACV,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACrB,SAAQ,KAAK,KAAK,OAAO,OAAO,GAAG;CAErC,MAAM,MAAO,KAAM,MAAM,MAAO,KAAM;AAEtC,OAAM;AACN,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACrB,SAAQ,KAAK,KAAK,OAAO,OAAO,GAAG;AAErC,QAAO,IAAI;AAGX,QAAO,GAAG,MAFG,KAAM,MAAM,MAAO,KAAM;;AAKxC,MAAM,YAAY,UAAkC;CAClD,MAAM,IAAI,QAAQ,MAAM;AACxB,KAAI,EAAE,WAAW,GACf,QAAO,IAAI,kBAAkB,wBAAwB;AAEvD,KAAI,CAAC,SAAS,EAAE,CACd,QAAO,IACL,kBACA,+BACD;AAIH,KAAI,eAAe,KAAK,EAAE,CACxB,QAAO,IACL,kBACA,4CACD;AAEH,KAAI,gBAAgB,EAAE,KAAK,EAAE,MAAM,EAAE,CACnC,QAAO,IACL,oBACA,2BACD;AAEH,QAAO;EAAE,OAAO;EAAM,SAAS;EAAG;;AAGpC,MAAM,UAAU,UAA0B;CACxC,MAAM,IAAI,QAAQ,MAAM;AACxB,QAAO,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE;;;AAIzE,MAAM,iBAAyB;AAC7B,UAAS;EACP,MAAM,OAAO,aAAa,EAAE;AAC5B,MAAI,cAAc,KAAK,KAAK,CAAE;AAC9B,SAAO,OAAO,gBAAgB,KAAK;;;;AAKvC,MAAM,MAAiB;CACrB,MAAM;CACN,WAAW;CACX,cAAc;CACd,SAAS,CAAC,OAAO,8BAA8B;CAC/C,kBAAkB;CAClB,SAAS;CACT,YAAY;CACZ,WAAW;CACX,UAAU,CAAC,cAAc;CACzB;CACA;CACA;CACA;CACD"}

package/dist/br/mod.d.ts

@@ -0,0 +1,9 @@
+import { __exportAll } from "../_virtual/_rolldown/runtime.js";
+import cnpj from "./cnpj.js";
+import cpf from "./cpf.js";
+
+//#region src/br/mod.d.ts
+
+//#endregion
+export { cnpj, cpf, mod_d_exports };
+//# sourceMappingURL=mod.d.ts.map

package/dist/br/mod.js

@@ -0,0 +1,12 @@
+import { __exportAll } from "../_virtual/_rolldown/runtime.js";
+import cnpj from "./cnpj.js";
+import cpf from "./cpf.js";
+//#region src/br/mod.ts
+var br_exports = /* @__PURE__ */ __exportAll({
+	cnpj: () => cnpj,
+	cpf: () => cpf
+});
+//#endregion
+export { br_exports, cnpj, cpf };
+
+//# sourceMappingURL=mod.js.map

package/dist/br/mod.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mod.js","names":[],"sources":["../../src/br/mod.ts"],"sourcesContent":["export { default as cnpj } from \"./cnpj\";\nexport { default as cpf } from \"./cpf\";\n"],"mappings":""}

package/dist/by/mod.d.ts

@@ -0,0 +1,8 @@
+import { __exportAll } from "../_virtual/_rolldown/runtime.js";
+import unp from "./unp.js";
+
+//#region src/by/mod.d.ts
+
+//#endregion
+export { mod_d_exports, unp };
+//# sourceMappingURL=mod.d.ts.map

package/dist/by/mod.js

@@ -0,0 +1,8 @@
+import { __exportAll } from "../_virtual/_rolldown/runtime.js";
+import unp from "./unp.js";
+//#region src/by/mod.ts
+var by_exports = /* @__PURE__ */ __exportAll({ unp: () => unp });
+//#endregion
+export { by_exports, unp };
+
+//# sourceMappingURL=mod.js.map

package/dist/by/mod.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mod.js","names":[],"sources":["../../src/by/mod.ts"],"sourcesContent":["export { default as unp } from \"./unp\";\n"],"mappings":""}

package/dist/by/unp.d.ts

@@ -0,0 +1,14 @@
+import { ValidateResult, Validator } from "../types.js";
+
+//#region src/by/unp.d.ts
+
+declare const compact: (value: string) => string;
+declare const validate: (value: string) => ValidateResult;
+declare const format: (value: string) => string;
+/** Generate a random valid Belarus UNP. */
+declare const generate: () => string;
+/** Belarus UNP (Учётный номер плательщика). */
+declare const unp: Validator;
+//#endregion
+export { compact, unp as default, format, generate, validate };
+//# sourceMappingURL=unp.d.ts.map

package/dist/by/unp.js

@@ -0,0 +1,114 @@
+import { clean } from "../_util/clean.js";
+import { randomDigits, randomInt } from "../_util/generate.js";
+import { err } from "../_util/result.js";
+import { isdigits } from "../_util/strings.js";
+//#region src/by/unp.ts
+/**
+* UNP (Учётный номер плательщика, Belarus tax number).
+*
+* 9 characters: the first two identify the region (numeric
+* for organisations, letters from ABCEHKMOPT for
+* individuals), followed by 7 digits. The last digit is a
+* weighted check digit (mod 11; if remainder > 9 the
+* number is invalid).
+*
+* @see https://be.wikipedia.org/wiki/Уліковы_нумар_плацельшчыка
+* @see https://www.nalog.gov.by/
+*/
+/** Cyrillic to Latin mapping for the letter positions. */
+const CYRILLIC_TO_LATIN = {
+	А: "A",
+	В: "B",
+	Е: "E",
+	К: "K",
+	М: "M",
+	Н: "H",
+	О: "O",
+	Р: "P",
+	С: "C",
+	Т: "T"
+};
+const WEIGHTS = [
+	29,
+	23,
+	19,
+	17,
+	13,
+	7,
+	5,
+	3
+];
+const ALPHA_SET = "ABCEHKMOPT";
+const VALID_FIRST = "1234567ABCEHKM";
+const ALPHABET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
+const compact = (value) => {
+	let v = clean(value, " ").toUpperCase().trim();
+	if (v.startsWith("УНП")) v = v.slice(3);
+	else if (v.startsWith("UNP")) v = v.slice(3);
+	return [...v].map((ch) => CYRILLIC_TO_LATIN[ch] ?? ch).join("");
+};
+const calcCheckDigit = (number) => {
+	let work = number;
+	if (!isdigits(number)) {
+		const idx = ALPHA_SET.indexOf(number[1]);
+		if (idx === -1) return null;
+		work = number[0] + String(idx) + number.slice(2);
+	}
+	let sum = 0;
+	for (let i = 0; i < 8; i++) {
+		const ch = work[i];
+		const val = ALPHABET.indexOf(ch);
+		if (val === -1) return null;
+		sum += (WEIGHTS[i] ?? 0) * val;
+	}
+	const remainder = sum % 11;
+	if (remainder > 9) return null;
+	return remainder;
+};
+const validate = (value) => {
+	const v = compact(value);
+	if (v.length !== 9) return err("INVALID_LENGTH", "Belarus UNP must be 9 characters");
+	if (!isdigits(v.slice(2))) return err("INVALID_FORMAT", "Belarus UNP positions 3-9 must be digits");
+	const first2 = v.slice(0, 2);
+	if (!isdigits(first2) && ![...first2].every((ch) => ALPHA_SET.includes(ch))) return err("INVALID_FORMAT", "Belarus UNP first two characters must be digits or letters from ABCEHKMOPT");
+	if (!VALID_FIRST.includes(v[0])) return err("INVALID_COMPONENT", "Belarus UNP has an invalid region prefix");
+	const expected = calcCheckDigit(v);
+	if (expected === null) return err("INVALID_CHECKSUM", "Belarus UNP check digit is invalid (mod 11 remainder > 9)");
+	if (v[8] !== String(expected)) return err("INVALID_CHECKSUM", "Belarus UNP check digit mismatch");
+	return {
+		valid: true,
+		compact: v
+	};
+};
+const format = (value) => compact(value);
+/** Generate a random valid Belarus UNP. */
+const generate = () => {
+	for (let i = 0; i < 100; i++) {
+		const payload = String(randomInt(1, 7)) + randomDigits(7);
+		const check = calcCheckDigit(payload);
+		if (check === null) continue;
+		const c = payload.slice(0, 8) + String(check);
+		if (validate(c).valid) return c;
+	}
+	throw new Error("Failed to generate valid UNP");
+};
+/** Belarus UNP (Учётный номер плательщика). */
+const unp = {
+	name: "Belarus Tax Number",
+	localName: "Учётный номер плательщика",
+	abbreviation: "УНП",
+	aliases: ["УНП", "UNP"],
+	candidatePattern: "\\d{9}",
+	country: "BY",
+	entityType: "any",
+	sourceUrl: "https://www.nalog.gov.by/",
+	examples: ["200988541", "MA1953684"],
+	compact,
+	format,
+	validate,
+	generate
+};
+//#endregion
+export { compact, unp as default, format, generate, validate };
+
+//# sourceMappingURL=unp.js.map

package/dist/by/unp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unp.js","names":[],"sources":["../../src/by/unp.ts"],"sourcesContent":["/**\n * UNP (Учётный номер плательщика, Belarus tax number).\n *\n * 9 characters: the first two identify the region (numeric\n * for organisations, letters from ABCEHKMOPT for\n * individuals), followed by 7 digits. The last digit is a\n * weighted check digit (mod 11; if remainder > 9 the\n * number is invalid).\n *\n * @see https://be.wikipedia.org/wiki/Уліковы_нумар_плацельшчыка\n * @see https://www.nalog.gov.by/\n */\n\nimport { clean } from \"#util/clean\";\nimport { randomDigits, randomInt } from \"#util/generate\";\nimport { err } from \"#util/result\";\nimport { isdigits } from \"#util/strings\";\n\nimport type { ValidateResult, Validator } from \"../types\";\n\n/** Cyrillic to Latin mapping for the letter positions. */\nconst CYRILLIC_TO_LATIN: Record<string, string> = {\n  А: \"A\",\n  В: \"B\",\n  Е: \"E\",\n  К: \"K\",\n  М: \"M\",\n  Н: \"H\",\n  О: \"O\",\n  Р: \"P\",\n  С: \"C\",\n  Т: \"T\",\n};\n\nconst WEIGHTS = [29, 23, 19, 17, 13, 7, 5, 3] as const;\nconst ALPHA_SET = \"ABCEHKMOPT\";\nconst VALID_FIRST = \"1234567ABCEHKM\";\nconst ALPHABET = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\nconst compact = (value: string): string => {\n  let v = clean(value, \" \").toUpperCase().trim();\n  if (v.startsWith(\"УНП\")) {\n    v = v.slice(3);\n  } else if (v.startsWith(\"UNP\")) {\n    v = v.slice(3);\n  }\n  return [...v]\n    .map((ch) => CYRILLIC_TO_LATIN[ch] ?? ch)\n    .join(\"\");\n};\n\nconst calcCheckDigit = (number: string): number | null => {\n  let work = number;\n  if (!isdigits(number)) {\n    const idx = ALPHA_SET.indexOf(number[1]!);\n    if (idx === -1) return null;\n    work = number[0] + String(idx) + number.slice(2);\n  }\n  let sum = 0;\n  for (let i = 0; i < 8; i++) {\n    const ch = work[i]!;\n    const val = ALPHABET.indexOf(ch);\n    if (val === -1) return null;\n    sum += (WEIGHTS[i] ?? 0) * val;\n  }\n  const remainder = sum % 11;\n  if (remainder > 9) return null;\n  return remainder;\n};\n\nconst validate = (value: string): ValidateResult => {\n  const v = compact(value);\n  if (v.length !== 9) {\n    return err(\n      \"INVALID_LENGTH\",\n      \"Belarus UNP must be 9 characters\",\n    );\n  }\n  if (!isdigits(v.slice(2))) {\n    return err(\n      \"INVALID_FORMAT\",\n      \"Belarus UNP positions 3-9 must be digits\",\n    );\n  }\n  const first2 = v.slice(0, 2);\n  if (\n    !isdigits(first2) &&\n    ![...first2].every((ch) => ALPHA_SET.includes(ch))\n  ) {\n    return err(\n      \"INVALID_FORMAT\",\n      \"Belarus UNP first two characters must be\" +\n        \" digits or letters from ABCEHKMOPT\",\n    );\n  }\n  if (!VALID_FIRST.includes(v[0]!)) {\n    return err(\n      \"INVALID_COMPONENT\",\n      \"Belarus UNP has an invalid region prefix\",\n    );\n  }\n  const expected = calcCheckDigit(v);\n  if (expected === null) {\n    return err(\n      \"INVALID_CHECKSUM\",\n      \"Belarus UNP check digit is invalid\" +\n        \" (mod 11 remainder > 9)\",\n    );\n  }\n  if (v[8] !== String(expected)) {\n    return err(\n      \"INVALID_CHECKSUM\",\n      \"Belarus UNP check digit mismatch\",\n    );\n  }\n  return { valid: true, compact: v };\n};\n\nconst format = (value: string): string => compact(value);\n\n/** Generate a random valid Belarus UNP. */\nconst generate = (): string => {\n  for (let i = 0; i < 100; i++) {\n    const prefix = String(randomInt(1, 7));\n    const rest = randomDigits(7);\n    const payload = prefix + rest;\n    const check = calcCheckDigit(payload);\n    if (check === null) continue;\n    const c = payload.slice(0, 8) + String(check);\n    if (validate(c).valid) return c;\n  }\n  throw new Error(\"Failed to generate valid UNP\");\n};\n\n/** Belarus UNP (Учётный номер плательщика). */\nconst unp: Validator = {\n  name: \"Belarus Tax Number\",\n  localName: \"Учётный номер плательщика\",\n  abbreviation: \"УНП\",\n  aliases: [\"УНП\", \"UNP\"] as const,\n  candidatePattern: \"\\\\d{9}\",\n  country: \"BY\",\n  entityType: \"any\",\n  sourceUrl: \"https://www.nalog.gov.by/\",\n  examples: [\"200988541\", \"MA1953684\"] as const,\n  compact,\n  format,\n  validate,\n  generate,\n};\n\nexport default unp;\nexport { compact, format, validate, generate };\n"],"mappings":";;;;;;;;;;;;;;;;;;AAqBA,MAAM,oBAA4C;CAChD,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACJ;AAED,MAAM,UAAU;CAAC;CAAI;CAAI;CAAI;CAAI;CAAI;CAAG;CAAG;CAAE;AAC7C,MAAM,YAAY;AAClB,MAAM,cAAc;AACpB,MAAM,WAAW;AAEjB,MAAM,WAAW,UAA0B;CACzC,IAAI,IAAI,MAAM,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM;AAC9C,KAAI,EAAE,WAAW,MAAM,CACrB,KAAI,EAAE,MAAM,EAAE;UACL,EAAE,WAAW,MAAM,CAC5B,KAAI,EAAE,MAAM,EAAE;AAEhB,QAAO,CAAC,GAAG,EAAE,CACV,KAAK,OAAO,kBAAkB,OAAO,GAAG,CACxC,KAAK,GAAG;;AAGb,MAAM,kBAAkB,WAAkC;CACxD,IAAI,OAAO;AACX,KAAI,CAAC,SAAS,OAAO,EAAE;EACrB,MAAM,MAAM,UAAU,QAAQ,OAAO,GAAI;AACzC,MAAI,QAAQ,GAAI,QAAO;AACvB,SAAO,OAAO,KAAK,OAAO,IAAI,GAAG,OAAO,MAAM,EAAE;;CAElD,IAAI,MAAM;AACV,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,KAAK,KAAK;EAChB,MAAM,MAAM,SAAS,QAAQ,GAAG;AAChC,MAAI,QAAQ,GAAI,QAAO;AACvB,UAAQ,QAAQ,MAAM,KAAK;;CAE7B,MAAM,YAAY,MAAM;AACxB,KAAI,YAAY,EAAG,QAAO;AAC1B,QAAO;;AAGT,MAAM,YAAY,UAAkC;CAClD,MAAM,IAAI,QAAQ,MAAM;AACxB,KAAI,EAAE,WAAW,EACf,QAAO,IACL,kBACA,mCACD;AAEH,KAAI,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,CACvB,QAAO,IACL,kBACA,2CACD;CAEH,MAAM,SAAS,EAAE,MAAM,GAAG,EAAE;AAC5B,KACE,CAAC,SAAS,OAAO,IACjB,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,OAAO,UAAU,SAAS,GAAG,CAAC,CAElD,QAAO,IACL,kBACA,6EAED;AAEH,KAAI,CAAC,YAAY,SAAS,EAAE,GAAI,CAC9B,QAAO,IACL,qBACA,2CACD;CAEH,MAAM,WAAW,eAAe,EAAE;AAClC,KAAI,aAAa,KACf,QAAO,IACL,oBACA,4DAED;AAEH,KAAI,EAAE,OAAO,OAAO,SAAS,CAC3B,QAAO,IACL,oBACA,mCACD;AAEH,QAAO;EAAE,OAAO;EAAM,SAAS;EAAG;;AAGpC,MAAM,UAAU,UAA0B,QAAQ,MAAM;;AAGxD,MAAM,iBAAyB;AAC7B,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK;EAG5B,MAAM,UAFS,OAAO,UAAU,GAAG,EAAE,CAAC,GACzB,aAAa,EAAE;EAE5B,MAAM,QAAQ,eAAe,QAAQ;AACrC,MAAI,UAAU,KAAM;EACpB,MAAM,IAAI,QAAQ,MAAM,GAAG,EAAE,GAAG,OAAO,MAAM;AAC7C,MAAI,SAAS,EAAE,CAAC,MAAO,QAAO;;AAEhC,OAAM,IAAI,MAAM,+BAA+B;;;AAIjD,MAAM,MAAiB;CACrB,MAAM;CACN,WAAW;CACX,cAAc;CACd,SAAS,CAAC,OAAO,MAAM;CACvB,kBAAkB;CAClB,SAAS;CACT,YAAY;CACZ,WAAW;CACX,UAAU,CAAC,aAAa,YAAY;CACpC;CACA;CACA;CACA;CACD"}

package/dist/bz/mod.d.ts

@@ -0,0 +1,8 @@
+import { __exportAll } from "../_virtual/_rolldown/runtime.js";
+import tin from "./tin.js";
+
+//#region src/bz/mod.d.ts
+
+//#endregion
+export { mod_d_exports, tin };
+//# sourceMappingURL=mod.d.ts.map

package/dist/bz/mod.js

@@ -0,0 +1,8 @@
+import { __exportAll } from "../_virtual/_rolldown/runtime.js";
+import tin from "./tin.js";
+//#region src/bz/mod.ts
+var bz_exports = /* @__PURE__ */ __exportAll({ tin: () => tin });
+//#endregion
+export { bz_exports, tin };
+
+//# sourceMappingURL=mod.js.map

package/dist/bz/mod.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mod.js","names":[],"sources":["../../src/bz/mod.ts"],"sourcesContent":["export { default as tin } from \"./tin\";\n"],"mappings":""}

package/dist/bz/tin.d.ts

@@ -0,0 +1,16 @@
+import { ValidateResult, Validator } from "../types.js";
+
+//#region src/bz/tin.d.ts
+
+declare const compact: (value: string) => string;
+declare const validate: (value: string) => ValidateResult;
+declare const format: (value: string) => string;
+/**
+ * Belize Tax Identification Number.
+ *
+ * Examples derived from stdnum-js test suite.
+ */
+declare const tin: Validator;
+//#endregion
+export { compact, tin as default, format, validate };
+//# sourceMappingURL=tin.d.ts.map

package/dist/bz/tin.js

@@ -0,0 +1,85 @@
+import { clean } from "../_util/clean.js";
+import { err } from "../_util/result.js";
+//#region src/bz/tin.ts
+/**
+* TIN (Belize Tax Identification Number).
+*
+* Issued by the Belize Tax Service Department to
+* individuals, sole proprietors, partnerships, and
+* companies. The base number is 6 digits generated
+* by the Revenue Management System. A 2-digit
+* suffix code may be appended to indicate entity
+* type:
+*   - 10: individual
+*   - 13: company
+*   - 66: company (alternate)
+*
+* The OECD spec mentions a 7th check digit that is
+* not visible to the taxpayer; in practice the
+* number circulates as 6 or 8 digits (6 + suffix).
+*
+* Formatted as NNNNNN-SS (when suffix is present).
+*
+* Source: OECD CRS TIN information sheet; Belize
+* Tax Service (https://bts.gov.bz/).
+*
+* PERSON/ENTITY
+*
+* @see https://www.oecd.org/tax/automatic-exchange/crs-implementation-and-assistance/tax-identification-numbers/Belize-TIN.pdf
+*/
+/** Valid 2-digit suffix codes. */
+const SUFFIX_CODES = [
+	"10",
+	"13",
+	"66"
+];
+const compact = (value) => {
+	return clean(value, " -").trim();
+};
+const validate = (value) => {
+	const v = compact(value);
+	if (v.length !== 6 && v.length !== 8) return err("INVALID_LENGTH", "Belize TIN must be 6 or 8 digits");
+	if (!/^\d+$/.test(v)) return err("INVALID_FORMAT", "Belize TIN must contain only digits");
+	if (v.length === 8) {
+		const suffix = v.slice(6);
+		if (!SUFFIX_CODES.includes(suffix)) return err("INVALID_COMPONENT", "Belize TIN suffix must be 10, 13, or 66");
+	}
+	return {
+		valid: true,
+		compact: v
+	};
+};
+const format = (value) => {
+	const v = compact(value);
+	if (v.length <= 6) return v;
+	return `${v.slice(0, 6)}-${v.slice(6)}`;
+};
+/**
+* Belize Tax Identification Number.
+*
+* Examples derived from stdnum-js test suite.
+*/
+const tin = {
+	name: "Belize Tax Identification Number",
+	localName: "Tax Identification Number",
+	abbreviation: "TIN",
+	aliases: ["TIN"],
+	candidatePattern: "\\d{6}",
+	country: "BZ",
+	entityType: "any",
+	lengths: [6, 8],
+	examples: [
+		"000005",
+		"00000510",
+		"00000513"
+	],
+	compact,
+	format,
+	validate,
+	description: "Belize tax number issued by the Belize Tax Service Department",
+	sourceUrl: "https://www.oecd.org/tax/automatic-exchange/crs-implementation-and-assistance/tax-identification-numbers/Belize-TIN.pdf"
+};
+//#endregion
+export { compact, tin as default, format, validate };
+
+//# sourceMappingURL=tin.js.map

package/dist/bz/tin.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tin.js","names":[],"sources":["../../src/bz/tin.ts"],"sourcesContent":["/**\n * TIN (Belize Tax Identification Number).\n *\n * Issued by the Belize Tax Service Department to\n * individuals, sole proprietors, partnerships, and\n * companies. The base number is 6 digits generated\n * by the Revenue Management System. A 2-digit\n * suffix code may be appended to indicate entity\n * type:\n *   - 10: individual\n *   - 13: company\n *   - 66: company (alternate)\n *\n * The OECD spec mentions a 7th check digit that is\n * not visible to the taxpayer; in practice the\n * number circulates as 6 or 8 digits (6 + suffix).\n *\n * Formatted as NNNNNN-SS (when suffix is present).\n *\n * Source: OECD CRS TIN information sheet; Belize\n * Tax Service (https://bts.gov.bz/).\n *\n * PERSON/ENTITY\n *\n * @see https://www.oecd.org/tax/automatic-exchange/crs-implementation-and-assistance/tax-identification-numbers/Belize-TIN.pdf\n */\n\nimport { clean } from \"#util/clean\";\nimport { err } from \"#util/result\";\n\nimport type { ValidateResult, Validator } from \"../types\";\n\n/** Valid 2-digit suffix codes. */\nconst SUFFIX_CODES = [\"10\", \"13\", \"66\"] as const;\n\nconst compact = (value: string): string => {\n  return clean(value, \" -\").trim();\n};\n\nconst validate = (value: string): ValidateResult => {\n  const v = compact(value);\n\n  if (v.length !== 6 && v.length !== 8) {\n    return err(\n      \"INVALID_LENGTH\",\n      \"Belize TIN must be 6 or 8 digits\",\n    );\n  }\n\n  if (!/^\\d+$/.test(v)) {\n    return err(\n      \"INVALID_FORMAT\",\n      \"Belize TIN must contain only digits\",\n    );\n  }\n\n  if (v.length === 8) {\n    const suffix = v.slice(6);\n    if (\n      !SUFFIX_CODES.includes(\n        suffix as (typeof SUFFIX_CODES)[number],\n      )\n    ) {\n      return err(\n        \"INVALID_COMPONENT\",\n        \"Belize TIN suffix must be 10, 13, or 66\",\n      );\n    }\n  }\n\n  return { valid: true, compact: v };\n};\n\nconst format = (value: string): string => {\n  const v = compact(value);\n  if (v.length <= 6) {\n    return v;\n  }\n  return `${v.slice(0, 6)}-${v.slice(6)}`;\n};\n\n/**\n * Belize Tax Identification Number.\n *\n * Examples derived from stdnum-js test suite.\n */\nconst tin: Validator = {\n  name: \"Belize Tax Identification Number\",\n  localName: \"Tax Identification Number\",\n  abbreviation: \"TIN\",\n  aliases: [\"TIN\"] as const,\n  candidatePattern: \"\\\\d{6}\",\n  country: \"BZ\",\n  entityType: \"any\",\n  lengths: [6, 8] as const,\n  examples: [\"000005\", \"00000510\", \"00000513\"] as const,\n  compact,\n  format,\n  validate,\n  description:\n    \"Belize tax number issued by the Belize Tax Service Department\",\n  sourceUrl:\n    \"https://www.oecd.org/tax/automatic-exchange/crs-implementation-and-assistance/tax-identification-numbers/Belize-TIN.pdf\",\n};\n\nexport default tin;\nexport { compact, format, validate };\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiCA,MAAM,eAAe;CAAC;CAAM;CAAM;CAAK;AAEvC,MAAM,WAAW,UAA0B;AACzC,QAAO,MAAM,OAAO,KAAK,CAAC,MAAM;;AAGlC,MAAM,YAAY,UAAkC;CAClD,MAAM,IAAI,QAAQ,MAAM;AAExB,KAAI,EAAE,WAAW,KAAK,EAAE,WAAW,EACjC,QAAO,IACL,kBACA,mCACD;AAGH,KAAI,CAAC,QAAQ,KAAK,EAAE,CAClB,QAAO,IACL,kBACA,sCACD;AAGH,KAAI,EAAE,WAAW,GAAG;EAClB,MAAM,SAAS,EAAE,MAAM,EAAE;AACzB,MACE,CAAC,aAAa,SACZ,OACD,CAED,QAAO,IACL,qBACA,0CACD;;AAIL,QAAO;EAAE,OAAO;EAAM,SAAS;EAAG;;AAGpC,MAAM,UAAU,UAA0B;CACxC,MAAM,IAAI,QAAQ,MAAM;AACxB,KAAI,EAAE,UAAU,EACd,QAAO;AAET,QAAO,GAAG,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE;;;;;;;AAQvC,MAAM,MAAiB;CACrB,MAAM;CACN,WAAW;CACX,cAAc;CACd,SAAS,CAAC,MAAM;CAChB,kBAAkB;CAClB,SAAS;CACT,YAAY;CACZ,SAAS,CAAC,GAAG,EAAE;CACf,UAAU;EAAC;EAAU;EAAY;EAAW;CAC5C;CACA;CACA;CACA,aACE;CACF,WACE;CACH"}

package/dist/ca/bn.d.ts

@@ -0,0 +1,14 @@
+import { ValidateResult, Validator } from "../types.js";
+
+//#region src/ca/bn.d.ts
+
+declare const compact: (value: string) => string;
+declare const validate: (value: string) => ValidateResult;
+declare const format: (value: string) => string;
+/** Generate a random valid Canadian BN. */
+declare const generate: () => string;
+/** Canadian Business Number. */
+declare const bn: Validator;
+//#endregion
+export { compact, bn as default, format, generate, validate };
+//# sourceMappingURL=bn.d.ts.map