n2words 3.0.0 → 4.0.0

package/dist/languages/de.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"de.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/de.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * German language converter - Functional Implementation\n *\n * A performance-optimized number-to-words converter using precomputed lookup tables.\n * Self-contained module with its own input validation, ready for subpath exports.\n *\n * Key optimization: Precompute all segment values (0-999) at module load.\n * This eliminates all per-call string manipulation for segment conversion.\n *\n * German-specific rules (handled in precomputation):\n * - Inverted tens-ones order: \"einundzwanzig\" (one-and-twenty) for 21-99\n * - Compound words without spaces below million level\n * - Three forms of 1: \"eins\" (standalone), \"ein\" (before hundert/tausend), \"eine\" (before Million+)\n * - Scale pluralization: Million → Millionen, Milliarde → Milliarden\n * - Spaces only around million+ scale words\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\n\n// ============================================================================\n// Vocabulary (module-level constants)\n// ============================================================================\n\n// Ones words (1-9), index 0 unused\nconst ONES = ['', 'eins', 'zwei', 'drei', 'vier', 'fünf', 'sechs', 'sieben', 'acht', 'neun']\n\n// \"ein\" form for use before hundert/und\nconst EIN = 'ein'\n\n// Teens (10-19)\nconst TEENS = ['zehn', 'elf', 'zwölf', 'dreizehn', 'vierzehn', 'fünfzehn', 'sechzehn', 'siebzehn', 'achtzehn', 'neunzehn']\n\n// Tens (20-90)\nconst TENS = ['', '', 'zwanzig', 'dreißig', 'vierzig', 'fünfzig', 'sechzig', 'siebzig', 'achtzig', 'neunzig']\n\n// Scale words (index 0 = thousand, 1 = million, etc.)\nconst SCALES = ['tausend', 'Million', 'Milliarde', 'Billion', 'Billiarde', 'Trillion', 'Trilliarde', 'Quadrillion', 'Quadrilliarde']\n\n// Pluralized scale words (million+)\nconst SCALES_PLURAL = ['tausend', 'Millionen', 'Milliarden', 'Billionen', 'Billiarden', 'Trillionen', 'Trilliarden', 'Quadrillionen', 'Quadrilliarden']\n\nconst HUNDRED = 'hundert'\nconst ZERO = 'null'\nconst NEGATIVE = 'minus'\nconst DECIMAL_SEP = 'komma'\n\n// ============================================================================\n// Precomputed Lookup Tables (built once at module load)\n// ============================================================================\n\n/**\n * Builds segment word for 0-999 (standalone form, uses \"eins\").\n * German inverts ones and tens: \"einundzwanzig\" = one-and-twenty\n * Only used during table construction.\n */\nfunction buildSegment (n) {\n  if (n === 0) return ''\n\n  const ones = n % 10\n  const tens = Math.floor(n / 10) % 10\n  const hundreds = Math.floor(n / 100)\n\n  let result = ''\n\n  // Hundreds: \"ein\" before hundert, not \"eins\"\n  if (hundreds > 0) {\n    result += (hundreds === 1 ? EIN : ONES[hundreds]) + HUNDRED\n  }\n\n  // Tens and ones\n  if (tens === 1) {\n    // Teens\n    result += TEENS[ones]\n  } else if (tens >= 2 && ones > 0) {\n    // Inverted: \"einundzwanzig\" (one-and-twenty)\n    // Use \"ein\" before \"und\", not \"eins\"\n    result += (ones === 1 ? EIN : ONES[ones]) + 'und' + TENS[tens]\n  } else if (tens >= 2) {\n    // Just tens\n    result += TENS[tens]\n  } else if (ones > 0) {\n    // Just ones (no tens, possibly after hundreds)\n    // Use \"eins\" for standalone/after hundreds\n    result += ONES[ones]\n  }\n\n  return result\n}\n\n/**\n * Builds segment word for use before \"tausend\".\n * Uses \"ein\" instead of \"eins\" for 1.\n */\nfunction buildSegmentForThousand (n) {\n  if (n === 0) return ''\n  if (n === 1) return EIN // \"eintausend\"\n\n  const ones = n % 10\n  const tens = Math.floor(n / 10) % 10\n  const hundreds = Math.floor(n / 100)\n\n  let result = ''\n\n  if (hundreds > 0) {\n    result += (hundreds === 1 ? EIN : ONES[hundreds]) + HUNDRED\n  }\n\n  if (tens === 1) {\n    result += TEENS[ones]\n  } else if (tens >= 2 && ones > 0) {\n    result += (ones === 1 ? EIN : ONES[ones]) + 'und' + TENS[tens]\n  } else if (tens >= 2) {\n    result += TENS[tens]\n  } else if (ones > 0 && hundreds > 0) {\n    // After hundreds, ones 1 stays \"eins\" when not followed by scale\n    // But we're going to tausend, so this path won't hit for n=1\n    result += ONES[ones]\n  } else if (ones > 0) {\n    result += ONES[ones]\n  }\n\n  return result\n}\n\n// Precompute all 1000 segment words (0-999) - standalone form\nconst SEGMENTS = new Array(1000)\nfor (let i = 0; i < 1000; i++) {\n  SEGMENTS[i] = buildSegment(i)\n}\n\n// Precompute all 1000 segment words for thousand context\nconst SEGMENTS_THOUSAND = new Array(1000)\nfor (let i = 0; i < 1000; i++) {\n  SEGMENTS_THOUSAND[i] = buildSegmentForThousand(i)\n}\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\n/**\n * Converts a non-negative integer to German words.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @returns {string} German words\n */\nfunction integerToWords (n) {\n  if (n === 0n) return ZERO\n\n  // Fast path: numbers < 1000 (direct lookup)\n  if (n < 1000n) {\n    return SEGMENTS[Number(n)]\n  }\n\n  // Fast path: numbers < 1,000,000 (thousands)\n  if (n < 1_000_000n) {\n    const thousands = Number(n / 1000n)\n    const remainder = Number(n % 1000n)\n\n    // Compound: \"eintausendzweihundert\" (no spaces)\n    let result = SEGMENTS_THOUSAND[thousands] + SCALES[0]\n\n    if (remainder > 0) {\n      result += SEGMENTS[remainder]\n    }\n\n    return result\n  }\n\n  // For numbers >= 1,000,000, use scale decomposition\n  return buildLargeNumberWords(n)\n}\n\n/**\n * Builds words for numbers >= 1,000,000.\n *\n * @param {bigint} n - Number >= 1,000,000\n * @returns {string} German words\n */\nfunction buildLargeNumberWords (n) {\n  const numStr = n.toString()\n  const len = numStr.length\n\n  // Build segments of 3 digits from right to left\n  const segments = []\n  const segmentSize = 3\n\n  const remainderLen = len % segmentSize\n  let pos = 0\n  if (remainderLen > 0) {\n    segments.push(Number(numStr.slice(0, remainderLen)))\n    pos = remainderLen\n  }\n  while (pos < len) {\n    segments.push(Number(numStr.slice(pos, pos + segmentSize)))\n    pos += segmentSize\n  }\n\n  // Convert segments to words\n  const parts = []\n  let scaleIndex = segments.length - 1\n\n  for (let i = 0; i < segments.length; i++) {\n    const segment = segments[i]\n\n    if (segment !== 0) {\n      if (scaleIndex === 0) {\n        // Units segment (no scale word)\n        parts.push({ words: SEGMENTS[segment], isScale: false, scaleLevel: 0 })\n      } else if (scaleIndex === 1) {\n        // Thousands: compound without space\n        const segWords = SEGMENTS_THOUSAND[segment]\n        parts.push({ words: segWords + SCALES[0], isScale: false, scaleLevel: 1 })\n      } else {\n        // Million+ : space around scale word\n        let segWords\n        if (segment === 1) {\n          segWords = 'eine' // \"eine Million\"\n        } else {\n          segWords = SEGMENTS[segment]\n        }\n        const scaleWord = segment === 1 ? SCALES[scaleIndex - 1] : SCALES_PLURAL[scaleIndex - 1]\n        parts.push({ words: segWords, isScale: false, scaleLevel: scaleIndex })\n        parts.push({ words: scaleWord, isScale: true, scaleLevel: scaleIndex })\n      }\n    }\n\n    scaleIndex--\n  }\n\n  // Join with German spacing rules: space around million+ scale words\n  return joinGermanParts(parts)\n}\n\n/**\n * Joins parts with German spacing rules.\n * Spaces only around million+ scale words.\n *\n * @param {Array} parts - Parts with metadata\n * @returns {string} Joined string\n */\nfunction joinGermanParts (parts) {\n  if (parts.length === 0) return ZERO\n\n  let result = ''\n\n  for (let i = 0; i < parts.length; i++) {\n    const part = parts[i]\n    const prevPart = i > 0 ? parts[i - 1] : null\n\n    // Add space before if:\n    // - Current is a million+ scale word\n    // - Previous was a million+ scale word\n    if (i > 0) {\n      const needsSpace = part.isScale || (prevPart && prevPart.isScale)\n      if (needsSpace) {\n        result += ' '\n      }\n    }\n\n    result += part.words\n  }\n\n  return result\n}\n\n/**\n * Converts decimal digits to German words.\n *\n * @param {string} decimalPart - Decimal digits (without the point)\n * @returns {string} German words for decimal part\n */\nfunction decimalPartToWords (decimalPart) {\n  let result = ''\n\n  // Handle leading zeros\n  let i = 0\n  while (i < decimalPart.length && decimalPart[i] === '0') {\n    if (result) result += ' '\n    result += ZERO\n    i++\n  }\n\n  // Convert remainder as a single number\n  const remainder = decimalPart.slice(i)\n  if (remainder) {\n    if (result) result += ' '\n    result += integerToWords(BigInt(remainder))\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to German words.\n *\n * This is the main public API. It accepts any valid numeric input\n * (number, string, or bigint) and handles parsing internally.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @returns {string} The number in German words\n * @throws {TypeError} If value is not a valid numeric type\n * @throws {Error} If value is not a valid number format\n *\n * @example\n * toWords(21)           // 'einundzwanzig'\n * toWords(1000)         // 'eintausend'\n * toWords(1000000)      // 'eine Million'\n */\nfunction toWords (value) {\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Public API\n// ============================================================================\n\nexport { toWords }\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES","EIN","TEENS","TENS","SCALES","SCALES_PLURAL","HUNDRED","ZERO","buildSegment","n","ones","tens","Math","floor","hundreds","result","buildSegmentForThousand","SEGMENTS","Array","i","SEGMENTS_THOUSAND","integerToWords","Number","thousands","remainder","numStr","toString","len","segments","remainderLen","pos","push","parts","scaleIndex","segment","words","isScale","scaleLevel","segWords","scaleWord","part","prevPart","joinGermanParts","buildLargeNumberWords","value","type","isFinite","Error","isSafeInteger","includes","numberToString","trimmed","trim","isNaN","normalizeString","TypeError","parseNumericValue","NEGATIVE","decimalPartToWords"],"mappings":";0CAwEA,SAASA,EAAoBC,GAC3B,MAAMC,EAAwB,MAAXD,EAAI,GACnBC,IAAYD,EAAMA,EAAIE,MAAM,IAEhC,MAAMC,EAAWH,EAAII,QAAQ,KAC7B,IAAiB,IAAbD,EACF,MAAO,CAAEF,aAAYI,YAAaC,OAAON,IAG3C,MAAMO,EAAaP,EAAIE,MAAM,EAAGC,IAAa,IACvCK,EAAcR,EAAIE,MAAMC,EAAW,GACzC,MAAO,CAAEF,aAAYI,YAAaC,OAAOC,GAAaC,cACxD,CAKA,SAASC,EAA0BT,GACjC,MAAOU,EAAUC,GAAUX,EAAIY,cAAcC,MAAM,KAC7CC,EAAMC,SAASJ,EAAQ,IAEvBR,EAAWO,EAASN,QAAQ,KAC5BY,OAASb,EACXO,EACAA,EAASR,MAAM,EAAGC,GAAYO,EAASR,MAAMC,EAAW,GAEtDc,IAD6B,IAAbd,EAAkBO,EAASQ,OAASf,GACnBW,EAEvC,OAAIG,GAAkBD,EAAOE,OACpBF,EAAS,IAAIG,OAAOF,EAAiBD,EAAOE,QAEjDD,GAAkB,EACb,KAAO,IAAIE,QAAQF,GAAkBD,EAEvCA,EAAOd,MAAM,EAAGe,GAAkB,IAAMD,EAAOd,MAAMe,EAC9D,CCnFA,MAAMG,EAAO,CAAC,GAAI,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,QAAS,SAAU,OAAQ,QAG/EC,EAAM,MAGNC,EAAQ,CAAC,OAAQ,MAAO,QAAS,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,YAGzGC,EAAO,CAAC,GAAI,GAAI,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAG7FC,EAAS,CAAC,UAAW,UAAW,YAAa,UAAW,YAAa,WAAY,aAAc,cAAe,iBAG9GC,EAAgB,CAAC,UAAW,YAAa,aAAc,YAAa,aAAc,aAAc,cAAe,gBAAiB,kBAEhIC,EAAU,UACVC,EAAO,OAab,SAASC,EAAcC,GACrB,GAAU,IAANA,EAAS,MAAO,GAEpB,MAAMC,EAAOD,EAAI,GACXE,EAAOC,KAAKC,MAAMJ,EAAI,IAAM,GAC5BK,EAAWF,KAAKC,MAAMJ,EAAI,KAEhC,IAAIM,EAAS,GAwBb,OArBID,EAAW,IACbC,IAAwB,IAAbD,EAAiBb,EAAMD,EAAKc,IAAaR,GAIzC,IAATK,EAEFI,GAAUb,EAAMQ,GACPC,GAAQ,GAAKD,EAAO,EAG7BK,IAAoB,IAATL,EAAaT,EAAMD,EAAKU,IAAS,MAAQP,EAAKQ,GAChDA,GAAQ,EAEjBI,GAAUZ,EAAKQ,GACND,EAAO,IAGhBK,GAAUf,EAAKU,IAGVK,CACT,CAMA,SAASC,EAAyBP,GAChC,GAAU,IAANA,EAAS,MAAO,GACpB,GAAU,IAANA,EAAS,OAAOR,EAEpB,MAAMS,EAAOD,EAAI,GACXE,EAAOC,KAAKC,MAAMJ,EAAI,IAAM,GAC5BK,EAAWF,KAAKC,MAAMJ,EAAI,KAEhC,IAAIM,EAAS,GAoBb,OAlBID,EAAW,IACbC,IAAwB,IAAbD,EAAiBb,EAAMD,EAAKc,IAAaR,GAGzC,IAATK,EACFI,GAAUb,EAAMQ,GACPC,GAAQ,GAAKD,EAAO,EAC7BK,IAAoB,IAATL,EAAaT,EAAMD,EAAKU,IAAS,MAAQP,EAAKQ,GAChDA,GAAQ,EACjBI,GAAUZ,EAAKQ,IACND,EAAO,GAAKI,EAAW,GAIvBJ,EAAO,KADhBK,GAAUf,EAAKU,IAKVK,CACT,CAGA,MAAME,EAAW,IAAIC,MAAM,KAC3B,IAAK,IAAIC,EAAI,EAAGA,EAAI,IAAMA,IACxBF,EAASE,GAAKX,EAAaW,GAI7B,MAAMC,EAAoB,IAAIF,MAAM,KACpC,IAAK,IAAIC,EAAI,EAAGA,EAAI,IAAMA,IACxBC,EAAkBD,GAAKH,EAAwBG,GAajD,SAASE,EAAgBZ,GACvB,GAAU,KAANA,EAAU,OAAOF,EAGrB,GAAIE,EAAI,MACN,OAAOQ,EAASK,OAAOb,IAIzB,GAAIA,EAAI,SAAY,CAClB,MAAMc,EAAYD,OAAOb,EAAI,OACvBe,EAAYF,OAAOb,EAAI,OAG7B,IAAIM,EAASK,EAAkBG,GAAanB,EAAO,GAMnD,OAJIoB,EAAY,IACdT,GAAUE,EAASO,IAGdT,CACT,CAGA,OASF,SAAgCN,GAC9B,MAAMgB,EAAShB,EAAEiB,WACXC,EAAMF,EAAO3B,OAGb8B,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAASG,KAAKT,OAAOG,EAAO3C,MAAM,EAAG+C,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAASG,KAAKT,OAAOG,EAAO3C,MAAMgD,EAAKA,EATrB,KAUlBA,GAVkB,EAcpB,MAAME,EAAQ,GACd,IAAIC,EAAaL,EAAS9B,OAAS,EAEnC,IAAK,IAAIqB,EAAI,EAAGA,EAAIS,EAAS9B,OAAQqB,IAAK,CACxC,MAAMe,EAAUN,EAAST,GAEzB,GAAgB,IAAZe,EACF,GAAmB,IAAfD,EAEFD,EAAMD,KAAK,CAAEI,MAAOlB,EAASiB,GAAUE,SAAS,EAAOC,WAAY,SAC9D,GAAmB,IAAfJ,EAGTD,EAAMD,KAAK,CAAEI,MADIf,EAAkBc,GACJ9B,EAAO,GAAIgC,SAAS,EAAOC,WAAY,QACjE,CAEL,IAAIC,EAEFA,EADc,IAAZJ,EACS,OAEAjB,EAASiB,GAEtB,MAAMK,EAAwB,IAAZL,EAAgB9B,EAAO6B,EAAa,GAAK5B,EAAc4B,EAAa,GACtFD,EAAMD,KAAK,CAAEI,MAAOG,EAAUF,SAAS,EAAOC,WAAYJ,IAC1DD,EAAMD,KAAK,CAAEI,MAAOI,EAAWH,SAAS,EAAMC,WAAYJ,GAC5D,CAGFA,GACF,CAGA,OAUF,SAA0BD,GACxB,GAAqB,IAAjBA,EAAMlC,OAAc,OAAOS,EAE/B,IAAIQ,EAAS,GAEb,IAAK,IAAII,EAAI,EAAGA,EAAIa,EAAMlC,OAAQqB,IAAK,CACrC,MAAMqB,EAAOR,EAAMb,GACbsB,EAAWtB,EAAI,EAAIa,EAAMb,EAAI,GAAK,KAKpCA,EAAI,IACaqB,EAAKJ,SAAYK,GAAYA,EAASL,WAEvDrB,GAAU,KAIdA,GAAUyB,EAAKL,KACjB,CAEA,OAAOpB,CACT,CAjCS2B,CAAgBV,EACzB,CA9DSW,CAAsBlC,EAC/B,MA0IA,SAAkBmC,GAChB,MAAM/D,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GDzS5B,SAA4BwD,GACjC,MAAMC,SAAcD,EAGpB,GAAa,WAATC,EACF,OAAOD,EAAQ,GACX,CAAE/D,YAAY,EAAMI,aAAc2D,GAClC,CAAE/D,YAAY,EAAOI,YAAa2D,GAIxC,GAAa,WAATC,EAAmB,CACrB,IAAKvB,OAAOwB,SAASF,GACnB,MAAM,IAAIG,MAAM,8DAElB,OAAIzB,OAAO0B,cAAcJ,GAChBA,EAAQ,EACX,CAAE/D,YAAY,EAAMI,YAAaC,QAAQ0D,IACzC,CAAE/D,YAAY,EAAOI,YAAaC,OAAO0D,IAExCjE,EAgBX,SAAyBiE,GACvB,MAAMhE,EAAMgE,EAAMlB,WAClB,OAAQ9C,EAAIqE,SAAS,MAAQrE,EAAIqE,SAAS,KACtC5D,EAAyBT,GACzBA,CACN,CArB8BsE,CAAeN,GAC3C,CAGA,GAAa,WAATC,EACF,OAAOlE,EAqBX,SAA0BiE,GACxB,MAAMO,EAAUP,EAAMQ,OACtB,GAAuB,IAAnBD,EAAQrD,QAAgBwB,OAAO+B,MAAM/B,OAAO6B,IAC9C,MAAM,IAAIJ,MAAM,2BAA2BH,MAE7C,OAAQO,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9C5D,EAAyB8D,GACzBA,CACN,CA7B8BG,CAAgBV,IAG5C,MAAM,IAAIW,UACR,oEAAoEV,IAExE,CC0QmDW,CAAkBZ,GAEnE,IAAI7B,EAAS,GAYb,OAVIlC,IACFkC,EAAS0C,UAGX1C,GAAUM,EAAepC,GAErBG,IACF2B,GAAU,UAjDd,SAA6B3B,GAC3B,IAAI2B,EAAS,GAGTI,EAAI,EACR,KAAOA,EAAI/B,EAAYU,QAA6B,MAAnBV,EAAY+B,IACvCJ,IAAQA,GAAU,KACtBA,GAAUR,EACVY,IAIF,MAAMK,EAAYpC,EAAYN,MAAMqC,GAMpC,OALIK,IACET,IAAQA,GAAU,KACtBA,GAAUM,EAAenC,OAAOsC,KAG3BT,CACT,CA8BwC2C,CAAmBtE,IAGlD2B,CACT"}

package/dist/languages/el.js

@@ -1,3 +0,0 @@
-/*! n2words/el v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var e,t;e=this,t=function(e){"use strict";function t(e){const t="-"===e[0];t&&(e=e.slice(1));const n=e.indexOf(".");if(-1===n)return{isNegative:t,integerPart:BigInt(e)};const r=e.slice(0,n)||"0",i=e.slice(n+1);return{isNegative:t,integerPart:BigInt(r),decimalPart:i}}function n(e){const[t,n]=e.toLowerCase().split("e"),r=parseInt(n,10),i=t.indexOf("."),o=-1===i?t:t.slice(0,i)+t.slice(i+1),s=(-1===i?t.length:i)+r;return s>=o.length?o+"0".repeat(s-o.length):s<=0?"0."+"0".repeat(-s)+o:o.slice(0,s)+"."+o.slice(s)}const r=["","ένα","δύο","τρία","τέσσερα","πέντε","έξι","επτά","οκτώ","εννέα"],i=["δέκα","έντεκα","δώδεκα","δεκατρία","δεκατέσσερα","δεκαπέντε","δεκαέξι","δεκαεπτά","δεκαοκτώ","δεκαεννέα"],o=["","","είκοσι","τριάντα","σαράντα","πενήντα","εξήντα","εβδομήντα","ογδόντα","ενενήντα"],s=["","εκατό","διακόσια","τριακόσια","τετρακόσια","πεντακόσια","εξακόσια","επτακόσια","οκτακόσια","εννιακόσια"],u="χίλια",c="μηδέν",f=["εκατομμύριο","δισεκατομμύριο","τρισεκατομμύριο"];function l(e){if(0===e)return"";const t=e%10,n=Math.floor(e/10)%10,u=Math.floor(e/100),c=[];u>0&&c.push(s[u]);const f=e%100;return 0===f||c.push(f<10?r[t]:f<20?i[t]:0===t?o[n]:o[n]+" "+r[t]),c.join(" ")}const a=new Array(1e3);for(let e=0;e<1e3;e++)a[e]=l(e);e.el=function(e){const{isNegative:i,integerPart:o,decimalPart:s}=function(e){const r=typeof e;if("bigint"===r)return e<0n?{isNegative:!0,integerPart:-e}:{isNegative:!1,integerPart:e};if("number"===r){if(!Number.isFinite(e))throw new Error("Number must be finite (NaN and Infinity are not supported)");return Number.isSafeInteger(e)?e<0?{isNegative:!0,integerPart:BigInt(-e)}:{isNegative:!1,integerPart:BigInt(e)}:t(function(e){const t=e.toString();return t.includes("e")||t.includes("E")?n(t):t}(e))}if("string"===r)return t(function(e){const t=e.trim();if(0===t.length||Number.isNaN(Number(t)))throw new Error(`Invalid number format: "${e}"`);return t.includes("e")||t.includes("E")?n(t):t}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${r}`)}(e);let l="";return i&&(l="μείον "),l+=function(e){if(0n===e)return c;if(e<1000n)return a[Number(e)];if(e<1000000n){const t=Number(e/1000n),n=Number(e%1000n);let r;return r=1===t?u:a[t]+" "+u,n>0&&(r+=" "+a[n]),r}return function(e){const t=e.toString(),n=t.length,r=[],i=n%3;let o=0;for(i>0&&(r.push(Number(t.slice(0,i))),o=i);o<n;)r.push(Number(t.slice(o,o+3))),o+=3;const s=[];let c=r.length-1;for(let e=0;e<r.length;e++){const t=r[e];if(0!==t){const e=a[t];if(0===c)s.push(e);else if(1===c)s.push(1===t?u:e+" "+u);else{const n=f[c-2];s.push(1===t?n:e+" "+n)}}c--}return s.join(" ")}(e)}(o),s&&(l+=" κόμμα "+function(e){const t=[];for(const n of e){const e=parseInt(n,10);t.push(0===e?c:r[e])}return t.join(" ")}(s)),l}},"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).n2words=e.n2words||{});
-//# sourceMappingURL=el.js.map

package/dist/languages/el.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"el.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/el.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * Greek language converter - Functional Implementation\n *\n * A performance-optimized number-to-words converter using precomputed lookup tables.\n *\n * Key features:\n * - Space-separated number composition\n * - Implicit \"one\" (ένα) omission before scale words\n * - Irregular hundreds (διακόσια, τριακόσια, etc.)\n * - Per-digit decimal reading\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\n\n// ============================================================================\n// Vocabulary (module-level constants)\n// ============================================================================\n\nconst ONES = ['', 'ένα', 'δύο', 'τρία', 'τέσσερα', 'πέντε', 'έξι', 'επτά', 'οκτώ', 'εννέα']\n\nconst TEENS = ['δέκα', 'έντεκα', 'δώδεκα', 'δεκατρία', 'δεκατέσσερα', 'δεκαπέντε', 'δεκαέξι', 'δεκαεπτά', 'δεκαοκτώ', 'δεκαεννέα']\n\nconst TENS = ['', '', 'είκοσι', 'τριάντα', 'σαράντα', 'πενήντα', 'εξήντα', 'εβδομήντα', 'ογδόντα', 'ενενήντα']\n\n// Greek has irregular hundreds\nconst HUNDREDS = ['', 'εκατό', 'διακόσια', 'τριακόσια', 'τετρακόσια', 'πεντακόσια', 'εξακόσια', 'επτακόσια', 'οκτακόσια', 'εννιακόσια']\n\nconst THOUSAND = 'χίλια'\n\nconst ZERO = 'μηδέν'\nconst NEGATIVE = 'μείον'\nconst DECIMAL_SEP = 'κόμμα'\n\n// Short scale\nconst SCALES = ['εκατομμύριο', 'δισεκατομμύριο', 'τρισεκατομμύριο']\n\n// ============================================================================\n// Precomputed Lookup Tables (built once at module load)\n// ============================================================================\n\n/**\n * Builds segment word for 0-999.\n */\nfunction buildSegment (n) {\n  if (n === 0) return ''\n\n  const ones = n % 10\n  const tens = Math.floor(n / 10) % 10\n  const hundreds = Math.floor(n / 100)\n\n  const parts = []\n\n  // Hundreds (irregular forms)\n  if (hundreds > 0) {\n    parts.push(HUNDREDS[hundreds])\n  }\n\n  // Tens and ones\n  const tensOnes = n % 100\n\n  if (tensOnes === 0) {\n    // Just hundreds\n  } else if (tensOnes < 10) {\n    parts.push(ONES[ones])\n  } else if (tensOnes < 20) {\n    parts.push(TEENS[ones])\n  } else if (ones === 0) {\n    parts.push(TENS[tens])\n  } else {\n    parts.push(TENS[tens] + ' ' + ONES[ones])\n  }\n\n  return parts.join(' ')\n}\n\n// Precompute all 1000 segment words (0-999)\nconst SEGMENTS = new Array(1000)\n\nfor (let i = 0; i < 1000; i++) {\n  SEGMENTS[i] = buildSegment(i)\n}\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\n/**\n * Converts a non-negative integer to Greek words.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @returns {string} Greek words\n */\nfunction integerToWords (n) {\n  if (n === 0n) return ZERO\n\n  // Fast path: numbers < 1000 (direct lookup)\n  if (n < 1000n) {\n    return SEGMENTS[Number(n)]\n  }\n\n  // Fast path: numbers < 1,000,000 (thousands)\n  if (n < 1_000_000n) {\n    const thousands = Number(n / 1000n)\n    const remainder = Number(n % 1000n)\n\n    // Omit \"ένα\" before χίλια\n    let result\n    if (thousands === 1) {\n      result = THOUSAND\n    } else {\n      result = SEGMENTS[thousands] + ' ' + THOUSAND\n    }\n\n    if (remainder > 0) {\n      result += ' ' + SEGMENTS[remainder]\n    }\n\n    return result\n  }\n\n  // For numbers >= 1,000,000, use scale decomposition\n  return buildLargeNumberWords(n)\n}\n\n/**\n * Builds words for numbers >= 1,000,000.\n *\n * @param {bigint} n - Number >= 1,000,000\n * @returns {string} Greek words\n */\nfunction buildLargeNumberWords (n) {\n  const numStr = n.toString()\n  const len = numStr.length\n\n  // Build segments of 3 digits from right to left\n  const segments = []\n  const segmentSize = 3\n\n  const remainderLen = len % segmentSize\n  let pos = 0\n  if (remainderLen > 0) {\n    segments.push(Number(numStr.slice(0, remainderLen)))\n    pos = remainderLen\n  }\n  while (pos < len) {\n    segments.push(Number(numStr.slice(pos, pos + segmentSize)))\n    pos += segmentSize\n  }\n\n  // Convert segments to words\n  const parts = []\n  let scaleIndex = segments.length - 1\n\n  for (let i = 0; i < segments.length; i++) {\n    const segment = segments[i]\n\n    if (segment !== 0) {\n      const segmentWord = SEGMENTS[segment]\n\n      if (scaleIndex === 0) {\n        // Units segment\n        parts.push(segmentWord)\n      } else if (scaleIndex === 1) {\n        // Thousands - omit \"ένα\" before χίλια\n        if (segment === 1) {\n          parts.push(THOUSAND)\n        } else {\n          parts.push(segmentWord + ' ' + THOUSAND)\n        }\n      } else {\n        // Millions+ - omit \"ένα\" before scale words\n        const scaleWord = SCALES[scaleIndex - 2]\n        if (segment === 1) {\n          parts.push(scaleWord)\n        } else {\n          parts.push(segmentWord + ' ' + scaleWord)\n        }\n      }\n    }\n\n    scaleIndex--\n  }\n\n  return parts.join(' ')\n}\n\n/**\n * Converts decimal digits to Greek words (per-digit).\n *\n * @param {string} decimalPart - Decimal digits (without the point)\n * @returns {string} Greek words for decimal part\n */\nfunction decimalPartToWords (decimalPart) {\n  const parts = []\n\n  for (const digit of decimalPart) {\n    const d = parseInt(digit, 10)\n    if (d === 0) {\n      parts.push(ZERO)\n    } else {\n      parts.push(ONES[d])\n    }\n  }\n\n  return parts.join(' ')\n}\n\n/**\n * Converts a numeric value to Greek words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @returns {string} The number in Greek words\n * @throws {TypeError} If value is not a valid numeric type\n * @throws {Error} If value is not a valid number format\n *\n * @example\n * toWords(21)       // 'είκοσι ένα'\n * toWords(1000)     // 'χίλια'\n * toWords('3.14')   // 'τρία κόμμα ένα τέσσερα'\n */\nfunction toWords (value) {\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Public API\n// ============================================================================\n\nexport { toWords }\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES","TEENS","TENS","HUNDREDS","THOUSAND","ZERO","SCALES","buildSegment","n","ones","tens","Math","floor","hundreds","parts","push","tensOnes","join","SEGMENTS","Array","i","value","type","Number","isFinite","Error","isSafeInteger","toString","includes","numberToString","trimmed","trim","isNaN","normalizeString","TypeError","parseNumericValue","result","NEGATIVE","thousands","remainder","numStr","len","segments","remainderLen","pos","scaleIndex","segment","segmentWord","scaleWord","buildLargeNumberWords","integerToWords","digit","d","decimalPartToWords"],"mappings":";0CAwEA,SAASA,EAAoBC,GAC3B,MAAMC,EAAwB,MAAXD,EAAI,GACnBC,IAAYD,EAAMA,EAAIE,MAAM,IAEhC,MAAMC,EAAWH,EAAII,QAAQ,KAC7B,IAAiB,IAAbD,EACF,MAAO,CAAEF,aAAYI,YAAaC,OAAON,IAG3C,MAAMO,EAAaP,EAAIE,MAAM,EAAGC,IAAa,IACvCK,EAAcR,EAAIE,MAAMC,EAAW,GACzC,MAAO,CAAEF,aAAYI,YAAaC,OAAOC,GAAaC,cACxD,CAKA,SAASC,EAA0BT,GACjC,MAAOU,EAAUC,GAAUX,EAAIY,cAAcC,MAAM,KAC7CC,EAAMC,SAASJ,EAAQ,IAEvBR,EAAWO,EAASN,QAAQ,KAC5BY,OAASb,EACXO,EACAA,EAASR,MAAM,EAAGC,GAAYO,EAASR,MAAMC,EAAW,GAEtDc,IAD6B,IAAbd,EAAkBO,EAASQ,OAASf,GACnBW,EAEvC,OAAIG,GAAkBD,EAAOE,OACpBF,EAAS,IAAIG,OAAOF,EAAiBD,EAAOE,QAEjDD,GAAkB,EACb,KAAO,IAAIE,QAAQF,GAAkBD,EAEvCA,EAAOd,MAAM,EAAGe,GAAkB,IAAMD,EAAOd,MAAMe,EAC9D,CCzFA,MAAMG,EAAO,CAAC,GAAI,MAAO,MAAO,OAAQ,UAAW,QAAS,MAAO,OAAQ,OAAQ,SAE7EC,EAAQ,CAAC,OAAQ,SAAU,SAAU,WAAY,cAAe,YAAa,UAAW,WAAY,WAAY,aAEhHC,EAAO,CAAC,GAAI,GAAI,SAAU,UAAW,UAAW,UAAW,SAAU,YAAa,UAAW,YAG7FC,EAAW,CAAC,GAAI,QAAS,WAAY,YAAa,aAAc,aAAc,WAAY,YAAa,YAAa,cAEpHC,EAAW,QAEXC,EAAO,QAKPC,EAAS,CAAC,cAAe,iBAAkB,mBASjD,SAASC,EAAcC,GACrB,GAAU,IAANA,EAAS,MAAO,GAEpB,MAAMC,EAAOD,EAAI,GACXE,EAAOC,KAAKC,MAAMJ,EAAI,IAAM,GAC5BK,EAAWF,KAAKC,MAAMJ,EAAI,KAE1BM,EAAQ,GAGVD,EAAW,GACbC,EAAMC,KAAKZ,EAASU,IAItB,MAAMG,EAAWR,EAAI,IAcrB,OAZiB,IAAbQ,GAGFF,EAAMC,KADGC,EAAW,GACThB,EAAKS,GACPO,EAAW,GACTf,EAAMQ,GACC,IAATA,EACEP,EAAKQ,GAELR,EAAKQ,GAAQ,IAAMV,EAAKS,IAG9BK,EAAMG,KAAK,IACpB,CAGA,MAAMC,EAAW,IAAIC,MAAM,KAE3B,IAAK,IAAIC,EAAI,EAAGA,EAAI,IAAMA,IACxBF,EAASE,GAAKb,EAAaa,QA6I7B,SAAkBC,GAChB,MAAMxC,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GDhN5B,SAA4BiC,GACjC,MAAMC,SAAcD,EAGpB,GAAa,WAATC,EACF,OAAOD,EAAQ,GACX,CAAExC,YAAY,EAAMI,aAAcoC,GAClC,CAAExC,YAAY,EAAOI,YAAaoC,GAIxC,GAAa,WAATC,EAAmB,CACrB,IAAKC,OAAOC,SAASH,GACnB,MAAM,IAAII,MAAM,8DAElB,OAAIF,OAAOG,cAAcL,GAChBA,EAAQ,EACX,CAAExC,YAAY,EAAMI,YAAaC,QAAQmC,IACzC,CAAExC,YAAY,EAAOI,YAAaC,OAAOmC,IAExC1C,EAgBX,SAAyB0C,GACvB,MAAMzC,EAAMyC,EAAMM,WAClB,OAAQ/C,EAAIgD,SAAS,MAAQhD,EAAIgD,SAAS,KACtCvC,EAAyBT,GACzBA,CACN,CArB8BiD,CAAeR,GAC3C,CAGA,GAAa,WAATC,EACF,OAAO3C,EAqBX,SAA0B0C,GACxB,MAAMS,EAAUT,EAAMU,OACtB,GAAuB,IAAnBD,EAAQhC,QAAgByB,OAAOS,MAAMT,OAAOO,IAC9C,MAAM,IAAIL,MAAM,2BAA2BJ,MAE7C,OAAQS,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9CvC,EAAyByC,GACzBA,CACN,CA7B8BG,CAAgBZ,IAG5C,MAAM,IAAIa,UACR,oEAAoEZ,IAExE,CCiLmDa,CAAkBd,GAEnE,IAAIe,EAAS,GAYb,OAVIvD,IACFuD,EAASC,UAGXD,GAzIF,SAAyB5B,GACvB,GAAU,KAANA,EAAU,OAAOH,EAGrB,GAAIG,EAAI,MACN,OAAOU,EAASK,OAAOf,IAIzB,GAAIA,EAAI,SAAY,CAClB,MAAM8B,EAAYf,OAAOf,EAAI,OACvB+B,EAAYhB,OAAOf,EAAI,OAG7B,IAAI4B,EAWJ,OATEA,EADgB,IAAdE,EACOlC,EAEAc,EAASoB,GAAa,IAAMlC,EAGnCmC,EAAY,IACdH,GAAU,IAAMlB,EAASqB,IAGpBH,CACT,CAGA,OASF,SAAgC5B,GAC9B,MAAMgC,EAAShC,EAAEmB,WACXc,EAAMD,EAAO1C,OAGb4C,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAAS3B,KAAKQ,OAAOiB,EAAO1D,MAAM,EAAG6D,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAAS3B,KAAKQ,OAAOiB,EAAO1D,MAAM8D,EAAKA,EATrB,KAUlBA,GAVkB,EAcpB,MAAM9B,EAAQ,GACd,IAAI+B,EAAaH,EAAS5C,OAAS,EAEnC,IAAK,IAAIsB,EAAI,EAAGA,EAAIsB,EAAS5C,OAAQsB,IAAK,CACxC,MAAM0B,EAAUJ,EAAStB,GAEzB,GAAgB,IAAZ0B,EAAe,CACjB,MAAMC,EAAc7B,EAAS4B,GAE7B,GAAmB,IAAfD,EAEF/B,EAAMC,KAAKgC,QACN,GAAmB,IAAfF,EAGP/B,EAAMC,KADQ,IAAZ+B,EACS1C,EAEA2C,EAAc,IAAM3C,OAE5B,CAEL,MAAM4C,EAAY1C,EAAOuC,EAAa,GAEpC/B,EAAMC,KADQ,IAAZ+B,EACSE,EAEAD,EAAc,IAAMC,EAEnC,CACF,CAEAH,GACF,CAEA,OAAO/B,EAAMG,KAAK,IACpB,CA/DSgC,CAAsBzC,EAC/B,CA2GY0C,CAAejE,GAErBG,IACFgD,GAAU,UAxCd,SAA6BhD,GAC3B,MAAM0B,EAAQ,GAEd,IAAK,MAAMqC,KAAS/D,EAAa,CAC/B,MAAMgE,EAAIzD,SAASwD,EAAO,IAExBrC,EAAMC,KADE,IAANqC,EACS/C,EAEAL,EAAKoD,GAEpB,CAEA,OAAOtC,EAAMG,KAAK,IACpB,CA2BwCoC,CAAmBjE,IAGlDgD,CACT"}

package/dist/languages/en.js

@@ -1,3 +0,0 @@
-/*! n2words/en v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var e,n;e=this,n=function(e){"use strict";function n(e){const n="-"===e[0];n&&(e=e.slice(1));const t=e.indexOf(".");if(-1===t)return{isNegative:n,integerPart:BigInt(e)};const i=e.slice(0,t)||"0",r=e.slice(t+1);return{isNegative:n,integerPart:BigInt(i),decimalPart:r}}function t(e){const[n,t]=e.toLowerCase().split("e"),i=parseInt(t,10),r=n.indexOf("."),o=-1===r?n:n.slice(0,r)+n.slice(r+1),s=(-1===r?n.length:r)+i;return s>=o.length?o+"0".repeat(s-o.length):s<=0?"0."+"0".repeat(-s)+o:o.slice(0,s)+"."+o.slice(s)}const i=["","one","two","three","four","five","six","seven","eight","nine"],r=["ten","eleven","twelve","thirteen","fourteen","fifteen","sixteen","seventeen","eighteen","nineteen"],o=["","","twenty","thirty","forty","fifty","sixty","seventy","eighty","ninety"],s=["thousand","million","billion","trillion","quadrillion","quintillion","sextillion","septillion","octillion"],u="zero";function l(e){if(0===e)return{word:"",hasHundred:!1};const n=e%10,t=Math.floor(e/10)%10,s=Math.floor(e/100);let u="",l=!1;s>0&&(u=i[s]+" hundred",l=!0);let f="";return 1===t?f=r[n]:t>=2?f=n>0?o[t]+"-"+i[n]:o[t]:n>0&&(f=i[n]),u&&f?{word:u+" and "+f,hasHundred:!0}:{word:u||f,hasHundred:l}}const f=new Array(1e3),a=new Array(1e3);for(let e=0;e<1e3;e++){const n=l(e);f[e]=n.word,a[e]=n.hasHundred}function c(e){if(0n===e)return u;if(e<1000n)return f[Number(e)];if(e<1000000n){const n=Number(e/1000n),t=Number(e%1000n);let i=f[n]+" "+s[0];if(t>0){const e=f[t];i+=a[t]?" "+e:" and "+e}return i}return function(e){const n=[];let t=e;for(;t>0n;)n.push(Number(t%1000n)),t/=1000n;let i=-1;for(let e=0;e<n.length;e++)if(0!==n[e]){i=e;break}let r="",o=!1;for(let e=n.length-1;e>=0;e--){const t=n[e];0!==t&&(r&&e===i&&o&&!a[t]&&(r+=" and"),r&&(r+=" "),r+=f[t],e>0?(r+=" "+s[e-1],o=!0):o=!1)}return r}(e)}e.en=function(e){const{isNegative:i,integerPart:r,decimalPart:o}=function(e){const i=typeof e;if("bigint"===i)return e<0n?{isNegative:!0,integerPart:-e}:{isNegative:!1,integerPart:e};if("number"===i){if(!Number.isFinite(e))throw new Error("Number must be finite (NaN and Infinity are not supported)");return Number.isSafeInteger(e)?e<0?{isNegative:!0,integerPart:BigInt(-e)}:{isNegative:!1,integerPart:BigInt(e)}:n(function(e){const n=e.toString();return n.includes("e")||n.includes("E")?t(n):n}(e))}if("string"===i)return n(function(e){const n=e.trim();if(0===n.length||Number.isNaN(Number(n)))throw new Error(`Invalid number format: "${e}"`);return n.includes("e")||n.includes("E")?t(n):n}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${i}`)}(e);let s="";return i&&(s="minus "),s+=c(r),o&&(s+=" point "+function(e){let n="",t=0;for(;t<e.length&&"0"===e[t];)n&&(n+=" "),n+=u,t++;const i=e.slice(t);return i&&(n&&(n+=" "),n+=c(BigInt(i))),n}(o)),s}},"object"==typeof exports&&"undefined"!=typeof module?n(exports):"function"==typeof define&&define.amd?define(["exports"],n):n((e="undefined"!=typeof globalThis?globalThis:e||self).n2words=e.n2words||{});
-//# sourceMappingURL=en.js.map

package/dist/languages/en.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"en.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/en.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * English language converter - Functional Implementation v2\n *\n * A performance-optimized number-to-words converter using precomputed lookup tables.\n * Self-contained module with its own input validation, ready for subpath exports.\n *\n * Key optimization: Precompute all segment values (0-999) at module load.\n * This eliminates all per-call string manipulation for segment conversion.\n *\n * English-specific rules (handled in precomputation):\n * - \"and\" after hundreds: \"one hundred and twenty-three\"\n * - Hyphenated tens-ones: \"twenty-one\", \"forty-two\"\n * - \"and\" before final segment when following scale word\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\n\n// ============================================================================\n// Vocabulary (module-level constants)\n// ============================================================================\n\nconst ONES = ['', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine']\nconst TEENS = ['ten', 'eleven', 'twelve', 'thirteen', 'fourteen', 'fifteen', 'sixteen', 'seventeen', 'eighteen', 'nineteen']\nconst TENS = ['', '', 'twenty', 'thirty', 'forty', 'fifty', 'sixty', 'seventy', 'eighty', 'ninety']\n\nconst SCALES = ['thousand', 'million', 'billion', 'trillion', 'quadrillion', 'quintillion', 'sextillion', 'septillion', 'octillion']\n\nconst HUNDRED = 'hundred'\nconst ZERO = 'zero'\nconst NEGATIVE = 'minus'\nconst DECIMAL_SEP = 'point'\n\n// ============================================================================\n// Precomputed Lookup Tables (built once at module load)\n// ============================================================================\n\n/**\n * Builds segment word for 0-999.\n * Returns object with word and whether it contains \"hundred\" (for \"and\" logic).\n */\nfunction buildSegment (n) {\n  if (n === 0) return { word: '', hasHundred: false }\n\n  const ones = n % 10\n  const tens = Math.floor(n / 10) % 10\n  const hundreds = Math.floor(n / 100)\n\n  let result = ''\n  let hasHundred = false\n\n  // Hundreds\n  if (hundreds > 0) {\n    result = ONES[hundreds] + ' ' + HUNDRED\n    hasHundred = true\n  }\n\n  // Tens and ones\n  let tensOnes = ''\n  if (tens === 1) {\n    tensOnes = TEENS[ones]\n  } else if (tens >= 2) {\n    if (ones > 0) {\n      tensOnes = TENS[tens] + '-' + ONES[ones]\n    } else {\n      tensOnes = TENS[tens]\n    }\n  } else if (ones > 0) {\n    tensOnes = ONES[ones]\n  }\n\n  // Combine with \"and\" after hundreds\n  if (result && tensOnes) {\n    return { word: result + ' and ' + tensOnes, hasHundred: true }\n  }\n\n  return { word: result || tensOnes, hasHundred }\n}\n\n// Precompute all 1000 segment words (0-999)\nconst SEGMENTS = new Array(1000)\nconst SEGMENTS_HAS_HUNDRED = new Array(1000)\n\nfor (let i = 0; i < 1000; i++) {\n  const result = buildSegment(i)\n  SEGMENTS[i] = result.word\n  SEGMENTS_HAS_HUNDRED[i] = result.hasHundred\n}\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\n/**\n * Converts a non-negative integer to English words.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @returns {string} English words\n */\nfunction integerToWords (n) {\n  if (n === 0n) return ZERO\n\n  // Fast path: numbers < 1000 (direct lookup)\n  if (n < 1000n) {\n    return SEGMENTS[Number(n)]\n  }\n\n  // Fast path: numbers < 1,000,000 (thousands)\n  if (n < 1_000_000n) {\n    const thousands = Number(n / 1000n)\n    const remainder = Number(n % 1000n)\n\n    let result = SEGMENTS[thousands] + ' ' + SCALES[0]\n\n    if (remainder > 0) {\n      const remainderWord = SEGMENTS[remainder]\n      // Insert \"and\" if remainder doesn't have hundred\n      if (!SEGMENTS_HAS_HUNDRED[remainder]) {\n        result += ' and ' + remainderWord\n      } else {\n        result += ' ' + remainderWord\n      }\n    }\n\n    return result\n  }\n\n  // For numbers >= 1,000,000, use scale decomposition\n  return buildLargeNumberWords(n)\n}\n\n/**\n * Builds words for numbers >= 1,000,000.\n * Uses BigInt division for faster segment extraction.\n *\n * @param {bigint} n - Number >= 1,000,000\n * @returns {string} English words\n */\nfunction buildLargeNumberWords (n) {\n  // Extract segments using BigInt division (faster than string slicing)\n  // Segments are stored least-significant first (index 0 = ones, 1 = thousands, etc.)\n  const segments = []\n  let temp = n\n  while (temp > 0n) {\n    segments.push(Number(temp % 1000n))\n    temp = temp / 1000n\n  }\n\n  // Find the first (smallest index) non-zero segment - this is processed last\n  let firstNonZeroIdx = -1\n  for (let i = 0; i < segments.length; i++) {\n    if (segments[i] !== 0) {\n      firstNonZeroIdx = i\n      break\n    }\n  }\n\n  // Build result string directly (avoids intermediate object allocations)\n  // Process from most-significant (end) to least-significant (start)\n  let result = ''\n  let prevWasScale = false\n\n  for (let i = segments.length - 1; i >= 0; i--) {\n    const segment = segments[i]\n    if (segment === 0) continue\n\n    const segmentWord = SEGMENTS[segment]\n    const hasHundred = SEGMENTS_HAS_HUNDRED[segment]\n    const isLastSegment = (i === firstNonZeroIdx)\n\n    // Add \"and\" only before FINAL segment if it follows scale and doesn't have hundred\n    if (result && isLastSegment && prevWasScale && !hasHundred) {\n      result += ' and'\n    }\n\n    // Add segment word\n    if (result) result += ' '\n    result += segmentWord\n\n    // Add scale word (i=0 is units, i=1 is thousands, etc.)\n    if (i > 0) {\n      result += ' ' + SCALES[i - 1]\n      prevWasScale = true\n    } else {\n      prevWasScale = false\n    }\n  }\n\n  return result\n}\n\n/**\n * Converts decimal digits to English words.\n *\n * @param {string} decimalPart - Decimal digits (without the point)\n * @returns {string} English words for decimal part\n */\nfunction decimalPartToWords (decimalPart) {\n  let result = ''\n\n  // Handle leading zeros\n  let i = 0\n  while (i < decimalPart.length && decimalPart[i] === '0') {\n    if (result) result += ' '\n    result += ZERO\n    i++\n  }\n\n  // Convert remainder as a single number\n  const remainder = decimalPart.slice(i)\n  if (remainder) {\n    if (result) result += ' '\n    result += integerToWords(BigInt(remainder))\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to English words.\n *\n * This is the main public API. It accepts any valid numeric input\n * (number, string, or bigint) and handles parsing internally.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @returns {string} The number in English words\n * @throws {TypeError} If value is not a valid numeric type\n * @throws {Error} If value is not a valid number format\n *\n * @example\n * toWords(42)           // 'forty-two'\n * toWords(-3.14)        // 'minus three point one four'\n * toWords('1000000')    // 'one million'\n */\nfunction toWords (value) {\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Public API\n// ============================================================================\n\nexport { toWords }\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES","TEENS","TENS","SCALES","ZERO","buildSegment","n","word","hasHundred","ones","tens","Math","floor","hundreds","result","tensOnes","SEGMENTS","Array","SEGMENTS_HAS_HUNDRED","i","integerToWords","Number","thousands","remainder","remainderWord","segments","temp","push","firstNonZeroIdx","prevWasScale","segment","buildLargeNumberWords","value","type","isFinite","Error","isSafeInteger","toString","includes","numberToString","trimmed","trim","isNaN","normalizeString","TypeError","parseNumericValue","NEGATIVE","decimalPartToWords"],"mappings":";0CAwEA,SAASA,EAAoBC,GAC3B,MAAMC,EAAwB,MAAXD,EAAI,GACnBC,IAAYD,EAAMA,EAAIE,MAAM,IAEhC,MAAMC,EAAWH,EAAII,QAAQ,KAC7B,IAAiB,IAAbD,EACF,MAAO,CAAEF,aAAYI,YAAaC,OAAON,IAG3C,MAAMO,EAAaP,EAAIE,MAAM,EAAGC,IAAa,IACvCK,EAAcR,EAAIE,MAAMC,EAAW,GACzC,MAAO,CAAEF,aAAYI,YAAaC,OAAOC,GAAaC,cACxD,CAKA,SAASC,EAA0BT,GACjC,MAAOU,EAAUC,GAAUX,EAAIY,cAAcC,MAAM,KAC7CC,EAAMC,SAASJ,EAAQ,IAEvBR,EAAWO,EAASN,QAAQ,KAC5BY,OAASb,EACXO,EACAA,EAASR,MAAM,EAAGC,GAAYO,EAASR,MAAMC,EAAW,GAEtDc,IAD6B,IAAbd,EAAkBO,EAASQ,OAASf,GACnBW,EAEvC,OAAIG,GAAkBD,EAAOE,OACpBF,EAAS,IAAIG,OAAOF,EAAiBD,EAAOE,QAEjDD,GAAkB,EACb,KAAO,IAAIE,QAAQF,GAAkBD,EAEvCA,EAAOd,MAAM,EAAGe,GAAkB,IAAMD,EAAOd,MAAMe,EAC9D,CCtFA,MAAMG,EAAO,CAAC,GAAI,MAAO,MAAO,QAAS,OAAQ,OAAQ,MAAO,QAAS,QAAS,QAC5EC,EAAQ,CAAC,MAAO,SAAU,SAAU,WAAY,WAAY,UAAW,UAAW,YAAa,WAAY,YAC3GC,EAAO,CAAC,GAAI,GAAI,SAAU,SAAU,QAAS,QAAS,QAAS,UAAW,SAAU,UAEpFC,EAAS,CAAC,WAAY,UAAW,UAAW,WAAY,cAAe,cAAe,aAAc,aAAc,aAGlHC,EAAO,OAYb,SAASC,EAAcC,GACrB,GAAU,IAANA,EAAS,MAAO,CAAEC,KAAM,GAAIC,YAAY,GAE5C,MAAMC,EAAOH,EAAI,GACXI,EAAOC,KAAKC,MAAMN,EAAI,IAAM,GAC5BO,EAAWF,KAAKC,MAAMN,EAAI,KAEhC,IAAIQ,EAAS,GACTN,GAAa,EAGbK,EAAW,IACbC,EAASd,EAAKa,GAALb,WACTQ,GAAa,GAIf,IAAIO,EAAW,GAcf,OAba,IAATL,EACFK,EAAWd,EAAMQ,GACRC,GAAQ,EAEfK,EADEN,EAAO,EACEP,EAAKQ,GAAQ,IAAMV,EAAKS,GAExBP,EAAKQ,GAETD,EAAO,IAChBM,EAAWf,EAAKS,IAIdK,GAAUC,EACL,CAAER,KAAMO,EAAS,QAAUC,EAAUP,YAAY,GAGnD,CAAED,KAAMO,GAAUC,EAAUP,aACrC,CAGA,MAAMQ,EAAW,IAAIC,MAAM,KACrBC,EAAuB,IAAID,MAAM,KAEvC,IAAK,IAAIE,EAAI,EAAGA,EAAI,IAAMA,IAAK,CAC7B,MAAML,EAAST,EAAac,GAC5BH,EAASG,GAAKL,EAAOP,KACrBW,EAAqBC,GAAKL,EAAON,UACnC,CAYA,SAASY,EAAgBd,GACvB,GAAU,KAANA,EAAU,OAAOF,EAGrB,GAAIE,EAAI,MACN,OAAOU,EAASK,OAAOf,IAIzB,GAAIA,EAAI,SAAY,CAClB,MAAMgB,EAAYD,OAAOf,EAAI,OACvBiB,EAAYF,OAAOf,EAAI,OAE7B,IAAIQ,EAASE,EAASM,GAAa,IAAMnB,EAAO,GAEhD,GAAIoB,EAAY,EAAG,CACjB,MAAMC,EAAgBR,EAASO,GAK7BT,GAHGI,EAAqBK,GAGd,IAAMC,EAFN,QAAUA,CAIxB,CAEA,OAAOV,CACT,CAGA,OAUF,SAAgCR,GAG9B,MAAMmB,EAAW,GACjB,IAAIC,EAAOpB,EACX,KAAOoB,EAAO,IACZD,EAASE,KAAKN,OAAOK,EAAO,QAC5BA,GAAc,MAIhB,IAAIE,GAAkB,EACtB,IAAK,IAAIT,EAAI,EAAGA,EAAIM,EAAS3B,OAAQqB,IACnC,GAAoB,IAAhBM,EAASN,GAAU,CACrBS,EAAkBT,EAClB,KACF,CAKF,IAAIL,EAAS,GACTe,GAAe,EAEnB,IAAK,IAAIV,EAAIM,EAAS3B,OAAS,EAAGqB,GAAK,EAAGA,IAAK,CAC7C,MAAMW,EAAUL,EAASN,GACT,IAAZW,IAOAhB,GAHmBK,IAAMS,GAGEC,IAJZX,EAAqBY,KAKtChB,GAAU,QAIRA,IAAQA,GAAU,KACtBA,GAXoBE,EAASc,GAczBX,EAAI,GACNL,GAAU,IAAMX,EAAOgB,EAAI,GAC3BU,GAAe,GAEfA,GAAe,EAEnB,CAEA,OAAOf,CACT,CA7DSiB,CAAsBzB,EAC/B,MAyGA,SAAkB0B,GAChB,MAAMnD,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GD7N5B,SAA4B4C,GACjC,MAAMC,SAAcD,EAGpB,GAAa,WAATC,EACF,OAAOD,EAAQ,GACX,CAAEnD,YAAY,EAAMI,aAAc+C,GAClC,CAAEnD,YAAY,EAAOI,YAAa+C,GAIxC,GAAa,WAATC,EAAmB,CACrB,IAAKZ,OAAOa,SAASF,GACnB,MAAM,IAAIG,MAAM,8DAElB,OAAId,OAAOe,cAAcJ,GAChBA,EAAQ,EACX,CAAEnD,YAAY,EAAMI,YAAaC,QAAQ8C,IACzC,CAAEnD,YAAY,EAAOI,YAAaC,OAAO8C,IAExCrD,EAgBX,SAAyBqD,GACvB,MAAMpD,EAAMoD,EAAMK,WAClB,OAAQzD,EAAI0D,SAAS,MAAQ1D,EAAI0D,SAAS,KACtCjD,EAAyBT,GACzBA,CACN,CArB8B2D,CAAeP,GAC3C,CAGA,GAAa,WAATC,EACF,OAAOtD,EAqBX,SAA0BqD,GACxB,MAAMQ,EAAUR,EAAMS,OACtB,GAAuB,IAAnBD,EAAQ1C,QAAgBuB,OAAOqB,MAAMrB,OAAOmB,IAC9C,MAAM,IAAIL,MAAM,2BAA2BH,MAE7C,OAAQQ,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9CjD,EAAyBmD,GACzBA,CACN,CA7B8BG,CAAgBX,IAG5C,MAAM,IAAIY,UACR,oEAAoEX,IAExE,CC8LmDY,CAAkBb,GAEnE,IAAIlB,EAAS,GAYb,OAVIjC,IACFiC,EAASgC,UAGXhC,GAAUM,EAAenC,GAErBG,IACF0B,GAAU,UAjDd,SAA6B1B,GAC3B,IAAI0B,EAAS,GAGTK,EAAI,EACR,KAAOA,EAAI/B,EAAYU,QAA6B,MAAnBV,EAAY+B,IACvCL,IAAQA,GAAU,KACtBA,GAAUV,EACVe,IAIF,MAAMI,EAAYnC,EAAYN,MAAMqC,GAMpC,OALII,IACET,IAAQA,GAAU,KACtBA,GAAUM,EAAelC,OAAOqC,KAG3BT,CACT,CA8BwCiC,CAAmB3D,IAGlD0B,CACT"}

package/dist/languages/es.js

@@ -1,3 +0,0 @@
-/*! n2words/es v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var e,n;e=this,n=function(e){"use strict";function n(e){const n="-"===e[0];n&&(e=e.slice(1));const t=e.indexOf(".");if(-1===t)return{isNegative:n,integerPart:BigInt(e)};const i=e.slice(0,t)||"0",r=e.slice(t+1);return{isNegative:n,integerPart:BigInt(i),decimalPart:r}}function t(e){const[n,t]=e.toLowerCase().split("e"),i=parseInt(t,10),r=n.indexOf("."),o=-1===r?n:n.slice(0,r)+n.slice(r+1),s=(-1===r?n.length:r)+i;return s>=o.length?o+"0".repeat(s-o.length):s<=0?"0."+"0".repeat(-s)+o:o.slice(0,s)+"."+o.slice(s)}const i=["","uno","dos","tres","cuatro","cinco","seis","siete","ocho","nueve"],r=["","una","dos","tres","cuatro","cinco","seis","siete","ocho","nueve"],o=["diez","once","doce","trece","catorce","quince","dieciseis","diecisiete","dieciocho","diecinueve"],s=["veinte","veintiuno","veintidós","veintitrés","veinticuatro","veinticinco","veintiséis","veintisiete","veintiocho","veintinueve"],c=["veinte","veintiuna","veintidós","veintitrés","veinticuatro","veinticinco","veintiséis","veintisiete","veintiocho","veintinueve"],u=["","","","treinta","cuarenta","cincuenta","sesenta","setenta","ochenta","noventa"],a=["","ciento","doscientos","trescientos","cuatrocientos","quinientos","seiscientos","setecientos","ochocientos","novecientos"],l=["","cienta","doscientas","trescientas","cuatrocientas","quinientas","seiscientas","setecientas","ochocientas","novecientas"],f=["millón","billón","trillón","cuatrillón"],d=["millones","billones","trillones","cuatrillones"],v="mil",g="cero";function p(e,n){if(0===e)return"";if(100===e)return"cien";const t=e%10,f=Math.floor(e/10)%10,d=Math.floor(e/100),v=e%100,g=[];return d>0&&g.push((n?l:a)[d]),0===v||g.push(v<10?(n?r:i)[v]:v<20?o[t]:v<30?(n?c:s)[t]:0===t?u[f]:u[f]+" y "+(n?r:i)[t]),g.join(" ")}const b=new Array(1e3);for(let e=0;e<1e3;e++)b[e]=p(e,!1);const m=new Array(1e3);for(let e=0;e<1e3;e++)m[e]=p(e,!0);function h(e,n){if(1===e)return v;if(e%2==0){const t=e/2-1,i=f[t];return i?n>1n?d[t]:i:""}{const n=d[(e-1)/2-1];return n?v+" "+n:v}}function N(e,n){if(0n===e)return g;const t=n?m:b;if(e<1000n)return t[Number(e)];if(e<1000000n){const n=Number(e/1000n),i=Number(e%1000n);let r;if(1===n)r=v;else{const e=b[n];r="uno"===e||"una"===e?v:e+" "+v}return i>0&&(r+=" "+t[i]),r}return function(e,n){const t=[];let i=e;for(;i>0n;)t.push(i%1000n),i/=1000n;const r=n?m:b;let o="";for(let e=t.length-1;e>=0;e--){const n=t[e];if(0n===n)continue;const i=e>0?h(e,n):"";o&&(o+=" "),o+=0===e?r[Number(n)]:1===e?1n===n?v:b[Number(n)]+" "+i:e%2==1?1n===n?i:b[Number(n)]+" "+i:1n===n?"un "+i:b[Number(n)]+" "+i}return o}(e,n)}e.es=function(e,i){i=function(e){if(void 0===e)return{};if(function(e){if(null===e||"object"!=typeof e)return!1;const n=Object.getPrototypeOf(e);return null===n||n===Object.prototype}(e))return e;throw new TypeError("Invalid options: expected plain object or undefined, got "+typeof e)}(i);const{isNegative:r,integerPart:o,decimalPart:s}=function(e){const i=typeof e;if("bigint"===i)return e<0n?{isNegative:!0,integerPart:-e}:{isNegative:!1,integerPart:e};if("number"===i){if(!Number.isFinite(e))throw new Error("Number must be finite (NaN and Infinity are not supported)");return Number.isSafeInteger(e)?e<0?{isNegative:!0,integerPart:BigInt(-e)}:{isNegative:!1,integerPart:BigInt(e)}:n(function(e){const n=e.toString();return n.includes("e")||n.includes("E")?t(n):n}(e))}if("string"===i)return n(function(e){const n=e.trim();if(0===n.length||Number.isNaN(Number(n)))throw new Error(`Invalid number format: "${e}"`);return n.includes("e")||n.includes("E")?t(n):n}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${i}`)}(e),c="feminine"===i.gender;let u="";return r&&(u="menos "),u+=N(o,c),s&&(u+=" punto "+function(e,n){let t="",i=0;for(;i<e.length&&"0"===e[i];)t&&(t+=" "),t+=g,i++;const r=e.slice(i);return r&&(t&&(t+=" "),t+=N(BigInt(r),n)),t}(s,c)),u}},"object"==typeof exports&&"undefined"!=typeof module?n(exports):"function"==typeof define&&define.amd?define(["exports"],n):n((e="undefined"!=typeof globalThis?globalThis:e||self).n2words=e.n2words||{});
-//# sourceMappingURL=es.js.map

package/dist/languages/es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"es.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/es.js","../../lib/utils/validate-options.js","../../lib/utils/is-plain-object.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * Spanish language converter - Functional Implementation\n *\n * A performance-optimized number-to-words converter using precomputed lookup tables.\n * Self-contained module with its own input validation, ready for subpath exports.\n *\n * Key optimization: Precompute all segment values (0-999) at module load.\n * This eliminates all per-call string manipulation for segment conversion.\n *\n * Spanish-specific rules (handled in precomputation):\n * - Gender agreement: uno/una, veintiuno/veintiuna, hundreds\n * - Special twenties: veinte, veintiuno, veintidós, ... veintinueve\n * - \"y\" conjunction: treinta y uno (only 30-99 with ones)\n * - \"cien\" for exact 100, \"ciento/cienta\" otherwise\n * - Irregular hundreds: quinientos, setecientos, novecientos\n * - Compound long scale: millón, mil millones, billón, mil billones\n * - \"un\" before millón (not \"uno\"), omit before mil\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\nimport { validateOptions } from '../utils/validate-options.js'\n\n// ============================================================================\n// Vocabulary (module-level constants)\n// ============================================================================\n\nconst ONES_MASC = ['', 'uno', 'dos', 'tres', 'cuatro', 'cinco', 'seis', 'siete', 'ocho', 'nueve']\nconst ONES_FEM = ['', 'una', 'dos', 'tres', 'cuatro', 'cinco', 'seis', 'siete', 'ocho', 'nueve']\n\nconst TEENS = ['diez', 'once', 'doce', 'trece', 'catorce', 'quince', 'dieciseis', 'diecisiete', 'dieciocho', 'diecinueve']\n\n// 20-29 have special compound forms\nconst TWENTIES_MASC = ['veinte', 'veintiuno', 'veintidós', 'veintitrés', 'veinticuatro', 'veinticinco', 'veintiséis', 'veintisiete', 'veintiocho', 'veintinueve']\nconst TWENTIES_FEM = ['veinte', 'veintiuna', 'veintidós', 'veintitrés', 'veinticuatro', 'veinticinco', 'veintiséis', 'veintisiete', 'veintiocho', 'veintinueve']\n\nconst TENS = ['', '', '', 'treinta', 'cuarenta', 'cincuenta', 'sesenta', 'setenta', 'ochenta', 'noventa']\n\n// Irregular hundreds\nconst HUNDREDS_MASC = ['', 'ciento', 'doscientos', 'trescientos', 'cuatrocientos', 'quinientos', 'seiscientos', 'setecientos', 'ochocientos', 'novecientos']\nconst HUNDREDS_FEM = ['', 'cienta', 'doscientas', 'trescientas', 'cuatrocientas', 'quinientas', 'seiscientas', 'setecientas', 'ochocientas', 'novecientas']\n\n// Scale words (compound long scale)\nconst SCALES = ['millón', 'billón', 'trillón', 'cuatrillón']\nconst SCALES_PLURAL = ['millones', 'billones', 'trillones', 'cuatrillones']\n\nconst THOUSAND = 'mil'\nconst ZERO = 'cero'\nconst NEGATIVE = 'menos'\nconst DECIMAL_SEP = 'punto'\n\n// ============================================================================\n// Precomputed Lookup Tables (built once at module load)\n// ============================================================================\n\n/**\n * Builds segment word for 0-999.\n * @param {number} n - Segment value\n * @param {boolean} feminine - Use feminine forms\n * @returns {string} Spanish word\n */\nfunction buildSegment (n, feminine) {\n  if (n === 0) return ''\n\n  // Special case: exact 100 is \"cien\" (no gender)\n  if (n === 100) return 'cien'\n\n  const ones = n % 10\n  const tens = Math.floor(n / 10) % 10\n  const hundreds = Math.floor(n / 100)\n  const tensOnes = n % 100\n\n  const parts = []\n\n  // Hundreds\n  if (hundreds > 0) {\n    const hundredsArr = feminine ? HUNDREDS_FEM : HUNDREDS_MASC\n    parts.push(hundredsArr[hundreds])\n  }\n\n  // Tens and ones\n  if (tensOnes === 0) {\n    // Just hundreds\n  } else if (tensOnes < 10) {\n    // Single digit\n    const onesArr = feminine ? ONES_FEM : ONES_MASC\n    parts.push(onesArr[tensOnes])\n  } else if (tensOnes < 20) {\n    // 10-19: teens\n    parts.push(TEENS[ones])\n  } else if (tensOnes < 30) {\n    // 20-29: special twenties\n    const twentiesArr = feminine ? TWENTIES_FEM : TWENTIES_MASC\n    parts.push(twentiesArr[ones])\n  } else {\n    // 30-99: tens y ones\n    if (ones === 0) {\n      parts.push(TENS[tens])\n    } else {\n      const onesArr = feminine ? ONES_FEM : ONES_MASC\n      parts.push(TENS[tens] + ' y ' + onesArr[ones])\n    }\n  }\n\n  return parts.join(' ')\n}\n\n// Precompute all 1000 segment words (0-999) for masculine\nconst SEGMENTS_MASC = new Array(1000)\nfor (let i = 0; i < 1000; i++) {\n  SEGMENTS_MASC[i] = buildSegment(i, false)\n}\n\n// Precompute all 1000 segment words (0-999) for feminine\nconst SEGMENTS_FEM = new Array(1000)\nfor (let i = 0; i < 1000; i++) {\n  SEGMENTS_FEM[i] = buildSegment(i, true)\n}\n\n// ============================================================================\n// Helper Functions\n// ============================================================================\n\n/**\n * Gets scale word for Spanish compound long scale.\n *\n * @param {number} scaleIndex - Scale level (1 = thousand, 2 = million, etc.)\n * @param {bigint} segment - Segment value for pluralization\n * @returns {string} Scale word\n */\nfunction getScaleWord (scaleIndex, segment) {\n  if (scaleIndex === 1) return THOUSAND\n\n  // Even indices (2, 4, 6, 8): millón, billón, trillón, cuatrillón\n  // Odd indices > 1 (3, 5, 7): mil millones, mil billones, mil trillones\n  if (scaleIndex % 2 === 0) {\n    const arrayIndex = (scaleIndex / 2) - 1\n    const baseWord = SCALES[arrayIndex]\n    if (!baseWord) return ''\n    return segment > 1n ? SCALES_PLURAL[arrayIndex] : baseWord\n  } else {\n    // Compound: \"mil millones\" pattern\n    const arrayIndex = ((scaleIndex - 1) / 2) - 1\n    const pluralWord = SCALES_PLURAL[arrayIndex]\n    if (!pluralWord) return THOUSAND\n    return THOUSAND + ' ' + pluralWord\n  }\n}\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\n/**\n * Converts a non-negative integer to Spanish words.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @param {boolean} feminine - Use feminine forms\n * @returns {string} Spanish words\n */\nfunction integerToWords (n, feminine) {\n  if (n === 0n) return ZERO\n\n  const segments = feminine ? SEGMENTS_FEM : SEGMENTS_MASC\n\n  // Fast path: numbers < 1000 (direct lookup)\n  if (n < 1000n) {\n    return segments[Number(n)]\n  }\n\n  // Fast path: numbers < 1,000,000 (thousands)\n  if (n < 1_000_000n) {\n    const thousands = Number(n / 1000n)\n    const remainder = Number(n % 1000n)\n\n    let result\n    if (thousands === 1) {\n      // \"mil\" not \"uno mil\"\n      result = THOUSAND\n    } else {\n      // Use masculine for thousands segment, but check for \"uno\" → omit before mil\n      const thousandsWord = SEGMENTS_MASC[thousands]\n      // \"uno mil\" → \"mil\" (handled in joinSegments equivalent)\n      if (thousandsWord === 'uno' || thousandsWord === 'una') {\n        result = THOUSAND\n      } else {\n        result = thousandsWord + ' ' + THOUSAND\n      }\n    }\n\n    if (remainder > 0) {\n      result += ' ' + segments[remainder]\n    }\n\n    return result\n  }\n\n  // For numbers >= 1,000,000, use scale decomposition\n  return buildLargeNumberWords(n, feminine)\n}\n\n/**\n * Builds words for numbers >= 1,000,000.\n * Uses BigInt division for faster segment extraction.\n *\n * @param {bigint} n - Number >= 1,000,000\n * @param {boolean} feminine - Use feminine forms\n * @returns {string} Spanish words\n */\nfunction buildLargeNumberWords (n, feminine) {\n  // Extract segments using BigInt division (faster than string slicing)\n  // Segments stored least-significant first (index 0 = ones, 1 = thousands, etc.)\n  const segmentValues = []\n  let temp = n\n  while (temp > 0n) {\n    segmentValues.push(temp % 1000n)\n    temp = temp / 1000n\n  }\n\n  const segments = feminine ? SEGMENTS_FEM : SEGMENTS_MASC\n\n  // Build result string directly\n  let result = ''\n\n  for (let i = segmentValues.length - 1; i >= 0; i--) {\n    const segment = segmentValues[i]\n    if (segment === 0n) continue\n\n    const scaleWord = i > 0 ? getScaleWord(i, segment) : ''\n\n    if (result) result += ' '\n\n    if (i === 0) {\n      // Units segment\n      result += segments[Number(segment)]\n    } else if (i === 1) {\n      // Thousands: omit \"uno\" before mil\n      if (segment === 1n) {\n        result += THOUSAND\n      } else {\n        result += SEGMENTS_MASC[Number(segment)] + ' ' + scaleWord\n      }\n    } else if (i % 2 === 1) {\n      // Odd scale indices (3, 5, 7): \"mil millones\", \"mil billones\", etc.\n      // Omit \"uno\" before these compound scales\n      if (segment === 1n) {\n        result += scaleWord\n      } else {\n        result += SEGMENTS_MASC[Number(segment)] + ' ' + scaleWord\n      }\n    } else {\n      // Even scale indices (2, 4, 6): millón, billón, trillón\n      if (segment === 1n) {\n        // \"un millón\" not \"uno millón\"\n        result += 'un ' + scaleWord\n      } else {\n        // Use masculine for scale segment\n        result += SEGMENTS_MASC[Number(segment)] + ' ' + scaleWord\n      }\n    }\n  }\n\n  return result\n}\n\n/**\n * Converts decimal digits to Spanish words.\n *\n * @param {string} decimalPart - Decimal digits (without the point)\n * @param {boolean} feminine - Use feminine forms\n * @returns {string} Spanish words for decimal part\n */\nfunction decimalPartToWords (decimalPart, feminine) {\n  let result = ''\n\n  // Handle leading zeros\n  let i = 0\n  while (i < decimalPart.length && decimalPart[i] === '0') {\n    if (result) result += ' '\n    result += ZERO\n    i++\n  }\n\n  // Convert remainder as a single number\n  const remainder = decimalPart.slice(i)\n  if (remainder) {\n    if (result) result += ' '\n    result += integerToWords(BigInt(remainder), feminine)\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to Spanish words.\n *\n * This is the main public API. It accepts any valid numeric input\n * (number, string, or bigint) and handles parsing internally.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @param {Object} [options] - Optional configuration\n * @param {('masculine'|'feminine')} [options.gender='masculine'] - Grammatical gender\n * @returns {string} The number in Spanish words\n * @throws {TypeError} If value is not a valid numeric type\n * @throws {Error} If value is not a valid number format\n *\n * @example\n * toWords(21)                        // 'veintiuno'\n * toWords(21, {gender: 'feminine'})  // 'veintiuna'\n * toWords(1000000)                   // 'un millón'\n */\nfunction toWords (value, options) {\n  options = validateOptions(options)\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n  const feminine = options.gender === 'feminine'\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart, feminine)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart, feminine)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Public API\n// ============================================================================\n\nexport { toWords }\n","import { isPlainObject } from './is-plain-object.js'\n\n/**\n * Validates and normalizes the options parameter.\n *\n * @param {*} options The options value to validate\n * @returns {Object} A valid options object (empty object if undefined)\n * @throws {TypeError} If options is not undefined or a plain object\n */\nexport function validateOptions (options) {\n  if (options === undefined) return {}\n  if (isPlainObject(options)) return options\n  throw new TypeError(\n    `Invalid options: expected plain object or undefined, got ${typeof options}`\n  )\n}\n","/**\n * Checks if a value is a plain object (not null, array, or other object types).\n *\n * A plain object is one created by:\n * - Object literal: `{}`\n * - Object.create(null): null-prototype object\n *\n * This excludes arrays, class instances, Map, Set, and other object types.\n *\n * @param {*} value Value to check\n * @returns {boolean} True if value is a plain object\n */\nexport function isPlainObject (value) {\n  if (value === null || typeof value !== 'object') return false\n  const proto = Object.getPrototypeOf(value)\n  return proto === null || proto === Object.prototype\n}\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES_MASC","ONES_FEM","TEENS","TWENTIES_MASC","TWENTIES_FEM","TENS","HUNDREDS_MASC","HUNDREDS_FEM","SCALES","SCALES_PLURAL","THOUSAND","ZERO","buildSegment","n","feminine","ones","tens","Math","floor","hundreds","tensOnes","parts","push","join","SEGMENTS_MASC","Array","i","SEGMENTS_FEM","getScaleWord","scaleIndex","segment","arrayIndex","baseWord","pluralWord","integerToWords","segments","Number","thousands","remainder","result","thousandsWord","segmentValues","temp","scaleWord","buildLargeNumberWords","value","options","undefined","proto","Object","getPrototypeOf","prototype","isPlainObject","TypeError","validateOptions","type","isFinite","Error","isSafeInteger","toString","includes","numberToString","trimmed","trim","isNaN","normalizeString","parseNumericValue","gender","NEGATIVE","decimalPartToWords"],"mappings":";0CAwEA,SAASA,EAAoBC,GAC3B,MAAMC,EAAwB,MAAXD,EAAI,GACnBC,IAAYD,EAAMA,EAAIE,MAAM,IAEhC,MAAMC,EAAWH,EAAII,QAAQ,KAC7B,IAAiB,IAAbD,EACF,MAAO,CAAEF,aAAYI,YAAaC,OAAON,IAG3C,MAAMO,EAAaP,EAAIE,MAAM,EAAGC,IAAa,IACvCK,EAAcR,EAAIE,MAAMC,EAAW,GACzC,MAAO,CAAEF,aAAYI,YAAaC,OAAOC,GAAaC,cACxD,CAKA,SAASC,EAA0BT,GACjC,MAAOU,EAAUC,GAAUX,EAAIY,cAAcC,MAAM,KAC7CC,EAAMC,SAASJ,EAAQ,IAEvBR,EAAWO,EAASN,QAAQ,KAC5BY,OAASb,EACXO,EACAA,EAASR,MAAM,EAAGC,GAAYO,EAASR,MAAMC,EAAW,GAEtDc,IAD6B,IAAbd,EAAkBO,EAASQ,OAASf,GACnBW,EAEvC,OAAIG,GAAkBD,EAAOE,OACpBF,EAAS,IAAIG,OAAOF,EAAiBD,EAAOE,QAEjDD,GAAkB,EACb,KAAO,IAAIE,QAAQF,GAAkBD,EAEvCA,EAAOd,MAAM,EAAGe,GAAkB,IAAMD,EAAOd,MAAMe,EAC9D,CCjFA,MAAMG,EAAY,CAAC,GAAI,MAAO,MAAO,OAAQ,SAAU,QAAS,OAAQ,QAAS,OAAQ,SACnFC,EAAW,CAAC,GAAI,MAAO,MAAO,OAAQ,SAAU,QAAS,OAAQ,QAAS,OAAQ,SAElFC,EAAQ,CAAC,OAAQ,OAAQ,OAAQ,QAAS,UAAW,SAAU,YAAa,aAAc,YAAa,cAGvGC,EAAgB,CAAC,SAAU,YAAa,YAAa,aAAc,eAAgB,cAAe,aAAc,cAAe,aAAc,eAC7IC,EAAe,CAAC,SAAU,YAAa,YAAa,aAAc,eAAgB,cAAe,aAAc,cAAe,aAAc,eAE5IC,EAAO,CAAC,GAAI,GAAI,GAAI,UAAW,WAAY,YAAa,UAAW,UAAW,UAAW,WAGzFC,EAAgB,CAAC,GAAI,SAAU,aAAc,cAAe,gBAAiB,aAAc,cAAe,cAAe,cAAe,eACxIC,EAAe,CAAC,GAAI,SAAU,aAAc,cAAe,gBAAiB,aAAc,cAAe,cAAe,cAAe,eAGvIC,EAAS,CAAC,SAAU,SAAU,UAAW,cACzCC,EAAgB,CAAC,WAAY,WAAY,YAAa,gBAEtDC,EAAW,MACXC,EAAO,OAcb,SAASC,EAAcC,EAAGC,GACxB,GAAU,IAAND,EAAS,MAAO,GAGpB,GAAU,MAANA,EAAW,MAAO,OAEtB,MAAME,EAAOF,EAAI,GACXG,EAAOC,KAAKC,MAAML,EAAI,IAAM,GAC5BM,EAAWF,KAAKC,MAAML,EAAI,KAC1BO,EAAWP,EAAI,IAEfQ,EAAQ,GAgCd,OA7BIF,EAAW,GAEbE,EAAMC,MADcR,EAAWP,EAAeD,GACvBa,IAIR,IAAbC,GAKFC,EAAMC,KAHGF,EAAW,IAEJN,EAAWb,EAAWD,GACnBoB,GACVA,EAAW,GAETlB,EAAMa,GACRK,EAAW,IAEAN,EAAWV,EAAeD,GACvBY,GAGV,IAATA,EACSV,EAAKW,GAGLX,EAAKW,GAAQ,OADRF,EAAWb,EAAWD,GACEe,IAIrCM,EAAME,KAAK,IACpB,CAGA,MAAMC,EAAgB,IAAIC,MAAM,KAChC,IAAK,IAAIC,EAAI,EAAGA,EAAI,IAAMA,IACxBF,EAAcE,GAAKd,EAAac,GAAG,GAIrC,MAAMC,EAAe,IAAIF,MAAM,KAC/B,IAAK,IAAIC,EAAI,EAAGA,EAAI,IAAMA,IACxBC,EAAaD,GAAKd,EAAac,GAAG,GAcpC,SAASE,EAAcC,EAAYC,GACjC,GAAmB,IAAfD,EAAkB,OAAOnB,EAI7B,GAAImB,EAAa,GAAM,EAAG,CACxB,MAAME,EAAcF,EAAa,EAAK,EAChCG,EAAWxB,EAAOuB,GACxB,OAAKC,EACEF,EAAU,GAAKrB,EAAcsB,GAAcC,EAD5B,EAExB,CAAO,CAEL,MACMC,EAAaxB,GADEoB,EAAa,GAAK,EAAK,GAE5C,OAAKI,EACEvB,EAAW,IAAMuB,EADAvB,CAE1B,CACF,CAaA,SAASwB,EAAgBrB,EAAGC,GAC1B,GAAU,KAAND,EAAU,OAAOF,EAErB,MAAMwB,EAAWrB,EAAWa,EAAeH,EAG3C,GAAIX,EAAI,MACN,OAAOsB,EAASC,OAAOvB,IAIzB,GAAIA,EAAI,SAAY,CAClB,MAAMwB,EAAYD,OAAOvB,EAAI,OACvByB,EAAYF,OAAOvB,EAAI,OAE7B,IAAI0B,EACJ,GAAkB,IAAdF,EAEFE,EAAS7B,MACJ,CAEL,MAAM8B,EAAgBhB,EAAca,GAGlCE,EADoB,QAAlBC,GAA6C,QAAlBA,EACpB9B,EAEA8B,EAAgB,IAAM9B,CAEnC,CAMA,OAJI4B,EAAY,IACdC,GAAU,IAAMJ,EAASG,IAGpBC,CACT,CAGA,OAWF,SAAgC1B,EAAGC,GAGjC,MAAM2B,EAAgB,GACtB,IAAIC,EAAO7B,EACX,KAAO6B,EAAO,IACZD,EAAcnB,KAAKoB,EAAO,OAC1BA,GAAc,MAGhB,MAAMP,EAAWrB,EAAWa,EAAeH,EAG3C,IAAIe,EAAS,GAEb,IAAK,IAAIb,EAAIe,EAAc3C,OAAS,EAAG4B,GAAK,EAAGA,IAAK,CAClD,MAAMI,EAAUW,EAAcf,GAC9B,GAAgB,KAAZI,EAAgB,SAEpB,MAAMa,EAAYjB,EAAI,EAAIE,EAAaF,EAAGI,GAAW,GAEjDS,IAAQA,GAAU,KAIpBA,GAFQ,IAANb,EAEQS,EAASC,OAAON,IACX,IAANJ,EAEO,KAAZI,EACQpB,EAEAc,EAAcY,OAAON,IAAY,IAAMa,EAE1CjB,EAAI,GAAM,EAGH,KAAZI,EACQa,EAEAnB,EAAcY,OAAON,IAAY,IAAMa,EAInC,KAAZb,EAEQ,MAAQa,EAGRnB,EAAcY,OAAON,IAAY,IAAMa,CAGvD,CAEA,OAAOJ,CACT,CAjESK,CAAsB/B,EAAGC,EAClC,MAgHA,SAAkB+B,EAAOC,GACvBA,EC9SK,SAA0BA,GAC/B,QAAgBC,IAAZD,EAAuB,MAAO,CAAA,EAClC,GCCK,SAAwBD,GAC7B,GAAc,OAAVA,GAAmC,iBAAVA,EAAoB,OAAO,EACxD,MAAMG,EAAQC,OAAOC,eAAeL,GACpC,OAAiB,OAAVG,GAAkBA,IAAUC,OAAOE,SAC5C,CDLMC,CAAcN,GAAU,OAAOA,EACnC,MAAM,IAAIO,UACR,mEAAmEP,EAEvE,CDwSYQ,CAAgBR,GAC1B,MAAMjE,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GD3S5B,SAA4ByD,GACjC,MAAMU,SAAcV,EAGpB,GAAa,WAATU,EACF,OAAOV,EAAQ,GACX,CAAEhE,YAAY,EAAMI,aAAc4D,GAClC,CAAEhE,YAAY,EAAOI,YAAa4D,GAIxC,GAAa,WAATU,EAAmB,CACrB,IAAKnB,OAAOoB,SAASX,GACnB,MAAM,IAAIY,MAAM,8DAElB,OAAIrB,OAAOsB,cAAcb,GAChBA,EAAQ,EACX,CAAEhE,YAAY,EAAMI,YAAaC,QAAQ2D,IACzC,CAAEhE,YAAY,EAAOI,YAAaC,OAAO2D,IAExClE,EAgBX,SAAyBkE,GACvB,MAAMjE,EAAMiE,EAAMc,WAClB,OAAQ/E,EAAIgF,SAAS,MAAQhF,EAAIgF,SAAS,KACtCvE,EAAyBT,GACzBA,CACN,CArB8BiF,CAAehB,GAC3C,CAGA,GAAa,WAATU,EACF,OAAO5E,EAqBX,SAA0BkE,GACxB,MAAMiB,EAAUjB,EAAMkB,OACtB,GAAuB,IAAnBD,EAAQhE,QAAgBsC,OAAO4B,MAAM5B,OAAO0B,IAC9C,MAAM,IAAIL,MAAM,2BAA2BZ,MAE7C,OAAQiB,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9CvE,EAAyByE,GACzBA,CACN,CA7B8BG,CAAgBpB,IAG5C,MAAM,IAAIQ,UACR,oEAAoEE,IAExE,CC4QmDW,CAAkBrB,GAC7D/B,EAA8B,aAAnBgC,EAAQqB,OAEzB,IAAI5B,EAAS,GAYb,OAVI1D,IACF0D,EAAS6B,UAGX7B,GAAUL,EAAejD,EAAa6B,GAElC1B,IACFmD,GAAU,UArDd,SAA6BnD,EAAa0B,GACxC,IAAIyB,EAAS,GAGTb,EAAI,EACR,KAAOA,EAAItC,EAAYU,QAA6B,MAAnBV,EAAYsC,IACvCa,IAAQA,GAAU,KACtBA,GAAU5B,EACVe,IAIF,MAAMY,EAAYlD,EAAYN,MAAM4C,GAMpC,OALIY,IACEC,IAAQA,GAAU,KACtBA,GAAUL,EAAehD,OAAOoD,GAAYxB,IAGvCyB,CACT,CAkCwC8B,CAAmBjF,EAAa0B,IAG/DyB,CACT"}

package/dist/languages/fa.js

@@ -1,3 +0,0 @@
-/*! n2words/fa v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var e,n;e=this,n=function(e){"use strict";function n(e){const n="-"===e[0];n&&(e=e.slice(1));const t=e.indexOf(".");if(-1===t)return{isNegative:n,integerPart:BigInt(e)};const r=e.slice(0,t)||"0",i=e.slice(t+1);return{isNegative:n,integerPart:BigInt(r),decimalPart:i}}function t(e){const[n,t]=e.toLowerCase().split("e"),r=parseInt(t,10),i=n.indexOf("."),s=-1===i?n:n.slice(0,i)+n.slice(i+1),u=(-1===i?n.length:i)+r;return u>=s.length?s+"0".repeat(u-s.length):u<=0?"0."+"0".repeat(-u)+s:s.slice(0,u)+"."+s.slice(u)}const r={1:"یک",2:"دو",3:"سه",4:"چهار",5:"پنج",6:"شش",7:"هفت",8:"هشت",9:"نه"},i={10:"ده",11:"یازده",12:"دوازده",13:"سیزده",14:"چهارده",15:"پانزده",16:"شانزده",17:"هفده",18:"هجده",19:"نوزده"},s={20:"بیست",30:"سی",40:"چهل",50:"پنجاه",60:"شصت",70:"هفتاد",80:"هشتاد",90:"نود"},u={100:"صد",200:"دویست",300:"سيصد",400:"چهار صد",500:"پانصد",600:"ششصد",700:"هفتصد",800:"هشتصد",900:"نهصد"};function o(e){if(0n===e)return"صفر";if(e<=9n)return r[Number(e)];if(e<=19n)return i[Number(e)];if(e<100n){const n=e%10n,t=e-n;return 0n===n?s[Number(t)]:`${s[Number(t)]} و ${r[Number(n)]}`}if(e<1000n){const n=e/100n*100n,t=e-n;return 0n===t?u[Number(n)]:`${u[Number(n)]} و ${o(t)}`}if(e<1000000n){const n=e/1000n,t=e%1000n;return`${1n===n?"":o(n)+" "}هزار${0n===t?"":" "+o(t)}`}const n=e%1000000n;return`${o(e/1000000n)+" میلیون"}${0n===n?"":" و "+o(n)}`}e.fa=function(e){const{isNegative:r,integerPart:i,decimalPart:s}=function(e){const r=typeof e;if("bigint"===r)return e<0n?{isNegative:!0,integerPart:-e}:{isNegative:!1,integerPart:e};if("number"===r){if(!Number.isFinite(e))throw new Error("Number must be finite (NaN and Infinity are not supported)");return Number.isSafeInteger(e)?e<0?{isNegative:!0,integerPart:BigInt(-e)}:{isNegative:!1,integerPart:BigInt(e)}:n(function(e){const n=e.toString();return n.includes("e")||n.includes("E")?t(n):n}(e))}if("string"===r)return n(function(e){const n=e.trim();if(0===n.length||Number.isNaN(Number(n)))throw new Error(`Invalid number format: "${e}"`);return n.includes("e")||n.includes("E")?t(n):n}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${r}`)}(e);let u="";return r&&(u="منفى "),u+=o(i),s&&(u+=" ممیّز "+function(e){let n="",t=0;for(;t<e.length&&"0"===e[t];)n&&(n+=" "),n+="صفر",t++;const r=e.slice(t);return r&&(n&&(n+=" "),n+=o(BigInt(r))),n}(s)),u}},"object"==typeof exports&&"undefined"!=typeof module?n(exports):"function"==typeof define&&define.amd?define(["exports"],n):n((e="undefined"!=typeof globalThis?globalThis:e||self).n2words=e.n2words||{});
-//# sourceMappingURL=fa.js.map

package/dist/languages/fa.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fa.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/fa.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * Persian language converter - Functional Implementation\n *\n * Self-contained converter using recursive decomposition.\n *\n * Key features:\n * - \"و\" (and) conjunction for compound numbers\n * - Omit \"یک\" (one) before thousand\n * - Pre-composed hundreds (دویست, سيصد, etc.)\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\n\n// ============================================================================\n// Vocabulary\n// ============================================================================\n\nconst ONES = { 1: 'یک', 2: 'دو', 3: 'سه', 4: 'چهار', 5: 'پنج', 6: 'شش', 7: 'هفت', 8: 'هشت', 9: 'نه' }\nconst TEENS = { 10: 'ده', 11: 'یازده', 12: 'دوازده', 13: 'سیزده', 14: 'چهارده', 15: 'پانزده', 16: 'شانزده', 17: 'هفده', 18: 'هجده', 19: 'نوزده' }\nconst TENS = { 20: 'بیست', 30: 'سی', 40: 'چهل', 50: 'پنجاه', 60: 'شصت', 70: 'هفتاد', 80: 'هشتاد', 90: 'نود' }\nconst HUNDREDS = { 100: 'صد', 200: 'دویست', 300: 'سيصد', 400: 'چهار صد', 500: 'پانصد', 600: 'ششصد', 700: 'هفتصد', 800: 'هشتصد', 900: 'نهصد' }\n\nconst THOUSAND = 'هزار'\nconst MILLION = 'میلیون'\n\nconst ZERO = 'صفر'\nconst NEGATIVE = 'منفى'\nconst DECIMAL_SEP = 'ممیّز'\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\nfunction integerToWords (n) {\n  if (n === 0n) return ZERO\n\n  // 1-9\n  if (n <= 9n) {\n    return ONES[Number(n)]\n  }\n\n  // 10-19\n  if (n <= 19n) {\n    return TEENS[Number(n)]\n  }\n\n  // 20-99\n  if (n < 100n) {\n    const ones = n % 10n\n    const tens = n - ones\n    if (ones === 0n) {\n      return TENS[Number(tens)]\n    }\n    return `${TENS[Number(tens)]} و ${ONES[Number(ones)]}`\n  }\n\n  // 100-999\n  if (n < 1000n) {\n    const hundreds = 100n * (n / 100n)\n    const remainder = n - hundreds\n    if (remainder === 0n) {\n      return HUNDREDS[Number(hundreds)]\n    }\n    return `${HUNDREDS[Number(hundreds)]} و ${integerToWords(remainder)}`\n  }\n\n  // 1000-999999\n  if (n < 1_000_000n) {\n    const thousandMultiplier = n / 1000n\n    // Persian omits \"one\" before thousand: 1000 is just \"هزار\", not \"یک هزار\"\n    const thousandPrefix = thousandMultiplier === 1n\n      ? ''\n      : integerToWords(thousandMultiplier) + ' '\n    const remainder = n % 1000n\n    const suffix = remainder === 0n ? '' : ' ' + integerToWords(remainder)\n    return `${thousandPrefix}${THOUSAND}${suffix}`\n  }\n\n  // 1000000+\n  const millionMultiplier = n / 1_000_000n\n  const millionPrefix = integerToWords(millionMultiplier) + ' ' + MILLION\n  const remainder = n % 1_000_000n\n  const suffix = remainder === 0n ? '' : ' و ' + integerToWords(remainder)\n  return `${millionPrefix}${suffix}`\n}\n\nfunction decimalPartToWords (decimalPart) {\n  let result = ''\n  let i = 0\n\n  while (i < decimalPart.length && decimalPart[i] === '0') {\n    if (result) result += ' '\n    result += ZERO\n    i++\n  }\n\n  const remainder = decimalPart.slice(i)\n  if (remainder) {\n    if (result) result += ' '\n    result += integerToWords(BigInt(remainder))\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to Persian words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @returns {string} The number in Persian words\n */\nfunction toWords (value) {\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Exports\n// ============================================================================\n\nexport { toWords }\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES","TEENS","TENS","HUNDREDS","integerToWords","n","Number","ones","tens","hundreds","remainder","thousandMultiplier","value","type","isFinite","Error","isSafeInteger","toString","includes","numberToString","trimmed","trim","isNaN","normalizeString","TypeError","parseNumericValue","result","NEGATIVE","i","decimalPartToWords"],"mappings":";0CAwEA,SAASA,EAAoBC,GAC3B,MAAMC,EAAwB,MAAXD,EAAI,GACnBC,IAAYD,EAAMA,EAAIE,MAAM,IAEhC,MAAMC,EAAWH,EAAII,QAAQ,KAC7B,IAAiB,IAAbD,EACF,MAAO,CAAEF,aAAYI,YAAaC,OAAON,IAG3C,MAAMO,EAAaP,EAAIE,MAAM,EAAGC,IAAa,IACvCK,EAAcR,EAAIE,MAAMC,EAAW,GACzC,MAAO,CAAEF,aAAYI,YAAaC,OAAOC,GAAaC,cACxD,CAKA,SAASC,EAA0BT,GACjC,MAAOU,EAAUC,GAAUX,EAAIY,cAAcC,MAAM,KAC7CC,EAAMC,SAASJ,EAAQ,IAEvBR,EAAWO,EAASN,QAAQ,KAC5BY,OAASb,EACXO,EACAA,EAASR,MAAM,EAAGC,GAAYO,EAASR,MAAMC,EAAW,GAEtDc,IAD6B,IAAbd,EAAkBO,EAASQ,OAASf,GACnBW,EAEvC,OAAIG,GAAkBD,EAAOE,OACpBF,EAAS,IAAIG,OAAOF,EAAiBD,EAAOE,QAEjDD,GAAkB,EACb,KAAO,IAAIE,QAAQF,GAAkBD,EAEvCA,EAAOd,MAAM,EAAGe,GAAkB,IAAMD,EAAOd,MAAMe,EAC9D,CC1FA,MAAMG,EAAO,CAAE,EAAG,KAAM,EAAG,KAAM,EAAG,KAAM,EAAG,OAAQ,EAAG,MAAO,EAAG,KAAM,EAAG,MAAO,EAAG,MAAO,EAAG,MACzFC,EAAQ,CAAE,GAAI,KAAM,GAAI,QAAS,GAAI,SAAU,GAAI,QAAS,GAAI,SAAU,GAAI,SAAU,GAAI,SAAU,GAAI,OAAQ,GAAI,OAAQ,GAAI,SAClIC,EAAO,CAAE,GAAI,OAAQ,GAAI,KAAM,GAAI,MAAO,GAAI,QAAS,GAAI,MAAO,GAAI,QAAS,GAAI,QAAS,GAAI,OAChGC,EAAW,CAAE,IAAK,KAAM,IAAK,QAAS,IAAK,OAAQ,IAAK,UAAW,IAAK,QAAS,IAAK,OAAQ,IAAK,QAAS,IAAK,QAAS,IAAK,QAarI,SAASC,EAAgBC,GACvB,GAAU,KAANA,EAAU,MATH,MAYX,GAAIA,GAAK,GACP,OAAOL,EAAKM,OAAOD,IAIrB,GAAIA,GAAK,IACP,OAAOJ,EAAMK,OAAOD,IAItB,GAAIA,EAAI,KAAM,CACZ,MAAME,EAAOF,EAAI,IACXG,EAAOH,EAAIE,EACjB,OAAa,KAATA,EACKL,EAAKI,OAAOE,IAEd,GAAGN,EAAKI,OAAOE,SAAYR,EAAKM,OAAOC,KAChD,CAGA,GAAIF,EAAI,MAAO,CACb,MAAMI,EAAmBJ,EAAI,KAAZ,KACXK,EAAYL,EAAII,EACtB,OAAkB,KAAdC,EACKP,EAASG,OAAOG,IAElB,GAAGN,EAASG,OAAOG,SAAgBL,EAAeM,IAC3D,CAGA,GAAIL,EAAI,SAAY,CAClB,MAAMM,EAAqBN,EAAI,MAKzBK,EAAYL,EAAI,MAEtB,MAAO,GALuC,KAAvBM,EACnB,GACAP,EAAeO,GAAsB,UAEZ,KAAdD,EAAmB,GAAK,IAAMN,EAAeM,IAE9D,CAGA,MAEMA,EAAYL,EAAI,SAEtB,MAAO,GAHeD,EADIC,EAAI,UACRD,YAEO,KAAdM,EAAmB,GAAK,MAAQN,EAAeM,IAEhE,MA2BA,SAAkBE,GAChB,MAAM/B,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GDnG5B,SAA4BwB,GACjC,MAAMC,SAAcD,EAGpB,GAAa,WAATC,EACF,OAAOD,EAAQ,GACX,CAAE/B,YAAY,EAAMI,aAAc2B,GAClC,CAAE/B,YAAY,EAAOI,YAAa2B,GAIxC,GAAa,WAATC,EAAmB,CACrB,IAAKP,OAAOQ,SAASF,GACnB,MAAM,IAAIG,MAAM,8DAElB,OAAIT,OAAOU,cAAcJ,GAChBA,EAAQ,EACX,CAAE/B,YAAY,EAAMI,YAAaC,QAAQ0B,IACzC,CAAE/B,YAAY,EAAOI,YAAaC,OAAO0B,IAExCjC,EAgBX,SAAyBiC,GACvB,MAAMhC,EAAMgC,EAAMK,WAClB,OAAQrC,EAAIsC,SAAS,MAAQtC,EAAIsC,SAAS,KACtC7B,EAAyBT,GACzBA,CACN,CArB8BuC,CAAeP,GAC3C,CAGA,GAAa,WAATC,EACF,OAAOlC,EAqBX,SAA0BiC,GACxB,MAAMQ,EAAUR,EAAMS,OACtB,GAAuB,IAAnBD,EAAQtB,QAAgBQ,OAAOgB,MAAMhB,OAAOc,IAC9C,MAAM,IAAIL,MAAM,2BAA2BH,MAE7C,OAAQQ,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9C7B,EAAyB+B,GACzBA,CACN,CA7B8BG,CAAgBX,IAG5C,MAAM,IAAIY,UACR,oEAAoEX,IAExE,CCoEmDY,CAAkBb,GAEnE,IAAIc,EAAS,GAYb,OAVI7C,IACF6C,EAASC,SAGXD,GAAUtB,EAAenB,GAErBG,IACFsC,GAAU,UArCd,SAA6BtC,GAC3B,IAAIsC,EAAS,GACTE,EAAI,EAER,KAAOA,EAAIxC,EAAYU,QAA6B,MAAnBV,EAAYwC,IACvCF,IAAQA,GAAU,KACtBA,GAnES,MAoETE,IAGF,MAAMlB,EAAYtB,EAAYN,MAAM8C,GAMpC,OALIlB,IACEgB,IAAQA,GAAU,KACtBA,GAAUtB,EAAelB,OAAOwB,KAG3BgB,CACT,CAoBwCG,CAAmBzC,IAGlDsC,CACT"}

package/dist/languages/fi.js

@@ -1,3 +0,0 @@
-/*! n2words/fi v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var e,t;e=this,t=function(e){"use strict";function t(e){const t="-"===e[0];t&&(e=e.slice(1));const n=e.indexOf(".");if(-1===n)return{isNegative:t,integerPart:BigInt(e)};const i=e.slice(0,n)||"0",r=e.slice(n+1);return{isNegative:t,integerPart:BigInt(i),decimalPart:r}}function n(e){const[t,n]=e.toLowerCase().split("e"),i=parseInt(n,10),r=t.indexOf("."),s=-1===r?t:t.slice(0,r)+t.slice(r+1),o=(-1===r?t.length:r)+i;return o>=s.length?s+"0".repeat(o-s.length):o<=0?"0."+"0".repeat(-o)+s:s.slice(0,o)+"."+s.slice(o)}const i=["","yksi","kaksi","kolme","neljä","viisi","kuusi","seitsemän","kahdeksan","yhdeksän"],r=["kymmenen","yksitoista","kaksitoista","kolmetoista","neljätoista","viisitoista","kuusitoista","seitsemäntoista","kahdeksantoista","yhdeksäntoista"],s=["","","kaksikymmentä","kolmekymmentä","neljäkymmentä","viisikymmentä","kuusikymmentä","seitsemänkymmentä","kahdeksankymmentä","yhdeksänkymmentä"],o="sata",u="tuhat",a="nolla",l=["miljoona","miljardi","biljoona","triljoona"];function c(e){if(0===e)return"";const t=e%10,n=Math.floor(e/10)%10,u=Math.floor(e/100),a=[];u>0&&a.push(1===u?o:i[u]+" "+o);const l=e%100;return 0===l||a.push(l<10?i[t]:l<20?r[t]:0===t?s[n]:s[n]+i[t]),a.join(" ")}const f=new Array(1e3);for(let e=0;e<1e3;e++)f[e]=c(e);e.fi=function(e){const{isNegative:r,integerPart:s,decimalPart:o}=function(e){const i=typeof e;if("bigint"===i)return e<0n?{isNegative:!0,integerPart:-e}:{isNegative:!1,integerPart:e};if("number"===i){if(!Number.isFinite(e))throw new Error("Number must be finite (NaN and Infinity are not supported)");return Number.isSafeInteger(e)?e<0?{isNegative:!0,integerPart:BigInt(-e)}:{isNegative:!1,integerPart:BigInt(e)}:t(function(e){const t=e.toString();return t.includes("e")||t.includes("E")?n(t):t}(e))}if("string"===i)return t(function(e){const t=e.trim();if(0===t.length||Number.isNaN(Number(t)))throw new Error(`Invalid number format: "${e}"`);return t.includes("e")||t.includes("E")?n(t):t}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${i}`)}(e);let c="";return r&&(c="miinus "),c+=function(e){if(0n===e)return a;if(e<1000n)return f[Number(e)];if(e<1000000n){const t=Number(e/1000n),n=Number(e%1000n);let i;return i=1===t?u:f[t]+" "+u,n>0&&(i+=" "+f[n]),i}return function(e){const t=e.toString(),n=t.length,i=[],r=n%3;let s=0;for(r>0&&(i.push(Number(t.slice(0,r))),s=r);s<n;)i.push(Number(t.slice(s,s+3))),s+=3;const o=[];let a=i.length-1;for(let e=0;e<i.length;e++){const t=i[e];if(0!==t){const e=f[t];o.push(0===a?e:1===a?1===t?u:e+" "+u:e+" "+l[a-2])}a--}return o.join(" ")}(e)}(s),o&&(c+=" pilkku "+function(e){const t=[];for(const n of e){const e=parseInt(n,10);t.push(0===e?a:i[e])}return t.join(" ")}(o)),c}},"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).n2words=e.n2words||{});
-//# sourceMappingURL=fi.js.map

package/dist/languages/fi.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fi.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/fi.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * Finnish language converter - Functional Implementation\n *\n * A performance-optimized number-to-words converter using precomputed lookup tables.\n *\n * Key features:\n * - Compound tens+ones without spaces: \"kaksikymmentäyksi\" (21)\n * - Teens with \"-toista\" suffix\n * - Omit \"yksi\" before sata/tuhat but keep before miljoona+\n * - Long scale: miljoona, miljardi, biljoona\n * - Per-digit decimal reading\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\n\n// ============================================================================\n// Vocabulary (module-level constants)\n// ============================================================================\n\nconst ONES = ['', 'yksi', 'kaksi', 'kolme', 'neljä', 'viisi', 'kuusi', 'seitsemän', 'kahdeksan', 'yhdeksän']\n\nconst TEENS = ['kymmenen', 'yksitoista', 'kaksitoista', 'kolmetoista', 'neljätoista', 'viisitoista', 'kuusitoista', 'seitsemäntoista', 'kahdeksantoista', 'yhdeksäntoista']\n\n// Tens use \"kymmentä\" suffix\nconst TENS = ['', '', 'kaksikymmentä', 'kolmekymmentä', 'neljäkymmentä', 'viisikymmentä', 'kuusikymmentä', 'seitsemänkymmentä', 'kahdeksankymmentä', 'yhdeksänkymmentä']\n\nconst HUNDRED = 'sata'\nconst THOUSAND = 'tuhat'\n\nconst ZERO = 'nolla'\nconst NEGATIVE = 'miinus'\nconst DECIMAL_SEP = 'pilkku'\n\n// Long scale\nconst SCALES = ['miljoona', 'miljardi', 'biljoona', 'triljoona']\n\n// ============================================================================\n// Precomputed Lookup Tables (built once at module load)\n// ============================================================================\n\n/**\n * Builds segment word for 0-999.\n * Omits \"yksi\" before \"sata\" (hundred).\n */\nfunction buildSegment (n) {\n  if (n === 0) return ''\n\n  const ones = n % 10\n  const tens = Math.floor(n / 10) % 10\n  const hundreds = Math.floor(n / 100)\n\n  const parts = []\n\n  // Hundreds - omit \"yksi\" before sata\n  if (hundreds > 0) {\n    if (hundreds === 1) {\n      parts.push(HUNDRED)\n    } else {\n      parts.push(ONES[hundreds] + ' ' + HUNDRED)\n    }\n  }\n\n  // Tens and ones\n  const tensOnes = n % 100\n\n  if (tensOnes === 0) {\n    // Just hundreds\n  } else if (tensOnes < 10) {\n    parts.push(ONES[ones])\n  } else if (tensOnes < 20) {\n    parts.push(TEENS[ones])\n  } else if (ones === 0) {\n    parts.push(TENS[tens])\n  } else {\n    // Compound: \"kaksikymmentäyksi\" (no space)\n    parts.push(TENS[tens] + ONES[ones])\n  }\n\n  return parts.join(' ')\n}\n\n// Precompute all 1000 segment words (0-999)\nconst SEGMENTS = new Array(1000)\n\nfor (let i = 0; i < 1000; i++) {\n  SEGMENTS[i] = buildSegment(i)\n}\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\n/**\n * Converts a non-negative integer to Finnish words.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @returns {string} Finnish words\n */\nfunction integerToWords (n) {\n  if (n === 0n) return ZERO\n\n  // Fast path: numbers < 1000 (direct lookup)\n  if (n < 1000n) {\n    return SEGMENTS[Number(n)]\n  }\n\n  // Fast path: numbers < 1,000,000 (thousands)\n  if (n < 1_000_000n) {\n    const thousands = Number(n / 1000n)\n    const remainder = Number(n % 1000n)\n\n    // Omit \"yksi\" before tuhat\n    let result\n    if (thousands === 1) {\n      result = THOUSAND\n    } else {\n      result = SEGMENTS[thousands] + ' ' + THOUSAND\n    }\n\n    if (remainder > 0) {\n      result += ' ' + SEGMENTS[remainder]\n    }\n\n    return result\n  }\n\n  // For numbers >= 1,000,000, use scale decomposition\n  return buildLargeNumberWords(n)\n}\n\n/**\n * Builds words for numbers >= 1,000,000.\n *\n * @param {bigint} n - Number >= 1,000,000\n * @returns {string} Finnish words\n */\nfunction buildLargeNumberWords (n) {\n  const numStr = n.toString()\n  const len = numStr.length\n\n  // Build segments of 3 digits from right to left\n  const segments = []\n  const segmentSize = 3\n\n  const remainderLen = len % segmentSize\n  let pos = 0\n  if (remainderLen > 0) {\n    segments.push(Number(numStr.slice(0, remainderLen)))\n    pos = remainderLen\n  }\n  while (pos < len) {\n    segments.push(Number(numStr.slice(pos, pos + segmentSize)))\n    pos += segmentSize\n  }\n\n  // Convert segments to words\n  const parts = []\n  let scaleIndex = segments.length - 1\n\n  for (let i = 0; i < segments.length; i++) {\n    const segment = segments[i]\n\n    if (segment !== 0) {\n      const segmentWord = SEGMENTS[segment]\n\n      if (scaleIndex === 0) {\n        // Units segment\n        parts.push(segmentWord)\n      } else if (scaleIndex === 1) {\n        // Thousands - omit \"yksi\" before tuhat\n        if (segment === 1) {\n          parts.push(THOUSAND)\n        } else {\n          parts.push(segmentWord + ' ' + THOUSAND)\n        }\n      } else {\n        // Millions+ - keep \"yksi\" before scale words\n        const scaleWord = SCALES[scaleIndex - 2]\n        parts.push(segmentWord + ' ' + scaleWord)\n      }\n    }\n\n    scaleIndex--\n  }\n\n  return parts.join(' ')\n}\n\n/**\n * Converts decimal digits to Finnish words (per-digit).\n *\n * @param {string} decimalPart - Decimal digits (without the point)\n * @returns {string} Finnish words for decimal part\n */\nfunction decimalPartToWords (decimalPart) {\n  const parts = []\n\n  for (const digit of decimalPart) {\n    const d = parseInt(digit, 10)\n    if (d === 0) {\n      parts.push(ZERO)\n    } else {\n      parts.push(ONES[d])\n    }\n  }\n\n  return parts.join(' ')\n}\n\n/**\n * Converts a numeric value to Finnish words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @returns {string} The number in Finnish words\n * @throws {TypeError} If value is not a valid numeric type\n * @throws {Error} If value is not a valid number format\n *\n * @example\n * toWords(21)       // 'kaksikymmentäyksi'\n * toWords(1000)     // 'tuhat'\n * toWords('3.14')   // 'kolme pilkku yksi neljä'\n */\nfunction toWords (value) {\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Public API\n// ============================================================================\n\nexport { toWords }\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES","TEENS","TENS","HUNDRED","THOUSAND","ZERO","SCALES","buildSegment","n","ones","tens","Math","floor","hundreds","parts","push","tensOnes","join","SEGMENTS","Array","i","value","type","Number","isFinite","Error","isSafeInteger","toString","includes","numberToString","trimmed","trim","isNaN","normalizeString","TypeError","parseNumericValue","result","NEGATIVE","thousands","remainder","numStr","len","segments","remainderLen","pos","scaleIndex","segment","segmentWord","buildLargeNumberWords","integerToWords","digit","d","decimalPartToWords"],"mappings":";0CAwEA,SAASA,EAAoBC,GAC3B,MAAMC,EAAwB,MAAXD,EAAI,GACnBC,IAAYD,EAAMA,EAAIE,MAAM,IAEhC,MAAMC,EAAWH,EAAII,QAAQ,KAC7B,IAAiB,IAAbD,EACF,MAAO,CAAEF,aAAYI,YAAaC,OAAON,IAG3C,MAAMO,EAAaP,EAAIE,MAAM,EAAGC,IAAa,IACvCK,EAAcR,EAAIE,MAAMC,EAAW,GACzC,MAAO,CAAEF,aAAYI,YAAaC,OAAOC,GAAaC,cACxD,CAKA,SAASC,EAA0BT,GACjC,MAAOU,EAAUC,GAAUX,EAAIY,cAAcC,MAAM,KAC7CC,EAAMC,SAASJ,EAAQ,IAEvBR,EAAWO,EAASN,QAAQ,KAC5BY,OAASb,EACXO,EACAA,EAASR,MAAM,EAAGC,GAAYO,EAASR,MAAMC,EAAW,GAEtDc,IAD6B,IAAbd,EAAkBO,EAASQ,OAASf,GACnBW,EAEvC,OAAIG,GAAkBD,EAAOE,OACpBF,EAAS,IAAIG,OAAOF,EAAiBD,EAAOE,QAEjDD,GAAkB,EACb,KAAO,IAAIE,QAAQF,GAAkBD,EAEvCA,EAAOd,MAAM,EAAGe,GAAkB,IAAMD,EAAOd,MAAMe,EAC9D,CCxFA,MAAMG,EAAO,CAAC,GAAI,OAAQ,QAAS,QAAS,QAAS,QAAS,QAAS,YAAa,YAAa,YAE3FC,EAAQ,CAAC,WAAY,aAAc,cAAe,cAAe,cAAe,cAAe,cAAe,kBAAmB,kBAAmB,kBAGpJC,EAAO,CAAC,GAAI,GAAI,gBAAiB,gBAAiB,gBAAiB,gBAAiB,gBAAiB,oBAAqB,oBAAqB,oBAE/IC,EAAU,OACVC,EAAW,QAEXC,EAAO,QAKPC,EAAS,CAAC,WAAY,WAAY,WAAY,aAUpD,SAASC,EAAcC,GACrB,GAAU,IAANA,EAAS,MAAO,GAEpB,MAAMC,EAAOD,EAAI,GACXE,EAAOC,KAAKC,MAAMJ,EAAI,IAAM,GAC5BK,EAAWF,KAAKC,MAAMJ,EAAI,KAE1BM,EAAQ,GAGVD,EAAW,GAEXC,EAAMC,KADS,IAAbF,EACSV,EAEAH,EAAKa,GAAY,IAAMV,GAKtC,MAAMa,EAAWR,EAAI,IAerB,OAbiB,IAAbQ,GAGFF,EAAMC,KADGC,EAAW,GACThB,EAAKS,GACPO,EAAW,GACTf,EAAMQ,GACC,IAATA,EACEP,EAAKQ,GAGLR,EAAKQ,GAAQV,EAAKS,IAGxBK,EAAMG,KAAK,IACpB,CAGA,MAAMC,EAAW,IAAIC,MAAM,KAE3B,IAAK,IAAIC,EAAI,EAAGA,EAAI,IAAMA,IACxBF,EAASE,GAAKb,EAAaa,QAyI7B,SAAkBC,GAChB,MAAMxC,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GDlN5B,SAA4BiC,GACjC,MAAMC,SAAcD,EAGpB,GAAa,WAATC,EACF,OAAOD,EAAQ,GACX,CAAExC,YAAY,EAAMI,aAAcoC,GAClC,CAAExC,YAAY,EAAOI,YAAaoC,GAIxC,GAAa,WAATC,EAAmB,CACrB,IAAKC,OAAOC,SAASH,GACnB,MAAM,IAAII,MAAM,8DAElB,OAAIF,OAAOG,cAAcL,GAChBA,EAAQ,EACX,CAAExC,YAAY,EAAMI,YAAaC,QAAQmC,IACzC,CAAExC,YAAY,EAAOI,YAAaC,OAAOmC,IAExC1C,EAgBX,SAAyB0C,GACvB,MAAMzC,EAAMyC,EAAMM,WAClB,OAAQ/C,EAAIgD,SAAS,MAAQhD,EAAIgD,SAAS,KACtCvC,EAAyBT,GACzBA,CACN,CArB8BiD,CAAeR,GAC3C,CAGA,GAAa,WAATC,EACF,OAAO3C,EAqBX,SAA0B0C,GACxB,MAAMS,EAAUT,EAAMU,OACtB,GAAuB,IAAnBD,EAAQhC,QAAgByB,OAAOS,MAAMT,OAAOO,IAC9C,MAAM,IAAIL,MAAM,2BAA2BJ,MAE7C,OAAQS,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9CvC,EAAyByC,GACzBA,CACN,CA7B8BG,CAAgBZ,IAG5C,MAAM,IAAIa,UACR,oEAAoEZ,IAExE,CCmLmDa,CAAkBd,GAEnE,IAAIe,EAAS,GAYb,OAVIvD,IACFuD,EAASC,WAGXD,GArIF,SAAyB5B,GACvB,GAAU,KAANA,EAAU,OAAOH,EAGrB,GAAIG,EAAI,MACN,OAAOU,EAASK,OAAOf,IAIzB,GAAIA,EAAI,SAAY,CAClB,MAAM8B,EAAYf,OAAOf,EAAI,OACvB+B,EAAYhB,OAAOf,EAAI,OAG7B,IAAI4B,EAWJ,OATEA,EADgB,IAAdE,EACOlC,EAEAc,EAASoB,GAAa,IAAMlC,EAGnCmC,EAAY,IACdH,GAAU,IAAMlB,EAASqB,IAGpBH,CACT,CAGA,OASF,SAAgC5B,GAC9B,MAAMgC,EAAShC,EAAEmB,WACXc,EAAMD,EAAO1C,OAGb4C,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAAS3B,KAAKQ,OAAOiB,EAAO1D,MAAM,EAAG6D,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAAS3B,KAAKQ,OAAOiB,EAAO1D,MAAM8D,EAAKA,EATrB,KAUlBA,GAVkB,EAcpB,MAAM9B,EAAQ,GACd,IAAI+B,EAAaH,EAAS5C,OAAS,EAEnC,IAAK,IAAIsB,EAAI,EAAGA,EAAIsB,EAAS5C,OAAQsB,IAAK,CACxC,MAAM0B,EAAUJ,EAAStB,GAEzB,GAAgB,IAAZ0B,EAAe,CACjB,MAAMC,EAAc7B,EAAS4B,GAI3BhC,EAAMC,KAFW,IAAf8B,EAESE,EACa,IAAfF,EAEO,IAAZC,EACS1C,EAEA2C,EAAc,IAAM3C,EAKtB2C,EAAc,IADPzC,EAAOuC,EAAa,GAG1C,CAEAA,GACF,CAEA,OAAO/B,EAAMG,KAAK,IACpB,CA3DS+B,CAAsBxC,EAC/B,CAuGYyC,CAAehE,GAErBG,IACFgD,GAAU,WAxCd,SAA6BhD,GAC3B,MAAM0B,EAAQ,GAEd,IAAK,MAAMoC,KAAS9D,EAAa,CAC/B,MAAM+D,EAAIxD,SAASuD,EAAO,IAExBpC,EAAMC,KADE,IAANoC,EACS9C,EAEAL,EAAKmD,GAEpB,CAEA,OAAOrC,EAAMG,KAAK,IACpB,CA2BwCmC,CAAmBhE,IAGlDgD,CACT"}

package/dist/languages/fil.js

@@ -1,3 +0,0 @@
-/*! n2words/fil v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var n,e;n=this,e=function(n){"use strict";function e(n){const e="-"===n[0];e&&(n=n.slice(1));const t=n.indexOf(".");if(-1===t)return{isNegative:e,integerPart:BigInt(n)};const i=n.slice(0,t)||"0",r=n.slice(t+1);return{isNegative:e,integerPart:BigInt(i),decimalPart:r}}function t(n){const[e,t]=n.toLowerCase().split("e"),i=parseInt(t,10),r=e.indexOf("."),a=-1===r?e:e.slice(0,r)+e.slice(r+1),o=(-1===r?e.length:r)+i;return o>=a.length?a+"0".repeat(o-a.length):o<=0?"0."+"0".repeat(-o)+a:a.slice(0,o)+"."+a.slice(o)}const i=["","isa","dalawa","tatlo","apat","lima","anim","pito","walo","siyam"],r=["sampu","labinisa","labindalawa","labintatlo","labinapat","labinlima","labinanum","labimpito","labingwalo","labinsiyam"],a=["","","dalawampu","tatlumpu","apatnapu","limampu","animnapu","pitumpu","walumpu","siyamnapu"],o="zero",s=["","libong","milyong","bilyong","trilyong"],u=["a","e","i","o","u"];function l(n){return u.includes(n[n.length-1])?n+"ng":n+" na"}function c(n){if(0===n)return"";const e=n%10,t=Math.floor(n/10)%10,o=Math.floor(n/100),s=[];if(o>0){const n=l(i[o]);s.push(n+" daang")}const u=n%100;return 0===u||s.push(u<10?i[e]:u<20?r[e]:0===e?a[t]:5===t?a[t]+"ng "+i[e]:a[t]+" "+i[e]),s.join(" ")}const f=new Array(1e3);for(let n=0;n<1e3;n++)f[n]=c(n);function g(n){const e=f[n];if(!e)return"";const t=e.lastIndexOf(" ");if(-1===t)return"g"===e[e.length-1]&&e.endsWith("ng")?e:l(e);const i=e.slice(0,t+1),r=e.slice(t+1);return r.endsWith("ng")?e:i+l(r)}const p=new Array(1e3);for(let n=0;n<1e3;n++)p[n]=g(n);n.fil=function(n){const{isNegative:r,integerPart:a,decimalPart:u}=function(n){const i=typeof n;if("bigint"===i)return n<0n?{isNegative:!0,integerPart:-n}:{isNegative:!1,integerPart:n};if("number"===i){if(!Number.isFinite(n))throw new Error("Number must be finite (NaN and Infinity are not supported)");return Number.isSafeInteger(n)?n<0?{isNegative:!0,integerPart:BigInt(-n)}:{isNegative:!1,integerPart:BigInt(n)}:e(function(n){const e=n.toString();return e.includes("e")||e.includes("E")?t(e):e}(n))}if("string"===i)return e(function(n){const e=n.trim();if(0===e.length||Number.isNaN(Number(e)))throw new Error(`Invalid number format: "${n}"`);return e.includes("e")||e.includes("E")?t(e):e}(n));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${i}`)}(n);let l="";return r&&(l="negatibo "),l+=0n===(c=a)?o:c<1000n?f[Number(c)]:function(n){const e=[];let t=n;for(;t>0n;)e.push(Number(t%1000n)),t/=1000n;let i="";for(let n=e.length-1;n>=0;n--){const t=e[n];0!==t&&(i&&(i+=" "),i+=0===n?f[t]:p[t]+" "+(s[n]||""))}return i}(c),u&&(l+=" punto "+function(n){const e=[];for(const t of n){const n=parseInt(t,10);e.push(0===n?o:i[n])}return e.join(" ")}(u)),l;var c}},"object"==typeof exports&&"undefined"!=typeof module?e(exports):"function"==typeof define&&define.amd?define(["exports"],e):e((n="undefined"!=typeof globalThis?globalThis:n||self).n2words=n.n2words||{});
-//# sourceMappingURL=fil.js.map

package/dist/languages/fil.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fil.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/fil.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * Filipino language converter - Functional Implementation\n *\n * Self-contained converter with precomputed lookup tables.\n *\n * Key features:\n * - Linker \"ng\" after vowels: \"isang daang\" (100)\n * - Linker \" na \" after consonants: \"siyam na daang\" (900)\n * - Special tens with linker: \"limampung anim\" (56)\n * - Per-digit decimal reading\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\n\n// ============================================================================\n// Vocabulary\n// ============================================================================\n\nconst ONES = ['', 'isa', 'dalawa', 'tatlo', 'apat', 'lima', 'anim', 'pito', 'walo', 'siyam']\nconst TEENS = ['sampu', 'labinisa', 'labindalawa', 'labintatlo', 'labinapat', 'labinlima', 'labinanum', 'labimpito', 'labingwalo', 'labinsiyam']\nconst TENS = ['', '', 'dalawampu', 'tatlumpu', 'apatnapu', 'limampu', 'animnapu', 'pitumpu', 'walumpu', 'siyamnapu']\n\n// Scale words include linker (end with \"ng\")\nconst HUNDRED = 'daang'\nconst THOUSAND = 'libong'\n\nconst ZERO = 'zero'\nconst NEGATIVE = 'negatibo'\nconst DECIMAL_SEP = 'punto'\n\n// Short scale with linker\nconst SCALE_WORDS = ['', THOUSAND, 'milyong', 'bilyong', 'trilyong']\n\n// ============================================================================\n// Helper Functions\n// ============================================================================\n\nconst VOWELS = ['a', 'e', 'i', 'o', 'u']\n\nfunction addLinker (word) {\n  const lastChar = word[word.length - 1]\n  if (VOWELS.includes(lastChar)) {\n    return word + 'ng'\n  }\n  return word + ' na'\n}\n\n// ============================================================================\n// Precomputed Lookup Table\n// ============================================================================\n\nfunction buildSegment (n) {\n  if (n === 0) return ''\n\n  const ones = n % 10\n  const tensDigit = Math.floor(n / 10) % 10\n  const hundredsDigit = Math.floor(n / 100)\n\n  const parts = []\n\n  // Hundreds: \"isang daan\", \"dalawang daan\", \"siyam na daan\"\n  if (hundredsDigit > 0) {\n    const hundredPrefix = addLinker(ONES[hundredsDigit])\n    parts.push(hundredPrefix + ' ' + HUNDRED)\n  }\n\n  // Tens and ones\n  const tensOnes = n % 100\n\n  if (tensOnes === 0) {\n    // Just hundreds\n  } else if (tensOnes < 10) {\n    // Single digit\n    parts.push(ONES[ones])\n  } else if (tensOnes < 20) {\n    // Teens (10-19)\n    parts.push(TEENS[ones])\n  } else if (ones === 0) {\n    // Even tens (20, 30, 40, etc.)\n    parts.push(TENS[tensDigit])\n  } else {\n    // Tens + ones\n    // limampu (50) gets special linker: \"limampung anim\" (56)\n    if (tensDigit === 5) {\n      parts.push(TENS[tensDigit] + 'ng ' + ONES[ones])\n    } else {\n      parts.push(TENS[tensDigit] + ' ' + ONES[ones])\n    }\n  }\n\n  return parts.join(' ')\n}\n\nconst SEGMENTS = new Array(1000)\nfor (let i = 0; i < 1000; i++) {\n  SEGMENTS[i] = buildSegment(i)\n}\n\n/**\n * Builds segment with linker added to last word (for use before scale words).\n */\nfunction buildSegmentWithLinker (n) {\n  const segmentWord = SEGMENTS[n]\n  if (!segmentWord) return ''\n\n  // Find the last space to get the last word\n  const lastSpaceIdx = segmentWord.lastIndexOf(' ')\n  if (lastSpaceIdx === -1) {\n    // Single word\n    const lastChar = segmentWord[segmentWord.length - 1]\n    if (lastChar === 'g' && segmentWord.endsWith('ng')) {\n      return segmentWord // Already has linker\n    }\n    return addLinker(segmentWord)\n  }\n\n  // Multi-word: add linker to last word\n  const prefix = segmentWord.slice(0, lastSpaceIdx + 1)\n  const lastWord = segmentWord.slice(lastSpaceIdx + 1)\n\n  if (lastWord.endsWith('ng')) {\n    return segmentWord // Already has linker\n  }\n  return prefix + addLinker(lastWord)\n}\n\n// Precompute segments with linker for scale word usage\nconst SEGMENTS_WITH_LINKER = new Array(1000)\nfor (let i = 0; i < 1000; i++) {\n  SEGMENTS_WITH_LINKER[i] = buildSegmentWithLinker(i)\n}\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\nfunction integerToWords (n) {\n  if (n === 0n) return ZERO\n\n  if (n < 1000n) {\n    return SEGMENTS[Number(n)]\n  }\n\n  return buildLargeNumberWords(n)\n}\n\n/**\n * Builds words for large numbers using BigInt division.\n * @param {bigint} n - Number >= 1000\n * @returns {string} Filipino words\n */\nfunction buildLargeNumberWords (n) {\n  // Extract segments using BigInt division (faster than string slicing)\n  const segmentValues = []\n  let temp = n\n  while (temp > 0n) {\n    segmentValues.push(Number(temp % 1000n))\n    temp = temp / 1000n\n  }\n\n  // Build result string directly\n  let result = ''\n\n  for (let i = segmentValues.length - 1; i >= 0; i--) {\n    const segment = segmentValues[i]\n    if (segment === 0) continue\n\n    const scaleWord = SCALE_WORDS[i] || ''\n\n    if (result) result += ' '\n\n    if (i === 0) {\n      result += SEGMENTS[segment]\n    } else {\n      // Add linker to segment before scale word\n      const segmentWord = SEGMENTS_WITH_LINKER[segment]\n      result += segmentWord + ' ' + scaleWord\n    }\n  }\n\n  return result\n}\n\nfunction decimalPartToWords (decimalPart) {\n  // Per-digit decimal reading\n  const digits = []\n  for (const char of decimalPart) {\n    const d = parseInt(char, 10)\n    digits.push(d === 0 ? ZERO : ONES[d])\n  }\n  return digits.join(' ')\n}\n\n/**\n * Converts a numeric value to Filipino words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @returns {string} The number in Filipino words\n */\nfunction toWords (value) {\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Exports\n// ============================================================================\n\nexport { toWords }\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES","TEENS","TENS","ZERO","SCALE_WORDS","VOWELS","addLinker","word","includes","buildSegment","n","ones","tensDigit","Math","floor","hundredsDigit","parts","hundredPrefix","push","tensOnes","join","SEGMENTS","Array","i","buildSegmentWithLinker","segmentWord","lastSpaceIdx","lastIndexOf","endsWith","prefix","lastWord","SEGMENTS_WITH_LINKER","value","type","Number","isFinite","Error","isSafeInteger","toString","numberToString","trimmed","trim","isNaN","normalizeString","TypeError","parseNumericValue","result","NEGATIVE","segmentValues","temp","segment","buildLargeNumberWords","char","d","decimalPartToWords"],"mappings":";0CAwEA,SAASA,EAAoBC,GAC3B,MAAMC,EAAwB,MAAXD,EAAI,GACnBC,IAAYD,EAAMA,EAAIE,MAAM,IAEhC,MAAMC,EAAWH,EAAII,QAAQ,KAC7B,IAAiB,IAAbD,EACF,MAAO,CAAEF,aAAYI,YAAaC,OAAON,IAG3C,MAAMO,EAAaP,EAAIE,MAAM,EAAGC,IAAa,IACvCK,EAAcR,EAAIE,MAAMC,EAAW,GACzC,MAAO,CAAEF,aAAYI,YAAaC,OAAOC,GAAaC,cACxD,CAKA,SAASC,EAA0BT,GACjC,MAAOU,EAAUC,GAAUX,EAAIY,cAAcC,MAAM,KAC7CC,EAAMC,SAASJ,EAAQ,IAEvBR,EAAWO,EAASN,QAAQ,KAC5BY,OAASb,EACXO,EACAA,EAASR,MAAM,EAAGC,GAAYO,EAASR,MAAMC,EAAW,GAEtDc,IAD6B,IAAbd,EAAkBO,EAASQ,OAASf,GACnBW,EAEvC,OAAIG,GAAkBD,EAAOE,OACpBF,EAAS,IAAIG,OAAOF,EAAiBD,EAAOE,QAEjDD,GAAkB,EACb,KAAO,IAAIE,QAAQF,GAAkBD,EAEvCA,EAAOd,MAAM,EAAGe,GAAkB,IAAMD,EAAOd,MAAMe,EAC9D,CCzFA,MAAMG,EAAO,CAAC,GAAI,MAAO,SAAU,QAAS,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,SAC9EC,EAAQ,CAAC,QAAS,WAAY,cAAe,aAAc,YAAa,YAAa,YAAa,YAAa,aAAc,cAC7HC,EAAO,CAAC,GAAI,GAAI,YAAa,WAAY,WAAY,UAAW,WAAY,UAAW,UAAW,aAMlGC,EAAO,OAKPC,EAAc,CAAC,GAPJ,SAOkB,UAAW,UAAW,YAMnDC,EAAS,CAAC,IAAK,IAAK,IAAK,IAAK,KAEpC,SAASC,EAAWC,GAElB,OAAIF,EAAOG,SADMD,EAAKA,EAAKT,OAAS,IAE3BS,EAAO,KAETA,EAAO,KAChB,CAMA,SAASE,EAAcC,GACrB,GAAU,IAANA,EAAS,MAAO,GAEpB,MAAMC,EAAOD,EAAI,GACXE,EAAYC,KAAKC,MAAMJ,EAAI,IAAM,GACjCK,EAAgBF,KAAKC,MAAMJ,EAAI,KAE/BM,EAAQ,GAGd,GAAID,EAAgB,EAAG,CACrB,MAAME,EAAgBX,EAAUN,EAAKe,IACrCC,EAAME,KAAKD,WACb,CAGA,MAAME,EAAWT,EAAI,IAuBrB,OArBiB,IAAbS,GAIFH,EAAME,KAFGC,EAAW,GAETnB,EAAKW,GACPQ,EAAW,GAETlB,EAAMU,GACC,IAATA,EAEET,EAAKU,GAIE,IAAdA,EACSV,EAAKU,GAAa,MAAQZ,EAAKW,GAE/BT,EAAKU,GAAa,IAAMZ,EAAKW,IAIrCK,EAAMI,KAAK,IACpB,CAEA,MAAMC,EAAW,IAAIC,MAAM,KAC3B,IAAK,IAAIC,EAAI,EAAGA,EAAI,IAAMA,IACxBF,EAASE,GAAKd,EAAac,GAM7B,SAASC,EAAwBd,GAC/B,MAAMe,EAAcJ,EAASX,GAC7B,IAAKe,EAAa,MAAO,GAGzB,MAAMC,EAAeD,EAAYE,YAAY,KAC7C,IAAqB,IAAjBD,EAGF,MAAiB,MADAD,EAAYA,EAAY3B,OAAS,IAC1B2B,EAAYG,SAAS,MACpCH,EAEFnB,EAAUmB,GAInB,MAAMI,EAASJ,EAAY3C,MAAM,EAAG4C,EAAe,GAC7CI,EAAWL,EAAY3C,MAAM4C,EAAe,GAElD,OAAII,EAASF,SAAS,MACbH,EAEFI,EAASvB,EAAUwB,EAC5B,CAGA,MAAMC,EAAuB,IAAIT,MAAM,KACvC,IAAK,IAAIC,EAAI,EAAGA,EAAI,IAAMA,IACxBQ,EAAqBR,GAAKC,EAAuBD,SAsEnD,SAAkBS,GAChB,MAAMnD,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GD3L5B,SAA4B4C,GACjC,MAAMC,SAAcD,EAGpB,GAAa,WAATC,EACF,OAAOD,EAAQ,GACX,CAAEnD,YAAY,EAAMI,aAAc+C,GAClC,CAAEnD,YAAY,EAAOI,YAAa+C,GAIxC,GAAa,WAATC,EAAmB,CACrB,IAAKC,OAAOC,SAASH,GACnB,MAAM,IAAII,MAAM,8DAElB,OAAIF,OAAOG,cAAcL,GAChBA,EAAQ,EACX,CAAEnD,YAAY,EAAMI,YAAaC,QAAQ8C,IACzC,CAAEnD,YAAY,EAAOI,YAAaC,OAAO8C,IAExCrD,EAgBX,SAAyBqD,GACvB,MAAMpD,EAAMoD,EAAMM,WAClB,OAAQ1D,EAAI4B,SAAS,MAAQ5B,EAAI4B,SAAS,KACtCnB,EAAyBT,GACzBA,CACN,CArB8B2D,CAAeP,GAC3C,CAGA,GAAa,WAATC,EACF,OAAOtD,EAqBX,SAA0BqD,GACxB,MAAMQ,EAAUR,EAAMS,OACtB,GAAuB,IAAnBD,EAAQ1C,QAAgBoC,OAAOQ,MAAMR,OAAOM,IAC9C,MAAM,IAAIJ,MAAM,2BAA2BJ,MAE7C,OAAQQ,EAAQhC,SAAS,MAAQgC,EAAQhC,SAAS,KAC9CnB,EAAyBmD,GACzBA,CACN,CA7B8BG,CAAgBX,IAG5C,MAAM,IAAIY,UACR,oEAAoEX,IAExE,CC4JmDY,CAAkBb,GAEnE,IAAIc,EAAS,GAYb,OAVIjE,IACFiE,EAASC,aAGXD,GAvEU,MADapC,EAwEEzB,GAvEJkB,EAEjBO,EAAI,MACCW,EAASa,OAAOxB,IAW3B,SAAgCA,GAE9B,MAAMsC,EAAgB,GACtB,IAAIC,EAAOvC,EACX,KAAOuC,EAAO,IACZD,EAAc9B,KAAKgB,OAAOe,EAAO,QACjCA,GAAc,MAIhB,IAAIH,EAAS,GAEb,IAAK,IAAIvB,EAAIyB,EAAclD,OAAS,EAAGyB,GAAK,EAAGA,IAAK,CAClD,MAAM2B,EAAUF,EAAczB,GACd,IAAZ2B,IAIAJ,IAAQA,GAAU,KAGpBA,GADQ,IAANvB,EACQF,EAAS6B,GAGCnB,EAAqBmB,GACjB,KATR9C,EAAYmB,IAAM,IAWtC,CAEA,OAAOuB,CACT,CAtCSK,CAAsBzC,GAmEzBtB,IACF0D,GAAU,UA5Bd,SAA6B1D,GAE3B,MAAMQ,EAAS,GACf,IAAK,MAAMwD,KAAQhE,EAAa,CAC9B,MAAMiE,EAAI1D,SAASyD,EAAM,IACzBxD,EAAOsB,KAAW,IAANmC,EAAUlD,EAAOH,EAAKqD,GACpC,CACA,OAAOzD,EAAOwB,KAAK,IACrB,CAoBwCkC,CAAmBlE,IAGlD0D,EA9ET,IAAyBpC,CA+EzB"}

package/dist/languages/fr-BE.js

@@ -1,3 +0,0 @@
-/*! n2words/fr-BE v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var e,t;e=this,t=function(e){"use strict";function t(e){const t="-"===e[0];t&&(e=e.slice(1));const n=e.indexOf(".");if(-1===n)return{isNegative:t,integerPart:BigInt(e)};const i=e.slice(0,n)||"0",r=e.slice(n+1);return{isNegative:t,integerPart:BigInt(i),decimalPart:r}}function n(e){const[t,n]=e.toLowerCase().split("e"),i=parseInt(n,10),r=t.indexOf("."),s=-1===r?t:t.slice(0,r)+t.slice(r+1),o=(-1===r?t.length:r)+i;return o>=s.length?s+"0".repeat(o-s.length):o<=0?"0."+"0".repeat(-o)+s:s.slice(0,o)+"."+s.slice(o)}const i=["","un","deux","trois","quatre","cinq","six","sept","huit","neuf"],r=["dix","onze","douze","treize","quatorze","quinze","seize","dix-sept","dix-huit","dix-neuf"],s=["","","vingt","trente","quarante","cinquante","soixante","septante","quatre-vingt","nonante"],o=["million","billion","trillion","quadrillion"],u=["milliard","billiard","trilliard","quadrilliard"],l="mille",c="cent",f="zéro";function a(e){if(0===e)return{word:"",endsWithCents:!1,endsWithVingts:!1};const t=e%100,n=Math.floor(e/100),o=[];let u=!1,l=!1;if(n>0&&(1===n?o.push(c):0===t?(o.push(i[n]+" "+c+"s"),u=!0):o.push(i[n]+" "+c)),0===t);else if(t<10)o.push(i[t]);else if(t<17)o.push(r[t-10]);else if(t<20)o.push(r[t-10]);else if(t<70){const e=Math.floor(t/10),n=t%10;o.push(0===n?s[e]:1===n?s[e]+" et "+i[1]:s[e]+"-"+i[n])}else if(t<80){const e=t%10;o.push(0===e?"septante":1===e?"septante et "+i[1]:"septante-"+i[e])}else if(80===t)o.push("quatre-vingts"),l=!0;else if(t<90)o.push("quatre-vingt-"+i[t-80]);else{const e=t%10;o.push(0===e?"nonante":1===e?"nonante et "+i[1]:"nonante-"+i[e])}return{word:o.join(" "),endsWithCents:u,endsWithVingts:l}}const p=new Array(1e3),d=new Array(1e3),g=new Array(1e3);for(let e=0;e<1e3;e++){const t=a(e);p[e]=t.word,d[e]=t.endsWithCents,g[e]=t.endsWithVingts}function h(e,t){if(1===e)return l;if(e%2==0){const n=o[e/2-1];return n?t>1n?n+"s":n:""}{const n=u[(e-1)/2-1];return n?t>1n?n+"s":n:l}}function b(e,t=!1){if(0n===e)return f;if(e<1000n){const n=p[Number(e)];return t?n.replace(/ /g,"-"):n}if(e<1000000n){const n=Number(e/1000n),i=Number(e%1000n);let r;if(1===n)r=l;else{let e=p[n];(d[n]||g[n])&&(e=e.slice(0,-1)),r=e+(t?"-":" ")+l}return i>0&&(r+=(t?"-":" ")+p[i]),t&&(r=r.replace(/ /g,"-")),r}return function(e,t){const n=e.toString(),i=n.length,r=[],s=i%3;let o=0;for(s>0&&(r.push(Number(n.slice(0,s))),o=s);o<i;)r.push(Number(n.slice(o,o+3))),o+=3;const u=[];let c=r.length-1;for(let e=0;e<r.length;e++){const t=r[e];if(0!==t){const e=c>0?h(c,BigInt(t)):"";if(0===c)u.push(p[t]);else if(1===c)if(1===t)u.push(l);else{let n=p[t];(d[t]||g[t])&&(n=n.slice(0,-1)),u.push(n),u.push(e)}else u.push(p[t]),u.push(e)}c--}let f=u.join(t?"-":" ");return t&&(f=f.replace(/ /g,"-")),f}(e,t)}e.frBE=function(e,i){i=function(e){if(void 0===e)return{};if(function(e){if(null===e||"object"!=typeof e)return!1;const t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}(e))return e;throw new TypeError("Invalid options: expected plain object or undefined, got "+typeof e)}(i);const{isNegative:r,integerPart:s,decimalPart:o}=function(e){const i=typeof e;if("bigint"===i)return e<0n?{isNegative:!0,integerPart:-e}:{isNegative:!1,integerPart:e};if("number"===i){if(!Number.isFinite(e))throw new Error("Number must be finite (NaN and Infinity are not supported)");return Number.isSafeInteger(e)?e<0?{isNegative:!0,integerPart:BigInt(-e)}:{isNegative:!1,integerPart:BigInt(e)}:t(function(e){const t=e.toString();return t.includes("e")||t.includes("E")?n(t):t}(e))}if("string"===i)return t(function(e){const t=e.trim();if(0===t.length||Number.isNaN(Number(t)))throw new Error(`Invalid number format: "${e}"`);return t.includes("e")||t.includes("E")?n(t):t}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${i}`)}(e),u=i.withHyphenSeparator||!1;let l="";const c=u?"-":" ";return r&&(l="moins"+c),l+=b(s,u),o&&(l+=c+"virgule"+c+function(e,t){let n="";const i=t?"-":" ";let r=0;for(;r<e.length&&"0"===e[r];)n&&(n+=i),n+=f,r++;const s=e.slice(r);return s&&(n&&(n+=i),n+=b(BigInt(s),t)),n}(o,u)),l}},"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).n2words=e.n2words||{});
-//# sourceMappingURL=fr-BE.js.map

package/dist/languages/fr-BE.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fr-BE.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/fr-BE.js","../../lib/utils/validate-options.js","../../lib/utils/is-plain-object.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * French (Belgium) language converter - Functional Implementation\n *\n * Self-contained converter with precomputed lookup tables.\n *\n * Belgian French differences from standard French:\n * - septante (70) instead of soixante-dix\n * - nonante (90) instead of quatre-vingt-dix\n * - Keeps quatre-vingts (80) like standard French\n * - Uses \"septante et un\" (71), \"nonante et un\" (91)\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\nimport { validateOptions } from '../utils/validate-options.js'\n\n// ============================================================================\n// Vocabulary\n// ============================================================================\n\nconst ONES = ['', 'un', 'deux', 'trois', 'quatre', 'cinq', 'six', 'sept', 'huit', 'neuf']\nconst TEENS = ['dix', 'onze', 'douze', 'treize', 'quatorze', 'quinze', 'seize', 'dix-sept', 'dix-huit', 'dix-neuf']\nconst TENS = ['', '', 'vingt', 'trente', 'quarante', 'cinquante', 'soixante', 'septante', 'quatre-vingt', 'nonante']\n\n// Scale words (long scale with -ard forms)\nconst SCALES = ['million', 'billion', 'trillion', 'quadrillion']\nconst SCALES_ARD = ['milliard', 'billiard', 'trilliard', 'quadrilliard']\n\nconst THOUSAND = 'mille'\nconst HUNDRED = 'cent'\nconst ZERO = 'zéro'\nconst NEGATIVE = 'moins'\nconst DECIMAL_SEP = 'virgule'\n\n// ============================================================================\n// Precomputed Lookup Tables\n// ============================================================================\n\nfunction buildSegment (n) {\n  if (n === 0) return { word: '', endsWithCents: false, endsWithVingts: false }\n\n  const tensOnes = n % 100\n  const hundreds = Math.floor(n / 100)\n\n  const parts = []\n  let endsWithCents = false\n  let endsWithVingts = false\n\n  // Hundreds\n  if (hundreds > 0) {\n    if (hundreds === 1) {\n      parts.push(HUNDRED)\n    } else {\n      if (tensOnes === 0) {\n        parts.push(ONES[hundreds] + ' ' + HUNDRED + 's')\n        endsWithCents = true\n      } else {\n        parts.push(ONES[hundreds] + ' ' + HUNDRED)\n      }\n    }\n  }\n\n  // Tens and ones - Belgian pattern\n  if (tensOnes === 0) {\n    // Just hundreds\n  } else if (tensOnes < 10) {\n    parts.push(ONES[tensOnes])\n  } else if (tensOnes < 17) {\n    parts.push(TEENS[tensOnes - 10])\n  } else if (tensOnes < 20) {\n    parts.push(TEENS[tensOnes - 10])\n  } else if (tensOnes < 70) {\n    // 20-69: standard pattern\n    const t = Math.floor(tensOnes / 10)\n    const o = tensOnes % 10\n    if (o === 0) {\n      parts.push(TENS[t])\n    } else if (o === 1) {\n      parts.push(TENS[t] + ' et ' + ONES[1])\n    } else {\n      parts.push(TENS[t] + '-' + ONES[o])\n    }\n  } else if (tensOnes < 80) {\n    // 70-79: septante pattern (Belgian)\n    const o = tensOnes % 10\n    if (o === 0) {\n      parts.push('septante')\n    } else if (o === 1) {\n      parts.push('septante et ' + ONES[1])\n    } else {\n      parts.push('septante-' + ONES[o])\n    }\n  } else if (tensOnes === 80) {\n    // 80: quatre-vingts (same as standard)\n    parts.push('quatre-vingts')\n    endsWithVingts = true\n  } else if (tensOnes < 90) {\n    // 81-89: quatre-vingt-X (same as standard)\n    const remainder = tensOnes - 80\n    parts.push('quatre-vingt-' + ONES[remainder])\n  } else {\n    // 90-99: nonante pattern (Belgian)\n    const o = tensOnes % 10\n    if (o === 0) {\n      parts.push('nonante')\n    } else if (o === 1) {\n      parts.push('nonante et ' + ONES[1])\n    } else {\n      parts.push('nonante-' + ONES[o])\n    }\n  }\n\n  return { word: parts.join(' '), endsWithCents, endsWithVingts }\n}\n\n// Precompute all 1000 segment words\nconst SEGMENTS = new Array(1000)\nconst SEGMENTS_ENDS_CENTS = new Array(1000)\nconst SEGMENTS_ENDS_VINGTS = new Array(1000)\n\nfor (let i = 0; i < 1000; i++) {\n  const result = buildSegment(i)\n  SEGMENTS[i] = result.word\n  SEGMENTS_ENDS_CENTS[i] = result.endsWithCents\n  SEGMENTS_ENDS_VINGTS[i] = result.endsWithVingts\n}\n\n// ============================================================================\n// Helper Functions\n// ============================================================================\n\nfunction getScaleWord (scaleIndex, segment) {\n  if (scaleIndex === 1) return THOUSAND\n\n  if (scaleIndex % 2 === 0) {\n    const arrayIndex = (scaleIndex / 2) - 1\n    const baseWord = SCALES[arrayIndex]\n    if (!baseWord) return ''\n    return segment > 1n ? baseWord + 's' : baseWord\n  } else {\n    const arrayIndex = ((scaleIndex - 1) / 2) - 1\n    const ardWord = SCALES_ARD[arrayIndex]\n    if (!ardWord) return THOUSAND\n    return segment > 1n ? ardWord + 's' : ardWord\n  }\n}\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\nfunction integerToWords (n, withHyphen = false) {\n  if (n === 0n) return ZERO\n\n  if (n < 1000n) {\n    const word = SEGMENTS[Number(n)]\n    return withHyphen ? word.replace(/ /g, '-') : word\n  }\n\n  if (n < 1_000_000n) {\n    const thousands = Number(n / 1000n)\n    const remainder = Number(n % 1000n)\n\n    let result\n    if (thousands === 1) {\n      result = THOUSAND\n    } else {\n      let thousandsWord = SEGMENTS[thousands]\n      if (SEGMENTS_ENDS_CENTS[thousands] || SEGMENTS_ENDS_VINGTS[thousands]) {\n        thousandsWord = thousandsWord.slice(0, -1)\n      }\n      result = thousandsWord + (withHyphen ? '-' : ' ') + THOUSAND\n    }\n\n    if (remainder > 0) {\n      result += (withHyphen ? '-' : ' ') + SEGMENTS[remainder]\n    }\n\n    if (withHyphen) {\n      result = result.replace(/ /g, '-')\n    }\n\n    return result\n  }\n\n  return buildLargeNumberWords(n, withHyphen)\n}\n\nfunction buildLargeNumberWords (n, withHyphen) {\n  const numStr = n.toString()\n  const len = numStr.length\n\n  const segments = []\n  const segmentSize = 3\n\n  const remainderLen = len % segmentSize\n  let pos = 0\n  if (remainderLen > 0) {\n    segments.push(Number(numStr.slice(0, remainderLen)))\n    pos = remainderLen\n  }\n  while (pos < len) {\n    segments.push(Number(numStr.slice(pos, pos + segmentSize)))\n    pos += segmentSize\n  }\n\n  const parts = []\n  let scaleIndex = segments.length - 1\n\n  for (let i = 0; i < segments.length; i++) {\n    const segment = segments[i]\n\n    if (segment !== 0) {\n      const scaleWord = scaleIndex > 0 ? getScaleWord(scaleIndex, BigInt(segment)) : ''\n\n      if (scaleIndex === 0) {\n        parts.push(SEGMENTS[segment])\n      } else if (scaleIndex === 1) {\n        if (segment === 1) {\n          parts.push(THOUSAND)\n        } else {\n          let segWords = SEGMENTS[segment]\n          if (SEGMENTS_ENDS_CENTS[segment] || SEGMENTS_ENDS_VINGTS[segment]) {\n            segWords = segWords.slice(0, -1)\n          }\n          parts.push(segWords)\n          parts.push(scaleWord)\n        }\n      } else {\n        parts.push(SEGMENTS[segment])\n        parts.push(scaleWord)\n      }\n    }\n\n    scaleIndex--\n  }\n\n  const sep = withHyphen ? '-' : ' '\n  let result = parts.join(sep)\n\n  if (withHyphen) {\n    result = result.replace(/ /g, '-')\n  }\n\n  return result\n}\n\nfunction decimalPartToWords (decimalPart, withHyphen) {\n  let result = ''\n  const sep = withHyphen ? '-' : ' '\n\n  let i = 0\n  while (i < decimalPart.length && decimalPart[i] === '0') {\n    if (result) result += sep\n    result += ZERO\n    i++\n  }\n\n  const remainder = decimalPart.slice(i)\n  if (remainder) {\n    if (result) result += sep\n    result += integerToWords(BigInt(remainder), withHyphen)\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to Belgian French words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @param {Object} [options] - Optional configuration\n * @param {boolean} [options.withHyphenSeparator=false] - Use hyphens between words\n * @returns {string} The number in Belgian French words\n */\nfunction toWords (value, options) {\n  options = validateOptions(options)\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n  const withHyphen = options.withHyphenSeparator || false\n\n  let result = ''\n  const sep = withHyphen ? '-' : ' '\n\n  if (isNegative) {\n    result = NEGATIVE + sep\n  }\n\n  result += integerToWords(integerPart, withHyphen)\n\n  if (decimalPart) {\n    result += sep + DECIMAL_SEP + sep + decimalPartToWords(decimalPart, withHyphen)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Exports\n// ============================================================================\n\nexport { toWords }\n","import { isPlainObject } from './is-plain-object.js'\n\n/**\n * Validates and normalizes the options parameter.\n *\n * @param {*} options The options value to validate\n * @returns {Object} A valid options object (empty object if undefined)\n * @throws {TypeError} If options is not undefined or a plain object\n */\nexport function validateOptions (options) {\n  if (options === undefined) return {}\n  if (isPlainObject(options)) return options\n  throw new TypeError(\n    `Invalid options: expected plain object or undefined, got ${typeof options}`\n  )\n}\n","/**\n * Checks if a value is a plain object (not null, array, or other object types).\n *\n * A plain object is one created by:\n * - Object literal: `{}`\n * - Object.create(null): null-prototype object\n *\n * This excludes arrays, class instances, Map, Set, and other object types.\n *\n * @param {*} value Value to check\n * @returns {boolean} True if value is a plain object\n */\nexport function isPlainObject (value) {\n  if (value === null || typeof value !== 'object') return false\n  const proto = Object.getPrototypeOf(value)\n  return proto === null || proto === Object.prototype\n}\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES","TEENS","TENS","SCALES","SCALES_ARD","THOUSAND","HUNDRED","ZERO","buildSegment","n","word","endsWithCents","endsWithVingts","tensOnes","hundreds","Math","floor","parts","push","t","o","join","SEGMENTS","Array","SEGMENTS_ENDS_CENTS","SEGMENTS_ENDS_VINGTS","i","result","getScaleWord","scaleIndex","segment","baseWord","ardWord","integerToWords","withHyphen","Number","replace","thousands","remainder","thousandsWord","numStr","toString","len","segments","remainderLen","pos","scaleWord","segWords","buildLargeNumberWords","value","options","undefined","proto","Object","getPrototypeOf","prototype","isPlainObject","TypeError","validateOptions","type","isFinite","Error","isSafeInteger","includes","numberToString","trimmed","trim","isNaN","normalizeString","parseNumericValue","withHyphenSeparator","sep","decimalPartToWords"],"mappings":";0CAwEA,SAASA,EAAoBC,GAC3B,MAAMC,EAAwB,MAAXD,EAAI,GACnBC,IAAYD,EAAMA,EAAIE,MAAM,IAEhC,MAAMC,EAAWH,EAAII,QAAQ,KAC7B,IAAiB,IAAbD,EACF,MAAO,CAAEF,aAAYI,YAAaC,OAAON,IAG3C,MAAMO,EAAaP,EAAIE,MAAM,EAAGC,IAAa,IACvCK,EAAcR,EAAIE,MAAMC,EAAW,GACzC,MAAO,CAAEF,aAAYI,YAAaC,OAAOC,GAAaC,cACxD,CAKA,SAASC,EAA0BT,GACjC,MAAOU,EAAUC,GAAUX,EAAIY,cAAcC,MAAM,KAC7CC,EAAMC,SAASJ,EAAQ,IAEvBR,EAAWO,EAASN,QAAQ,KAC5BY,OAASb,EACXO,EACAA,EAASR,MAAM,EAAGC,GAAYO,EAASR,MAAMC,EAAW,GAEtDc,IAD6B,IAAbd,EAAkBO,EAASQ,OAASf,GACnBW,EAEvC,OAAIG,GAAkBD,EAAOE,OACpBF,EAAS,IAAIG,OAAOF,EAAiBD,EAAOE,QAEjDD,GAAkB,EACb,KAAO,IAAIE,QAAQF,GAAkBD,EAEvCA,EAAOd,MAAM,EAAGe,GAAkB,IAAMD,EAAOd,MAAMe,EAC9D,CCxFA,MAAMG,EAAO,CAAC,GAAI,KAAM,OAAQ,QAAS,SAAU,OAAQ,MAAO,OAAQ,OAAQ,QAC5EC,EAAQ,CAAC,MAAO,OAAQ,QAAS,SAAU,WAAY,SAAU,QAAS,WAAY,WAAY,YAClGC,EAAO,CAAC,GAAI,GAAI,QAAS,SAAU,WAAY,YAAa,WAAY,WAAY,eAAgB,WAGpGC,EAAS,CAAC,UAAW,UAAW,WAAY,eAC5CC,EAAa,CAAC,WAAY,WAAY,YAAa,gBAEnDC,EAAW,QACXC,EAAU,OACVC,EAAO,OAQb,SAASC,EAAcC,GACrB,GAAU,IAANA,EAAS,MAAO,CAAEC,KAAM,GAAIC,eAAe,EAAOC,gBAAgB,GAEtE,MAAMC,EAAWJ,EAAI,IACfK,EAAWC,KAAKC,MAAMP,EAAI,KAE1BQ,EAAQ,GACd,IAAIN,GAAgB,EAChBC,GAAiB,EAiBrB,GAdIE,EAAW,IACI,IAAbA,EACFG,EAAMC,KAAKZ,GAEM,IAAbO,GACFI,EAAMC,KAAKlB,EAAKc,GAAY,IAAMR,EAAU,KAC5CK,GAAgB,GAEhBM,EAAMC,KAAKlB,EAAKc,GAAY,IAAMR,IAMvB,IAAbO,QAEG,GAAIA,EAAW,GACpBI,EAAMC,KAAKlB,EAAKa,SACX,GAAIA,EAAW,GACpBI,EAAMC,KAAKjB,EAAMY,EAAW,UACvB,GAAIA,EAAW,GACpBI,EAAMC,KAAKjB,EAAMY,EAAW,UACvB,GAAIA,EAAW,GAAI,CAExB,MAAMM,EAAIJ,KAAKC,MAAMH,EAAW,IAC1BO,EAAIP,EAAW,GAEnBI,EAAMC,KADE,IAANE,EACSlB,EAAKiB,GACD,IAANC,EACElB,EAAKiB,GAAK,OAASnB,EAAK,GAExBE,EAAKiB,GAAK,IAAMnB,EAAKoB,GAEpC,MAAO,GAAIP,EAAW,GAAI,CAExB,MAAMO,EAAIP,EAAW,GAEnBI,EAAMC,KADE,IAANE,EACS,WACI,IAANA,EACE,eAAiBpB,EAAK,GAEtB,YAAcA,EAAKoB,GAElC,MAAO,GAAiB,KAAbP,EAETI,EAAMC,KAAK,iBACXN,GAAiB,OACZ,GAAIC,EAAW,GAGpBI,EAAMC,KAAK,gBAAkBlB,EADXa,EAAW,SAExB,CAEL,MAAMO,EAAIP,EAAW,GAEnBI,EAAMC,KADE,IAANE,EACS,UACI,IAANA,EACE,cAAgBpB,EAAK,GAErB,WAAaA,EAAKoB,GAEjC,CAEA,MAAO,CAAEV,KAAMO,EAAMI,KAAK,KAAMV,gBAAeC,iBACjD,CAGA,MAAMU,EAAW,IAAIC,MAAM,KACrBC,EAAsB,IAAID,MAAM,KAChCE,EAAuB,IAAIF,MAAM,KAEvC,IAAK,IAAIG,EAAI,EAAGA,EAAI,IAAMA,IAAK,CAC7B,MAAMC,EAASnB,EAAakB,GAC5BJ,EAASI,GAAKC,EAAOjB,KACrBc,EAAoBE,GAAKC,EAAOhB,cAChCc,EAAqBC,GAAKC,EAAOf,cACnC,CAMA,SAASgB,EAAcC,EAAYC,GACjC,GAAmB,IAAfD,EAAkB,OAAOxB,EAE7B,GAAIwB,EAAa,GAAM,EAAG,CACxB,MACME,EAAW5B,EADG0B,EAAa,EAAK,GAEtC,OAAKE,EACED,EAAU,GAAKC,EAAW,IAAMA,EADjB,EAExB,CAAO,CACL,MACMC,EAAU5B,GADKyB,EAAa,GAAK,EAAK,GAE5C,OAAKG,EACEF,EAAU,GAAKE,EAAU,IAAMA,EADjB3B,CAEvB,CACF,CAMA,SAAS4B,EAAgBxB,EAAGyB,GAAa,GACvC,GAAU,KAANzB,EAAU,OAAOF,EAErB,GAAIE,EAAI,MAAO,CACb,MAAMC,EAAOY,EAASa,OAAO1B,IAC7B,OAAOyB,EAAaxB,EAAK0B,QAAQ,KAAM,KAAO1B,CAChD,CAEA,GAAID,EAAI,SAAY,CAClB,MAAM4B,EAAYF,OAAO1B,EAAI,OACvB6B,EAAYH,OAAO1B,EAAI,OAE7B,IAAIkB,EACJ,GAAkB,IAAdU,EACFV,EAAStB,MACJ,CACL,IAAIkC,EAAgBjB,EAASe,IACzBb,EAAoBa,IAAcZ,EAAqBY,MACzDE,EAAgBA,EAAczD,MAAM,GAAG,IAEzC6C,EAASY,GAAiBL,EAAa,IAAM,KAAO7B,CACtD,CAUA,OARIiC,EAAY,IACdX,IAAWO,EAAa,IAAM,KAAOZ,EAASgB,IAG5CJ,IACFP,EAASA,EAAOS,QAAQ,KAAM,MAGzBT,CACT,CAEA,OAGF,SAAgClB,EAAGyB,GACjC,MAAMM,EAAS/B,EAAEgC,WACXC,EAAMF,EAAO1C,OAEb6C,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAASzB,KAAKiB,OAAOK,EAAO1D,MAAM,EAAG8D,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAASzB,KAAKiB,OAAOK,EAAO1D,MAAM+D,EAAKA,EATrB,KAUlBA,GAVkB,EAapB,MAAM5B,EAAQ,GACd,IAAIY,EAAac,EAAS7C,OAAS,EAEnC,IAAK,IAAI4B,EAAI,EAAGA,EAAIiB,EAAS7C,OAAQ4B,IAAK,CACxC,MAAMI,EAAUa,EAASjB,GAEzB,GAAgB,IAAZI,EAAe,CACjB,MAAMgB,EAAYjB,EAAa,EAAID,EAAaC,EAAY3C,OAAO4C,IAAY,GAE/E,GAAmB,IAAfD,EACFZ,EAAMC,KAAKI,EAASQ,SACf,GAAmB,IAAfD,EACT,GAAgB,IAAZC,EACFb,EAAMC,KAAKb,OACN,CACL,IAAI0C,EAAWzB,EAASQ,IACpBN,EAAoBM,IAAYL,EAAqBK,MACvDiB,EAAWA,EAASjE,MAAM,GAAG,IAE/BmC,EAAMC,KAAK6B,GACX9B,EAAMC,KAAK4B,EACb,MAEA7B,EAAMC,KAAKI,EAASQ,IACpBb,EAAMC,KAAK4B,EAEf,CAEAjB,GACF,CAGA,IAAIF,EAASV,EAAMI,KADPa,EAAa,IAAM,KAO/B,OAJIA,IACFP,EAASA,EAAOS,QAAQ,KAAM,MAGzBT,CACT,CA5DSqB,CAAsBvC,EAAGyB,EAClC,QAyFA,SAAkBe,EAAOC,GACvBA,EC1QK,SAA0BA,GAC/B,QAAgBC,IAAZD,EAAuB,MAAO,CAAA,EAClC,GCCK,SAAwBD,GAC7B,GAAc,OAAVA,GAAmC,iBAAVA,EAAoB,OAAO,EACxD,MAAMG,EAAQC,OAAOC,eAAeL,GACpC,OAAiB,OAAVG,GAAkBA,IAAUC,OAAOE,SAC5C,CDLMC,CAAcN,GAAU,OAAOA,EACnC,MAAM,IAAIO,UACR,mEAAmEP,EAEvE,CDoQYQ,CAAgBR,GAC1B,MAAMrE,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GDvQ5B,SAA4B6D,GACjC,MAAMU,SAAcV,EAGpB,GAAa,WAATU,EACF,OAAOV,EAAQ,GACX,CAAEpE,YAAY,EAAMI,aAAcgE,GAClC,CAAEpE,YAAY,EAAOI,YAAagE,GAIxC,GAAa,WAATU,EAAmB,CACrB,IAAKxB,OAAOyB,SAASX,GACnB,MAAM,IAAIY,MAAM,8DAElB,OAAI1B,OAAO2B,cAAcb,GAChBA,EAAQ,EACX,CAAEpE,YAAY,EAAMI,YAAaC,QAAQ+D,IACzC,CAAEpE,YAAY,EAAOI,YAAaC,OAAO+D,IAExCtE,EAgBX,SAAyBsE,GACvB,MAAMrE,EAAMqE,EAAMR,WAClB,OAAQ7D,EAAImF,SAAS,MAAQnF,EAAImF,SAAS,KACtC1E,EAAyBT,GACzBA,CACN,CArB8BoF,CAAef,GAC3C,CAGA,GAAa,WAATU,EACF,OAAOhF,EAqBX,SAA0BsE,GACxB,MAAMgB,EAAUhB,EAAMiB,OACtB,GAAuB,IAAnBD,EAAQnE,QAAgBqC,OAAOgC,MAAMhC,OAAO8B,IAC9C,MAAM,IAAIJ,MAAM,2BAA2BZ,MAE7C,OAAQgB,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9C1E,EAAyB4E,GACzBA,CACN,CA7B8BG,CAAgBnB,IAG5C,MAAM,IAAIQ,UACR,oEAAoEE,IAExE,CCwOmDU,CAAkBpB,GAC7Df,EAAagB,EAAQoB,sBAAuB,EAElD,IAAI3C,EAAS,GACb,MAAM4C,EAAMrC,EAAa,IAAM,IAY/B,OAVIrD,IACF8C,EA7Pa,QA6PO4C,GAGtB5C,GAAUM,EAAehD,EAAaiD,GAElC9C,IACFuC,GAAU4C,EAlQM,UAkQcA,EA3ClC,SAA6BnF,EAAa8C,GACxC,IAAIP,EAAS,GACb,MAAM4C,EAAMrC,EAAa,IAAM,IAE/B,IAAIR,EAAI,EACR,KAAOA,EAAItC,EAAYU,QAA6B,MAAnBV,EAAYsC,IACvCC,IAAQA,GAAU4C,GACtB5C,GAAUpB,EACVmB,IAGF,MAAMY,EAAYlD,EAAYN,MAAM4C,GAMpC,OALIY,IACEX,IAAQA,GAAU4C,GACtB5C,GAAUM,EAAe/C,OAAOoD,GAAYJ,IAGvCP,CACT,CAyBwC6C,CAAmBpF,EAAa8C,IAG/DP,CACT"}

package/dist/languages/fr.js

@@ -1,3 +0,0 @@
-/*! n2words/fr v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var e,t;e=this,t=function(e){"use strict";function t(e){const t="-"===e[0];t&&(e=e.slice(1));const n=e.indexOf(".");if(-1===n)return{isNegative:t,integerPart:BigInt(e)};const i=e.slice(0,n)||"0",r=e.slice(n+1);return{isNegative:t,integerPart:BigInt(i),decimalPart:r}}function n(e){const[t,n]=e.toLowerCase().split("e"),i=parseInt(n,10),r=t.indexOf("."),s=-1===r?t:t.slice(0,r)+t.slice(r+1),o=(-1===r?t.length:r)+i;return o>=s.length?s+"0".repeat(o-s.length):o<=0?"0."+"0".repeat(-o)+s:s.slice(0,o)+"."+s.slice(o)}const i=["","un","deux","trois","quatre","cinq","six","sept","huit","neuf"],r=["dix","onze","douze","treize","quatorze","quinze","seize","dix-sept","dix-huit","dix-neuf"],s=["","","vingt","trente","quarante","cinquante","soixante"],o=["million","billion","trillion","quadrillion"],u=["milliard","billiard","trilliard","quadrilliard"],l="mille",c="cent",f="zéro";function a(e){if(0===e)return{word:"",endsWithCents:!1,endsWithVingts:!1};const t=e%100,n=Math.floor(e/100),o=[];let u=!1,l=!1;if(n>0&&(1===n?o.push(c):0===t?(o.push(i[n]+" "+c+"s"),u=!0):o.push(i[n]+" "+c)),0===t);else if(t<10)o.push(i[t]);else if(t<17)o.push(r[t-10]);else if(t<20)o.push(r[t-10]);else if(t<70){const e=Math.floor(t/10),n=t%10;o.push(0===n?s[e]:1===n?s[e]+" et "+i[1]:s[e]+"-"+i[n])}else if(t<80){const e=t-60;o.push(11===e?"soixante et onze":"soixante-"+r[e-10])}else if(80===t)o.push("quatre-vingts"),l=!0;else if(t<100){const e=t-80;o.push(e<10?"quatre-vingt-"+i[e]:"quatre-vingt-"+r[e-10])}return{word:o.join(" "),endsWithCents:u,endsWithVingts:l}}const d=new Array(1e3),p=new Array(1e3),g=new Array(1e3);for(let e=0;e<1e3;e++){const t=a(e);d[e]=t.word,p[e]=t.endsWithCents,g[e]=t.endsWithVingts}function h(e,t){if(1===e)return l;if(e%2==0){const n=o[e/2-1];return n?t>1n?n+"s":n:""}{const n=u[(e-1)/2-1];return n?t>1n?n+"s":n:l}}function b(e,t=!1){if(0n===e)return f;if(e<1000n){const n=d[Number(e)];return t?n.replace(/ /g,"-"):n}if(e<1000000n){const n=Number(e/1000n),i=Number(e%1000n);let r;if(1===n)r=l;else{let e=d[n];(p[n]||g[n])&&(e=e.slice(0,-1)),r=e+(t?"-":" ")+l}return i>0&&(r+=(t?"-":" ")+d[i]),t&&(r=r.replace(/ /g,"-")),r}return function(e,t){const n=e.toString(),i=n.length,r=[],s=i%3;let o=0;for(s>0&&(r.push(Number(n.slice(0,s))),o=s);o<i;)r.push(Number(n.slice(o,o+3))),o+=3;const u=[];let c=r.length-1;for(let e=0;e<r.length;e++){const t=r[e];if(0!==t){const e=c>0?h(c,BigInt(t)):"";if(0===c)u.push(d[t]);else if(1===c)if(1===t)u.push(l);else{let n=d[t];(p[t]||g[t])&&(n=n.slice(0,-1)),u.push(n),u.push(e)}else u.push(d[t]),u.push(e)}c--}let f=u.join(t?"-":" ");return t&&(f=f.replace(/ /g,"-")),f}(e,t)}e.fr=function(e,i){i=function(e){if(void 0===e)return{};if(function(e){if(null===e||"object"!=typeof e)return!1;const t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}(e))return e;throw new TypeError("Invalid options: expected plain object or undefined, got "+typeof e)}(i);const{isNegative:r,integerPart:s,decimalPart:o}=function(e){const i=typeof e;if("bigint"===i)return e<0n?{isNegative:!0,integerPart:-e}:{isNegative:!1,integerPart:e};if("number"===i){if(!Number.isFinite(e))throw new Error("Number must be finite (NaN and Infinity are not supported)");return Number.isSafeInteger(e)?e<0?{isNegative:!0,integerPart:BigInt(-e)}:{isNegative:!1,integerPart:BigInt(e)}:t(function(e){const t=e.toString();return t.includes("e")||t.includes("E")?n(t):t}(e))}if("string"===i)return t(function(e){const t=e.trim();if(0===t.length||Number.isNaN(Number(t)))throw new Error(`Invalid number format: "${e}"`);return t.includes("e")||t.includes("E")?n(t):t}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${i}`)}(e),u=i.withHyphenSeparator||!1;let l="";const c=u?"-":" ";return r&&(l="moins"+c),l+=b(s,u),o&&(l+=c+"virgule"+c+function(e,t){let n="";const i=t?"-":" ";let r=0;for(;r<e.length&&"0"===e[r];)n&&(n+=i),n+=f,r++;const s=e.slice(r);return s&&(n&&(n+=i),n+=b(BigInt(s),t)),n}(o,u)),l}},"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).n2words=e.n2words||{});
-//# sourceMappingURL=fr.js.map

package/dist/languages/fr.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fr.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/fr.js","../../lib/utils/validate-options.js","../../lib/utils/is-plain-object.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * French language converter - Functional Implementation\n *\n * A performance-optimized number-to-words converter using precomputed lookup tables.\n * Self-contained module with its own input validation, ready for subpath exports.\n *\n * Key optimization: Precompute all segment values (0-999) at module load.\n * This eliminates all per-call string manipulation for segment conversion.\n *\n * French-specific rules (handled in precomputation):\n * - Vigesimal patterns: 70 = soixante-dix, 80 = quatre-vingts, 90 = quatre-vingt-dix\n * - \"et\" conjunction: vingt et un (21), soixante et onze (71), but NOT quatre-vingt-un\n * - Pluralization: \"cents\" loses 's' when followed by more digits\n * - Long scale with -ard forms: milliard, billiard, trilliard\n * - Omit \"un\" before mille\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\nimport { validateOptions } from '../utils/validate-options.js'\n\n// ============================================================================\n// Vocabulary (module-level constants)\n// ============================================================================\n\nconst ONES = ['', 'un', 'deux', 'trois', 'quatre', 'cinq', 'six', 'sept', 'huit', 'neuf']\nconst TEENS = ['dix', 'onze', 'douze', 'treize', 'quatorze', 'quinze', 'seize', 'dix-sept', 'dix-huit', 'dix-neuf']\nconst TENS = ['', '', 'vingt', 'trente', 'quarante', 'cinquante', 'soixante']\n\n// Scale words (even indices: million, billion, trillion, quadrillion)\nconst SCALES = ['million', 'billion', 'trillion', 'quadrillion']\nconst SCALES_ARD = ['milliard', 'billiard', 'trilliard', 'quadrilliard']\n\nconst THOUSAND = 'mille'\nconst HUNDRED = 'cent'\nconst ZERO = 'zéro'\nconst NEGATIVE = 'moins'\nconst DECIMAL_SEP = 'virgule'\n\n// ============================================================================\n// Precomputed Lookup Tables (built once at module load)\n// ============================================================================\n\n/**\n * Builds segment word for 0-999.\n * Returns object with { word, endsWithCents, endsWithVingts } for pluralization handling.\n */\nfunction buildSegment (n) {\n  if (n === 0) return { word: '', endsWithCents: false, endsWithVingts: false }\n\n  const tensOnes = n % 100\n  const hundreds = Math.floor(n / 100)\n\n  const parts = []\n  let endsWithCents = false\n  let endsWithVingts = false\n\n  // Hundreds\n  if (hundreds > 0) {\n    if (hundreds === 1) {\n      if (tensOnes === 0) {\n        parts.push(HUNDRED)\n      } else {\n        parts.push(HUNDRED)\n      }\n    } else {\n      if (tensOnes === 0) {\n        // \"deux cents\", \"trois cents\" (with 's')\n        parts.push(ONES[hundreds] + ' ' + HUNDRED + 's')\n        endsWithCents = true\n      } else {\n        // \"deux cent\", \"trois cent\" (no 's' when followed by more)\n        parts.push(ONES[hundreds] + ' ' + HUNDRED)\n      }\n    }\n  }\n\n  // Tens and ones - vigesimal pattern\n  if (tensOnes === 0) {\n    // Just hundreds, nothing more\n  } else if (tensOnes < 10) {\n    // Single digit\n    parts.push(ONES[tensOnes])\n  } else if (tensOnes < 17) {\n    // 10-16: regular teens\n    parts.push(TEENS[tensOnes - 10])\n  } else if (tensOnes < 20) {\n    // 17-19: dix-sept, dix-huit, dix-neuf\n    parts.push(TEENS[tensOnes - 10])\n  } else if (tensOnes < 70) {\n    // 20-69: standard tens + ones\n    const t = Math.floor(tensOnes / 10)\n    const o = tensOnes % 10\n    if (o === 0) {\n      parts.push(TENS[t])\n    } else if (o === 1) {\n      // \"et un\" for 21, 31, 41, 51, 61\n      parts.push(TENS[t] + ' et ' + ONES[1])\n    } else {\n      parts.push(TENS[t] + '-' + ONES[o])\n    }\n  } else if (tensOnes < 80) {\n    // 70-79: soixante-dix, soixante et onze, soixante-douze...\n    const remainder = tensOnes - 60\n    if (remainder === 11) {\n      // 71: soixante et onze\n      parts.push('soixante et onze')\n    } else {\n      // 70, 72-79: soixante-dix, soixante-douze...\n      parts.push('soixante-' + TEENS[remainder - 10])\n    }\n  } else if (tensOnes === 80) {\n    // 80: quatre-vingts (with 's')\n    parts.push('quatre-vingts')\n    endsWithVingts = true\n  } else if (tensOnes < 100) {\n    // 81-99: quatre-vingt-un, quatre-vingt-dix...\n    const remainder = tensOnes - 80\n    if (remainder < 10) {\n      // 81-89\n      parts.push('quatre-vingt-' + ONES[remainder])\n    } else {\n      // 90-99\n      parts.push('quatre-vingt-' + TEENS[remainder - 10])\n    }\n  }\n\n  // Join parts with space (between hundreds and rest)\n  return { word: parts.join(' '), endsWithCents, endsWithVingts }\n}\n\n// Precompute all 1000 segment words (0-999)\nconst SEGMENTS = new Array(1000)\nconst SEGMENTS_ENDS_CENTS = new Array(1000)\nconst SEGMENTS_ENDS_VINGTS = new Array(1000)\n\nfor (let i = 0; i < 1000; i++) {\n  const result = buildSegment(i)\n  SEGMENTS[i] = result.word\n  SEGMENTS_ENDS_CENTS[i] = result.endsWithCents\n  SEGMENTS_ENDS_VINGTS[i] = result.endsWithVingts\n}\n\n// ============================================================================\n// Helper Functions\n// ============================================================================\n\n/**\n * Gets scale word for French long scale with -ard pattern.\n *\n * @param {number} scaleIndex - Scale level (1 = thousand, 2 = million, etc.)\n * @param {bigint} segment - Segment value for pluralization\n * @returns {string} Scale word\n */\nfunction getScaleWord (scaleIndex, segment) {\n  if (scaleIndex === 1) return THOUSAND\n\n  // Even indices (2, 4, 6, 8): million, billion, trillion, quadrillion\n  // Odd indices > 1 (3, 5, 7, 9): milliard, billiard, trilliard, quadrilliard\n  if (scaleIndex % 2 === 0) {\n    const arrayIndex = (scaleIndex / 2) - 1\n    const baseWord = SCALES[arrayIndex]\n    if (!baseWord) return ''\n    return segment > 1n ? baseWord + 's' : baseWord\n  } else {\n    const arrayIndex = ((scaleIndex - 1) / 2) - 1\n    const ardWord = SCALES_ARD[arrayIndex]\n    if (!ardWord) return THOUSAND\n    return segment > 1n ? ardWord + 's' : ardWord\n  }\n}\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\n/**\n * Converts a non-negative integer to French words.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @param {boolean} withHyphen - Whether to use hyphen separators\n * @returns {string} French words\n */\nfunction integerToWords (n, withHyphen = false) {\n  if (n === 0n) return ZERO\n\n  // Fast path: numbers < 1000 (direct lookup)\n  if (n < 1000n) {\n    const word = SEGMENTS[Number(n)]\n    return withHyphen ? word.replace(/ /g, '-') : word\n  }\n\n  // Fast path: numbers < 1,000,000 (thousands)\n  if (n < 1_000_000n) {\n    const thousands = Number(n / 1000n)\n    const remainder = Number(n % 1000n)\n\n    let result\n    if (thousands === 1) {\n      // \"mille\" not \"un mille\"\n      result = THOUSAND\n    } else {\n      // Check if segment ends with \"cents\" or \"vingts\" - need to strip 's' before mille\n      let thousandsWord = SEGMENTS[thousands]\n      if (SEGMENTS_ENDS_CENTS[thousands] || SEGMENTS_ENDS_VINGTS[thousands]) {\n        thousandsWord = thousandsWord.slice(0, -1) // Remove trailing 's'\n      }\n      result = thousandsWord + (withHyphen ? '-' : ' ') + THOUSAND\n    }\n\n    if (remainder > 0) {\n      result += (withHyphen ? '-' : ' ') + SEGMENTS[remainder]\n    }\n\n    if (withHyphen) {\n      result = result.replace(/ /g, '-')\n    }\n\n    return result\n  }\n\n  // For numbers >= 1,000,000, use scale decomposition\n  return buildLargeNumberWords(n, withHyphen)\n}\n\n/**\n * Builds words for numbers >= 1,000,000.\n *\n * @param {bigint} n - Number >= 1,000,000\n * @param {boolean} withHyphen - Whether to use hyphen separators\n * @returns {string} French words\n */\nfunction buildLargeNumberWords (n, withHyphen) {\n  const numStr = n.toString()\n  const len = numStr.length\n\n  // Build segments of 3 digits from right to left\n  const segments = []\n  const segmentSize = 3\n\n  const remainderLen = len % segmentSize\n  let pos = 0\n  if (remainderLen > 0) {\n    segments.push(Number(numStr.slice(0, remainderLen)))\n    pos = remainderLen\n  }\n  while (pos < len) {\n    segments.push(Number(numStr.slice(pos, pos + segmentSize)))\n    pos += segmentSize\n  }\n\n  // Convert segments to words\n  const parts = []\n  let scaleIndex = segments.length - 1\n\n  for (let i = 0; i < segments.length; i++) {\n    const segment = segments[i]\n\n    if (segment !== 0) {\n      const scaleWord = scaleIndex > 0 ? getScaleWord(scaleIndex, BigInt(segment)) : ''\n\n      if (scaleIndex === 0) {\n        // Units segment\n        parts.push(SEGMENTS[segment])\n      } else if (scaleIndex === 1) {\n        // Thousands: \"mille\" not \"un mille\"\n        if (segment === 1) {\n          parts.push(THOUSAND)\n        } else {\n          let segWords = SEGMENTS[segment]\n          // Strip 's' from cents/vingts before mille\n          if (SEGMENTS_ENDS_CENTS[segment] || SEGMENTS_ENDS_VINGTS[segment]) {\n            segWords = segWords.slice(0, -1)\n          }\n          parts.push(segWords)\n          parts.push(scaleWord)\n        }\n      } else {\n        // Million and above\n        parts.push(SEGMENTS[segment])\n        parts.push(scaleWord)\n      }\n    }\n\n    scaleIndex--\n  }\n\n  const sep = withHyphen ? '-' : ' '\n  let result = parts.join(sep)\n\n  if (withHyphen) {\n    result = result.replace(/ /g, '-')\n  }\n\n  return result\n}\n\n/**\n * Converts decimal digits to French words.\n *\n * @param {string} decimalPart - Decimal digits (without the point)\n * @param {boolean} withHyphen - Whether to use hyphen separators\n * @returns {string} French words for decimal part\n */\nfunction decimalPartToWords (decimalPart, withHyphen) {\n  let result = ''\n  const sep = withHyphen ? '-' : ' '\n\n  // Handle leading zeros\n  let i = 0\n  while (i < decimalPart.length && decimalPart[i] === '0') {\n    if (result) result += sep\n    result += ZERO\n    i++\n  }\n\n  // Convert remainder as a single number\n  const remainder = decimalPart.slice(i)\n  if (remainder) {\n    if (result) result += sep\n    result += integerToWords(BigInt(remainder), withHyphen)\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to French words.\n *\n * This is the main public API. It accepts any valid numeric input\n * (number, string, or bigint) and handles parsing internally.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @param {Object} [options] - Optional configuration\n * @param {boolean} [options.withHyphenSeparator=false] - Use hyphens between all words\n * @returns {string} The number in French words\n * @throws {TypeError} If value is not a valid numeric type\n * @throws {Error} If value is not a valid number format\n *\n * @example\n * toWords(21)           // 'vingt et un'\n * toWords(80)           // 'quatre-vingts'\n * toWords(1000000)      // 'un million'\n */\nfunction toWords (value, options) {\n  options = validateOptions(options)\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n  const withHyphen = options.withHyphenSeparator || false\n\n  let result = ''\n  const sep = withHyphen ? '-' : ' '\n\n  if (isNegative) {\n    result = NEGATIVE + sep\n  }\n\n  result += integerToWords(integerPart, withHyphen)\n\n  if (decimalPart) {\n    result += sep + DECIMAL_SEP + sep + decimalPartToWords(decimalPart, withHyphen)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Public API\n// ============================================================================\n\nexport { toWords }\n","import { isPlainObject } from './is-plain-object.js'\n\n/**\n * Validates and normalizes the options parameter.\n *\n * @param {*} options The options value to validate\n * @returns {Object} A valid options object (empty object if undefined)\n * @throws {TypeError} If options is not undefined or a plain object\n */\nexport function validateOptions (options) {\n  if (options === undefined) return {}\n  if (isPlainObject(options)) return options\n  throw new TypeError(\n    `Invalid options: expected plain object or undefined, got ${typeof options}`\n  )\n}\n","/**\n * Checks if a value is a plain object (not null, array, or other object types).\n *\n * A plain object is one created by:\n * - Object literal: `{}`\n * - Object.create(null): null-prototype object\n *\n * This excludes arrays, class instances, Map, Set, and other object types.\n *\n * @param {*} value Value to check\n * @returns {boolean} True if value is a plain object\n */\nexport function isPlainObject (value) {\n  if (value === null || typeof value !== 'object') return false\n  const proto = Object.getPrototypeOf(value)\n  return proto === null || proto === Object.prototype\n}\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES","TEENS","TENS","SCALES","SCALES_ARD","THOUSAND","HUNDRED","ZERO","buildSegment","n","word","endsWithCents","endsWithVingts","tensOnes","hundreds","Math","floor","parts","push","t","o","remainder","join","SEGMENTS","Array","SEGMENTS_ENDS_CENTS","SEGMENTS_ENDS_VINGTS","i","result","getScaleWord","scaleIndex","segment","baseWord","ardWord","integerToWords","withHyphen","Number","replace","thousands","thousandsWord","numStr","toString","len","segments","remainderLen","pos","scaleWord","segWords","buildLargeNumberWords","value","options","undefined","proto","Object","getPrototypeOf","prototype","isPlainObject","TypeError","validateOptions","type","isFinite","Error","isSafeInteger","includes","numberToString","trimmed","trim","isNaN","normalizeString","parseNumericValue","withHyphenSeparator","sep","decimalPartToWords"],"mappings":";0CAwEA,SAASA,EAAoBC,GAC3B,MAAMC,EAAwB,MAAXD,EAAI,GACnBC,IAAYD,EAAMA,EAAIE,MAAM,IAEhC,MAAMC,EAAWH,EAAII,QAAQ,KAC7B,IAAiB,IAAbD,EACF,MAAO,CAAEF,aAAYI,YAAaC,OAAON,IAG3C,MAAMO,EAAaP,EAAIE,MAAM,EAAGC,IAAa,IACvCK,EAAcR,EAAIE,MAAMC,EAAW,GACzC,MAAO,CAAEF,aAAYI,YAAaC,OAAOC,GAAaC,cACxD,CAKA,SAASC,EAA0BT,GACjC,MAAOU,EAAUC,GAAUX,EAAIY,cAAcC,MAAM,KAC7CC,EAAMC,SAASJ,EAAQ,IAEvBR,EAAWO,EAASN,QAAQ,KAC5BY,OAASb,EACXO,EACAA,EAASR,MAAM,EAAGC,GAAYO,EAASR,MAAMC,EAAW,GAEtDc,IAD6B,IAAbd,EAAkBO,EAASQ,OAASf,GACnBW,EAEvC,OAAIG,GAAkBD,EAAOE,OACpBF,EAAS,IAAIG,OAAOF,EAAiBD,EAAOE,QAEjDD,GAAkB,EACb,KAAO,IAAIE,QAAQF,GAAkBD,EAEvCA,EAAOd,MAAM,EAAGe,GAAkB,IAAMD,EAAOd,MAAMe,EAC9D,CCnFA,MAAMG,EAAO,CAAC,GAAI,KAAM,OAAQ,QAAS,SAAU,OAAQ,MAAO,OAAQ,OAAQ,QAC5EC,EAAQ,CAAC,MAAO,OAAQ,QAAS,SAAU,WAAY,SAAU,QAAS,WAAY,WAAY,YAClGC,EAAO,CAAC,GAAI,GAAI,QAAS,SAAU,WAAY,YAAa,YAG5DC,EAAS,CAAC,UAAW,UAAW,WAAY,eAC5CC,EAAa,CAAC,WAAY,WAAY,YAAa,gBAEnDC,EAAW,QACXC,EAAU,OACVC,EAAO,OAYb,SAASC,EAAcC,GACrB,GAAU,IAANA,EAAS,MAAO,CAAEC,KAAM,GAAIC,eAAe,EAAOC,gBAAgB,GAEtE,MAAMC,EAAWJ,EAAI,IACfK,EAAWC,KAAKC,MAAMP,EAAI,KAE1BQ,EAAQ,GACd,IAAIN,GAAgB,EAChBC,GAAiB,EAuBrB,GApBIE,EAAW,IACI,IAAbA,EAEAG,EAAMC,KAAKZ,GAKI,IAAbO,GAEFI,EAAMC,KAAKlB,EAAKc,GAAY,IAAMR,EAAU,KAC5CK,GAAgB,GAGhBM,EAAMC,KAAKlB,EAAKc,GAAY,IAAMR,IAMvB,IAAbO,QAEG,GAAIA,EAAW,GAEpBI,EAAMC,KAAKlB,EAAKa,SACX,GAAIA,EAAW,GAEpBI,EAAMC,KAAKjB,EAAMY,EAAW,UACvB,GAAIA,EAAW,GAEpBI,EAAMC,KAAKjB,EAAMY,EAAW,UACvB,GAAIA,EAAW,GAAI,CAExB,MAAMM,EAAIJ,KAAKC,MAAMH,EAAW,IAC1BO,EAAIP,EAAW,GAEnBI,EAAMC,KADE,IAANE,EACSlB,EAAKiB,GACD,IAANC,EAEElB,EAAKiB,GAAK,OAASnB,EAAK,GAExBE,EAAKiB,GAAK,IAAMnB,EAAKoB,GAEpC,MAAO,GAAIP,EAAW,GAAI,CAExB,MAAMQ,EAAYR,EAAW,GAG3BI,EAAMC,KAFU,KAAdG,EAES,mBAGA,YAAcpB,EAAMoB,EAAY,IAE/C,MAAO,GAAiB,KAAbR,EAETI,EAAMC,KAAK,iBACXN,GAAiB,OACZ,GAAIC,EAAW,IAAK,CAEzB,MAAMQ,EAAYR,EAAW,GAG3BI,EAAMC,KAFJG,EAAY,GAEH,gBAAkBrB,EAAKqB,GAGvB,gBAAkBpB,EAAMoB,EAAY,IAEnD,CAGA,MAAO,CAAEX,KAAMO,EAAMK,KAAK,KAAMX,gBAAeC,iBACjD,CAGA,MAAMW,EAAW,IAAIC,MAAM,KACrBC,EAAsB,IAAID,MAAM,KAChCE,EAAuB,IAAIF,MAAM,KAEvC,IAAK,IAAIG,EAAI,EAAGA,EAAI,IAAMA,IAAK,CAC7B,MAAMC,EAASpB,EAAamB,GAC5BJ,EAASI,GAAKC,EAAOlB,KACrBe,EAAoBE,GAAKC,EAAOjB,cAChCe,EAAqBC,GAAKC,EAAOhB,cACnC,CAaA,SAASiB,EAAcC,EAAYC,GACjC,GAAmB,IAAfD,EAAkB,OAAOzB,EAI7B,GAAIyB,EAAa,GAAM,EAAG,CACxB,MACME,EAAW7B,EADG2B,EAAa,EAAK,GAEtC,OAAKE,EACED,EAAU,GAAKC,EAAW,IAAMA,EADjB,EAExB,CAAO,CACL,MACMC,EAAU7B,GADK0B,EAAa,GAAK,EAAK,GAE5C,OAAKG,EACEF,EAAU,GAAKE,EAAU,IAAMA,EADjB5B,CAEvB,CACF,CAaA,SAAS6B,EAAgBzB,EAAG0B,GAAa,GACvC,GAAU,KAAN1B,EAAU,OAAOF,EAGrB,GAAIE,EAAI,MAAO,CACb,MAAMC,EAAOa,EAASa,OAAO3B,IAC7B,OAAO0B,EAAazB,EAAK2B,QAAQ,KAAM,KAAO3B,CAChD,CAGA,GAAID,EAAI,SAAY,CAClB,MAAM6B,EAAYF,OAAO3B,EAAI,OACvBY,EAAYe,OAAO3B,EAAI,OAE7B,IAAImB,EACJ,GAAkB,IAAdU,EAEFV,EAASvB,MACJ,CAEL,IAAIkC,EAAgBhB,EAASe,IACzBb,EAAoBa,IAAcZ,EAAqBY,MACzDC,EAAgBA,EAAczD,MAAM,GAAG,IAEzC8C,EAASW,GAAiBJ,EAAa,IAAM,KAAO9B,CACtD,CAUA,OARIgB,EAAY,IACdO,IAAWO,EAAa,IAAM,KAAOZ,EAASF,IAG5Cc,IACFP,EAASA,EAAOS,QAAQ,KAAM,MAGzBT,CACT,CAGA,OAUF,SAAgCnB,EAAG0B,GACjC,MAAMK,EAAS/B,EAAEgC,WACXC,EAAMF,EAAO1C,OAGb6C,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAASzB,KAAKkB,OAAOI,EAAO1D,MAAM,EAAG8D,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAASzB,KAAKkB,OAAOI,EAAO1D,MAAM+D,EAAKA,EATrB,KAUlBA,GAVkB,EAcpB,MAAM5B,EAAQ,GACd,IAAIa,EAAaa,EAAS7C,OAAS,EAEnC,IAAK,IAAI6B,EAAI,EAAGA,EAAIgB,EAAS7C,OAAQ6B,IAAK,CACxC,MAAMI,EAAUY,EAAShB,GAEzB,GAAgB,IAAZI,EAAe,CACjB,MAAMe,EAAYhB,EAAa,EAAID,EAAaC,EAAY5C,OAAO6C,IAAY,GAE/E,GAAmB,IAAfD,EAEFb,EAAMC,KAAKK,EAASQ,SACf,GAAmB,IAAfD,EAET,GAAgB,IAAZC,EACFd,EAAMC,KAAKb,OACN,CACL,IAAI0C,EAAWxB,EAASQ,IAEpBN,EAAoBM,IAAYL,EAAqBK,MACvDgB,EAAWA,EAASjE,MAAM,GAAG,IAE/BmC,EAAMC,KAAK6B,GACX9B,EAAMC,KAAK4B,EACb,MAGA7B,EAAMC,KAAKK,EAASQ,IACpBd,EAAMC,KAAK4B,EAEf,CAEAhB,GACF,CAGA,IAAIF,EAASX,EAAMK,KADPa,EAAa,IAAM,KAO/B,OAJIA,IACFP,EAASA,EAAOS,QAAQ,KAAM,MAGzBT,CACT,CAzESoB,CAAsBvC,EAAG0B,EAClC,MAyHA,SAAkBc,EAAOC,GACvBA,EC/UK,SAA0BA,GAC/B,QAAgBC,IAAZD,EAAuB,MAAO,CAAA,EAClC,GCCK,SAAwBD,GAC7B,GAAc,OAAVA,GAAmC,iBAAVA,EAAoB,OAAO,EACxD,MAAMG,EAAQC,OAAOC,eAAeL,GACpC,OAAiB,OAAVG,GAAkBA,IAAUC,OAAOE,SAC5C,CDLMC,CAAcN,GAAU,OAAOA,EACnC,MAAM,IAAIO,UACR,mEAAmEP,EAEvE,CDyUYQ,CAAgBR,GAC1B,MAAMrE,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GD5U5B,SAA4B6D,GACjC,MAAMU,SAAcV,EAGpB,GAAa,WAATU,EACF,OAAOV,EAAQ,GACX,CAAEpE,YAAY,EAAMI,aAAcgE,GAClC,CAAEpE,YAAY,EAAOI,YAAagE,GAIxC,GAAa,WAATU,EAAmB,CACrB,IAAKvB,OAAOwB,SAASX,GACnB,MAAM,IAAIY,MAAM,8DAElB,OAAIzB,OAAO0B,cAAcb,GAChBA,EAAQ,EACX,CAAEpE,YAAY,EAAMI,YAAaC,QAAQ+D,IACzC,CAAEpE,YAAY,EAAOI,YAAaC,OAAO+D,IAExCtE,EAgBX,SAAyBsE,GACvB,MAAMrE,EAAMqE,EAAMR,WAClB,OAAQ7D,EAAImF,SAAS,MAAQnF,EAAImF,SAAS,KACtC1E,EAAyBT,GACzBA,CACN,CArB8BoF,CAAef,GAC3C,CAGA,GAAa,WAATU,EACF,OAAOhF,EAqBX,SAA0BsE,GACxB,MAAMgB,EAAUhB,EAAMiB,OACtB,GAAuB,IAAnBD,EAAQnE,QAAgBsC,OAAO+B,MAAM/B,OAAO6B,IAC9C,MAAM,IAAIJ,MAAM,2BAA2BZ,MAE7C,OAAQgB,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9C1E,EAAyB4E,GACzBA,CACN,CA7B8BG,CAAgBnB,IAG5C,MAAM,IAAIQ,UACR,oEAAoEE,IAExE,CC6SmDU,CAAkBpB,GAC7Dd,EAAae,EAAQoB,sBAAuB,EAElD,IAAI1C,EAAS,GACb,MAAM2C,EAAMpC,EAAa,IAAM,IAY/B,OAVItD,IACF+C,EA7Ta,QA6TO2C,GAGtB3C,GAAUM,EAAejD,EAAakD,GAElC/C,IACFwC,GAAU2C,EAlUM,UAkUcA,EAvDlC,SAA6BnF,EAAa+C,GACxC,IAAIP,EAAS,GACb,MAAM2C,EAAMpC,EAAa,IAAM,IAG/B,IAAIR,EAAI,EACR,KAAOA,EAAIvC,EAAYU,QAA6B,MAAnBV,EAAYuC,IACvCC,IAAQA,GAAU2C,GACtB3C,GAAUrB,EACVoB,IAIF,MAAMN,EAAYjC,EAAYN,MAAM6C,GAMpC,OALIN,IACEO,IAAQA,GAAU2C,GACtB3C,GAAUM,EAAehD,OAAOmC,GAAYc,IAGvCP,CACT,CAmCwC4C,CAAmBpF,EAAa+C,IAG/DP,CACT"}

package/dist/languages/gu.js

@@ -1,3 +0,0 @@
-/*! n2words/gu v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var e,t;e=this,t=function(e){"use strict";function t(e){const t="-"===e[0];t&&(e=e.slice(1));const n=e.indexOf(".");if(-1===n)return{isNegative:t,integerPart:BigInt(e)};const i=e.slice(0,n)||"0",r=e.slice(n+1);return{isNegative:t,integerPart:BigInt(i),decimalPart:r}}function n(e){const[t,n]=e.toLowerCase().split("e"),i=parseInt(n,10),r=t.indexOf("."),s=-1===r?t:t.slice(0,r)+t.slice(r+1),o=(-1===r?t.length:r)+i;return o>=s.length?s+"0".repeat(o-s.length):o<=0?"0."+"0".repeat(-o)+s:s.slice(0,o)+"."+s.slice(o)}const i="શૂન્ય",r=["શૂન્ય","એક","બે","ત્રણ","ચાર","પાંચ","છ","સાત","આઠ","નવ","દસ","અગિયાર","બાર","તેર","ચૌદ","પંદર","સોળ","સત્તર","અઢાર","ઓગણીસ","વીસ","એકવીસ","બાવીસ","ત્રેવીસ","ચોવીસ","પચીસ","છવ્વીસ","સત્તાવીસ","અઠ્ઠાવીસ","ઓગણત્રીસ","ત્રીસ","એકત્રીસ","બત્રીસ","તેત્રીસ","ચોત્રીસ","પાંત્રીસ","છત્રીસ","સાડત્રીસ","અડત્રીસ","ઓગણચાલીસ","ચાલીસ","એકતાલીસ","બેતાળીસ","ત્રેતાળીસ","ચુંમાલીસ","પિસ્તાલીસ","છેતાળીસ","સુડતાળીસ","અડતાળીસ","ઓગણપચાસ","પચાસ","એકાવન","બાવન","ત્રેપન","ચોપન","પંચાવન","છપ્પન","સત્તાવન","અઠ્ઠાવન","ઓગણસાઠ","સાઠ","એકસઠ","બાસઠ","ત્રેસઠ","ચોસઠ","પાંસઠ","છાસઠ","સડસઠ","અડસઠ","અગણોસિત્તેર","સિત્તેર","એકોતેર","બોતેર","તોતેર","ચુમોતેર","પંચોતેર","છોતેર","સિત્યોતેર","ઇઠ્યોતેર","ઓગણાએંસી","એંસી","એક્યાસી","બ્યાસી","ત્યાસી","ચોર્યાસી","પંચાસી","છ્યાસી","સિત્યાસી","અઠ્યાસી","નેવ્યાસી","નેવું","એકાણું","બાણું","ત્રાણું","ચોરાણું","પંચાણું","છન્નું","સત્તાણું","અઠ્ઠાણું","નવ્વાણું"],s=["","હજાર","લાખ","કરોડ","અબજ","ખરબ","નીલ","પદ્મ","શંખ"];function o(e){if(0===e)return"";if(e<100)return r[e];const t=Math.trunc(e/100),n=e%100;return 0===n?r[t]+" સો":r[t]+" સો "+r[n]}e.gu=function(e){const{isNegative:u,integerPart:c,decimalPart:f}=function(e){const i=typeof e;if("bigint"===i)return e<0n?{isNegative:!0,integerPart:-e}:{isNegative:!1,integerPart:e};if("number"===i){if(!Number.isFinite(e))throw new Error("Number must be finite (NaN and Infinity are not supported)");return Number.isSafeInteger(e)?e<0?{isNegative:!0,integerPart:BigInt(-e)}:{isNegative:!1,integerPart:BigInt(e)}:t(function(e){const t=e.toString();return t.includes("e")||t.includes("E")?n(t):t}(e))}if("string"===i)return t(function(e){const t=e.trim();if(0===t.length||Number.isNaN(Number(t)))throw new Error(`Invalid number format: "${e}"`);return t.includes("e")||t.includes("E")?n(t):t}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${i}`)}(e);let a="";return u&&(a="ઋણ "),a+=function(e){if(0n===e)return i;const t=function(e){const t=e.toString();if(t.length<=3)return[Number(t)];const n=[];n.unshift(Number(t.slice(-3)));let i=t.slice(0,-3);for(;i.length>0;)n.unshift(Number(i.slice(-2))),i=i.slice(0,-2);return n}(e),n=t.length,r=[];for(let e=0;e<n;e++){const i=t[e];if(0===i)continue;const u=n-e-1;r.push(o(i)),u>0&&s[u]&&r.push(s[u])}return r.join(" ").trim()}(c),f&&(a+=" દશાંશ "+function(e){const t=[];for(const n of e){const e=parseInt(n,10);t.push(0===e?i:r[e])}return t.join(" ")}(f)),a}},"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).n2words=e.n2words||{});
-//# sourceMappingURL=gu.js.map