n2words 3.0.0 → 4.0.0

package/dist/languages/pa.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"pa.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/pa.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 * Punjabi language converter - Functional Implementation\n *\n * Self-contained converter for South Asian numbering.\n *\n * Key features:\n * - Indian numbering system (ਹਜ਼ਾਰ, ਲੱਖ, ਕਰੋੜ)\n * - Gurmukhi script\n * - 3-2-2 grouping pattern (last 3 digits, then groups of 2)\n * - Complete word forms for 0-99\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\n\n// ============================================================================\n// Vocabulary\n// ============================================================================\n\nconst ZERO = 'ਸਿਫ਼ਰ'\nconst NEGATIVE = 'ਮਾਇਨਸ'\nconst DECIMAL_SEP = 'ਦਸ਼ਮਲਵ'\nconst HUNDRED = 'ਸੌ'\n\nconst BELOW_HUNDRED = [\n  'ਸਿਫ਼ਰ', 'ਇੱਕ', 'ਦੋ', 'ਤਿੰਨ', 'ਚਾਰ', 'ਪੰਜ', 'ਛੇ', 'ਸੱਤ', 'ਅੱਠ', 'ਨੌਂ',\n  'ਦੱਸ', 'ਗਿਆਰਾਂ', 'ਬਾਰਾਂ', 'ਤੇਰਾਂ', 'ਚੌਦਾਂ', 'ਪੰਦਰਾਂ', 'ਸੋਲਾਂ', 'ਸਤਾਰਾਂ', 'ਅਠਾਰਾਂ', 'ਉੱਨੀ',\n  'ਵੀਹ', 'ਇੱਕੀ', 'ਬਾਈ', 'ਤੇਈ', 'ਚੌਬੀ', 'ਪੱਚੀ', 'ਛੱਬੀ', 'ਸਤਾਈ', 'ਅਠਾਈ', 'ਉਨੱਤੀ',\n  'ਤੀਹ', 'ਇਕੱਤੀ', 'ਬੱਤੀ', 'ਤੇਤੀ', 'ਚੌਂਤੀ', 'ਪੈਂਤੀ', 'ਛੱਤੀ', 'ਸੈਂਤੀ', 'ਅਠੱਤੀ', 'ਉਨਤਾਲੀ',\n  'ਚਾਲੀ', 'ਇਕਤਾਲੀ', 'ਬਿਆਲੀ', 'ਤਿਰਤਾਲੀ', 'ਚੁਵਾਲੀ', 'ਪੰਤਾਲੀ', 'ਛਿਆਲੀ', 'ਸੈਂਤਾਲੀ', 'ਅਠਤਾਲੀ', 'ਉਨੰਜਾ',\n  'ਪੰਜਾਹ', 'ਇਕਵੰਜਾ', 'ਬਵੰਜਾ', 'ਤਰਵੰਜਾ', 'ਚੁਰਵੰਜਾ', 'ਪੰਜਵੰਜਾ', 'ਛਪੰਜਾ', 'ਸੱਤਵੰਜਾ', 'ਅਠਵੰਜਾ', 'ਉਨਾਹਠ',\n  'ਸੱਠ', 'ਇਕਾਹਠ', 'ਬਾਹਠ', 'ਤਰਸਠ', 'ਚੌਂਸਠ', 'ਪੈਂਸਠ', 'ਛਿਆਸਠ', 'ਸੜਸਠ', 'ਅੜਸਠ', 'ਉਣਹੱਤਰ',\n  'ਸਤੱਰ', 'ਇਕਹੱਤਰ', 'ਬਹੱਤਰ', 'ਤਹੱਤਰ', 'ਚੌਹੱਤਰ', 'ਪੰਝਹੱਤਰ', 'ਛਿਹੱਤਰ', 'ਸਤੱਤਰ', 'ਅਠੱਤਰ', 'ਉਨਾਸੀ',\n  'ਅੱਸੀ', 'ਇਕਿਆਸੀ', 'ਬਿਆਸੀ', 'ਤਰਿਆਸੀ', 'ਚੌਰਿਆਸੀ', 'ਪਚਾਸੀ', 'ਛਿਆਸੀ', 'ਸੱਤਾਸੀ', 'ਅਠਾਸੀ', 'ਨਵਾਸੀ',\n  'ਨੱਬੇ', 'ਇਕਾਨਵੇਂ', 'ਬਾਨਵੇਂ', 'ਤਰਾਨਵੇਂ', 'ਚੁਰਾਨਵੇਂ', 'ਪੰਚਾਨਵੇਂ', 'ਛਿਆਨਵੇਂ', 'ਸਤਾਨਵੇਂ', 'ਅਠਾਨਵੇਂ', 'ਨਿਨਾਨਵੇਂ'\n]\n\n// Scale words: index 0 = units (empty), 1 = thousand, 2 = lakh, 3 = crore, etc.\nconst SCALE_WORDS = ['', 'ਹਜ਼ਾਰ', 'ਲੱਖ', 'ਕਰੋੜ', 'ਅਰਬ', 'ਖਰਬ', 'ਨੀਲ', 'ਪਦਮ', 'ਸ਼ੰਖ']\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\n/**\n * Converts 0-999 to Punjabi words.\n */\nfunction segmentToWords (n) {\n  if (n === 0) return ''\n  if (n < 100) return BELOW_HUNDRED[n]\n\n  const hundreds = Math.trunc(n / 100)\n  const remainder = n % 100\n\n  if (remainder === 0) {\n    return BELOW_HUNDRED[hundreds] + ' ' + HUNDRED\n  }\n  return BELOW_HUNDRED[hundreds] + ' ' + HUNDRED + ' ' + BELOW_HUNDRED[remainder]\n}\n\n/**\n * Converts a non-negative integer to Punjabi words.\n * Uses recursive approach for Indian 3-2-2 grouping pattern.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @returns {string} Punjabi 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 segmentToWords(Number(n))\n  }\n\n  return buildLargeNumberWords(n, 0)\n}\n\n/**\n * Recursively builds words for numbers >= 1000.\n * Indian grouping: first 3 digits, then 2-digit groups.\n *\n * @param {bigint} n - Number to convert\n * @param {number} scale - Current scale index (0=units, 1=thousands, etc.)\n * @returns {string} Punjabi words\n */\nfunction buildLargeNumberWords (n, scale) {\n  if (n === 0n) return ''\n\n  // Determine divisor: 1000 for first split, 100 for rest\n  const divisor = scale === 0 ? 1000n : 100n\n  const segment = Number(n % divisor)\n  const rest = n / divisor\n\n  // Build higher segments first (recursive)\n  let result = ''\n  if (rest > 0n) {\n    result = buildLargeNumberWords(rest, scale + 1)\n  }\n\n  // Add current segment\n  if (segment > 0) {\n    if (result) result += ' '\n\n    if (scale === 0) {\n      // Units segment (0-999)\n      result += segmentToWords(segment)\n    } else {\n      // Scale segments (0-99)\n      result += BELOW_HUNDRED[segment] + ' ' + SCALE_WORDS[scale]\n    }\n  }\n\n  return result\n}\n\nfunction decimalPartToWords (decimalPart) {\n  let result = ''\n  let i = 0\n\n  while (i < decimalPart.length && decimalPart[i] === '0') {\n    if (result) result += ' '\n    result += ZERO\n    i++\n  }\n\n  const remainder = decimalPart.slice(i)\n  if (remainder) {\n    if (result) result += ' '\n    result += integerToWords(BigInt(remainder))\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to Punjabi words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @returns {string} The number in Punjabi words\n */\nfunction toWords (value) {\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Exports\n// ============================================================================\n\nexport { toWords }\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ZERO","BELOW_HUNDRED","SCALE_WORDS","segmentToWords","n","hundreds","Math","trunc","remainder","integerToWords","Number","buildLargeNumberWords","scale","divisor","segment","rest","result","value","type","isFinite","Error","isSafeInteger","toString","includes","numberToString","trimmed","trim","isNaN","normalizeString","TypeError","parseNumericValue","NEGATIVE","i","decimalPartToWords"],"mappings":";0CAwEA,SAASA,EAAoBC,GAC3B,MAAMC,EAAwB,MAAXD,EAAI,GACnBC,IAAYD,EAAMA,EAAIE,MAAM,IAEhC,MAAMC,EAAWH,EAAII,QAAQ,KAC7B,IAAiB,IAAbD,EACF,MAAO,CAAEF,aAAYI,YAAaC,OAAON,IAG3C,MAAMO,EAAaP,EAAIE,MAAM,EAAGC,IAAa,IACvCK,EAAcR,EAAIE,MAAMC,EAAW,GACzC,MAAO,CAAEF,aAAYI,YAAaC,OAAOC,GAAaC,cACxD,CAKA,SAASC,EAA0BT,GACjC,MAAOU,EAAUC,GAAUX,EAAIY,cAAcC,MAAM,KAC7CC,EAAMC,SAASJ,EAAQ,IAEvBR,EAAWO,EAASN,QAAQ,KAC5BY,OAASb,EACXO,EACAA,EAASR,MAAM,EAAGC,GAAYO,EAASR,MAAMC,EAAW,GAEtDc,IAD6B,IAAbd,EAAkBO,EAASQ,OAASf,GACnBW,EAEvC,OAAIG,GAAkBD,EAAOE,OACpBF,EAAS,IAAIG,OAAOF,EAAiBD,EAAOE,QAEjDD,GAAkB,EACb,KAAO,IAAIE,QAAQF,GAAkBD,EAEvCA,EAAOd,MAAM,EAAGe,GAAkB,IAAMD,EAAOd,MAAMe,EAC9D,CCzFA,MAAMG,EAAO,QAKPC,EAAgB,CACpB,QAAS,MAAO,KAAM,OAAQ,MAAO,MAAO,KAAM,MAAO,MAAO,MAChE,MAAO,SAAU,QAAS,QAAS,QAAS,SAAU,QAAS,SAAU,SAAU,OACnF,MAAO,OAAQ,MAAO,MAAO,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,QACrE,MAAO,QAAS,OAAQ,OAAQ,QAAS,QAAS,OAAQ,QAAS,QAAS,SAC5E,OAAQ,SAAU,QAAS,UAAW,SAAU,SAAU,QAAS,UAAW,SAAU,QACxF,QAAS,SAAU,QAAS,SAAU,UAAW,UAAW,QAAS,UAAW,SAAU,QAC1F,MAAO,QAAS,OAAQ,OAAQ,QAAS,QAAS,QAAS,OAAQ,OAAQ,SAC3E,OAAQ,SAAU,QAAS,QAAS,SAAU,UAAW,SAAU,QAAS,QAAS,QACrF,OAAQ,SAAU,QAAS,SAAU,UAAW,QAAS,QAAS,SAAU,QAAS,QACrF,OAAQ,UAAW,SAAU,UAAW,WAAY,WAAY,UAAW,UAAW,UAAW,YAI7FC,EAAc,CAAC,GAAI,QAAS,MAAO,OAAQ,MAAO,MAAO,MAAO,MAAO,QAS7E,SAASC,EAAgBC,GACvB,GAAU,IAANA,EAAS,MAAO,GACpB,GAAIA,EAAI,IAAK,OAAOH,EAAcG,GAElC,MAAMC,EAAWC,KAAKC,MAAMH,EAAI,KAC1BI,EAAYJ,EAAI,IAEtB,OAAkB,IAAdI,EACKP,EAAcI,GAAdJ,MAEFA,EAAcI,GAAdJ,OAAgDA,EAAcO,EACvE,CASA,SAASC,EAAgBL,GACvB,OAAU,KAANA,EAAiBJ,EAGjBI,EAAI,MACCD,EAAeO,OAAON,IAGxBO,EAAsBP,EAAG,EAClC,CAUA,SAASO,EAAuBP,EAAGQ,GACjC,GAAU,KAANR,EAAU,MAAO,GAGrB,MAAMS,EAAoB,IAAVD,EAAc,MAAQ,KAChCE,EAAUJ,OAAON,EAAIS,GACrBE,EAAOX,EAAIS,EAGjB,IAAIG,EAAS,GAkBb,OAjBID,EAAO,KACTC,EAASL,EAAsBI,EAAMH,EAAQ,IAI3CE,EAAU,IACRE,IAAQA,GAAU,KAIpBA,GAFY,IAAVJ,EAEQT,EAAeW,GAGfb,EAAca,GAAW,IAAMZ,EAAYU,IAIlDI,CACT,MA2BA,SAAkBC,GAChB,MAAMpC,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GDhI5B,SAA4B6B,GACjC,MAAMC,SAAcD,EAGpB,GAAa,WAATC,EACF,OAAOD,EAAQ,GACX,CAAEpC,YAAY,EAAMI,aAAcgC,GAClC,CAAEpC,YAAY,EAAOI,YAAagC,GAIxC,GAAa,WAATC,EAAmB,CACrB,IAAKR,OAAOS,SAASF,GACnB,MAAM,IAAIG,MAAM,8DAElB,OAAIV,OAAOW,cAAcJ,GAChBA,EAAQ,EACX,CAAEpC,YAAY,EAAMI,YAAaC,QAAQ+B,IACzC,CAAEpC,YAAY,EAAOI,YAAaC,OAAO+B,IAExCtC,EAgBX,SAAyBsC,GACvB,MAAMrC,EAAMqC,EAAMK,WAClB,OAAQ1C,EAAI2C,SAAS,MAAQ3C,EAAI2C,SAAS,KACtClC,EAAyBT,GACzBA,CACN,CArB8B4C,CAAeP,GAC3C,CAGA,GAAa,WAATC,EACF,OAAOvC,EAqBX,SAA0BsC,GACxB,MAAMQ,EAAUR,EAAMS,OACtB,GAAuB,IAAnBD,EAAQ3B,QAAgBY,OAAOiB,MAAMjB,OAAOe,IAC9C,MAAM,IAAIL,MAAM,2BAA2BH,MAE7C,OAAQQ,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9ClC,EAAyBoC,GACzBA,CACN,CA7B8BG,CAAgBX,IAG5C,MAAM,IAAIY,UACR,oEAAoEX,IAExE,CCiGmDY,CAAkBb,GAEnE,IAAID,EAAS,GAYb,OAVInC,IACFmC,EAASe,UAGXf,GAAUP,EAAexB,GAErBG,IACF4B,GAAU,WArCd,SAA6B5B,GAC3B,IAAI4B,EAAS,GACTgB,EAAI,EAER,KAAOA,EAAI5C,EAAYU,QAA6B,MAAnBV,EAAY4C,IACvChB,IAAQA,GAAU,KACtBA,GAAUhB,EACVgC,IAGF,MAAMxB,EAAYpB,EAAYN,MAAMkD,GAMpC,OALIxB,IACEQ,IAAQA,GAAU,KACtBA,GAAUP,EAAevB,OAAOsB,KAG3BQ,CACT,CAoBwCiB,CAAmB7C,IAGlD4B,CACT"}

package/dist/languages/pl.js

@@ -1,3 +0,0 @@
-/*! n2words/pl v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var e,i;e=this,i=function(e){"use strict";function i(e){const i="-"===e[0];i&&(e=e.slice(1));const n=e.indexOf(".");if(-1===n)return{isNegative:i,integerPart:BigInt(e)};const t=e.slice(0,n)||"0",r=e.slice(n+1);return{isNegative:i,integerPart:BigInt(t),decimalPart:r}}function n(e){const[i,n]=e.toLowerCase().split("e"),t=parseInt(n,10),r=i.indexOf("."),o=-1===r?i:i.slice(0,r)+i.slice(r+1),s=(-1===r?i.length:r)+t;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 t=["","jeden","dwa","trzy","cztery","pięć","sześć","siedem","osiem","dziewięć"],r=["","jedna","dwie","trzy","cztery","pięć","sześć","siedem","osiem","dziewięć"],o=["dziesięć","jedenaście","dwanaście","trzynaście","czternaście","piętnaście","szesnaście","siedemnaście","osiemnaście","dziewiętnaście"],s=["","","dwadzieścia","trzydzieści","czterdzieści","pięćdziesiąt","sześćdziesiąt","siedemdziesiąt","osiemdziesiąt","dziewięćdziesiąt"],c=["","sto","dwieście","trzysta","czterysta","pięćset","sześćset","siedemset","osiemset","dziewięćset"],u={1:["tysiąc","tysiące","tysięcy"],2:["milion","miliony","milionów"],3:["miliard","miliardy","miliardów"],4:["bilion","biliony","bilionów"],5:["biliard","biliardy","biliardów"],6:["trylion","tryliony","trylionów"],7:["tryliard","tryliardy","tryliardów"],8:["kwadrylion","kwadryliony","kwadrylionów"],9:["kwaryliard","kwadryliardy","kwadryliardów"],10:["kwintylion","kwintyliony","kwintylionów"]},a="zero";function l(e){if(0===e)return"";const i=e%10,n=Math.floor(e/10)%10,r=Math.floor(e/100),u=[];return r>0&&u.push(c[r]),1===n?u.push(o[i]):(n>=2&&u.push(s[n]),i>0&&u.push(t[i])),u.join(" ")}function d(e){if(0===e)return"";const i=e%10,n=Math.floor(e/10)%10,t=Math.floor(e/100),u=[];return t>0&&u.push(c[t]),1===n?u.push(o[i]):(n>=2&&u.push(s[n]),i>0&&u.push(r[i])),u.join(" ")}const f=new Array(1e3),y=new Array(1e3);for(let e=0;e<1e3;e++)f[e]=l(e),y[e]=d(e);function p(e,i){if(1n===e)return i[0];const n=e%10n,t=e%100n;return n>=2n&&n<=4n&&(t<10n||t>20n)?i[1]:i[2]}function w(e,i={}){if(0n===e)return a;if(e<1000n)return("feminine"===i.gender?y:f)[Number(e)];if(e<1000000n){const i=Number(e/1000n),n=Number(e%1000n),t=p(BigInt(i),u[1]);let r;return r=1===i?t:f[i]+" "+t,n>0&&(r+=" "+f[n]),r}return function(e){const i=[];let n=e;for(;n>0n;)i.push(n%1000n),n/=1000n;let t="";for(let e=i.length-1;e>=0;e--){const n=i[e];if(0n===n)continue;const r=f[Number(n)];if(t&&(t+=" "),0===e)t+=r;else{const i=u[e];if(i){const e=p(n,i);t+=1n===n?e:r+" "+e}}}return t}(e)}e.pl=function(e,t){t=function(e){if(void 0===e)return{};if(function(e){if(null===e||"object"!=typeof e)return!1;const i=Object.getPrototypeOf(e);return null===i||i===Object.prototype}(e))return e;throw new TypeError("Invalid options: expected plain object or undefined, got "+typeof e)}(t);const{isNegative:r,integerPart:o,decimalPart:s}=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)}:i(function(e){const i=e.toString();return i.includes("e")||i.includes("E")?n(i):i}(e))}if("string"===t)return i(function(e){const i=e.trim();if(0===i.length||Number.isNaN(Number(i)))throw new Error(`Invalid number format: "${e}"`);return i.includes("e")||i.includes("E")?n(i):i}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${t}`)}(e);let c="";return r&&(c="minus "),c+=w(o,t),s&&(c+=" przecinek "+function(e,i){let n="",t=0;for(;t<e.length&&"0"===e[t];)n&&(n+=" "),n+=a,t++;const r=e.slice(t);return r&&(n&&(n+=" "),n+=w(BigInt(r),i)),n}(s,t)),c}},"object"==typeof exports&&"undefined"!=typeof module?i(exports):"function"==typeof define&&define.amd?define(["exports"],i):i((e="undefined"!=typeof globalThis?globalThis:e||self).n2words=e.n2words||{});
-//# sourceMappingURL=pl.js.map

package/dist/languages/pl.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"pl.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/pl.js","../../lib/utils/validate-options.js","../../lib/utils/is-plain-object.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * Polish 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 * Polish-specific rules (handled in precomputation):\n * - Three-form pluralization: 1 = singular, 2-4 = few, 5+ = many\n * - Gender agreement (masculine/feminine for numbers < 1000)\n * - Omit \"jeden\" before scale words (tysiąc, milion, etc.)\n * - Irregular hundreds: dwieście, trzysta, czterysta, pięćset...\n * - Long scale with -ard forms: miliard, biliard, tryliard\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\nimport { validateOptions } from '../utils/validate-options.js'\n\n// ============================================================================\n// Vocabulary (module-level constants)\n// ============================================================================\n\nconst ONES_MASC = ['', 'jeden', 'dwa', 'trzy', 'cztery', 'pięć', 'sześć', 'siedem', 'osiem', 'dziewięć']\nconst ONES_FEM = ['', 'jedna', 'dwie', 'trzy', 'cztery', 'pięć', 'sześć', 'siedem', 'osiem', 'dziewięć']\n\nconst TEENS = ['dziesięć', 'jedenaście', 'dwanaście', 'trzynaście', 'czternaście', 'piętnaście', 'szesnaście', 'siedemnaście', 'osiemnaście', 'dziewiętnaście']\n\nconst TENS = ['', '', 'dwadzieścia', 'trzydzieści', 'czterdzieści', 'pięćdziesiąt', 'sześćdziesiąt', 'siedemdziesiąt', 'osiemdziesiąt', 'dziewięćdziesiąt']\n\n// Irregular hundreds\nconst HUNDREDS = ['', 'sto', 'dwieście', 'trzysta', 'czterysta', 'pięćset', 'sześćset', 'siedemset', 'osiemset', 'dziewięćset']\n\n// Scale words: [singular, few (2-4), many (5+)]\nconst PLURAL_FORMS = {\n  1: ['tysiąc', 'tysiące', 'tysięcy'],\n  2: ['milion', 'miliony', 'milionów'],\n  3: ['miliard', 'miliardy', 'miliardów'],\n  4: ['bilion', 'biliony', 'bilionów'],\n  5: ['biliard', 'biliardy', 'biliardów'],\n  6: ['trylion', 'tryliony', 'trylionów'],\n  7: ['tryliard', 'tryliardy', 'tryliardów'],\n  8: ['kwadrylion', 'kwadryliony', 'kwadrylionów'],\n  9: ['kwaryliard', 'kwadryliardy', 'kwadryliardów'],\n  10: ['kwintylion', 'kwintyliony', 'kwintylionów']\n}\n\nconst ZERO = 'zero'\nconst NEGATIVE = 'minus'\nconst DECIMAL_SEP = 'przecinek'\n\n// ============================================================================\n// Precomputed Lookup Tables (built once at module load)\n// ============================================================================\n\n/**\n * Builds segment word for 0-999 (masculine form).\n * @param {number} n - Segment value\n * @returns {string} Polish word\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\n  if (hundreds > 0) {\n    parts.push(HUNDREDS[hundreds])\n  }\n\n  // Tens and ones\n  if (tens === 1) {\n    // Teens (10-19)\n    parts.push(TEENS[ones])\n  } else {\n    if (tens >= 2) {\n      parts.push(TENS[tens])\n    }\n    if (ones > 0) {\n      parts.push(ONES_MASC[ones])\n    }\n  }\n\n  return parts.join(' ')\n}\n\n/**\n * Builds segment word for 0-999 (feminine form - only differs in ones).\n * @param {number} n - Segment value\n * @returns {string} Polish word\n */\nfunction buildSegmentFeminine (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\n  if (hundreds > 0) {\n    parts.push(HUNDREDS[hundreds])\n  }\n\n  // Tens and ones - feminine for ones only\n  if (tens === 1) {\n    parts.push(TEENS[ones])\n  } else {\n    if (tens >= 2) {\n      parts.push(TENS[tens])\n    }\n    if (ones > 0) {\n      parts.push(ONES_FEM[ones])\n    }\n  }\n\n  return parts.join(' ')\n}\n\n// Precompute all 1000 segment words (0-999)\nconst SEGMENTS_MASC = new Array(1000)\nconst SEGMENTS_FEM = new Array(1000)\nfor (let i = 0; i < 1000; i++) {\n  SEGMENTS_MASC[i] = buildSegment(i)\n  SEGMENTS_FEM[i] = buildSegmentFeminine(i)\n}\n\n// ============================================================================\n// Helper Functions\n// ============================================================================\n\n/**\n * Polish pluralization: 1 = singular, 2-4 = few, else = many.\n * Special case: 11-19 always use many form.\n *\n * @param {bigint} n - Number to pluralize\n * @param {string[]} forms - [singular, few, many]\n * @returns {string} Correct plural form\n */\nfunction pluralize (n, forms) {\n  if (n === 1n) {\n    return forms[0]\n  }\n\n  const lastDigit = n % 10n\n  const lastTwoDigits = n % 100n\n\n  // Teens (11-19) always use many form\n  // 2-4 use few form (but not 12-14)\n  if (lastDigit >= 2n && lastDigit <= 4n && (lastTwoDigits < 10n || lastTwoDigits > 20n)) {\n    return forms[1]\n  }\n\n  return forms[2]\n}\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\n/**\n * Converts a non-negative integer to Polish words.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @param {Object} options - Conversion options\n * @returns {string} Polish words\n */\nfunction integerToWords (n, options = {}) {\n  if (n === 0n) return ZERO\n\n  // Fast path: numbers < 1000 (direct lookup)\n  if (n < 1000n) {\n    const segments = options.gender === 'feminine' ? SEGMENTS_FEM : SEGMENTS_MASC\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    const scaleWord = pluralize(BigInt(thousands), PLURAL_FORMS[1])\n\n    let result\n    if (thousands === 1) {\n      // Omit \"jeden\" before tysiąc\n      result = scaleWord\n    } else {\n      result = SEGMENTS_MASC[thousands] + ' ' + scaleWord\n    }\n\n    if (remainder > 0) {\n      result += ' ' + SEGMENTS_MASC[remainder]\n    }\n\n    return result\n  }\n\n  // For numbers >= 1,000,000, use scale decomposition\n  return buildLargeNumberWords(n, options)\n}\n\n/**\n * Builds words for numbers >= 1,000,000.\n * Uses BigInt division for faster segment extraction.\n *\n * @param {bigint} n - Number >= 1,000,000\n * @param {Object} options - Conversion options\n * @returns {string} Polish words\n */\nfunction buildLargeNumberWords (n, options) {\n  // Extract segments using BigInt division (faster than string slicing)\n  // Segments stored least-significant first (index 0 = ones, 1 = thousands, etc.)\n  const segmentValues = []\n  let temp = n\n  while (temp > 0n) {\n    segmentValues.push(temp % 1000n)\n    temp = temp / 1000n\n  }\n\n  // Build result string directly\n  let result = ''\n\n  for (let i = segmentValues.length - 1; i >= 0; i--) {\n    const segment = segmentValues[i]\n    if (segment === 0n) continue\n\n    const segmentWord = SEGMENTS_MASC[Number(segment)]\n\n    if (result) result += ' '\n\n    if (i === 0) {\n      // Units segment\n      result += segmentWord\n    } else {\n      // Scale word needed\n      const forms = PLURAL_FORMS[i]\n      if (forms) {\n        const scaleWord = pluralize(segment, forms)\n\n        if (segment === 1n) {\n          // Omit \"jeden\" before scale words\n          result += scaleWord\n        } else {\n          result += segmentWord + ' ' + scaleWord\n        }\n      }\n    }\n  }\n\n  return result\n}\n\n/**\n * Converts decimal digits to Polish words.\n *\n * @param {string} decimalPart - Decimal digits (without the point)\n * @param {Object} options - Conversion options\n * @returns {string} Polish words for decimal part\n */\nfunction decimalPartToWords (decimalPart, options) {\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), options)\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to Polish words.\n *\n * This is the main public API. It accepts any valid numeric input\n * (number, string, or bigint) and handles parsing internally.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @param {Object} [options] - Conversion options\n * @param {string} [options.gender='masculine'] - Gender for numbers < 1000\n * @returns {string} The number in Polish 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(1)                          // 'jeden'\n * toWords(1, { gender: 'feminine' })  // 'jedna'\n * toWords(1000)                       // 'tysiąc'\n * toWords(2000)                       // 'dwa tysiące'\n */\nfunction toWords (value, options) {\n  options = validateOptions(options)\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart, options)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart, options)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Public API\n// ============================================================================\n\nexport { toWords }\n","import { isPlainObject } from './is-plain-object.js'\n\n/**\n * Validates and normalizes the options parameter.\n *\n * @param {*} options The options value to validate\n * @returns {Object} A valid options object (empty object if undefined)\n * @throws {TypeError} If options is not undefined or a plain object\n */\nexport function validateOptions (options) {\n  if (options === undefined) return {}\n  if (isPlainObject(options)) return options\n  throw new TypeError(\n    `Invalid options: expected plain object or undefined, got ${typeof options}`\n  )\n}\n","/**\n * Checks if a value is a plain object (not null, array, or other object types).\n *\n * A plain object is one created by:\n * - Object literal: `{}`\n * - Object.create(null): null-prototype object\n *\n * This excludes arrays, class instances, Map, Set, and other object types.\n *\n * @param {*} value Value to check\n * @returns {boolean} True if value is a plain object\n */\nexport function isPlainObject (value) {\n  if (value === null || typeof value !== 'object') return false\n  const proto = Object.getPrototypeOf(value)\n  return proto === null || proto === Object.prototype\n}\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES_MASC","ONES_FEM","TEENS","TENS","HUNDREDS","PLURAL_FORMS","ZERO","buildSegment","n","ones","tens","Math","floor","hundreds","parts","push","join","buildSegmentFeminine","SEGMENTS_MASC","Array","SEGMENTS_FEM","i","pluralize","forms","lastDigit","lastTwoDigits","integerToWords","options","gender","Number","thousands","remainder","scaleWord","result","segmentValues","temp","segment","segmentWord","buildLargeNumberWords","value","undefined","proto","Object","getPrototypeOf","prototype","isPlainObject","TypeError","validateOptions","type","isFinite","Error","isSafeInteger","toString","includes","numberToString","trimmed","trim","isNaN","normalizeString","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,EAAY,CAAC,GAAI,QAAS,MAAO,OAAQ,SAAU,OAAQ,QAAS,SAAU,QAAS,YACvFC,EAAW,CAAC,GAAI,QAAS,OAAQ,OAAQ,SAAU,OAAQ,QAAS,SAAU,QAAS,YAEvFC,EAAQ,CAAC,WAAY,aAAc,YAAa,aAAc,cAAe,aAAc,aAAc,eAAgB,cAAe,kBAExIC,EAAO,CAAC,GAAI,GAAI,cAAe,cAAe,eAAgB,eAAgB,gBAAiB,iBAAkB,gBAAiB,oBAGlIC,EAAW,CAAC,GAAI,MAAO,WAAY,UAAW,YAAa,UAAW,WAAY,YAAa,WAAY,eAG3GC,EAAe,CACnB,EAAG,CAAC,SAAU,UAAW,WACzB,EAAG,CAAC,SAAU,UAAW,YACzB,EAAG,CAAC,UAAW,WAAY,aAC3B,EAAG,CAAC,SAAU,UAAW,YACzB,EAAG,CAAC,UAAW,WAAY,aAC3B,EAAG,CAAC,UAAW,WAAY,aAC3B,EAAG,CAAC,WAAY,YAAa,cAC7B,EAAG,CAAC,aAAc,cAAe,gBACjC,EAAG,CAAC,aAAc,eAAgB,iBAClC,GAAI,CAAC,aAAc,cAAe,iBAG9BC,EAAO,OAab,SAASC,EAAcC,GACrB,GAAU,IAANA,EAAS,MAAO,GAEpB,MAAMC,EAAOD,EAAI,GACXE,EAAOC,KAAKC,MAAMJ,EAAI,IAAM,GAC5BK,EAAWF,KAAKC,MAAMJ,EAAI,KAE1BM,EAAQ,GAoBd,OAjBID,EAAW,GACbC,EAAMC,KAAKX,EAASS,IAIT,IAATH,EAEFI,EAAMC,KAAKb,EAAMO,KAEbC,GAAQ,GACVI,EAAMC,KAAKZ,EAAKO,IAEdD,EAAO,GACTK,EAAMC,KAAKf,EAAUS,KAIlBK,EAAME,KAAK,IACpB,CAOA,SAASC,EAAsBT,GAC7B,GAAU,IAANA,EAAS,MAAO,GAEpB,MAAMC,EAAOD,EAAI,GACXE,EAAOC,KAAKC,MAAMJ,EAAI,IAAM,GAC5BK,EAAWF,KAAKC,MAAMJ,EAAI,KAE1BM,EAAQ,GAmBd,OAhBID,EAAW,GACbC,EAAMC,KAAKX,EAASS,IAIT,IAATH,EACFI,EAAMC,KAAKb,EAAMO,KAEbC,GAAQ,GACVI,EAAMC,KAAKZ,EAAKO,IAEdD,EAAO,GACTK,EAAMC,KAAKd,EAASQ,KAIjBK,EAAME,KAAK,IACpB,CAGA,MAAME,EAAgB,IAAIC,MAAM,KAC1BC,EAAe,IAAID,MAAM,KAC/B,IAAK,IAAIE,EAAI,EAAGA,EAAI,IAAMA,IACxBH,EAAcG,GAAKd,EAAac,GAChCD,EAAaC,GAAKJ,EAAqBI,GAezC,SAASC,EAAWd,EAAGe,GACrB,GAAU,KAANf,EACF,OAAOe,EAAM,GAGf,MAAMC,EAAYhB,EAAI,IAChBiB,EAAgBjB,EAAI,KAI1B,OAAIgB,GAAa,IAAMA,GAAa,KAAOC,EAAgB,KAAOA,EAAgB,KACzEF,EAAM,GAGRA,EAAM,EACf,CAaA,SAASG,EAAgBlB,EAAGmB,EAAU,IACpC,GAAU,KAANnB,EAAU,OAAOF,EAGrB,GAAIE,EAAI,MAEN,OADoC,aAAnBmB,EAAQC,OAAwBR,EAAeF,GAChDW,OAAOrB,IAIzB,GAAIA,EAAI,SAAY,CAClB,MAAMsB,EAAYD,OAAOrB,EAAI,OACvBuB,EAAYF,OAAOrB,EAAI,OAEvBwB,EAAYV,EAAUpC,OAAO4C,GAAYzB,EAAa,IAE5D,IAAI4B,EAYJ,OATEA,EAFgB,IAAdH,EAEOE,EAEAd,EAAcY,GAAa,IAAME,EAGxCD,EAAY,IACdE,GAAU,IAAMf,EAAca,IAGzBE,CACT,CAGA,OAWF,SAAgCzB,GAG9B,MAAM0B,EAAgB,GACtB,IAAIC,EAAO3B,EACX,KAAO2B,EAAO,IACZD,EAAcnB,KAAKoB,EAAO,OAC1BA,GAAc,MAIhB,IAAIF,EAAS,GAEb,IAAK,IAAIZ,EAAIa,EAAcpC,OAAS,EAAGuB,GAAK,EAAGA,IAAK,CAClD,MAAMe,EAAUF,EAAcb,GAC9B,GAAgB,KAAZe,EAAgB,SAEpB,MAAMC,EAAcnB,EAAcW,OAAOO,IAIzC,GAFIH,IAAQA,GAAU,KAEZ,IAANZ,EAEFY,GAAUI,MACL,CAEL,MAAMd,EAAQlB,EAAagB,GAC3B,GAAIE,EAAO,CACT,MAAMS,EAAYV,EAAUc,EAASb,GAInCU,GAFc,KAAZG,EAEQJ,EAEAK,EAAc,IAAML,CAElC,CACF,CACF,CAEA,OAAOC,CACT,CApDSK,CAAsB9B,EAC/B,MAoGA,SAAkB+B,EAAOZ,GACvBA,EC1SK,SAA0BA,GAC/B,QAAgBa,IAAZb,EAAuB,MAAO,CAAA,EAClC,GCCK,SAAwBY,GAC7B,GAAc,OAAVA,GAAmC,iBAAVA,EAAoB,OAAO,EACxD,MAAME,EAAQC,OAAOC,eAAeJ,GACpC,OAAiB,OAAVE,GAAkBA,IAAUC,OAAOE,SAC5C,CDLMC,CAAclB,GAAU,OAAOA,EACnC,MAAM,IAAImB,UACR,mEAAmEnB,EAEvE,CDoSYoB,CAAgBpB,GAC1B,MAAM9C,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GDvS5B,SAA4BmD,GACjC,MAAMS,SAAcT,EAGpB,GAAa,WAATS,EACF,OAAOT,EAAQ,GACX,CAAE1D,YAAY,EAAMI,aAAcsD,GAClC,CAAE1D,YAAY,EAAOI,YAAasD,GAIxC,GAAa,WAATS,EAAmB,CACrB,IAAKnB,OAAOoB,SAASV,GACnB,MAAM,IAAIW,MAAM,8DAElB,OAAIrB,OAAOsB,cAAcZ,GAChBA,EAAQ,EACX,CAAE1D,YAAY,EAAMI,YAAaC,QAAQqD,IACzC,CAAE1D,YAAY,EAAOI,YAAaC,OAAOqD,IAExC5D,EAgBX,SAAyB4D,GACvB,MAAM3D,EAAM2D,EAAMa,WAClB,OAAQxE,EAAIyE,SAAS,MAAQzE,EAAIyE,SAAS,KACtChE,EAAyBT,GACzBA,CACN,CArB8B0E,CAAef,GAC3C,CAGA,GAAa,WAATS,EACF,OAAOrE,EAqBX,SAA0B4D,GACxB,MAAMgB,EAAUhB,EAAMiB,OACtB,GAAuB,IAAnBD,EAAQzD,QAAgB+B,OAAO4B,MAAM5B,OAAO0B,IAC9C,MAAM,IAAIL,MAAM,2BAA2BX,MAE7C,OAAQgB,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9ChE,EAAyBkE,GACzBA,CACN,CA7B8BG,CAAgBnB,IAG5C,MAAM,IAAIO,UACR,oEAAoEE,IAExE,CCwQmDW,CAAkBpB,GAEnE,IAAIN,EAAS,GAYb,OAVIpD,IACFoD,EAAS2B,UAGX3B,GAAUP,EAAezC,EAAa0C,GAElCvC,IACF6C,GAAU,cArDd,SAA6B7C,EAAauC,GACxC,IAAIM,EAAS,GAGTZ,EAAI,EACR,KAAOA,EAAIjC,EAAYU,QAA6B,MAAnBV,EAAYiC,IACvCY,IAAQA,GAAU,KACtBA,GAAU3B,EACVe,IAIF,MAAMU,EAAY3C,EAAYN,MAAMuC,GAMpC,OALIU,IACEE,IAAQA,GAAU,KACtBA,GAAUP,EAAexC,OAAO6C,GAAYJ,IAGvCM,CACT,CAkCwC4B,CAAmBzE,EAAauC,IAG/DM,CACT"}

package/dist/languages/pt.js

@@ -1,3 +0,0 @@
-/*! n2words/pt v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var e,t;e=this,t=function(e){"use strict";function t(e){const t="-"===e[0];t&&(e=e.slice(1));const n=e.indexOf(".");if(-1===n)return{isNegative:t,integerPart:BigInt(e)};const i=e.slice(0,n)||"0",r=e.slice(n+1);return{isNegative:t,integerPart:BigInt(i),decimalPart:r}}function n(e){const[t,n]=e.toLowerCase().split("e"),i=parseInt(n,10),r=t.indexOf("."),o=-1===r?t:t.slice(0,r)+t.slice(r+1),s=(-1===r?t.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=["","um","dois","três","quatro","cinco","seis","sete","oito","nove"],r=["dez","onze","doze","treze","catorze","quinze","dezasseis","dezassete","dezoito","dezanove"],o=["","","vinte","trinta","quarenta","cinquenta","sessenta","setenta","oitenta","noventa"],s=["","cento","duzentos","trezentos","quatrocentos","quinhentos","seiscentos","setecentos","oitocentos","novecentos"],u="mil",l="zero";function c(e){if(0===e)return{word:"",isExactHundred:!1};if(100===e)return{word:"cem",isExactHundred:!0};const t=e%10,n=Math.floor(e/10)%10,u=Math.floor(e/100),l=[];return u>0&&l.push(s[u]),1===n?l.push(r[t]):n>=2?l.push(t>0?o[n]+" e "+i[t]:o[n]):t>0&&l.push(i[t]),{word:l.join(" e "),isExactHundred:u>0&&0===n&&0===t}}const a=new Array(1e3),f=new Array(1e3);for(let e=0;e<1e3;e++){const t=c(e);a[e]=t.word,f[e]=e>=100}const d=["",u,"milhão","mil milhões","bilião","mil biliões","trilião","mil triliões","quatrilião"],g=["",u,"milhões","mil milhões","biliões","mil biliões","triliões","mil triliões","quatriliões"];function m(e){if(0n===e)return l;if(e<1000n)return a[Number(e)];if(e<1000000n){const t=Number(e/1000n),n=Number(e%1000n);let i;return i=1===t?u:a[t]+" "+u,n>0&&(i+=f[n]?" "+a[n]:" e "+a[n]),i}return function(e){const t=[];let n=e;for(;n>0n;)t.push(Number(n%1000n)),n/=1000n;let i=0;for(let e=0;e<t.length;e++)if(0!==t[e]){i=e;break}let r="",o=!1;for(let e=t.length-1;e>=0;e--){const n=t[e];if(0===n)continue;const s=a[n];if(r&&e===i&&o&&!f[n]&&(r+=" e"),r&&(r+=" "),0===e)r+=s,o=!1;else if(1===e)r+=1===n?u:s+" "+u,o=!0;else{const t=1===n?d[e]:g[e];r+=1===n?"um "+t:s+" "+t,o=!0}}return r}(e)}e.pt=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)}:t(function(e){const t=e.toString();return t.includes("e")||t.includes("E")?n(t):t}(e))}if("string"===i)return t(function(e){const t=e.trim();if(0===t.length||Number.isNaN(Number(t)))throw new Error(`Invalid number format: "${e}"`);return t.includes("e")||t.includes("E")?n(t):t}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${i}`)}(e);let s="";return i&&(s="menos "),s+=m(r),o&&(s+=" vírgula "+function(e){let t="",n=0;for(;n<e.length&&"0"===e[n];)t&&(t+=" "),t+=l,n++;const i=e.slice(n);return i&&(t&&(t+=" "),t+=m(BigInt(i))),t}(o)),s}},"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=pt.js.map

package/dist/languages/pt.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"pt.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/pt.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 * Portuguese 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 * Portuguese-specific rules (handled in precomputation):\n * - \"e\" conjunction everywhere: vinte e um, cento e um, mil e um\n * - \"cem\" for exact 100, \"cento\" for 100+ remainder\n * - Irregular hundreds: duzentos, trezentos, quatrocentos, etc.\n * - Compound scale: milhão (10^6), mil milhões (10^9), bilião (10^12)\n * - Omit \"um\" before \"mil\"\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\n\n// ============================================================================\n// Vocabulary (module-level constants)\n// ============================================================================\n\nconst ONES = ['', 'um', 'dois', 'três', 'quatro', 'cinco', 'seis', 'sete', 'oito', 'nove']\nconst TEENS = ['dez', 'onze', 'doze', 'treze', 'catorze', 'quinze', 'dezasseis', 'dezassete', 'dezoito', 'dezanove']\nconst TENS = ['', '', 'vinte', 'trinta', 'quarenta', 'cinquenta', 'sessenta', 'setenta', 'oitenta', 'noventa']\n\n// Irregular hundreds\nconst HUNDREDS = ['', 'cento', 'duzentos', 'trezentos', 'quatrocentos', 'quinhentos', 'seiscentos', 'setecentos', 'oitocentos', 'novecentos']\n\nconst THOUSAND = 'mil'\nconst ZERO = 'zero'\nconst NEGATIVE = 'menos'\nconst DECIMAL_SEP = 'vírgula'\n\n// ============================================================================\n// Precomputed Lookup Tables (built once at module load)\n// ============================================================================\n\n/**\n * Builds segment word for 0-999 with Portuguese \"e\" rules.\n * Returns the word and whether it's an exact hundred (for \"cem\" handling).\n */\nfunction buildSegment (n) {\n  if (n === 0) return { word: '', isExactHundred: false }\n\n  // Special case: exact 100 is \"cem\"\n  if (n === 100) return { word: 'cem', isExactHundred: true }\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\n  if (hundreds > 0) {\n    parts.push(HUNDREDS[hundreds])\n  }\n\n  // Tens and ones\n  if (tens === 1) {\n    // Teens (10-19)\n    parts.push(TEENS[ones])\n  } else if (tens >= 2) {\n    if (ones > 0) {\n      // Tens + ones with \"e\": \"vinte e um\"\n      parts.push(TENS[tens] + ' e ' + ONES[ones])\n    } else {\n      parts.push(TENS[tens])\n    }\n  } else if (ones > 0) {\n    parts.push(ONES[ones])\n  }\n\n  // Join hundreds with \"e\": \"cento e um\", \"duzentos e trinta e um\"\n  const word = parts.join(' e ')\n\n  return { word, isExactHundred: hundreds > 0 && tens === 0 && ones === 0 }\n}\n\n// Precompute all 1000 segment words (0-999)\nconst SEGMENTS = new Array(1000)\nconst SEGMENTS_STARTS_WITH_HUNDREDS = new Array(1000)\n\nfor (let i = 0; i < 1000; i++) {\n  const result = buildSegment(i)\n  SEGMENTS[i] = result.word\n  // Precompute whether segment starts with hundreds (100-999)\n  SEGMENTS_STARTS_WITH_HUNDREDS[i] = i >= 100\n}\n\n// ============================================================================\n// Scale Word Lookup (precomputed for common scales)\n// ============================================================================\n\n// Precompute scale words for singular and plural forms\n// Index 1 = thousands, 2 = millions, 3 = billions (mil milhões), etc.\nconst SCALE_WORDS_SINGULAR = [\n  '', // 0 unused\n  THOUSAND, // 1: mil\n  'milhão', // 2: 10^6\n  'mil milhões', // 3: 10^9 (compound)\n  'bilião', // 4: 10^12\n  'mil biliões', // 5: 10^15 (compound)\n  'trilião', // 6: 10^18\n  'mil triliões', // 7: 10^21 (compound)\n  'quatrilião' // 8: 10^24\n]\n\nconst SCALE_WORDS_PLURAL = [\n  '', // 0 unused\n  THOUSAND, // 1: mil (same)\n  'milhões', // 2: 10^6\n  'mil milhões', // 3: 10^9 (compound, same)\n  'biliões', // 4: 10^12\n  'mil biliões', // 5: 10^15 (compound, same)\n  'triliões', // 6: 10^18\n  'mil triliões', // 7: 10^21 (compound, same)\n  'quatriliões' // 8: 10^24\n]\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\n/**\n * Converts a non-negative integer to Portuguese words.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @returns {string} Portuguese 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\n    if (thousands === 1) {\n      // \"mil\" not \"um mil\"\n      result = THOUSAND\n    } else {\n      result = SEGMENTS[thousands] + ' ' + THOUSAND\n    }\n\n    if (remainder > 0) {\n      // Insert \"e\" before remainder if it doesn't start with hundreds (< 100)\n      if (!SEGMENTS_STARTS_WITH_HUNDREDS[remainder]) {\n        result += ' e ' + SEGMENTS[remainder]\n      } else {\n        result += ' ' + SEGMENTS[remainder]\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} Portuguese words\n */\nfunction buildLargeNumberWords (n) {\n  // Extract segments using BigInt division\n  // Segments 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 non-zero segment index (lowest scale with value)\n  let firstNonZeroIdx = 0\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\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 isLastSegment = (i === firstNonZeroIdx)\n\n    // Add \"e\" before final segment if previous was scale and this doesn't start with hundreds\n    if (result && isLastSegment && prevWasScale && !SEGMENTS_STARTS_WITH_HUNDREDS[segment]) {\n      result += ' e'\n    }\n\n    if (result) result += ' '\n\n    if (i === 0) {\n      // Units segment\n      result += segmentWord\n      prevWasScale = false\n    } else if (i === 1) {\n      // Thousands\n      if (segment === 1) {\n        result += THOUSAND\n      } else {\n        result += segmentWord + ' ' + THOUSAND\n      }\n      prevWasScale = true\n    } else {\n      // Million and above - use precomputed scale arrays\n      const scaleWord = segment === 1 ? SCALE_WORDS_SINGULAR[i] : SCALE_WORDS_PLURAL[i]\n      if (segment === 1) {\n        result += 'um ' + scaleWord\n      } else {\n        result += segmentWord + ' ' + scaleWord\n      }\n      prevWasScale = true\n    }\n  }\n\n  return result\n}\n\n/**\n * Converts decimal digits to Portuguese words.\n *\n * @param {string} decimalPart - Decimal digits (without the point)\n * @returns {string} Portuguese 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 Portuguese 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 Portuguese 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)           // 'vinte e um'\n * toWords(100)          // 'cem'\n * toWords(1000000)      // 'um milhão'\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","buildSegment","n","word","isExactHundred","ones","tens","Math","floor","hundreds","parts","push","join","SEGMENTS","Array","SEGMENTS_STARTS_WITH_HUNDREDS","i","result","SCALE_WORDS_SINGULAR","SCALE_WORDS_PLURAL","integerToWords","Number","thousands","remainder","segments","temp","firstNonZeroIdx","prevWasScale","segment","segmentWord","scaleWord","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,CCpFA,MAAMG,EAAO,CAAC,GAAI,KAAM,OAAQ,OAAQ,SAAU,QAAS,OAAQ,OAAQ,OAAQ,QAC7EC,EAAQ,CAAC,MAAO,OAAQ,OAAQ,QAAS,UAAW,SAAU,YAAa,YAAa,UAAW,YACnGC,EAAO,CAAC,GAAI,GAAI,QAAS,SAAU,WAAY,YAAa,WAAY,UAAW,UAAW,WAG9FC,EAAW,CAAC,GAAI,QAAS,WAAY,YAAa,eAAgB,aAAc,aAAc,aAAc,aAAc,cAE1HC,EAAW,MACXC,EAAO,OAYb,SAASC,EAAcC,GACrB,GAAU,IAANA,EAAS,MAAO,CAAEC,KAAM,GAAIC,gBAAgB,GAGhD,GAAU,MAANF,EAAW,MAAO,CAAEC,KAAM,MAAOC,gBAAgB,GAErD,MAAMC,EAAOH,EAAI,GACXI,EAAOC,KAAKC,MAAMN,EAAI,IAAM,GAC5BO,EAAWF,KAAKC,MAAMN,EAAI,KAE1BQ,EAAQ,GAyBd,OAtBID,EAAW,GACbC,EAAMC,KAAKb,EAASW,IAIT,IAATH,EAEFI,EAAMC,KAAKf,EAAMS,IACRC,GAAQ,EAGfI,EAAMC,KAFJN,EAAO,EAEER,EAAKS,GAAQ,MAAQX,EAAKU,GAE1BR,EAAKS,IAETD,EAAO,GAChBK,EAAMC,KAAKhB,EAAKU,IAMX,CAAEF,KAFIO,EAAME,KAAK,OAETR,eAAgBK,EAAW,GAAc,IAATH,GAAuB,IAATD,EAC/D,CAGA,MAAMQ,EAAW,IAAIC,MAAM,KACrBC,EAAgC,IAAID,MAAM,KAEhD,IAAK,IAAIE,EAAI,EAAGA,EAAI,IAAMA,IAAK,CAC7B,MAAMC,EAAShB,EAAae,GAC5BH,EAASG,GAAKC,EAAOd,KAErBY,EAA8BC,GAAKA,GAAK,GAC1C,CAQA,MAAME,EAAuB,CAC3B,GACAnB,EACA,SACA,cACA,SACA,cACA,UACA,eACA,cAGIoB,EAAqB,CACzB,GACApB,EACA,UACA,cACA,UACA,cACA,WACA,eACA,eAaF,SAASqB,EAAgBlB,GACvB,GAAU,KAANA,EAAU,OAAOF,EAGrB,GAAIE,EAAI,MACN,OAAOW,EAASQ,OAAOnB,IAIzB,GAAIA,EAAI,SAAY,CAClB,MAAMoB,EAAYD,OAAOnB,EAAI,OACvBqB,EAAYF,OAAOnB,EAAI,OAE7B,IAAIe,EAiBJ,OAdEA,EAFgB,IAAdK,EAEOvB,EAEAc,EAASS,GAAa,IAAMvB,EAGnCwB,EAAY,IAKZN,GAHGF,EAA8BQ,GAGvB,IAAMV,EAASU,GAFf,MAAQV,EAASU,IAMxBN,CACT,CAGA,OAUF,SAAgCf,GAG9B,MAAMsB,EAAW,GACjB,IAAIC,EAAOvB,EACX,KAAOuB,EAAO,IACZD,EAASb,KAAKU,OAAOI,EAAO,QAC5BA,GAAc,MAIhB,IAAIC,EAAkB,EACtB,IAAK,IAAIV,EAAI,EAAGA,EAAIQ,EAAS/B,OAAQuB,IACnC,GAAoB,IAAhBQ,EAASR,GAAU,CACrBU,EAAkBV,EAClB,KACF,CAIF,IAAIC,EAAS,GACTU,GAAe,EAEnB,IAAK,IAAIX,EAAIQ,EAAS/B,OAAS,EAAGuB,GAAK,EAAGA,IAAK,CAC7C,MAAMY,EAAUJ,EAASR,GACzB,GAAgB,IAAZY,EAAe,SAEnB,MAAMC,EAAchB,EAASe,GAU7B,GANIX,GAHmBD,IAAMU,GAGEC,IAAiBZ,EAA8Ba,KAC5EX,GAAU,MAGRA,IAAQA,GAAU,KAEZ,IAAND,EAEFC,GAAUY,EACVF,GAAe,OACV,GAAU,IAANX,EAGPC,GADc,IAAZW,EACQ7B,EAEA8B,EAAc,IAAM9B,EAEhC4B,GAAe,MACV,CAEL,MAAMG,EAAwB,IAAZF,EAAgBV,EAAqBF,GAAKG,EAAmBH,GAE7EC,GADc,IAAZW,EACQ,MAAQE,EAERD,EAAc,IAAMC,EAEhCH,GAAe,CACjB,CACF,CAEA,OAAOV,CACT,CAxESc,CAAsB7B,EAC/B,MAoHA,SAAkB8B,GAChB,MAAMxD,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GD/Q5B,SAA4BiD,GACjC,MAAMC,SAAcD,EAGpB,GAAa,WAATC,EACF,OAAOD,EAAQ,GACX,CAAExD,YAAY,EAAMI,aAAcoD,GAClC,CAAExD,YAAY,EAAOI,YAAaoD,GAIxC,GAAa,WAATC,EAAmB,CACrB,IAAKZ,OAAOa,SAASF,GACnB,MAAM,IAAIG,MAAM,8DAElB,OAAId,OAAOe,cAAcJ,GAChBA,EAAQ,EACX,CAAExD,YAAY,EAAMI,YAAaC,QAAQmD,IACzC,CAAExD,YAAY,EAAOI,YAAaC,OAAOmD,IAExC1D,EAgBX,SAAyB0D,GACvB,MAAMzD,EAAMyD,EAAMK,WAClB,OAAQ9D,EAAI+D,SAAS,MAAQ/D,EAAI+D,SAAS,KACtCtD,EAAyBT,GACzBA,CACN,CArB8BgE,CAAeP,GAC3C,CAGA,GAAa,WAATC,EACF,OAAO3D,EAqBX,SAA0B0D,GACxB,MAAMQ,EAAUR,EAAMS,OACtB,GAAuB,IAAnBD,EAAQ/C,QAAgB4B,OAAOqB,MAAMrB,OAAOmB,IAC9C,MAAM,IAAIL,MAAM,2BAA2BH,MAE7C,OAAQQ,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9CtD,EAAyBwD,GACzBA,CACN,CA7B8BG,CAAgBX,IAG5C,MAAM,IAAIY,UACR,oEAAoEX,IAExE,CCgPmDY,CAAkBb,GAEnE,IAAIf,EAAS,GAYb,OAVIzC,IACFyC,EAAS6B,UAGX7B,GAAUG,EAAexC,GAErBG,IACFkC,GAAU,YAjDd,SAA6BlC,GAC3B,IAAIkC,EAAS,GAGTD,EAAI,EACR,KAAOA,EAAIjC,EAAYU,QAA6B,MAAnBV,EAAYiC,IACvCC,IAAQA,GAAU,KACtBA,GAAUjB,EACVgB,IAIF,MAAMO,EAAYxC,EAAYN,MAAMuC,GAMpC,OALIO,IACEN,IAAQA,GAAU,KACtBA,GAAUG,EAAevC,OAAO0C,KAG3BN,CACT,CA8BwC8B,CAAmBhE,IAGlDkC,CACT"}

package/dist/languages/ro.js

@@ -1,3 +0,0 @@
-/*! n2words/ro 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("."),u=-1===r?n:n.slice(0,r)+n.slice(r+1),o=(-1===r?n.length:r)+t;return o>=u.length?u+"0".repeat(o-u.length):o<=0?"0."+"0".repeat(-o)+u:u.slice(0,o)+"."+u.slice(o)}const t=["","unu","doi","trei","patru","cinci","șase","șapte","opt","nouă"],r=["","una","două","trei","patru","cinci","șase","șapte","opt","nouă"],u=["zece","unsprezece","douăsprezece","treisprezece","paisprezece","cincisprezece","șaisprezece","șaptesprezece","optsprezece","nouăsprezece"],o=["zece","unsprezece","doisprezece","treisprezece","paisprezece","cincisprezece","șaisprezece","șaptesprezece","optsprezece","nouăsprezece"],s=["","","douăzeci","treizeci","patruzeci","cincizeci","șaizeci","șaptezeci","optzeci","nouăzeci"],c=["","o sută","două sute","trei sute","patru sute","cinci sute","șase sute","șapte sute","opt sute","nouă sute"],l="zero",a=[{singular:"mie",plural:"mii",article:"o",feminine:!0,needsDe:!0},{singular:"milion",plural:"milioane",article:"un",feminine:!1,needsDe:!0},{singular:"miliard",plural:"miliarde",article:"un",feminine:!1,needsDe:!0},{singular:"trilion",plural:"trilioane",article:"un",feminine:!1,needsDe:!0},{singular:"cvadrilion",plural:"cvadrilioane",article:"un",feminine:!1,needsDe:!0},{singular:"cvintilion",plural:"cvintilioane",article:"un",feminine:!1,needsDe:!0},{singular:"sextilion",plural:"sextilioane",article:"un",feminine:!1,needsDe:!0},{singular:"septilion",plural:"septilioane",article:"un",feminine:!1,needsDe:!0},{singular:"octilion",plural:"octilioane",article:"un",feminine:!1,needsDe:!0}];function p(e,n=!1,i=!1){if(0===e)return"";if(e<10)return n?r[e]:t[e];if(e<20)return i?o[e-10]:u[e-10];const c=Math.floor(e/10),l=e%10;return 0===l?s[c]:s[c]+" și "+(n?r[l]:t[l])}function f(e,n=!1,i=!1){if(0===e)return"";if(e<100)return p(e,n,i);const t=Math.floor(e/100),r=e%100,u=c[t];return 0===r?u:u+" "+p(r,n,i)}function d(e,n){const i=a[n-1];return i?1===e?i.article+" "+i.singular:21===e&&i.needsDe?"douăzeci și una de "+i.plural:f(e,!0)+(i.needsDe&&e>=20?" de ":" ")+i.plural:f(e,!0)}function g(e,n={}){if(0n===e)return l;if(e<1000n){const i="feminine"===n.gender;return f(Number(e),i)}return function(e,n){const i=[];let t=e;for(;t>0n;)i.push(Number(t%1000n)),t/=1000n;let r="";for(let e=i.length-1;e>=0;e--){const t=i[e];if(0===t)continue;let u;u=0===e?f(t,"feminine"===n.gender):d(t,e),r&&u?r+=" "+u:u&&(r=u)}return r}(e,n)}e.ro=function(e,t){t=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)}(t);const{isNegative:r,integerPart:u,decimalPart:o}=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 r&&(s="minus "),s+=g(u,t),o&&(s+=" virgulă "+function(e){let n="",i=0;for(;i<e.length&&"0"===e[i];)n&&(n+=" "),n+=l,i++;const t=e.slice(i);if(t){n&&(n+=" ");const e=BigInt(t);n+=e<1000n?f(Number(e),!1,!0):g(e,{gender:"masculine"})}return 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=ro.js.map

package/dist/languages/ro.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ro.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/ro.js","../../lib/utils/validate-options.js","../../lib/utils/is-plain-object.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * Romanian language converter - Functional Implementation\n *\n * A performance-optimized number-to-words converter using precomputed lookup tables.\n *\n * Key features:\n * - Gender agreement (unu/una, doi/două)\n * - \"De\" preposition insertion for groups >= 20\n * - Complex scale word handling (mie/mii, milion/milioane)\n * - Feminine units for thousands\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\nimport { validateOptions } from '../utils/validate-options.js'\n\n// ============================================================================\n// Vocabulary (module-level constants)\n// ============================================================================\n\nconst ONES_MASC = ['', 'unu', 'doi', 'trei', 'patru', 'cinci', 'șase', 'șapte', 'opt', 'nouă']\nconst ONES_FEM = ['', 'una', 'două', 'trei', 'patru', 'cinci', 'șase', 'șapte', 'opt', 'nouă']\n\nconst TEENS = ['zece', 'unsprezece', 'douăsprezece', 'treisprezece', 'paisprezece', 'cincisprezece', 'șaisprezece', 'șaptesprezece', 'optsprezece', 'nouăsprezece']\nconst TEENS_MASC = ['zece', 'unsprezece', 'doisprezece', 'treisprezece', 'paisprezece', 'cincisprezece', 'șaisprezece', 'șaptesprezece', 'optsprezece', 'nouăsprezece']\n\nconst TWENTIES = ['', '', 'douăzeci', 'treizeci', 'patruzeci', 'cincizeci', 'șaizeci', 'șaptezeci', 'optzeci', 'nouăzeci']\n\nconst HUNDREDS = ['', 'o sută', 'două sute', 'trei sute', 'patru sute', 'cinci sute', 'șase sute', 'șapte sute', 'opt sute', 'nouă sute']\n\nconst ZERO = 'zero'\nconst NEGATIVE = 'minus'\nconst DECIMAL_SEP = 'virgulă'\n\n// Scale metadata: [singular, plural, article, feminine, needsDe]\n// - singular: form for 1\n// - plural: form for 2+\n// - article: 'o' for feminine, 'un' for masculine\n// - feminine: whether units should be feminine\n// - needsDe: whether \"de\" is inserted for segment >= 20\nconst SCALE_META = [\n  { singular: 'mie', plural: 'mii', article: 'o', feminine: true, needsDe: true },\n  { singular: 'milion', plural: 'milioane', article: 'un', feminine: false, needsDe: true },\n  { singular: 'miliard', plural: 'miliarde', article: 'un', feminine: false, needsDe: true },\n  { singular: 'trilion', plural: 'trilioane', article: 'un', feminine: false, needsDe: true },\n  { singular: 'cvadrilion', plural: 'cvadrilioane', article: 'un', feminine: false, needsDe: true },\n  { singular: 'cvintilion', plural: 'cvintilioane', article: 'un', feminine: false, needsDe: true },\n  { singular: 'sextilion', plural: 'sextilioane', article: 'un', feminine: false, needsDe: true },\n  { singular: 'septilion', plural: 'septilioane', article: 'un', feminine: false, needsDe: true },\n  { singular: 'octilion', plural: 'octilioane', article: 'un', feminine: false, needsDe: true }\n]\n\n// ============================================================================\n// Helper Functions\n// ============================================================================\n\n/**\n * Spells number under 100.\n */\nfunction spellUnder100 (n, feminine = false, masculineTeens = false) {\n  if (n === 0) return ''\n  if (n < 10) {\n    return feminine ? ONES_FEM[n] : ONES_MASC[n]\n  }\n  if (n < 20) {\n    return masculineTeens ? TEENS_MASC[n - 10] : TEENS[n - 10]\n  }\n  const t = Math.floor(n / 10)\n  const u = n % 10\n  if (u === 0) {\n    return TWENTIES[t]\n  }\n  const onesWord = feminine ? ONES_FEM[u] : ONES_MASC[u]\n  return TWENTIES[t] + ' și ' + onesWord\n}\n\n/**\n * Spells number under 1000.\n */\nfunction spellUnder1000 (n, feminine = false, masculineTeens = false) {\n  if (n === 0) return ''\n  if (n < 100) return spellUnder100(n, feminine, masculineTeens)\n\n  const h = Math.floor(n / 100)\n  const r = n % 100\n  const hundredWord = HUNDREDS[h]\n\n  if (r === 0) return hundredWord\n  return hundredWord + ' ' + spellUnder100(r, feminine, masculineTeens)\n}\n\n/**\n * Builds scale word with proper pluralization and \"de\" insertion.\n * Romanian always uses feminine forms (două, not doi) when counting scale words.\n */\nfunction buildScalePhrase (segment, scaleIndex) {\n  const meta = SCALE_META[scaleIndex - 1]\n  if (!meta) return spellUnder1000(segment, true)\n\n  if (segment === 1) {\n    return meta.article + ' ' + meta.singular\n  }\n\n  // Special case: 21 with scale words uses feminine \"una\"\n  if (segment === 21 && meta.needsDe) {\n    return 'douăzeci și una de ' + meta.plural\n  }\n\n  // Romanian always uses feminine when counting scale words (două milioane, not doi milioane)\n  const words = spellUnder1000(segment, true)\n\n  // \"de\" after >= 20\n  const needsDe = meta.needsDe && segment >= 20\n  const separator = needsDe ? ' de ' : ' '\n\n  return words + separator + meta.plural\n}\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\n/**\n * Converts a non-negative integer to Romanian words.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @param {Object} options - Conversion options\n * @returns {string} Romanian words\n */\nfunction integerToWords (n, options = {}) {\n  if (n === 0n) return ZERO\n\n  // Fast path: numbers < 1000\n  if (n < 1000n) {\n    const feminine = options.gender === 'feminine'\n    return spellUnder1000(Number(n), feminine)\n  }\n\n  return buildLargeNumberWords(n, options)\n}\n\n/**\n * Builds words for numbers >= 1000.\n * Uses BigInt division for faster segment extraction.\n *\n * @param {bigint} n - Number >= 1000\n * @param {Object} options - Conversion options\n * @returns {string} Romanian words\n */\nfunction buildLargeNumberWords (n, options) {\n  // Extract segments using BigInt division (faster than string slicing)\n  // Segments stored least-significant first (index 0 = ones, 1 = thousands, etc.)\n  const segmentValues = []\n  let temp = n\n  while (temp > 0n) {\n    segmentValues.push(Number(temp % 1000n))\n    temp = temp / 1000n\n  }\n\n  // Build result string directly (avoid regex cleanup)\n  let result = ''\n\n  for (let i = segmentValues.length - 1; i >= 0; i--) {\n    const segment = segmentValues[i]\n    if (segment === 0) continue\n\n    let segmentWords\n    if (i === 0) {\n      // Units segment - use gender from options\n      const feminine = options.gender === 'feminine'\n      segmentWords = spellUnder1000(segment, feminine)\n    } else {\n      // Scale segment\n      segmentWords = buildScalePhrase(segment, i)\n    }\n\n    if (result && segmentWords) {\n      result += ' ' + segmentWords\n    } else if (segmentWords) {\n      result = segmentWords\n    }\n  }\n\n  return result\n}\n\n/**\n * Converts decimal digits to Romanian words.\n * Decimals always use masculine forms.\n *\n * @param {string} decimalPart - Decimal digits (without the point)\n * @returns {string} Romanian words for decimal part\n */\nfunction decimalPartToWords (decimalPart) {\n  let result = ''\n  let i = 0\n\n  // Handle leading zeros\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 (masculine, with masculine teens)\n  const remainder = decimalPart.slice(i)\n  if (remainder) {\n    if (result) result += ' '\n    const n = BigInt(remainder)\n    if (n < 1000n) {\n      result += spellUnder1000(Number(n), false, true)\n    } else {\n      result += integerToWords(n, { gender: 'masculine' })\n    }\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to Romanian words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @param {Object} [options] - Conversion options\n * @param {string} [options.gender='masculine'] - Gender for numbers\n * @returns {string} The number in Romanian 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)                        // 'douăzeci și unu'\n * toWords(1, { gender: 'feminine' }) // 'una'\n * toWords(1000)                      // 'o mie'\n */\nfunction toWords (value, options) {\n  options = validateOptions(options)\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart, options)\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","import { isPlainObject } from './is-plain-object.js'\n\n/**\n * Validates and normalizes the options parameter.\n *\n * @param {*} options The options value to validate\n * @returns {Object} A valid options object (empty object if undefined)\n * @throws {TypeError} If options is not undefined or a plain object\n */\nexport function validateOptions (options) {\n  if (options === undefined) return {}\n  if (isPlainObject(options)) return options\n  throw new TypeError(\n    `Invalid options: expected plain object or undefined, got ${typeof options}`\n  )\n}\n","/**\n * Checks if a value is a plain object (not null, array, or other object types).\n *\n * A plain object is one created by:\n * - Object literal: `{}`\n * - Object.create(null): null-prototype object\n *\n * This excludes arrays, class instances, Map, Set, and other object types.\n *\n * @param {*} value Value to check\n * @returns {boolean} True if value is a plain object\n */\nexport function isPlainObject (value) {\n  if (value === null || typeof value !== 'object') return false\n  const proto = Object.getPrototypeOf(value)\n  return proto === null || proto === Object.prototype\n}\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES_MASC","ONES_FEM","TEENS","TEENS_MASC","TWENTIES","HUNDREDS","ZERO","SCALE_META","singular","plural","article","feminine","needsDe","spellUnder100","n","masculineTeens","t","Math","floor","u","spellUnder1000","h","r","hundredWord","buildScalePhrase","segment","scaleIndex","meta","integerToWords","options","gender","Number","segmentValues","temp","push","result","i","segmentWords","buildLargeNumberWords","value","undefined","proto","Object","getPrototypeOf","prototype","isPlainObject","TypeError","validateOptions","type","isFinite","Error","isSafeInteger","toString","includes","numberToString","trimmed","trim","isNaN","normalizeString","parseNumericValue","NEGATIVE","remainder","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,EAAY,CAAC,GAAI,MAAO,MAAO,OAAQ,QAAS,QAAS,OAAQ,QAAS,MAAO,QACjFC,EAAW,CAAC,GAAI,MAAO,OAAQ,OAAQ,QAAS,QAAS,OAAQ,QAAS,MAAO,QAEjFC,EAAQ,CAAC,OAAQ,aAAc,eAAgB,eAAgB,cAAe,gBAAiB,cAAe,gBAAiB,cAAe,gBAC9IC,EAAa,CAAC,OAAQ,aAAc,cAAe,eAAgB,cAAe,gBAAiB,cAAe,gBAAiB,cAAe,gBAElJC,EAAW,CAAC,GAAI,GAAI,WAAY,WAAY,YAAa,YAAa,UAAW,YAAa,UAAW,YAEzGC,EAAW,CAAC,GAAI,SAAU,YAAa,YAAa,aAAc,aAAc,YAAa,aAAc,WAAY,aAEvHC,EAAO,OAUPC,EAAa,CACjB,CAAEC,SAAU,MAAOC,OAAQ,MAAOC,QAAS,IAAKC,UAAU,EAAMC,SAAS,GACzE,CAAEJ,SAAU,SAAUC,OAAQ,WAAYC,QAAS,KAAMC,UAAU,EAAOC,SAAS,GACnF,CAAEJ,SAAU,UAAWC,OAAQ,WAAYC,QAAS,KAAMC,UAAU,EAAOC,SAAS,GACpF,CAAEJ,SAAU,UAAWC,OAAQ,YAAaC,QAAS,KAAMC,UAAU,EAAOC,SAAS,GACrF,CAAEJ,SAAU,aAAcC,OAAQ,eAAgBC,QAAS,KAAMC,UAAU,EAAOC,SAAS,GAC3F,CAAEJ,SAAU,aAAcC,OAAQ,eAAgBC,QAAS,KAAMC,UAAU,EAAOC,SAAS,GAC3F,CAAEJ,SAAU,YAAaC,OAAQ,cAAeC,QAAS,KAAMC,UAAU,EAAOC,SAAS,GACzF,CAAEJ,SAAU,YAAaC,OAAQ,cAAeC,QAAS,KAAMC,UAAU,EAAOC,SAAS,GACzF,CAAEJ,SAAU,WAAYC,OAAQ,aAAcC,QAAS,KAAMC,UAAU,EAAOC,SAAS,IAUzF,SAASC,EAAeC,EAAGH,GAAW,EAAOI,GAAiB,GAC5D,GAAU,IAAND,EAAS,MAAO,GACpB,GAAIA,EAAI,GACN,OAAOH,EAAWV,EAASa,GAAKd,EAAUc,GAE5C,GAAIA,EAAI,GACN,OAAOC,EAAiBZ,EAAWW,EAAI,IAAMZ,EAAMY,EAAI,IAEzD,MAAME,EAAIC,KAAKC,MAAMJ,EAAI,IACnBK,EAAIL,EAAI,GACd,OAAU,IAANK,EACKf,EAASY,GAGXZ,EAASY,GAAK,QADJL,EAAWV,EAASkB,GAAKnB,EAAUmB,GAEtD,CAKA,SAASC,EAAgBN,EAAGH,GAAW,EAAOI,GAAiB,GAC7D,GAAU,IAAND,EAAS,MAAO,GACpB,GAAIA,EAAI,IAAK,OAAOD,EAAcC,EAAGH,EAAUI,GAE/C,MAAMM,EAAIJ,KAAKC,MAAMJ,EAAI,KACnBQ,EAAIR,EAAI,IACRS,EAAclB,EAASgB,GAE7B,OAAU,IAANC,EAAgBC,EACbA,EAAc,IAAMV,EAAcS,EAAGX,EAAUI,EACxD,CAMA,SAASS,EAAkBC,EAASC,GAClC,MAAMC,EAAOpB,EAAWmB,EAAa,GACrC,OAAKC,EAEW,IAAZF,EACKE,EAAKjB,QAAU,IAAMiB,EAAKnB,SAInB,KAAZiB,GAAkBE,EAAKf,QAClB,sBAAwBe,EAAKlB,OAIxBW,EAAeK,GAAS,IAGtBE,EAAKf,SAAWa,GAAW,GACf,OAAS,KAEVE,EAAKlB,OAlBdW,EAAeK,GAAS,EAmB5C,CAaA,SAASG,EAAgBd,EAAGe,EAAU,IACpC,GAAU,KAANf,EAAU,OAAOR,EAGrB,GAAIQ,EAAI,MAAO,CACb,MAAMH,EAA8B,aAAnBkB,EAAQC,OACzB,OAAOV,EAAeW,OAAOjB,GAAIH,EACnC,CAEA,OAWF,SAAgCG,EAAGe,GAGjC,MAAMG,EAAgB,GACtB,IAAIC,EAAOnB,EACX,KAAOmB,EAAO,IACZD,EAAcE,KAAKH,OAAOE,EAAO,QACjCA,GAAc,MAIhB,IAAIE,EAAS,GAEb,IAAK,IAAIC,EAAIJ,EAAclC,OAAS,EAAGsC,GAAK,EAAGA,IAAK,CAClD,MAAMX,EAAUO,EAAcI,GAC9B,GAAgB,IAAZX,EAAe,SAEnB,IAAIY,EAIFA,EAHQ,IAAND,EAGahB,EAAeK,EADM,aAAnBI,EAAQC,QAIVN,EAAiBC,EAASW,GAGvCD,GAAUE,EACZF,GAAU,IAAME,EACPA,IACTF,EAASE,EAEb,CAEA,OAAOF,CACT,CA9CSG,CAAsBxB,EAAGe,EAClC,MA+FA,SAAkBU,EAAOV,GACvBA,ECjOK,SAA0BA,GAC/B,QAAgBW,IAAZX,EAAuB,MAAO,CAAA,EAClC,GCCK,SAAwBU,GAC7B,GAAc,OAAVA,GAAmC,iBAAVA,EAAoB,OAAO,EACxD,MAAME,EAAQC,OAAOC,eAAeJ,GACpC,OAAiB,OAAVE,GAAkBA,IAAUC,OAAOE,SAC5C,CDLMC,CAAchB,GAAU,OAAOA,EACnC,MAAM,IAAIiB,UACR,mEAAmEjB,EAEvE,CD2NYkB,CAAgBlB,GAC1B,MAAMhD,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GD9N5B,SAA4BmD,GACjC,MAAMS,SAAcT,EAGpB,GAAa,WAATS,EACF,OAAOT,EAAQ,GACX,CAAE1D,YAAY,EAAMI,aAAcsD,GAClC,CAAE1D,YAAY,EAAOI,YAAasD,GAIxC,GAAa,WAATS,EAAmB,CACrB,IAAKjB,OAAOkB,SAASV,GACnB,MAAM,IAAIW,MAAM,8DAElB,OAAInB,OAAOoB,cAAcZ,GAChBA,EAAQ,EACX,CAAE1D,YAAY,EAAMI,YAAaC,QAAQqD,IACzC,CAAE1D,YAAY,EAAOI,YAAaC,OAAOqD,IAExC5D,EAgBX,SAAyB4D,GACvB,MAAM3D,EAAM2D,EAAMa,WAClB,OAAQxE,EAAIyE,SAAS,MAAQzE,EAAIyE,SAAS,KACtChE,EAAyBT,GACzBA,CACN,CArB8B0E,CAAef,GAC3C,CAGA,GAAa,WAATS,EACF,OAAOrE,EAqBX,SAA0B4D,GACxB,MAAMgB,EAAUhB,EAAMiB,OACtB,GAAuB,IAAnBD,EAAQzD,QAAgBiC,OAAO0B,MAAM1B,OAAOwB,IAC9C,MAAM,IAAIL,MAAM,2BAA2BX,MAE7C,OAAQgB,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9ChE,EAAyBkE,GACzBA,CACN,CA7B8BG,CAAgBnB,IAG5C,MAAM,IAAIO,UACR,oEAAoEE,IAExE,CC+LmDW,CAAkBpB,GAEnE,IAAIJ,EAAS,GAYb,OAVItD,IACFsD,EAASyB,UAGXzB,GAAUP,EAAe3C,EAAa4C,GAElCzC,IACF+C,GAAU,YAtDd,SAA6B/C,GAC3B,IAAI+C,EAAS,GACTC,EAAI,EAGR,KAAOA,EAAIhD,EAAYU,QAA6B,MAAnBV,EAAYgD,IACvCD,IAAQA,GAAU,KACtBA,GAAU7B,EACV8B,IAIF,MAAMyB,EAAYzE,EAAYN,MAAMsD,GACpC,GAAIyB,EAAW,CACT1B,IAAQA,GAAU,KACtB,MAAMrB,EAAI5B,OAAO2E,GAEf1B,GADErB,EAAI,MACIM,EAAeW,OAAOjB,IAAI,GAAO,GAEjCc,EAAed,EAAG,CAAEgB,OAAQ,aAE1C,CAEA,OAAOK,CACT,CA8BwC2B,CAAmB1E,IAGlD+C,CACT"}

package/dist/languages/ru.js

@@ -1,3 +0,0 @@
-/*! n2words/ru 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),u=(-1===i?t.length:i)+r;return u>=o.length?o+"0".repeat(u-o.length):u<=0?"0."+"0".repeat(-u)+o:o.slice(0,u)+"."+o.slice(u)}function r(e,t){const n="bigint"==typeof e?Number(e):e,r=n%10,i=n%100;return i>=11&&i<=19?t[2]:1===r?t[0]:r>=2&&r<=4?t[1]:t[2]}function i(e,t,n,r,i){if(0===e)return"";const o=e%10,u=Math.floor(e/10)%10,s=Math.floor(e/100),c=[];return s>0&&c.push(i[s]),u>1&&c.push(r[u]),1===u?c.push(n[o]):o>0&&c.push(t[o]),c.join(" ")}const o="ноль",u=[["тысяча","тысячи","тысяч"],["миллион","миллиона","миллионов"],["миллиард","миллиарда","миллиардов"],["триллион","триллиона","триллионов"],["квадриллион","квадриллиона","квадриллионов"],["квинтиллион","квинтиллиона","квинтиллионов"],["секстиллион","секстиллиона","секстиллионов"],["септиллион","септиллиона","септиллионов"],["октиллион","октиллиона","октиллионов"],["нониллион","нониллиона","нониллионов"]],{masc:s,fem:c}=function(e,t,n,r,o){const u=new Array(1e3),s=new Array(1e3);for(let c=0;c<1e3;c++)u[c]=i(c,e,n,r,o),s[c]=i(c,t,n,r,o);return{masc:u,fem:s}}(["","один","два","три","четыре","пять","шесть","семь","восемь","девять"],["","одна","две","три","четыре","пять","шесть","семь","восемь","девять"],["десять","одиннадцать","двенадцать","тринадцать","четырнадцать","пятнадцать","шестнадцать","семнадцать","восемнадцать","девятнадцать"],["","","двадцать","тридцать","сорок","пятьдесят","шестьдесят","семьдесят","восемьдесят","девяносто"],["","сто","двести","триста","четыреста","пятьсот","шестьсот","семьсот","восемьсот","девятьсот"]);function f(e,t={}){if(0n===e)return o;const n="feminine"===t.gender;if(e<1000n)return(n?c:s)[Number(e)];if(e<1000000n){const t=Number(e/1000n),i=Number(e%1000n);let o=c[t]+" "+r(t,u[0]);return i>0&&(o+=" "+(n?c:s)[i]),o}return function(e,t){const n="feminine"===t.gender,i=e.toString(),o=i.length,f=[],l=o%3;let a=0;for(l>0&&(f.push(Number(i.slice(0,l))),a=l);a<o;)f.push(Number(i.slice(a,a+3))),a+=3;const g=[];let p=f.length-1;for(let e=0;e<f.length;e++){const t=f[e];if(0!==t)if(0===p)g.push((n?c:s)[t]);else{const e=r(t,u[p-1]);g.push((1===p?c:s)[t]+" "+e)}p--}return g.join(" ")}(e,t)}e.ru=function(e,r){r=function(e){if(void 0===e)return{};if(function(e){if(null===e||"object"!=typeof e)return!1;const t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}(e))return e;throw new TypeError("Invalid options: expected plain object or undefined, got "+typeof e)}(r);const{isNegative:i,integerPart:u,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 c="";return i&&(c="минус "),c+=f(u,r),s&&(c+=" запятая "+function(e,t){let n="",r=0;for(;r<e.length&&"0"===e[r];)n&&(n+=" "),n+=o,r++;const i=e.slice(r);return i&&(n&&(n+=" "),n+=f(BigInt(i),t)),n}(s,r)),c}},"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).n2words=e.n2words||{});
-//# sourceMappingURL=ru.js.map

package/dist/languages/ru.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ru.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/ru.js","../../lib/utils/validate-options.js","../../lib/utils/is-plain-object.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * Russian language converter - Functional Implementation\n *\n * Self-contained converter using shared Slavic utilities.\n *\n * Key features:\n * - Three-form pluralization (one/few/many)\n * - Gender: thousands are feminine, millions+ are masculine\n * - Irregular hundreds (двести, триста, etc.)\n * - Long scale naming\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\nimport { validateOptions } from '../utils/validate-options.js'\n\n// ============================================================================\n// Slavic Utilities (inlined for performance)\n// ============================================================================\n\nfunction pluralize (n, forms) {\n  const num = typeof n === 'bigint' ? Number(n) : n\n  const lastDigit = num % 10\n  const lastTwoDigits = num % 100\n\n  if (lastTwoDigits >= 11 && lastTwoDigits <= 19) {\n    return forms[2]\n  }\n\n  if (lastDigit === 1) return forms[0]\n  if (lastDigit >= 2 && lastDigit <= 4) return forms[1]\n  return forms[2]\n}\n\nfunction buildAllSegments (onesMasc, onesFem, teens, tens, hundreds) {\n  const masc = new Array(1000)\n  const fem = new Array(1000)\n\n  for (let i = 0; i < 1000; i++) {\n    masc[i] = buildSegment(i, onesMasc, teens, tens, hundreds)\n    fem[i] = buildSegment(i, onesFem, teens, tens, hundreds)\n  }\n\n  return { masc, fem }\n}\n\nfunction buildSegment (n, ones, teens, tens, hundreds) {\n  if (n === 0) return ''\n\n  const onesDigit = n % 10\n  const tensDigit = Math.floor(n / 10) % 10\n  const hundredsDigit = Math.floor(n / 100)\n\n  const parts = []\n\n  if (hundredsDigit > 0) {\n    parts.push(hundreds[hundredsDigit])\n  }\n\n  if (tensDigit > 1) {\n    parts.push(tens[tensDigit])\n  }\n\n  if (tensDigit === 1) {\n    parts.push(teens[onesDigit])\n  } else if (onesDigit > 0) {\n    parts.push(ones[onesDigit])\n  }\n\n  return parts.join(' ')\n}\n\n// ============================================================================\n// Vocabulary\n// ============================================================================\n\nconst ONES_MASC = ['', 'один', 'два', 'три', 'четыре', 'пять', 'шесть', 'семь', 'восемь', 'девять']\nconst ONES_FEM = ['', 'одна', 'две', 'три', 'четыре', 'пять', 'шесть', 'семь', 'восемь', 'девять']\n\nconst TEENS = ['десять', 'одиннадцать', 'двенадцать', 'тринадцать', 'четырнадцать', 'пятнадцать', 'шестнадцать', 'семнадцать', 'восемнадцать', 'девятнадцать']\nconst TENS = ['', '', 'двадцать', 'тридцать', 'сорок', 'пятьдесят', 'шестьдесят', 'семьдесят', 'восемьдесят', 'девяносто']\n\n// Irregular hundreds\nconst HUNDREDS = ['', 'сто', 'двести', 'триста', 'четыреста', 'пятьсот', 'шестьсот', 'семьсот', 'восемьсот', 'девятьсот']\n\nconst ZERO = 'ноль'\nconst NEGATIVE = 'минус'\nconst DECIMAL_SEP = 'запятая'\n\n// Scale words: [singular, few, many]\n// Thousands (index 0) are feminine, rest are masculine\nconst SCALE_FORMS = [\n  ['тысяча', 'тысячи', 'тысяч'],\n  ['миллион', 'миллиона', 'миллионов'],\n  ['миллиард', 'миллиарда', 'миллиардов'],\n  ['триллион', 'триллиона', 'триллионов'],\n  ['квадриллион', 'квадриллиона', 'квадриллионов'],\n  ['квинтиллион', 'квинтиллиона', 'квинтиллионов'],\n  ['секстиллион', 'секстиллиона', 'секстиллионов'],\n  ['септиллион', 'септиллиона', 'септиллионов'],\n  ['октиллион', 'октиллиона', 'октиллионов'],\n  ['нониллион', 'нониллиона', 'нониллионов']\n]\n\n// ============================================================================\n// Precomputed Lookup Tables\n// ============================================================================\n\nconst { masc: SEGMENTS_MASC, fem: SEGMENTS_FEM } = buildAllSegments(ONES_MASC, ONES_FEM, TEENS, TENS, HUNDREDS)\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\nfunction integerToWords (n, options = {}) {\n  if (n === 0n) return ZERO\n\n  const feminine = options.gender === 'feminine'\n\n  if (n < 1000n) {\n    const segments = feminine ? SEGMENTS_FEM : SEGMENTS_MASC\n    return segments[Number(n)]\n  }\n\n  if (n < 1_000_000n) {\n    const thousands = Number(n / 1000n)\n    const remainder = Number(n % 1000n)\n\n    // Thousands are always feminine in Russian\n    const thousandsWord = SEGMENTS_FEM[thousands]\n    const scaleWord = pluralize(thousands, SCALE_FORMS[0])\n\n    let result = thousandsWord + ' ' + scaleWord\n\n    if (remainder > 0) {\n      const segments = feminine ? SEGMENTS_FEM : SEGMENTS_MASC\n      result += ' ' + segments[remainder]\n    }\n\n    return result\n  }\n\n  return buildLargeNumberWords(n, options)\n}\n\nfunction buildLargeNumberWords (n, options) {\n  const feminine = options.gender === 'feminine'\n  const numStr = n.toString()\n  const len = numStr.length\n\n  const segments = []\n  const segmentSize = 3\n\n  const remainderLen = len % segmentSize\n  let pos = 0\n  if (remainderLen > 0) {\n    segments.push(Number(numStr.slice(0, remainderLen)))\n    pos = remainderLen\n  }\n  while (pos < len) {\n    segments.push(Number(numStr.slice(pos, pos + segmentSize)))\n    pos += segmentSize\n  }\n\n  const parts = []\n  let scaleIndex = segments.length - 1\n\n  for (let i = 0; i < segments.length; i++) {\n    const segment = segments[i]\n\n    if (segment !== 0) {\n      if (scaleIndex === 0) {\n        const segmentWords = feminine ? SEGMENTS_FEM : SEGMENTS_MASC\n        parts.push(segmentWords[segment])\n      } else {\n        const scaleForms = SCALE_FORMS[scaleIndex - 1]\n        const scaleWord = pluralize(segment, scaleForms)\n        // Thousands (scaleIndex=1) are feminine, others masculine\n        const isFeminine = scaleIndex === 1\n        const segmentWords = isFeminine ? SEGMENTS_FEM : SEGMENTS_MASC\n        parts.push(segmentWords[segment] + ' ' + scaleWord)\n      }\n    }\n\n    scaleIndex--\n  }\n\n  return parts.join(' ')\n}\n\nfunction decimalPartToWords (decimalPart, options) {\n  let result = ''\n  let i = 0\n\n  while (i < decimalPart.length && decimalPart[i] === '0') {\n    if (result) result += ' '\n    result += ZERO\n    i++\n  }\n\n  const remainder = decimalPart.slice(i)\n  if (remainder) {\n    if (result) result += ' '\n    result += integerToWords(BigInt(remainder), options)\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to Russian words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @param {Object} [options] - Optional configuration\n * @param {('masculine'|'feminine')} [options.gender='masculine'] - Grammatical gender\n * @returns {string} The number in Russian words\n */\nfunction toWords (value, options) {\n  options = validateOptions(options)\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart, options)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart, options)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Exports\n// ============================================================================\n\nexport { toWords }\n","import { isPlainObject } from './is-plain-object.js'\n\n/**\n * Validates and normalizes the options parameter.\n *\n * @param {*} options The options value to validate\n * @returns {Object} A valid options object (empty object if undefined)\n * @throws {TypeError} If options is not undefined or a plain object\n */\nexport function validateOptions (options) {\n  if (options === undefined) return {}\n  if (isPlainObject(options)) return options\n  throw new TypeError(\n    `Invalid options: expected plain object or undefined, got ${typeof options}`\n  )\n}\n","/**\n * Checks if a value is a plain object (not null, array, or other object types).\n *\n * A plain object is one created by:\n * - Object literal: `{}`\n * - Object.create(null): null-prototype object\n *\n * This excludes arrays, class instances, Map, Set, and other object types.\n *\n * @param {*} value Value to check\n * @returns {boolean} True if value is a plain object\n */\nexport function isPlainObject (value) {\n  if (value === null || typeof value !== 'object') return false\n  const proto = Object.getPrototypeOf(value)\n  return proto === null || proto === Object.prototype\n}\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","pluralize","n","forms","num","Number","lastDigit","lastTwoDigits","buildSegment","ones","teens","tens","hundreds","onesDigit","tensDigit","Math","floor","hundredsDigit","parts","push","join","ZERO","SCALE_FORMS","masc","SEGMENTS_MASC","fem","SEGMENTS_FEM","onesMasc","onesFem","Array","i","buildAllSegments","integerToWords","options","feminine","gender","thousands","remainder","result","numStr","toString","len","segments","remainderLen","pos","scaleIndex","segment","scaleWord","buildLargeNumberWords","value","undefined","proto","Object","getPrototypeOf","prototype","isPlainObject","TypeError","validateOptions","type","isFinite","Error","isSafeInteger","includes","numberToString","trimmed","trim","isNaN","normalizeString","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,SAASG,EAAWC,EAAGC,GACrB,MAAMC,EAAmB,iBAANF,EAAiBG,OAAOH,GAAKA,EAC1CI,EAAYF,EAAM,GAClBG,EAAgBH,EAAM,IAE5B,OAAIG,GAAiB,IAAMA,GAAiB,GACnCJ,EAAM,GAGG,IAAdG,EAAwBH,EAAM,GAC9BG,GAAa,GAAKA,GAAa,EAAUH,EAAM,GAC5CA,EAAM,EACf,CAcA,SAASK,EAAcN,EAAGO,EAAMC,EAAOC,EAAMC,GAC3C,GAAU,IAANV,EAAS,MAAO,GAEpB,MAAMW,EAAYX,EAAI,GAChBY,EAAYC,KAAKC,MAAMd,EAAI,IAAM,GACjCe,EAAgBF,KAAKC,MAAMd,EAAI,KAE/BgB,EAAQ,GAgBd,OAdID,EAAgB,GAClBC,EAAMC,KAAKP,EAASK,IAGlBH,EAAY,GACdI,EAAMC,KAAKR,EAAKG,IAGA,IAAdA,EACFI,EAAMC,KAAKT,EAAMG,IACRA,EAAY,GACrBK,EAAMC,KAAKV,EAAKI,IAGXK,EAAME,KAAK,IACpB,CAMA,MASMC,EAAO,OAMPC,EAAc,CAClB,CAAC,SAAU,SAAU,SACrB,CAAC,UAAW,WAAY,aACxB,CAAC,WAAY,YAAa,cAC1B,CAAC,WAAY,YAAa,cAC1B,CAAC,cAAe,eAAgB,iBAChC,CAAC,cAAe,eAAgB,iBAChC,CAAC,cAAe,eAAgB,iBAChC,CAAC,aAAc,cAAe,gBAC9B,CAAC,YAAa,aAAc,eAC5B,CAAC,YAAa,aAAc,iBAOtBC,KAAMC,EAAeC,IAAKC,GA1ElC,SAA2BC,EAAUC,EAASlB,EAAOC,EAAMC,GACzD,MAAMW,EAAO,IAAIM,MAAM,KACjBJ,EAAM,IAAII,MAAM,KAEtB,IAAK,IAAIC,EAAI,EAAGA,EAAI,IAAMA,IACxBP,EAAKO,GAAKtB,EAAasB,EAAGH,EAAUjB,EAAOC,EAAMC,GACjDa,EAAIK,GAAKtB,EAAasB,EAAGF,EAASlB,EAAOC,EAAMC,GAGjD,MAAO,CAAEW,OAAME,MACjB,CAgEmDM,CAhCjC,CAAC,GAAI,OAAQ,MAAO,MAAO,SAAU,OAAQ,QAAS,OAAQ,SAAU,UACzE,CAAC,GAAI,OAAQ,MAAO,MAAO,SAAU,OAAQ,QAAS,OAAQ,SAAU,UAE3E,CAAC,SAAU,cAAe,aAAc,aAAc,eAAgB,aAAc,cAAe,aAAc,eAAgB,gBAClI,CAAC,GAAI,GAAI,WAAY,WAAY,QAAS,YAAa,aAAc,YAAa,cAAe,aAG7F,CAAC,GAAI,MAAO,SAAU,SAAU,YAAa,UAAW,WAAY,UAAW,YAAa,cA+B7G,SAASC,EAAgB9B,EAAG+B,EAAU,IACpC,GAAU,KAAN/B,EAAU,OAAOmB,EAErB,MAAMa,EAA8B,aAAnBD,EAAQE,OAEzB,GAAIjC,EAAI,MAEN,OADiBgC,EAAWR,EAAeF,GAC3BnB,OAAOH,IAGzB,GAAIA,EAAI,SAAY,CAClB,MAAMkC,EAAY/B,OAAOH,EAAI,OACvBmC,EAAYhC,OAAOH,EAAI,OAM7B,IAAIoC,EAHkBZ,EAAaU,GAGN,IAFXnC,EAAUmC,EAAWd,EAAY,IASnD,OALIe,EAAY,IAEdC,GAAU,KADOJ,EAAWR,EAAeF,GAClBa,IAGpBC,CACT,CAEA,OAGF,SAAgCpC,EAAG+B,GACjC,MAAMC,EAA8B,aAAnBD,EAAQE,OACnBI,EAASrC,EAAEsC,WACXC,EAAMF,EAAOxC,OAEb2C,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAASvB,KAAKd,OAAOkC,EAAOxD,MAAM,EAAG4D,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAASvB,KAAKd,OAAOkC,EAAOxD,MAAM6D,EAAKA,EATrB,KAUlBA,GAVkB,EAapB,MAAM1B,EAAQ,GACd,IAAI2B,EAAaH,EAAS3C,OAAS,EAEnC,IAAK,IAAI+B,EAAI,EAAGA,EAAIY,EAAS3C,OAAQ+B,IAAK,CACxC,MAAMgB,EAAUJ,EAASZ,GAEzB,GAAgB,IAAZgB,EACF,GAAmB,IAAfD,EAEF3B,EAAMC,MADee,EAAWR,EAAeF,GACvBsB,QACnB,CACL,MACMC,EAAY9C,EAAU6C,EADTxB,EAAYuB,EAAa,IAK5C3B,EAAMC,MAF4B,IAAf0B,EACenB,EAAeF,GACzBsB,GAAW,IAAMC,EAC3C,CAGFF,GACF,CAEA,OAAO3B,EAAME,KAAK,IACpB,CA9CS4B,CAAsB9C,EAAG+B,EAClC,MA0EA,SAAkBgB,EAAOhB,GACvBA,EChNK,SAA0BA,GAC/B,QAAgBiB,IAAZjB,EAAuB,MAAO,CAAA,EAClC,GCCK,SAAwBgB,GAC7B,GAAc,OAAVA,GAAmC,iBAAVA,EAAoB,OAAO,EACxD,MAAME,EAAQC,OAAOC,eAAeJ,GACpC,OAAiB,OAAVE,GAAkBA,IAAUC,OAAOE,SAC5C,CDLMC,CAActB,GAAU,OAAOA,EACnC,MAAM,IAAIuB,UACR,mEAAmEvB,EAEvE,CD0MYwB,CAAgBxB,GAC1B,MAAMnD,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GD7M5B,SAA4B4D,GACjC,MAAMS,SAAcT,EAGpB,GAAa,WAATS,EACF,OAAOT,EAAQ,GACX,CAAEnE,YAAY,EAAMI,aAAc+D,GAClC,CAAEnE,YAAY,EAAOI,YAAa+D,GAIxC,GAAa,WAATS,EAAmB,CACrB,IAAKrD,OAAOsD,SAASV,GACnB,MAAM,IAAIW,MAAM,8DAElB,OAAIvD,OAAOwD,cAAcZ,GAChBA,EAAQ,EACX,CAAEnE,YAAY,EAAMI,YAAaC,QAAQ8D,IACzC,CAAEnE,YAAY,EAAOI,YAAaC,OAAO8D,IAExCrE,EAgBX,SAAyBqE,GACvB,MAAMpE,EAAMoE,EAAMT,WAClB,OAAQ3D,EAAIiF,SAAS,MAAQjF,EAAIiF,SAAS,KACtCxE,EAAyBT,GACzBA,CACN,CArB8BkF,CAAed,GAC3C,CAGA,GAAa,WAATS,EACF,OAAO9E,EAqBX,SAA0BqE,GACxB,MAAMe,EAAUf,EAAMgB,OACtB,GAAuB,IAAnBD,EAAQjE,QAAgBM,OAAO6D,MAAM7D,OAAO2D,IAC9C,MAAM,IAAIJ,MAAM,2BAA2BX,MAE7C,OAAQe,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9CxE,EAAyB0E,GACzBA,CACN,CA7B8BG,CAAgBlB,IAG5C,MAAM,IAAIO,UACR,oEAAoEE,IAExE,CC8KmDU,CAAkBnB,GAEnE,IAAIX,EAAS,GAYb,OAVIxD,IACFwD,EAAS+B,UAGX/B,GAAUN,EAAe9C,EAAa+C,GAElC5C,IACFiD,GAAU,YAxCd,SAA6BjD,EAAa4C,GACxC,IAAIK,EAAS,GACTR,EAAI,EAER,KAAOA,EAAIzC,EAAYU,QAA6B,MAAnBV,EAAYyC,IACvCQ,IAAQA,GAAU,KACtBA,GAAUjB,EACVS,IAGF,MAAMO,EAAYhD,EAAYN,MAAM+C,GAMpC,OALIO,IACEC,IAAQA,GAAU,KACtBA,GAAUN,EAAe7C,OAAOkD,GAAYJ,IAGvCK,CACT,CAuBwCgC,CAAmBjF,EAAa4C,IAG/DK,CACT"}

package/dist/languages/sr-Cyrl.js

@@ -1,3 +0,0 @@
-/*! n2words/sr-Cyrl 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)}function r(e,t){const n="bigint"==typeof e?Number(e):e,r=n%10,i=n%100;return i>=11&&i<=19?t[2]:1===r?t[0]:r>=2&&r<=4?t[1]:t[2]}function i(e,t,n,r,i){if(0===e)return"";const o=e%10,s=Math.floor(e/10)%10,u=Math.floor(e/100),c=[];return u>0&&c.push(i[u]),s>1&&c.push(r[s]),1===s?c.push(n[o]):o>0&&c.push(t[o]),c.join(" ")}const o="нула",s=[["хиљада","хиљаде","хиљада"],["милион","милиона","милиона"],["милијарда","милијарде","милијарда"],["билион","билиона","билиона"],["билијарда","билијарде","билијарда"],["трилион","трилиона","трилиона"],["трилијарда","трилијарде","трилијарда"],["квадрилион","квадрилиона","квадрилиона"],["квадрилијарда","квадрилијарде","квадрилијарда"]],{masc:u,fem:c}=function(e,t,n,r,o){const s=new Array(1e3),u=new Array(1e3);for(let c=0;c<1e3;c++)s[c]=i(c,e,n,r,o),u[c]=i(c,t,n,r,o);return{masc:s,fem:u}}(["","један","два","три","четири","пет","шест","седам","осам","девет"],["","једна","две","три","четири","пет","шест","седам","осам","девет"],["десет","једанаест","дванаест","тринаест","четрнаест","петнаест","шеснаест","седамнаест","осамнаест","деветнаест"],["","","двадесет","тридесет","четрдесет","педесет","шездесет","седамдесет","осамдесет","деведесет"],["","сто","двеста","триста","четиристо","петсто","шесто","седамсто","осамсто","девестo"]);function f(e,t={}){return 0n===e?o:e<1000n?("feminine"===t.gender?c:u)[Number(e)]:function(e,t){const n=e.toString(),i=n.length,o=[],f=i%3;let l=0;for(f>0&&(o.push(Number(n.slice(0,f))),l=f);l<i;)o.push(Number(n.slice(l,l+3))),l+=3;const a=[];let g=o.length-1;for(let e=0;e<o.length;e++){const n=o[e];if(0!==n)if(0===g)a.push(("feminine"===t.gender?c:u)[n]);else{const e=r(n,s[g-1]);a.push((1===g?c:u)[n]+" "+e)}g--}return a.join(" ")}(e,t)}e.srCyrl=function(e,r){r=function(e){if(void 0===e)return{};if(function(e){if(null===e||"object"!=typeof e)return!1;const t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}(e))return e;throw new TypeError("Invalid options: expected plain object or undefined, got "+typeof e)}(r);const{isNegative:i,integerPart:s,decimalPart:u}=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 c="";return i&&(c="минус "),c+=f(s,r),u&&(c+=" запета "+function(e,t){let n="",r=0;for(;r<e.length&&"0"===e[r];)n&&(n+=" "),n+=o,r++;const i=e.slice(r);return i&&(n&&(n+=" "),n+=f(BigInt(i),t)),n}(u,r)),c}},"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).n2words=e.n2words||{});
-//# sourceMappingURL=sr-Cyrl.js.map

package/dist/languages/sr-Cyrl.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sr-Cyrl.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/sr-Cyrl.js","../../lib/utils/validate-options.js","../../lib/utils/is-plain-object.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * Serbian Cyrillic language converter - Functional Implementation\n *\n * Self-contained converter using shared Slavic utilities.\n *\n * Key features:\n * - Three-form pluralization (one/few/many)\n * - Gender: thousands are feminine, millions+ are masculine\n * - Irregular hundreds\n * - Long scale naming with -ard forms\n * - Cyrillic script\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\nimport { validateOptions } from '../utils/validate-options.js'\n\n// ============================================================================\n// Slavic Utilities (inlined for performance)\n// ============================================================================\n\nfunction pluralize (n, forms) {\n  const num = typeof n === 'bigint' ? Number(n) : n\n  const lastDigit = num % 10\n  const lastTwoDigits = num % 100\n\n  if (lastTwoDigits >= 11 && lastTwoDigits <= 19) {\n    return forms[2]\n  }\n\n  if (lastDigit === 1) return forms[0]\n  if (lastDigit >= 2 && lastDigit <= 4) return forms[1]\n  return forms[2]\n}\n\nfunction buildAllSegments (onesMasc, onesFem, teens, tens, hundreds) {\n  const masc = new Array(1000)\n  const fem = new Array(1000)\n\n  for (let i = 0; i < 1000; i++) {\n    masc[i] = buildSegment(i, onesMasc, teens, tens, hundreds)\n    fem[i] = buildSegment(i, onesFem, teens, tens, hundreds)\n  }\n\n  return { masc, fem }\n}\n\nfunction buildSegment (n, ones, teens, tens, hundreds) {\n  if (n === 0) return ''\n\n  const onesDigit = n % 10\n  const tensDigit = Math.floor(n / 10) % 10\n  const hundredsDigit = Math.floor(n / 100)\n\n  const parts = []\n\n  if (hundredsDigit > 0) {\n    parts.push(hundreds[hundredsDigit])\n  }\n\n  if (tensDigit > 1) {\n    parts.push(tens[tensDigit])\n  }\n\n  if (tensDigit === 1) {\n    parts.push(teens[onesDigit])\n  } else if (onesDigit > 0) {\n    parts.push(ones[onesDigit])\n  }\n\n  return parts.join(' ')\n}\n\n// ============================================================================\n// Vocabulary\n// ============================================================================\n\nconst ONES_MASC = ['', 'један', 'два', 'три', 'четири', 'пет', 'шест', 'седам', 'осам', 'девет']\nconst ONES_FEM = ['', 'једна', 'две', 'три', 'четири', 'пет', 'шест', 'седам', 'осам', 'девет']\nconst TEENS = ['десет', 'једанаест', 'дванаест', 'тринаест', 'четрнаест', 'петнаест', 'шеснаест', 'седамнаест', 'осамнаест', 'деветнаест']\nconst TENS = ['', '', 'двадесет', 'тридесет', 'четрдесет', 'педесет', 'шездесет', 'седамдесет', 'осамдесет', 'деведесет']\nconst HUNDREDS = ['', 'сто', 'двеста', 'триста', 'четиристо', 'петсто', 'шесто', 'седамсто', 'осамсто', 'девестo']\n\nconst ZERO = 'нула'\nconst NEGATIVE = 'минус'\nconst DECIMAL_SEP = 'запета'\n\n// Scale words: [singular, few, many]\nconst SCALE_FORMS = [\n  ['хиљада', 'хиљаде', 'хиљада'],\n  ['милион', 'милиона', 'милиона'],\n  ['милијарда', 'милијарде', 'милијарда'],\n  ['билион', 'билиона', 'билиона'],\n  ['билијарда', 'билијарде', 'билијарда'],\n  ['трилион', 'трилиона', 'трилиона'],\n  ['трилијарда', 'трилијарде', 'трилијарда'],\n  ['квадрилион', 'квадрилиона', 'квадрилиона'],\n  ['квадрилијарда', 'квадрилијарде', 'квадрилијарда']\n]\n\n// ============================================================================\n// Precomputed Lookup Tables\n// ============================================================================\n\nconst { masc: SEGMENTS_MASC, fem: SEGMENTS_FEM } = buildAllSegments(ONES_MASC, ONES_FEM, TEENS, TENS, HUNDREDS)\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\nfunction integerToWords (n, options = {}) {\n  if (n === 0n) return ZERO\n\n  if (n < 1000n) {\n    const segments = options.gender === 'feminine' ? SEGMENTS_FEM : SEGMENTS_MASC\n    return segments[Number(n)]\n  }\n\n  return buildLargeNumberWords(n, options)\n}\n\nfunction buildLargeNumberWords (n, options) {\n  const numStr = n.toString()\n  const len = numStr.length\n\n  const segments = []\n  const segmentSize = 3\n\n  const remainderLen = len % segmentSize\n  let pos = 0\n  if (remainderLen > 0) {\n    segments.push(Number(numStr.slice(0, remainderLen)))\n    pos = remainderLen\n  }\n  while (pos < len) {\n    segments.push(Number(numStr.slice(pos, pos + segmentSize)))\n    pos += segmentSize\n  }\n\n  const parts = []\n  let scaleIndex = segments.length - 1\n\n  for (let i = 0; i < segments.length; i++) {\n    const segment = segments[i]\n\n    if (segment !== 0) {\n      if (scaleIndex === 0) {\n        const segmentWords = options.gender === 'feminine' ? SEGMENTS_FEM : SEGMENTS_MASC\n        parts.push(segmentWords[segment])\n      } else {\n        const scaleForms = SCALE_FORMS[scaleIndex - 1]\n        const scaleWord = pluralize(segment, scaleForms)\n        // Thousands (scaleIndex=1) are feminine, others masculine\n        const isFeminine = scaleIndex === 1\n        const segmentWords = isFeminine ? SEGMENTS_FEM : SEGMENTS_MASC\n        parts.push(segmentWords[segment] + ' ' + scaleWord)\n      }\n    }\n\n    scaleIndex--\n  }\n\n  return parts.join(' ')\n}\n\nfunction decimalPartToWords (decimalPart, options) {\n  let result = ''\n  let i = 0\n\n  while (i < decimalPart.length && decimalPart[i] === '0') {\n    if (result) result += ' '\n    result += ZERO\n    i++\n  }\n\n  const remainder = decimalPart.slice(i)\n  if (remainder) {\n    if (result) result += ' '\n    result += integerToWords(BigInt(remainder), options)\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to Serbian (Cyrillic) words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @param {Object} [options] - Optional configuration\n * @param {('masculine'|'feminine')} [options.gender='masculine'] - Grammatical gender\n * @returns {string} The number in Serbian Cyrillic words\n */\nfunction toWords (value, options) {\n  options = validateOptions(options)\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart, options)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart, options)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Exports\n// ============================================================================\n\nexport { toWords }\n","import { isPlainObject } from './is-plain-object.js'\n\n/**\n * Validates and normalizes the options parameter.\n *\n * @param {*} options The options value to validate\n * @returns {Object} A valid options object (empty object if undefined)\n * @throws {TypeError} If options is not undefined or a plain object\n */\nexport function validateOptions (options) {\n  if (options === undefined) return {}\n  if (isPlainObject(options)) return options\n  throw new TypeError(\n    `Invalid options: expected plain object or undefined, got ${typeof options}`\n  )\n}\n","/**\n * Checks if a value is a plain object (not null, array, or other object types).\n *\n * A plain object is one created by:\n * - Object literal: `{}`\n * - Object.create(null): null-prototype object\n *\n * This excludes arrays, class instances, Map, Set, and other object types.\n *\n * @param {*} value Value to check\n * @returns {boolean} True if value is a plain object\n */\nexport function isPlainObject (value) {\n  if (value === null || typeof value !== 'object') return false\n  const proto = Object.getPrototypeOf(value)\n  return proto === null || proto === Object.prototype\n}\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","pluralize","n","forms","num","Number","lastDigit","lastTwoDigits","buildSegment","ones","teens","tens","hundreds","onesDigit","tensDigit","Math","floor","hundredsDigit","parts","push","join","ZERO","SCALE_FORMS","masc","SEGMENTS_MASC","fem","SEGMENTS_FEM","onesMasc","onesFem","Array","i","buildAllSegments","integerToWords","options","gender","numStr","toString","len","segments","remainderLen","pos","scaleIndex","segment","scaleWord","buildLargeNumberWords","value","undefined","proto","Object","getPrototypeOf","prototype","isPlainObject","TypeError","validateOptions","type","isFinite","Error","isSafeInteger","includes","numberToString","trimmed","trim","isNaN","normalizeString","parseNumericValue","result","NEGATIVE","remainder","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,CCvFA,SAASG,EAAWC,EAAGC,GACrB,MAAMC,EAAmB,iBAANF,EAAiBG,OAAOH,GAAKA,EAC1CI,EAAYF,EAAM,GAClBG,EAAgBH,EAAM,IAE5B,OAAIG,GAAiB,IAAMA,GAAiB,GACnCJ,EAAM,GAGG,IAAdG,EAAwBH,EAAM,GAC9BG,GAAa,GAAKA,GAAa,EAAUH,EAAM,GAC5CA,EAAM,EACf,CAcA,SAASK,EAAcN,EAAGO,EAAMC,EAAOC,EAAMC,GAC3C,GAAU,IAANV,EAAS,MAAO,GAEpB,MAAMW,EAAYX,EAAI,GAChBY,EAAYC,KAAKC,MAAMd,EAAI,IAAM,GACjCe,EAAgBF,KAAKC,MAAMd,EAAI,KAE/BgB,EAAQ,GAgBd,OAdID,EAAgB,GAClBC,EAAMC,KAAKP,EAASK,IAGlBH,EAAY,GACdI,EAAMC,KAAKR,EAAKG,IAGA,IAAdA,EACFI,EAAMC,KAAKT,EAAMG,IACRA,EAAY,GACrBK,EAAMC,KAAKV,EAAKI,IAGXK,EAAME,KAAK,IACpB,CAMA,MAMMC,EAAO,OAKPC,EAAc,CAClB,CAAC,SAAU,SAAU,UACrB,CAAC,SAAU,UAAW,WACtB,CAAC,YAAa,YAAa,aAC3B,CAAC,SAAU,UAAW,WACtB,CAAC,YAAa,YAAa,aAC3B,CAAC,UAAW,WAAY,YACxB,CAAC,aAAc,aAAc,cAC7B,CAAC,aAAc,cAAe,eAC9B,CAAC,gBAAiB,gBAAiB,mBAO7BC,KAAMC,EAAeC,IAAKC,GArElC,SAA2BC,EAAUC,EAASlB,EAAOC,EAAMC,GACzD,MAAMW,EAAO,IAAIM,MAAM,KACjBJ,EAAM,IAAII,MAAM,KAEtB,IAAK,IAAIC,EAAI,EAAGA,EAAI,IAAMA,IACxBP,EAAKO,GAAKtB,EAAasB,EAAGH,EAAUjB,EAAOC,EAAMC,GACjDa,EAAIK,GAAKtB,EAAasB,EAAGF,EAASlB,EAAOC,EAAMC,GAGjD,MAAO,CAAEW,OAAME,MACjB,CA2DmDM,CA3BjC,CAAC,GAAI,QAAS,MAAO,MAAO,SAAU,MAAO,OAAQ,QAAS,OAAQ,SACvE,CAAC,GAAI,QAAS,MAAO,MAAO,SAAU,MAAO,OAAQ,QAAS,OAAQ,SACzE,CAAC,QAAS,YAAa,WAAY,WAAY,YAAa,WAAY,WAAY,aAAc,YAAa,cAChH,CAAC,GAAI,GAAI,WAAY,WAAY,YAAa,UAAW,WAAY,aAAc,YAAa,aAC5F,CAAC,GAAI,MAAO,SAAU,SAAU,YAAa,SAAU,QAAS,WAAY,UAAW,YA6BxG,SAASC,EAAgB9B,EAAG+B,EAAU,IACpC,OAAU,KAAN/B,EAAiBmB,EAEjBnB,EAAI,OAC8B,aAAnB+B,EAAQC,OAAwBR,EAAeF,GAChDnB,OAAOH,IAM3B,SAAgCA,EAAG+B,GACjC,MAAME,EAASjC,EAAEkC,WACXC,EAAMF,EAAOpC,OAEbuC,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAASnB,KAAKd,OAAO8B,EAAOpD,MAAM,EAAGwD,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAASnB,KAAKd,OAAO8B,EAAOpD,MAAMyD,EAAKA,EATrB,KAUlBA,GAVkB,EAapB,MAAMtB,EAAQ,GACd,IAAIuB,EAAaH,EAASvC,OAAS,EAEnC,IAAK,IAAI+B,EAAI,EAAGA,EAAIQ,EAASvC,OAAQ+B,IAAK,CACxC,MAAMY,EAAUJ,EAASR,GAEzB,GAAgB,IAAZY,EACF,GAAmB,IAAfD,EAEFvB,EAAMC,MADkC,aAAnBc,EAAQC,OAAwBR,EAAeF,GAC5CkB,QACnB,CACL,MACMC,EAAY1C,EAAUyC,EADTpB,EAAYmB,EAAa,IAK5CvB,EAAMC,MAF4B,IAAfsB,EACef,EAAeF,GACzBkB,GAAW,IAAMC,EAC3C,CAGFF,GACF,CAEA,OAAOvB,EAAME,KAAK,IACpB,CA7CSwB,CAAsB1C,EAAG+B,EAClC,UAyEA,SAAkBY,EAAOZ,GACvBA,ECvLK,SAA0BA,GAC/B,QAAgBa,IAAZb,EAAuB,MAAO,CAAA,EAClC,GCCK,SAAwBY,GAC7B,GAAc,OAAVA,GAAmC,iBAAVA,EAAoB,OAAO,EACxD,MAAME,EAAQC,OAAOC,eAAeJ,GACpC,OAAiB,OAAVE,GAAkBA,IAAUC,OAAOE,SAC5C,CDLMC,CAAclB,GAAU,OAAOA,EACnC,MAAM,IAAImB,UACR,mEAAmEnB,EAEvE,CDiLYoB,CAAgBpB,GAC1B,MAAMnD,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GDpL5B,SAA4BwD,GACjC,MAAMS,SAAcT,EAGpB,GAAa,WAATS,EACF,OAAOT,EAAQ,GACX,CAAE/D,YAAY,EAAMI,aAAc2D,GAClC,CAAE/D,YAAY,EAAOI,YAAa2D,GAIxC,GAAa,WAATS,EAAmB,CACrB,IAAKjD,OAAOkD,SAASV,GACnB,MAAM,IAAIW,MAAM,8DAElB,OAAInD,OAAOoD,cAAcZ,GAChBA,EAAQ,EACX,CAAE/D,YAAY,EAAMI,YAAaC,QAAQ0D,IACzC,CAAE/D,YAAY,EAAOI,YAAaC,OAAO0D,IAExCjE,EAgBX,SAAyBiE,GACvB,MAAMhE,EAAMgE,EAAMT,WAClB,OAAQvD,EAAI6E,SAAS,MAAQ7E,EAAI6E,SAAS,KACtCpE,EAAyBT,GACzBA,CACN,CArB8B8E,CAAed,GAC3C,CAGA,GAAa,WAATS,EACF,OAAO1E,EAqBX,SAA0BiE,GACxB,MAAMe,EAAUf,EAAMgB,OACtB,GAAuB,IAAnBD,EAAQ7D,QAAgBM,OAAOyD,MAAMzD,OAAOuD,IAC9C,MAAM,IAAIJ,MAAM,2BAA2BX,MAE7C,OAAQe,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9CpE,EAAyBsE,GACzBA,CACN,CA7B8BG,CAAgBlB,IAG5C,MAAM,IAAIO,UACR,oEAAoEE,IAExE,CCqJmDU,CAAkBnB,GAEnE,IAAIoB,EAAS,GAYb,OAVInF,IACFmF,EAASC,UAGXD,GAAUjC,EAAe9C,EAAa+C,GAElC5C,IACF4E,GAAU,WAxCd,SAA6B5E,EAAa4C,GACxC,IAAIgC,EAAS,GACTnC,EAAI,EAER,KAAOA,EAAIzC,EAAYU,QAA6B,MAAnBV,EAAYyC,IACvCmC,IAAQA,GAAU,KACtBA,GAAU5C,EACVS,IAGF,MAAMqC,EAAY9E,EAAYN,MAAM+C,GAMpC,OALIqC,IACEF,IAAQA,GAAU,KACtBA,GAAUjC,EAAe7C,OAAOgF,GAAYlC,IAGvCgC,CACT,CAuBwCG,CAAmB/E,EAAa4C,IAG/DgC,CACT"}

package/dist/languages/sr-Latn.js

@@ -1,3 +0,0 @@
-/*! n2words/sr-Latn 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 i=e.indexOf(".");if(-1===i)return{isNegative:t,integerPart:BigInt(e)};const n=e.slice(0,i)||"0",r=e.slice(i+1);return{isNegative:t,integerPart:BigInt(n),decimalPart:r}}function i(e){const[t,i]=e.toLowerCase().split("e"),n=parseInt(i,10),r=t.indexOf("."),s=-1===r?t:t.slice(0,r)+t.slice(r+1),a=(-1===r?t.length:r)+n;return a>=s.length?s+"0".repeat(a-s.length):a<=0?"0."+"0".repeat(-a)+s:s.slice(0,a)+"."+s.slice(a)}function n(e,t){const i="bigint"==typeof e?Number(e):e,n=i%10,r=i%100;return r>=11&&r<=19?t[2]:1===n?t[0]:n>=2&&n<=4?t[1]:t[2]}function r(e,t,i,n,r){if(0===e)return"";const s=e%10,a=Math.floor(e/10)%10,o=Math.floor(e/100),d=[];return o>0&&d.push(r[o]),a>1&&d.push(n[a]),1===a?d.push(i[s]):s>0&&d.push(t[s]),d.join(" ")}const s="nula",a=[["hiljada","hiljade","hiljada"],["milion","miliona","miliona"],["milijarda","milijarde","milijarda"],["bilion","biliona","biliona"],["bilijarda","bilijarde","bilijarda"],["trilion","triliona","triliona"],["trilijarda","trilijarde","trilijarda"],["kvadrilion","kvadriliona","kvadriliona"],["kvadrilijarda","kvadrilijarde","kvadrilijarda"]],{masc:o,fem:d}=function(e,t,i,n,s){const a=new Array(1e3),o=new Array(1e3);for(let d=0;d<1e3;d++)a[d]=r(d,e,i,n,s),o[d]=r(d,t,i,n,s);return{masc:a,fem:o}}(["","jedan","dva","tri","četiri","pet","šest","sedam","osam","devet"],["","jedna","dve","tri","četiri","pet","šest","sedam","osam","devet"],["deset","jedanaest","dvanaest","trinaest","četrnaest","petnaest","šesnaest","sedamnaest","osamnaest","devetnaest"],["","","dvadeset","trideset","četrdeset","pedeset","šezdeset","sedamdeset","osamdeset","devedeset"],["","sto","dvesta","trista","četiristo","petsto","šesto","sedamsto","osamsto","devetsto"]);function l(e,t={}){return 0n===e?s:e<1000n?("feminine"===t.gender?d:o)[Number(e)]:function(e,t){const i=e.toString(),r=i.length,s=[],l=r%3;let u=0;for(l>0&&(s.push(Number(i.slice(0,l))),u=l);u<r;)s.push(Number(i.slice(u,u+3))),u+=3;const c=[];let f=s.length-1;for(let e=0;e<s.length;e++){const i=s[e];if(0!==i)if(0===f)c.push(("feminine"===t.gender?d:o)[i]);else{const e=n(i,a[f-1]);c.push((1===f?d:o)[i]+" "+e)}f--}return c.join(" ")}(e,t)}e.srLatn=function(e,n){n=function(e){if(void 0===e)return{};if(function(e){if(null===e||"object"!=typeof e)return!1;const t=Object.getPrototypeOf(e);return null===t||t===Object.prototype}(e))return e;throw new TypeError("Invalid options: expected plain object or undefined, got "+typeof e)}(n);const{isNegative:r,integerPart:a,decimalPart:o}=function(e){const n=typeof e;if("bigint"===n)return e<0n?{isNegative:!0,integerPart:-e}:{isNegative:!1,integerPart:e};if("number"===n){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")?i(t):t}(e))}if("string"===n)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")?i(t):t}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${n}`)}(e);let d="";return r&&(d="minus "),d+=l(a,n),o&&(d+=" zapeta "+function(e,t){let i="",n=0;for(;n<e.length&&"0"===e[n];)i&&(i+=" "),i+=s,n++;const r=e.slice(n);return r&&(i&&(i+=" "),i+=l(BigInt(r),t)),i}(o,n)),d}},"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=sr-Latn.js.map

package/dist/languages/sr-Latn.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sr-Latn.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/sr-Latn.js","../../lib/utils/validate-options.js","../../lib/utils/is-plain-object.js"],"sourcesContent":["/**\n * Numeric value parsing utility.\n * Transforms user input (number, string, or bigint) into normalized components.\n * @module parse-numeric\n */\n\n/**\n * Parses a numeric value into its components.\n * @param {number|string|bigint} value\n * @returns {{isNegative: boolean, integerPart: bigint, decimalPart?: string}}\n * @throws {TypeError} If value is not number, string, or bigint\n * @throws {Error} If value is not a valid number format\n */\nexport function parseNumericValue (value) {\n  const type = typeof value\n\n  // BigInt: simplest case\n  if (type === 'bigint') {\n    return value < 0n\n      ? { isNegative: true, integerPart: -value }\n      : { isNegative: false, integerPart: value }\n  }\n\n  // Number: fast path for safe integers\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new Error('Number must be finite (NaN and Infinity are not supported)')\n    }\n    if (Number.isSafeInteger(value)) {\n      return value < 0\n        ? { isNegative: true, integerPart: BigInt(-value) }\n        : { isNegative: false, integerPart: BigInt(value) }\n    }\n    return parseNumericString(numberToString(value))\n  }\n\n  // String input\n  if (type === 'string') {\n    return parseNumericString(normalizeString(value))\n  }\n\n  throw new TypeError(\n    `Invalid value type: expected number, string, or bigint, received ${type}`\n  )\n}\n\n/**\n * Converts a number to decimal string, expanding scientific notation if needed.\n */\nfunction numberToString (value) {\n  const str = value.toString()\n  return (str.includes('e') || str.includes('E'))\n    ? expandScientificNotation(str)\n    : str\n}\n\n/**\n * Validates and normalizes a string numeric input.\n */\nfunction normalizeString (value) {\n  const trimmed = value.trim()\n  if (trimmed.length === 0 || Number.isNaN(Number(trimmed))) {\n    throw new Error(`Invalid number format: \"${value}\"`)\n  }\n  return (trimmed.includes('e') || trimmed.includes('E'))\n    ? expandScientificNotation(trimmed)\n    : trimmed\n}\n\n/**\n * Parses a normalized numeric string into components.\n */\nfunction parseNumericString (str) {\n  const isNegative = str[0] === '-'\n  if (isNegative) str = str.slice(1)\n\n  const dotIndex = str.indexOf('.')\n  if (dotIndex === -1) {\n    return { isNegative, integerPart: BigInt(str) }\n  }\n\n  const integerStr = str.slice(0, dotIndex) || '0'\n  const decimalPart = str.slice(dotIndex + 1)\n  return { isNegative, integerPart: BigInt(integerStr), decimalPart }\n}\n\n/**\n * Expands scientific notation to decimal form (e.g., \"1e21\" → \"1000...\").\n */\nfunction expandScientificNotation (str) {\n  const [mantissa, expStr] = str.toLowerCase().split('e')\n  const exp = parseInt(expStr, 10)\n\n  const dotIndex = mantissa.indexOf('.')\n  const digits = dotIndex === -1\n    ? mantissa\n    : mantissa.slice(0, dotIndex) + mantissa.slice(dotIndex + 1)\n  const integerLength = dotIndex === -1 ? mantissa.length : dotIndex\n  const newDotPosition = integerLength + exp\n\n  if (newDotPosition >= digits.length) {\n    return digits + '0'.repeat(newDotPosition - digits.length)\n  }\n  if (newDotPosition <= 0) {\n    return '0.' + '0'.repeat(-newDotPosition) + digits\n  }\n  return digits.slice(0, newDotPosition) + '.' + digits.slice(newDotPosition)\n}\n","/**\n * Serbian Latin language converter - Functional Implementation\n *\n * Self-contained converter using shared Slavic utilities.\n *\n * Key features:\n * - Three-form pluralization (one/few/many)\n * - Gender: thousands are feminine, millions+ are masculine\n * - Irregular hundreds (dvesta, trista, etc.)\n * - Long scale naming with -ard forms\n * - Latin script\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\nimport { validateOptions } from '../utils/validate-options.js'\n\n// ============================================================================\n// Slavic Utilities (inlined for performance)\n// ============================================================================\n\nfunction pluralize (n, forms) {\n  const num = typeof n === 'bigint' ? Number(n) : n\n  const lastDigit = num % 10\n  const lastTwoDigits = num % 100\n\n  if (lastTwoDigits >= 11 && lastTwoDigits <= 19) {\n    return forms[2]\n  }\n\n  if (lastDigit === 1) return forms[0]\n  if (lastDigit >= 2 && lastDigit <= 4) return forms[1]\n  return forms[2]\n}\n\nfunction buildAllSegments (onesMasc, onesFem, teens, tens, hundreds) {\n  const masc = new Array(1000)\n  const fem = new Array(1000)\n\n  for (let i = 0; i < 1000; i++) {\n    masc[i] = buildSegment(i, onesMasc, teens, tens, hundreds)\n    fem[i] = buildSegment(i, onesFem, teens, tens, hundreds)\n  }\n\n  return { masc, fem }\n}\n\nfunction buildSegment (n, ones, teens, tens, hundreds) {\n  if (n === 0) return ''\n\n  const onesDigit = n % 10\n  const tensDigit = Math.floor(n / 10) % 10\n  const hundredsDigit = Math.floor(n / 100)\n\n  const parts = []\n\n  if (hundredsDigit > 0) {\n    parts.push(hundreds[hundredsDigit])\n  }\n\n  if (tensDigit > 1) {\n    parts.push(tens[tensDigit])\n  }\n\n  if (tensDigit === 1) {\n    parts.push(teens[onesDigit])\n  } else if (onesDigit > 0) {\n    parts.push(ones[onesDigit])\n  }\n\n  return parts.join(' ')\n}\n\n// ============================================================================\n// Vocabulary\n// ============================================================================\n\nconst ONES_MASC = ['', 'jedan', 'dva', 'tri', 'četiri', 'pet', 'šest', 'sedam', 'osam', 'devet']\nconst ONES_FEM = ['', 'jedna', 'dve', 'tri', 'četiri', 'pet', 'šest', 'sedam', 'osam', 'devet']\nconst TEENS = ['deset', 'jedanaest', 'dvanaest', 'trinaest', 'četrnaest', 'petnaest', 'šesnaest', 'sedamnaest', 'osamnaest', 'devetnaest']\nconst TENS = ['', '', 'dvadeset', 'trideset', 'četrdeset', 'pedeset', 'šezdeset', 'sedamdeset', 'osamdeset', 'devedeset']\nconst HUNDREDS = ['', 'sto', 'dvesta', 'trista', 'četiristo', 'petsto', 'šesto', 'sedamsto', 'osamsto', 'devetsto']\n\nconst ZERO = 'nula'\nconst NEGATIVE = 'minus'\nconst DECIMAL_SEP = 'zapeta'\n\n// Scale words: [singular, few, many]\nconst SCALE_FORMS = [\n  ['hiljada', 'hiljade', 'hiljada'],\n  ['milion', 'miliona', 'miliona'],\n  ['milijarda', 'milijarde', 'milijarda'],\n  ['bilion', 'biliona', 'biliona'],\n  ['bilijarda', 'bilijarde', 'bilijarda'],\n  ['trilion', 'triliona', 'triliona'],\n  ['trilijarda', 'trilijarde', 'trilijarda'],\n  ['kvadrilion', 'kvadriliona', 'kvadriliona'],\n  ['kvadrilijarda', 'kvadrilijarde', 'kvadrilijarda']\n]\n\n// ============================================================================\n// Precomputed Lookup Tables\n// ============================================================================\n\nconst { masc: SEGMENTS_MASC, fem: SEGMENTS_FEM } = buildAllSegments(ONES_MASC, ONES_FEM, TEENS, TENS, HUNDREDS)\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\nfunction integerToWords (n, options = {}) {\n  if (n === 0n) return ZERO\n\n  if (n < 1000n) {\n    const segments = options.gender === 'feminine' ? SEGMENTS_FEM : SEGMENTS_MASC\n    return segments[Number(n)]\n  }\n\n  return buildLargeNumberWords(n, options)\n}\n\nfunction buildLargeNumberWords (n, options) {\n  const numStr = n.toString()\n  const len = numStr.length\n\n  const segments = []\n  const segmentSize = 3\n\n  const remainderLen = len % segmentSize\n  let pos = 0\n  if (remainderLen > 0) {\n    segments.push(Number(numStr.slice(0, remainderLen)))\n    pos = remainderLen\n  }\n  while (pos < len) {\n    segments.push(Number(numStr.slice(pos, pos + segmentSize)))\n    pos += segmentSize\n  }\n\n  const parts = []\n  let scaleIndex = segments.length - 1\n\n  for (let i = 0; i < segments.length; i++) {\n    const segment = segments[i]\n\n    if (segment !== 0) {\n      if (scaleIndex === 0) {\n        const segmentWords = options.gender === 'feminine' ? SEGMENTS_FEM : SEGMENTS_MASC\n        parts.push(segmentWords[segment])\n      } else {\n        const scaleForms = SCALE_FORMS[scaleIndex - 1]\n        const scaleWord = pluralize(segment, scaleForms)\n        // Thousands (scaleIndex=1) are feminine, others masculine\n        const isFeminine = scaleIndex === 1\n        const segmentWords = isFeminine ? SEGMENTS_FEM : SEGMENTS_MASC\n        parts.push(segmentWords[segment] + ' ' + scaleWord)\n      }\n    }\n\n    scaleIndex--\n  }\n\n  return parts.join(' ')\n}\n\nfunction decimalPartToWords (decimalPart, options) {\n  let result = ''\n  let i = 0\n\n  while (i < decimalPart.length && decimalPart[i] === '0') {\n    if (result) result += ' '\n    result += ZERO\n    i++\n  }\n\n  const remainder = decimalPart.slice(i)\n  if (remainder) {\n    if (result) result += ' '\n    result += integerToWords(BigInt(remainder), options)\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to Serbian (Latin) words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @param {Object} [options] - Optional configuration\n * @param {('masculine'|'feminine')} [options.gender='masculine'] - Grammatical gender\n * @returns {string} The number in Serbian Latin words\n */\nfunction toWords (value, options) {\n  options = validateOptions(options)\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart, options)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart, options)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Exports\n// ============================================================================\n\nexport { toWords }\n","import { isPlainObject } from './is-plain-object.js'\n\n/**\n * Validates and normalizes the options parameter.\n *\n * @param {*} options The options value to validate\n * @returns {Object} A valid options object (empty object if undefined)\n * @throws {TypeError} If options is not undefined or a plain object\n */\nexport function validateOptions (options) {\n  if (options === undefined) return {}\n  if (isPlainObject(options)) return options\n  throw new TypeError(\n    `Invalid options: expected plain object or undefined, got ${typeof options}`\n  )\n}\n","/**\n * Checks if a value is a plain object (not null, array, or other object types).\n *\n * A plain object is one created by:\n * - Object literal: `{}`\n * - Object.create(null): null-prototype object\n *\n * This excludes arrays, class instances, Map, Set, and other object types.\n *\n * @param {*} value Value to check\n * @returns {boolean} True if value is a plain object\n */\nexport function isPlainObject (value) {\n  if (value === null || typeof value !== 'object') return false\n  const proto = Object.getPrototypeOf(value)\n  return proto === null || proto === Object.prototype\n}\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","pluralize","n","forms","num","Number","lastDigit","lastTwoDigits","buildSegment","ones","teens","tens","hundreds","onesDigit","tensDigit","Math","floor","hundredsDigit","parts","push","join","ZERO","SCALE_FORMS","masc","SEGMENTS_MASC","fem","SEGMENTS_FEM","onesMasc","onesFem","Array","i","buildAllSegments","integerToWords","options","gender","numStr","toString","len","segments","remainderLen","pos","scaleIndex","segment","scaleWord","buildLargeNumberWords","value","undefined","proto","Object","getPrototypeOf","prototype","isPlainObject","TypeError","validateOptions","type","isFinite","Error","isSafeInteger","includes","numberToString","trimmed","trim","isNaN","normalizeString","parseNumericValue","result","NEGATIVE","remainder","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,CCvFA,SAASG,EAAWC,EAAGC,GACrB,MAAMC,EAAmB,iBAANF,EAAiBG,OAAOH,GAAKA,EAC1CI,EAAYF,EAAM,GAClBG,EAAgBH,EAAM,IAE5B,OAAIG,GAAiB,IAAMA,GAAiB,GACnCJ,EAAM,GAGG,IAAdG,EAAwBH,EAAM,GAC9BG,GAAa,GAAKA,GAAa,EAAUH,EAAM,GAC5CA,EAAM,EACf,CAcA,SAASK,EAAcN,EAAGO,EAAMC,EAAOC,EAAMC,GAC3C,GAAU,IAANV,EAAS,MAAO,GAEpB,MAAMW,EAAYX,EAAI,GAChBY,EAAYC,KAAKC,MAAMd,EAAI,IAAM,GACjCe,EAAgBF,KAAKC,MAAMd,EAAI,KAE/BgB,EAAQ,GAgBd,OAdID,EAAgB,GAClBC,EAAMC,KAAKP,EAASK,IAGlBH,EAAY,GACdI,EAAMC,KAAKR,EAAKG,IAGA,IAAdA,EACFI,EAAMC,KAAKT,EAAMG,IACRA,EAAY,GACrBK,EAAMC,KAAKV,EAAKI,IAGXK,EAAME,KAAK,IACpB,CAMA,MAMMC,EAAO,OAKPC,EAAc,CAClB,CAAC,UAAW,UAAW,WACvB,CAAC,SAAU,UAAW,WACtB,CAAC,YAAa,YAAa,aAC3B,CAAC,SAAU,UAAW,WACtB,CAAC,YAAa,YAAa,aAC3B,CAAC,UAAW,WAAY,YACxB,CAAC,aAAc,aAAc,cAC7B,CAAC,aAAc,cAAe,eAC9B,CAAC,gBAAiB,gBAAiB,mBAO7BC,KAAMC,EAAeC,IAAKC,GArElC,SAA2BC,EAAUC,EAASlB,EAAOC,EAAMC,GACzD,MAAMW,EAAO,IAAIM,MAAM,KACjBJ,EAAM,IAAII,MAAM,KAEtB,IAAK,IAAIC,EAAI,EAAGA,EAAI,IAAMA,IACxBP,EAAKO,GAAKtB,EAAasB,EAAGH,EAAUjB,EAAOC,EAAMC,GACjDa,EAAIK,GAAKtB,EAAasB,EAAGF,EAASlB,EAAOC,EAAMC,GAGjD,MAAO,CAAEW,OAAME,MACjB,CA2DmDM,CA3BjC,CAAC,GAAI,QAAS,MAAO,MAAO,SAAU,MAAO,OAAQ,QAAS,OAAQ,SACvE,CAAC,GAAI,QAAS,MAAO,MAAO,SAAU,MAAO,OAAQ,QAAS,OAAQ,SACzE,CAAC,QAAS,YAAa,WAAY,WAAY,YAAa,WAAY,WAAY,aAAc,YAAa,cAChH,CAAC,GAAI,GAAI,WAAY,WAAY,YAAa,UAAW,WAAY,aAAc,YAAa,aAC5F,CAAC,GAAI,MAAO,SAAU,SAAU,YAAa,SAAU,QAAS,WAAY,UAAW,aA6BxG,SAASC,EAAgB9B,EAAG+B,EAAU,IACpC,OAAU,KAAN/B,EAAiBmB,EAEjBnB,EAAI,OAC8B,aAAnB+B,EAAQC,OAAwBR,EAAeF,GAChDnB,OAAOH,IAM3B,SAAgCA,EAAG+B,GACjC,MAAME,EAASjC,EAAEkC,WACXC,EAAMF,EAAOpC,OAEbuC,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAASnB,KAAKd,OAAO8B,EAAOpD,MAAM,EAAGwD,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAASnB,KAAKd,OAAO8B,EAAOpD,MAAMyD,EAAKA,EATrB,KAUlBA,GAVkB,EAapB,MAAMtB,EAAQ,GACd,IAAIuB,EAAaH,EAASvC,OAAS,EAEnC,IAAK,IAAI+B,EAAI,EAAGA,EAAIQ,EAASvC,OAAQ+B,IAAK,CACxC,MAAMY,EAAUJ,EAASR,GAEzB,GAAgB,IAAZY,EACF,GAAmB,IAAfD,EAEFvB,EAAMC,MADkC,aAAnBc,EAAQC,OAAwBR,EAAeF,GAC5CkB,QACnB,CACL,MACMC,EAAY1C,EAAUyC,EADTpB,EAAYmB,EAAa,IAK5CvB,EAAMC,MAF4B,IAAfsB,EACef,EAAeF,GACzBkB,GAAW,IAAMC,EAC3C,CAGFF,GACF,CAEA,OAAOvB,EAAME,KAAK,IACpB,CA7CSwB,CAAsB1C,EAAG+B,EAClC,UAyEA,SAAkBY,EAAOZ,GACvBA,ECvLK,SAA0BA,GAC/B,QAAgBa,IAAZb,EAAuB,MAAO,CAAA,EAClC,GCCK,SAAwBY,GAC7B,GAAc,OAAVA,GAAmC,iBAAVA,EAAoB,OAAO,EACxD,MAAME,EAAQC,OAAOC,eAAeJ,GACpC,OAAiB,OAAVE,GAAkBA,IAAUC,OAAOE,SAC5C,CDLMC,CAAclB,GAAU,OAAOA,EACnC,MAAM,IAAImB,UACR,mEAAmEnB,EAEvE,CDiLYoB,CAAgBpB,GAC1B,MAAMnD,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GDpL5B,SAA4BwD,GACjC,MAAMS,SAAcT,EAGpB,GAAa,WAATS,EACF,OAAOT,EAAQ,GACX,CAAE/D,YAAY,EAAMI,aAAc2D,GAClC,CAAE/D,YAAY,EAAOI,YAAa2D,GAIxC,GAAa,WAATS,EAAmB,CACrB,IAAKjD,OAAOkD,SAASV,GACnB,MAAM,IAAIW,MAAM,8DAElB,OAAInD,OAAOoD,cAAcZ,GAChBA,EAAQ,EACX,CAAE/D,YAAY,EAAMI,YAAaC,QAAQ0D,IACzC,CAAE/D,YAAY,EAAOI,YAAaC,OAAO0D,IAExCjE,EAgBX,SAAyBiE,GACvB,MAAMhE,EAAMgE,EAAMT,WAClB,OAAQvD,EAAI6E,SAAS,MAAQ7E,EAAI6E,SAAS,KACtCpE,EAAyBT,GACzBA,CACN,CArB8B8E,CAAed,GAC3C,CAGA,GAAa,WAATS,EACF,OAAO1E,EAqBX,SAA0BiE,GACxB,MAAMe,EAAUf,EAAMgB,OACtB,GAAuB,IAAnBD,EAAQ7D,QAAgBM,OAAOyD,MAAMzD,OAAOuD,IAC9C,MAAM,IAAIJ,MAAM,2BAA2BX,MAE7C,OAAQe,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9CpE,EAAyBsE,GACzBA,CACN,CA7B8BG,CAAgBlB,IAG5C,MAAM,IAAIO,UACR,oEAAoEE,IAExE,CCqJmDU,CAAkBnB,GAEnE,IAAIoB,EAAS,GAYb,OAVInF,IACFmF,EAASC,UAGXD,GAAUjC,EAAe9C,EAAa+C,GAElC5C,IACF4E,GAAU,WAxCd,SAA6B5E,EAAa4C,GACxC,IAAIgC,EAAS,GACTnC,EAAI,EAER,KAAOA,EAAIzC,EAAYU,QAA6B,MAAnBV,EAAYyC,IACvCmC,IAAQA,GAAU,KACtBA,GAAU5C,EACVS,IAGF,MAAMqC,EAAY9E,EAAYN,MAAM+C,GAMpC,OALIqC,IACEF,IAAQA,GAAU,KACtBA,GAAUjC,EAAe7C,OAAOgF,GAAYlC,IAGvCgC,CACT,CAuBwCG,CAAmB/E,EAAa4C,IAG/DgC,CACT"}

package/dist/languages/sv.js

@@ -1,3 +0,0 @@
-/*! n2words/sv 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=["","ett","två","tre","fyra","fem","sex","sju","åtta","nio"],i=["tio","elva","tolv","tretton","fjorton","femton","sexton","sjutton","arton","nitton"],o=["","","tjugo","trettio","fyrtio","femtio","sextio","sjuttio","åttio","nittio"],s="hundra",u="noll",l=["tusen","miljon","miljard","biljon","biljard","triljon","triljard","kvadriljon"];function a(e){if(0===e)return{word:"",hasHundred:!1,lessThan100:!1};const t=e%10,n=Math.floor(e/10)%10,u=Math.floor(e/100),l=[];let a=!1;u>0&&(a=!0,l.push(1===u?s:r[u]+" "+s));let c="";return 1===n?c=i[t]:n>=2?c=t>0?o[n]+"-"+r[t]:o[n]:t>0&&(c=r[t]),a&&c?{word:l[0]+" och "+c,hasHundred:!0,lessThan100:!1}:a?{word:l[0],hasHundred:!0,lessThan100:!1}:{word:c,hasHundred:!1,lessThan100:!0}}const c=new Array(1e3),d=new Array(1e3),f=new Array(1e3);for(let e=0;e<1e3;e++){const t=a(e);c[e]=t.word,d[e]=t.hasHundred,f[e]=t.lessThan100}function h(e){if(0n===e)return u;if(e<1000n)return c[Number(e)];if(e<1000000n){const t=Number(e/1000n),n=Number(e%1000n);let r=1===t?l[0]:c[t]+" "+l[0];if(n>0){const e=c[n];r+=f[n]?" och "+e:" "+e}return 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 a=r.length-1;for(let e=0;e<r.length;e++){const t=r[e];if(0!==t)if(0===a)s.push({word:c[t],hasHundred:d[t],isScale:!1});else{const e=l[a-1];let n;n=1===t?1===a?"":"en":c[t],n&&s.push({word:n,hasHundred:!1,isScale:!1}),s.push({word:e,hasHundred:!1,isScale:!0})}a--}return function(e){if(0===e.length)return u;if(1===e.length)return e[0].word;const t=[];for(let n=0;n<e.length;n++){const r=e[n];n===e.length-1&&e.length>1&&e[n-1].isScale&&!r.hasHundred&&t.push("och"),t.push(r.word)}return t.join(" ")}(s)}(e)}e.sv=function(e){const{isNegative:r,integerPart:i,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 s="";return r&&(s="minus "),s+=h(i),o&&(s+=" komma "+function(e){let t="",n=0;for(;n<e.length&&"0"===e[n];)t&&(t+=" "),t+=u,n++;const r=e.slice(n);return r&&(t&&(t+=" "),t+=h(BigInt(r))),t}(o)),s}},"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=sv.js.map

package/dist/languages/sv.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sv.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/sv.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 * Swedish language converter - Functional Implementation\n *\n * A performance-optimized number-to-words converter using precomputed lookup tables.\n *\n * Key features:\n * - Hyphenation for tens-ones (tjugo-ett)\n * - \"och\" after hundreds before small numbers\n * - Omit \"ett\" before hundra and tusen\n * - Use \"en\" (not \"ett\") before million+ scales\n * - Long scale naming with -ard forms\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\n\n// ============================================================================\n// Vocabulary (module-level constants)\n// ============================================================================\n\nconst ONES = ['', 'ett', 'två', 'tre', 'fyra', 'fem', 'sex', 'sju', 'åtta', 'nio']\n\nconst TEENS = ['tio', 'elva', 'tolv', 'tretton', 'fjorton', 'femton', 'sexton', 'sjutton', 'arton', 'nitton']\nconst TENS = ['', '', 'tjugo', 'trettio', 'fyrtio', 'femtio', 'sextio', 'sjuttio', 'åttio', 'nittio']\n\nconst HUNDRED = 'hundra'\n\nconst ZERO = 'noll'\nconst NEGATIVE = 'minus'\nconst DECIMAL_SEP = 'komma'\n\n// Scale words (long scale with -ard forms)\nconst SCALES = ['tusen', 'miljon', 'miljard', 'biljon', 'biljard', 'triljon', 'triljard', 'kvadriljon']\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 metadata for \"och\" logic.\n */\nfunction buildSegment (n) {\n  if (n === 0) return { word: '', hasHundred: false, lessThan100: false }\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  let hasHundred = false\n\n  // Hundreds - omit \"ett\" before hundra\n  if (hundreds > 0) {\n    hasHundred = true\n    if (hundreds === 1) {\n      parts.push(HUNDRED)\n    } else {\n      parts.push(ONES[hundreds] + ' ' + HUNDRED)\n    }\n  }\n\n  // Tens and ones with hyphenation\n  let tensOnesWord = ''\n  if (tens === 1) {\n    tensOnesWord = TEENS[ones]\n  } else if (tens >= 2) {\n    if (ones > 0) {\n      tensOnesWord = TENS[tens] + '-' + ONES[ones]\n    } else {\n      tensOnesWord = TENS[tens]\n    }\n  } else if (ones > 0) {\n    tensOnesWord = ONES[ones]\n  }\n\n  // Combine with \"och\" after hundreds if there's a remainder\n  if (hasHundred && tensOnesWord) {\n    return { word: parts[0] + ' och ' + tensOnesWord, hasHundred: true, lessThan100: false }\n  } else if (hasHundred) {\n    return { word: parts[0], hasHundred: true, lessThan100: false }\n  } else {\n    return { word: tensOnesWord, hasHundred: false, lessThan100: true }\n  }\n}\n\n// Precompute all 1000 segment words (0-999)\nconst SEGMENTS = new Array(1000)\nconst SEGMENTS_HAS_HUNDRED = new Array(1000)\nconst SEGMENTS_LESS_THAN_100 = 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  SEGMENTS_LESS_THAN_100[i] = result.lessThan100\n}\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\n/**\n * Converts a non-negative integer to Swedish words.\n *\n * @param {bigint} n - Non-negative integer to convert\n * @returns {string} Swedish 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 \"ett\" before tusen\n    let result = thousands === 1 ? SCALES[0] : SEGMENTS[thousands] + ' ' + SCALES[0]\n\n    if (remainder > 0) {\n      const remainderWord = SEGMENTS[remainder]\n      // Insert \"och\" if remainder < 100 (doesn't have hundred)\n      if (SEGMENTS_LESS_THAN_100[remainder]) {\n        result += ' och ' + 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 *\n * @param {bigint} n - Number >= 1,000,000\n * @returns {string} Swedish 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\n        parts.push({\n          word: SEGMENTS[segment],\n          hasHundred: SEGMENTS_HAS_HUNDRED[segment],\n          isScale: false\n        })\n      } else {\n        // Segment with scale word\n        const scaleWord = SCALES[scaleIndex - 1]\n\n        let segmentWord\n        if (segment === 1) {\n          // Omit \"ett\" before tusen, use \"en\" before million+\n          if (scaleIndex === 1) {\n            segmentWord = '' // Just \"tusen\"\n          } else {\n            segmentWord = 'en' // \"en miljon\"\n          }\n        } else {\n          segmentWord = SEGMENTS[segment]\n        }\n\n        if (segmentWord) {\n          parts.push({ word: segmentWord, hasHundred: false, isScale: false })\n        }\n        parts.push({ word: scaleWord, hasHundred: false, isScale: true })\n      }\n    }\n\n    scaleIndex--\n  }\n\n  // Join with Swedish \"och\" rules\n  return joinSwedishParts(parts)\n}\n\n/**\n * Joins parts with Swedish \"och\" rules.\n * Insert \"och\" before final segment if it follows a scale word and doesn't have \"hundra\".\n *\n * @param {Array} parts - Parts with metadata\n * @returns {string} Joined string\n */\nfunction joinSwedishParts (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 isLast = i === parts.length - 1\n\n    if (isLast && parts.length > 1) {\n      const prevPart = parts[i - 1]\n      // Insert \"och\" if previous was scale and this doesn't have hundred\n      if (prevPart.isScale && !part.hasHundred) {\n        result.push('och')\n      }\n    }\n\n    result.push(part.word)\n  }\n\n  return result.join(' ')\n}\n\n/**\n * Converts decimal digits to Swedish words.\n *\n * @param {string} decimalPart - Decimal digits (without the point)\n * @returns {string} Swedish 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 Swedish words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @returns {string} The number in Swedish 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)       // 'fyrtio-två'\n * toWords(101)      // 'hundra och ett'\n * toWords(1000000)  // 'en miljon'\n */\nfunction toWords (value) {\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Public API\n// ============================================================================\n\nexport { toWords }\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES","TEENS","TENS","HUNDRED","ZERO","SCALES","buildSegment","n","word","hasHundred","lessThan100","ones","tens","Math","floor","hundreds","parts","push","tensOnesWord","SEGMENTS","Array","SEGMENTS_HAS_HUNDRED","SEGMENTS_LESS_THAN_100","i","result","integerToWords","Number","thousands","remainder","remainderWord","numStr","toString","len","segments","remainderLen","pos","scaleIndex","segment","isScale","scaleWord","segmentWord","part","join","joinSwedishParts","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,CCxFA,MAAMG,EAAO,CAAC,GAAI,MAAO,MAAO,MAAO,OAAQ,MAAO,MAAO,MAAO,OAAQ,OAEtEC,EAAQ,CAAC,MAAO,OAAQ,OAAQ,UAAW,UAAW,SAAU,SAAU,UAAW,QAAS,UAC9FC,EAAO,CAAC,GAAI,GAAI,QAAS,UAAW,SAAU,SAAU,SAAU,UAAW,QAAS,UAEtFC,EAAU,SAEVC,EAAO,OAKPC,EAAS,CAAC,QAAS,SAAU,UAAW,SAAU,UAAW,UAAW,WAAY,cAU1F,SAASC,EAAcC,GACrB,GAAU,IAANA,EAAS,MAAO,CAAEC,KAAM,GAAIC,YAAY,EAAOC,aAAa,GAEhE,MAAMC,EAAOJ,EAAI,GACXK,EAAOC,KAAKC,MAAMP,EAAI,IAAM,GAC5BQ,EAAWF,KAAKC,MAAMP,EAAI,KAE1BS,EAAQ,GACd,IAAIP,GAAa,EAGbM,EAAW,IACbN,GAAa,EAEXO,EAAMC,KADS,IAAbF,EACSZ,EAEAH,EAAKe,GAAY,IAAMZ,IAKtC,IAAIe,EAAe,GAcnB,OAba,IAATN,EACFM,EAAejB,EAAMU,GACZC,GAAQ,EAEfM,EADEP,EAAO,EACMT,EAAKU,GAAQ,IAAMZ,EAAKW,GAExBT,EAAKU,GAEbD,EAAO,IAChBO,EAAelB,EAAKW,IAIlBF,GAAcS,EACT,CAAEV,KAAMQ,EAAM,GAAK,QAAUE,EAAcT,YAAY,EAAMC,aAAa,GACxED,EACF,CAAED,KAAMQ,EAAM,GAAIP,YAAY,EAAMC,aAAa,GAEjD,CAAEF,KAAMU,EAAcT,YAAY,EAAOC,aAAa,EAEjE,CAGA,MAAMS,EAAW,IAAIC,MAAM,KACrBC,EAAuB,IAAID,MAAM,KACjCE,EAAyB,IAAIF,MAAM,KAEzC,IAAK,IAAIG,EAAI,EAAGA,EAAI,IAAMA,IAAK,CAC7B,MAAMC,EAASlB,EAAaiB,GAC5BJ,EAASI,GAAKC,EAAOhB,KACrBa,EAAqBE,GAAKC,EAAOf,WACjCa,EAAuBC,GAAKC,EAAOd,WACrC,CAYA,SAASe,EAAgBlB,GACvB,GAAU,KAANA,EAAU,OAAOH,EAGrB,GAAIG,EAAI,MACN,OAAOY,EAASO,OAAOnB,IAIzB,GAAIA,EAAI,SAAY,CAClB,MAAMoB,EAAYD,OAAOnB,EAAI,OACvBqB,EAAYF,OAAOnB,EAAI,OAG7B,IAAIiB,EAAuB,IAAdG,EAAkBtB,EAAO,GAAKc,EAASQ,GAAa,IAAMtB,EAAO,GAE9E,GAAIuB,EAAY,EAAG,CACjB,MAAMC,EAAgBV,EAASS,GAG7BJ,GADEF,EAAuBM,GACf,QAAUC,EAEV,IAAMA,CAEpB,CAEA,OAAOL,CACT,CAGA,OASF,SAAgCjB,GAC9B,MAAMuB,EAASvB,EAAEwB,WACXC,EAAMF,EAAOhC,OAGbmC,EAAW,GAGXC,EAAeF,EAFD,EAGpB,IAAIG,EAAM,EAKV,IAJID,EAAe,IACjBD,EAAShB,KAAKS,OAAOI,EAAOhD,MAAM,EAAGoD,KACrCC,EAAMD,GAEDC,EAAMH,GACXC,EAAShB,KAAKS,OAAOI,EAAOhD,MAAMqD,EAAKA,EATrB,KAUlBA,GAVkB,EAcpB,MAAMnB,EAAQ,GACd,IAAIoB,EAAaH,EAASnC,OAAS,EAEnC,IAAK,IAAIyB,EAAI,EAAGA,EAAIU,EAASnC,OAAQyB,IAAK,CACxC,MAAMc,EAAUJ,EAASV,GAEzB,GAAgB,IAAZc,EACF,GAAmB,IAAfD,EAEFpB,EAAMC,KAAK,CACTT,KAAMW,EAASkB,GACf5B,WAAYY,EAAqBgB,GACjCC,SAAS,QAEN,CAEL,MAAMC,EAAYlC,EAAO+B,EAAa,GAEtC,IAAII,EAIAA,EAHY,IAAZH,EAEiB,IAAfD,EACY,GAEA,KAGFjB,EAASkB,GAGrBG,GACFxB,EAAMC,KAAK,CAAET,KAAMgC,EAAa/B,YAAY,EAAO6B,SAAS,IAE9DtB,EAAMC,KAAK,CAAET,KAAM+B,EAAW9B,YAAY,EAAO6B,SAAS,GAC5D,CAGFF,GACF,CAGA,OAUF,SAA2BpB,GACzB,GAAqB,IAAjBA,EAAMlB,OAAc,OAAOM,EAC/B,GAAqB,IAAjBY,EAAMlB,OAAc,OAAOkB,EAAM,GAAGR,KAExC,MAAMgB,EAAS,GAEf,IAAK,IAAID,EAAI,EAAGA,EAAIP,EAAMlB,OAAQyB,IAAK,CACrC,MAAMkB,EAAOzB,EAAMO,GACJA,IAAMP,EAAMlB,OAAS,GAEtBkB,EAAMlB,OAAS,GACVkB,EAAMO,EAAI,GAEde,UAAYG,EAAKhC,YAC5Be,EAAOP,KAAK,OAIhBO,EAAOP,KAAKwB,EAAKjC,KACnB,CAEA,OAAOgB,EAAOkB,KAAK,IACrB,CAhCSC,CAAiB3B,EAC1B,CAvES4B,CAAsBrC,EAC/B,MA+IA,SAAkBsC,GAChB,MAAMhE,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GD7Q5B,SAA4ByD,GACjC,MAAMC,SAAcD,EAGpB,GAAa,WAATC,EACF,OAAOD,EAAQ,GACX,CAAEhE,YAAY,EAAMI,aAAc4D,GAClC,CAAEhE,YAAY,EAAOI,YAAa4D,GAIxC,GAAa,WAATC,EAAmB,CACrB,IAAKpB,OAAOqB,SAASF,GACnB,MAAM,IAAIG,MAAM,8DAElB,OAAItB,OAAOuB,cAAcJ,GAChBA,EAAQ,EACX,CAAEhE,YAAY,EAAMI,YAAaC,QAAQ2D,IACzC,CAAEhE,YAAY,EAAOI,YAAaC,OAAO2D,IAExClE,EAgBX,SAAyBkE,GACvB,MAAMjE,EAAMiE,EAAMd,WAClB,OAAQnD,EAAIsE,SAAS,MAAQtE,EAAIsE,SAAS,KACtC7D,EAAyBT,GACzBA,CACN,CArB8BuE,CAAeN,GAC3C,CAGA,GAAa,WAATC,EACF,OAAOnE,EAqBX,SAA0BkE,GACxB,MAAMO,EAAUP,EAAMQ,OACtB,GAAuB,IAAnBD,EAAQtD,QAAgB4B,OAAO4B,MAAM5B,OAAO0B,IAC9C,MAAM,IAAIJ,MAAM,2BAA2BH,MAE7C,OAAQO,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9C7D,EAAyB+D,GACzBA,CACN,CA7B8BG,CAAgBV,IAG5C,MAAM,IAAIW,UACR,oEAAoEV,IAExE,CC8OmDW,CAAkBZ,GAEnE,IAAIrB,EAAS,GAYb,OAVI3C,IACF2C,EAASkC,UAGXlC,GAAUC,EAAexC,GAErBG,IACFoC,GAAU,UA9Cd,SAA6BpC,GAC3B,IAAIoC,EAAS,GAGTD,EAAI,EACR,KAAOA,EAAInC,EAAYU,QAA6B,MAAnBV,EAAYmC,IACvCC,IAAQA,GAAU,KACtBA,GAAUpB,EACVmB,IAIF,MAAMK,EAAYxC,EAAYN,MAAMyC,GAMpC,OALIK,IACEJ,IAAQA,GAAU,KACtBA,GAAUC,EAAevC,OAAO0C,KAG3BJ,CACT,CA2BwCmC,CAAmBvE,IAGlDoC,CACT"}

package/dist/languages/sw.js

@@ -1,3 +0,0 @@
-/*! n2words/sw v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var n,i;n=this,i=function(n){"use strict";function i(n){const i="-"===n[0];i&&(n=n.slice(1));const e=n.indexOf(".");if(-1===e)return{isNegative:i,integerPart:BigInt(n)};const t=n.slice(0,e)||"0",r=n.slice(e+1);return{isNegative:i,integerPart:BigInt(t),decimalPart:r}}function e(n){const[i,e]=n.toLowerCase().split("e"),t=parseInt(e,10),r=i.indexOf("."),s=-1===r?i:i.slice(0,r)+i.slice(r+1),o=(-1===r?i.length:r)+t;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 t=["sifuri","moja","mbili","tatu","nne","tano","sita","saba","nane","tisa"],r={10:"kumi",20:"ishirini",30:"thelathini",40:"arobaini",50:"hamsini",60:"sitini",70:"sabini",80:"themanini",90:"tisini"},s=["","elfu","milioni","bilioni","trilioni","kwadrilioni","kwintilioni"],o="sifuri";function u(n){if(n<10)return t[n];if(10===n)return r[10];if(n<20)return r[10]+" na "+t[n-10];const i=10*Math.trunc(n/10),e=n%10;return 0===e?r[i]:r[i]+" na "+t[e]}function a(n){if(n<100)return u(n);if(100===n)return"mia moja";const i=Math.trunc(n/100),e=n%100,r=[];return r.push("mia "+t[i]),e>0&&r.push(e<10?"na "+t[e]:u(e)),r.join(" ")}function f(n){if(0n===n)return o;const i=function(n){const i=[];let e=n;for(;e>0n;)i.push(Number(e%1000n)),e/=1000n;return i}(n),e=[];for(let n=i.length-1;n>=0;n--){const r=i[n];if(0!==r)if(0===n)e.push(r<10&&e.length>0?"na "+t[r]:100===r&&e.length>0?"mia":a(r));else{const i=1===r?"moja":a(r);e.push(s[n]+" "+i)}}return e.join(" ").trim()}n.sw=function(n){const{isNegative:t,integerPart:r,decimalPart:s}=function(n){const t=typeof n;if("bigint"===t)return n<0n?{isNegative:!0,integerPart:-n}:{isNegative:!1,integerPart:n};if("number"===t){if(!Number.isFinite(n))throw new Error("Number must be finite (NaN and Infinity are not supported)");return Number.isSafeInteger(n)?n<0?{isNegative:!0,integerPart:BigInt(-n)}:{isNegative:!1,integerPart:BigInt(n)}:i(function(n){const i=n.toString();return i.includes("e")||i.includes("E")?e(i):i}(n))}if("string"===t)return i(function(n){const i=n.trim();if(0===i.length||Number.isNaN(Number(i)))throw new Error(`Invalid number format: "${n}"`);return i.includes("e")||i.includes("E")?e(i):i}(n));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${t}`)}(n);let u="";return t&&(u="minus "),u+=f(r),s&&(u+=" nukta "+function(n){let i="",e=0;for(;e<n.length&&"0"===n[e];)i&&(i+=" "),i+=o,e++;const t=n.slice(e);return t&&(i&&(i+=" "),i+=f(BigInt(t))),i}(s)),u}},"object"==typeof exports&&"undefined"!=typeof module?i(exports):"function"==typeof define&&define.amd?define(["exports"],i):i((n="undefined"!=typeof globalThis?globalThis:n||self).n2words=n.n2words||{});
-//# sourceMappingURL=sw.js.map

package/dist/languages/sw.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sw.js","sources":["../../lib/utils/parse-numeric.js","../../lib/languages/sw.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 * Swahili language converter - Functional Implementation\n *\n * Self-contained converter with precomputed lookup tables.\n *\n * Key features:\n * - \"na\" connector for compound numbers\n * - Reversed hundreds: \"mia moja\" (one hundred)\n * - Scale words: elfu, milioni, bilioni\n */\n\nimport { parseNumericValue } from '../utils/parse-numeric.js'\n\n// ============================================================================\n// Vocabulary\n// ============================================================================\n\nconst ONES = ['sifuri', 'moja', 'mbili', 'tatu', 'nne', 'tano', 'sita', 'saba', 'nane', 'tisa']\nconst TENS = { 10: 'kumi', 20: 'ishirini', 30: 'thelathini', 40: 'arobaini', 50: 'hamsini', 60: 'sitini', 70: 'sabini', 80: 'themanini', 90: 'tisini' }\n\nconst SCALE_WORDS = ['', 'elfu', 'milioni', 'bilioni', 'trilioni', 'kwadrilioni', 'kwintilioni']\n\nconst ZERO = 'sifuri'\nconst NEGATIVE = 'minus'\nconst DECIMAL_SEP = 'nukta'\n\n// ============================================================================\n// Conversion Functions\n// ============================================================================\n\nfunction wordsUnder100 (n) {\n  if (n < 10) return ONES[n]\n  if (n === 10) return TENS[10]\n  if (n < 20) {\n    // 11-19: 'kumi na <digit>'\n    return TENS[10] + ' na ' + ONES[n - 10]\n  }\n  const tens = Math.trunc(n / 10) * 10\n  const ones = n % 10\n  if (ones === 0) return TENS[tens]\n  return TENS[tens] + ' na ' + ONES[ones]\n}\n\nfunction wordsUnder1000 (n) {\n  if (n < 100) return wordsUnder100(n)\n  if (n === 100) return 'mia moja'\n  const hundreds = Math.trunc(n / 100)\n  const rest = n % 100\n  const parts = []\n\n  // Hundreds: 'mia <digit>'\n  parts.push('mia ' + ONES[hundreds])\n  if (rest > 0) {\n    if (rest < 10) {\n      parts.push('na ' + ONES[rest])\n    } else {\n      parts.push(wordsUnder100(rest))\n    }\n  }\n\n  return parts.join(' ')\n}\n\nfunction extractSegments (n) {\n  const segments = []\n  let temp = n\n  while (temp > 0n) {\n    segments.push(Number(temp % 1000n))\n    temp = temp / 1000n\n  }\n  return segments\n}\n\nfunction integerToWords (n) {\n  if (n === 0n) return ZERO\n\n  // segments stored least-significant first: [ones, thousands, millions, ...]\n  const segments = extractSegments(n)\n  const parts = []\n\n  // Iterate from highest scale to lowest\n  for (let scaleIndex = segments.length - 1; scaleIndex >= 0; scaleIndex--) {\n    const val = segments[scaleIndex]\n    if (val === 0) continue\n\n    if (scaleIndex === 0) {\n      // Units segment\n      if (val < 10 && parts.length > 0) {\n        parts.push('na ' + ONES[val])\n      } else if (val === 100 && parts.length > 0) {\n        // In compound numbers (e.g., 1100 -> 'elfu moja mia'), use 'mia' not 'mia moja'\n        parts.push('mia')\n      } else {\n        parts.push(wordsUnder1000(val))\n      }\n    } else {\n      // Scale segments: 'elfu moja', 'milioni mbili'\n      const unit = (val === 1) ? 'moja' : wordsUnder1000(val)\n      parts.push(SCALE_WORDS[scaleIndex] + ' ' + unit)\n    }\n  }\n\n  return parts.join(' ').trim()\n}\n\nfunction decimalPartToWords (decimalPart) {\n  let result = ''\n  let i = 0\n\n  while (i < decimalPart.length && decimalPart[i] === '0') {\n    if (result) result += ' '\n    result += ZERO\n    i++\n  }\n\n  const remainder = decimalPart.slice(i)\n  if (remainder) {\n    if (result) result += ' '\n    result += integerToWords(BigInt(remainder))\n  }\n\n  return result\n}\n\n/**\n * Converts a numeric value to Swahili words.\n *\n * @param {number | string | bigint} value - The numeric value to convert\n * @returns {string} The number in Swahili words\n */\nfunction toWords (value) {\n  const { isNegative, integerPart, decimalPart } = parseNumericValue(value)\n\n  let result = ''\n\n  if (isNegative) {\n    result = NEGATIVE + ' '\n  }\n\n  result += integerToWords(integerPart)\n\n  if (decimalPart) {\n    result += ' ' + DECIMAL_SEP + ' ' + decimalPartToWords(decimalPart)\n  }\n\n  return result\n}\n\n// ============================================================================\n// Exports\n// ============================================================================\n\nexport { toWords }\n"],"names":["parseNumericString","str","isNegative","slice","dotIndex","indexOf","integerPart","BigInt","integerStr","decimalPart","expandScientificNotation","mantissa","expStr","toLowerCase","split","exp","parseInt","digits","newDotPosition","length","repeat","ONES","TENS","SCALE_WORDS","ZERO","wordsUnder100","n","tens","Math","trunc","ones","wordsUnder1000","hundreds","rest","parts","push","join","integerToWords","segments","temp","Number","extractSegments","scaleIndex","val","unit","trim","value","type","isFinite","Error","isSafeInteger","toString","includes","numberToString","trimmed","isNaN","normalizeString","TypeError","parseNumericValue","result","NEGATIVE","i","remainder","decimalPartToWords"],"mappings":";0CAwEA,SAASA,EAAoBC,GAC3B,MAAMC,EAAwB,MAAXD,EAAI,GACnBC,IAAYD,EAAMA,EAAIE,MAAM,IAEhC,MAAMC,EAAWH,EAAII,QAAQ,KAC7B,IAAiB,IAAbD,EACF,MAAO,CAAEF,aAAYI,YAAaC,OAAON,IAG3C,MAAMO,EAAaP,EAAIE,MAAM,EAAGC,IAAa,IACvCK,EAAcR,EAAIE,MAAMC,EAAW,GACzC,MAAO,CAAEF,aAAYI,YAAaC,OAAOC,GAAaC,cACxD,CAKA,SAASC,EAA0BT,GACjC,MAAOU,EAAUC,GAAUX,EAAIY,cAAcC,MAAM,KAC7CC,EAAMC,SAASJ,EAAQ,IAEvBR,EAAWO,EAASN,QAAQ,KAC5BY,OAASb,EACXO,EACAA,EAASR,MAAM,EAAGC,GAAYO,EAASR,MAAMC,EAAW,GAEtDc,IAD6B,IAAbd,EAAkBO,EAASQ,OAASf,GACnBW,EAEvC,OAAIG,GAAkBD,EAAOE,OACpBF,EAAS,IAAIG,OAAOF,EAAiBD,EAAOE,QAEjDD,GAAkB,EACb,KAAO,IAAIE,QAAQF,GAAkBD,EAEvCA,EAAOd,MAAM,EAAGe,GAAkB,IAAMD,EAAOd,MAAMe,EAC9D,CC1FA,MAAMG,EAAO,CAAC,SAAU,OAAQ,QAAS,OAAQ,MAAO,OAAQ,OAAQ,OAAQ,OAAQ,QAClFC,EAAO,CAAE,GAAI,OAAQ,GAAI,WAAY,GAAI,aAAc,GAAI,WAAY,GAAI,UAAW,GAAI,SAAU,GAAI,SAAU,GAAI,YAAa,GAAI,UAEvIC,EAAc,CAAC,GAAI,OAAQ,UAAW,UAAW,WAAY,cAAe,eAE5EC,EAAO,SAQb,SAASC,EAAeC,GACtB,GAAIA,EAAI,GAAI,OAAOL,EAAKK,GACxB,GAAU,KAANA,EAAU,OAAOJ,EAAK,IAC1B,GAAII,EAAI,GAEN,OAAOJ,EAAK,IAAM,OAASD,EAAKK,EAAI,IAEtC,MAAMC,EAA4B,GAArBC,KAAKC,MAAMH,EAAI,IACtBI,EAAOJ,EAAI,GACjB,OAAa,IAATI,EAAmBR,EAAKK,GACrBL,EAAKK,GAAQ,OAASN,EAAKS,EACpC,CAEA,SAASC,EAAgBL,GACvB,GAAIA,EAAI,IAAK,OAAOD,EAAcC,GAClC,GAAU,MAANA,EAAW,MAAO,WACtB,MAAMM,EAAWJ,KAAKC,MAAMH,EAAI,KAC1BO,EAAOP,EAAI,IACXQ,EAAQ,GAYd,OATAA,EAAMC,KAAK,OAASd,EAAKW,IACrBC,EAAO,GAEPC,EAAMC,KADJF,EAAO,GACE,MAAQZ,EAAKY,GAEbR,EAAcQ,IAItBC,EAAME,KAAK,IACpB,CAYA,SAASC,EAAgBX,GACvB,GAAU,KAANA,EAAU,OAAOF,EAGrB,MAAMc,EAdR,SAA0BZ,GACxB,MAAMY,EAAW,GACjB,IAAIC,EAAOb,EACX,KAAOa,EAAO,IACZD,EAASH,KAAKK,OAAOD,EAAO,QAC5BA,GAAc,MAEhB,OAAOD,CACT,CAMmBG,CAAgBf,GAC3BQ,EAAQ,GAGd,IAAK,IAAIQ,EAAaJ,EAASnB,OAAS,EAAGuB,GAAc,EAAGA,IAAc,CACxE,MAAMC,EAAML,EAASI,GACrB,GAAY,IAARC,EAEJ,GAAmB,IAAfD,EAGAR,EAAMC,KADJQ,EAAM,IAAMT,EAAMf,OAAS,EAClB,MAAQE,EAAKsB,GACP,MAARA,GAAeT,EAAMf,OAAS,EAE5B,MAEAY,EAAeY,QAEvB,CAEL,MAAMC,EAAgB,IAARD,EAAa,OAASZ,EAAeY,GACnDT,EAAMC,KAAKZ,EAAYmB,GAAc,IAAME,EAC7C,CACF,CAEA,OAAOV,EAAME,KAAK,KAAKS,MACzB,MA2BA,SAAkBC,GAChB,MAAM5C,WAAEA,EAAUI,YAAEA,EAAWG,YAAEA,GDtH5B,SAA4BqC,GACjC,MAAMC,SAAcD,EAGpB,GAAa,WAATC,EACF,OAAOD,EAAQ,GACX,CAAE5C,YAAY,EAAMI,aAAcwC,GAClC,CAAE5C,YAAY,EAAOI,YAAawC,GAIxC,GAAa,WAATC,EAAmB,CACrB,IAAKP,OAAOQ,SAASF,GACnB,MAAM,IAAIG,MAAM,8DAElB,OAAIT,OAAOU,cAAcJ,GAChBA,EAAQ,EACX,CAAE5C,YAAY,EAAMI,YAAaC,QAAQuC,IACzC,CAAE5C,YAAY,EAAOI,YAAaC,OAAOuC,IAExC9C,EAgBX,SAAyB8C,GACvB,MAAM7C,EAAM6C,EAAMK,WAClB,OAAQlD,EAAImD,SAAS,MAAQnD,EAAImD,SAAS,KACtC1C,EAAyBT,GACzBA,CACN,CArB8BoD,CAAeP,GAC3C,CAGA,GAAa,WAATC,EACF,OAAO/C,EAqBX,SAA0B8C,GACxB,MAAMQ,EAAUR,EAAMD,OACtB,GAAuB,IAAnBS,EAAQnC,QAAgBqB,OAAOe,MAAMf,OAAOc,IAC9C,MAAM,IAAIL,MAAM,2BAA2BH,MAE7C,OAAQQ,EAAQF,SAAS,MAAQE,EAAQF,SAAS,KAC9C1C,EAAyB4C,GACzBA,CACN,CA7B8BE,CAAgBV,IAG5C,MAAM,IAAIW,UACR,oEAAoEV,IAExE,CCuFmDW,CAAkBZ,GAEnE,IAAIa,EAAS,GAYb,OAVIzD,IACFyD,EAASC,UAGXD,GAAUtB,EAAe/B,GAErBG,IACFkD,GAAU,UArCd,SAA6BlD,GAC3B,IAAIkD,EAAS,GACTE,EAAI,EAER,KAAOA,EAAIpD,EAAYU,QAA6B,MAAnBV,EAAYoD,IACvCF,IAAQA,GAAU,KACtBA,GAAUnC,EACVqC,IAGF,MAAMC,EAAYrD,EAAYN,MAAM0D,GAMpC,OALIC,IACEH,IAAQA,GAAU,KACtBA,GAAUtB,EAAe9B,OAAOuD,KAG3BH,CACT,CAoBwCI,CAAmBtD,IAGlDkD,CACT"}

package/dist/languages/ta.js

@@ -1,3 +0,0 @@
-/*! n2words/ta v3.0.0 | MIT License | github.com/forzagreen/n2words */
-var e,t;e=this,t=function(e){"use strict";function t(e){const t="-"===e[0];t&&(e=e.slice(1));const n=e.indexOf(".");if(-1===n)return{isNegative:t,integerPart:BigInt(e)};const i=e.slice(0,n)||"0",r=e.slice(n+1);return{isNegative:t,integerPart:BigInt(i),decimalPart:r}}function n(e){const[t,n]=e.toLowerCase().split("e"),i=parseInt(n,10),r=t.indexOf("."),s=-1===r?t:t.slice(0,r)+t.slice(r+1),o=(-1===r?t.length:r)+i;return o>=s.length?s+"0".repeat(o-s.length):o<=0?"0."+"0".repeat(-o)+s:s.slice(0,o)+"."+s.slice(o)}const i="பூஜ்ஜியம்",r=["பூஜ்ஜியம்","ஒன்று","இரண்டு","மூன்று","நான்கு","ஐந்து","ஆறு","ஏழு","எட்டு","ஒன்பது","பத்து","பதினொன்று","பன்னிரண்டு","பதிமூன்று","பதினான்கு","பதினைந்து","பதினாறு","பதினேழு","பதினெட்டு","பத்தொன்பது","இருபது","இருபத்தொன்று","இருபத்திரண்டு","இருபத்திமூன்று","இருபத்திநான்கு","இருபத்தைந்து","இருபத்தாறு","இருபத்தேழு","இருபத்தெட்டு","இருபத்தொன்பது","முப்பது","முப்பத்தொன்று","முப்பத்திரண்டு","முப்பத்திமூன்று","முப்பத்திநான்கு","முப்பத்தைந்து","முப்பத்தாறு","முப்பத்தேழு","முப்பத்தெட்டு","முப்பத்தொன்பது","நாற்பது","நாற்பத்தொன்று","நாற்பத்திரண்டு","நாற்பத்திமூன்று","நாற்பத்திநான்கு","நாற்பத்தைந்து","நாற்பத்தாறு","நாற்பத்தேழு","நாற்பத்தெட்டு","நாற்பத்தொன்பது","ஐம்பது","ஐம்பத்தொன்று","ஐம்பத்திரண்டு","ஐம்பத்திமூன்று","ஐம்பத்திநான்கு","ஐம்பத்தைந்து","ஐம்பத்தாறு","ஐம்பத்தேழு","ஐம்பத்தெட்டு","ஐம்பத்தொன்பது","அறுபது","அறுபத்தொன்று","அறுபத்திரண்டு","அறுபத்திமூன்று","அறுபத்திநான்கு","அறுபத்தைந்து","அறுபத்தாறு","அறுபத்தேழு","அறுபத்தெட்டு","அறுபத்தொன்பது","எழுபது","எழுபத்தொன்று","எழுபத்திரண்டு","எழுபத்திமூன்று","எழுபத்திநான்கு","எழுபத்தைந்து","எழுபத்தாறு","எழுபத்தேழு","எழுபத்தெட்டு","எழுபத்தொன்பது","எண்பது","எண்பத்தொன்று","எண்பத்திரண்டு","எண்பத்திமூன்று","எண்பத்திநான்கு","எண்பத்தைந்து","எண்பத்தாறு","எண்பத்தேழு","எண்பத்தெட்டு","எண்பத்தொன்பது","தொண்ணூறு","தொண்ணூற்று ஒன்று","தொண்ணூற்று இரண்டு","தொண்ணூற்று மூன்று","தொண்ணூற்று நான்கு","தொண்ணூற்று ஐந்து","தொண்ணூற்று ஆறு","தொண்ணூற்று ஏழு","தொண்ணூற்று எட்டு","தொண்ணூற்று ஒன்பது"],s=["","நூறு","இருநூறு","முன்னூறு","நானூறு","ஐநூறு","அறுநூறு","எழுநூறு","எண்நூறு","தொள்ளாயிரம்"],o=["","நூற்று","இருநூற்று","முன்னூற்று","நானூற்று","ஐநூற்று","அறுநூற்று","எழுநூற்று","எண்நூற்று","தொள்ளாயிரத்து"],u=["ஒன்று","இரண்டு","மூன்று","நான்கு","ஐந்து","ஆறு","ஏழு","எட்டு","ஒன்பது"],c=["","ஆயிரம்","லட்சம்","கோடி","அரபு","கராபு","நீல்","பத்ம","சங்கு"];function f(e){if(0===e)return"";if(e<100)return r[e];const t=Math.trunc(e/100),n=e%100;return 0===n?s[t]:o[t]+" "+r[n]}e.ta=function(e){const{isNegative:r,integerPart:s,decimalPart:o}=function(e){const i=typeof e;if("bigint"===i)return e<0n?{isNegative:!0,integerPart:-e}:{isNegative:!1,integerPart:e};if("number"===i){if(!Number.isFinite(e))throw new Error("Number must be finite (NaN and Infinity are not supported)");return Number.isSafeInteger(e)?e<0?{isNegative:!0,integerPart:BigInt(-e)}:{isNegative:!1,integerPart:BigInt(e)}:t(function(e){const t=e.toString();return t.includes("e")||t.includes("E")?n(t):t}(e))}if("string"===i)return t(function(e){const t=e.trim();if(0===t.length||Number.isNaN(Number(t)))throw new Error(`Invalid number format: "${e}"`);return t.includes("e")||t.includes("E")?n(t):t}(e));throw new TypeError(`Invalid value type: expected number, string, or bigint, received ${i}`)}(e);let a="";return r&&(a="மைனஸ் "),a+=function(e){if(0n===e)return i;const t=function(e){const t=e.toString();if(t.length<=3)return[Number(t)];const n=[],i=t.slice(-3);n.unshift(Number(i));let r=t.slice(0,-3);for(;r.length>0;){const e=r.slice(-2);n.unshift(Number(e)),r=r.slice(0,-2)}return n}(e),n=t.length,r=[];for(let e=0;e<n;e++){const i=t[e];if(0===i)continue;const s=n-e-1,o=1===i&&s>0?"ஒரு":f(i);r.push(o),s>0&&c[s]&&r.push(c[s])}return r.join(" ").trim()}(s),o&&(a+=" புள்ளி "+function(e){const t=[];for(const n of e){const e=parseInt(n,10);t.push(0===e?i:u[e-1])}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=ta.js.map