n2words 3.0.0 → 3.1.0

package/dist/languages/da.js.map

@@ -1 +1 @@
-{"version":3,"file":"da.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/da.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 * Danish language converter - Functional Implementation\n *\n * A performance-optimized number-to-words converter using precomputed lookup tables.\n *\n * Key features:\n * - Vigesimal (base-20) tens naming: halvtreds (50), treds (60), etc.\n * - Units-before-tens: \"enogtyve\" (21) = one-and-twenty\n * - Compound thousands: \"ettusind\", \"firetusinde\"\n * - \"og\" conjunction after hundreds and thousands\n * - Long scale for millions+\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\n\n// ============================================================================\n// Vocabulary (module-level constants)\n// ============================================================================\n\nconst ONES = ['', 'et', 'to', 'tre', 'fire', 'fem', 'seks', 'syv', 'otte', 'ni']\n// \"en\" form used in vigesimal pattern (X og Y) and before millions\nconst ONES_VIGESIMAL = ['', 'en', 'to', 'tre', 'fire', 'fem', 'seks', 'syv', 'otte', 'ni']\n\nconst TEENS = ['ti', 'elleve', 'tolv', 'tretten', 'fjorten', 'femten', 'seksten', 'sytten', 'atten', 'nitten']\n\n// Danish vigesimal tens (base-20 derived names)\nconst TENS = ['', '', 'tyve', 'tredive', 'fyrre', 'halvtreds', 'treds', 'halvfjerds', 'firs', 'halvfems']\n\nconst HUNDRED = 'hundrede'\nconst THOUSAND = 'tusind'\n\nconst ZERO = 'nul'\nconst NEGATIVE = 'minus'\nconst DECIMAL_SEP = 'komma'\n\n// Long scale: millioner, millarder, billioner, etc.\nconst SCALES = ['millioner', 'millarder', 'billioner', 'billarder', 'trillioner', 'trillarder', 'quadrillioner', 'quadrillarder']\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: \"ethundrede\", \"tohundrede\" (compound, no space)\n  if (hundreds > 0) {\n    parts.push(ONES[hundreds] + 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\n    parts.push(TEENS[ones])\n  } else if (ones === 0) {\n    // Even tens\n    parts.push(TENS[tens])\n  } else {\n    // Units-before-tens: \"enogtyve\", \"treogfyrre\"\n    parts.push(ONES_VIGESIMAL[ones] + 'og' + TENS[tens])\n  }\n\n  // Combine with \" og \" between hundreds and remainder\n  if (parts.length === 2) {\n    return parts[0] + ' og ' + parts[1]\n  }\n  return parts[0] || ''\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 Danish words.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @returns {string} Danish 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 thousands: \"ettusind\", \"firetusind\"\n    let result = SEGMENTS[thousands] + THOUSAND\n\n    if (remainder > 0) {\n      // Add 'e' suffix and \" og \" for remainder: \"firetusinde og ...\"\n      result += 'e og ' + 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} Danish 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 with scale tracking\n  // scaleIndex: 0 = units, 1 = thousands, 2 = millions, etc.\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({ word: segmentWord, type: 'units' })\n      } else if (scaleIndex === 1) {\n        // Thousands - compound form\n        parts.push({ word: segmentWord + THOUSAND, type: 'thousand' })\n      } else {\n        // Millions+ - space-separated, use \"en\" for 1\n        const scaleWord = SCALES[scaleIndex - 2]\n        let numWord = segmentWord\n        // \"et\" → \"en\" before millions+\n        if (segment === 1) {\n          numWord = 'en'\n        }\n        parts.push({ word: numWord + ' ' + scaleWord, type: 'million' })\n      }\n    }\n\n    scaleIndex--\n  }\n\n  // Join parts with Danish rules\n  return joinDanishParts(parts)\n}\n\n/**\n * Joins parts with Danish spacing rules.\n * - After thousands with remainder: \"tusinde og\"\n * - Millions are space-separated\n *\n * @param {Array} parts - Parts with type metadata\n * @returns {string} Joined string\n */\nfunction joinDanishParts (parts) {\n  if (parts.length === 0) return ZERO\n  if (parts.length === 1) return parts[0].word\n\n  const result = []\n\n  for (let i = 0; i < parts.length; i++) {\n    const part = parts[i]\n    const nextPart = parts[i + 1]\n\n    if (part.type === 'thousand' && nextPart && nextPart.type === 'units') {\n      // Thousands followed by units: add \"e og\"\n      result.push(part.word + 'e og ' + nextPart.word)\n      i++ // Skip the units part\n    } else if (part.type === 'million') {\n      if (result.length > 0) {\n        result.push(' ')\n      }\n      result.push(part.word)\n      if (nextPart) {\n        result.push(' ')\n      }\n    } else {\n      if (result.length > 0 && !result[result.length - 1].endsWith(' ')) {\n        result.push(' ')\n      }\n      result.push(part.word)\n    }\n  }\n\n  return result.join('')\n}\n\n/**\n * Converts decimal digits to Danish words.\n *\n * @param {string} decimalPart - Decimal digits (without the point)\n * @returns {string} Danish 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 Danish words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @returns {string} The number in Danish 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)       // 'enogtyve'\n * toWords(1000)     // 'ettusind'\n * toWords(1000000)  // 'en millioner'\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","ONES_VIGESIMAL","TEENS","TENS","THOUSAND","ZERO","SCALES","buildSegment","n","ones","tens","Math","floor","hundreds","parts","push","tensOnes","SEGMENTS","Array","i","integerToWords","Number","thousands","remainder","result","numStr","toString","len","segments","remainderLen","pos","scaleIndex","segment","segmentWord","word","type","numWord","part","nextPart","endsWith","join","joinDanishParts","buildLargeNumberWords","value","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,CCxFA,MAAMG,EAAO,CAAC,GAAI,KAAM,KAAM,MAAO,OAAQ,MAAO,OAAQ,MAAO,OAAQ,MAErEC,EAAiB,CAAC,GAAI,KAAM,KAAM,MAAO,OAAQ,MAAO,OAAQ,MAAO,OAAQ,MAE/EC,EAAQ,CAAC,KAAM,SAAU,OAAQ,UAAW,UAAW,SAAU,UAAW,SAAU,QAAS,UAG/FC,EAAO,CAAC,GAAI,GAAI,OAAQ,UAAW,QAAS,YAAa,QAAS,aAAc,OAAQ,YAGxFC,EAAW,SAEXC,EAAO,MAKPC,EAAS,CAAC,YAAa,YAAa,YAAa,YAAa,aAAc,aAAc,gBAAiB,iBASjH,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,KAAKf,EAAKa,GA5BJ,YAgCd,MAAMG,EAAWR,EAAI,IAmBrB,OAjBiB,IAAbQ,GAIFF,EAAMC,KAFGC,EAAW,GAEThB,EAAKS,GACPO,EAAW,GAETd,EAAMO,GACC,IAATA,EAEEN,EAAKO,GAGLT,EAAeQ,GAAQ,KAAON,EAAKO,IAI3B,IAAjBI,EAAMhB,OACDgB,EAAM,GAAK,OAASA,EAAM,GAE5BA,EAAM,IAAM,EACrB,CAGA,MAAMG,EAAW,IAAIC,MAAM,KAE3B,IAAK,IAAIC,EAAI,EAAGA,EAAI,IAAMA,IACxBF,EAASE,GAAKZ,EAAaY,GAa7B,SAASC,EAAgBZ,GACvB,GAAU,KAANA,EAAU,OAAOH,EAGrB,GAAIG,EAAI,MACN,OAAOS,EAASI,OAAOb,IAIzB,GAAIA,EAAI,SAAY,CAClB,MAAMc,EAAYD,OAAOb,EAAI,OACvBe,EAAYF,OAAOb,EAAI,OAG7B,IAAIgB,EAASP,EAASK,GAAalB,EAOnC,OALImB,EAAY,IAEdC,GAAU,QAAUP,EAASM,IAGxBC,CACT,CAGA,OASF,SAAgChB,GAC9B,MAAMiB,EAASjB,EAAEkB,WACXC,EAAMF,EAAO3B,OAGb8B,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAASb,KAAKM,OAAOI,EAAO3C,MAAM,EAAG+C,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAASb,KAAKM,OAAOI,EAAO3C,MAAMgD,EAAKA,EATrB,KAUlBA,GAVkB,EAepB,MAAMhB,EAAQ,GACd,IAAIiB,EAAaH,EAAS9B,OAAS,EAEnC,IAAK,IAAIqB,EAAI,EAAGA,EAAIS,EAAS9B,OAAQqB,IAAK,CACxC,MAAMa,EAAUJ,EAAST,GAEzB,GAAgB,IAAZa,EAAe,CACjB,MAAMC,EAAchB,EAASe,GAE7B,GAAmB,IAAfD,EAEFjB,EAAMC,KAAK,CAAEmB,KAAMD,EAAaE,KAAM,eACjC,GAAmB,IAAfJ,EAETjB,EAAMC,KAAK,CAAEmB,KAAMD,EAAc7B,EAAU+B,KAAM,iBAC5C,CAGL,IAAIC,EAAUH,EAEE,IAAZD,IACFI,EAAU,MAEZtB,EAAMC,KAAK,CAAEmB,KAAME,EAAU,IANX9B,EAAOyB,EAAa,GAMQI,KAAM,WACtD,CACF,CAEAJ,GACF,CAGA,OAWF,SAA0BjB,GACxB,GAAqB,IAAjBA,EAAMhB,OAAc,OAAOO,EAC/B,GAAqB,IAAjBS,EAAMhB,OAAc,OAAOgB,EAAM,GAAGoB,KAExC,MAAMV,EAAS,GAEf,IAAK,IAAIL,EAAI,EAAGA,EAAIL,EAAMhB,OAAQqB,IAAK,CACrC,MAAMkB,EAAOvB,EAAMK,GACbmB,EAAWxB,EAAMK,EAAI,GAET,aAAdkB,EAAKF,MAAuBG,GAA8B,UAAlBA,EAASH,MAEnDX,EAAOT,KAAKsB,EAAKH,KAAO,QAAUI,EAASJ,MAC3Cf,KACuB,YAAdkB,EAAKF,MACVX,EAAO1B,OAAS,GAClB0B,EAAOT,KAAK,KAEdS,EAAOT,KAAKsB,EAAKH,MACbI,GACFd,EAAOT,KAAK,OAGVS,EAAO1B,OAAS,IAAM0B,EAAOA,EAAO1B,OAAS,GAAGyC,SAAS,MAC3Df,EAAOT,KAAK,KAEdS,EAAOT,KAAKsB,EAAKH,MAErB,CAEA,OAAOV,EAAOgB,KAAK,GACrB,CA1CSC,CAAgB3B,EACzB,CA9DS4B,CAAsBlC,EAC/B,MAgJA,SAAkBmC,GAChB,MAAM9D,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GDpQ5B,SAA4BuD,GACjC,MAAMR,SAAcQ,EAGpB,GAAa,WAATR,EACF,OAAOQ,EAAQ,GACX,CAAE9D,YAAY,EAAMI,aAAc0D,GAClC,CAAE9D,YAAY,EAAOI,YAAa0D,GAIxC,GAAa,WAATR,EAAmB,CACrB,IAAKd,OAAOuB,SAASD,GACnB,MAAM,IAAIE,MAAM,8DAElB,OAAIxB,OAAOyB,cAAcH,GAChBA,EAAQ,EACX,CAAE9D,YAAY,EAAMI,YAAaC,QAAQyD,IACzC,CAAE9D,YAAY,EAAOI,YAAaC,OAAOyD,IAExChE,EAgBX,SAAyBgE,GACvB,MAAM/D,EAAM+D,EAAMjB,WAClB,OAAQ9C,EAAImE,SAAS,MAAQnE,EAAImE,SAAS,KACtC1D,EAAyBT,GACzBA,CACN,CArB8BoE,CAAeL,GAC3C,CAGA,GAAa,WAATR,EACF,OAAOxD,EAqBX,SAA0BgE,GACxB,MAAMM,EAAUN,EAAMO,OACtB,GAAuB,IAAnBD,EAAQnD,QAAgBuB,OAAO8B,MAAM9B,OAAO4B,IAC9C,MAAM,IAAIJ,MAAM,2BAA2BF,MAE7C,OAAQM,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9C1D,EAAyB4D,GACzBA,CACN,CA7B8BG,CAAgBT,IAG5C,MAAM,IAAIU,UACR,oEAAoElB,IAExE,CCqOmDmB,CAAkBX,GAEnE,IAAInB,EAAS,GAYb,OAVI3C,IACF2C,EAAS+B,UAGX/B,GAAUJ,EAAenC,GAErBG,IACFoC,GAAU,UA9Cd,SAA6BpC,GAC3B,IAAIoC,EAAS,GAGTL,EAAI,EACR,KAAOA,EAAI/B,EAAYU,QAA6B,MAAnBV,EAAY+B,IACvCK,IAAQA,GAAU,KACtBA,GAAUnB,EACVc,IAIF,MAAMI,EAAYnC,EAAYN,MAAMqC,GAMpC,OALII,IACEC,IAAQA,GAAU,KACtBA,GAAUJ,EAAelC,OAAOqC,KAG3BC,CACT,CA2BwCgC,CAAmBpE,IAGlDoC,CACT"}
+{"version":3,"file":"da.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/da.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 * Danish language converter - Functional Implementation\n *\n * Self-contained module with its own input validation, ready for subpath exports.\n *\n * Key features:\n * - Vigesimal (base-20) tens naming: halvtreds (50), treds (60), etc.\n * - Units-before-tens: \"enogtyve\" (21) = one-and-twenty\n * - Compound thousands: \"ettusind\", \"firetusinde\"\n * - \"og\" conjunction after hundreds and thousands\n * - Long scale for millions+\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\n\n// ============================================================================\n// Vocabulary (module-level constants)\n// ============================================================================\n\nconst ONES = ['', 'et', 'to', 'tre', 'fire', 'fem', 'seks', 'syv', 'otte', 'ni']\n// \"en\" form used in vigesimal pattern (X og Y) and before millions\nconst ONES_VIGESIMAL = ['', 'en', 'to', 'tre', 'fire', 'fem', 'seks', 'syv', 'otte', 'ni']\n\nconst TEENS = ['ti', 'elleve', 'tolv', 'tretten', 'fjorten', 'femten', 'seksten', 'sytten', 'atten', 'nitten']\n\n// Danish vigesimal tens (base-20 derived names)\nconst TENS = ['', '', 'tyve', 'tredive', 'fyrre', 'halvtreds', 'treds', 'halvfjerds', 'firs', 'halvfems']\n\nconst HUNDRED = 'hundrede'\nconst THOUSAND = 'tusind'\n\nconst ZERO = 'nul'\nconst NEGATIVE = 'minus'\nconst DECIMAL_SEP = 'komma'\n\n// Long scale: millioner, millarder, billioner, etc.\nconst SCALES = ['millioner', 'millarder', 'billioner', 'billarder', 'trillioner', 'trillarder', 'quadrillioner', 'quadrillarder']\n\n// ============================================================================\n// Segment Building\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: \"ethundrede\", \"tohundrede\" (compound, no space)\n  if (hundreds > 0) {\n    parts.push(ONES[hundreds] + 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\n    parts.push(TEENS[ones])\n  } else if (ones === 0) {\n    // Even tens\n    parts.push(TENS[tens])\n  } else {\n    // Units-before-tens: \"enogtyve\", \"treogfyrre\"\n    parts.push(ONES_VIGESIMAL[ones] + 'og' + TENS[tens])\n  }\n\n  // Combine with \" og \" between hundreds and remainder\n  if (parts.length === 2) {\n    return parts[0] + ' og ' + parts[1]\n  }\n  return parts[0] || ''\n}\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\n/**\n * Converts a non-negative integer to Danish words.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @returns {string} Danish 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 buildSegment(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 thousands: \"ettusind\", \"firetusind\"\n    let result = buildSegment(thousands) + THOUSAND\n\n    if (remainder > 0) {\n      // Add 'e' suffix and \" og \" for remainder: \"firetusinde og ...\"\n      result += 'e og ' + buildSegment(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} Danish 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 with scale tracking\n  // scaleIndex: 0 = units, 1 = thousands, 2 = millions, etc.\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 = buildSegment(segment)\n\n      if (scaleIndex === 0) {\n        // Units segment\n        parts.push({ word: segmentWord, type: 'units' })\n      } else if (scaleIndex === 1) {\n        // Thousands - compound form\n        parts.push({ word: segmentWord + THOUSAND, type: 'thousand' })\n      } else {\n        // Millions+ - space-separated, use \"en\" for 1\n        const scaleWord = SCALES[scaleIndex - 2]\n        let numWord = segmentWord\n        // \"et\" → \"en\" before millions+\n        if (segment === 1) {\n          numWord = 'en'\n        }\n        parts.push({ word: numWord + ' ' + scaleWord, type: 'million' })\n      }\n    }\n\n    scaleIndex--\n  }\n\n  // Join parts with Danish rules\n  return joinDanishParts(parts)\n}\n\n/**\n * Joins parts with Danish spacing rules.\n * - After thousands with remainder: \"tusinde og\"\n * - Millions are space-separated\n *\n * @param {Array} parts - Parts with type metadata\n * @returns {string} Joined string\n */\nfunction joinDanishParts (parts) {\n  if (parts.length === 0) return ZERO\n  if (parts.length === 1) return parts[0].word\n\n  const result = []\n\n  for (let i = 0; i < parts.length; i++) {\n    const part = parts[i]\n    const nextPart = parts[i + 1]\n\n    if (part.type === 'thousand' && nextPart && nextPart.type === 'units') {\n      // Thousands followed by units: add \"e og\"\n      result.push(part.word + 'e og ' + nextPart.word)\n      i++ // Skip the units part\n    } else if (part.type === 'million') {\n      if (result.length > 0) {\n        result.push(' ')\n      }\n      result.push(part.word)\n      if (nextPart) {\n        result.push(' ')\n      }\n    } else {\n      if (result.length > 0 && !result[result.length - 1].endsWith(' ')) {\n        result.push(' ')\n      }\n      result.push(part.word)\n    }\n  }\n\n  return result.join('')\n}\n\n/**\n * Converts decimal digits to Danish words.\n *\n * @param {string} decimalPart - Decimal digits (without the point)\n * @returns {string} Danish 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 Danish words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @returns {string} The number in Danish 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)       // 'enogtyve'\n * toWords(1000)     // 'ettusind'\n * toWords(1000000)  // 'en millioner'\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","ONES_VIGESIMAL","TEENS","TENS","THOUSAND","ZERO","SCALES","buildSegment","n","ones","tens","Math","floor","hundreds","parts","push","tensOnes","integerToWords","Number","thousands","remainder","result","numStr","toString","len","segments","remainderLen","pos","scaleIndex","i","segment","segmentWord","word","type","numWord","part","nextPart","endsWith","join","joinDanishParts","buildLargeNumberWords","value","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,CCxFA,MAAMG,EAAO,CAAC,GAAI,KAAM,KAAM,MAAO,OAAQ,MAAO,OAAQ,MAAO,OAAQ,MAErEC,EAAiB,CAAC,GAAI,KAAM,KAAM,MAAO,OAAQ,MAAO,OAAQ,MAAO,OAAQ,MAE/EC,EAAQ,CAAC,KAAM,SAAU,OAAQ,UAAW,UAAW,SAAU,UAAW,SAAU,QAAS,UAG/FC,EAAO,CAAC,GAAI,GAAI,OAAQ,UAAW,QAAS,YAAa,QAAS,aAAc,OAAQ,YAGxFC,EAAW,SAEXC,EAAO,MAKPC,EAAS,CAAC,YAAa,YAAa,YAAa,YAAa,aAAc,aAAc,gBAAiB,iBASjH,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,KAAKf,EAAKa,GA5BJ,YAgCd,MAAMG,EAAWR,EAAI,IAmBrB,OAjBiB,IAAbQ,GAIFF,EAAMC,KAFGC,EAAW,GAEThB,EAAKS,GACPO,EAAW,GAETd,EAAMO,GACC,IAATA,EAEEN,EAAKO,GAGLT,EAAeQ,GAAQ,KAAON,EAAKO,IAI3B,IAAjBI,EAAMhB,OACDgB,EAAM,GAAK,OAASA,EAAM,GAE5BA,EAAM,IAAM,EACrB,CAYA,SAASG,EAAgBT,GACvB,GAAU,KAANA,EAAU,OAAOH,EAGrB,GAAIG,EAAI,MACN,OAAOD,EAAaW,OAAOV,IAI7B,GAAIA,EAAI,SAAY,CAClB,MAAMW,EAAYD,OAAOV,EAAI,OACvBY,EAAYF,OAAOV,EAAI,OAG7B,IAAIa,EAASd,EAAaY,GAAaf,EAOvC,OALIgB,EAAY,IAEdC,GAAU,QAAUd,EAAaa,IAG5BC,CACT,CAGA,OASF,SAAgCb,GAC9B,MAAMc,EAASd,EAAEe,WACXC,EAAMF,EAAOxB,OAGb2B,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAASV,KAAKG,OAAOI,EAAOxC,MAAM,EAAG4C,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAASV,KAAKG,OAAOI,EAAOxC,MAAM6C,EAAKA,EATrB,KAUlBA,GAVkB,EAepB,MAAMb,EAAQ,GACd,IAAIc,EAAaH,EAAS3B,OAAS,EAEnC,IAAK,IAAI+B,EAAI,EAAGA,EAAIJ,EAAS3B,OAAQ+B,IAAK,CACxC,MAAMC,EAAUL,EAASI,GAEzB,GAAgB,IAAZC,EAAe,CACjB,MAAMC,EAAcxB,EAAauB,GAEjC,GAAmB,IAAfF,EAEFd,EAAMC,KAAK,CAAEiB,KAAMD,EAAaE,KAAM,eACjC,GAAmB,IAAfL,EAETd,EAAMC,KAAK,CAAEiB,KAAMD,EAAc3B,EAAU6B,KAAM,iBAC5C,CAGL,IAAIC,EAAUH,EAEE,IAAZD,IACFI,EAAU,MAEZpB,EAAMC,KAAK,CAAEiB,KAAME,EAAU,IANX5B,EAAOsB,EAAa,GAMQK,KAAM,WACtD,CACF,CAEAL,GACF,CAGA,OAWF,SAA0Bd,GACxB,GAAqB,IAAjBA,EAAMhB,OAAc,OAAOO,EAC/B,GAAqB,IAAjBS,EAAMhB,OAAc,OAAOgB,EAAM,GAAGkB,KAExC,MAAMX,EAAS,GAEf,IAAK,IAAIQ,EAAI,EAAGA,EAAIf,EAAMhB,OAAQ+B,IAAK,CACrC,MAAMM,EAAOrB,EAAMe,GACbO,EAAWtB,EAAMe,EAAI,GAET,aAAdM,EAAKF,MAAuBG,GAA8B,UAAlBA,EAASH,MAEnDZ,EAAON,KAAKoB,EAAKH,KAAO,QAAUI,EAASJ,MAC3CH,KACuB,YAAdM,EAAKF,MACVZ,EAAOvB,OAAS,GAClBuB,EAAON,KAAK,KAEdM,EAAON,KAAKoB,EAAKH,MACbI,GACFf,EAAON,KAAK,OAGVM,EAAOvB,OAAS,IAAMuB,EAAOA,EAAOvB,OAAS,GAAGuC,SAAS,MAC3DhB,EAAON,KAAK,KAEdM,EAAON,KAAKoB,EAAKH,MAErB,CAEA,OAAOX,EAAOiB,KAAK,GACrB,CA1CSC,CAAgBzB,EACzB,CA9DS0B,CAAsBhC,EAC/B,MAgJA,SAAkBiC,GAChB,MAAM5D,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GD7P5B,SAA4BqD,GACjC,MAAMR,SAAcQ,EAGpB,GAAa,WAATR,EACF,OAAOQ,EAAQ,GACX,CAAE5D,YAAY,EAAMI,aAAcwD,GAClC,CAAE5D,YAAY,EAAOI,YAAawD,GAIxC,GAAa,WAATR,EAAmB,CACrB,IAAKf,OAAOwB,SAASD,GACnB,MAAM,IAAIE,MAAM,8DAElB,OAAIzB,OAAO0B,cAAcH,GAChBA,EAAQ,EACX,CAAE5D,YAAY,EAAMI,YAAaC,QAAQuD,IACzC,CAAE5D,YAAY,EAAOI,YAAaC,OAAOuD,IAExC9D,EAgBX,SAAyB8D,GACvB,MAAM7D,EAAM6D,EAAMlB,WAClB,OAAQ3C,EAAIiE,SAAS,MAAQjE,EAAIiE,SAAS,KACtCxD,EAAyBT,GACzBA,CACN,CArB8BkE,CAAeL,GAC3C,CAGA,GAAa,WAATR,EACF,OAAOtD,EAqBX,SAA0B8D,GACxB,MAAMM,EAAUN,EAAMO,OACtB,GAAuB,IAAnBD,EAAQjD,QAAgBoB,OAAO+B,MAAM/B,OAAO6B,IAC9C,MAAM,IAAIJ,MAAM,2BAA2BF,MAE7C,OAAQM,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9CxD,EAAyB0D,GACzBA,CACN,CA7B8BG,CAAgBT,IAG5C,MAAM,IAAIU,UACR,oEAAoElB,IAExE,CC8NmDmB,CAAkBX,GAEnE,IAAIpB,EAAS,GAYb,OAVIxC,IACFwC,EAASgC,UAGXhC,GAAUJ,EAAehC,GAErBG,IACFiC,GAAU,UA9Cd,SAA6BjC,GAC3B,IAAIiC,EAAS,GAGTQ,EAAI,EACR,KAAOA,EAAIzC,EAAYU,QAA6B,MAAnBV,EAAYyC,IACvCR,IAAQA,GAAU,KACtBA,GAAUhB,EACVwB,IAIF,MAAMT,EAAYhC,EAAYN,MAAM+C,GAMpC,OALIT,IACEC,IAAQA,GAAU,KACtBA,GAAUJ,EAAe/B,OAAOkC,KAG3BC,CACT,CA2BwCiC,CAAmBlE,IAGlDiC,CACT"}

package/dist/languages/de.js

@@ -1,3 +1,3 @@
-/*! n2words/de 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 i=e.indexOf(".");if(-1===i)return{isNegative:n,integerPart:BigInt(e)};const t=e.slice(0,i)||"0",r=e.slice(i+1);return{isNegative:n,integerPart:BigInt(t),decimalPart:r}}function i(e){const[n,i]=e.toLowerCase().split("e"),t=parseInt(i,10),r=n.indexOf("."),l=-1===r?n:n.slice(0,r)+n.slice(r+1),s=(-1===r?n.length:r)+t;return s>=l.length?l+"0".repeat(s-l.length):s<=0?"0."+"0".repeat(-s)+l:l.slice(0,s)+"."+l.slice(s)}const t=["","eins","zwei","drei","vier","fünf","sechs","sieben","acht","neun"],r="ein",l=["zehn","elf","zwölf","dreizehn","vierzehn","fünfzehn","sechzehn","siebzehn","achtzehn","neunzehn"],s=["","","zwanzig","dreißig","vierzig","fünfzig","sechzig","siebzig","achtzig","neunzig"],o=["tausend","Million","Milliarde","Billion","Billiarde","Trillion","Trilliarde","Quadrillion","Quadrilliarde"],u=["tausend","Millionen","Milliarden","Billionen","Billiarden","Trillionen","Trilliarden","Quadrillionen","Quadrilliarden"],a="hundert",c="null";function f(e){if(0===e)return"";const n=e%10,i=Math.floor(e/10)%10,o=Math.floor(e/100);let u="";return o>0&&(u+=(1===o?r:t[o])+a),1===i?u+=l[n]:i>=2&&n>0?u+=(1===n?r:t[n])+"und"+s[i]:i>=2?u+=s[i]:n>0&&(u+=t[n]),u}function d(e){if(0===e)return"";if(1===e)return r;const n=e%10,i=Math.floor(e/10)%10,o=Math.floor(e/100);let u="";return o>0&&(u+=(1===o?r:t[o])+a),1===i?u+=l[n]:i>=2&&n>0?u+=(1===n?r:t[n])+"und"+s[i]:i>=2?u+=s[i]:(n>0&&o>0||n>0)&&(u+=t[n]),u}const g=new Array(1e3);for(let e=0;e<1e3;e++)g[e]=f(e);const h=new Array(1e3);for(let e=0;e<1e3;e++)h[e]=d(e);function m(e){if(0n===e)return c;if(e<1000n)return g[Number(e)];if(e<1000000n){const n=Number(e/1000n),i=Number(e%1000n);let t=h[n]+o[0];return i>0&&(t+=g[i]),t}return function(e){const n=e.toString(),i=n.length,t=[],r=i%3;let l=0;for(r>0&&(t.push(Number(n.slice(0,r))),l=r);l<i;)t.push(Number(n.slice(l,l+3))),l+=3;const s=[];let a=t.length-1;for(let e=0;e<t.length;e++){const n=t[e];if(0!==n)if(0===a)s.push({words:g[n],isScale:!1,scaleLevel:0});else if(1===a)s.push({words:h[n]+o[0],isScale:!1,scaleLevel:1});else{let e;e=1===n?"eine":g[n];const i=1===n?o[a-1]:u[a-1];s.push({words:e,isScale:!1,scaleLevel:a}),s.push({words:i,isScale:!0,scaleLevel:a})}a--}return function(e){if(0===e.length)return c;let n="";for(let i=0;i<e.length;i++){const t=e[i],r=i>0?e[i-1]:null;i>0&&(t.isScale||r&&r.isScale)&&(n+=" "),n+=t.words}return n}(s)}(e)}e.de=function(e){const{isNegative:t,integerPart:r,decimalPart:l}=function(e){const t=typeof e;if("bigint"===t)return e<0n?{isNegative:!0,integerPart:-e}:{isNegative:!1,integerPart:e};if("number"===t){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")?i(n):n}(e))}if("string"===t)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")?i(n):n}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${t}`)}(e);let s="";return t&&(s="minus "),s+=m(r),l&&(s+=" komma "+function(e){let n="",i=0;for(;i<e.length&&"0"===e[i];)n&&(n+=" "),n+=c,i++;const t=e.slice(i);return t&&(n&&(n+=" "),n+=m(BigInt(t))),n}(l)),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||{});
+/*! n2words/de v3.1.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 i=e.indexOf(".");if(-1===i)return{isNegative:n,integerPart:BigInt(e)};const t=e.slice(0,i)||"0",r=e.slice(i+1);return{isNegative:n,integerPart:BigInt(t),decimalPart:r}}function i(e){const[n,i]=e.toLowerCase().split("e"),t=parseInt(i,10),r=n.indexOf("."),l=-1===r?n:n.slice(0,r)+n.slice(r+1),s=(-1===r?n.length:r)+t;return s>=l.length?l+"0".repeat(s-l.length):s<=0?"0."+"0".repeat(-s)+l:l.slice(0,s)+"."+l.slice(s)}const t=["","eins","zwei","drei","vier","fünf","sechs","sieben","acht","neun"],r="ein",l=["zehn","elf","zwölf","dreizehn","vierzehn","fünfzehn","sechzehn","siebzehn","achtzehn","neunzehn"],s=["","","zwanzig","dreißig","vierzig","fünfzig","sechzig","siebzig","achtzig","neunzig"],u=["tausend","Million","Milliarde","Billion","Billiarde","Trillion","Trilliarde","Quadrillion","Quadrilliarde"],o=["tausend","Millionen","Milliarden","Billionen","Billiarden","Trillionen","Trilliarden","Quadrillionen","Quadrilliarden"],c="hundert",a="null";function f(e){if(0===e)return"";const n=e%10,i=Math.trunc(e/10)%10,u=Math.trunc(e/100);let o="";return u>0&&(o+=(1===u?r:t[u])+c),1===i?o+=l[n]:i>=2&&n>0?o+=(1===n?r:t[n])+"und"+s[i]:i>=2?o+=s[i]:n>0&&(o+=t[n]),o}function d(e){if(0===e)return"";if(1===e)return r;const n=e%10,i=Math.trunc(e/10)%10,u=Math.trunc(e/100);let o="";return u>0&&(o+=(1===u?r:t[u])+c),1===i?o+=l[n]:i>=2&&n>0?o+=(1===n?r:t[n])+"und"+s[i]:i>=2?o+=s[i]:(n>0&&u>0||n>0)&&(o+=t[n]),o}function g(e){if(0n===e)return a;if(e<1000n)return f(Number(e));if(e<1000000n){const n=Number(e/1000n),i=Number(e%1000n);let t=d(n)+u[0];return i>0&&(t+=f(i)),t}return function(e){const n=e.toString(),i=n.length,t=[],r=i%3;let l=0;for(r>0&&(t.push(Number(n.slice(0,r))),l=r);l<i;)t.push(Number(n.slice(l,l+3))),l+=3;const s=[];let c=t.length-1;for(let e=0;e<t.length;e++){const n=t[e];if(0!==n)if(0===c)s.push({words:f(n),isScale:!1,scaleLevel:0});else if(1===c){const e=d(n);s.push({words:e+u[0],isScale:!1,scaleLevel:1})}else{let e;e=1===n?"eine":f(n);const i=1===n?u[c-1]:o[c-1];s.push({words:e,isScale:!1,scaleLevel:c}),s.push({words:i,isScale:!0,scaleLevel:c})}c--}return function(e){if(0===e.length)return a;let n="";for(let i=0;i<e.length;i++){const t=e[i],r=i>0?e[i-1]:null;i>0&&(t.isScale||r&&r.isScale)&&(n+=" "),n+=t.words}return n}(s)}(e)}e.de=function(e){const{isNegative:t,integerPart:r,decimalPart:l}=function(e){const t=typeof e;if("bigint"===t)return e<0n?{isNegative:!0,integerPart:-e}:{isNegative:!1,integerPart:e};if("number"===t){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")?i(n):n}(e))}if("string"===t)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")?i(n):n}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${t}`)}(e);let s="";return t&&(s="minus "),s+=g(r),l&&(s+=" komma "+function(e){let n="",i=0;for(;i<e.length&&"0"===e[i];)n&&(n+=" "),n+=a,i++;const t=e.slice(i);return t&&(n&&(n+=" "),n+=g(BigInt(t))),n}(l)),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=de.js.map

package/dist/languages/de.js.map

@@ -1 +1 @@
-{"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"}
+{"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 * Self-contained module with its own input validation, ready for subpath exports.\n *\n * Key features:\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 * - BigInt modulo for efficient segment extraction\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// Segment Building\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 *\n * @param {number} n - Number 0-999\n * @returns {string} German words for the segment\n */\nfunction buildSegment (n) {\n  if (n === 0) return ''\n\n  const ones = n % 10\n  const tens = Math.trunc(n / 10) % 10\n  const hundreds = Math.trunc(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 *\n * @param {number} n - Number 0-999\n * @returns {string} German words for thousand context\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.trunc(n / 10) % 10\n  const hundreds = Math.trunc(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    result += ONES[ones]\n  } else if (ones > 0) {\n    result += ONES[ones]\n  }\n\n  return result\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\n  if (n < 1000n) {\n    return buildSegment(Number(n))\n  }\n\n  // Fast path: numbers < 1,000,000\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 = buildSegmentForThousand(thousands) + SCALES[0]\n\n    if (remainder > 0) {\n      result += buildSegment(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: buildSegment(segment), isScale: false, scaleLevel: 0 })\n      } else if (scaleIndex === 1) {\n        // Thousands: compound without space\n        const segWords = buildSegmentForThousand(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 = buildSegment(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","trunc","hundreds","result","buildSegmentForThousand","integerToWords","Number","thousands","remainder","numStr","toString","len","segments","remainderLen","pos","push","parts","scaleIndex","i","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,CCtFA,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,OAeb,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,CASA,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,GAkBb,OAhBID,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,GAEvBJ,EAAO,KADhBK,GAAUf,EAAKU,IAKVK,CACT,CAYA,SAASE,EAAgBR,GACvB,GAAU,KAANA,EAAU,OAAOF,EAGrB,GAAIE,EAAI,MACN,OAAOD,EAAaU,OAAOT,IAI7B,GAAIA,EAAI,SAAY,CAClB,MAAMU,EAAYD,OAAOT,EAAI,OACvBW,EAAYF,OAAOT,EAAI,OAG7B,IAAIM,EAASC,EAAwBG,GAAaf,EAAO,GAMzD,OAJIgB,EAAY,IACdL,GAAUP,EAAaY,IAGlBL,CACT,CAGA,OASF,SAAgCN,GAC9B,MAAMY,EAASZ,EAAEa,WACXC,EAAMF,EAAOvB,OAGb0B,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAASG,KAAKT,OAAOG,EAAOvC,MAAM,EAAG2C,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAASG,KAAKT,OAAOG,EAAOvC,MAAM4C,EAAKA,EATrB,KAUlBA,GAVkB,EAcpB,MAAME,EAAQ,GACd,IAAIC,EAAaL,EAAS1B,OAAS,EAEnC,IAAK,IAAIgC,EAAI,EAAGA,EAAIN,EAAS1B,OAAQgC,IAAK,CACxC,MAAMC,EAAUP,EAASM,GAEzB,GAAgB,IAAZC,EACF,GAAmB,IAAfF,EAEFD,EAAMD,KAAK,CAAEK,MAAOxB,EAAauB,GAAUE,SAAS,EAAOC,WAAY,SAClE,GAAmB,IAAfL,EAAkB,CAE3B,MAAMM,EAAWnB,EAAwBe,GACzCH,EAAMD,KAAK,CAAEK,MAAOG,EAAW/B,EAAO,GAAI6B,SAAS,EAAOC,WAAY,GACxE,KAAO,CAEL,IAAIC,EAEFA,EADc,IAAZJ,EACS,OAEAvB,EAAauB,GAE1B,MAAMK,EAAwB,IAAZL,EAAgB3B,EAAOyB,EAAa,GAAKxB,EAAcwB,EAAa,GACtFD,EAAMD,KAAK,CAAEK,MAAOG,EAAUF,SAAS,EAAOC,WAAYL,IAC1DD,EAAMD,KAAK,CAAEK,MAAOI,EAAWH,SAAS,EAAMC,WAAYL,GAC5D,CAGFA,GACF,CAGA,OAUF,SAA0BD,GACxB,GAAqB,IAAjBA,EAAM9B,OAAc,OAAOS,EAE/B,IAAIQ,EAAS,GAEb,IAAK,IAAIe,EAAI,EAAGA,EAAIF,EAAM9B,OAAQgC,IAAK,CACrC,MAAMO,EAAOT,EAAME,GACbQ,EAAWR,EAAI,EAAIF,EAAME,EAAI,GAAK,KAKpCA,EAAI,IACaO,EAAKJ,SAAYK,GAAYA,EAASL,WAEvDlB,GAAU,KAIdA,GAAUsB,EAAKL,KACjB,CAEA,OAAOjB,CACT,CAjCSwB,CAAgBX,EACzB,CA9DSY,CAAsB/B,EAC/B,MA0IA,SAAkBgC,GAChB,MAAM5D,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GD7R5B,SAA4BqD,GACjC,MAAMC,SAAcD,EAGpB,GAAa,WAATC,EACF,OAAOD,EAAQ,GACX,CAAE5D,YAAY,EAAMI,aAAcwD,GAClC,CAAE5D,YAAY,EAAOI,YAAawD,GAIxC,GAAa,WAATC,EAAmB,CACrB,IAAKxB,OAAOyB,SAASF,GACnB,MAAM,IAAIG,MAAM,8DAElB,OAAI1B,OAAO2B,cAAcJ,GAChBA,EAAQ,EACX,CAAE5D,YAAY,EAAMI,YAAaC,QAAQuD,IACzC,CAAE5D,YAAY,EAAOI,YAAaC,OAAOuD,IAExC9D,EAgBX,SAAyB8D,GACvB,MAAM7D,EAAM6D,EAAMnB,WAClB,OAAQ1C,EAAIkE,SAAS,MAAQlE,EAAIkE,SAAS,KACtCzD,EAAyBT,GACzBA,CACN,CArB8BmE,CAAeN,GAC3C,CAGA,GAAa,WAATC,EACF,OAAO/D,EAqBX,SAA0B8D,GACxB,MAAMO,EAAUP,EAAMQ,OACtB,GAAuB,IAAnBD,EAAQlD,QAAgBoB,OAAOgC,MAAMhC,OAAO8B,IAC9C,MAAM,IAAIJ,MAAM,2BAA2BH,MAE7C,OAAQO,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9CzD,EAAyB2D,GACzBA,CACN,CA7B8BG,CAAgBV,IAG5C,MAAM,IAAIW,UACR,oEAAoEV,IAExE,CC8PmDW,CAAkBZ,GAEnE,IAAI1B,EAAS,GAYb,OAVIlC,IACFkC,EAASuC,UAGXvC,GAAUE,EAAehC,GAErBG,IACF2B,GAAU,UAjDd,SAA6B3B,GAC3B,IAAI2B,EAAS,GAGTe,EAAI,EACR,KAAOA,EAAI1C,EAAYU,QAA6B,MAAnBV,EAAY0C,IACvCf,IAAQA,GAAU,KACtBA,GAAUR,EACVuB,IAIF,MAAMV,EAAYhC,EAAYN,MAAMgD,GAMpC,OALIV,IACEL,IAAQA,GAAU,KACtBA,GAAUE,EAAe/B,OAAOkC,KAG3BL,CACT,CA8BwCwC,CAAmBnE,IAGlD2B,CACT"}

package/dist/languages/el.js

@@ -1,3 +1,3 @@
-/*! 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||{});
+/*! n2words/el v3.1.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("."),s=-1===i?t:t.slice(0,i)+t.slice(i+1),o=(-1===i?t.length:i)+r;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 r=["","ένα","δύο","τρία","τέσσερα","πέντε","έξι","επτά","οκτώ","εννέα"],i=["δέκα","έντεκα","δώδεκα","δεκατρία","δεκατέσσερα","δεκαπέντε","δεκαέξι","δεκαεπτά","δεκαοκτώ","δεκαεννέα"],s=["","","είκοσι","τριάντα","σαράντα","πενήντα","εξήντα","εβδομήντα","ογδόντα","ενενήντα"],o=["","εκατό","διακόσια","τριακόσια","τετρακόσια","πεντακόσια","εξακόσια","επτακόσια","οκτακόσια","εννιακόσια"],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(o[u]);const f=e%100;return 0===f||c.push(f<10?r[t]:f<20?i[t]:0===t?s[n]:s[n]+" "+r[t]),c.join(" ")}e.el=function(e){const{isNegative:i,integerPart:s,decimalPart:o}=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 a="";return i&&(a="μείον "),a+=function(e){if(0n===e)return c;if(e<1000n)return l(Number(e));if(e<1000000n){const t=Number(e/1000n),n=Number(e%1000n);let r;return r=1===t?u:l(t)+" "+u,n>0&&(r+=" "+l(n)),r}return function(e){const t=e.toString(),n=t.length,r=[],i=n%3;let s=0;for(i>0&&(r.push(Number(t.slice(0,i))),s=i);s<n;)r.push(Number(t.slice(s,s+3))),s+=3;const o=[];let c=r.length-1;for(let e=0;e<r.length;e++){const t=r[e];if(0!==t){const e=l(t);if(0===c)o.push(e);else if(1===c)o.push(1===t?u:e+" "+u);else{const n=f[c-2];o.push(1===t?n:e+" "+n)}}c--}return o.join(" ")}(e)}(s),o&&(a+=" κόμμα "+function(e){const t=[];for(const n of e){const e=parseInt(n,10);t.push(0===e?c:r[e])}return t.join(" ")}(o)),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=el.js.map

package/dist/languages/el.js.map

@@ -1 +1 @@
-{"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"}
+{"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 * Self-contained module with its own input validation, ready for subpath exports.\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// Segment Building\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// ============================================================================\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 buildSegment(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 = buildSegment(thousands) + ' ' + THOUSAND\n    }\n\n    if (remainder > 0) {\n      result += ' ' + buildSegment(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 = buildSegment(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","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","i","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,MA4IA,SAAkBC,GAChB,MAAMrC,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GDzM5B,SAA4B8B,GACjC,MAAMC,SAAcD,EAGpB,GAAa,WAATC,EACF,OAAOD,EAAQ,GACX,CAAErC,YAAY,EAAMI,aAAciC,GAClC,CAAErC,YAAY,EAAOI,YAAaiC,GAIxC,GAAa,WAATC,EAAmB,CACrB,IAAKC,OAAOC,SAASH,GACnB,MAAM,IAAII,MAAM,8DAElB,OAAIF,OAAOG,cAAcL,GAChBA,EAAQ,EACX,CAAErC,YAAY,EAAMI,YAAaC,QAAQgC,IACzC,CAAErC,YAAY,EAAOI,YAAaC,OAAOgC,IAExCvC,EAgBX,SAAyBuC,GACvB,MAAMtC,EAAMsC,EAAMM,WAClB,OAAQ5C,EAAI6C,SAAS,MAAQ7C,EAAI6C,SAAS,KACtCpC,EAAyBT,GACzBA,CACN,CArB8B8C,CAAeR,GAC3C,CAGA,GAAa,WAATC,EACF,OAAOxC,EAqBX,SAA0BuC,GACxB,MAAMS,EAAUT,EAAMU,OACtB,GAAuB,IAAnBD,EAAQ7B,QAAgBsB,OAAOS,MAAMT,OAAOO,IAC9C,MAAM,IAAIL,MAAM,2BAA2BJ,MAE7C,OAAQS,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9CpC,EAAyBsC,GACzBA,CACN,CA7B8BG,CAAgBZ,IAG5C,MAAM,IAAIa,UACR,oEAAoEZ,IAExE,CC0KmDa,CAAkBd,GAEnE,IAAIe,EAAS,GAYb,OAVIpD,IACFoD,EAASC,UAGXD,GAzIF,SAAyBzB,GACvB,GAAU,KAANA,EAAU,OAAOH,EAGrB,GAAIG,EAAI,MACN,OAAOD,EAAaa,OAAOZ,IAI7B,GAAIA,EAAI,SAAY,CAClB,MAAM2B,EAAYf,OAAOZ,EAAI,OACvB4B,EAAYhB,OAAOZ,EAAI,OAG7B,IAAIyB,EAWJ,OATEA,EADgB,IAAdE,EACO/B,EAEAG,EAAa4B,GAAa,IAAM/B,EAGvCgC,EAAY,IACdH,GAAU,IAAM1B,EAAa6B,IAGxBH,CACT,CAGA,OASF,SAAgCzB,GAC9B,MAAM6B,EAAS7B,EAAEgB,WACXc,EAAMD,EAAOvC,OAGbyC,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAASxB,KAAKK,OAAOiB,EAAOvD,MAAM,EAAG0D,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAASxB,KAAKK,OAAOiB,EAAOvD,MAAM2D,EAAKA,EATrB,KAUlBA,GAVkB,EAcpB,MAAM3B,EAAQ,GACd,IAAI4B,EAAaH,EAASzC,OAAS,EAEnC,IAAK,IAAI6C,EAAI,EAAGA,EAAIJ,EAASzC,OAAQ6C,IAAK,CACxC,MAAMC,EAAUL,EAASI,GAEzB,GAAgB,IAAZC,EAAe,CACjB,MAAMC,EAActC,EAAaqC,GAEjC,GAAmB,IAAfF,EAEF5B,EAAMC,KAAK8B,QACN,GAAmB,IAAfH,EAGP5B,EAAMC,KADQ,IAAZ6B,EACSxC,EAEAyC,EAAc,IAAMzC,OAE5B,CAEL,MAAM0C,EAAYxC,EAAOoC,EAAa,GAEpC5B,EAAMC,KADQ,IAAZ6B,EACSE,EAEAD,EAAc,IAAMC,EAEnC,CACF,CAEAJ,GACF,CAEA,OAAO5B,EAAMG,KAAK,IACpB,CA/DS8B,CAAsBvC,EAC/B,CA2GYwC,CAAe/D,GAErBG,IACF6C,GAAU,UAxCd,SAA6B7C,GAC3B,MAAM0B,EAAQ,GAEd,IAAK,MAAMmC,KAAS7D,EAAa,CAC/B,MAAM8D,EAAIvD,SAASsD,EAAO,IAExBnC,EAAMC,KADE,IAANmC,EACS7C,EAEAL,EAAKkD,GAEpB,CAEA,OAAOpC,EAAMG,KAAK,IACpB,CA2BwCkC,CAAmB/D,IAGlD6C,CACT"}

package/dist/languages/en.js

@@ -1,3 +1,3 @@
-/*! 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||{});
+/*! n2words/en v3.1.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="hundred",l="zero",f={word:"",hasHundred:!1};function d(e){if(0===e)return f.word="",f.hasHundred=!1,f;const n=e%10,t=Math.trunc(e/10)%10,s=Math.trunc(e/100);let l="";return 1===t?l=r[n]:t>=2?l=n>0?o[t]+"-"+i[n]:o[t]:n>0&&(l=i[n]),s>0?(f.word=l?i[s]+" "+u+" and "+l:i[s]+" "+u,f.hasHundred=!0):(f.word=l,f.hasHundred=!1),f}function c(e){if(0n===e)return l;if(e<1000n)return d(Number(e)).word;if(e<1000000n){const n=Number(e/1000n),t=Number(e%1000n),{word:i}=d(n);let r=i+" "+s[0];if(t>0){const{word:e,hasHundred:n}=d(t);r+=n?" "+e:" and "+e}return r}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];if(0===t)continue;const{word:u,hasHundred:l}=d(t);r&&e===i&&o&&!l&&(r+=" and"),r&&(r+=" "),r+=u,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+=l,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 +1 @@
-{"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"}
+{"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\n *\n * Self-contained module with its own input validation, ready for subpath exports.\n *\n * Key features:\n * - Western numbering system (thousand, million, billion)\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 * - BigInt modulo for efficient segment extraction\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// Segment Building\n// ============================================================================\n\n// Reusable result object to avoid allocation per call\nconst segmentResult = { word: '', hasHundred: false }\n\n/**\n * Builds words for a 0-999 segment.\n *\n * @param {number} n - Number 0-999\n * @returns {{ word: string, hasHundred: boolean }}\n */\nfunction buildSegment (n) {\n  if (n === 0) {\n    segmentResult.word = ''\n    segmentResult.hasHundred = false\n    return segmentResult\n  }\n\n  const ones = n % 10\n  const tens = Math.trunc(n / 10) % 10\n  const hundreds = Math.trunc(n / 100)\n\n  // Build tens-ones part first\n  let tensOnes = ''\n  if (tens === 1) {\n    tensOnes = TEENS[ones]\n  } else if (tens >= 2) {\n    tensOnes = ones > 0 ? TENS[tens] + '-' + ONES[ones] : TENS[tens]\n  } else if (ones > 0) {\n    tensOnes = ONES[ones]\n  }\n\n  // Hundreds place\n  if (hundreds > 0) {\n    if (tensOnes) {\n      segmentResult.word = ONES[hundreds] + ' ' + HUNDRED + ' and ' + tensOnes\n    } else {\n      segmentResult.word = ONES[hundreds] + ' ' + HUNDRED\n    }\n    segmentResult.hasHundred = true\n  } else {\n    segmentResult.word = tensOnes\n    segmentResult.hasHundred = false\n  }\n\n  return segmentResult\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\n  if (n < 1000n) {\n    return buildSegment(Number(n)).word\n  }\n\n  // Fast path: numbers < 1,000,000\n  if (n < 1_000_000n) {\n    const thousands = Number(n / 1000n)\n    const remainder = Number(n % 1000n)\n\n    const { word: thousandsWord } = buildSegment(thousands)\n    let result = thousandsWord + ' ' + SCALES[0]\n\n    if (remainder > 0) {\n      const { word: remainderWord, hasHundred } = buildSegment(remainder)\n      result += hasHundred ? ' ' + remainderWord : ' and ' + remainderWord\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\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 (process from most-significant to least)\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 { word, hasHundred } = buildSegment(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 += word\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","HUNDRED","ZERO","segmentResult","word","hasHundred","buildSegment","n","ones","tens","Math","trunc","hundreds","tensOnes","integerToWords","Number","thousands","remainder","thousandsWord","result","remainderWord","segments","temp","push","firstNonZeroIdx","i","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,CCxFA,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,aAElHC,EAAU,UACVC,EAAO,OASPC,EAAgB,CAAEC,KAAM,GAAIC,YAAY,GAQ9C,SAASC,EAAcC,GACrB,GAAU,IAANA,EAGF,OAFAJ,EAAcC,KAAO,GACrBD,EAAcE,YAAa,EACpBF,EAGT,MAAMK,EAAOD,EAAI,GACXE,EAAOC,KAAKC,MAAMJ,EAAI,IAAM,GAC5BK,EAAWF,KAAKC,MAAMJ,EAAI,KAGhC,IAAIM,EAAW,GAsBf,OArBa,IAATJ,EACFI,EAAWf,EAAMU,GACRC,GAAQ,EACjBI,EAAWL,EAAO,EAAIT,EAAKU,GAAQ,IAAMZ,EAAKW,GAAQT,EAAKU,GAClDD,EAAO,IAChBK,EAAWhB,EAAKW,IAIdI,EAAW,GAEXT,EAAcC,KADZS,EACmBhB,EAAKe,GAAY,IAAMX,EAAU,QAAUY,EAE3ChB,EAAKe,GAAY,IAAMX,EAE9CE,EAAcE,YAAa,IAE3BF,EAAcC,KAAOS,EACrBV,EAAcE,YAAa,GAGtBF,CACT,CAYA,SAASW,EAAgBP,GACvB,GAAU,KAANA,EAAU,OAAOL,EAGrB,GAAIK,EAAI,MACN,OAAOD,EAAaS,OAAOR,IAAIH,KAIjC,GAAIG,EAAI,SAAY,CAClB,MAAMS,EAAYD,OAAOR,EAAI,OACvBU,EAAYF,OAAOR,EAAI,QAErBH,KAAMc,GAAkBZ,EAAaU,GAC7C,IAAIG,EAASD,EAAgB,IAAMlB,EAAO,GAE1C,GAAIiB,EAAY,EAAG,CACjB,MAAQb,KAAMgB,EAAaf,WAAEA,GAAeC,EAAaW,GACzDE,GAAUd,EAAa,IAAMe,EAAgB,QAAUA,CACzD,CAEA,OAAOD,CACT,CAGA,OAUF,SAAgCZ,GAG9B,MAAMc,EAAW,GACjB,IAAIC,EAAOf,EACX,KAAOe,EAAO,IACZD,EAASE,KAAKR,OAAOO,EAAO,QAC5BA,GAAc,MAIhB,IAAIE,GAAkB,EACtB,IAAK,IAAIC,EAAI,EAAGA,EAAIJ,EAAS1B,OAAQ8B,IACnC,GAAoB,IAAhBJ,EAASI,GAAU,CACrBD,EAAkBC,EAClB,KACF,CAIF,IAAIN,EAAS,GACTO,GAAe,EAEnB,IAAK,IAAID,EAAIJ,EAAS1B,OAAS,EAAG8B,GAAK,EAAGA,IAAK,CAC7C,MAAME,EAAUN,EAASI,GACzB,GAAgB,IAAZE,EAAe,SAEnB,MAAMvB,KAAEA,EAAIC,WAAEA,GAAeC,EAAaqB,GAItCR,GAHmBM,IAAMD,GAGEE,IAAiBrB,IAC9Cc,GAAU,QAIRA,IAAQA,GAAU,KACtBA,GAAUf,EAGNqB,EAAI,GACNN,GAAU,IAAMnB,EAAOyB,EAAI,GAC3BC,GAAe,GAEfA,GAAe,CAEnB,CAEA,OAAOP,CACT,CA3DSS,CAAsBrB,EAC/B,MAuGA,SAAkBsB,GAChB,MAAMnD,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GD/M5B,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,IAAKf,OAAOgB,SAASF,GACnB,MAAM,IAAIG,MAAM,8DAElB,OAAIjB,OAAOkB,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,QAAgBoB,OAAOwB,MAAMxB,OAAOsB,IAC9C,MAAM,IAAIL,MAAM,2BAA2BH,MAE7C,OAAQQ,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9CjD,EAAyBmD,GACzBA,CACN,CA7B8BG,CAAgBX,IAG5C,MAAM,IAAIY,UACR,oEAAoEX,IAExE,CCgLmDY,CAAkBb,GAEnE,IAAIV,EAAS,GAYb,OAVIzC,IACFyC,EAASwB,UAGXxB,GAAUL,EAAehC,GAErBG,IACFkC,GAAU,UAjDd,SAA6BlC,GAC3B,IAAIkC,EAAS,GAGTM,EAAI,EACR,KAAOA,EAAIxC,EAAYU,QAA6B,MAAnBV,EAAYwC,IACvCN,IAAQA,GAAU,KACtBA,GAAUjB,EACVuB,IAIF,MAAMR,EAAYhC,EAAYN,MAAM8C,GAMpC,OALIR,IACEE,IAAQA,GAAU,KACtBA,GAAUL,EAAe/B,OAAOkC,KAG3BE,CACT,CA8BwCyB,CAAmB3D,IAGlDkC,CACT"}

package/dist/languages/es.js

@@ -1,3 +1,3 @@
-/*! 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||{});
+/*! n2words/es v3.1.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(" ")}function b(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 m(e,n){if(0n===e)return g;if(e<1000n)return p(Number(e),n);if(e<1000000n){const t=Number(e/1000n),i=Number(e%1000n);let r;if(1===t)r=v;else{const e=p(t,!1);r="uno"===e||"una"===e?v:e+" "+v}return i>0&&(r+=" "+p(i,n)),r}return function(e,n){const t=[];let i=e;for(;i>0n;)t.push(i%1000n),i/=1000n;let r="";for(let e=t.length-1;e>=0;e--){const i=t[e];if(0n===i)continue;const o=e>0?b(e,i):"";r&&(r+=" "),r+=0===e?p(Number(i),n):1===e?1n===i?v:p(Number(i),!1)+" "+o:e%2==1?1n===i?o:p(Number(i),!1)+" "+o:1n===i?"un "+o:p(Number(i),!1)+" "+o}return r}(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+=m(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+=m(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