@stll/stdnum 2.1.1 → 2.1.2

package/dist/_checksums/mod1110.js

@@ -1,25 +0,0 @@
-//#region src/_checksums/mod1110.ts
-/**
-* ISO 7064 Mod 11,10 check digit algorithm.
-* Used by DE VAT, DE IdNr, HR OIB.
-*/
-/** Compute the Mod 11,10 check digit for a payload. */
-const mod1110checkDigit = (payload) => {
-	let product = 10;
-	for (let i = 0; i < payload.length; i++) {
-		let sum = (Number(payload[i]) + product) % 10;
-		if (sum === 0) sum = 10;
-		product = sum * 2 % 11;
-	}
-	return (11 - product) % 10;
-};
-/** Validate a string with a Mod 11,10 check digit. */
-const mod1110validate = (value) => {
-	const payload = value.slice(0, -1);
-	const check = Number(value.at(-1));
-	return mod1110checkDigit(payload) === check;
-};
-//#endregion
-export { mod1110checkDigit, mod1110validate };
-
-//# sourceMappingURL=mod1110.js.map

package/dist/_checksums/mod1110.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mod1110.js","names":[],"sources":["../../src/_checksums/mod1110.ts"],"sourcesContent":["/**\n * ISO 7064 Mod 11,10 check digit algorithm.\n * Used by DE VAT, DE IdNr, HR OIB.\n */\n\n/** Compute the Mod 11,10 check digit for a payload. */\nexport const mod1110checkDigit = (\n  payload: string,\n): number => {\n  let product = 10;\n  for (let i = 0; i < payload.length; i++) {\n    let sum = (Number(payload[i]) + product) % 10;\n    if (sum === 0) sum = 10;\n    product = (sum * 2) % 11;\n  }\n  return (11 - product) % 10;\n};\n\n/** Validate a string with a Mod 11,10 check digit. */\nexport const mod1110validate = (value: string): boolean => {\n  const payload = value.slice(0, -1);\n  const check = Number(value.at(-1));\n  return mod1110checkDigit(payload) === check;\n};\n"],"mappings":";;;;;;AAMA,MAAa,qBACX,YACW;CACX,IAAI,UAAU;CACd,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;EACvC,IAAI,OAAO,OAAO,QAAQ,EAAE,IAAI,WAAW;EAC3C,IAAI,QAAQ,GAAG,MAAM;EACrB,UAAW,MAAM,IAAK;CACxB;CACA,QAAQ,KAAK,WAAW;AAC1B;;AAGA,MAAa,mBAAmB,UAA2B;CACzD,MAAM,UAAU,MAAM,MAAM,GAAG,EAAE;CACjC,MAAM,QAAQ,OAAO,MAAM,GAAG,EAAE,CAAC;CACjC,OAAO,kBAAkB,OAAO,MAAM;AACxC"}

package/dist/_checksums/mod112.d.ts

@@ -1,24 +0,0 @@
-//#region src/_checksums/mod112.d.ts
-/**
- * ISO 7064 Mod 11,2 check character algorithm.
- * Used by CN RIC (Resident Identity Card).
- *
- * Weights are powers of 2 modulo 11
- * (2^17 mod 11 ... 2^1 mod 11), applied
- * left-to-right across the 17-character payload.
- * The check character is looked up from
- * "10X98765432".
- */
-/**
- * Compute the ISO 7064 Mod 11,2 check character
- * for a 17-character payload.
- */
-declare const mod112checkChar: (payload: string) => string;
-/**
- * Validate an 18-character string with a Mod 11,2
- * check character (last char is 0-9 or X).
- */
-declare const mod112validate: (value: string) => boolean;
-//#endregion
-export { mod112checkChar, mod112validate };
-//# sourceMappingURL=mod112.d.ts.map

package/dist/_checksums/mod112.js

@@ -1,53 +0,0 @@
-//#region src/_checksums/mod112.ts
-/**
-* ISO 7064 Mod 11,2 check character algorithm.
-* Used by CN RIC (Resident Identity Card).
-*
-* Weights are powers of 2 modulo 11
-* (2^17 mod 11 ... 2^1 mod 11), applied
-* left-to-right across the 17-character payload.
-* The check character is looked up from
-* "10X98765432".
-*/
-const WEIGHTS = [
-	7,
-	9,
-	10,
-	5,
-	8,
-	4,
-	2,
-	1,
-	6,
-	3,
-	7,
-	9,
-	10,
-	5,
-	8,
-	4,
-	2
-];
-const CHECK_CHARS = "10X98765432";
-/**
-* Compute the ISO 7064 Mod 11,2 check character
-* for a 17-character payload.
-*/
-const mod112checkChar = (payload) => {
-	let sum = 0;
-	for (const [i, weight] of WEIGHTS.entries()) sum += Number(payload[i]) * weight;
-	return CHECK_CHARS[sum % 11] ?? "";
-};
-/**
-* Validate an 18-character string with a Mod 11,2
-* check character (last char is 0-9 or X).
-*/
-const mod112validate = (value) => {
-	const check = value[17]?.toUpperCase();
-	if (check === void 0) return false;
-	return mod112checkChar(value.slice(0, 17)) === check;
-};
-//#endregion
-export { mod112checkChar, mod112validate };
-
-//# sourceMappingURL=mod112.js.map

package/dist/_checksums/mod112.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mod112.js","names":[],"sources":["../../src/_checksums/mod112.ts"],"sourcesContent":["/**\n * ISO 7064 Mod 11,2 check character algorithm.\n * Used by CN RIC (Resident Identity Card).\n *\n * Weights are powers of 2 modulo 11\n * (2^17 mod 11 ... 2^1 mod 11), applied\n * left-to-right across the 17-character payload.\n * The check character is looked up from\n * \"10X98765432\".\n */\n\nconst WEIGHTS = [\n  7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2,\n] as const;\n\nconst CHECK_CHARS = \"10X98765432\";\n\n/**\n * Compute the ISO 7064 Mod 11,2 check character\n * for a 17-character payload.\n */\nexport const mod112checkChar = (\n  payload: string,\n): string => {\n  let sum = 0;\n  for (const [i, weight] of WEIGHTS.entries()) {\n    sum += Number(payload[i]) * weight;\n  }\n  // SAFETY: sum % 11 is in 0..10 and CHECK_CHARS has 11 chars.\n  return CHECK_CHARS[sum % 11] ?? \"\";\n};\n\n/**\n * Validate an 18-character string with a Mod 11,2\n * check character (last char is 0-9 or X).\n */\nexport const mod112validate = (value: string): boolean => {\n  const check = value[17]?.toUpperCase();\n  if (check === undefined) return false;\n  return mod112checkChar(value.slice(0, 17)) === check;\n};\n"],"mappings":";;;;;;;;;;;AAWA,MAAM,UAAU;CACd;CAAG;CAAG;CAAI;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAG;CAAG;CAAG;AACpD;AAEA,MAAM,cAAc;;;;;AAMpB,MAAa,mBACX,YACW;CACX,IAAI,MAAM;CACV,KAAK,MAAM,CAAC,GAAG,WAAW,QAAQ,QAAQ,GACxC,OAAO,OAAO,QAAQ,EAAE,IAAI;CAG9B,OAAO,YAAY,MAAM,OAAO;AAClC;;;;;AAMA,MAAa,kBAAkB,UAA2B;CACxD,MAAM,QAAQ,MAAM,GAAG,EAAE,YAAY;CACrC,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,OAAO,gBAAgB,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM;AACjD"}

package/dist/_checksums/mod97.d.ts

@@ -1,23 +0,0 @@
-//#region src/_checksums/mod97.d.ts
-/**
- * ISO 7064 Mod 97-10 checksum.
- * Used by IBAN and LEI.
- *
- * Processes one digit at a time to avoid BigInt.
- */
-/**
- * Compute mod 97 of a numeric string.
- * Letters must already be converted to digits.
- */
-declare const mod97: (value: string) => number;
-/**
- * Validate a string using ISO 7064 Mod 97-10.
- * The remainder must equal 1.
- *
- * @param value - Numeric string (letters already
- *   converted via charValue)
- */
-declare const mod97validate: (value: string) => boolean;
-//#endregion
-export { mod97, mod97validate };
-//# sourceMappingURL=mod97.d.ts.map

package/dist/_checksums/mod97.js

@@ -1,28 +0,0 @@
-//#region src/_checksums/mod97.ts
-/**
-* ISO 7064 Mod 97-10 checksum.
-* Used by IBAN and LEI.
-*
-* Processes one digit at a time to avoid BigInt.
-*/
-/**
-* Compute mod 97 of a numeric string.
-* Letters must already be converted to digits.
-*/
-const mod97 = (value) => {
-	let remainder = 0;
-	for (let i = 0; i < value.length; i++) remainder = (remainder * 10 + Number(value[i])) % 97;
-	return remainder;
-};
-/**
-* Validate a string using ISO 7064 Mod 97-10.
-* The remainder must equal 1.
-*
-* @param value - Numeric string (letters already
-*   converted via charValue)
-*/
-const mod97validate = (value) => mod97(value) === 1;
-//#endregion
-export { mod97, mod97validate };
-
-//# sourceMappingURL=mod97.js.map

package/dist/_checksums/mod97.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mod97.js","names":[],"sources":["../../src/_checksums/mod97.ts"],"sourcesContent":["/**\n * ISO 7064 Mod 97-10 checksum.\n * Used by IBAN and LEI.\n *\n * Processes one digit at a time to avoid BigInt.\n */\n\n/**\n * Compute mod 97 of a numeric string.\n * Letters must already be converted to digits.\n */\nexport const mod97 = (value: string): number => {\n  let remainder = 0;\n  for (let i = 0; i < value.length; i++) {\n    remainder = (remainder * 10 + Number(value[i])) % 97;\n  }\n  return remainder;\n};\n\n/**\n * Validate a string using ISO 7064 Mod 97-10.\n * The remainder must equal 1.\n *\n * @param value - Numeric string (letters already\n *   converted via charValue)\n */\nexport const mod97validate = (value: string): boolean =>\n  mod97(value) === 1;\n"],"mappings":";;;;;;;;;;;AAWA,MAAa,SAAS,UAA0B;CAC9C,IAAI,YAAY;CAChB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,aAAa,YAAY,KAAK,OAAO,MAAM,EAAE,KAAK;CAEpD,OAAO;AACT;;;;;;;;AASA,MAAa,iBAAiB,UAC5B,MAAM,KAAK,MAAM"}

package/dist/_checksums/sha256.d.ts

@@ -1,5 +0,0 @@
-//#region src/_checksums/sha256.d.ts
-declare const sha256: (bytes: Uint8Array) => Uint8Array;
-//#endregion
-export { sha256 };
-//# sourceMappingURL=sha256.d.ts.map

package/dist/_checksums/sha256.js

@@ -1,164 +0,0 @@
-//#region src/_checksums/sha256.ts
-const K = new Uint32Array([
-	1116352408,
-	1899447441,
-	3049323471,
-	3921009573,
-	961987163,
-	1508970993,
-	2453635748,
-	2870763221,
-	3624381080,
-	310598401,
-	607225278,
-	1426881987,
-	1925078388,
-	2162078206,
-	2614888103,
-	3248222580,
-	3835390401,
-	4022224774,
-	264347078,
-	604807628,
-	770255983,
-	1249150122,
-	1555081692,
-	1996064986,
-	2554220882,
-	2821834349,
-	2952996808,
-	3210313671,
-	3336571891,
-	3584528711,
-	113926993,
-	338241895,
-	666307205,
-	773529912,
-	1294757372,
-	1396182291,
-	1695183700,
-	1986661051,
-	2177026350,
-	2456956037,
-	2730485921,
-	2820302411,
-	3259730800,
-	3345764771,
-	3516065817,
-	3600352804,
-	4094571909,
-	275423344,
-	430227734,
-	506948616,
-	659060556,
-	883997877,
-	958139571,
-	1322822218,
-	1537002063,
-	1747873779,
-	1955562222,
-	2024104815,
-	2227730452,
-	2361852424,
-	2428436474,
-	2756734187,
-	3204031479,
-	3329325298
-]);
-const rotr = (value, bits) => value >>> bits | value << 32 - bits;
-const sha256 = (bytes) => {
-	const bitLength = bytes.length * 8;
-	const messageLength = bytes.length + 1;
-	const totalLength = messageLength + (64 - (messageLength + 8) % 64) % 64 + 8;
-	const message = new Uint8Array(totalLength);
-	message.set(bytes);
-	message[bytes.length] = 128;
-	const high = Math.floor(bitLength / 4294967296);
-	const low = bitLength >>> 0;
-	message[totalLength - 8] = high >>> 24;
-	message[totalLength - 7] = high >>> 16;
-	message[totalLength - 6] = high >>> 8;
-	message[totalLength - 5] = high;
-	message[totalLength - 4] = low >>> 24;
-	message[totalLength - 3] = low >>> 16;
-	message[totalLength - 2] = low >>> 8;
-	message[totalLength - 1] = low;
-	let h0 = 1779033703;
-	let h1 = 3144134277;
-	let h2 = 1013904242;
-	let h3 = 2773480762;
-	let h4 = 1359893119;
-	let h5 = 2600822924;
-	let h6 = 528734635;
-	let h7 = 1541459225;
-	const words = new Uint32Array(64);
-	for (let offset = 0; offset < totalLength; offset += 64) {
-		for (let i = 0; i < 16; i += 1) {
-			const j = offset + i * 4;
-			words[i] = (message[j] ?? 0) << 24 | (message[j + 1] ?? 0) << 16 | (message[j + 2] ?? 0) << 8 | (message[j + 3] ?? 0);
-		}
-		for (let i = 16; i < 64; i += 1) {
-			const w2 = words[i - 2] ?? 0;
-			const w7 = words[i - 7] ?? 0;
-			const w15 = words[i - 15] ?? 0;
-			const w16 = words[i - 16] ?? 0;
-			const s0 = rotr(w15, 7) ^ rotr(w15, 18) ^ w15 >>> 3;
-			const s1 = rotr(w2, 17) ^ rotr(w2, 19) ^ w2 >>> 10;
-			words[i] = w16 + s0 + w7 + s1 >>> 0;
-		}
-		let a = h0;
-		let b = h1;
-		let c = h2;
-		let d = h3;
-		let e = h4;
-		let f = h5;
-		let g = h6;
-		let h = h7;
-		for (let i = 0; i < 64; i += 1) {
-			const s1 = rotr(e, 6) ^ rotr(e, 11) ^ rotr(e, 25);
-			const ch = e & f ^ ~e & g;
-			const temp1 = h + s1 + ch + (K[i] ?? 0) + (words[i] ?? 0) >>> 0;
-			const temp2 = (rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22)) + (a & b ^ a & c ^ b & c) >>> 0;
-			h = g;
-			g = f;
-			f = e;
-			e = d + temp1 >>> 0;
-			d = c;
-			c = b;
-			b = a;
-			a = temp1 + temp2 >>> 0;
-		}
-		h0 = h0 + a >>> 0;
-		h1 = h1 + b >>> 0;
-		h2 = h2 + c >>> 0;
-		h3 = h3 + d >>> 0;
-		h4 = h4 + e >>> 0;
-		h5 = h5 + f >>> 0;
-		h6 = h6 + g >>> 0;
-		h7 = h7 + h >>> 0;
-	}
-	const digest = new Uint8Array(32);
-	const hash = [
-		h0,
-		h1,
-		h2,
-		h3,
-		h4,
-		h5,
-		h6,
-		h7
-	];
-	for (let i = 0; i < hash.length; i += 1) {
-		const value = hash[i] ?? 0;
-		const j = i * 4;
-		digest[j] = value >>> 24;
-		digest[j + 1] = value >>> 16;
-		digest[j + 2] = value >>> 8;
-		digest[j + 3] = value;
-	}
-	return digest;
-};
-//#endregion
-export { sha256 };
-
-//# sourceMappingURL=sha256.js.map

package/dist/_checksums/sha256.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sha256.js","names":[],"sources":["../../src/_checksums/sha256.ts"],"sourcesContent":["const K = new Uint32Array([\n  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,\n  0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,\n  0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,\n  0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,\n  0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,\n  0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,\n  0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,\n  0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,\n  0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,\n]);\n\nconst rotr = (value: number, bits: number): number =>\n  (value >>> bits) | (value << (32 - bits));\n\nexport const sha256 = (bytes: Uint8Array): Uint8Array => {\n  const bitLength = bytes.length * 8;\n  const messageLength = bytes.length + 1;\n  const paddingLength =\n    (64 - ((messageLength + 8) % 64)) % 64;\n  const totalLength = messageLength + paddingLength + 8;\n  const message = new Uint8Array(totalLength);\n  message.set(bytes);\n  message[bytes.length] = 0x80;\n\n  const high = Math.floor(bitLength / 0x1_0000_0000);\n  const low = bitLength >>> 0;\n  message[totalLength - 8] = high >>> 24;\n  message[totalLength - 7] = high >>> 16;\n  message[totalLength - 6] = high >>> 8;\n  message[totalLength - 5] = high;\n  message[totalLength - 4] = low >>> 24;\n  message[totalLength - 3] = low >>> 16;\n  message[totalLength - 2] = low >>> 8;\n  message[totalLength - 1] = low;\n\n  let h0 = 0x6a09e667;\n  let h1 = 0xbb67ae85;\n  let h2 = 0x3c6ef372;\n  let h3 = 0xa54ff53a;\n  let h4 = 0x510e527f;\n  let h5 = 0x9b05688c;\n  let h6 = 0x1f83d9ab;\n  let h7 = 0x5be0cd19;\n\n  const words = new Uint32Array(64);\n\n  for (let offset = 0; offset < totalLength; offset += 64) {\n    for (let i = 0; i < 16; i += 1) {\n      const j = offset + i * 4;\n      words[i] =\n        ((message[j] ?? 0) << 24) |\n        ((message[j + 1] ?? 0) << 16) |\n        ((message[j + 2] ?? 0) << 8) |\n        (message[j + 3] ?? 0);\n    }\n\n    for (let i = 16; i < 64; i += 1) {\n      const w2 = words[i - 2] ?? 0;\n      const w7 = words[i - 7] ?? 0;\n      const w15 = words[i - 15] ?? 0;\n      const w16 = words[i - 16] ?? 0;\n      const s0 = rotr(w15, 7) ^ rotr(w15, 18) ^ (w15 >>> 3);\n      const s1 = rotr(w2, 17) ^ rotr(w2, 19) ^ (w2 >>> 10);\n      words[i] = (w16 + s0 + w7 + s1) >>> 0;\n    }\n\n    let a = h0;\n    let b = h1;\n    let c = h2;\n    let d = h3;\n    let e = h4;\n    let f = h5;\n    let g = h6;\n    let h = h7;\n\n    for (let i = 0; i < 64; i += 1) {\n      const s1 = rotr(e, 6) ^ rotr(e, 11) ^ rotr(e, 25);\n      const ch = (e & f) ^ (~e & g);\n      const temp1 =\n        (h + s1 + ch + (K[i] ?? 0) + (words[i] ?? 0)) >>> 0;\n      const s0 = rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22);\n      const maj = (a & b) ^ (a & c) ^ (b & c);\n      const temp2 = (s0 + maj) >>> 0;\n\n      h = g;\n      g = f;\n      f = e;\n      e = (d + temp1) >>> 0;\n      d = c;\n      c = b;\n      b = a;\n      a = (temp1 + temp2) >>> 0;\n    }\n\n    h0 = (h0 + a) >>> 0;\n    h1 = (h1 + b) >>> 0;\n    h2 = (h2 + c) >>> 0;\n    h3 = (h3 + d) >>> 0;\n    h4 = (h4 + e) >>> 0;\n    h5 = (h5 + f) >>> 0;\n    h6 = (h6 + g) >>> 0;\n    h7 = (h7 + h) >>> 0;\n  }\n\n  const digest = new Uint8Array(32);\n  const hash = [h0, h1, h2, h3, h4, h5, h6, h7];\n  for (let i = 0; i < hash.length; i += 1) {\n    const value = hash[i] ?? 0;\n    const j = i * 4;\n    digest[j] = value >>> 24;\n    digest[j + 1] = value >>> 16;\n    digest[j + 2] = value >>> 8;\n    digest[j + 3] = value;\n  }\n\n  return digest;\n};\n"],"mappings":";AAAA,MAAM,IAAI,IAAI,YAAY;CACxB;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;CACpC;CAAY;CAAY;CAAY;AACtC,CAAC;AAED,MAAM,QAAQ,OAAe,SAC1B,UAAU,OAAS,SAAU,KAAK;AAErC,MAAa,UAAU,UAAkC;CACvD,MAAM,YAAY,MAAM,SAAS;CACjC,MAAM,gBAAgB,MAAM,SAAS;CAGrC,MAAM,cAAc,iBADjB,MAAO,gBAAgB,KAAK,MAAO,KACc;CACpD,MAAM,UAAU,IAAI,WAAW,WAAW;CAC1C,QAAQ,IAAI,KAAK;CACjB,QAAQ,MAAM,UAAU;CAExB,MAAM,OAAO,KAAK,MAAM,YAAY,UAAa;CACjD,MAAM,MAAM,cAAc;CAC1B,QAAQ,cAAc,KAAK,SAAS;CACpC,QAAQ,cAAc,KAAK,SAAS;CACpC,QAAQ,cAAc,KAAK,SAAS;CACpC,QAAQ,cAAc,KAAK;CAC3B,QAAQ,cAAc,KAAK,QAAQ;CACnC,QAAQ,cAAc,KAAK,QAAQ;CACnC,QAAQ,cAAc,KAAK,QAAQ;CACnC,QAAQ,cAAc,KAAK;CAE3B,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CAET,MAAM,QAAQ,IAAI,YAAY,EAAE;CAEhC,KAAK,IAAI,SAAS,GAAG,SAAS,aAAa,UAAU,IAAI;EACvD,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;GAC9B,MAAM,IAAI,SAAS,IAAI;GACvB,MAAM,MACF,QAAQ,MAAM,MAAM,MACpB,QAAQ,IAAI,MAAM,MAAM,MACxB,QAAQ,IAAI,MAAM,MAAM,KACzB,QAAQ,IAAI,MAAM;EACvB;EAEA,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,GAAG;GAC/B,MAAM,KAAK,MAAM,IAAI,MAAM;GAC3B,MAAM,KAAK,MAAM,IAAI,MAAM;GAC3B,MAAM,MAAM,MAAM,IAAI,OAAO;GAC7B,MAAM,MAAM,MAAM,IAAI,OAAO;GAC7B,MAAM,KAAK,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,EAAE,IAAK,QAAQ;GACnD,MAAM,KAAK,KAAK,IAAI,EAAE,IAAI,KAAK,IAAI,EAAE,IAAK,OAAO;GACjD,MAAM,KAAM,MAAM,KAAK,KAAK,OAAQ;EACtC;EAEA,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EAER,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;GAC9B,MAAM,KAAK,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE;GAChD,MAAM,KAAM,IAAI,IAAM,CAAC,IAAI;GAC3B,MAAM,QACH,IAAI,KAAK,MAAM,EAAE,MAAM,MAAM,MAAM,MAAM,OAAQ;GAGpD,MAAM,SAFK,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE,MACnC,IAAI,IAAM,IAAI,IAAM,IAAI,OACR;GAE7B,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,IAAK,IAAI,UAAW;GACpB,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,IAAK,QAAQ,UAAW;EAC1B;EAEA,KAAM,KAAK,MAAO;EAClB,KAAM,KAAK,MAAO;EAClB,KAAM,KAAK,MAAO;EAClB,KAAM,KAAK,MAAO;EAClB,KAAM,KAAK,MAAO;EAClB,KAAM,KAAK,MAAO;EAClB,KAAM,KAAK,MAAO;EAClB,KAAM,KAAK,MAAO;CACpB;CAEA,MAAM,SAAS,IAAI,WAAW,EAAE;CAChC,MAAM,OAAO;EAAC;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;CAAE;CAC5C,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;EACvC,MAAM,QAAQ,KAAK,MAAM;EACzB,MAAM,IAAI,IAAI;EACd,OAAO,KAAK,UAAU;EACtB,OAAO,IAAI,KAAK,UAAU;EAC1B,OAAO,IAAI,KAAK,UAAU;EAC1B,OAAO,IAAI,KAAK;CAClB;CAEA,OAAO;AACT"}

package/dist/_checksums/verhoeff.d.ts

@@ -1,22 +0,0 @@
-//#region src/_checksums/verhoeff.d.ts
-/**
- * Verhoeff checksum algorithm.
- *
- * Uses three tables (d, p, inv) to detect all
- * single-digit and adjacent-transposition errors.
- * Used by Indian Aadhaar numbers.
- *
- * @see https://en.wikipedia.org/wiki/Verhoeff_algorithm
- */
-/** Compute the Verhoeff checksum of a digit string. */
-declare const verhoeffChecksum: (value: string) => number;
-/** Validate a digit string using Verhoeff. */
-declare const verhoeffValidate: (value: string) => boolean;
-/**
- * Calculate the Verhoeff check digit for a
- * digit string (without the check digit).
- */
-declare const verhoeffCheckDigit: (value: string) => number;
-//#endregion
-export { verhoeffCheckDigit, verhoeffChecksum, verhoeffValidate };
-//# sourceMappingURL=verhoeff.d.ts.map

package/dist/_checksums/verhoeff.js

@@ -1,271 +0,0 @@
-//#region src/_checksums/verhoeff.ts
-/**
-* Verhoeff checksum algorithm.
-*
-* Uses three tables (d, p, inv) to detect all
-* single-digit and adjacent-transposition errors.
-* Used by Indian Aadhaar numbers.
-*
-* @see https://en.wikipedia.org/wiki/Verhoeff_algorithm
-*/
-const D = [
-	[
-		0,
-		1,
-		2,
-		3,
-		4,
-		5,
-		6,
-		7,
-		8,
-		9
-	],
-	[
-		1,
-		2,
-		3,
-		4,
-		0,
-		6,
-		7,
-		8,
-		9,
-		5
-	],
-	[
-		2,
-		3,
-		4,
-		0,
-		1,
-		7,
-		8,
-		9,
-		5,
-		6
-	],
-	[
-		3,
-		4,
-		0,
-		1,
-		2,
-		8,
-		9,
-		5,
-		6,
-		7
-	],
-	[
-		4,
-		0,
-		1,
-		2,
-		3,
-		9,
-		5,
-		6,
-		7,
-		8
-	],
-	[
-		5,
-		9,
-		8,
-		7,
-		6,
-		0,
-		4,
-		3,
-		2,
-		1
-	],
-	[
-		6,
-		5,
-		9,
-		8,
-		7,
-		1,
-		0,
-		4,
-		3,
-		2
-	],
-	[
-		7,
-		6,
-		5,
-		9,
-		8,
-		2,
-		1,
-		0,
-		4,
-		3
-	],
-	[
-		8,
-		7,
-		6,
-		5,
-		9,
-		3,
-		2,
-		1,
-		0,
-		4
-	],
-	[
-		9,
-		8,
-		7,
-		6,
-		5,
-		4,
-		3,
-		2,
-		1,
-		0
-	]
-];
-const P = [
-	[
-		0,
-		1,
-		2,
-		3,
-		4,
-		5,
-		6,
-		7,
-		8,
-		9
-	],
-	[
-		1,
-		5,
-		7,
-		6,
-		2,
-		8,
-		3,
-		0,
-		9,
-		4
-	],
-	[
-		5,
-		8,
-		0,
-		3,
-		7,
-		9,
-		6,
-		1,
-		4,
-		2
-	],
-	[
-		8,
-		9,
-		1,
-		6,
-		0,
-		4,
-		3,
-		5,
-		2,
-		7
-	],
-	[
-		9,
-		4,
-		5,
-		3,
-		1,
-		2,
-		6,
-		8,
-		7,
-		0
-	],
-	[
-		4,
-		2,
-		8,
-		6,
-		5,
-		7,
-		3,
-		9,
-		0,
-		1
-	],
-	[
-		2,
-		7,
-		9,
-		3,
-		8,
-		0,
-		6,
-		4,
-		1,
-		5
-	],
-	[
-		7,
-		0,
-		4,
-		6,
-		9,
-		1,
-		3,
-		2,
-		5,
-		8
-	]
-];
-const INV = [
-	0,
-	4,
-	3,
-	2,
-	1,
-	5,
-	6,
-	7,
-	8,
-	9
-];
-/** Compute the Verhoeff checksum of a digit string. */
-const verhoeffChecksum = (value) => {
-	let c = 0;
-	for (let i = value.length - 1; i >= 0; i--) {
-		const pos = (value.length - 1 - i) % 8;
-		const digit = Number(value[i]);
-		c = D[c][P[pos][digit]];
-	}
-	return c;
-};
-/** Validate a digit string using Verhoeff. */
-const verhoeffValidate = (value) => verhoeffChecksum(value) === 0;
-/**
-* Calculate the Verhoeff check digit for a
-* digit string (without the check digit).
-*/
-const verhoeffCheckDigit = (value) => {
-	let c = 0;
-	for (let i = value.length - 1; i >= 0; i--) {
-		const pos = (value.length - i) % 8;
-		const digit = Number(value[i]);
-		c = D[c][P[pos][digit]];
-	}
-	return INV[c];
-};
-//#endregion
-export { verhoeffCheckDigit, verhoeffChecksum, verhoeffValidate };
-
-//# sourceMappingURL=verhoeff.js.map

package/dist/_checksums/verhoeff.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"verhoeff.js","names":[],"sources":["../../src/_checksums/verhoeff.ts"],"sourcesContent":["/**\n * Verhoeff checksum algorithm.\n *\n * Uses three tables (d, p, inv) to detect all\n * single-digit and adjacent-transposition errors.\n * Used by Indian Aadhaar numbers.\n *\n * @see https://en.wikipedia.org/wiki/Verhoeff_algorithm\n */\n\n/* eslint-disable @typescript-eslint/no-non-null-assertion */\n\n// Dihedral group D5 multiplication table\nconst D: readonly (readonly number[])[] = [\n  [0, 1, 2, 3, 4, 5, 6, 7, 8, 9],\n  [1, 2, 3, 4, 0, 6, 7, 8, 9, 5],\n  [2, 3, 4, 0, 1, 7, 8, 9, 5, 6],\n  [3, 4, 0, 1, 2, 8, 9, 5, 6, 7],\n  [4, 0, 1, 2, 3, 9, 5, 6, 7, 8],\n  [5, 9, 8, 7, 6, 0, 4, 3, 2, 1],\n  [6, 5, 9, 8, 7, 1, 0, 4, 3, 2],\n  [7, 6, 5, 9, 8, 2, 1, 0, 4, 3],\n  [8, 7, 6, 5, 9, 3, 2, 1, 0, 4],\n  [9, 8, 7, 6, 5, 4, 3, 2, 1, 0],\n];\n\n// Permutation table\nconst P: readonly (readonly number[])[] = [\n  [0, 1, 2, 3, 4, 5, 6, 7, 8, 9],\n  [1, 5, 7, 6, 2, 8, 3, 0, 9, 4],\n  [5, 8, 0, 3, 7, 9, 6, 1, 4, 2],\n  [8, 9, 1, 6, 0, 4, 3, 5, 2, 7],\n  [9, 4, 5, 3, 1, 2, 6, 8, 7, 0],\n  [4, 2, 8, 6, 5, 7, 3, 9, 0, 1],\n  [2, 7, 9, 3, 8, 0, 6, 4, 1, 5],\n  [7, 0, 4, 6, 9, 1, 3, 2, 5, 8],\n];\n\n// Inverse table\nconst INV = [0, 4, 3, 2, 1, 5, 6, 7, 8, 9] as const;\n\n/** Compute the Verhoeff checksum of a digit string. */\nexport const verhoeffChecksum = (value: string): number => {\n  let c = 0;\n  for (let i = value.length - 1; i >= 0; i--) {\n    const pos = (value.length - 1 - i) % 8;\n    const digit = Number(value[i]);\n    c = D[c]![P[pos]![digit]!]!;\n  }\n  return c;\n};\n\n/** Validate a digit string using Verhoeff. */\nexport const verhoeffValidate = (value: string): boolean =>\n  verhoeffChecksum(value) === 0;\n\n/**\n * Calculate the Verhoeff check digit for a\n * digit string (without the check digit).\n */\nexport const verhoeffCheckDigit = (\n  value: string,\n): number => {\n  let c = 0;\n  for (let i = value.length - 1; i >= 0; i--) {\n    const pos = (value.length - i) % 8;\n    const digit = Number(value[i]);\n    c = D[c]![P[pos]![digit]!]!;\n  }\n  return INV[c]!;\n};\n"],"mappings":";;;;;;;;;;AAaA,MAAM,IAAoC;CACxC;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;AAC/B;AAGA,MAAM,IAAoC;CACxC;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAC7B;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;AAC/B;AAGA,MAAM,MAAM;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;AAAC;;AAGzC,MAAa,oBAAoB,UAA0B;CACzD,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;EAC1C,MAAM,OAAO,MAAM,SAAS,IAAI,KAAK;EACrC,MAAM,QAAQ,OAAO,MAAM,EAAE;EAC7B,IAAI,EAAE,EAAE,CAAE,EAAE,IAAI,CAAE;CACpB;CACA,OAAO;AACT;;AAGA,MAAa,oBAAoB,UAC/B,iBAAiB,KAAK,MAAM;;;;;AAM9B,MAAa,sBACX,UACW;CACX,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;EAC1C,MAAM,OAAO,MAAM,SAAS,KAAK;EACjC,MAAM,QAAQ,OAAO,MAAM,EAAE;EAC7B,IAAI,EAAE,EAAE,CAAE,EAAE,IAAI,CAAE;CACpB;CACA,OAAO,IAAI;AACb"}

package/dist/_checksums/weighted-sum.d.ts

@@ -1,13 +0,0 @@
-//#region src/_checksums/weighted-sum.d.ts
-/**
- * Compute a weighted sum of digits.
- *
- * @param value - String of digits
- * @param weights - Array of weights (cycled if
- *   shorter than value)
- * @param modulus - Modulus for the result
- */
-declare const weightedSum: (value: string, weights: readonly number[], modulus: number) => number;
-//#endregion
-export { weightedSum };
-//# sourceMappingURL=weighted-sum.d.ts.map

package/dist/_checksums/weighted-sum.js

@@ -1,22 +0,0 @@
-//#region src/_checksums/weighted-sum.ts
-/**
-* Compute a weighted sum of digits.
-*
-* @param value - String of digits
-* @param weights - Array of weights (cycled if
-*   shorter than value)
-* @param modulus - Modulus for the result
-*/
-const weightedSum = (value, weights, modulus) => {
-	let sum = 0;
-	for (let i = 0; i < value.length; i++) {
-		const digit = Number(value[i]);
-		const weight = weights[i % weights.length];
-		sum += digit * weight;
-	}
-	return (sum % modulus + modulus) % modulus;
-};
-//#endregion
-export { weightedSum };
-
-//# sourceMappingURL=weighted-sum.js.map