zeed 1.3.0 → 1.4.0

package/dist/common/data/object.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"object.mjs","names":[],"sources":["../../../src/common/data/object.ts"],"sourcesContent":["import { isArray, isBinaryArray, isObject, isPrimitive, isSymbol } from './is'\n\n/** Like `.map()` for object. Return new key and value or `undefined` to delete. */\nexport function objectMap<T = any>(\n  obj: any,\n  fn: (key: string, value: any) => [key: string, value: T] | T | undefined | null,\n): Record<string, T> {\n  if (!isObject(obj))\n    return {}\n  return Object.fromEntries(\n    Object.entries(obj)\n      .map(([k, v]) => {\n        const r = fn(k, v)\n        if (isArray(r) && r.length === 2)\n          return r\n        return [k, r]\n      })\n      .filter(v => v != null),\n  )\n}\n\n/** Like `.filter()` for object. */\nexport function objectFilter<T = any>(\n  obj: any,\n  fn: (key: string, value: any) => boolean,\n): Partial<T> {\n  if (!isObject(obj))\n    return {}\n  return Object.fromEntries(Object.entries(obj).filter(([k, v]) => fn(k, v))) as any\n}\n\n/** Merge right into left object. If dispose is defined, it will be combined. Left can be a complex object i.e. a insantiated class. */\nexport function objectMergeDisposable<A extends object, B extends object>(\n  a: A,\n  b: B,\n): A & B {\n  // @ts-expect-error xxx\n  if (b.dispose && a.dispose) {\n    // @ts-expect-error xxx\n    b.dispose.add(a.dispose)\n  }\n  return Object.assign(a, b)\n}\n\n// export function objectMerge<A, B>(a: A, b: B): A & B {\n//   return Object.assign({}, a, b)\n// }\n\nexport function objectIsEmpty(obj: object) {\n  return Object.keys(obj).length <= 0\n}\n\n// https://stackoverflow.com/a/56592365/140927\nexport function objectPick<T extends object, K extends keyof T>(obj: T, ...keys: K[]) {\n  return Object.fromEntries(keys.filter(key => key in obj).map(key => [key, obj[key]])) as Pick<T, K>\n}\n\nexport function objectInclusivePick<T extends object, K extends (string | number | symbol)>(obj: T, ...keys: K[]) {\n  return Object.fromEntries(keys.map(key => [key, obj[key as unknown as keyof T]])) as { [key in K]: key extends keyof T ? T[key] : undefined }\n}\n\nexport function objectOmit<T extends object, K extends keyof T>(obj: T, ...keys: K[]) {\n  return Object.fromEntries(Object.entries(obj).filter(([key]) => !keys.includes(key as K))) as Omit<T, K>\n}\n\n/// Convert object to plain object with max depth.\nexport function objectPlain(obj: any, opt?: {\n  maxDepth?: number\n  maxDepthValue?: any\n  circleValue?: any\n  errorTrace?: boolean\n  filter?: (value: any) => boolean\n  keepAsIs?: (value: any) => boolean\n  transformer?: (value: any) => any | undefined\n}): any {\n  const {\n    maxDepth = 99,\n    circleValue,\n    maxDepthValue,\n    errorTrace = true,\n    filter = () => true,\n    keepAsIs = () => false,\n    transformer = () => undefined,\n  } = opt ?? {}\n\n  const cycle: any = []\n\n  function handleObject(obj: any, depth: number): any {\n    if (depth > maxDepth)\n      return maxDepthValue // '*** MAX DEPTH ***'\n\n    if (keepAsIs(obj))\n      return obj\n\n    if (!isPrimitive(obj)) {\n      if (cycle.includes(obj))\n        return circleValue // '*** CYCLE ***'\n      cycle.push(obj)\n    }\n\n    if (transformer) {\n      const result = transformer(obj)\n      if (result !== undefined)\n        return result\n    }\n\n    if (isSymbol(obj))\n      return String(obj)\n\n    if (isPrimitive(obj))\n      return obj\n\n    if (typeof Date !== 'undefined' && obj instanceof Date) {\n      return {\n        __class: 'Date',\n        value: obj.toISOString(),\n      }\n    }\n\n    if (typeof RegExp !== 'undefined' && obj instanceof RegExp) {\n      return {\n        __class: 'RegExp',\n        source: obj.toString(),\n      }\n    }\n\n    if (typeof Map !== 'undefined' && obj instanceof Map)\n      obj = Object.fromEntries(obj)\n\n    if (typeof Set !== 'undefined' && obj instanceof Set || isBinaryArray(obj))\n      obj = Array.from(obj as any)\n\n    if (typeof ErrorEvent !== 'undefined' && obj instanceof ErrorEvent) {\n      return {\n        __class: 'ErrorEvent',\n        message: obj.message,\n        filename: obj.filename,\n        lineno: obj.lineno,\n        colno: obj.colno,\n        error: obj.error ? handleObject(obj.error, depth + 1) : undefined,\n      }\n    }\n\n    if (typeof Event !== 'undefined' && obj instanceof Event) {\n      return {\n        __class: 'Event',\n        type: obj.type,\n        eventPhase: obj.eventPhase,\n        bubbles: obj.bubbles,\n        cancelable: obj.cancelable,\n        defaultPrevented: obj.defaultPrevented,\n        composed: obj.composed,\n        timeStamp: obj.timeStamp,\n      }\n    }\n\n    if (typeof Error !== 'undefined' && obj instanceof Error) {\n      return {\n        __class: 'Error',\n        name: obj.name,\n        message: obj.message,\n        stack: errorTrace ? obj.stack : undefined,\n        cause: (obj as any).cause ? String((obj as any).cause) : undefined,\n      }\n    }\n    // return `${obj.name || 'Error'}: ${obj.message}${errorTrace ? `\\n${obj.stack}` : ''}`\n\n    /* if (obj instanceof Element) {\n      const attrs = obj.getAttributeNames().map(name => `${name}=\"${String(obj.getAttribute(name))}\"`).join(' ')\n      return `<${[obj.tagName.toLocaleLowerCase(), ...attrs].join(' ')}}>`\n    }  */\n\n    if (Array.isArray(obj)) {\n      return obj\n        .filter(filter)\n        .map(o => handleObject(o, depth + 1))\n    }\n\n    // For class objects just dump the first level of primitives\n    const objName = obj?.constructor?.name\n    if (objName && objName !== 'Object') {\n      const nobj: any = {\n        __class: objName,\n        // __code: obj.toString ? obj.toString() : undefined,\n      }\n      for (const k in obj) {\n        if (obj && obj.hasOwnProperty(k) && isPrimitive(obj[k]))\n          nobj[k] = obj[k]\n      }\n      return nobj\n    }\n\n    // Plain objects are recursively dumped\n    const nobj: any = {}\n    for (const key in obj) {\n      const value = obj[key]\n      if (filter(value))\n        nobj[key] = handleObject(value, depth + 1)\n    }\n    return nobj\n\n    // return undefined\n  }\n\n  return handleObject(obj, 0)\n}\n"],"mappings":"mGAGA,SAAgB,EACd,EACA,EACmB,CAGnB,OAFK,EAAS,EAAI,CAEX,OAAO,YACZ,OAAO,QAAQ,EAAI,CAChB,KAAK,CAAC,EAAG,KAAO,CACf,IAAM,EAAI,EAAG,EAAG,EAAE,CAGlB,OAFI,EAAQ,EAAE,EAAI,EAAE,SAAW,EACtB,EACF,CAAC,EAAG,EAAE,EACb,CACD,OAAO,GAAK,GAAK,KAAK,CAC1B,CAVQ,EAAE,CAcb,SAAgB,EACd,EACA,EACY,CAGZ,OAFK,EAAS,EAAI,CAEX,OAAO,YAAY,OAAO,QAAQ,EAAI,CAAC,QAAQ,CAAC,EAAG,KAAO,EAAG,EAAG,EAAE,CAAC,CAAC,CADlE,EAAE,CAKb,SAAgB,EACd,EACA,EACO,CAMP,OAJI,EAAE,SAAW,EAAE,SAEjB,EAAE,QAAQ,IAAI,EAAE,QAAQ,CAEnB,OAAO,OAAO,EAAG,EAAE,CAO5B,SAAgB,EAAc,EAAa,CACzC,OAAO,OAAO,KAAK,EAAI,CAAC,QAAU,EAIpC,SAAgB,EAAgD,EAAQ,GAAG,EAAW,CACpF,OAAO,OAAO,YAAY,EAAK,OAAO,GAAO,KAAO,EAAI,CAAC,IAAI,GAAO,CAAC,EAAK,EAAI,GAAK,CAAC,CAAC,CAGvF,SAAgB,EAA4E,EAAQ,GAAG,EAAW,CAChH,OAAO,OAAO,YAAY,EAAK,IAAI,GAAO,CAAC,EAAK,EAAI,GAA2B,CAAC,CAAC,CAGnF,SAAgB,EAAgD,EAAQ,GAAG,EAAW,CACpF,OAAO,OAAO,YAAY,OAAO,QAAQ,EAAI,CAAC,QAAQ,CAAC,KAAS,CAAC,EAAK,SAAS,EAAS,CAAC,CAAC,CAI5F,SAAgB,EAAY,EAAU,EAQ9B,CACN,GAAM,CACJ,WAAW,GACX,cACA,gBACA,aAAa,GACb,aAAe,GACf,eAAiB,GACjB,kBAAoB,IAAA,IAClB,GAAO,EAAE,CAEP,EAAa,EAAE,CAErB,SAAS,EAAa,EAAU,EAAoB,CAClD,GAAI,EAAQ,EACV,OAAO,EAET,GAAI,EAAS,EAAI,CACf,OAAO,EAET,GAAI,CAAC,EAAY,EAAI,CAAE,CACrB,GAAI,EAAM,SAAS,EAAI,CACrB,OAAO,EACT,EAAM,KAAK,EAAI,CAGjB,GAAI,EAAa,CACf,IAAM,EAAS,EAAY,EAAI,CAC/B,GAAI,IAAW,IAAA,GACb,OAAO,EAGX,GAAI,EAAS,EAAI,CACf,OAAO,OAAO,EAAI,CAEpB,GAAI,EAAY,EAAI,CAClB,OAAO,EAET,GAAI,OAAO,KAAS,KAAe,aAAe,KAChD,MAAO,CACL,QAAS,OACT,MAAO,EAAI,aAAa,CACzB,CAGH,GAAI,OAAO,OAAW,KAAe,aAAe,OAClD,MAAO,CACL,QAAS,SACT,OAAQ,EAAI,UAAU,CACvB,CASH,GANI,OAAO,IAAQ,KAAe,aAAe,MAC/C,EAAM,OAAO,YAAY,EAAI,GAE3B,OAAO,IAAQ,KAAe,aAAe,KAAO,EAAc,EAAI,IACxE,EAAM,MAAM,KAAK,EAAW,EAE1B,OAAO,WAAe,KAAe,aAAe,WACtD,MAAO,CACL,QAAS,aACT,QAAS,EAAI,QACb,SAAU,EAAI,SACd,OAAQ,EAAI,OACZ,MAAO,EAAI,MACX,MAAO,EAAI,MAAQ,EAAa,EAAI,MAAO,EAAQ,EAAE,CAAG,IAAA,GACzD,CAGH,GAAI,OAAO,MAAU,KAAe,aAAe,MACjD,MAAO,CACL,QAAS,QACT,KAAM,EAAI,KACV,WAAY,EAAI,WAChB,QAAS,EAAI,QACb,WAAY,EAAI,WAChB,iBAAkB,EAAI,iBACtB,SAAU,EAAI,SACd,UAAW,EAAI,UAChB,CAGH,GAAI,OAAO,MAAU,KAAe,aAAe,MACjD,MAAO,CACL,QAAS,QACT,KAAM,EAAI,KACV,QAAS,EAAI,QACb,MAAO,EAAa,EAAI,MAAQ,IAAA,GAChC,MAAQ,EAAY,MAAQ,OAAQ,EAAY,MAAM,CAAG,IAAA,GAC1D,CASH,GAAI,MAAM,QAAQ,EAAI,CACpB,OAAO,EACJ,OAAO,EAAO,CACd,IAAI,GAAK,EAAa,EAAG,EAAQ,EAAE,CAAC,CAIzC,IAAM,EAAU,GAAK,aAAa,KAClC,GAAI,GAAW,IAAY,SAAU,CACnC,IAAM,EAAY,CAChB,QAAS,EAEV,CACD,IAAK,IAAM,KAAK,EACV,GAAO,EAAI,eAAe,EAAE,EAAI,EAAY,EAAI,GAAG,GACrD,EAAK,GAAK,EAAI,IAElB,OAAO,EAIT,IAAM,EAAY,EAAE,CACpB,IAAK,IAAM,KAAO,EAAK,CACrB,IAAM,EAAQ,EAAI,GACd,EAAO,EAAM,GACf,EAAK,GAAO,EAAa,EAAO,EAAQ,EAAE,EAE9C,OAAO,EAKT,OAAO,EAAa,EAAK,EAAE"}
+{"version":3,"file":"object.mjs","names":[],"sources":["../../../src/common/data/object.ts"],"sourcesContent":["import { isArray, isBinaryArray, isObject, isPrimitive, isSymbol } from './is'\n\n/** Like `.map()` for object. Return new key and value or `undefined` to delete. */\nexport function objectMap<T = any>(\n  obj: any,\n  fn: (key: string, value: any) => [key: string, value: T] | T | undefined | null,\n): Record<string, T> {\n  if (!isObject(obj))\n    return {}\n  return Object.fromEntries(\n    Object.entries(obj)\n      .map(([k, v]) => {\n        const r = fn(k, v)\n        if (isArray(r) && r.length === 2)\n          return r\n        return [k, r]\n      })\n      .filter(v => v != null),\n  )\n}\n\n/** Like `.filter()` for object. */\nexport function objectFilter<T = any>(\n  obj: any,\n  fn: (key: string, value: any) => boolean,\n): Partial<T> {\n  if (!isObject(obj))\n    return {}\n  return Object.fromEntries(Object.entries(obj).filter(([k, v]) => fn(k, v))) as any\n}\n\n/** Merge right into left object. If dispose is defined, it will be combined. Left can be a complex object i.e. a insantiated class. */\nexport function objectMergeDisposable<A extends object, B extends object>(\n  a: A,\n  b: B,\n): A & B {\n  // @ts-expect-error xxx\n  if (b.dispose && a.dispose) {\n    // @ts-expect-error xxx\n    b.dispose.add(a.dispose)\n  }\n  return Object.assign(a, b)\n}\n\n// export function objectMerge<A, B>(a: A, b: B): A & B {\n//   return Object.assign({}, a, b)\n// }\n\nexport function objectIsEmpty(obj: object) {\n  return Object.keys(obj).length <= 0\n}\n\n// https://stackoverflow.com/a/56592365/140927\nexport function objectPick<T extends object, K extends keyof T>(obj: T, ...keys: K[]) {\n  return Object.fromEntries(keys.filter(key => key in obj).map(key => [key, obj[key]])) as Pick<T, K>\n}\n\nexport function objectInclusivePick<T extends object, K extends (string | number | symbol)>(obj: T, ...keys: K[]) {\n  return Object.fromEntries(keys.map(key => [key, obj[key as unknown as keyof T]])) as { [key in K]: key extends keyof T ? T[key] : undefined }\n}\n\nexport function objectOmit<T extends object, K extends keyof T>(obj: T, ...keys: K[]) {\n  return Object.fromEntries(Object.entries(obj).filter(([key]) => !keys.includes(key as K))) as Omit<T, K>\n}\n\n/// Convert object to plain object with max depth.\nexport function objectPlain(obj: any, opt?: {\n  maxDepth?: number\n  maxDepthValue?: any\n  circleValue?: any\n  errorTrace?: boolean\n  filter?: (value: any) => boolean\n  keepAsIs?: (value: any) => boolean\n  transformer?: (value: any) => any | undefined\n}): any {\n  const {\n    maxDepth = 99,\n    circleValue,\n    maxDepthValue,\n    errorTrace = true,\n    filter = () => true,\n    keepAsIs = () => false,\n    transformer = () => undefined,\n  } = opt ?? {}\n\n  const cycle: any = []\n\n  function handleObject(obj: any, depth: number): any {\n    if (depth > maxDepth)\n      return maxDepthValue // '*** MAX DEPTH ***'\n\n    if (keepAsIs(obj))\n      return obj\n\n    if (!isPrimitive(obj)) {\n      if (cycle.includes(obj))\n        return circleValue // '*** CYCLE ***'\n      cycle.push(obj)\n    }\n\n    if (transformer) {\n      const result = transformer(obj)\n      if (result !== undefined)\n        return result\n    }\n\n    if (isSymbol(obj))\n      return String(obj)\n\n    if (isPrimitive(obj))\n      return obj\n\n    if (typeof Date !== 'undefined' && obj instanceof Date) {\n      return {\n        __class: 'Date',\n        value: obj.toISOString(),\n      }\n    }\n\n    if (typeof RegExp !== 'undefined' && obj instanceof RegExp) {\n      return {\n        __class: 'RegExp',\n        source: obj.toString(),\n      }\n    }\n\n    if (typeof Map !== 'undefined' && obj instanceof Map)\n      obj = Object.fromEntries(obj)\n\n    if (typeof Set !== 'undefined' && obj instanceof Set || isBinaryArray(obj))\n      obj = Array.from(obj as any)\n\n    if (typeof ErrorEvent !== 'undefined' && obj instanceof ErrorEvent) {\n      return {\n        __class: 'ErrorEvent',\n        message: obj.message,\n        filename: obj.filename,\n        lineno: obj.lineno,\n        colno: obj.colno,\n        error: obj.error ? handleObject(obj.error, depth + 1) : undefined,\n      }\n    }\n\n    if (typeof Event !== 'undefined' && obj instanceof Event) {\n      return {\n        __class: 'Event',\n        type: obj.type,\n        eventPhase: obj.eventPhase,\n        bubbles: obj.bubbles,\n        cancelable: obj.cancelable,\n        defaultPrevented: obj.defaultPrevented,\n        composed: obj.composed,\n        timeStamp: obj.timeStamp,\n      }\n    }\n\n    if (typeof Error !== 'undefined' && obj instanceof Error) {\n      return {\n        __class: 'Error',\n        name: obj.name,\n        message: obj.message,\n        stack: errorTrace ? obj.stack : undefined,\n        cause: (obj as any).cause ? String((obj as any).cause) : undefined,\n      }\n    }\n    // return `${obj.name || 'Error'}: ${obj.message}${errorTrace ? `\\n${obj.stack}` : ''}`\n\n    /* if (obj instanceof Element) {\n      const attrs = obj.getAttributeNames().map(name => `${name}=\"${String(obj.getAttribute(name))}\"`).join(' ')\n      return `<${[obj.tagName.toLocaleLowerCase(), ...attrs].join(' ')}}>`\n    }  */\n\n    if (Array.isArray(obj)) {\n      return obj\n        .filter(filter)\n        .map(o => handleObject(o, depth + 1))\n    }\n\n    // For class objects just dump the first level of primitives\n    const objName = obj?.constructor?.name\n    if (objName && objName !== 'Object') {\n      const nobj: any = {\n        __class: objName,\n        // __code: obj.toString ? obj.toString() : undefined,\n      }\n      for (const k in obj) {\n        if (obj && obj.hasOwnProperty(k) && isPrimitive(obj[k]))\n          nobj[k] = obj[k]\n      }\n      return nobj\n    }\n\n    // Plain objects are recursively dumped\n    const nobj: any = {}\n    for (const key in obj) {\n      const value = obj[key]\n      if (filter(value))\n        nobj[key] = handleObject(value, depth + 1)\n    }\n    return nobj\n\n    // return undefined\n  }\n\n  return handleObject(obj, 0)\n}\n"],"mappings":";;;;AAGA,SAAgB,UACd,KACA,IACmB;AACnB,KAAI,CAAC,SAAS,IAAI,CAChB,QAAO,EAAE;AACX,QAAO,OAAO,YACZ,OAAO,QAAQ,IAAI,CAChB,KAAK,CAAC,GAAG,OAAO;EACf,MAAM,IAAI,GAAG,GAAG,EAAE;AAClB,MAAI,QAAQ,EAAE,IAAI,EAAE,WAAW,EAC7B,QAAO;AACT,SAAO,CAAC,GAAG,EAAE;GACb,CACD,QAAO,MAAK,KAAK,KAAK,CAC1B;;;AAIH,SAAgB,aACd,KACA,IACY;AACZ,KAAI,CAAC,SAAS,IAAI,CAChB,QAAO,EAAE;AACX,QAAO,OAAO,YAAY,OAAO,QAAQ,IAAI,CAAC,QAAQ,CAAC,GAAG,OAAO,GAAG,GAAG,EAAE,CAAC,CAAC;;;AAI7E,SAAgB,sBACd,GACA,GACO;AAEP,KAAI,EAAE,WAAW,EAAE,QAEjB,GAAE,QAAQ,IAAI,EAAE,QAAQ;AAE1B,QAAO,OAAO,OAAO,GAAG,EAAE;;AAO5B,SAAgB,cAAc,KAAa;AACzC,QAAO,OAAO,KAAK,IAAI,CAAC,UAAU;;AAIpC,SAAgB,WAAgD,KAAQ,GAAG,MAAW;AACpF,QAAO,OAAO,YAAY,KAAK,QAAO,QAAO,OAAO,IAAI,CAAC,KAAI,QAAO,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC;;AAGvF,SAAgB,oBAA4E,KAAQ,GAAG,MAAW;AAChH,QAAO,OAAO,YAAY,KAAK,KAAI,QAAO,CAAC,KAAK,IAAI,KAA2B,CAAC,CAAC;;AAGnF,SAAgB,WAAgD,KAAQ,GAAG,MAAW;AACpF,QAAO,OAAO,YAAY,OAAO,QAAQ,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,SAAS,IAAS,CAAC,CAAC;;AAI5F,SAAgB,YAAY,KAAU,KAQ9B;CACN,MAAM,EACJ,WAAW,IACX,aACA,eACA,aAAa,MACb,eAAe,MACf,iBAAiB,OACjB,oBAAoB,WAClB,OAAO,EAAE;CAEb,MAAM,QAAa,EAAE;CAErB,SAAS,aAAa,KAAU,OAAoB;AAClD,MAAI,QAAQ,SACV,QAAO;AAET,MAAI,SAAS,IAAI,CACf,QAAO;AAET,MAAI,CAAC,YAAY,IAAI,EAAE;AACrB,OAAI,MAAM,SAAS,IAAI,CACrB,QAAO;AACT,SAAM,KAAK,IAAI;;AAGjB,MAAI,aAAa;GACf,MAAM,SAAS,YAAY,IAAI;AAC/B,OAAI,WAAW,OACb,QAAO;;AAGX,MAAI,SAAS,IAAI,CACf,QAAO,OAAO,IAAI;AAEpB,MAAI,YAAY,IAAI,CAClB,QAAO;AAET,MAAI,OAAO,SAAS,eAAe,eAAe,KAChD,QAAO;GACL,SAAS;GACT,OAAO,IAAI,aAAa;GACzB;AAGH,MAAI,OAAO,WAAW,eAAe,eAAe,OAClD,QAAO;GACL,SAAS;GACT,QAAQ,IAAI,UAAU;GACvB;AAGH,MAAI,OAAO,QAAQ,eAAe,eAAe,IAC/C,OAAM,OAAO,YAAY,IAAI;AAE/B,MAAI,OAAO,QAAQ,eAAe,eAAe,OAAO,cAAc,IAAI,CACxE,OAAM,MAAM,KAAK,IAAW;AAE9B,MAAI,OAAO,eAAe,eAAe,eAAe,WACtD,QAAO;GACL,SAAS;GACT,SAAS,IAAI;GACb,UAAU,IAAI;GACd,QAAQ,IAAI;GACZ,OAAO,IAAI;GACX,OAAO,IAAI,QAAQ,aAAa,IAAI,OAAO,QAAQ,EAAE,GAAG;GACzD;AAGH,MAAI,OAAO,UAAU,eAAe,eAAe,MACjD,QAAO;GACL,SAAS;GACT,MAAM,IAAI;GACV,YAAY,IAAI;GAChB,SAAS,IAAI;GACb,YAAY,IAAI;GAChB,kBAAkB,IAAI;GACtB,UAAU,IAAI;GACd,WAAW,IAAI;GAChB;AAGH,MAAI,OAAO,UAAU,eAAe,eAAe,MACjD,QAAO;GACL,SAAS;GACT,MAAM,IAAI;GACV,SAAS,IAAI;GACb,OAAO,aAAa,IAAI,QAAQ;GAChC,OAAQ,IAAY,QAAQ,OAAQ,IAAY,MAAM,GAAG;GAC1D;AASH,MAAI,MAAM,QAAQ,IAAI,CACpB,QAAO,IACJ,OAAO,OAAO,CACd,KAAI,MAAK,aAAa,GAAG,QAAQ,EAAE,CAAC;EAIzC,MAAM,UAAU,KAAK,aAAa;AAClC,MAAI,WAAW,YAAY,UAAU;GACnC,MAAM,OAAY,EAChB,SAAS,SAEV;AACD,QAAK,MAAM,KAAK,IACd,KAAI,OAAO,IAAI,eAAe,EAAE,IAAI,YAAY,IAAI,GAAG,CACrD,MAAK,KAAK,IAAI;AAElB,UAAO;;EAIT,MAAM,OAAY,EAAE;AACpB,OAAK,MAAM,OAAO,KAAK;GACrB,MAAM,QAAQ,IAAI;AAClB,OAAI,OAAO,MAAM,CACf,MAAK,OAAO,aAAa,OAAO,QAAQ,EAAE;;AAE9C,SAAO;;AAKT,QAAO,aAAa,KAAK,EAAE"}

package/dist/common/data/orderby.cjs

@@ -1,2 +1,43 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});function e(e=``){let[t=``,n=`asc`]=e.split(` `);return n=n.toLowerCase(),{field:t,orderby:n,asc:n!==`desc`,desc:n===`desc`}}function t(e,t=!0){return`${e} ${t?`asc`:`desc`}`}function n(e,t,n=!0){let r=e||0,i=t||0;return r>i?n?1:-1:r<i?n?-1:1:0}function r(t,...r){if(r.length>0){let i=r.map(e),a=Array.from(t);return a.sort((e,t)=>{for(let{field:r,asc:a}of i){let i=n(e[r],t[r],a);if(i!==0)return i}return 0}),a}return t}exports.cmp=n,exports.composeOrderby=t,exports.parseOrderby=e,exports.sortedOrderby=r;
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+
+//#region src/common/data/orderby.ts
+function parseOrderby(value = "") {
+	let [field = "", orderby = "asc"] = value.split(" ");
+	orderby = orderby.toLowerCase();
+	return {
+		field,
+		orderby,
+		asc: orderby !== "desc",
+		desc: orderby === "desc"
+	};
+}
+function composeOrderby(field, asc = true) {
+	return `${field} ${asc ? "asc" : "desc"}`;
+}
+function cmp(a, b, asc = true) {
+	const aa = a || 0;
+	const bb = b || 0;
+	return aa > bb ? asc ? 1 : -1 : aa < bb ? asc ? -1 : 1 : 0;
+}
+function sortedOrderby(values, ...orderby) {
+	if (orderby.length > 0) {
+		const orderByList = orderby.map(parseOrderby);
+		const sortValues = Array.from(values);
+		sortValues.sort((a, b) => {
+			for (const { field, asc } of orderByList) {
+				const result = cmp(a[field], b[field], asc);
+				if (result !== 0) return result;
+			}
+			return 0;
+		});
+		return sortValues;
+	}
+	return values;
+}
+
+//#endregion
+exports.cmp = cmp;
+exports.composeOrderby = composeOrderby;
+exports.parseOrderby = parseOrderby;
+exports.sortedOrderby = sortedOrderby;
 //# sourceMappingURL=orderby.cjs.map

package/dist/common/data/orderby.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"orderby.cjs","names":[],"sources":["../../../src/common/data/orderby.ts"],"sourcesContent":["export function parseOrderby(value = ''): {\n  field: string\n  orderby: string\n  asc: boolean\n  desc: boolean\n} {\n  let [field = '', orderby = 'asc'] = value.split(' ')\n  orderby = orderby.toLowerCase()\n  return {\n    field,\n    orderby,\n    asc: orderby !== 'desc',\n    desc: orderby === 'desc',\n  }\n}\n\nexport function composeOrderby(field: string, asc = true): string {\n  return `${field} ${asc ? 'asc' : 'desc'}`\n}\n\n// Classic compare function with direction flag\nexport function cmp(a: any, b: any, asc = true): -1 | 0 | 1 {\n  const aa = a || 0\n  const bb = b || 0\n  return aa > bb ? (asc ? 1 : -1) : aa < bb ? (asc ? -1 : 1) : 0 // use Math.sign(?) for performance?\n}\n\n// todo: support localeCompare()\nexport function sortedOrderby<T>(values: T[], ...orderby: string[]): T[] {\n  if (orderby.length > 0) {\n    const orderByList = orderby.map(parseOrderby)\n    // let { field, asc } = parseOrderby(orderby)\n    // if (field != null && typeof field === \"string\") {\n    // let bigger = asc ? 1 : -1\n    // let smaller = asc ? -1 : 1\n    const sortValues = Array.from(values)\n    sortValues.sort((a: any, b: any): number => {\n      for (const { field, asc } of orderByList) {\n        const result = cmp(a[field], b[field], asc)\n        if (result !== 0)\n          return result\n      }\n      return 0\n      // const aa = a[field] || 0\n      // const bb = b[field] || 0\n      // return aa > bb ? bigger : aa < bb ? smaller : 0\n    })\n    return sortValues\n  }\n  return values\n}\n"],"mappings":"mEAAA,SAAgB,EAAa,EAAQ,GAKnC,CACA,GAAI,CAAC,EAAQ,GAAI,EAAU,OAAS,EAAM,MAAM,IAAI,CAEpD,MADA,GAAU,EAAQ,aAAa,CACxB,CACL,QACA,UACA,IAAK,IAAY,OACjB,KAAM,IAAY,OACnB,CAGH,SAAgB,EAAe,EAAe,EAAM,GAAc,CAChE,MAAO,GAAG,EAAM,GAAG,EAAM,MAAQ,SAInC,SAAgB,EAAI,EAAQ,EAAQ,EAAM,GAAkB,CAC1D,IAAM,EAAK,GAAK,EACV,EAAK,GAAK,EAChB,OAAO,EAAK,EAAM,EAAM,EAAI,GAAM,EAAK,EAAM,EAAM,GAAK,EAAK,EAI/D,SAAgB,EAAiB,EAAa,GAAG,EAAwB,CACvE,GAAI,EAAQ,OAAS,EAAG,CACtB,IAAM,EAAc,EAAQ,IAAI,EAAa,CAKvC,EAAa,MAAM,KAAK,EAAO,CAYrC,OAXA,EAAW,MAAM,EAAQ,IAAmB,CAC1C,IAAK,GAAM,CAAE,QAAO,SAAS,EAAa,CACxC,IAAM,EAAS,EAAI,EAAE,GAAQ,EAAE,GAAQ,EAAI,CAC3C,GAAI,IAAW,EACb,OAAO,EAEX,MAAO,IAIP,CACK,EAET,OAAO"}
+{"version":3,"file":"orderby.cjs","names":[],"sources":["../../../src/common/data/orderby.ts"],"sourcesContent":["export function parseOrderby(value = ''): {\n  field: string\n  orderby: string\n  asc: boolean\n  desc: boolean\n} {\n  let [field = '', orderby = 'asc'] = value.split(' ')\n  orderby = orderby.toLowerCase()\n  return {\n    field,\n    orderby,\n    asc: orderby !== 'desc',\n    desc: orderby === 'desc',\n  }\n}\n\nexport function composeOrderby(field: string, asc = true): string {\n  return `${field} ${asc ? 'asc' : 'desc'}`\n}\n\n// Classic compare function with direction flag\nexport function cmp(a: any, b: any, asc = true): -1 | 0 | 1 {\n  const aa = a || 0\n  const bb = b || 0\n  return aa > bb ? (asc ? 1 : -1) : aa < bb ? (asc ? -1 : 1) : 0 // use Math.sign(?) for performance?\n}\n\n// todo: support localeCompare()\nexport function sortedOrderby<T>(values: T[], ...orderby: string[]): T[] {\n  if (orderby.length > 0) {\n    const orderByList = orderby.map(parseOrderby)\n    // let { field, asc } = parseOrderby(orderby)\n    // if (field != null && typeof field === \"string\") {\n    // let bigger = asc ? 1 : -1\n    // let smaller = asc ? -1 : 1\n    const sortValues = Array.from(values)\n    sortValues.sort((a: any, b: any): number => {\n      for (const { field, asc } of orderByList) {\n        const result = cmp(a[field], b[field], asc)\n        if (result !== 0)\n          return result\n      }\n      return 0\n      // const aa = a[field] || 0\n      // const bb = b[field] || 0\n      // return aa > bb ? bigger : aa < bb ? smaller : 0\n    })\n    return sortValues\n  }\n  return values\n}\n"],"mappings":";;;AAAA,SAAgB,aAAa,QAAQ,IAKnC;CACA,IAAI,CAAC,QAAQ,IAAI,UAAU,SAAS,MAAM,MAAM,IAAI;AACpD,WAAU,QAAQ,aAAa;AAC/B,QAAO;EACL;EACA;EACA,KAAK,YAAY;EACjB,MAAM,YAAY;EACnB;;AAGH,SAAgB,eAAe,OAAe,MAAM,MAAc;AAChE,QAAO,GAAG,MAAM,GAAG,MAAM,QAAQ;;AAInC,SAAgB,IAAI,GAAQ,GAAQ,MAAM,MAAkB;CAC1D,MAAM,KAAK,KAAK;CAChB,MAAM,KAAK,KAAK;AAChB,QAAO,KAAK,KAAM,MAAM,IAAI,KAAM,KAAK,KAAM,MAAM,KAAK,IAAK;;AAI/D,SAAgB,cAAiB,QAAa,GAAG,SAAwB;AACvE,KAAI,QAAQ,SAAS,GAAG;EACtB,MAAM,cAAc,QAAQ,IAAI,aAAa;EAK7C,MAAM,aAAa,MAAM,KAAK,OAAO;AACrC,aAAW,MAAM,GAAQ,MAAmB;AAC1C,QAAK,MAAM,EAAE,OAAO,SAAS,aAAa;IACxC,MAAM,SAAS,IAAI,EAAE,QAAQ,EAAE,QAAQ,IAAI;AAC3C,QAAI,WAAW,EACb,QAAO;;AAEX,UAAO;IAIP;AACF,SAAO;;AAET,QAAO"}

package/dist/common/data/orderby.mjs

@@ -1,2 +1,38 @@
-function e(e=``){let[t=``,n=`asc`]=e.split(` `);return n=n.toLowerCase(),{field:t,orderby:n,asc:n!==`desc`,desc:n===`desc`}}function t(e,t=!0){return`${e} ${t?`asc`:`desc`}`}function n(e,t,n=!0){let r=e||0,i=t||0;return r>i?n?1:-1:r<i?n?-1:1:0}function r(t,...r){if(r.length>0){let i=r.map(e),a=Array.from(t);return a.sort((e,t)=>{for(let{field:r,asc:a}of i){let i=n(e[r],t[r],a);if(i!==0)return i}return 0}),a}return t}export{n as cmp,t as composeOrderby,e as parseOrderby,r as sortedOrderby};
+//#region src/common/data/orderby.ts
+function parseOrderby(value = "") {
+	let [field = "", orderby = "asc"] = value.split(" ");
+	orderby = orderby.toLowerCase();
+	return {
+		field,
+		orderby,
+		asc: orderby !== "desc",
+		desc: orderby === "desc"
+	};
+}
+function composeOrderby(field, asc = true) {
+	return `${field} ${asc ? "asc" : "desc"}`;
+}
+function cmp(a, b, asc = true) {
+	const aa = a || 0;
+	const bb = b || 0;
+	return aa > bb ? asc ? 1 : -1 : aa < bb ? asc ? -1 : 1 : 0;
+}
+function sortedOrderby(values, ...orderby) {
+	if (orderby.length > 0) {
+		const orderByList = orderby.map(parseOrderby);
+		const sortValues = Array.from(values);
+		sortValues.sort((a, b) => {
+			for (const { field, asc } of orderByList) {
+				const result = cmp(a[field], b[field], asc);
+				if (result !== 0) return result;
+			}
+			return 0;
+		});
+		return sortValues;
+	}
+	return values;
+}
+
+//#endregion
+export { cmp, composeOrderby, parseOrderby, sortedOrderby };
 //# sourceMappingURL=orderby.mjs.map

package/dist/common/data/orderby.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"orderby.mjs","names":[],"sources":["../../../src/common/data/orderby.ts"],"sourcesContent":["export function parseOrderby(value = ''): {\n  field: string\n  orderby: string\n  asc: boolean\n  desc: boolean\n} {\n  let [field = '', orderby = 'asc'] = value.split(' ')\n  orderby = orderby.toLowerCase()\n  return {\n    field,\n    orderby,\n    asc: orderby !== 'desc',\n    desc: orderby === 'desc',\n  }\n}\n\nexport function composeOrderby(field: string, asc = true): string {\n  return `${field} ${asc ? 'asc' : 'desc'}`\n}\n\n// Classic compare function with direction flag\nexport function cmp(a: any, b: any, asc = true): -1 | 0 | 1 {\n  const aa = a || 0\n  const bb = b || 0\n  return aa > bb ? (asc ? 1 : -1) : aa < bb ? (asc ? -1 : 1) : 0 // use Math.sign(?) for performance?\n}\n\n// todo: support localeCompare()\nexport function sortedOrderby<T>(values: T[], ...orderby: string[]): T[] {\n  if (orderby.length > 0) {\n    const orderByList = orderby.map(parseOrderby)\n    // let { field, asc } = parseOrderby(orderby)\n    // if (field != null && typeof field === \"string\") {\n    // let bigger = asc ? 1 : -1\n    // let smaller = asc ? -1 : 1\n    const sortValues = Array.from(values)\n    sortValues.sort((a: any, b: any): number => {\n      for (const { field, asc } of orderByList) {\n        const result = cmp(a[field], b[field], asc)\n        if (result !== 0)\n          return result\n      }\n      return 0\n      // const aa = a[field] || 0\n      // const bb = b[field] || 0\n      // return aa > bb ? bigger : aa < bb ? smaller : 0\n    })\n    return sortValues\n  }\n  return values\n}\n"],"mappings":"AAAA,SAAgB,EAAa,EAAQ,GAKnC,CACA,GAAI,CAAC,EAAQ,GAAI,EAAU,OAAS,EAAM,MAAM,IAAI,CAEpD,MADA,GAAU,EAAQ,aAAa,CACxB,CACL,QACA,UACA,IAAK,IAAY,OACjB,KAAM,IAAY,OACnB,CAGH,SAAgB,EAAe,EAAe,EAAM,GAAc,CAChE,MAAO,GAAG,EAAM,GAAG,EAAM,MAAQ,SAInC,SAAgB,EAAI,EAAQ,EAAQ,EAAM,GAAkB,CAC1D,IAAM,EAAK,GAAK,EACV,EAAK,GAAK,EAChB,OAAO,EAAK,EAAM,EAAM,EAAI,GAAM,EAAK,EAAM,EAAM,GAAK,EAAK,EAI/D,SAAgB,EAAiB,EAAa,GAAG,EAAwB,CACvE,GAAI,EAAQ,OAAS,EAAG,CACtB,IAAM,EAAc,EAAQ,IAAI,EAAa,CAKvC,EAAa,MAAM,KAAK,EAAO,CAYrC,OAXA,EAAW,MAAM,EAAQ,IAAmB,CAC1C,IAAK,GAAM,CAAE,QAAO,SAAS,EAAa,CACxC,IAAM,EAAS,EAAI,EAAE,GAAQ,EAAE,GAAQ,EAAI,CAC3C,GAAI,IAAW,EACb,OAAO,EAEX,MAAO,IAIP,CACK,EAET,OAAO"}
+{"version":3,"file":"orderby.mjs","names":[],"sources":["../../../src/common/data/orderby.ts"],"sourcesContent":["export function parseOrderby(value = ''): {\n  field: string\n  orderby: string\n  asc: boolean\n  desc: boolean\n} {\n  let [field = '', orderby = 'asc'] = value.split(' ')\n  orderby = orderby.toLowerCase()\n  return {\n    field,\n    orderby,\n    asc: orderby !== 'desc',\n    desc: orderby === 'desc',\n  }\n}\n\nexport function composeOrderby(field: string, asc = true): string {\n  return `${field} ${asc ? 'asc' : 'desc'}`\n}\n\n// Classic compare function with direction flag\nexport function cmp(a: any, b: any, asc = true): -1 | 0 | 1 {\n  const aa = a || 0\n  const bb = b || 0\n  return aa > bb ? (asc ? 1 : -1) : aa < bb ? (asc ? -1 : 1) : 0 // use Math.sign(?) for performance?\n}\n\n// todo: support localeCompare()\nexport function sortedOrderby<T>(values: T[], ...orderby: string[]): T[] {\n  if (orderby.length > 0) {\n    const orderByList = orderby.map(parseOrderby)\n    // let { field, asc } = parseOrderby(orderby)\n    // if (field != null && typeof field === \"string\") {\n    // let bigger = asc ? 1 : -1\n    // let smaller = asc ? -1 : 1\n    const sortValues = Array.from(values)\n    sortValues.sort((a: any, b: any): number => {\n      for (const { field, asc } of orderByList) {\n        const result = cmp(a[field], b[field], asc)\n        if (result !== 0)\n          return result\n      }\n      return 0\n      // const aa = a[field] || 0\n      // const bb = b[field] || 0\n      // return aa > bb ? bigger : aa < bb ? smaller : 0\n    })\n    return sortValues\n  }\n  return values\n}\n"],"mappings":";AAAA,SAAgB,aAAa,QAAQ,IAKnC;CACA,IAAI,CAAC,QAAQ,IAAI,UAAU,SAAS,MAAM,MAAM,IAAI;AACpD,WAAU,QAAQ,aAAa;AAC/B,QAAO;EACL;EACA;EACA,KAAK,YAAY;EACjB,MAAM,YAAY;EACnB;;AAGH,SAAgB,eAAe,OAAe,MAAM,MAAc;AAChE,QAAO,GAAG,MAAM,GAAG,MAAM,QAAQ;;AAInC,SAAgB,IAAI,GAAQ,GAAQ,MAAM,MAAkB;CAC1D,MAAM,KAAK,KAAK;CAChB,MAAM,KAAK,KAAK;AAChB,QAAO,KAAK,KAAM,MAAM,IAAI,KAAM,KAAK,KAAM,MAAM,KAAK,IAAK;;AAI/D,SAAgB,cAAiB,QAAa,GAAG,SAAwB;AACvE,KAAI,QAAQ,SAAS,GAAG;EACtB,MAAM,cAAc,QAAQ,IAAI,aAAa;EAK7C,MAAM,aAAa,MAAM,KAAK,OAAO;AACrC,aAAW,MAAM,GAAQ,MAAmB;AAC1C,QAAK,MAAM,EAAE,OAAO,SAAS,aAAa;IACxC,MAAM,SAAS,IAAI,EAAE,QAAQ,EAAE,QAAQ,IAAI;AAC3C,QAAI,WAAW,EACb,QAAO;;AAEX,UAAO;IAIP;AACF,SAAO;;AAET,QAAO"}

package/dist/common/data/path.cjs

@@ -1,2 +1,27 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`./regexp.cjs`),t=/^\.+/,n=/\.+$/,r=/[<>:"/\\|?*\u0000-\u001F\u0080-\u009F]+/g;function i(){return r}function a(){return/^(con|prn|aux|nul|com\d|lpt\d)$/i}function o(r,o=`_`){if(typeof r!=`string`)throw TypeError(`Expected a string`);if(i().test(o))throw Error(`Replacement string cannot contain reserved filename characters`);let s=`(${e.escapeRegExp(o)})+`;return r=r.replace(i(),o).replace(t,o).replace(n,``).replace(new RegExp(s,`gm`),o).trim(),r=a().test(r)?r+o:r,r.slice(0,100)}exports.toValidFilename=o;
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+const require_common_data_regexp = require('./regexp.cjs');
+
+//#region src/common/data/path.ts
+const MAX_FILENAME_LENGTH = 100;
+const reRelativePath = /^\.+/;
+const reTrailingPeriods = /\.+$/;
+const reFilenameIllegal = /[<>:"/\\|?*\u0000-\u001F\u0080-\u009F]+/g;
+function filenameReservedRegex() {
+	return reFilenameIllegal;
+}
+function windowsReservedNameRegex() {
+	return /^(con|prn|aux|nul|com\d|lpt\d)$/i;
+}
+/** Ensure a valid file name. Unsupported characters get a `replacement`, default: `_` */
+function toValidFilename(string, replacement = "_") {
+	if (typeof string !== "string") throw new TypeError("Expected a string");
+	if (filenameReservedRegex().test(replacement)) throw new Error("Replacement string cannot contain reserved filename characters");
+	const reReplacement = `(${require_common_data_regexp.escapeRegExp(replacement)})+`;
+	string = string.replace(filenameReservedRegex(), replacement).replace(reRelativePath, replacement).replace(reTrailingPeriods, "").replace(new RegExp(reReplacement, "gm"), replacement).trim();
+	string = windowsReservedNameRegex().test(string) ? string + replacement : string;
+	return string.slice(0, MAX_FILENAME_LENGTH);
+}
+
+//#endregion
+exports.toValidFilename = toValidFilename;
 //# sourceMappingURL=path.cjs.map

package/dist/common/data/path.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"path.cjs","names":["escapeRegExp"],"sources":["../../../src/common/data/path.ts"],"sourcesContent":["// https://github.com/sindresorhus/filenamify/blob/main/filenamify.js\n/* eslint-disable no-control-regex */\n\nimport { escapeRegExp } from './regexp'\n\nconst MAX_FILENAME_LENGTH = 100\n\n// const reControlChars = /[\\u0000-\\u001F\\u0080-\\u009F]/g\nconst reRelativePath = /^\\.+/\nconst reTrailingPeriods = /\\.+$/\nconst reFilenameIllegal = /[<>:\"/\\\\|?*\\u0000-\\u001F\\u0080-\\u009F]+/g // https://superuser.com/questions/358855/what-characters-are-safe-in-cross-platform-file-names-for-linux-windows-and-os/358861#358861\n\nfunction filenameReservedRegex() {\n  return reFilenameIllegal // /[<>:\"/\\\\|?*\\u0000-\\u001F]/g\n}\n\nfunction windowsReservedNameRegex() {\n  return /^(con|prn|aux|nul|com\\d|lpt\\d)$/i\n}\n\n/** Ensure a valid file name. Unsupported characters get a `replacement`, default: `_` */\nexport function toValidFilename(string: string, replacement = '_'): string | never {\n  if (typeof string !== 'string')\n    throw new TypeError('Expected a string')\n\n  if (filenameReservedRegex().test(replacement))\n    throw new Error('Replacement string cannot contain reserved filename characters')\n\n  const reReplacement = `(${escapeRegExp(replacement)})+`\n\n  string = string\n    .replace(filenameReservedRegex(), replacement)\n    .replace(reRelativePath, replacement)\n    .replace(reTrailingPeriods, '')\n    .replace(new RegExp(reReplacement, 'gm'), replacement) // collapse\n    .trim()\n\n  string = windowsReservedNameRegex().test(string) ? string + replacement : string\n\n  return string.slice(0, MAX_FILENAME_LENGTH)\n}\n"],"mappings":"mGAQM,EAAiB,OACjB,EAAoB,OACpB,EAAoB,2CAE1B,SAAS,GAAwB,CAC/B,OAAO,EAGT,SAAS,GAA2B,CAClC,MAAO,mCAIT,SAAgB,EAAgB,EAAgB,EAAc,IAAqB,CACjF,GAAI,OAAO,GAAW,SACpB,MAAU,UAAU,oBAAoB,CAE1C,GAAI,GAAuB,CAAC,KAAK,EAAY,CAC3C,MAAU,MAAM,iEAAiE,CAEnF,IAAM,EAAgB,IAAIA,EAAAA,aAAa,EAAY,CAAC,IAWpD,MATA,GAAS,EACN,QAAQ,GAAuB,CAAE,EAAY,CAC7C,QAAQ,EAAgB,EAAY,CACpC,QAAQ,EAAmB,GAAG,CAC9B,QAAQ,IAAI,OAAO,EAAe,KAAK,CAAE,EAAY,CACrD,MAAM,CAET,EAAS,GAA0B,CAAC,KAAK,EAAO,CAAG,EAAS,EAAc,EAEnE,EAAO,MAAM,EAAG,IAAoB"}
+{"version":3,"file":"path.cjs","names":["escapeRegExp"],"sources":["../../../src/common/data/path.ts"],"sourcesContent":["// https://github.com/sindresorhus/filenamify/blob/main/filenamify.js\n/* eslint-disable no-control-regex */\n\nimport { escapeRegExp } from './regexp'\n\nconst MAX_FILENAME_LENGTH = 100\n\n// const reControlChars = /[\\u0000-\\u001F\\u0080-\\u009F]/g\nconst reRelativePath = /^\\.+/\nconst reTrailingPeriods = /\\.+$/\nconst reFilenameIllegal = /[<>:\"/\\\\|?*\\u0000-\\u001F\\u0080-\\u009F]+/g // https://superuser.com/questions/358855/what-characters-are-safe-in-cross-platform-file-names-for-linux-windows-and-os/358861#358861\n\nfunction filenameReservedRegex() {\n  return reFilenameIllegal // /[<>:\"/\\\\|?*\\u0000-\\u001F]/g\n}\n\nfunction windowsReservedNameRegex() {\n  return /^(con|prn|aux|nul|com\\d|lpt\\d)$/i\n}\n\n/** Ensure a valid file name. Unsupported characters get a `replacement`, default: `_` */\nexport function toValidFilename(string: string, replacement = '_'): string | never {\n  if (typeof string !== 'string')\n    throw new TypeError('Expected a string')\n\n  if (filenameReservedRegex().test(replacement))\n    throw new Error('Replacement string cannot contain reserved filename characters')\n\n  const reReplacement = `(${escapeRegExp(replacement)})+`\n\n  string = string\n    .replace(filenameReservedRegex(), replacement)\n    .replace(reRelativePath, replacement)\n    .replace(reTrailingPeriods, '')\n    .replace(new RegExp(reReplacement, 'gm'), replacement) // collapse\n    .trim()\n\n  string = windowsReservedNameRegex().test(string) ? string + replacement : string\n\n  return string.slice(0, MAX_FILENAME_LENGTH)\n}\n"],"mappings":";;;;AAKA,MAAM,sBAAsB;AAG5B,MAAM,iBAAiB;AACvB,MAAM,oBAAoB;AAC1B,MAAM,oBAAoB;AAE1B,SAAS,wBAAwB;AAC/B,QAAO;;AAGT,SAAS,2BAA2B;AAClC,QAAO;;;AAIT,SAAgB,gBAAgB,QAAgB,cAAc,KAAqB;AACjF,KAAI,OAAO,WAAW,SACpB,OAAM,IAAI,UAAU,oBAAoB;AAE1C,KAAI,uBAAuB,CAAC,KAAK,YAAY,CAC3C,OAAM,IAAI,MAAM,iEAAiE;CAEnF,MAAM,gBAAgB,IAAIA,wCAAa,YAAY,CAAC;AAEpD,UAAS,OACN,QAAQ,uBAAuB,EAAE,YAAY,CAC7C,QAAQ,gBAAgB,YAAY,CACpC,QAAQ,mBAAmB,GAAG,CAC9B,QAAQ,IAAI,OAAO,eAAe,KAAK,EAAE,YAAY,CACrD,MAAM;AAET,UAAS,0BAA0B,CAAC,KAAK,OAAO,GAAG,SAAS,cAAc;AAE1E,QAAO,OAAO,MAAM,GAAG,oBAAoB"}

package/dist/common/data/path.mjs

@@ -1,2 +1,26 @@
-import{escapeRegExp as e}from"./regexp.mjs";const t=/^\.+/,n=/\.+$/,r=/[<>:"/\\|?*\u0000-\u001F\u0080-\u009F]+/g;function i(){return r}function a(){return/^(con|prn|aux|nul|com\d|lpt\d)$/i}function o(r,o=`_`){if(typeof r!=`string`)throw TypeError(`Expected a string`);if(i().test(o))throw Error(`Replacement string cannot contain reserved filename characters`);let s=`(${e(o)})+`;return r=r.replace(i(),o).replace(t,o).replace(n,``).replace(new RegExp(s,`gm`),o).trim(),r=a().test(r)?r+o:r,r.slice(0,100)}export{o as toValidFilename};
+import { escapeRegExp } from "./regexp.mjs";
+
+//#region src/common/data/path.ts
+const MAX_FILENAME_LENGTH = 100;
+const reRelativePath = /^\.+/;
+const reTrailingPeriods = /\.+$/;
+const reFilenameIllegal = /[<>:"/\\|?*\u0000-\u001F\u0080-\u009F]+/g;
+function filenameReservedRegex() {
+	return reFilenameIllegal;
+}
+function windowsReservedNameRegex() {
+	return /^(con|prn|aux|nul|com\d|lpt\d)$/i;
+}
+/** Ensure a valid file name. Unsupported characters get a `replacement`, default: `_` */
+function toValidFilename(string, replacement = "_") {
+	if (typeof string !== "string") throw new TypeError("Expected a string");
+	if (filenameReservedRegex().test(replacement)) throw new Error("Replacement string cannot contain reserved filename characters");
+	const reReplacement = `(${escapeRegExp(replacement)})+`;
+	string = string.replace(filenameReservedRegex(), replacement).replace(reRelativePath, replacement).replace(reTrailingPeriods, "").replace(new RegExp(reReplacement, "gm"), replacement).trim();
+	string = windowsReservedNameRegex().test(string) ? string + replacement : string;
+	return string.slice(0, MAX_FILENAME_LENGTH);
+}
+
+//#endregion
+export { toValidFilename };
 //# sourceMappingURL=path.mjs.map

package/dist/common/data/path.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"path.mjs","names":[],"sources":["../../../src/common/data/path.ts"],"sourcesContent":["// https://github.com/sindresorhus/filenamify/blob/main/filenamify.js\n/* eslint-disable no-control-regex */\n\nimport { escapeRegExp } from './regexp'\n\nconst MAX_FILENAME_LENGTH = 100\n\n// const reControlChars = /[\\u0000-\\u001F\\u0080-\\u009F]/g\nconst reRelativePath = /^\\.+/\nconst reTrailingPeriods = /\\.+$/\nconst reFilenameIllegal = /[<>:\"/\\\\|?*\\u0000-\\u001F\\u0080-\\u009F]+/g // https://superuser.com/questions/358855/what-characters-are-safe-in-cross-platform-file-names-for-linux-windows-and-os/358861#358861\n\nfunction filenameReservedRegex() {\n  return reFilenameIllegal // /[<>:\"/\\\\|?*\\u0000-\\u001F]/g\n}\n\nfunction windowsReservedNameRegex() {\n  return /^(con|prn|aux|nul|com\\d|lpt\\d)$/i\n}\n\n/** Ensure a valid file name. Unsupported characters get a `replacement`, default: `_` */\nexport function toValidFilename(string: string, replacement = '_'): string | never {\n  if (typeof string !== 'string')\n    throw new TypeError('Expected a string')\n\n  if (filenameReservedRegex().test(replacement))\n    throw new Error('Replacement string cannot contain reserved filename characters')\n\n  const reReplacement = `(${escapeRegExp(replacement)})+`\n\n  string = string\n    .replace(filenameReservedRegex(), replacement)\n    .replace(reRelativePath, replacement)\n    .replace(reTrailingPeriods, '')\n    .replace(new RegExp(reReplacement, 'gm'), replacement) // collapse\n    .trim()\n\n  string = windowsReservedNameRegex().test(string) ? string + replacement : string\n\n  return string.slice(0, MAX_FILENAME_LENGTH)\n}\n"],"mappings":"4CAKA,MAGM,EAAiB,OACjB,EAAoB,OACpB,EAAoB,2CAE1B,SAAS,GAAwB,CAC/B,OAAO,EAGT,SAAS,GAA2B,CAClC,MAAO,mCAIT,SAAgB,EAAgB,EAAgB,EAAc,IAAqB,CACjF,GAAI,OAAO,GAAW,SACpB,MAAU,UAAU,oBAAoB,CAE1C,GAAI,GAAuB,CAAC,KAAK,EAAY,CAC3C,MAAU,MAAM,iEAAiE,CAEnF,IAAM,EAAgB,IAAI,EAAa,EAAY,CAAC,IAWpD,MATA,GAAS,EACN,QAAQ,GAAuB,CAAE,EAAY,CAC7C,QAAQ,EAAgB,EAAY,CACpC,QAAQ,EAAmB,GAAG,CAC9B,QAAQ,IAAI,OAAO,EAAe,KAAK,CAAE,EAAY,CACrD,MAAM,CAET,EAAS,GAA0B,CAAC,KAAK,EAAO,CAAG,EAAS,EAAc,EAEnE,EAAO,MAAM,EAAG,IAAoB"}
+{"version":3,"file":"path.mjs","names":[],"sources":["../../../src/common/data/path.ts"],"sourcesContent":["// https://github.com/sindresorhus/filenamify/blob/main/filenamify.js\n/* eslint-disable no-control-regex */\n\nimport { escapeRegExp } from './regexp'\n\nconst MAX_FILENAME_LENGTH = 100\n\n// const reControlChars = /[\\u0000-\\u001F\\u0080-\\u009F]/g\nconst reRelativePath = /^\\.+/\nconst reTrailingPeriods = /\\.+$/\nconst reFilenameIllegal = /[<>:\"/\\\\|?*\\u0000-\\u001F\\u0080-\\u009F]+/g // https://superuser.com/questions/358855/what-characters-are-safe-in-cross-platform-file-names-for-linux-windows-and-os/358861#358861\n\nfunction filenameReservedRegex() {\n  return reFilenameIllegal // /[<>:\"/\\\\|?*\\u0000-\\u001F]/g\n}\n\nfunction windowsReservedNameRegex() {\n  return /^(con|prn|aux|nul|com\\d|lpt\\d)$/i\n}\n\n/** Ensure a valid file name. Unsupported characters get a `replacement`, default: `_` */\nexport function toValidFilename(string: string, replacement = '_'): string | never {\n  if (typeof string !== 'string')\n    throw new TypeError('Expected a string')\n\n  if (filenameReservedRegex().test(replacement))\n    throw new Error('Replacement string cannot contain reserved filename characters')\n\n  const reReplacement = `(${escapeRegExp(replacement)})+`\n\n  string = string\n    .replace(filenameReservedRegex(), replacement)\n    .replace(reRelativePath, replacement)\n    .replace(reTrailingPeriods, '')\n    .replace(new RegExp(reReplacement, 'gm'), replacement) // collapse\n    .trim()\n\n  string = windowsReservedNameRegex().test(string) ? string + replacement : string\n\n  return string.slice(0, MAX_FILENAME_LENGTH)\n}\n"],"mappings":";;;AAKA,MAAM,sBAAsB;AAG5B,MAAM,iBAAiB;AACvB,MAAM,oBAAoB;AAC1B,MAAM,oBAAoB;AAE1B,SAAS,wBAAwB;AAC/B,QAAO;;AAGT,SAAS,2BAA2B;AAClC,QAAO;;;AAIT,SAAgB,gBAAgB,QAAgB,cAAc,KAAqB;AACjF,KAAI,OAAO,WAAW,SACpB,OAAM,IAAI,UAAU,oBAAoB;AAE1C,KAAI,uBAAuB,CAAC,KAAK,YAAY,CAC3C,OAAM,IAAI,MAAM,iEAAiE;CAEnF,MAAM,gBAAgB,IAAI,aAAa,YAAY,CAAC;AAEpD,UAAS,OACN,QAAQ,uBAAuB,EAAE,YAAY,CAC7C,QAAQ,gBAAgB,YAAY,CACpC,QAAQ,mBAAmB,GAAG,CAC9B,QAAQ,IAAI,OAAO,eAAe,KAAK,EAAE,YAAY,CACrD,MAAM;AAET,UAAS,0BAA0B,CAAC,KAAK,OAAO,GAAG,SAAS,cAAc;AAE1E,QAAO,OAAO,MAAM,GAAG,oBAAoB"}

package/dist/common/data/regexp.cjs

@@ -1,2 +1,13 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=/[\\\-[\]/{}()*+?.^$|]/g;function t(t){return t?t instanceof RegExp?t.source:t.replace(e,`\\$&`):``}exports.escapeRegExp=t;
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+
+//#region src/common/data/regexp.ts
+const rxEscape = /[\\\-[\]/{}()*+?.^$|]/g;
+function escapeRegExp(value) {
+	if (!value) return "";
+	if (value instanceof RegExp) return value.source;
+	return value.replace(rxEscape, "\\$&");
+}
+
+//#endregion
+exports.escapeRegExp = escapeRegExp;
 //# sourceMappingURL=regexp.cjs.map

package/dist/common/data/regexp.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"regexp.cjs","names":[],"sources":["../../../src/common/data/regexp.ts"],"sourcesContent":["const rxEscape = /[\\\\\\-[\\]/{}()*+?.^$|]/g // Finds: \\ - [ ] / { } ( ) * + ? . ^ $ |\n\nexport function escapeRegExp(value: RegExp | string): string {\n  if (!value)\n    return ''\n  if (value instanceof RegExp)\n    return value.source\n  return value.replace(rxEscape, '\\\\$&')\n}\n"],"mappings":"mEAAA,MAAM,EAAW,yBAEjB,SAAgB,EAAa,EAAgC,CAK3D,OAJK,EAED,aAAiB,OACZ,EAAM,OACR,EAAM,QAAQ,EAAU,OAAO,CAH7B"}
+{"version":3,"file":"regexp.cjs","names":[],"sources":["../../../src/common/data/regexp.ts"],"sourcesContent":["const rxEscape = /[\\\\\\-[\\]/{}()*+?.^$|]/g // Finds: \\ - [ ] / { } ( ) * + ? . ^ $ |\n\nexport function escapeRegExp(value: RegExp | string): string {\n  if (!value)\n    return ''\n  if (value instanceof RegExp)\n    return value.source\n  return value.replace(rxEscape, '\\\\$&')\n}\n"],"mappings":";;;AAAA,MAAM,WAAW;AAEjB,SAAgB,aAAa,OAAgC;AAC3D,KAAI,CAAC,MACH,QAAO;AACT,KAAI,iBAAiB,OACnB,QAAO,MAAM;AACf,QAAO,MAAM,QAAQ,UAAU,OAAO"}

package/dist/common/data/regexp.mjs

@@ -1,2 +1,11 @@
-const e=/[\\\-[\]/{}()*+?.^$|]/g;function t(t){return t?t instanceof RegExp?t.source:t.replace(e,`\\$&`):``}export{t as escapeRegExp};
+//#region src/common/data/regexp.ts
+const rxEscape = /[\\\-[\]/{}()*+?.^$|]/g;
+function escapeRegExp(value) {
+	if (!value) return "";
+	if (value instanceof RegExp) return value.source;
+	return value.replace(rxEscape, "\\$&");
+}
+
+//#endregion
+export { escapeRegExp };
 //# sourceMappingURL=regexp.mjs.map

package/dist/common/data/regexp.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"regexp.mjs","names":[],"sources":["../../../src/common/data/regexp.ts"],"sourcesContent":["const rxEscape = /[\\\\\\-[\\]/{}()*+?.^$|]/g // Finds: \\ - [ ] / { } ( ) * + ? . ^ $ |\n\nexport function escapeRegExp(value: RegExp | string): string {\n  if (!value)\n    return ''\n  if (value instanceof RegExp)\n    return value.source\n  return value.replace(rxEscape, '\\\\$&')\n}\n"],"mappings":"AAAA,MAAM,EAAW,yBAEjB,SAAgB,EAAa,EAAgC,CAK3D,OAJK,EAED,aAAiB,OACZ,EAAM,OACR,EAAM,QAAQ,EAAU,OAAO,CAH7B"}
+{"version":3,"file":"regexp.mjs","names":[],"sources":["../../../src/common/data/regexp.ts"],"sourcesContent":["const rxEscape = /[\\\\\\-[\\]/{}()*+?.^$|]/g // Finds: \\ - [ ] / { } ( ) * + ? . ^ $ |\n\nexport function escapeRegExp(value: RegExp | string): string {\n  if (!value)\n    return ''\n  if (value instanceof RegExp)\n    return value.source\n  return value.replace(rxEscape, '\\\\$&')\n}\n"],"mappings":";AAAA,MAAM,WAAW;AAEjB,SAAgB,aAAa,OAAgC;AAC3D,KAAI,CAAC,MACH,QAAO;AACT,KAAI,iBAAiB,OACnB,QAAO,MAAM;AACf,QAAO,MAAM,QAAQ,UAAU,OAAO"}

package/dist/common/data/rounding.cjs

@@ -1,2 +1,108 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`./math.cjs`);function t(e){return Math.abs(e)%1==.5}function n(e){return e%2==0}const r=e=>Math.ceil(e),i=e=>Math.floor(e),a=e=>Math.round(e),o=e=>{let r=Math.round(e);return t(e)&&n(r)?r-1:r},s=e=>t(e)?Math.sign(e)*Math.ceil(Math.abs(e)):Math.round(e),c=e=>t(e)?Math.floor(e):Math.round(e),l=e=>{let r=Math.round(e);return t(e)?n(r)?r:r-1:r},u=e=>t(e)?Math.sign(e)*Math.floor(Math.abs(e)):Math.round(e);function d(t,n=100,r=0){let i=[...t],a=t.length,o=[];o.fill(0,a);let s=e.sum(i);if(s!==0){let e=10**r,t=n*e,c=0;for(let t=a-1;t>=0;t--)i[t]=n*i[t]/s,c+=o[t]=Math.round(i[t]*e);if(c!==t){let n=c-t,r=Math.abs(n),s=i.map((t,n)=>Math.abs(o[n]-i[n]*e));for(;r>0;){let e=0,n=s[0];for(let r=1;r<a;r++)if(n<s[r]){if(c>t&&o[r]-1<0)continue;e=r,n=s[r]}c>t?--o[e]:o[e]+=1,--s[e],r--}}if(e>1)return o.map(t=>+(t/e).toFixed(r))}return o}function f(e,t,n=100,r=0){return d(e.map(e=>e[t]),n,r).map((n,r)=>({...e[r],[t]:n}))}exports.isEven=n,exports.isHalf=t,exports.roundArrayOfNumbersToMatchSum=d,exports.roundArrayOfObjectsToMatchSum=f,exports.roundDown=i,exports.roundHalfAwayFromZero=s,exports.roundHalfDown=c,exports.roundHalfEven=l,exports.roundHalfOdd=o,exports.roundHalfTowardsZero=u,exports.roundHalfUp=a,exports.roundUp=r;
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+const require_common_data_math = require('./math.cjs');
+
+//#region src/common/data/rounding.ts
+function isHalf(value) {
+	return Math.abs(value) % 1 === .5;
+}
+function isEven(value) {
+	return value % 2 === 0;
+}
+const roundUp = (value) => Math.ceil(value);
+const roundDown = (value) => Math.floor(value);
+const roundHalfUp = (value) => Math.round(value);
+/**
+* Round a number with half values to nearest odd integer.
+*/
+const roundHalfOdd = (value) => {
+	const rounded = Math.round(value);
+	if (!isHalf(value)) return rounded;
+	return isEven(rounded) ? rounded - 1 : rounded;
+};
+/**
+* Round a number with half values to nearest integer farthest from zero.
+*/
+const roundHalfAwayFromZero = (value) => {
+	return isHalf(value) ? Math.sign(value) * Math.ceil(Math.abs(value)) : Math.round(value);
+};
+/**
+* Round a number with half values down.
+*/
+const roundHalfDown = (value) => isHalf(value) ? Math.floor(value) : Math.round(value);
+/**
+* Round a number with half values to nearest even integer.
+* https://wiki.c2.com/?BankersRounding
+*/
+const roundHalfEven = (value) => {
+	const rounded = Math.round(value);
+	if (!isHalf(value)) return rounded;
+	return isEven(rounded) ? rounded : rounded - 1;
+};
+/**
+* Round a number with half values to nearest integer closest to zero.
+*/
+const roundHalfTowardsZero = (value) => isHalf(value) ? Math.sign(value) * Math.floor(Math.abs(value)) : Math.round(value);
+/**
+* This is useful for percentages that should sum up to 100.
+* But can also be fine tuned.
+*
+* Original from https://github.com/super-ienien/percent-round
+*/
+function roundArrayOfNumbersToMatchSum(ipt, max = 100, decimalPlaces = 0) {
+	const iptPercents = [...ipt];
+	const length = ipt.length;
+	const out = [];
+	out.fill(0, length);
+	const total = require_common_data_math.sum(iptPercents);
+	if (total !== 0) {
+		const powDecimalPlaces = 10 ** decimalPlaces;
+		const pow100 = max * powDecimalPlaces;
+		let check100 = 0;
+		for (let i = length - 1; i >= 0; i--) {
+			iptPercents[i] = max * iptPercents[i] / total;
+			check100 += out[i] = Math.round(iptPercents[i] * powDecimalPlaces);
+		}
+		if (check100 !== pow100) {
+			const totalDiff = check100 - pow100;
+			const roundGrain = 1;
+			let grainCount = Math.abs(totalDiff);
+			const diffs = iptPercents.map((_, i) => Math.abs(out[i] - iptPercents[i] * powDecimalPlaces));
+			while (grainCount > 0) {
+				let idx = 0;
+				let maxDiff = diffs[0];
+				for (let i = 1; i < length; i++) if (maxDiff < diffs[i]) {
+					if (check100 > pow100 && out[i] - roundGrain < 0) continue;
+					idx = i;
+					maxDiff = diffs[i];
+				}
+				if (check100 > pow100) out[idx] -= roundGrain;
+				else out[idx] += roundGrain;
+				diffs[idx] -= roundGrain;
+				grainCount--;
+			}
+		}
+		if (powDecimalPlaces > 1) return out.map((n) => +(n / powDecimalPlaces).toFixed(decimalPlaces));
+	}
+	return out;
+}
+function roundArrayOfObjectsToMatchSum(arr, name, max = 100, decimalPlaces = 0) {
+	return roundArrayOfNumbersToMatchSum(arr.map((o) => o[name]), max, decimalPlaces).map((o, i) => ({
+		...arr[i],
+		[name]: o
+	}));
+}
+
+//#endregion
+exports.isEven = isEven;
+exports.isHalf = isHalf;
+exports.roundArrayOfNumbersToMatchSum = roundArrayOfNumbersToMatchSum;
+exports.roundArrayOfObjectsToMatchSum = roundArrayOfObjectsToMatchSum;
+exports.roundDown = roundDown;
+exports.roundHalfAwayFromZero = roundHalfAwayFromZero;
+exports.roundHalfDown = roundHalfDown;
+exports.roundHalfEven = roundHalfEven;
+exports.roundHalfOdd = roundHalfOdd;
+exports.roundHalfTowardsZero = roundHalfTowardsZero;
+exports.roundHalfUp = roundHalfUp;
+exports.roundUp = roundUp;
 //# sourceMappingURL=rounding.cjs.map

package/dist/common/data/rounding.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"rounding.cjs","names":["sum"],"sources":["../../../src/common/data/rounding.ts"],"sourcesContent":["// From https://v2.dinerojs.com/docs/api/formatting/to-unit MIT\n\nimport { sum } from './math'\n\nexport type RoundingMode = (value: number) => number\n\nexport function isHalf(value: number): boolean {\n  return Math.abs(value) % 1 === 0.5\n}\nexport function isEven(value: number): boolean {\n  return value % 2 === 0\n}\n\nexport const roundUp: RoundingMode = value => Math.ceil(value)\nexport const roundDown: RoundingMode = value => Math.floor(value)\nexport const roundHalfUp: RoundingMode = value => Math.round(value)\n\n/**\n * Round a number with half values to nearest odd integer.\n */\nexport const roundHalfOdd: RoundingMode = (value) => {\n  const rounded = Math.round(value)\n  if (!isHalf(value))\n    return rounded\n\n  return isEven(rounded) ? rounded - 1 : rounded\n}\n\n/**\n * Round a number with half values to nearest integer farthest from zero.\n */\nexport const roundHalfAwayFromZero: RoundingMode = (value) => {\n  return isHalf(value)\n    ? Math.sign(value) * Math.ceil(Math.abs(value))\n    : Math.round(value)\n}\n\n/**\n * Round a number with half values down.\n */\nexport const roundHalfDown: RoundingMode = value =>\n  isHalf(value) ? Math.floor(value) : Math.round(value)\n\n/**\n * Round a number with half values to nearest even integer.\n * https://wiki.c2.com/?BankersRounding\n */\nexport const roundHalfEven: RoundingMode = (value) => {\n  const rounded = Math.round(value)\n  if (!isHalf(value))\n    return rounded\n\n  return isEven(rounded) ? rounded : rounded - 1\n}\n\n/**\n * Round a number with half values to nearest integer closest to zero.\n */\nexport const roundHalfTowardsZero: RoundingMode = value =>\n  isHalf(value)\n    ? Math.sign(value) * Math.floor(Math.abs(value))\n    : Math.round(value)\n\n/**\n * This is useful for percentages that should sum up to 100.\n * But can also be fine tuned.\n *\n * Original from https://github.com/super-ienien/percent-round\n */\nexport function roundArrayOfNumbersToMatchSum(ipt: number[], max = 100, decimalPlaces = 0) {\n  const iptPercents: number[] = [...ipt]\n  const length = ipt.length\n  const out: number[] = []\n  out.fill(0, length)\n\n  const total = sum(iptPercents)\n\n  if (total !== 0) {\n    const powDecimalPlaces = 10 ** decimalPlaces\n    const pow100 = max * powDecimalPlaces\n    let check100 = 0\n    for (let i = length - 1; i >= 0; i--) {\n      iptPercents[i] = max * iptPercents[i] / total\n      check100 += out[i] = Math.round(iptPercents[i] * powDecimalPlaces)\n    }\n\n    if (check100 !== pow100) {\n      const totalDiff = (check100 - pow100)\n      const roundGrain = 1\n      let grainCount = Math.abs(totalDiff)\n      const diffs = iptPercents.map((_, i) => Math.abs(out[i] - iptPercents[i] * powDecimalPlaces))\n\n      while (grainCount > 0) {\n        let idx = 0\n        let maxDiff = diffs[0]\n        for (let i = 1; i < length; i++) {\n          if (maxDiff < diffs[i]) {\n            // avoid negative result\n            if (check100 > pow100 && out[i] - roundGrain < 0)\n              continue\n            idx = i\n            maxDiff = diffs[i]\n          }\n        }\n        if (check100 > pow100)\n          out[idx] -= roundGrain\n        else\n          out[idx] += roundGrain\n\n        diffs[idx] -= roundGrain\n        grainCount--\n      }\n    }\n\n    if (powDecimalPlaces > 1)\n      return out.map(n => +((n / powDecimalPlaces).toFixed(decimalPlaces)))\n  }\n\n  return out\n}\n\nexport function roundArrayOfObjectsToMatchSum<T extends Record<string, any>>(arr: T[], name: string, max = 100, decimalPlaces = 0): T[] {\n  return roundArrayOfNumbersToMatchSum(arr.map(o => o[name]), max, decimalPlaces)\n    .map((o, i) => ({\n      ...arr[i],\n      [name]: o,\n    }))\n}\n"],"mappings":"iGAMA,SAAgB,EAAO,EAAwB,CAC7C,OAAO,KAAK,IAAI,EAAM,CAAG,GAAM,GAEjC,SAAgB,EAAO,EAAwB,CAC7C,OAAO,EAAQ,GAAM,EAGvB,MAAa,EAAwB,GAAS,KAAK,KAAK,EAAM,CACjD,EAA0B,GAAS,KAAK,MAAM,EAAM,CACpD,EAA4B,GAAS,KAAK,MAAM,EAAM,CAKtD,EAA8B,GAAU,CACnD,IAAM,EAAU,KAAK,MAAM,EAAM,CAIjC,OAHK,EAAO,EAAM,EAGX,EAAO,EAAQ,CAAG,EAAU,EAAI,GAM5B,EAAuC,GAC3C,EAAO,EAAM,CAChB,KAAK,KAAK,EAAM,CAAG,KAAK,KAAK,KAAK,IAAI,EAAM,CAAC,CAC7C,KAAK,MAAM,EAAM,CAMV,EAA8B,GACzC,EAAO,EAAM,CAAG,KAAK,MAAM,EAAM,CAAG,KAAK,MAAM,EAAM,CAM1C,EAA+B,GAAU,CACpD,IAAM,EAAU,KAAK,MAAM,EAAM,CAIjC,OAHK,EAAO,EAAM,CAGX,EAAO,EAAQ,CAAG,EAAU,EAAU,EAFpC,GAQE,EAAqC,GAChD,EAAO,EAAM,CACT,KAAK,KAAK,EAAM,CAAG,KAAK,MAAM,KAAK,IAAI,EAAM,CAAC,CAC9C,KAAK,MAAM,EAAM,CAQvB,SAAgB,EAA8B,EAAe,EAAM,IAAK,EAAgB,EAAG,CACzF,IAAM,EAAwB,CAAC,GAAG,EAAI,CAChC,EAAS,EAAI,OACb,EAAgB,EAAE,CACxB,EAAI,KAAK,EAAG,EAAO,CAEnB,IAAM,EAAQA,EAAAA,IAAI,EAAY,CAE9B,GAAI,IAAU,EAAG,CACf,IAAM,EAAmB,IAAM,EACzB,EAAS,EAAM,EACjB,EAAW,EACf,IAAK,IAAI,EAAI,EAAS,EAAG,GAAK,EAAG,IAC/B,EAAY,GAAK,EAAM,EAAY,GAAK,EACxC,GAAY,EAAI,GAAK,KAAK,MAAM,EAAY,GAAK,EAAiB,CAGpE,GAAI,IAAa,EAAQ,CACvB,IAAM,EAAa,EAAW,EAE1B,EAAa,KAAK,IAAI,EAAU,CAC9B,EAAQ,EAAY,KAAK,EAAG,IAAM,KAAK,IAAI,EAAI,GAAK,EAAY,GAAK,EAAiB,CAAC,CAE7F,KAAO,EAAa,GAAG,CACrB,IAAI,EAAM,EACN,EAAU,EAAM,GACpB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,IAC1B,GAAI,EAAU,EAAM,GAAI,CAEtB,GAAI,EAAW,GAAU,EAAI,GAAK,EAAa,EAC7C,SACF,EAAM,EACN,EAAU,EAAM,GAGhB,EAAW,EACb,IAAI,GAEJ,EAAI,IAAQ,EAEd,IAAM,GACN,KAIJ,GAAI,EAAmB,EACrB,OAAO,EAAI,IAAI,GAAK,EAAG,EAAI,GAAkB,QAAQ,EAAc,CAAE,CAGzE,OAAO,EAGT,SAAgB,EAA6D,EAAU,EAAc,EAAM,IAAK,EAAgB,EAAQ,CACtI,OAAO,EAA8B,EAAI,IAAI,GAAK,EAAE,GAAM,CAAE,EAAK,EAAc,CAC5E,KAAK,EAAG,KAAO,CACd,GAAG,EAAI,IACN,GAAO,EACT,EAAE"}
+{"version":3,"file":"rounding.cjs","names":["sum"],"sources":["../../../src/common/data/rounding.ts"],"sourcesContent":["// From https://v2.dinerojs.com/docs/api/formatting/to-unit MIT\n\nimport { sum } from './math'\n\nexport type RoundingMode = (value: number) => number\n\nexport function isHalf(value: number): boolean {\n  return Math.abs(value) % 1 === 0.5\n}\nexport function isEven(value: number): boolean {\n  return value % 2 === 0\n}\n\nexport const roundUp: RoundingMode = value => Math.ceil(value)\nexport const roundDown: RoundingMode = value => Math.floor(value)\nexport const roundHalfUp: RoundingMode = value => Math.round(value)\n\n/**\n * Round a number with half values to nearest odd integer.\n */\nexport const roundHalfOdd: RoundingMode = (value) => {\n  const rounded = Math.round(value)\n  if (!isHalf(value))\n    return rounded\n\n  return isEven(rounded) ? rounded - 1 : rounded\n}\n\n/**\n * Round a number with half values to nearest integer farthest from zero.\n */\nexport const roundHalfAwayFromZero: RoundingMode = (value) => {\n  return isHalf(value)\n    ? Math.sign(value) * Math.ceil(Math.abs(value))\n    : Math.round(value)\n}\n\n/**\n * Round a number with half values down.\n */\nexport const roundHalfDown: RoundingMode = value =>\n  isHalf(value) ? Math.floor(value) : Math.round(value)\n\n/**\n * Round a number with half values to nearest even integer.\n * https://wiki.c2.com/?BankersRounding\n */\nexport const roundHalfEven: RoundingMode = (value) => {\n  const rounded = Math.round(value)\n  if (!isHalf(value))\n    return rounded\n\n  return isEven(rounded) ? rounded : rounded - 1\n}\n\n/**\n * Round a number with half values to nearest integer closest to zero.\n */\nexport const roundHalfTowardsZero: RoundingMode = value =>\n  isHalf(value)\n    ? Math.sign(value) * Math.floor(Math.abs(value))\n    : Math.round(value)\n\n/**\n * This is useful for percentages that should sum up to 100.\n * But can also be fine tuned.\n *\n * Original from https://github.com/super-ienien/percent-round\n */\nexport function roundArrayOfNumbersToMatchSum(ipt: number[], max = 100, decimalPlaces = 0) {\n  const iptPercents: number[] = [...ipt]\n  const length = ipt.length\n  const out: number[] = []\n  out.fill(0, length)\n\n  const total = sum(iptPercents)\n\n  if (total !== 0) {\n    const powDecimalPlaces = 10 ** decimalPlaces\n    const pow100 = max * powDecimalPlaces\n    let check100 = 0\n    for (let i = length - 1; i >= 0; i--) {\n      iptPercents[i] = max * iptPercents[i] / total\n      check100 += out[i] = Math.round(iptPercents[i] * powDecimalPlaces)\n    }\n\n    if (check100 !== pow100) {\n      const totalDiff = (check100 - pow100)\n      const roundGrain = 1\n      let grainCount = Math.abs(totalDiff)\n      const diffs = iptPercents.map((_, i) => Math.abs(out[i] - iptPercents[i] * powDecimalPlaces))\n\n      while (grainCount > 0) {\n        let idx = 0\n        let maxDiff = diffs[0]\n        for (let i = 1; i < length; i++) {\n          if (maxDiff < diffs[i]) {\n            // avoid negative result\n            if (check100 > pow100 && out[i] - roundGrain < 0)\n              continue\n            idx = i\n            maxDiff = diffs[i]\n          }\n        }\n        if (check100 > pow100)\n          out[idx] -= roundGrain\n        else\n          out[idx] += roundGrain\n\n        diffs[idx] -= roundGrain\n        grainCount--\n      }\n    }\n\n    if (powDecimalPlaces > 1)\n      return out.map(n => +((n / powDecimalPlaces).toFixed(decimalPlaces)))\n  }\n\n  return out\n}\n\nexport function roundArrayOfObjectsToMatchSum<T extends Record<string, any>>(arr: T[], name: string, max = 100, decimalPlaces = 0): T[] {\n  return roundArrayOfNumbersToMatchSum(arr.map(o => o[name]), max, decimalPlaces)\n    .map((o, i) => ({\n      ...arr[i],\n      [name]: o,\n    }))\n}\n"],"mappings":";;;;AAMA,SAAgB,OAAO,OAAwB;AAC7C,QAAO,KAAK,IAAI,MAAM,GAAG,MAAM;;AAEjC,SAAgB,OAAO,OAAwB;AAC7C,QAAO,QAAQ,MAAM;;AAGvB,MAAa,WAAwB,UAAS,KAAK,KAAK,MAAM;AAC9D,MAAa,aAA0B,UAAS,KAAK,MAAM,MAAM;AACjE,MAAa,eAA4B,UAAS,KAAK,MAAM,MAAM;;;;AAKnE,MAAa,gBAA8B,UAAU;CACnD,MAAM,UAAU,KAAK,MAAM,MAAM;AACjC,KAAI,CAAC,OAAO,MAAM,CAChB,QAAO;AAET,QAAO,OAAO,QAAQ,GAAG,UAAU,IAAI;;;;;AAMzC,MAAa,yBAAuC,UAAU;AAC5D,QAAO,OAAO,MAAM,GAChB,KAAK,KAAK,MAAM,GAAG,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC,GAC7C,KAAK,MAAM,MAAM;;;;;AAMvB,MAAa,iBAA8B,UACzC,OAAO,MAAM,GAAG,KAAK,MAAM,MAAM,GAAG,KAAK,MAAM,MAAM;;;;;AAMvD,MAAa,iBAA+B,UAAU;CACpD,MAAM,UAAU,KAAK,MAAM,MAAM;AACjC,KAAI,CAAC,OAAO,MAAM,CAChB,QAAO;AAET,QAAO,OAAO,QAAQ,GAAG,UAAU,UAAU;;;;;AAM/C,MAAa,wBAAqC,UAChD,OAAO,MAAM,GACT,KAAK,KAAK,MAAM,GAAG,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,GAC9C,KAAK,MAAM,MAAM;;;;;;;AAQvB,SAAgB,8BAA8B,KAAe,MAAM,KAAK,gBAAgB,GAAG;CACzF,MAAM,cAAwB,CAAC,GAAG,IAAI;CACtC,MAAM,SAAS,IAAI;CACnB,MAAM,MAAgB,EAAE;AACxB,KAAI,KAAK,GAAG,OAAO;CAEnB,MAAM,QAAQA,6BAAI,YAAY;AAE9B,KAAI,UAAU,GAAG;EACf,MAAM,mBAAmB,MAAM;EAC/B,MAAM,SAAS,MAAM;EACrB,IAAI,WAAW;AACf,OAAK,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACpC,eAAY,KAAK,MAAM,YAAY,KAAK;AACxC,eAAY,IAAI,KAAK,KAAK,MAAM,YAAY,KAAK,iBAAiB;;AAGpE,MAAI,aAAa,QAAQ;GACvB,MAAM,YAAa,WAAW;GAC9B,MAAM,aAAa;GACnB,IAAI,aAAa,KAAK,IAAI,UAAU;GACpC,MAAM,QAAQ,YAAY,KAAK,GAAG,MAAM,KAAK,IAAI,IAAI,KAAK,YAAY,KAAK,iBAAiB,CAAC;AAE7F,UAAO,aAAa,GAAG;IACrB,IAAI,MAAM;IACV,IAAI,UAAU,MAAM;AACpB,SAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAC1B,KAAI,UAAU,MAAM,IAAI;AAEtB,SAAI,WAAW,UAAU,IAAI,KAAK,aAAa,EAC7C;AACF,WAAM;AACN,eAAU,MAAM;;AAGpB,QAAI,WAAW,OACb,KAAI,QAAQ;QAEZ,KAAI,QAAQ;AAEd,UAAM,QAAQ;AACd;;;AAIJ,MAAI,mBAAmB,EACrB,QAAO,IAAI,KAAI,MAAK,EAAG,IAAI,kBAAkB,QAAQ,cAAc,CAAE;;AAGzE,QAAO;;AAGT,SAAgB,8BAA6D,KAAU,MAAc,MAAM,KAAK,gBAAgB,GAAQ;AACtI,QAAO,8BAA8B,IAAI,KAAI,MAAK,EAAE,MAAM,EAAE,KAAK,cAAc,CAC5E,KAAK,GAAG,OAAO;EACd,GAAG,IAAI;GACN,OAAO;EACT,EAAE"}

package/dist/common/data/rounding.mjs

@@ -1,2 +1,96 @@
-import{sum as e}from"./math.mjs";function t(e){return Math.abs(e)%1==.5}function n(e){return e%2==0}const r=e=>Math.ceil(e),i=e=>Math.floor(e),a=e=>Math.round(e),o=e=>{let r=Math.round(e);return t(e)&&n(r)?r-1:r},s=e=>t(e)?Math.sign(e)*Math.ceil(Math.abs(e)):Math.round(e),c=e=>t(e)?Math.floor(e):Math.round(e),l=e=>{let r=Math.round(e);return t(e)?n(r)?r:r-1:r},u=e=>t(e)?Math.sign(e)*Math.floor(Math.abs(e)):Math.round(e);function d(t,n=100,r=0){let i=[...t],a=t.length,o=[];o.fill(0,a);let s=e(i);if(s!==0){let e=10**r,t=n*e,c=0;for(let t=a-1;t>=0;t--)i[t]=n*i[t]/s,c+=o[t]=Math.round(i[t]*e);if(c!==t){let n=c-t,r=Math.abs(n),s=i.map((t,n)=>Math.abs(o[n]-i[n]*e));for(;r>0;){let e=0,n=s[0];for(let r=1;r<a;r++)if(n<s[r]){if(c>t&&o[r]-1<0)continue;e=r,n=s[r]}c>t?--o[e]:o[e]+=1,--s[e],r--}}if(e>1)return o.map(t=>+(t/e).toFixed(r))}return o}function f(e,t,n=100,r=0){return d(e.map(e=>e[t]),n,r).map((n,r)=>({...e[r],[t]:n}))}export{n as isEven,t as isHalf,d as roundArrayOfNumbersToMatchSum,f as roundArrayOfObjectsToMatchSum,i as roundDown,s as roundHalfAwayFromZero,c as roundHalfDown,l as roundHalfEven,o as roundHalfOdd,u as roundHalfTowardsZero,a as roundHalfUp,r as roundUp};
+import { sum } from "./math.mjs";
+
+//#region src/common/data/rounding.ts
+function isHalf(value) {
+	return Math.abs(value) % 1 === .5;
+}
+function isEven(value) {
+	return value % 2 === 0;
+}
+const roundUp = (value) => Math.ceil(value);
+const roundDown = (value) => Math.floor(value);
+const roundHalfUp = (value) => Math.round(value);
+/**
+* Round a number with half values to nearest odd integer.
+*/
+const roundHalfOdd = (value) => {
+	const rounded = Math.round(value);
+	if (!isHalf(value)) return rounded;
+	return isEven(rounded) ? rounded - 1 : rounded;
+};
+/**
+* Round a number with half values to nearest integer farthest from zero.
+*/
+const roundHalfAwayFromZero = (value) => {
+	return isHalf(value) ? Math.sign(value) * Math.ceil(Math.abs(value)) : Math.round(value);
+};
+/**
+* Round a number with half values down.
+*/
+const roundHalfDown = (value) => isHalf(value) ? Math.floor(value) : Math.round(value);
+/**
+* Round a number with half values to nearest even integer.
+* https://wiki.c2.com/?BankersRounding
+*/
+const roundHalfEven = (value) => {
+	const rounded = Math.round(value);
+	if (!isHalf(value)) return rounded;
+	return isEven(rounded) ? rounded : rounded - 1;
+};
+/**
+* Round a number with half values to nearest integer closest to zero.
+*/
+const roundHalfTowardsZero = (value) => isHalf(value) ? Math.sign(value) * Math.floor(Math.abs(value)) : Math.round(value);
+/**
+* This is useful for percentages that should sum up to 100.
+* But can also be fine tuned.
+*
+* Original from https://github.com/super-ienien/percent-round
+*/
+function roundArrayOfNumbersToMatchSum(ipt, max = 100, decimalPlaces = 0) {
+	const iptPercents = [...ipt];
+	const length = ipt.length;
+	const out = [];
+	out.fill(0, length);
+	const total = sum(iptPercents);
+	if (total !== 0) {
+		const powDecimalPlaces = 10 ** decimalPlaces;
+		const pow100 = max * powDecimalPlaces;
+		let check100 = 0;
+		for (let i = length - 1; i >= 0; i--) {
+			iptPercents[i] = max * iptPercents[i] / total;
+			check100 += out[i] = Math.round(iptPercents[i] * powDecimalPlaces);
+		}
+		if (check100 !== pow100) {
+			const totalDiff = check100 - pow100;
+			const roundGrain = 1;
+			let grainCount = Math.abs(totalDiff);
+			const diffs = iptPercents.map((_, i) => Math.abs(out[i] - iptPercents[i] * powDecimalPlaces));
+			while (grainCount > 0) {
+				let idx = 0;
+				let maxDiff = diffs[0];
+				for (let i = 1; i < length; i++) if (maxDiff < diffs[i]) {
+					if (check100 > pow100 && out[i] - roundGrain < 0) continue;
+					idx = i;
+					maxDiff = diffs[i];
+				}
+				if (check100 > pow100) out[idx] -= roundGrain;
+				else out[idx] += roundGrain;
+				diffs[idx] -= roundGrain;
+				grainCount--;
+			}
+		}
+		if (powDecimalPlaces > 1) return out.map((n) => +(n / powDecimalPlaces).toFixed(decimalPlaces));
+	}
+	return out;
+}
+function roundArrayOfObjectsToMatchSum(arr, name, max = 100, decimalPlaces = 0) {
+	return roundArrayOfNumbersToMatchSum(arr.map((o) => o[name]), max, decimalPlaces).map((o, i) => ({
+		...arr[i],
+		[name]: o
+	}));
+}
+
+//#endregion
+export { isEven, isHalf, roundArrayOfNumbersToMatchSum, roundArrayOfObjectsToMatchSum, roundDown, roundHalfAwayFromZero, roundHalfDown, roundHalfEven, roundHalfOdd, roundHalfTowardsZero, roundHalfUp, roundUp };
 //# sourceMappingURL=rounding.mjs.map

package/dist/common/data/rounding.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"rounding.mjs","names":[],"sources":["../../../src/common/data/rounding.ts"],"sourcesContent":["// From https://v2.dinerojs.com/docs/api/formatting/to-unit MIT\n\nimport { sum } from './math'\n\nexport type RoundingMode = (value: number) => number\n\nexport function isHalf(value: number): boolean {\n  return Math.abs(value) % 1 === 0.5\n}\nexport function isEven(value: number): boolean {\n  return value % 2 === 0\n}\n\nexport const roundUp: RoundingMode = value => Math.ceil(value)\nexport const roundDown: RoundingMode = value => Math.floor(value)\nexport const roundHalfUp: RoundingMode = value => Math.round(value)\n\n/**\n * Round a number with half values to nearest odd integer.\n */\nexport const roundHalfOdd: RoundingMode = (value) => {\n  const rounded = Math.round(value)\n  if (!isHalf(value))\n    return rounded\n\n  return isEven(rounded) ? rounded - 1 : rounded\n}\n\n/**\n * Round a number with half values to nearest integer farthest from zero.\n */\nexport const roundHalfAwayFromZero: RoundingMode = (value) => {\n  return isHalf(value)\n    ? Math.sign(value) * Math.ceil(Math.abs(value))\n    : Math.round(value)\n}\n\n/**\n * Round a number with half values down.\n */\nexport const roundHalfDown: RoundingMode = value =>\n  isHalf(value) ? Math.floor(value) : Math.round(value)\n\n/**\n * Round a number with half values to nearest even integer.\n * https://wiki.c2.com/?BankersRounding\n */\nexport const roundHalfEven: RoundingMode = (value) => {\n  const rounded = Math.round(value)\n  if (!isHalf(value))\n    return rounded\n\n  return isEven(rounded) ? rounded : rounded - 1\n}\n\n/**\n * Round a number with half values to nearest integer closest to zero.\n */\nexport const roundHalfTowardsZero: RoundingMode = value =>\n  isHalf(value)\n    ? Math.sign(value) * Math.floor(Math.abs(value))\n    : Math.round(value)\n\n/**\n * This is useful for percentages that should sum up to 100.\n * But can also be fine tuned.\n *\n * Original from https://github.com/super-ienien/percent-round\n */\nexport function roundArrayOfNumbersToMatchSum(ipt: number[], max = 100, decimalPlaces = 0) {\n  const iptPercents: number[] = [...ipt]\n  const length = ipt.length\n  const out: number[] = []\n  out.fill(0, length)\n\n  const total = sum(iptPercents)\n\n  if (total !== 0) {\n    const powDecimalPlaces = 10 ** decimalPlaces\n    const pow100 = max * powDecimalPlaces\n    let check100 = 0\n    for (let i = length - 1; i >= 0; i--) {\n      iptPercents[i] = max * iptPercents[i] / total\n      check100 += out[i] = Math.round(iptPercents[i] * powDecimalPlaces)\n    }\n\n    if (check100 !== pow100) {\n      const totalDiff = (check100 - pow100)\n      const roundGrain = 1\n      let grainCount = Math.abs(totalDiff)\n      const diffs = iptPercents.map((_, i) => Math.abs(out[i] - iptPercents[i] * powDecimalPlaces))\n\n      while (grainCount > 0) {\n        let idx = 0\n        let maxDiff = diffs[0]\n        for (let i = 1; i < length; i++) {\n          if (maxDiff < diffs[i]) {\n            // avoid negative result\n            if (check100 > pow100 && out[i] - roundGrain < 0)\n              continue\n            idx = i\n            maxDiff = diffs[i]\n          }\n        }\n        if (check100 > pow100)\n          out[idx] -= roundGrain\n        else\n          out[idx] += roundGrain\n\n        diffs[idx] -= roundGrain\n        grainCount--\n      }\n    }\n\n    if (powDecimalPlaces > 1)\n      return out.map(n => +((n / powDecimalPlaces).toFixed(decimalPlaces)))\n  }\n\n  return out\n}\n\nexport function roundArrayOfObjectsToMatchSum<T extends Record<string, any>>(arr: T[], name: string, max = 100, decimalPlaces = 0): T[] {\n  return roundArrayOfNumbersToMatchSum(arr.map(o => o[name]), max, decimalPlaces)\n    .map((o, i) => ({\n      ...arr[i],\n      [name]: o,\n    }))\n}\n"],"mappings":"iCAMA,SAAgB,EAAO,EAAwB,CAC7C,OAAO,KAAK,IAAI,EAAM,CAAG,GAAM,GAEjC,SAAgB,EAAO,EAAwB,CAC7C,OAAO,EAAQ,GAAM,EAGvB,MAAa,EAAwB,GAAS,KAAK,KAAK,EAAM,CACjD,EAA0B,GAAS,KAAK,MAAM,EAAM,CACpD,EAA4B,GAAS,KAAK,MAAM,EAAM,CAKtD,EAA8B,GAAU,CACnD,IAAM,EAAU,KAAK,MAAM,EAAM,CAIjC,OAHK,EAAO,EAAM,EAGX,EAAO,EAAQ,CAAG,EAAU,EAAI,GAM5B,EAAuC,GAC3C,EAAO,EAAM,CAChB,KAAK,KAAK,EAAM,CAAG,KAAK,KAAK,KAAK,IAAI,EAAM,CAAC,CAC7C,KAAK,MAAM,EAAM,CAMV,EAA8B,GACzC,EAAO,EAAM,CAAG,KAAK,MAAM,EAAM,CAAG,KAAK,MAAM,EAAM,CAM1C,EAA+B,GAAU,CACpD,IAAM,EAAU,KAAK,MAAM,EAAM,CAIjC,OAHK,EAAO,EAAM,CAGX,EAAO,EAAQ,CAAG,EAAU,EAAU,EAFpC,GAQE,EAAqC,GAChD,EAAO,EAAM,CACT,KAAK,KAAK,EAAM,CAAG,KAAK,MAAM,KAAK,IAAI,EAAM,CAAC,CAC9C,KAAK,MAAM,EAAM,CAQvB,SAAgB,EAA8B,EAAe,EAAM,IAAK,EAAgB,EAAG,CACzF,IAAM,EAAwB,CAAC,GAAG,EAAI,CAChC,EAAS,EAAI,OACb,EAAgB,EAAE,CACxB,EAAI,KAAK,EAAG,EAAO,CAEnB,IAAM,EAAQ,EAAI,EAAY,CAE9B,GAAI,IAAU,EAAG,CACf,IAAM,EAAmB,IAAM,EACzB,EAAS,EAAM,EACjB,EAAW,EACf,IAAK,IAAI,EAAI,EAAS,EAAG,GAAK,EAAG,IAC/B,EAAY,GAAK,EAAM,EAAY,GAAK,EACxC,GAAY,EAAI,GAAK,KAAK,MAAM,EAAY,GAAK,EAAiB,CAGpE,GAAI,IAAa,EAAQ,CACvB,IAAM,EAAa,EAAW,EAE1B,EAAa,KAAK,IAAI,EAAU,CAC9B,EAAQ,EAAY,KAAK,EAAG,IAAM,KAAK,IAAI,EAAI,GAAK,EAAY,GAAK,EAAiB,CAAC,CAE7F,KAAO,EAAa,GAAG,CACrB,IAAI,EAAM,EACN,EAAU,EAAM,GACpB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,IAC1B,GAAI,EAAU,EAAM,GAAI,CAEtB,GAAI,EAAW,GAAU,EAAI,GAAK,EAAa,EAC7C,SACF,EAAM,EACN,EAAU,EAAM,GAGhB,EAAW,EACb,IAAI,GAEJ,EAAI,IAAQ,EAEd,IAAM,GACN,KAIJ,GAAI,EAAmB,EACrB,OAAO,EAAI,IAAI,GAAK,EAAG,EAAI,GAAkB,QAAQ,EAAc,CAAE,CAGzE,OAAO,EAGT,SAAgB,EAA6D,EAAU,EAAc,EAAM,IAAK,EAAgB,EAAQ,CACtI,OAAO,EAA8B,EAAI,IAAI,GAAK,EAAE,GAAM,CAAE,EAAK,EAAc,CAC5E,KAAK,EAAG,KAAO,CACd,GAAG,EAAI,IACN,GAAO,EACT,EAAE"}
+{"version":3,"file":"rounding.mjs","names":[],"sources":["../../../src/common/data/rounding.ts"],"sourcesContent":["// From https://v2.dinerojs.com/docs/api/formatting/to-unit MIT\n\nimport { sum } from './math'\n\nexport type RoundingMode = (value: number) => number\n\nexport function isHalf(value: number): boolean {\n  return Math.abs(value) % 1 === 0.5\n}\nexport function isEven(value: number): boolean {\n  return value % 2 === 0\n}\n\nexport const roundUp: RoundingMode = value => Math.ceil(value)\nexport const roundDown: RoundingMode = value => Math.floor(value)\nexport const roundHalfUp: RoundingMode = value => Math.round(value)\n\n/**\n * Round a number with half values to nearest odd integer.\n */\nexport const roundHalfOdd: RoundingMode = (value) => {\n  const rounded = Math.round(value)\n  if (!isHalf(value))\n    return rounded\n\n  return isEven(rounded) ? rounded - 1 : rounded\n}\n\n/**\n * Round a number with half values to nearest integer farthest from zero.\n */\nexport const roundHalfAwayFromZero: RoundingMode = (value) => {\n  return isHalf(value)\n    ? Math.sign(value) * Math.ceil(Math.abs(value))\n    : Math.round(value)\n}\n\n/**\n * Round a number with half values down.\n */\nexport const roundHalfDown: RoundingMode = value =>\n  isHalf(value) ? Math.floor(value) : Math.round(value)\n\n/**\n * Round a number with half values to nearest even integer.\n * https://wiki.c2.com/?BankersRounding\n */\nexport const roundHalfEven: RoundingMode = (value) => {\n  const rounded = Math.round(value)\n  if (!isHalf(value))\n    return rounded\n\n  return isEven(rounded) ? rounded : rounded - 1\n}\n\n/**\n * Round a number with half values to nearest integer closest to zero.\n */\nexport const roundHalfTowardsZero: RoundingMode = value =>\n  isHalf(value)\n    ? Math.sign(value) * Math.floor(Math.abs(value))\n    : Math.round(value)\n\n/**\n * This is useful for percentages that should sum up to 100.\n * But can also be fine tuned.\n *\n * Original from https://github.com/super-ienien/percent-round\n */\nexport function roundArrayOfNumbersToMatchSum(ipt: number[], max = 100, decimalPlaces = 0) {\n  const iptPercents: number[] = [...ipt]\n  const length = ipt.length\n  const out: number[] = []\n  out.fill(0, length)\n\n  const total = sum(iptPercents)\n\n  if (total !== 0) {\n    const powDecimalPlaces = 10 ** decimalPlaces\n    const pow100 = max * powDecimalPlaces\n    let check100 = 0\n    for (let i = length - 1; i >= 0; i--) {\n      iptPercents[i] = max * iptPercents[i] / total\n      check100 += out[i] = Math.round(iptPercents[i] * powDecimalPlaces)\n    }\n\n    if (check100 !== pow100) {\n      const totalDiff = (check100 - pow100)\n      const roundGrain = 1\n      let grainCount = Math.abs(totalDiff)\n      const diffs = iptPercents.map((_, i) => Math.abs(out[i] - iptPercents[i] * powDecimalPlaces))\n\n      while (grainCount > 0) {\n        let idx = 0\n        let maxDiff = diffs[0]\n        for (let i = 1; i < length; i++) {\n          if (maxDiff < diffs[i]) {\n            // avoid negative result\n            if (check100 > pow100 && out[i] - roundGrain < 0)\n              continue\n            idx = i\n            maxDiff = diffs[i]\n          }\n        }\n        if (check100 > pow100)\n          out[idx] -= roundGrain\n        else\n          out[idx] += roundGrain\n\n        diffs[idx] -= roundGrain\n        grainCount--\n      }\n    }\n\n    if (powDecimalPlaces > 1)\n      return out.map(n => +((n / powDecimalPlaces).toFixed(decimalPlaces)))\n  }\n\n  return out\n}\n\nexport function roundArrayOfObjectsToMatchSum<T extends Record<string, any>>(arr: T[], name: string, max = 100, decimalPlaces = 0): T[] {\n  return roundArrayOfNumbersToMatchSum(arr.map(o => o[name]), max, decimalPlaces)\n    .map((o, i) => ({\n      ...arr[i],\n      [name]: o,\n    }))\n}\n"],"mappings":";;;AAMA,SAAgB,OAAO,OAAwB;AAC7C,QAAO,KAAK,IAAI,MAAM,GAAG,MAAM;;AAEjC,SAAgB,OAAO,OAAwB;AAC7C,QAAO,QAAQ,MAAM;;AAGvB,MAAa,WAAwB,UAAS,KAAK,KAAK,MAAM;AAC9D,MAAa,aAA0B,UAAS,KAAK,MAAM,MAAM;AACjE,MAAa,eAA4B,UAAS,KAAK,MAAM,MAAM;;;;AAKnE,MAAa,gBAA8B,UAAU;CACnD,MAAM,UAAU,KAAK,MAAM,MAAM;AACjC,KAAI,CAAC,OAAO,MAAM,CAChB,QAAO;AAET,QAAO,OAAO,QAAQ,GAAG,UAAU,IAAI;;;;;AAMzC,MAAa,yBAAuC,UAAU;AAC5D,QAAO,OAAO,MAAM,GAChB,KAAK,KAAK,MAAM,GAAG,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC,GAC7C,KAAK,MAAM,MAAM;;;;;AAMvB,MAAa,iBAA8B,UACzC,OAAO,MAAM,GAAG,KAAK,MAAM,MAAM,GAAG,KAAK,MAAM,MAAM;;;;;AAMvD,MAAa,iBAA+B,UAAU;CACpD,MAAM,UAAU,KAAK,MAAM,MAAM;AACjC,KAAI,CAAC,OAAO,MAAM,CAChB,QAAO;AAET,QAAO,OAAO,QAAQ,GAAG,UAAU,UAAU;;;;;AAM/C,MAAa,wBAAqC,UAChD,OAAO,MAAM,GACT,KAAK,KAAK,MAAM,GAAG,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,GAC9C,KAAK,MAAM,MAAM;;;;;;;AAQvB,SAAgB,8BAA8B,KAAe,MAAM,KAAK,gBAAgB,GAAG;CACzF,MAAM,cAAwB,CAAC,GAAG,IAAI;CACtC,MAAM,SAAS,IAAI;CACnB,MAAM,MAAgB,EAAE;AACxB,KAAI,KAAK,GAAG,OAAO;CAEnB,MAAM,QAAQ,IAAI,YAAY;AAE9B,KAAI,UAAU,GAAG;EACf,MAAM,mBAAmB,MAAM;EAC/B,MAAM,SAAS,MAAM;EACrB,IAAI,WAAW;AACf,OAAK,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACpC,eAAY,KAAK,MAAM,YAAY,KAAK;AACxC,eAAY,IAAI,KAAK,KAAK,MAAM,YAAY,KAAK,iBAAiB;;AAGpE,MAAI,aAAa,QAAQ;GACvB,MAAM,YAAa,WAAW;GAC9B,MAAM,aAAa;GACnB,IAAI,aAAa,KAAK,IAAI,UAAU;GACpC,MAAM,QAAQ,YAAY,KAAK,GAAG,MAAM,KAAK,IAAI,IAAI,KAAK,YAAY,KAAK,iBAAiB,CAAC;AAE7F,UAAO,aAAa,GAAG;IACrB,IAAI,MAAM;IACV,IAAI,UAAU,MAAM;AACpB,SAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAC1B,KAAI,UAAU,MAAM,IAAI;AAEtB,SAAI,WAAW,UAAU,IAAI,KAAK,aAAa,EAC7C;AACF,WAAM;AACN,eAAU,MAAM;;AAGpB,QAAI,WAAW,OACb,KAAI,QAAQ;QAEZ,KAAI,QAAQ;AAEd,UAAM,QAAQ;AACd;;;AAIJ,MAAI,mBAAmB,EACrB,QAAO,IAAI,KAAI,MAAK,EAAG,IAAI,kBAAkB,QAAQ,cAAc,CAAE;;AAGzE,QAAO;;AAGT,SAAgB,8BAA6D,KAAU,MAAc,MAAM,KAAK,gBAAgB,GAAQ;AACtI,QAAO,8BAA8B,IAAI,KAAI,MAAK,EAAE,MAAM,EAAE,KAAK,cAAc,CAC5E,KAAK,GAAG,OAAO;EACd,GAAG,IAAI;GACN,OAAO;EACT,EAAE"}