@stll/stdnum 2.1.0 → 2.1.2

package/src/_checksums/sha256.ts

@@ -1,125 +0,0 @@
-const K = new Uint32Array([
-  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
-  0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
-  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
-  0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
-  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
-  0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
-  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
-  0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
-  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
-  0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
-  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
-  0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
-  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
-  0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
-  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
-  0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
-]);
-
-const rotr = (value: number, bits: number): number =>
-  (value >>> bits) | (value << (32 - bits));
-
-export const sha256 = (bytes: Uint8Array): Uint8Array => {
-  const bitLength = bytes.length * 8;
-  const messageLength = bytes.length + 1;
-  const paddingLength =
-    (64 - ((messageLength + 8) % 64)) % 64;
-  const totalLength = messageLength + paddingLength + 8;
-  const message = new Uint8Array(totalLength);
-  message.set(bytes);
-  message[bytes.length] = 0x80;
-
-  const high = Math.floor(bitLength / 0x1_0000_0000);
-  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 = 0x6a09e667;
-  let h1 = 0xbb67ae85;
-  let h2 = 0x3c6ef372;
-  let h3 = 0xa54ff53a;
-  let h4 = 0x510e527f;
-  let h5 = 0x9b05688c;
-  let h6 = 0x1f83d9ab;
-  let h7 = 0x5be0cd19;
-
-  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 s0 = rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22);
-      const maj = (a & b) ^ (a & c) ^ (b & c);
-      const temp2 = (s0 + maj) >>> 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;
-};

package/src/_checksums/verhoeff.ts

@@ -1,71 +0,0 @@
-/**
- * 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
- */
-
-/* eslint-disable @typescript-eslint/no-non-null-assertion */
-
-// Dihedral group D5 multiplication table
-const D: readonly (readonly number[])[] = [
-  [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],
-];
-
-// Permutation table
-const P: readonly (readonly number[])[] = [
-  [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],
-];
-
-// Inverse table
-const INV = [0, 4, 3, 2, 1, 5, 6, 7, 8, 9] as const;
-
-/** Compute the Verhoeff checksum of a digit string. */
-export const verhoeffChecksum = (value: string): number => {
-  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. */
-export const verhoeffValidate = (value: string): boolean =>
-  verhoeffChecksum(value) === 0;
-
-/**
- * Calculate the Verhoeff check digit for a
- * digit string (without the check digit).
- */
-export const verhoeffCheckDigit = (
-  value: string,
-): number => {
-  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]!;
-};

package/src/_checksums/weighted-sum.ts

@@ -1,23 +0,0 @@
-/**
- * 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
- */
-export const weightedSum = (
-  value: string,
-  weights: readonly number[],
-  modulus: number,
-): number => {
-  let sum = 0;
-  for (let i = 0; i < value.length; i++) {
-    const digit = Number(value[i]);
-    // SAFETY: modulo guarantees valid index
-    // eslint-disable-next-line no-non-null-assertion
-    const weight = weights[i % weights.length]!;
-    sum += digit * weight;
-  }
-  return ((sum % modulus) + modulus) % modulus;
-};

package/src/_util/arabic.ts

@@ -1,48 +0,0 @@
-/**
- * Shared Arabic-Indic and Extended Arabic-Indic digit
- * normalization utilities.
- *
- * Arabic-Indic (U+0660..U+0669) and Extended Arabic-Indic
- * (U+06F0..U+06F9, used for Persian/Dari) digits are
- * mapped to ASCII 0-9.
- */
-
-export const ARABIC_DIGITS: Record<string, string> = {
-  "\u0660": "0", // ٠
-  "\u0661": "1", // ١
-  "\u0662": "2", // ٢
-  "\u0663": "3", // ٣
-  "\u0664": "4", // ٤
-  "\u0665": "5", // ٥
-  "\u0666": "6", // ٦
-  "\u0667": "7", // ٧
-  "\u0668": "8", // ٨
-  "\u0669": "9", // ٩
-  "\u06F0": "0", // ۰
-  "\u06F1": "1", // ۱
-  "\u06F2": "2", // ۲
-  "\u06F3": "3", // ۳
-  "\u06F4": "4", // ۴
-  "\u06F5": "5", // ۵
-  "\u06F6": "6", // ۶
-  "\u06F7": "7", // ۷
-  "\u06F8": "8", // ۸
-  "\u06F9": "9", // ۹
-};
-
-export const ARABIC_REGEX = new RegExp(
-  `[${Object.keys(ARABIC_DIGITS).join("")}]`,
-  "g",
-);
-
-/**
- * Replace Arabic-Indic and Extended Arabic-Indic digits
- * with their ASCII equivalents.
- */
-export const normalizeArabicDigits = (
-  value: string,
-): string =>
-  value.replace(
-    ARABIC_REGEX,
-    (ch) => ARABIC_DIGITS[ch] ?? ch,
-  );

package/src/_util/clean.ts

@@ -1,86 +0,0 @@
-/**
- * Unicode normalization map for common OCR, PDF
- * extraction, and copy-paste artifacts.
- *
- * Maps fullwidth digits, various dashes, dots,
- * spaces, and quotes to their ASCII equivalents.
- * Ported from python-stdnum's util.py _char_map.
- */
-const CHAR_MAP: Record<string, string> = {
-  // Fullwidth digits
-  "\uFF10": "0",
-  "\uFF11": "1",
-  "\uFF12": "2",
-  "\uFF13": "3",
-  "\uFF14": "4",
-  "\uFF15": "5",
-  "\uFF16": "6",
-  "\uFF17": "7",
-  "\uFF18": "8",
-  "\uFF19": "9",
-  // Dashes and hyphens
-  "\u2010": "-", // hyphen
-  "\u2011": "-", // non-breaking hyphen
-  "\u2012": "-", // figure dash
-  "\u2013": "-", // en dash
-  "\u2014": "-", // em dash
-  "\u2015": "-", // horizontal bar
-  "\u2212": "-", // minus sign
-  "\uFE58": "-", // small em dash
-  "\uFE63": "-", // small hyphen-minus
-  "\uFF0D": "-", // fullwidth hyphen-minus
-  // Dots and periods
-  "\u2024": ".", // one dot leader
-  "\uFE52": ".", // small full stop
-  "\uFF0E": ".", // fullwidth full stop
-  // Spaces
-  "\u00A0": " ", // non-breaking space
-  "\u2000": " ", // en quad
-  "\u2001": " ", // em quad
-  "\u2002": " ", // en space
-  "\u2003": " ", // em space
-  "\u2004": " ", // three-per-em space
-  "\u2005": " ", // four-per-em space
-  "\u2006": " ", // six-per-em space
-  "\u2007": " ", // figure space
-  "\u2008": " ", // punctuation space
-  "\u2009": " ", // thin space
-  "\u200A": " ", // hair space
-  "\u200B": "", // zero-width space (remove)
-  "\u202F": " ", // narrow no-break space
-  "\u205F": " ", // medium mathematical space
-  "\u3000": " ", // ideographic space
-  "\uFEFF": "", // BOM / zero-width no-break
-  // Slashes
-  "\uFF0F": "/", // fullwidth solidus
-  "\u2044": "/", // fraction slash
-};
-
-const CHAR_REGEX = new RegExp(
-  `[${Object.keys(CHAR_MAP).join("")}]`,
-  "g",
-);
-
-/**
- * Normalize Unicode artifacts to ASCII
- * equivalents and strip the given characters.
- *
- * @param value - The input string
- * @param strip - Characters to remove
- *   (e.g. " -/" to strip spaces, dashes, slashes)
- */
-export const clean = (
-  value: string,
-  strip: string = "",
-): string => {
-  let result = value.replace(
-    CHAR_REGEX,
-    (ch) => CHAR_MAP[ch] ?? ch,
-  );
-  if (strip) {
-    for (const ch of strip) {
-      result = result.replaceAll(ch, "");
-    }
-  }
-  return result;
-};

package/src/_util/date.ts

@@ -1,23 +0,0 @@
-/** Validate a calendar date via Date round-trip. */
-export const isValidDate = (
-  year: number,
-  month: number,
-  day: number,
-): boolean => {
-  const d = new Date(year, month - 1, day);
-  return (
-    d.getFullYear() === year &&
-    d.getMonth() === month - 1 &&
-    d.getDate() === day
-  );
-};
-
-/**
- * Resolve a 2-digit year to a 4-digit year using a
- * rolling pivot: years after the current year are
- * assumed to be in the previous century.
- */
-export const resolveTwoDigitYear = (yy: number): number => {
-  const y = 2000 + yy;
-  return y > new Date().getFullYear() ? y - 100 : y;
-};

package/src/_util/generate.ts

@@ -1,62 +0,0 @@
-/**
- * Helpers for generating random valid identifiers.
- * NOT cryptographically secure; use only for
- * testing, demos, and form placeholders.
- */
-
-/** Generate a string of n random decimal digits. */
-export const randomDigits = (n: number): string => {
-  let result = "";
-  for (let i = 0; i < n; i++) {
-    result += String(Math.floor(Math.random() * 10));
-  }
-  return result;
-};
-
-/**
- * Generate a random integer in [min, max]
- * (inclusive).
- */
-export const randomInt = (
-  min: number,
-  max: number,
-): number =>
-  min + Math.floor(Math.random() * (max - min + 1));
-
-/**
- * Pick a random element from a non-empty array.
- * Throws if the array is empty so generators that
- * declare a fixed pool fail loudly instead of
- * returning `undefined`.
- */
-export const randomPick = <T>(values: readonly T[]): T => {
-  if (values.length === 0) {
-    throw new Error("randomPick called with empty array");
-  }
-  const idx = randomInt(0, values.length - 1);
-  // SAFETY: idx is bounded by values.length and the
-  // array is non-empty (checked above).
-  const value = values[idx];
-  if (value === undefined) {
-    throw new Error("randomPick produced undefined");
-  }
-  return value;
-};
-
-/**
- * Pick a random character from a non-empty string.
- * Same contract as `randomPick` for arrays.
- */
-export const randomChar = (chars: string): string => {
-  if (chars.length === 0) {
-    throw new Error("randomChar called with empty string");
-  }
-  const idx = randomInt(0, chars.length - 1);
-  // SAFETY: idx is bounded by chars.length and the
-  // string is non-empty (checked above).
-  const ch = chars[idx];
-  if (ch === undefined) {
-    throw new Error("randomChar produced undefined");
-  }
-  return ch;
-};

package/src/_util/result.ts

@@ -1,10 +0,0 @@
-import type { StdnumError, ValidateResult } from "../types";
-
-/** Create an error ValidateResult. */
-export const err = (
-  code: StdnumError["code"],
-  message: string,
-): ValidateResult => ({
-  valid: false,
-  error: { code, message },
-});

package/src/_util/strings.ts

@@ -1,32 +0,0 @@
-/** Check if the string contains only digits. */
-export const isdigits = (value: string): boolean =>
-  value.length > 0 && /^\d+$/.test(value);
-
-/**
- * Check if the string contains only ASCII
- * letters (a-z, A-Z).
- */
-export const isalpha = (value: string): boolean =>
-  value.length > 0 && /^[a-zA-Z]+$/.test(value);
-
-/**
- * Check if the string contains only ASCII
- * letters and digits.
- */
-export const isalnum = (value: string): boolean =>
-  value.length > 0 && /^[a-zA-Z0-9]+$/.test(value);
-
-/**
- * Convert a single character to its numeric
- * value (0-9 for digits, 10-35 for A-Z).
- */
-export const charValue = (ch: string): number => {
-  const code = ch.charCodeAt(0);
-  // 0-9
-  if (code >= 48 && code <= 57) return code - 48;
-  // A-Z
-  if (code >= 65 && code <= 90) return code - 55;
-  // a-z
-  if (code >= 97 && code <= 122) return code - 87;
-  return 0;
-};

package/src/ad/mod.ts

@@ -1 +0,0 @@
-export { default as nrt } from "./nrt";

package/src/ad/nrt.ts

@@ -1,123 +0,0 @@
-const NRT_PREFIXES = "CDEGOPU";
-
-/** Generate a random valid Andorra NRT. */
-const generate = (): string => {
-  const prefix = randomChar(NRT_PREFIXES);
-  const digits = randomDigits(6);
-  const suffix = String.fromCodePoint(
-    65 + randomInt(0, 25),
-  );
-  return `${prefix}${digits}${suffix}`;
-};
-
-/**
- * NRT (Número de Registre Tributari, Andorra tax number).
- *
- * The NRT identifies legal and natural entities for tax
- * purposes. It consists of one letter indicating entity
- * type, six digits, and a check letter.
- *
- * Entity type prefixes:
- *   F      — companies (digits <= 699999)
- *   A, L   — other entities (digits 700000-799999)
- *   C, D, E, G, O, P, U — other types
- *
- * @see https://www.oecd.org/tax/automatic-exchange/crs-implementation-and-assistance/tax-identification-numbers/Andorra-TIN.pdf
- */
-
-import type {
-  ValidateResult,
-  CountryValidator,
-} from "../types";
-
-import { clean } from "#util/clean";
-import {
-  randomChar,
-  randomDigits,
-  randomInt,
-} from "#util/generate";
-import { err } from "#util/result";
-import { isdigits } from "#util/strings";
-
-const VALID_PREFIXES = "ACDEFGLOPU";
-
-const compact = (value: string): string =>
-  clean(value, " -.").toUpperCase().trim();
-
-const validate = (value: string): ValidateResult => {
-  const v = compact(value);
-  if (v.length !== 8) {
-    return err(
-      "INVALID_LENGTH",
-      "Andorra NRT must be 8 characters",
-    );
-  }
-  // SAFETY: v.length === 8 guarantees both positions
-  // exist; oxlint cannot see the length guard.
-  // eslint-disable-next-line no-non-null-assertion
-  const prefix = v[0]!;
-  // eslint-disable-next-line no-non-null-assertion
-  const tail = v[7]!;
-  const digits = v.slice(1, 7);
-  if (!/^[A-Z]$/.test(prefix) || !/^[A-Z]$/.test(tail)) {
-    return err(
-      "INVALID_FORMAT",
-      "Andorra NRT must start and end with a letter",
-    );
-  }
-  if (!isdigits(digits)) {
-    return err(
-      "INVALID_FORMAT",
-      "Andorra NRT must have 6 digits in the middle",
-    );
-  }
-  if (!VALID_PREFIXES.includes(prefix)) {
-    return err(
-      "INVALID_COMPONENT",
-      "Andorra NRT has an invalid entity type prefix",
-    );
-  }
-  if (prefix === "F" && digits > "699999") {
-    return err(
-      "INVALID_COMPONENT",
-      "Andorra NRT F-type digits must be <= 699999",
-    );
-  }
-  if (
-    (prefix === "A" || prefix === "L") &&
-    !("699999" < digits && digits < "800000")
-  ) {
-    return err(
-      "INVALID_COMPONENT",
-      "Andorra NRT A/L-type digits must be 700000-799999",
-    );
-  }
-  return { valid: true, compact: v };
-};
-
-const format = (value: string): string => {
-  const v = compact(value);
-  return `${v[0]}-${v.slice(1, 7)}-${v[7]}`;
-};
-
-/** Andorra NRT (Número de Registre Tributari). */
-const nrt: CountryValidator<"AD"> = {
-  name: "Andorra Tax Number",
-  localName: "Número de Registre Tributari",
-  abbreviation: "NRT",
-  aliases: ["NRT", "Número de Registre Tributari"] as const,
-  candidatePattern: "[A-Z]-?\\d{6}-?[A-Z]",
-  scope: "country",
-  country: "AD",
-  entityType: "any",
-  sourceUrl:
-    "https://www.oecd.org/tax/automatic-exchange/crs-implementation-and-assistance/tax-identification-numbers/Andorra-TIN.pdf",
-  examples: ["U132950X", "D059888N", "F123456M"] as const,
-  compact,
-  format,
-  validate,
-  generate,
-};
-
-export default nrt;
-export { compact, format, validate, generate };