zeed 1.2.4 → 1.3.0

package/dist/common/csv.cjs

@@ -1,2 +1,5 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk4M4EUXUScjs = require('../chunk-4M4EUXUS.cjs');require('../chunk-WCOWHFZD.cjs');require('../chunk-IVUEQANC.cjs');require('../chunk-IXH5D35S.cjs');require('../chunk-5RHVNJKM.cjs');require('../chunk-P7XCQ7WV.cjs');exports.csvParse = _chunk4M4EUXUScjs.b; exports.csvParseToObjects = _chunk4M4EUXUScjs.c; exports.csvStringify = _chunk4M4EUXUScjs.a;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`./data/json.cjs`),t=require(`./data/is.cjs`),n=require(`./data/regexp.cjs`);function r(n,r={}){let{separator:i=`,`}=r,a=``;r.addBom&&(a=``);for(let r=0;r<n.length;r++)a+=`${n[r].map(n=>{if(n==null||n===``)return``;if(t.isBoolean(n))return n?1:0;let r=String(n);return(t.isRecord(n)||t.isArray(n))&&(r=e.jsonStringifySafe(n)),r.includes(`"`)||r.includes(`
+`)||r.includes(i)?`"${r.replace(/"/g,`""`)}"`:r}).join(i)}\n`;return a}function i(e,t={}){let r=/("((?:(?:[^"]*?)(?:"")?)*)"|([^,;\t\n]*))([,;\t\n]|\r\n)/g;t.separator&&(r=new RegExp(r.source.replace(/',;\\t/g,n.escapeRegExp(t.separator)),r.flags));let i=[],a=[],o,s=`${e.replace(/\r\n/g,`
+`).trim()}\n`;for(;o=r.exec(s);){let e=o[2]??o[3]??``;e=e.replace(/""/g,`"`),a.push(e),o[4]===`
+`&&(i.push(a),a=[])}return i}function a(e,t={}){let n=i(e,t),r=n[0];return n.slice(1).map(e=>Object.fromEntries(e.map((e,t)=>[r[t],e])))}exports.csvParse=i,exports.csvParseToObjects=a,exports.csvStringify=r;
 //# sourceMappingURL=csv.cjs.map

package/dist/common/csv.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/dirk/work/github-zeed/dist/common/csv.cjs"],"names":[],"mappings":"AAAA,kIAAwC,iCAA8B,iCAA8B,iCAA8B,iCAA8B,iCAA8B,oIAA+D","file":"/Users/dirk/work/github-zeed/dist/common/csv.cjs"}
+{"version":3,"file":"csv.cjs","names":["isBoolean","isRecord","isArray","jsonStringifySafe","escapeRegExp"],"sources":["../../src/common/csv.ts"],"sourcesContent":["import { isArray, isBoolean, isRecord } from './data/is'\nimport { jsonStringifySafe } from './data/json'\nimport { escapeRegExp } from './data/regexp'\n\nconst defaultSeparator = ','\n\nexport function csvStringify(data: any[], opt: {\n  // header?: string[]\n  separator?: string\n  addBom?: boolean // option to add byte order mark for improved Excel support\n} = {}): string {\n  const { separator = defaultSeparator } = opt\n  let body = ''\n  if (opt.addBom)\n    body = '\\uFEFF'\n\n  // Append the header row to the response if requested\n  // if (header)\n  //   body = `${header.join(separator)}\\n`\n\n  // Convert the data to a CSV-like structure\n  for (let i = 0; i < data.length; i++) {\n    body += `${data[i].map((field: string) => {\n      if (field == null || field === '')\n        return ''\n      if (isBoolean(field))\n        return field ? 1 : 0\n      let s = String(field)\n      if (isRecord(field) || isArray(field))\n        s = jsonStringifySafe(field)\n      if (s.includes('\"') || s.includes('\\n') || s.includes(separator))\n        return `\"${s.replace(/\"/g, '\"\"')}\"`\n      return s\n    }).join(separator)}\\n`\n  }\n\n  return body\n}\n\nexport function csvParse(raw: string, opt: {\n  separator?: string\n} = {}) {\n  // https://regex101.com/r/BCpKyV/1\n  // eslint-disable-next-line regexp/no-unused-capturing-group, regexp/no-super-linear-backtracking, regexp/no-dupe-disjunctions, regexp/no-useless-non-capturing-group\n  let rxOneValueWithSeparator = /(\"((?:(?:[^\"]*?)(?:\"\")?)*)\"|([^,;\\t\\n]*))([,;\\t\\n]|\\r\\n)/g\n  if (opt.separator)\n    rxOneValueWithSeparator = new RegExp(rxOneValueWithSeparator.source.replace(/',;\\\\t/g, escapeRegExp(opt.separator)), rxOneValueWithSeparator.flags)\n\n  const lines: any[][] = []\n  let row: any[] = []\n  let m: any\n  const text = `${raw.replace(/\\r\\n/g, '\\n').trim()}\\n`\n\n  // eslint-disable-next-line no-cond-assign\n  while (m = rxOneValueWithSeparator.exec(text)) {\n    let value = m[2] ?? m[3] ?? ''\n    value = value.replace(/\"\"/g, '\"')\n    row.push(value)\n    if (m[4] === '\\n') {\n      lines.push(row)\n      row = []\n    }\n  }\n  return lines\n}\n\nexport function csvParseToObjects(raw: string, opt: {\n  separator?: string\n} = {}) {\n  const lines = csvParse(raw, opt)\n  const header = lines[0]\n  return lines.slice(1).map(l =>\n    Object.fromEntries (l.map((v, i) => [header[i], v])),\n  )\n}\n"],"mappings":"gKAMA,SAAgB,EAAa,EAAa,EAItC,EAAE,CAAU,CACd,GAAM,CAAE,YAAY,KAAqB,EACrC,EAAO,GACP,EAAI,SACN,EAAO,KAOT,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAC/B,GAAQ,GAAG,EAAK,GAAG,IAAK,GAAkB,CACxC,GAAI,GAAS,MAAQ,IAAU,GAC7B,MAAO,GACT,GAAIA,EAAAA,UAAU,EAAM,CAClB,OAAO,EAAQ,EAAI,EACrB,IAAI,EAAI,OAAO,EAAM,CAKrB,OAJIC,EAAAA,SAAS,EAAM,EAAIC,EAAAA,QAAQ,EAAM,IACnC,EAAIC,EAAAA,kBAAkB,EAAM,EAC1B,EAAE,SAAS,IAAI,EAAI,EAAE,SAAS;EAAK,EAAI,EAAE,SAAS,EAAU,CACvD,IAAI,EAAE,QAAQ,KAAM,KAAK,CAAC,GAC5B,GACP,CAAC,KAAK,EAAU,CAAC,IAGrB,OAAO,EAGT,SAAgB,EAAS,EAAa,EAElC,EAAE,CAAE,CAGN,IAAI,EAA0B,4DAC1B,EAAI,YACN,EAA0B,IAAI,OAAO,EAAwB,OAAO,QAAQ,UAAWC,EAAAA,aAAa,EAAI,UAAU,CAAC,CAAE,EAAwB,MAAM,EAErJ,IAAM,EAAiB,EAAE,CACrB,EAAa,EAAE,CACf,EACE,EAAO,GAAG,EAAI,QAAQ,QAAS;EAAK,CAAC,MAAM,CAAC,IAGlD,KAAO,EAAI,EAAwB,KAAK,EAAK,EAAE,CAC7C,IAAI,EAAQ,EAAE,IAAM,EAAE,IAAM,GAC5B,EAAQ,EAAM,QAAQ,MAAO,IAAI,CACjC,EAAI,KAAK,EAAM,CACX,EAAE,KAAO;IACX,EAAM,KAAK,EAAI,CACf,EAAM,EAAE,EAGZ,OAAO,EAGT,SAAgB,EAAkB,EAAa,EAE3C,EAAE,CAAE,CACN,IAAM,EAAQ,EAAS,EAAK,EAAI,CAC1B,EAAS,EAAM,GACrB,OAAO,EAAM,MAAM,EAAE,CAAC,IAAI,GACxB,OAAO,YAAa,EAAE,KAAK,EAAG,IAAM,CAAC,EAAO,GAAI,EAAE,CAAC,CAAC,CACrD"}

package/dist/common/csv.d.cts

@@ -1,12 +1,2 @@
-declare function csvStringify(data: any[], opt?: {
-    separator?: string;
-    addBom?: boolean;
-}): string;
-declare function csvParse(raw: string, opt?: {
-    separator?: string;
-}): any[][];
-declare function csvParseToObjects(raw: string, opt?: {
-    separator?: string;
-}): any[];
-
-export { csvParse, csvParseToObjects, csvStringify };
+import { n as csvParseToObjects, r as csvStringify, t as csvParse } from "../csv-Ci2ysFZB.cjs";
+export { csvParse, csvParseToObjects, csvStringify };

package/dist/common/csv.d.mts

@@ -0,0 +1,2 @@
+import { n as csvParseToObjects, r as csvStringify, t as csvParse } from "../csv-jl8exttU.mjs";
+export { csvParse, csvParseToObjects, csvStringify };

package/dist/common/csv.mjs

@@ -0,0 +1,5 @@
+import{jsonStringifySafe as e}from"./data/json.mjs";import{isArray as t,isBoolean as n,isRecord as r}from"./data/is.mjs";import{escapeRegExp as i}from"./data/regexp.mjs";function a(i,a={}){let{separator:o=`,`}=a,s=``;a.addBom&&(s=``);for(let a=0;a<i.length;a++)s+=`${i[a].map(i=>{if(i==null||i===``)return``;if(n(i))return i?1:0;let a=String(i);return(r(i)||t(i))&&(a=e(i)),a.includes(`"`)||a.includes(`
+`)||a.includes(o)?`"${a.replace(/"/g,`""`)}"`:a}).join(o)}\n`;return s}function o(e,t={}){let n=/("((?:(?:[^"]*?)(?:"")?)*)"|([^,;\t\n]*))([,;\t\n]|\r\n)/g;t.separator&&(n=new RegExp(n.source.replace(/',;\\t/g,i(t.separator)),n.flags));let r=[],a=[],o,s=`${e.replace(/\r\n/g,`
+`).trim()}\n`;for(;o=n.exec(s);){let e=o[2]??o[3]??``;e=e.replace(/""/g,`"`),a.push(e),o[4]===`
+`&&(r.push(a),a=[])}return r}function s(e,t={}){let n=o(e,t),r=n[0];return n.slice(1).map(e=>Object.fromEntries(e.map((e,t)=>[r[t],e])))}export{o as csvParse,s as csvParseToObjects,a as csvStringify};
+//# sourceMappingURL=csv.mjs.map

package/dist/common/csv.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"csv.mjs","names":[],"sources":["../../src/common/csv.ts"],"sourcesContent":["import { isArray, isBoolean, isRecord } from './data/is'\nimport { jsonStringifySafe } from './data/json'\nimport { escapeRegExp } from './data/regexp'\n\nconst defaultSeparator = ','\n\nexport function csvStringify(data: any[], opt: {\n  // header?: string[]\n  separator?: string\n  addBom?: boolean // option to add byte order mark for improved Excel support\n} = {}): string {\n  const { separator = defaultSeparator } = opt\n  let body = ''\n  if (opt.addBom)\n    body = '\\uFEFF'\n\n  // Append the header row to the response if requested\n  // if (header)\n  //   body = `${header.join(separator)}\\n`\n\n  // Convert the data to a CSV-like structure\n  for (let i = 0; i < data.length; i++) {\n    body += `${data[i].map((field: string) => {\n      if (field == null || field === '')\n        return ''\n      if (isBoolean(field))\n        return field ? 1 : 0\n      let s = String(field)\n      if (isRecord(field) || isArray(field))\n        s = jsonStringifySafe(field)\n      if (s.includes('\"') || s.includes('\\n') || s.includes(separator))\n        return `\"${s.replace(/\"/g, '\"\"')}\"`\n      return s\n    }).join(separator)}\\n`\n  }\n\n  return body\n}\n\nexport function csvParse(raw: string, opt: {\n  separator?: string\n} = {}) {\n  // https://regex101.com/r/BCpKyV/1\n  // eslint-disable-next-line regexp/no-unused-capturing-group, regexp/no-super-linear-backtracking, regexp/no-dupe-disjunctions, regexp/no-useless-non-capturing-group\n  let rxOneValueWithSeparator = /(\"((?:(?:[^\"]*?)(?:\"\")?)*)\"|([^,;\\t\\n]*))([,;\\t\\n]|\\r\\n)/g\n  if (opt.separator)\n    rxOneValueWithSeparator = new RegExp(rxOneValueWithSeparator.source.replace(/',;\\\\t/g, escapeRegExp(opt.separator)), rxOneValueWithSeparator.flags)\n\n  const lines: any[][] = []\n  let row: any[] = []\n  let m: any\n  const text = `${raw.replace(/\\r\\n/g, '\\n').trim()}\\n`\n\n  // eslint-disable-next-line no-cond-assign\n  while (m = rxOneValueWithSeparator.exec(text)) {\n    let value = m[2] ?? m[3] ?? ''\n    value = value.replace(/\"\"/g, '\"')\n    row.push(value)\n    if (m[4] === '\\n') {\n      lines.push(row)\n      row = []\n    }\n  }\n  return lines\n}\n\nexport function csvParseToObjects(raw: string, opt: {\n  separator?: string\n} = {}) {\n  const lines = csvParse(raw, opt)\n  const header = lines[0]\n  return lines.slice(1).map(l =>\n    Object.fromEntries (l.map((v, i) => [header[i], v])),\n  )\n}\n"],"mappings":"0KAMA,SAAgB,EAAa,EAAa,EAItC,EAAE,CAAU,CACd,GAAM,CAAE,YAAY,KAAqB,EACrC,EAAO,GACP,EAAI,SACN,EAAO,KAOT,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAC/B,GAAQ,GAAG,EAAK,GAAG,IAAK,GAAkB,CACxC,GAAI,GAAS,MAAQ,IAAU,GAC7B,MAAO,GACT,GAAI,EAAU,EAAM,CAClB,OAAO,EAAQ,EAAI,EACrB,IAAI,EAAI,OAAO,EAAM,CAKrB,OAJI,EAAS,EAAM,EAAI,EAAQ,EAAM,IACnC,EAAI,EAAkB,EAAM,EAC1B,EAAE,SAAS,IAAI,EAAI,EAAE,SAAS;EAAK,EAAI,EAAE,SAAS,EAAU,CACvD,IAAI,EAAE,QAAQ,KAAM,KAAK,CAAC,GAC5B,GACP,CAAC,KAAK,EAAU,CAAC,IAGrB,OAAO,EAGT,SAAgB,EAAS,EAAa,EAElC,EAAE,CAAE,CAGN,IAAI,EAA0B,4DAC1B,EAAI,YACN,EAA0B,IAAI,OAAO,EAAwB,OAAO,QAAQ,UAAW,EAAa,EAAI,UAAU,CAAC,CAAE,EAAwB,MAAM,EAErJ,IAAM,EAAiB,EAAE,CACrB,EAAa,EAAE,CACf,EACE,EAAO,GAAG,EAAI,QAAQ,QAAS;EAAK,CAAC,MAAM,CAAC,IAGlD,KAAO,EAAI,EAAwB,KAAK,EAAK,EAAE,CAC7C,IAAI,EAAQ,EAAE,IAAM,EAAE,IAAM,GAC5B,EAAQ,EAAM,QAAQ,MAAO,IAAI,CACjC,EAAI,KAAK,EAAM,CACX,EAAE,KAAO;IACX,EAAM,KAAK,EAAI,CACf,EAAM,EAAE,EAGZ,OAAO,EAGT,SAAgB,EAAkB,EAAa,EAE3C,EAAE,CAAE,CACN,IAAM,EAAQ,EAAS,EAAK,EAAI,CAC1B,EAAS,EAAM,GACrB,OAAO,EAAM,MAAM,EAAE,CAAC,IAAI,GACxB,OAAO,YAAa,EAAE,KAAK,EAAG,IAAM,CAAC,EAAO,GAAI,EAAE,CAAC,CAAC,CACrD"}

package/dist/common/data/array.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkKYDHX5HWcjs = require('../../chunk-KYDHX5HW.cjs');require('../../chunk-B2XPF5R4.cjs');require('../../chunk-UXW3L3L6.cjs');require('../../chunk-P7XCQ7WV.cjs');exports.arrayAvg = _chunkKYDHX5HWcjs.w; exports.arrayBatches = _chunkKYDHX5HWcjs.x; exports.arrayEmptyInPlace = _chunkKYDHX5HWcjs.k; exports.arrayFilterInPlace = _chunkKYDHX5HWcjs.i; exports.arrayFlatten = _chunkKYDHX5HWcjs.d; exports.arrayIntersection = _chunkKYDHX5HWcjs.e; exports.arrayIsEqual = _chunkKYDHX5HWcjs.o; exports.arrayMax = _chunkKYDHX5HWcjs.t; exports.arrayMin = _chunkKYDHX5HWcjs.u; exports.arrayMinus = _chunkKYDHX5HWcjs.b; exports.arrayRandomElement = _chunkKYDHX5HWcjs.s; exports.arrayRemoveElement = _chunkKYDHX5HWcjs.g; exports.arraySetArrayInPlace = _chunkKYDHX5HWcjs.l; exports.arraySetElement = _chunkKYDHX5HWcjs.h; exports.arrayShuffle = _chunkKYDHX5HWcjs.q; exports.arrayShuffleForce = _chunkKYDHX5HWcjs.r; exports.arrayShuffleInPlace = _chunkKYDHX5HWcjs.p; exports.arraySorted = _chunkKYDHX5HWcjs.m; exports.arraySortedNumbers = _chunkKYDHX5HWcjs.n; exports.arraySum = _chunkKYDHX5HWcjs.v; exports.arraySymmetricDifference = _chunkKYDHX5HWcjs.f; exports.arrayToggleInPlace = _chunkKYDHX5HWcjs.j; exports.arrayUnion = _chunkKYDHX5HWcjs.c; exports.arrayUnique = _chunkKYDHX5HWcjs.a; exports.createArray = _chunkKYDHX5HWcjs.y;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`./math.cjs`),t=require(`./orderby.cjs`);function n(e){return e.filter((t,n)=>e.indexOf(t)===n)}function r(e,t){return n(e.filter(e=>!t.includes(e)))}function i(...e){return n(e.reduce((e=[],t)=>e.concat(t),[]))}function a(...e){return e.flat(1/0)}function o(e,t){return n(e).filter(e=>t.includes(e))}function s(e,t){return r(i(e,t),o(e,t))}function c(e,t){if(e&&Array.isArray(e)){let n;for(;(n=e.indexOf(t))!==-1;)e.splice(n,1);return e}return[]}function l(e,t){return e.includes(t)||e.push(t),e}function u(e,t){return e.splice(0,e.length,...e.filter(t)),e}function d(e,t){let n=e.findIndex(e=>e===t);return n>=0?e.splice(n,1):e.push(t),e}function f(e){return e.splice(0,e.length),e}function p(e,t){return e.splice(0,e.length,...t),e}function m(e,n=t.cmp){return Array.from(e).sort(n)}function h(e){return m(e,(e,t)=>e-t)}function g(e,t){return e.length===t.length&&e.every((e,n)=>e===t[n])}function _(t){return t.sort(()=>e.getSecureRandomIfPossible()>.5?1:-1),t}function v(e){return _(Array.from(e))}function y(e){for(;e.length>1;){let t=Array.from(e);if(_(t),!g(e,t))return t}return e}function b(t){return t[Math.floor(e.getSecureRandomIfPossible()*t.length)]}function x(...e){return a(...e).reduce((e,t)=>e==null||t>e?t:e,void 0)}function S(...e){return a(...e).reduce((e,t)=>e==null||t<e?t:e,void 0)}function C(...e){return a(...e).reduce((e,t)=>e+t,0)}function w(...e){let t=a(...e);return t.reduce((e,t)=>e+t,0)/t.length}function T(e,t){let n=[],r=0,i=e.length;for(;r<i;)n.push(e.slice(r,r+=t));return n}function E(e=0,t){if(e<=0)return[];let n=Array.from({length:e});for(let r=0;r<e;r++)n[r]=t instanceof Function?t(r):t;return n}exports.arrayAvg=w,exports.arrayBatches=T,exports.arrayEmptyInPlace=f,exports.arrayFilterInPlace=u,exports.arrayFlatten=a,exports.arrayIntersection=o,exports.arrayIsEqual=g,exports.arrayMax=x,exports.arrayMin=S,exports.arrayMinus=r,exports.arrayRandomElement=b,exports.arrayRemoveElement=c,exports.arraySetArrayInPlace=p,exports.arraySetElement=l,exports.arrayShuffle=v,exports.arrayShuffleForce=y,exports.arrayShuffleInPlace=_,exports.arraySorted=m,exports.arraySortedNumbers=h,exports.arraySum=C,exports.arraySymmetricDifference=s,exports.arrayToggleInPlace=d,exports.arrayUnion=i,exports.arrayUnique=n,exports.createArray=E;
 //# sourceMappingURL=array.cjs.map

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

@@ -1 +1 @@
-{"version":3,"sources":["/Users/dirk/work/github-zeed/dist/common/data/array.cjs"],"names":[],"mappings":"AAAA,qIAAuF,oCAAiC,oCAAiC,oCAAiC,+nCAA8f","file":"/Users/dirk/work/github-zeed/dist/common/data/array.cjs"}
+{"version":3,"file":"array.cjs","names":["cmp","getSecureRandomIfPossible"],"sources":["../../../src/common/data/array.ts"],"sourcesContent":["/* eslint-disable no-cond-assign */\n\nimport type { NestedArray } from '../types'\nimport { getSecureRandomIfPossible } from './math'\nimport { cmp } from './orderby'\n\n/**\n * Return a new array with duplicate values removed. Maintains first occurrence order.\n * @typeParam T - element type\n * @param arr - input array\n * @returns new array containing unique elements from `arr`\n */\nexport function arrayUnique<T>(arr: T[]): T[] {\n  return arr.filter((n: any, index: any) => arr.indexOf(n) === index)\n}\n\n/**\n * Return elements present in `x` but not in `y`.\n * @typeParam T - element type\n * @param left - left-hand array\n * @param right - array of elements to exclude\n * @returns new array with elements from `left` that are not included in `right`\n */\nexport function arrayMinus<T>(left: T[], right: T[]): T[] {\n  return arrayUnique(left.filter((n: any) => !right.includes(n)))\n}\n\n/**\n * Return the union of multiple arrays (unique elements across all inputs).\n * @typeParam T - element type\n * @param arrays - arrays to union\n * @returns new array with unique elements from all provided arrays\n */\nexport function arrayUnion<T>(...arrays: T[][]): T[] {\n  return arrayUnique(arrays.reduce((acc: T[] = [], value) => acc.concat(value), []))\n}\n\n/** `[1,[2,3]]` becomes `[1,2,3]` */\n/**\n * Flatten nested arrays to a single-level array.\n * Example: `[1, [2, 3]]` becomes `[1, 2, 3]`.\n * @typeParam T - element type\n * @param arrays - one or more nested arrays to flatten\n * @returns flattened array containing all elements\n */\nexport function arrayFlatten<T>(...arrays: NestedArray<T>[]): T[] {\n  return (arrays as any).flat(Number.POSITIVE_INFINITY)\n}\n\n/**\n * Return the intersection of two arrays (elements present in both).\n * @typeParam T - element type\n * @param left - first array\n * @param right - second array\n * @returns new array with elements present in both `left` and `right`\n */\nexport function arrayIntersection<T>(left: T[], right: T[]): T[] {\n  return arrayUnique<T>(left).filter((n: any) => right.includes(n))\n}\n\n/**\n * Return the symmetric difference between two arrays (elements in either array but not both).\n * @typeParam T - element type\n */\nexport function arraySymmetricDifference<T>(left: T[], right: T[]): T[] {\n  return arrayMinus(arrayUnion(left, right), arrayIntersection(left, right))\n  // return arrayUnique(x.filter(n => !y.includes(n)).concat(y.filter(n => !x.includes(n))))\n}\n\n// export function arrayApply<T>(fn:  any, a: T[]): T[] {\n//   return a.reduce(fn, [])\n// }\n\n/**\n * Remove all occurrences of `el` from `arr` in-place and return the mutated array.\n * If `arr` is not an array, returns an empty array.\n * @typeParam T - element type\n * @param arr - array to modify\n * @param el - element to remove\n * @returns the same array instance with `el` removed\n */\nexport function arrayRemoveElement<T>(arr: T[], el: T): T[] {\n  if (arr && Array.isArray(arr)) {\n    let index\n    while ((index = arr.indexOf(el)) !== -1)\n      arr.splice(index, 1)\n    return arr\n  }\n  return []\n}\n\n/** Only have it once in the set */\n/**\n * Ensure `el` exists in `arr`. If not present, push it and return the array.\n * @typeParam T - element type\n * @param arr - target array\n * @param el - element to ensure\n * @returns the same array instance (modified if `el` was added)\n */\nexport function arraySetElement<T>(arr: T[], el: T): T[] {\n  if (!arr.includes(el))\n    arr.push(el)\n  return arr\n}\n\n// via https://stackoverflow.com/a/49587869 and Erwin\n/**\n * Filter an array in-place using `fn` and return the same array instance.\n * This replaces the array contents with the filtered result.\n * @typeParam T - element type\n * @param arr - array to filter in-place\n * @param fn - predicate to determine which elements to keep\n * @returns the same array instance after filtering\n */\nexport function arrayFilterInPlace<T>(arr: T[], fn: (el: T) => boolean): T[] {\n  arr.splice(0, arr.length, ...arr.filter(fn))\n  return arr\n}\n\n// via https://stackoverflow.com/a/49587869 and Erwin\n/**\n * Toggle presence of `el` in `array` in-place: remove if present, add if missing.\n * @typeParam T - element type\n * @param arr - array to modify\n * @param el - element to toggle\n * @returns the same array instance after the toggle\n */\nexport function arrayToggleInPlace<T>(arr: T[], el: T): T[] {\n  const index = arr.findIndex(e => e === el)\n  if (index >= 0)\n    arr.splice(index, 1)\n  else arr.push(el)\n  return arr\n}\n\n/**\n * Empty an array in-place (remove all elements) and return it.\n * @typeParam T - element type\n */\nexport function arrayEmptyInPlace<T>(arr: T[]): T[] {\n  arr.splice(0, arr.length)\n  return arr\n}\n\n/**\n * Replace the contents of `array` in-place with `newContent` and return it.\n * @typeParam T - element type\n * @param arr - target array to overwrite\n * @param newContent - new contents to set\n * @returns the same array instance after replacement\n */\nexport function arraySetArrayInPlace<T>(arr: T[], newContent: T[]): T[] {\n  arr.splice(0, arr.length, ...newContent)\n  return arr\n}\n\n/**\n * Return a sorted copy of the provided iterable or array-like object.\n * @typeParam T - element type\n * @param arr - iterable or array-like input\n * @param compareFn - optional compare function (defaults to `cmp`)\n * @returns a new array sorted according to `compareFn`\n */\nexport function arraySorted<T>(\n  arr: Iterable<T> | ArrayLike<T>,\n  compareFn: ((a: T, b: T) => number) | undefined = cmp,\n): T[] {\n  return Array.from(arr).sort(compareFn)\n}\n\n/**\n * Return a new array with numbers sorted in ascending order.\n * @param arr - array of numbers\n * @returns sorted array of numbers\n */\nexport function arraySortedNumbers(arr: number[]): number[] {\n  return arraySorted(arr, (l: number, r: number) => l - r)\n}\n\n/**\n * Check strict equality of two arrays by length and element-wise === comparison.\n * @typeParam T - element type\n * @param array1 - first array\n * @param array2 - second array\n * @returns `true` if arrays are same length and all elements strictly equal\n */\nexport function arrayIsEqual<T>(array1: T[], array2: T[]): boolean {\n  return (\n    array1.length === array2.length\n    && array1.every((value, index) => value === array2[index])\n  )\n}\n\n/**\n * Shuffle an array in-place using a secure random source if available.\n * Note: uses Array.sort with random comparator which is sufficient for many cases but\n * not perfectly uniform. Returns the same mutated array.\n * @typeParam T - element type\n * @param array - array to shuffle in-place\n * @returns the shuffled array (same instance)\n */\nexport function arrayShuffleInPlace<T>(arr: T[]): T[] {\n  arr.sort(() => (getSecureRandomIfPossible() > 0.5 ? 1 : -1))\n\n  // Alternative https://github.com/sindresorhus/array-shuffle/blob/main/index.js#L8\n  // for (let index = array.length - 1; index > 0; index--) {\n  //   const newIndex = Math.floor(Math.random() * (index + 1));\n  //   [array[index], array[newIndex]] = [array[newIndex], array[index]];\n  // }\n\n  return arr\n}\n\n/**\n * Return a shuffled copy of `array` (original array is not modified).\n * @typeParam T - element type\n * @param array - input array\n * @returns a new shuffled array\n */\nexport function arrayShuffle<T>(arr: T[]): T[] {\n  return arrayShuffleInPlace(Array.from(arr))\n}\n\n/** Randomly shuffle the order of the array's elements. Force to have a different order if array has more than one element. */\n/**\n * Shuffle `array` and ensure the returned order differs from the original when possible.\n * If array length is 0 or 1 it is returned unchanged.\n * @typeParam T - element type\n * @param array - input array\n * @returns a shuffled array that's different from the input when feasible\n */\nexport function arrayShuffleForce<T>(arr: T[]): T[] {\n  while (arr.length > 1) {\n    const copy = Array.from(arr)\n    arrayShuffleInPlace(copy)\n    if (!arrayIsEqual(arr, copy))\n      return copy\n  }\n  return arr\n}\n\n/**\n * Return a random element from `array` using a secure random source if available.\n * @typeParam T - element type\n * @param array - input array (must be non-empty)\n * @returns a randomly selected element\n */\nexport function arrayRandomElement<T>(arr: T[]): T {\n  return arr[Math.floor(getSecureRandomIfPossible() * arr.length)]\n}\n\n/**\n * Return the maximum value from one or more nested arrays.\n * Uses the `>` operator for comparison.\n * @typeParam T - element type (should support `>` comparison)\n * @param arrays - nested arrays to search\n * @returns the maximum value or `undefined` if no elements present\n */\nexport function arrayMax<T>(...arrays: NestedArray<T>[]): T {\n  return arrayFlatten(...arrays).reduce(\n    (acc: T, value: T) => (acc != null ? (value > acc ? value : acc) : value),\n    undefined as T,\n  )\n}\n\n/**\n * Return the minimum value from one or more nested arrays.\n * Uses the `<` operator for comparison.\n * @typeParam T - element type (should support `<` comparison)\n * @param arrays - nested arrays to search\n * @returns the minimum value or `undefined` if no elements present\n */\nexport function arrayMin<T>(...arrays: NestedArray<T>[]): T {\n  return arrayFlatten(...arrays).reduce(\n    (acc: T, value: T) => (acc != null ? (value < acc ? value : acc) : value),\n    undefined as T,\n  )\n}\n\n/**\n * Sum all numbers in one or more nested arrays.\n * @param arrays - nested arrays of numbers\n * @returns the numeric sum (0 for empty input)\n */\nexport function arraySum(...arrays: NestedArray<number>[]): number {\n  return arrayFlatten(...arrays).reduce((acc, value) => acc + value, 0)\n}\n\n/**\n * Compute the average of numbers across one or more nested arrays.\n * @param arrays - nested arrays of numbers\n * @returns arithmetic mean (NaN if there are no elements)\n */\nexport function arrayAvg(...arrays: NestedArray<number>[]): number {\n  const flatArray = arrayFlatten(...arrays)\n  return flatArray.reduce((acc, value) => acc + value, 0) / flatArray.length\n}\n\n/**\n * Split an array into chunks of `chunkLength` (last chunk may be smaller).\n * @typeParam T - element type\n * @param arr - input array\n * @param chunkLength - chunk size (positive integer)\n * @returns array of chunk arrays\n */\nexport function arrayBatches<T>(arr: T[], chunkLength: number): T[][] {\n  const chunks = []\n  let i = 0\n  const n = arr.length\n  while (i < n)\n    chunks.push(arr.slice(i, (i += chunkLength)))\n  return chunks\n}\n\n/**\n * Create an array of given `length` filled with `item` or the result of `item(index)`.\n * If `length` is <= 0 an empty array is returned.\n * @typeParam T - element type\n * @param length - desired length of the array\n * @param item - value to fill or a function producing a value per index\n * @returns newly created array of length `length`\n */\nexport function createArray<T>(\n  length = 0,\n  item?: T | ((index: number) => T), // todo remove optional\n): T[] {\n  if (length <= 0)\n    return []\n  const arr: T[] = Array.from({ length })\n  for (let i = 0; i < length; i++)\n    // @ts-expect-error xxx\n    arr[i] = item instanceof Function ? item(i) : item\n  return arr\n}\n"],"mappings":"4HAYA,SAAgB,EAAe,EAAe,CAC5C,OAAO,EAAI,QAAQ,EAAQ,IAAe,EAAI,QAAQ,EAAE,GAAK,EAAM,CAUrE,SAAgB,EAAc,EAAW,EAAiB,CACxD,OAAO,EAAY,EAAK,OAAQ,GAAW,CAAC,EAAM,SAAS,EAAE,CAAC,CAAC,CASjE,SAAgB,EAAc,GAAG,EAAoB,CACnD,OAAO,EAAY,EAAO,QAAQ,EAAW,EAAE,CAAE,IAAU,EAAI,OAAO,EAAM,CAAE,EAAE,CAAC,CAAC,CAWpF,SAAgB,EAAgB,GAAG,EAA+B,CAChE,OAAQ,EAAe,KAAK,IAAyB,CAUvD,SAAgB,EAAqB,EAAW,EAAiB,CAC/D,OAAO,EAAe,EAAK,CAAC,OAAQ,GAAW,EAAM,SAAS,EAAE,CAAC,CAOnE,SAAgB,EAA4B,EAAW,EAAiB,CACtE,OAAO,EAAW,EAAW,EAAM,EAAM,CAAE,EAAkB,EAAM,EAAM,CAAC,CAgB5E,SAAgB,EAAsB,EAAU,EAAY,CAC1D,GAAI,GAAO,MAAM,QAAQ,EAAI,CAAE,CAC7B,IAAI,EACJ,MAAQ,EAAQ,EAAI,QAAQ,EAAG,IAAM,IACnC,EAAI,OAAO,EAAO,EAAE,CACtB,OAAO,EAET,MAAO,EAAE,CAWX,SAAgB,EAAmB,EAAU,EAAY,CAGvD,OAFK,EAAI,SAAS,EAAG,EACnB,EAAI,KAAK,EAAG,CACP,EAYT,SAAgB,EAAsB,EAAU,EAA6B,CAE3E,OADA,EAAI,OAAO,EAAG,EAAI,OAAQ,GAAG,EAAI,OAAO,EAAG,CAAC,CACrC,EAWT,SAAgB,EAAsB,EAAU,EAAY,CAC1D,IAAM,EAAQ,EAAI,UAAU,GAAK,IAAM,EAAG,CAI1C,OAHI,GAAS,EACX,EAAI,OAAO,EAAO,EAAE,CACjB,EAAI,KAAK,EAAG,CACV,EAOT,SAAgB,EAAqB,EAAe,CAElD,OADA,EAAI,OAAO,EAAG,EAAI,OAAO,CAClB,EAUT,SAAgB,EAAwB,EAAU,EAAsB,CAEtE,OADA,EAAI,OAAO,EAAG,EAAI,OAAQ,GAAG,EAAW,CACjC,EAUT,SAAgB,EACd,EACA,EAAkDA,EAAAA,IAC7C,CACL,OAAO,MAAM,KAAK,EAAI,CAAC,KAAK,EAAU,CAQxC,SAAgB,EAAmB,EAAyB,CAC1D,OAAO,EAAY,GAAM,EAAW,IAAc,EAAI,EAAE,CAU1D,SAAgB,EAAgB,EAAa,EAAsB,CACjE,OACE,EAAO,SAAW,EAAO,QACtB,EAAO,OAAO,EAAO,IAAU,IAAU,EAAO,GAAO,CAY9D,SAAgB,EAAuB,EAAe,CASpD,OARA,EAAI,SAAYC,EAAAA,2BAA2B,CAAG,GAAM,EAAI,GAAI,CAQrD,EAST,SAAgB,EAAgB,EAAe,CAC7C,OAAO,EAAoB,MAAM,KAAK,EAAI,CAAC,CAW7C,SAAgB,EAAqB,EAAe,CAClD,KAAO,EAAI,OAAS,GAAG,CACrB,IAAM,EAAO,MAAM,KAAK,EAAI,CAE5B,GADA,EAAoB,EAAK,CACrB,CAAC,EAAa,EAAK,EAAK,CAC1B,OAAO,EAEX,OAAO,EAST,SAAgB,EAAsB,EAAa,CACjD,OAAO,EAAI,KAAK,MAAMA,EAAAA,2BAA2B,CAAG,EAAI,OAAO,EAUjE,SAAgB,EAAY,GAAG,EAA6B,CAC1D,OAAO,EAAa,GAAG,EAAO,CAAC,QAC5B,EAAQ,IAAc,GAAO,MAAQ,EAAQ,EAAqB,EAAP,EAC5D,IAAA,GACD,CAUH,SAAgB,EAAY,GAAG,EAA6B,CAC1D,OAAO,EAAa,GAAG,EAAO,CAAC,QAC5B,EAAQ,IAAc,GAAO,MAAQ,EAAQ,EAAqB,EAAP,EAC5D,IAAA,GACD,CAQH,SAAgB,EAAS,GAAG,EAAuC,CACjE,OAAO,EAAa,GAAG,EAAO,CAAC,QAAQ,EAAK,IAAU,EAAM,EAAO,EAAE,CAQvE,SAAgB,EAAS,GAAG,EAAuC,CACjE,IAAM,EAAY,EAAa,GAAG,EAAO,CACzC,OAAO,EAAU,QAAQ,EAAK,IAAU,EAAM,EAAO,EAAE,CAAG,EAAU,OAUtE,SAAgB,EAAgB,EAAU,EAA4B,CACpE,IAAM,EAAS,EAAE,CACb,EAAI,EACF,EAAI,EAAI,OACd,KAAO,EAAI,GACT,EAAO,KAAK,EAAI,MAAM,EAAI,GAAK,EAAa,CAAC,CAC/C,OAAO,EAWT,SAAgB,EACd,EAAS,EACT,EACK,CACL,GAAI,GAAU,EACZ,MAAO,EAAE,CACX,IAAM,EAAW,MAAM,KAAK,CAAE,SAAQ,CAAC,CACvC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,IAE1B,EAAI,GAAK,aAAgB,SAAW,EAAK,EAAE,CAAG,EAChD,OAAO"}

package/dist/common/data/array.d.cts

@@ -1,195 +1,2 @@
-import { NestedArray } from '../types.cjs';
-
-/**
- * Return a new array with duplicate values removed. Maintains first occurrence order.
- * @typeParam T - element type
- * @param arr - input array
- * @returns new array containing unique elements from `arr`
- */
-declare function arrayUnique<T>(arr: T[]): T[];
-/**
- * Return elements present in `x` but not in `y`.
- * @typeParam T - element type
- * @param left - left-hand array
- * @param right - array of elements to exclude
- * @returns new array with elements from `left` that are not included in `right`
- */
-declare function arrayMinus<T>(left: T[], right: T[]): T[];
-/**
- * Return the union of multiple arrays (unique elements across all inputs).
- * @typeParam T - element type
- * @param arrays - arrays to union
- * @returns new array with unique elements from all provided arrays
- */
-declare function arrayUnion<T>(...arrays: T[][]): T[];
-/** `[1,[2,3]]` becomes `[1,2,3]` */
-/**
- * Flatten nested arrays to a single-level array.
- * Example: `[1, [2, 3]]` becomes `[1, 2, 3]`.
- * @typeParam T - element type
- * @param arrays - one or more nested arrays to flatten
- * @returns flattened array containing all elements
- */
-declare function arrayFlatten<T>(...arrays: NestedArray<T>[]): T[];
-/**
- * Return the intersection of two arrays (elements present in both).
- * @typeParam T - element type
- * @param left - first array
- * @param right - second array
- * @returns new array with elements present in both `left` and `right`
- */
-declare function arrayIntersection<T>(left: T[], right: T[]): T[];
-/**
- * Return the symmetric difference between two arrays (elements in either array but not both).
- * @typeParam T - element type
- */
-declare function arraySymmetricDifference<T>(left: T[], right: T[]): T[];
-/**
- * Remove all occurrences of `el` from `arr` in-place and return the mutated array.
- * If `arr` is not an array, returns an empty array.
- * @typeParam T - element type
- * @param arr - array to modify
- * @param el - element to remove
- * @returns the same array instance with `el` removed
- */
-declare function arrayRemoveElement<T>(arr: T[], el: T): T[];
-/** Only have it once in the set */
-/**
- * Ensure `el` exists in `arr`. If not present, push it and return the array.
- * @typeParam T - element type
- * @param arr - target array
- * @param el - element to ensure
- * @returns the same array instance (modified if `el` was added)
- */
-declare function arraySetElement<T>(arr: T[], el: T): T[];
-/**
- * Filter an array in-place using `fn` and return the same array instance.
- * This replaces the array contents with the filtered result.
- * @typeParam T - element type
- * @param arr - array to filter in-place
- * @param fn - predicate to determine which elements to keep
- * @returns the same array instance after filtering
- */
-declare function arrayFilterInPlace<T>(arr: T[], fn: (el: T) => boolean): T[];
-/**
- * Toggle presence of `el` in `array` in-place: remove if present, add if missing.
- * @typeParam T - element type
- * @param arr - array to modify
- * @param el - element to toggle
- * @returns the same array instance after the toggle
- */
-declare function arrayToggleInPlace<T>(arr: T[], el: T): T[];
-/**
- * Empty an array in-place (remove all elements) and return it.
- * @typeParam T - element type
- */
-declare function arrayEmptyInPlace<T>(arr: T[]): T[];
-/**
- * Replace the contents of `array` in-place with `newContent` and return it.
- * @typeParam T - element type
- * @param arr - target array to overwrite
- * @param newContent - new contents to set
- * @returns the same array instance after replacement
- */
-declare function arraySetArrayInPlace<T>(arr: T[], newContent: T[]): T[];
-/**
- * Return a sorted copy of the provided iterable or array-like object.
- * @typeParam T - element type
- * @param arr - iterable or array-like input
- * @param compareFn - optional compare function (defaults to `cmp`)
- * @returns a new array sorted according to `compareFn`
- */
-declare function arraySorted<T>(arr: Iterable<T> | ArrayLike<T>, compareFn?: ((a: T, b: T) => number) | undefined): T[];
-/**
- * Return a new array with numbers sorted in ascending order.
- * @param arr - array of numbers
- * @returns sorted array of numbers
- */
-declare function arraySortedNumbers(arr: number[]): number[];
-/**
- * Check strict equality of two arrays by length and element-wise === comparison.
- * @typeParam T - element type
- * @param array1 - first array
- * @param array2 - second array
- * @returns `true` if arrays are same length and all elements strictly equal
- */
-declare function arrayIsEqual<T>(array1: T[], array2: T[]): boolean;
-/**
- * Shuffle an array in-place using a secure random source if available.
- * Note: uses Array.sort with random comparator which is sufficient for many cases but
- * not perfectly uniform. Returns the same mutated array.
- * @typeParam T - element type
- * @param array - array to shuffle in-place
- * @returns the shuffled array (same instance)
- */
-declare function arrayShuffleInPlace<T>(arr: T[]): T[];
-/**
- * Return a shuffled copy of `array` (original array is not modified).
- * @typeParam T - element type
- * @param array - input array
- * @returns a new shuffled array
- */
-declare function arrayShuffle<T>(arr: T[]): T[];
-/** Randomly shuffle the order of the array's elements. Force to have a different order if array has more than one element. */
-/**
- * Shuffle `array` and ensure the returned order differs from the original when possible.
- * If array length is 0 or 1 it is returned unchanged.
- * @typeParam T - element type
- * @param array - input array
- * @returns a shuffled array that's different from the input when feasible
- */
-declare function arrayShuffleForce<T>(arr: T[]): T[];
-/**
- * Return a random element from `array` using a secure random source if available.
- * @typeParam T - element type
- * @param array - input array (must be non-empty)
- * @returns a randomly selected element
- */
-declare function arrayRandomElement<T>(arr: T[]): T;
-/**
- * Return the maximum value from one or more nested arrays.
- * Uses the `>` operator for comparison.
- * @typeParam T - element type (should support `>` comparison)
- * @param arrays - nested arrays to search
- * @returns the maximum value or `undefined` if no elements present
- */
-declare function arrayMax<T>(...arrays: NestedArray<T>[]): T;
-/**
- * Return the minimum value from one or more nested arrays.
- * Uses the `<` operator for comparison.
- * @typeParam T - element type (should support `<` comparison)
- * @param arrays - nested arrays to search
- * @returns the minimum value or `undefined` if no elements present
- */
-declare function arrayMin<T>(...arrays: NestedArray<T>[]): T;
-/**
- * Sum all numbers in one or more nested arrays.
- * @param arrays - nested arrays of numbers
- * @returns the numeric sum (0 for empty input)
- */
-declare function arraySum(...arrays: NestedArray<number>[]): number;
-/**
- * Compute the average of numbers across one or more nested arrays.
- * @param arrays - nested arrays of numbers
- * @returns arithmetic mean (NaN if there are no elements)
- */
-declare function arrayAvg(...arrays: NestedArray<number>[]): number;
-/**
- * Split an array into chunks of `chunkLength` (last chunk may be smaller).
- * @typeParam T - element type
- * @param arr - input array
- * @param chunkLength - chunk size (positive integer)
- * @returns array of chunk arrays
- */
-declare function arrayBatches<T>(arr: T[], chunkLength: number): T[][];
-/**
- * Create an array of given `length` filled with `item` or the result of `item(index)`.
- * If `length` is <= 0 an empty array is returned.
- * @typeParam T - element type
- * @param length - desired length of the array
- * @param item - value to fill or a function producing a value per index
- * @returns newly created array of length `length`
- */
-declare function createArray<T>(length?: number, item?: T | ((index: number) => T)): T[];
-
-export { arrayAvg, arrayBatches, arrayEmptyInPlace, arrayFilterInPlace, arrayFlatten, arrayIntersection, arrayIsEqual, arrayMax, arrayMin, arrayMinus, arrayRandomElement, arrayRemoveElement, arraySetArrayInPlace, arraySetElement, arrayShuffle, arrayShuffleForce, arrayShuffleInPlace, arraySorted, arraySortedNumbers, arraySum, arraySymmetricDifference, arrayToggleInPlace, arrayUnion, arrayUnique, createArray };
+import { C as arrayUnion, S as arrayToggleInPlace, T as createArray, _ as arrayShuffleInPlace, a as arrayFlatten, b as arraySum, c as arrayMax, d as arrayRandomElement, f as arrayRemoveElement, g as arrayShuffleForce, h as arrayShuffle, i as arrayFilterInPlace, l as arrayMin, m as arraySetElement, n as arrayBatches, o as arrayIntersection, p as arraySetArrayInPlace, r as arrayEmptyInPlace, s as arrayIsEqual, t as arrayAvg, u as arrayMinus, v as arraySorted, w as arrayUnique, x as arraySymmetricDifference, y as arraySortedNumbers } from "../../array-Dwd6BYuK.cjs";
+export { arrayAvg, arrayBatches, arrayEmptyInPlace, arrayFilterInPlace, arrayFlatten, arrayIntersection, arrayIsEqual, arrayMax, arrayMin, arrayMinus, arrayRandomElement, arrayRemoveElement, arraySetArrayInPlace, arraySetElement, arrayShuffle, arrayShuffleForce, arrayShuffleInPlace, arraySorted, arraySortedNumbers, arraySum, arraySymmetricDifference, arrayToggleInPlace, arrayUnion, arrayUnique, createArray };

package/dist/common/data/array.d.mts

@@ -0,0 +1,2 @@
+import { C as arrayUnion, S as arrayToggleInPlace, T as createArray, _ as arrayShuffleInPlace, a as arrayFlatten, b as arraySum, c as arrayMax, d as arrayRandomElement, f as arrayRemoveElement, g as arrayShuffleForce, h as arrayShuffle, i as arrayFilterInPlace, l as arrayMin, m as arraySetElement, n as arrayBatches, o as arrayIntersection, p as arraySetArrayInPlace, r as arrayEmptyInPlace, s as arrayIsEqual, t as arrayAvg, u as arrayMinus, v as arraySorted, w as arrayUnique, x as arraySymmetricDifference, y as arraySortedNumbers } from "../../array-22DcyFGC.mjs";
+export { arrayAvg, arrayBatches, arrayEmptyInPlace, arrayFilterInPlace, arrayFlatten, arrayIntersection, arrayIsEqual, arrayMax, arrayMin, arrayMinus, arrayRandomElement, arrayRemoveElement, arraySetArrayInPlace, arraySetElement, arrayShuffle, arrayShuffleForce, arrayShuffleInPlace, arraySorted, arraySortedNumbers, arraySum, arraySymmetricDifference, arrayToggleInPlace, arrayUnion, arrayUnique, createArray };

package/dist/common/data/array.mjs

@@ -0,0 +1,2 @@
+import{getSecureRandomIfPossible as e}from"./math.mjs";import{cmp as t}from"./orderby.mjs";function n(e){return e.filter((t,n)=>e.indexOf(t)===n)}function r(e,t){return n(e.filter(e=>!t.includes(e)))}function i(...e){return n(e.reduce((e=[],t)=>e.concat(t),[]))}function a(...e){return e.flat(1/0)}function o(e,t){return n(e).filter(e=>t.includes(e))}function s(e,t){return r(i(e,t),o(e,t))}function c(e,t){if(e&&Array.isArray(e)){let n;for(;(n=e.indexOf(t))!==-1;)e.splice(n,1);return e}return[]}function l(e,t){return e.includes(t)||e.push(t),e}function u(e,t){return e.splice(0,e.length,...e.filter(t)),e}function d(e,t){let n=e.findIndex(e=>e===t);return n>=0?e.splice(n,1):e.push(t),e}function f(e){return e.splice(0,e.length),e}function p(e,t){return e.splice(0,e.length,...t),e}function m(e,n=t){return Array.from(e).sort(n)}function h(e){return m(e,(e,t)=>e-t)}function g(e,t){return e.length===t.length&&e.every((e,n)=>e===t[n])}function _(t){return t.sort(()=>e()>.5?1:-1),t}function v(e){return _(Array.from(e))}function y(e){for(;e.length>1;){let t=Array.from(e);if(_(t),!g(e,t))return t}return e}function b(t){return t[Math.floor(e()*t.length)]}function x(...e){return a(...e).reduce((e,t)=>e==null||t>e?t:e,void 0)}function S(...e){return a(...e).reduce((e,t)=>e==null||t<e?t:e,void 0)}function C(...e){return a(...e).reduce((e,t)=>e+t,0)}function w(...e){let t=a(...e);return t.reduce((e,t)=>e+t,0)/t.length}function T(e,t){let n=[],r=0,i=e.length;for(;r<i;)n.push(e.slice(r,r+=t));return n}function E(e=0,t){if(e<=0)return[];let n=Array.from({length:e});for(let r=0;r<e;r++)n[r]=t instanceof Function?t(r):t;return n}export{w as arrayAvg,T as arrayBatches,f as arrayEmptyInPlace,u as arrayFilterInPlace,a as arrayFlatten,o as arrayIntersection,g as arrayIsEqual,x as arrayMax,S as arrayMin,r as arrayMinus,b as arrayRandomElement,c as arrayRemoveElement,p as arraySetArrayInPlace,l as arraySetElement,v as arrayShuffle,y as arrayShuffleForce,_ as arrayShuffleInPlace,m as arraySorted,h as arraySortedNumbers,C as arraySum,s as arraySymmetricDifference,d as arrayToggleInPlace,i as arrayUnion,n as arrayUnique,E as createArray};
+//# sourceMappingURL=array.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"array.mjs","names":[],"sources":["../../../src/common/data/array.ts"],"sourcesContent":["/* eslint-disable no-cond-assign */\n\nimport type { NestedArray } from '../types'\nimport { getSecureRandomIfPossible } from './math'\nimport { cmp } from './orderby'\n\n/**\n * Return a new array with duplicate values removed. Maintains first occurrence order.\n * @typeParam T - element type\n * @param arr - input array\n * @returns new array containing unique elements from `arr`\n */\nexport function arrayUnique<T>(arr: T[]): T[] {\n  return arr.filter((n: any, index: any) => arr.indexOf(n) === index)\n}\n\n/**\n * Return elements present in `x` but not in `y`.\n * @typeParam T - element type\n * @param left - left-hand array\n * @param right - array of elements to exclude\n * @returns new array with elements from `left` that are not included in `right`\n */\nexport function arrayMinus<T>(left: T[], right: T[]): T[] {\n  return arrayUnique(left.filter((n: any) => !right.includes(n)))\n}\n\n/**\n * Return the union of multiple arrays (unique elements across all inputs).\n * @typeParam T - element type\n * @param arrays - arrays to union\n * @returns new array with unique elements from all provided arrays\n */\nexport function arrayUnion<T>(...arrays: T[][]): T[] {\n  return arrayUnique(arrays.reduce((acc: T[] = [], value) => acc.concat(value), []))\n}\n\n/** `[1,[2,3]]` becomes `[1,2,3]` */\n/**\n * Flatten nested arrays to a single-level array.\n * Example: `[1, [2, 3]]` becomes `[1, 2, 3]`.\n * @typeParam T - element type\n * @param arrays - one or more nested arrays to flatten\n * @returns flattened array containing all elements\n */\nexport function arrayFlatten<T>(...arrays: NestedArray<T>[]): T[] {\n  return (arrays as any).flat(Number.POSITIVE_INFINITY)\n}\n\n/**\n * Return the intersection of two arrays (elements present in both).\n * @typeParam T - element type\n * @param left - first array\n * @param right - second array\n * @returns new array with elements present in both `left` and `right`\n */\nexport function arrayIntersection<T>(left: T[], right: T[]): T[] {\n  return arrayUnique<T>(left).filter((n: any) => right.includes(n))\n}\n\n/**\n * Return the symmetric difference between two arrays (elements in either array but not both).\n * @typeParam T - element type\n */\nexport function arraySymmetricDifference<T>(left: T[], right: T[]): T[] {\n  return arrayMinus(arrayUnion(left, right), arrayIntersection(left, right))\n  // return arrayUnique(x.filter(n => !y.includes(n)).concat(y.filter(n => !x.includes(n))))\n}\n\n// export function arrayApply<T>(fn:  any, a: T[]): T[] {\n//   return a.reduce(fn, [])\n// }\n\n/**\n * Remove all occurrences of `el` from `arr` in-place and return the mutated array.\n * If `arr` is not an array, returns an empty array.\n * @typeParam T - element type\n * @param arr - array to modify\n * @param el - element to remove\n * @returns the same array instance with `el` removed\n */\nexport function arrayRemoveElement<T>(arr: T[], el: T): T[] {\n  if (arr && Array.isArray(arr)) {\n    let index\n    while ((index = arr.indexOf(el)) !== -1)\n      arr.splice(index, 1)\n    return arr\n  }\n  return []\n}\n\n/** Only have it once in the set */\n/**\n * Ensure `el` exists in `arr`. If not present, push it and return the array.\n * @typeParam T - element type\n * @param arr - target array\n * @param el - element to ensure\n * @returns the same array instance (modified if `el` was added)\n */\nexport function arraySetElement<T>(arr: T[], el: T): T[] {\n  if (!arr.includes(el))\n    arr.push(el)\n  return arr\n}\n\n// via https://stackoverflow.com/a/49587869 and Erwin\n/**\n * Filter an array in-place using `fn` and return the same array instance.\n * This replaces the array contents with the filtered result.\n * @typeParam T - element type\n * @param arr - array to filter in-place\n * @param fn - predicate to determine which elements to keep\n * @returns the same array instance after filtering\n */\nexport function arrayFilterInPlace<T>(arr: T[], fn: (el: T) => boolean): T[] {\n  arr.splice(0, arr.length, ...arr.filter(fn))\n  return arr\n}\n\n// via https://stackoverflow.com/a/49587869 and Erwin\n/**\n * Toggle presence of `el` in `array` in-place: remove if present, add if missing.\n * @typeParam T - element type\n * @param arr - array to modify\n * @param el - element to toggle\n * @returns the same array instance after the toggle\n */\nexport function arrayToggleInPlace<T>(arr: T[], el: T): T[] {\n  const index = arr.findIndex(e => e === el)\n  if (index >= 0)\n    arr.splice(index, 1)\n  else arr.push(el)\n  return arr\n}\n\n/**\n * Empty an array in-place (remove all elements) and return it.\n * @typeParam T - element type\n */\nexport function arrayEmptyInPlace<T>(arr: T[]): T[] {\n  arr.splice(0, arr.length)\n  return arr\n}\n\n/**\n * Replace the contents of `array` in-place with `newContent` and return it.\n * @typeParam T - element type\n * @param arr - target array to overwrite\n * @param newContent - new contents to set\n * @returns the same array instance after replacement\n */\nexport function arraySetArrayInPlace<T>(arr: T[], newContent: T[]): T[] {\n  arr.splice(0, arr.length, ...newContent)\n  return arr\n}\n\n/**\n * Return a sorted copy of the provided iterable or array-like object.\n * @typeParam T - element type\n * @param arr - iterable or array-like input\n * @param compareFn - optional compare function (defaults to `cmp`)\n * @returns a new array sorted according to `compareFn`\n */\nexport function arraySorted<T>(\n  arr: Iterable<T> | ArrayLike<T>,\n  compareFn: ((a: T, b: T) => number) | undefined = cmp,\n): T[] {\n  return Array.from(arr).sort(compareFn)\n}\n\n/**\n * Return a new array with numbers sorted in ascending order.\n * @param arr - array of numbers\n * @returns sorted array of numbers\n */\nexport function arraySortedNumbers(arr: number[]): number[] {\n  return arraySorted(arr, (l: number, r: number) => l - r)\n}\n\n/**\n * Check strict equality of two arrays by length and element-wise === comparison.\n * @typeParam T - element type\n * @param array1 - first array\n * @param array2 - second array\n * @returns `true` if arrays are same length and all elements strictly equal\n */\nexport function arrayIsEqual<T>(array1: T[], array2: T[]): boolean {\n  return (\n    array1.length === array2.length\n    && array1.every((value, index) => value === array2[index])\n  )\n}\n\n/**\n * Shuffle an array in-place using a secure random source if available.\n * Note: uses Array.sort with random comparator which is sufficient for many cases but\n * not perfectly uniform. Returns the same mutated array.\n * @typeParam T - element type\n * @param array - array to shuffle in-place\n * @returns the shuffled array (same instance)\n */\nexport function arrayShuffleInPlace<T>(arr: T[]): T[] {\n  arr.sort(() => (getSecureRandomIfPossible() > 0.5 ? 1 : -1))\n\n  // Alternative https://github.com/sindresorhus/array-shuffle/blob/main/index.js#L8\n  // for (let index = array.length - 1; index > 0; index--) {\n  //   const newIndex = Math.floor(Math.random() * (index + 1));\n  //   [array[index], array[newIndex]] = [array[newIndex], array[index]];\n  // }\n\n  return arr\n}\n\n/**\n * Return a shuffled copy of `array` (original array is not modified).\n * @typeParam T - element type\n * @param array - input array\n * @returns a new shuffled array\n */\nexport function arrayShuffle<T>(arr: T[]): T[] {\n  return arrayShuffleInPlace(Array.from(arr))\n}\n\n/** Randomly shuffle the order of the array's elements. Force to have a different order if array has more than one element. */\n/**\n * Shuffle `array` and ensure the returned order differs from the original when possible.\n * If array length is 0 or 1 it is returned unchanged.\n * @typeParam T - element type\n * @param array - input array\n * @returns a shuffled array that's different from the input when feasible\n */\nexport function arrayShuffleForce<T>(arr: T[]): T[] {\n  while (arr.length > 1) {\n    const copy = Array.from(arr)\n    arrayShuffleInPlace(copy)\n    if (!arrayIsEqual(arr, copy))\n      return copy\n  }\n  return arr\n}\n\n/**\n * Return a random element from `array` using a secure random source if available.\n * @typeParam T - element type\n * @param array - input array (must be non-empty)\n * @returns a randomly selected element\n */\nexport function arrayRandomElement<T>(arr: T[]): T {\n  return arr[Math.floor(getSecureRandomIfPossible() * arr.length)]\n}\n\n/**\n * Return the maximum value from one or more nested arrays.\n * Uses the `>` operator for comparison.\n * @typeParam T - element type (should support `>` comparison)\n * @param arrays - nested arrays to search\n * @returns the maximum value or `undefined` if no elements present\n */\nexport function arrayMax<T>(...arrays: NestedArray<T>[]): T {\n  return arrayFlatten(...arrays).reduce(\n    (acc: T, value: T) => (acc != null ? (value > acc ? value : acc) : value),\n    undefined as T,\n  )\n}\n\n/**\n * Return the minimum value from one or more nested arrays.\n * Uses the `<` operator for comparison.\n * @typeParam T - element type (should support `<` comparison)\n * @param arrays - nested arrays to search\n * @returns the minimum value or `undefined` if no elements present\n */\nexport function arrayMin<T>(...arrays: NestedArray<T>[]): T {\n  return arrayFlatten(...arrays).reduce(\n    (acc: T, value: T) => (acc != null ? (value < acc ? value : acc) : value),\n    undefined as T,\n  )\n}\n\n/**\n * Sum all numbers in one or more nested arrays.\n * @param arrays - nested arrays of numbers\n * @returns the numeric sum (0 for empty input)\n */\nexport function arraySum(...arrays: NestedArray<number>[]): number {\n  return arrayFlatten(...arrays).reduce((acc, value) => acc + value, 0)\n}\n\n/**\n * Compute the average of numbers across one or more nested arrays.\n * @param arrays - nested arrays of numbers\n * @returns arithmetic mean (NaN if there are no elements)\n */\nexport function arrayAvg(...arrays: NestedArray<number>[]): number {\n  const flatArray = arrayFlatten(...arrays)\n  return flatArray.reduce((acc, value) => acc + value, 0) / flatArray.length\n}\n\n/**\n * Split an array into chunks of `chunkLength` (last chunk may be smaller).\n * @typeParam T - element type\n * @param arr - input array\n * @param chunkLength - chunk size (positive integer)\n * @returns array of chunk arrays\n */\nexport function arrayBatches<T>(arr: T[], chunkLength: number): T[][] {\n  const chunks = []\n  let i = 0\n  const n = arr.length\n  while (i < n)\n    chunks.push(arr.slice(i, (i += chunkLength)))\n  return chunks\n}\n\n/**\n * Create an array of given `length` filled with `item` or the result of `item(index)`.\n * If `length` is <= 0 an empty array is returned.\n * @typeParam T - element type\n * @param length - desired length of the array\n * @param item - value to fill or a function producing a value per index\n * @returns newly created array of length `length`\n */\nexport function createArray<T>(\n  length = 0,\n  item?: T | ((index: number) => T), // todo remove optional\n): T[] {\n  if (length <= 0)\n    return []\n  const arr: T[] = Array.from({ length })\n  for (let i = 0; i < length; i++)\n    // @ts-expect-error xxx\n    arr[i] = item instanceof Function ? item(i) : item\n  return arr\n}\n"],"mappings":"2FAYA,SAAgB,EAAe,EAAe,CAC5C,OAAO,EAAI,QAAQ,EAAQ,IAAe,EAAI,QAAQ,EAAE,GAAK,EAAM,CAUrE,SAAgB,EAAc,EAAW,EAAiB,CACxD,OAAO,EAAY,EAAK,OAAQ,GAAW,CAAC,EAAM,SAAS,EAAE,CAAC,CAAC,CASjE,SAAgB,EAAc,GAAG,EAAoB,CACnD,OAAO,EAAY,EAAO,QAAQ,EAAW,EAAE,CAAE,IAAU,EAAI,OAAO,EAAM,CAAE,EAAE,CAAC,CAAC,CAWpF,SAAgB,EAAgB,GAAG,EAA+B,CAChE,OAAQ,EAAe,KAAK,IAAyB,CAUvD,SAAgB,EAAqB,EAAW,EAAiB,CAC/D,OAAO,EAAe,EAAK,CAAC,OAAQ,GAAW,EAAM,SAAS,EAAE,CAAC,CAOnE,SAAgB,EAA4B,EAAW,EAAiB,CACtE,OAAO,EAAW,EAAW,EAAM,EAAM,CAAE,EAAkB,EAAM,EAAM,CAAC,CAgB5E,SAAgB,EAAsB,EAAU,EAAY,CAC1D,GAAI,GAAO,MAAM,QAAQ,EAAI,CAAE,CAC7B,IAAI,EACJ,MAAQ,EAAQ,EAAI,QAAQ,EAAG,IAAM,IACnC,EAAI,OAAO,EAAO,EAAE,CACtB,OAAO,EAET,MAAO,EAAE,CAWX,SAAgB,EAAmB,EAAU,EAAY,CAGvD,OAFK,EAAI,SAAS,EAAG,EACnB,EAAI,KAAK,EAAG,CACP,EAYT,SAAgB,EAAsB,EAAU,EAA6B,CAE3E,OADA,EAAI,OAAO,EAAG,EAAI,OAAQ,GAAG,EAAI,OAAO,EAAG,CAAC,CACrC,EAWT,SAAgB,EAAsB,EAAU,EAAY,CAC1D,IAAM,EAAQ,EAAI,UAAU,GAAK,IAAM,EAAG,CAI1C,OAHI,GAAS,EACX,EAAI,OAAO,EAAO,EAAE,CACjB,EAAI,KAAK,EAAG,CACV,EAOT,SAAgB,EAAqB,EAAe,CAElD,OADA,EAAI,OAAO,EAAG,EAAI,OAAO,CAClB,EAUT,SAAgB,EAAwB,EAAU,EAAsB,CAEtE,OADA,EAAI,OAAO,EAAG,EAAI,OAAQ,GAAG,EAAW,CACjC,EAUT,SAAgB,EACd,EACA,EAAkD,EAC7C,CACL,OAAO,MAAM,KAAK,EAAI,CAAC,KAAK,EAAU,CAQxC,SAAgB,EAAmB,EAAyB,CAC1D,OAAO,EAAY,GAAM,EAAW,IAAc,EAAI,EAAE,CAU1D,SAAgB,EAAgB,EAAa,EAAsB,CACjE,OACE,EAAO,SAAW,EAAO,QACtB,EAAO,OAAO,EAAO,IAAU,IAAU,EAAO,GAAO,CAY9D,SAAgB,EAAuB,EAAe,CASpD,OARA,EAAI,SAAY,GAA2B,CAAG,GAAM,EAAI,GAAI,CAQrD,EAST,SAAgB,EAAgB,EAAe,CAC7C,OAAO,EAAoB,MAAM,KAAK,EAAI,CAAC,CAW7C,SAAgB,EAAqB,EAAe,CAClD,KAAO,EAAI,OAAS,GAAG,CACrB,IAAM,EAAO,MAAM,KAAK,EAAI,CAE5B,GADA,EAAoB,EAAK,CACrB,CAAC,EAAa,EAAK,EAAK,CAC1B,OAAO,EAEX,OAAO,EAST,SAAgB,EAAsB,EAAa,CACjD,OAAO,EAAI,KAAK,MAAM,GAA2B,CAAG,EAAI,OAAO,EAUjE,SAAgB,EAAY,GAAG,EAA6B,CAC1D,OAAO,EAAa,GAAG,EAAO,CAAC,QAC5B,EAAQ,IAAc,GAAO,MAAQ,EAAQ,EAAqB,EAAP,EAC5D,IAAA,GACD,CAUH,SAAgB,EAAY,GAAG,EAA6B,CAC1D,OAAO,EAAa,GAAG,EAAO,CAAC,QAC5B,EAAQ,IAAc,GAAO,MAAQ,EAAQ,EAAqB,EAAP,EAC5D,IAAA,GACD,CAQH,SAAgB,EAAS,GAAG,EAAuC,CACjE,OAAO,EAAa,GAAG,EAAO,CAAC,QAAQ,EAAK,IAAU,EAAM,EAAO,EAAE,CAQvE,SAAgB,EAAS,GAAG,EAAuC,CACjE,IAAM,EAAY,EAAa,GAAG,EAAO,CACzC,OAAO,EAAU,QAAQ,EAAK,IAAU,EAAM,EAAO,EAAE,CAAG,EAAU,OAUtE,SAAgB,EAAgB,EAAU,EAA4B,CACpE,IAAM,EAAS,EAAE,CACb,EAAI,EACF,EAAI,EAAI,OACd,KAAO,EAAI,GACT,EAAO,KAAK,EAAI,MAAM,EAAI,GAAK,EAAa,CAAC,CAC/C,OAAO,EAWT,SAAgB,EACd,EAAS,EACT,EACK,CACL,GAAI,GAAU,EACZ,MAAO,EAAE,CACX,IAAM,EAAW,MAAM,KAAK,CAAE,SAAQ,CAAC,CACvC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,IAE1B,EAAI,GAAK,aAAgB,SAAW,EAAK,EAAE,CAAG,EAChD,OAAO"}

package/dist/common/data/basex-secure.cjs

@@ -1,2 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkTNMEWZPWcjs = require('../../chunk-TNMEWZPW.cjs');require('../../chunk-5RHVNJKM.cjs');require('../../chunk-P7XCQ7WV.cjs');exports.assertNumber = _chunkTNMEWZPWcjs.a; exports.base16 = _chunkTNMEWZPWcjs.c; exports.base32 = _chunkTNMEWZPWcjs.d; exports.base32agnoster = _chunkTNMEWZPWcjs.h; exports.base32crockford = _chunkTNMEWZPWcjs.i; exports.base32hex = _chunkTNMEWZPWcjs.f; exports.base32hexnopad = _chunkTNMEWZPWcjs.g; exports.base32nopad = _chunkTNMEWZPWcjs.e; exports.base58 = _chunkTNMEWZPWcjs.n; exports.base58check = _chunkTNMEWZPWcjs.s; exports.base58flickr = _chunkTNMEWZPWcjs.o; exports.base58xmr = _chunkTNMEWZPWcjs.q; exports.base58xrp = _chunkTNMEWZPWcjs.p; exports.base64 = _chunkTNMEWZPWcjs.j; exports.base64nopad = _chunkTNMEWZPWcjs.k; exports.base64url = _chunkTNMEWZPWcjs.l; exports.base64urlnopad = _chunkTNMEWZPWcjs.m; exports.bech32 = _chunkTNMEWZPWcjs.t; exports.bech32m = _chunkTNMEWZPWcjs.u; exports.bytes = _chunkTNMEWZPWcjs.A; exports.bytesToString = _chunkTNMEWZPWcjs.x; exports.createBase58check = _chunkTNMEWZPWcjs.r; exports.hex = _chunkTNMEWZPWcjs.w; exports.str = _chunkTNMEWZPWcjs.y; exports.stringToBytes = _chunkTNMEWZPWcjs.z; exports.utf8 = _chunkTNMEWZPWcjs.v; exports.utils = _chunkTNMEWZPWcjs.b;
-//# sourceMappingURL=basex-secure.cjs.map
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`../../bin-Ce3i6ABn.cjs`);exports.assertNumber=e.y,exports.base16=e.b,exports.base32=e.x,exports.base32agnoster=e.S,exports.base32crockford=e.C,exports.base32hex=e.w,exports.base32hexnopad=e.T,exports.base32nopad=e.E,exports.base58=e.D,exports.base58check=e.O,exports.base58flickr=e.k,exports.base58xmr=e.A,exports.base58xrp=e.j,exports.base64=e.M,exports.base64nopad=e.N,exports.base64url=e.P,exports.base64urlnopad=e.F,exports.bech32=e.I,exports.bech32m=e.L,exports.bytes=e.R,exports.bytesToString=e.z,exports.createBase58check=e.B,exports.hex=e.V,exports.str=e.H,exports.stringToBytes=e.U,exports.utf8=e.W,exports.utils=e.G;

package/dist/common/data/basex-secure.d.cts

@@ -1,132 +1,2 @@
-/**
- * @__NO_SIDE_EFFECTS__
- */
-declare function assertNumber(n: number): void;
-interface Coder<F, T> {
-    encode(from: F): T;
-    decode(to: T): F;
-}
-interface BytesCoder extends Coder<Uint8Array, string> {
-    encode: (data: Uint8Array) => string;
-    decode: (str: string) => Uint8Array;
-}
-type BaseXChain = [Coder<any, any>, ...Coder<any, any>[]];
-type BaseXInput<F> = F extends Coder<infer T, any> ? T : never;
-type BaseXOutput<F> = F extends Coder<any, infer T> ? T : never;
-type BaseXFirst<T> = T extends [infer U, ...any[]] ? U : never;
-type BaseXLast<T> = T extends [...any[], infer U] ? U : never;
-type BaseXTail<T> = T extends [any, ...infer U] ? U : never;
-type BaseXAsChain<C extends BaseXChain, Rest = BaseXTail<C>> = {
-    [K in keyof C]: Coder<BaseXInput<C[K]>, BaseXInput<K extends keyof Rest ? Rest[K] : any>>;
-};
-/**
- * @__NO_SIDE_EFFECTS__
- */
-declare function chain<T extends BaseXChain & BaseXAsChain<T>>(...args: T): Coder<BaseXInput<BaseXFirst<T>>, BaseXOutput<BaseXLast<T>>>;
-type BaseXAlphabet = string[] | string;
-/**
- * Encodes integer radix representation to array of strings using alphabet and back
- * @__NO_SIDE_EFFECTS__
- */
-declare function alphabet(alphabet: BaseXAlphabet): Coder<number[], string[]>;
-/**
- * @__NO_SIDE_EFFECTS__
- */
-declare function join(separator?: string): Coder<string[], string>;
-/**
- * Pad strings array so it has integer number of bits
- * @__NO_SIDE_EFFECTS__
- */
-declare function padding(bits: number, chr?: string): Coder<string[], string[]>;
-/**
- * Slow: O(n^2) time complexity
- * @__NO_SIDE_EFFECTS__
- */
-declare function convertRadix(data: number[], from: number, to: number): number[];
-/**
- * Implemented with numbers, because BigInt is 5x slower
- * @__NO_SIDE_EFFECTS__
- */
-declare function convertRadix2(data: number[], from: number, to: number, padding: boolean): number[];
-/**
- * @__NO_SIDE_EFFECTS__
- */
-declare function radix(num: number): Coder<Uint8Array, number[]>;
-/**
- * If both bases are power of same number (like `2**8 <-> 2**64`),
- * there is a linear algorithm. For now we have implementation for power-of-two bases only.
- * @__NO_SIDE_EFFECTS__
- */
-declare function radix2(bits: number, revPadding?: boolean): Coder<Uint8Array, number[]>;
-/**
- * @__NO_SIDE_EFFECTS__
- */
-declare function checksum(len: number, fn: (data: Uint8Array) => Uint8Array): Coder<Uint8Array, Uint8Array>;
-declare const utils: {
-    alphabet: typeof alphabet;
-    chain: typeof chain;
-    checksum: typeof checksum;
-    convertRadix: typeof convertRadix;
-    convertRadix2: typeof convertRadix2;
-    radix: typeof radix;
-    radix2: typeof radix2;
-    join: typeof join;
-    padding: typeof padding;
-};
-declare const base16: BytesCoder;
-declare const base32: BytesCoder;
-declare const base32nopad: BytesCoder;
-declare const base32hex: BytesCoder;
-declare const base32hexnopad: BytesCoder;
-declare const base32agnoster: BytesCoder;
-declare const base32crockford: BytesCoder;
-declare const base64: BytesCoder;
-declare const base64nopad: BytesCoder;
-declare const base64url: BytesCoder;
-declare const base64urlnopad: BytesCoder;
-declare const base58: BytesCoder;
-declare const base58flickr: BytesCoder;
-declare const base58xrp: BytesCoder;
-declare const base58xmr: BytesCoder;
-declare const createBase58check: (sha256: (data: Uint8Array) => Uint8Array) => BytesCoder;
-declare const base58check: (sha256: (data: Uint8Array) => Uint8Array) => BytesCoder;
-interface Bech32Decoded<Prefix extends string = string> {
-    prefix: Prefix;
-    words: number[];
-}
-interface Bech32DecodedWithArray<Prefix extends string = string> {
-    prefix: Prefix;
-    words: number[];
-    bytes: Uint8Array;
-}
-interface Bech32 {
-    encode<Prefix extends string>(prefix: Prefix, words: number[] | Uint8Array, limit?: number | false): `${Lowercase<Prefix>}1${string}`;
-    decode<Prefix extends string>(str: `${Prefix}1${string}`, limit?: number | false): Bech32Decoded<Prefix>;
-    encodeFromBytes(prefix: string, bytes: Uint8Array): string;
-    decodeToBytes(str: string): Bech32DecodedWithArray;
-    decodeUnsafe(str: string, limit?: number | false): void | Bech32Decoded<string>;
-    fromWords(to: number[]): Uint8Array;
-    fromWordsUnsafe(to: number[]): void | Uint8Array;
-    toWords(from: Uint8Array): number[];
-}
-declare const bech32: Bech32;
-declare const bech32m: Bech32;
-declare const utf8: BytesCoder;
-declare const hex: BytesCoder;
-declare const CODERS: {
-    utf8: BytesCoder;
-    hex: BytesCoder;
-    base16: BytesCoder;
-    base32: BytesCoder;
-    base64: BytesCoder;
-    base64url: BytesCoder;
-    base58: BytesCoder;
-    base58xmr: BytesCoder;
-};
-type CoderType = keyof typeof CODERS;
-declare const bytesToString: (type: CoderType, bytes: Uint8Array) => string;
-declare const str: (type: CoderType, bytes: Uint8Array) => string;
-declare const stringToBytes: (type: CoderType, str: string) => Uint8Array;
-declare const bytes: (type: CoderType, str: string) => Uint8Array;
-
-export { type BaseXAlphabet, type BaseXAsChain, type BaseXChain, type BaseXFirst, type BaseXInput, type BaseXLast, type BaseXOutput, type BaseXTail, type Bech32, type Bech32Decoded, type Bech32DecodedWithArray, type BytesCoder, type Coder, assertNumber, base16, base32, base32agnoster, base32crockford, base32hex, base32hexnopad, base32nopad, base58, base58check, base58flickr, base58xmr, base58xrp, base64, base64nopad, base64url, base64urlnopad, bech32, bech32m, bytes, bytesToString, createBase58check, hex, str, stringToBytes, utf8, utils };
+import { A as base64urlnopad, B as utils, C as base58check, D as base64, E as base58xrp, F as createBase58check, I as hex, L as str, M as bech32m, N as bytes, O as base64nopad, P as bytesToString, R as stringToBytes, S as base58, T as base58xmr, _ as base32agnoster, a as BaseXInput, b as base32hexnopad, c as BaseXTail, d as Bech32DecodedWithArray, f as BytesCoder, g as base32, h as base16, i as BaseXFirst, j as bech32, k as base64url, l as Bech32, m as assertNumber, n as BaseXAsChain, o as BaseXLast, p as Coder, r as BaseXChain, s as BaseXOutput, t as BaseXAlphabet, u as Bech32Decoded, v as base32crockford, w as base58flickr, x as base32nopad, y as base32hex, z as utf8 } from "../../basex-secure-Det7yzQU.cjs";
+export { BaseXAlphabet, BaseXAsChain, BaseXChain, BaseXFirst, BaseXInput, BaseXLast, BaseXOutput, BaseXTail, Bech32, Bech32Decoded, Bech32DecodedWithArray, BytesCoder, Coder, assertNumber, base16, base32, base32agnoster, base32crockford, base32hex, base32hexnopad, base32nopad, base58, base58check, base58flickr, base58xmr, base58xrp, base64, base64nopad, base64url, base64urlnopad, bech32, bech32m, bytes, bytesToString, createBase58check, hex, str, stringToBytes, utf8, utils };

package/dist/common/data/basex-secure.d.mts

@@ -0,0 +1,2 @@
+import { A as base64urlnopad, B as utils, C as base58check, D as base64, E as base58xrp, F as createBase58check, I as hex, L as str, M as bech32m, N as bytes, O as base64nopad, P as bytesToString, R as stringToBytes, S as base58, T as base58xmr, _ as base32agnoster, a as BaseXInput, b as base32hexnopad, c as BaseXTail, d as Bech32DecodedWithArray, f as BytesCoder, g as base32, h as base16, i as BaseXFirst, j as bech32, k as base64url, l as Bech32, m as assertNumber, n as BaseXAsChain, o as BaseXLast, p as Coder, r as BaseXChain, s as BaseXOutput, t as BaseXAlphabet, u as Bech32Decoded, v as base32crockford, w as base58flickr, x as base32nopad, y as base32hex, z as utf8 } from "../../basex-secure-Cn6hLMwc.mjs";
+export { BaseXAlphabet, BaseXAsChain, BaseXChain, BaseXFirst, BaseXInput, BaseXLast, BaseXOutput, BaseXTail, Bech32, Bech32Decoded, Bech32DecodedWithArray, BytesCoder, Coder, assertNumber, base16, base32, base32agnoster, base32crockford, base32hex, base32hexnopad, base32nopad, base58, base58check, base58flickr, base58xmr, base58xrp, base64, base64nopad, base64url, base64urlnopad, bech32, bech32m, bytes, bytesToString, createBase58check, hex, str, stringToBytes, utf8, utils };

package/dist/common/data/basex-secure.mjs

@@ -0,0 +1 @@
+import{A as e,B as t,C as n,D as r,E as i,F as a,G as o,H as s,I as c,L as l,M as u,N as d,O as f,P as p,R as m,S as h,T as g,U as _,V as v,W as y,b,j as x,k as S,w as C,x as w,y as T,z as E}from"../../bin-SPdenYkw.mjs";export{T as assertNumber,b as base16,w as base32,h as base32agnoster,n as base32crockford,C as base32hex,g as base32hexnopad,i as base32nopad,r as base58,f as base58check,S as base58flickr,e as base58xmr,x as base58xrp,u as base64,d as base64nopad,p as base64url,a as base64urlnopad,c as bech32,l as bech32m,m as bytes,E as bytesToString,t as createBase58check,v as hex,s as str,_ as stringToBytes,y as utf8,o as utils};

package/dist/common/data/basex.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkOGP3AZFMcjs = require('../../chunk-OGP3AZFM.cjs');require('../../chunk-TNMEWZPW.cjs');require('../../chunk-5RHVNJKM.cjs');require('../../chunk-P7XCQ7WV.cjs');exports._useBase = _chunkOGP3AZFMcjs.a; exports.decodeBase16 = _chunkOGP3AZFMcjs.f; exports.decodeBase32 = _chunkOGP3AZFMcjs.d; exports.decodeBase58 = _chunkOGP3AZFMcjs.h; exports.decodeBase62 = _chunkOGP3AZFMcjs.j; exports.encodeBase16 = _chunkOGP3AZFMcjs.e; exports.encodeBase32 = _chunkOGP3AZFMcjs.c; exports.encodeBase58 = _chunkOGP3AZFMcjs.g; exports.encodeBase62 = _chunkOGP3AZFMcjs.i; exports.estimateSizeForBase = _chunkOGP3AZFMcjs.k; exports.useBase = _chunkOGP3AZFMcjs.b;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`../../bin-Ce3i6ABn.cjs`),t={2:`01`,8:`01234567`,11:`0123456789a`,16:`0123456789abcdef`,32:`0123456789abcdefghjkmnpqrtuvwxyz`,"32-crockford":`0123456789ABCDEFGHJKMNPQRSTVWXYZ`,"32-geohash":`0123456789bcdefghjkmnpqrstuvwxyz`,"32-agnoster":`0123456789abcdefghjkmnpqrtuvwxyz`,"32-rfc":`ABCDEFGHIJKLMNOPQRSTUVWXYZ234567`,"32-hex":`0123456789ABCDEFGHIJKLMNOPQRSTUV`,"32-zbase":`ybndrfg8ejkmcpqxot1uwisza345h769`,36:`0123456789abcdefghijklmnopqrstuvwxyz`,58:`123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz`,62:`0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz`,64:`ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/`,"64-url":`ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_`,66:`ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_.!~`,85:"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{|}~"};function n(n){let r=t[String(n)];if(!r)if(typeof n==`string`)r=n;else throw Error(`Unknown base ${n}`);if(r.length>=255)throw TypeError(`Alphabet too long`);let i=new Uint8Array(256);for(let e=0;e<i.length;e++)i[e]=255;for(let e=0;e<r.length;e++){let t=r.charAt(e),n=t.charCodeAt(0);if(i[n]!==255)throw TypeError(`${t} is ambiguous`);i[n]=e}let a=r.length,o=r.charAt(0),s=Math.log(a)/Math.log(256),c=Math.log(256)/Math.log(a);function l(t,n=-1){let i=e.v(t);if(i.byteLength===0)return``;let s=0,l=0,u=i.byteLength;for(;l!==u&&i[l]===0;)l++;let d=(u-l)*c+1>>>0,f=new Uint8Array(d);for(;l!==u;){let e=i[l],t=0;for(let n=d-1;(e!==0||t<s)&&n!==-1;n--,t++)e+=256*f[n]>>>0,f[n]=e%a>>>0,e=e/a>>>0;if(e!==0)throw Error(`Non-zero carry`);s=t,l++}let p=d-s;for(;p!==d&&f[p]===0;)p++;let m=``;for(;p<d;++p)m+=r.charAt(f[p]);return n>0?m.padStart(n,o):m}function u(e,t=-1){if(typeof e!=`string`)throw TypeError(`Expected String`);if(e.length===0)return new Uint8Array;e=e.replace(/\s+/g,``);let n=0,r=0;for(;e[n]===o;)n++;let c=(e.length-n)*s+1>>>0,l=new Uint8Array(c);for(;e[n];){let t=i[e.charCodeAt(n)];if(t===255)throw Error(`Unsupported character "${e[n]}"`);let o=0;for(let e=c-1;(t!==0||o<r)&&e!==-1;e--,o++)t+=a*l[e]>>>0,l[e]=t%256>>>0,t=t/256>>>0;if(t!==0)throw Error(`Non-zero carry`);r=o,n++}let u=c-r;for(;u!==c&&l[u]===0;)u++;return t>0?new Uint8Array([...new Uint8Array(t-l.length+u),...l.slice(u)]):l.slice(u)}return{encode:l,decode:u}}let r;function i(e){r??=new Map;function t(){let t=r.get(e);return t??(t=n(e),r.set(e,t)),t}function i(e,n=-1){return t().encode(e,n)}function a(e,n=-1){return t().decode(e,n)}return{encode:i,decode:a}}function a(e,t=-1){return i(32).encode(e,t)}function o(e,t=-1){return i(32).decode(e.toLocaleLowerCase().replace(/l/g,`1`).replace(/s/g,`5`).replace(/o/g,`0`).replace(/i/g,`1`),t)}function s(e,t=-1){return i(16).encode(e,t)}function c(e,t=-1){return i(16).decode(e,t)}function l(e,t=-1){return i(58).encode(e,t)}function u(e,t=-1){return i(58).decode(e,t)}function d(e,t=-1){return i(62).encode(e,t)}function f(e,t=-1){return i(62).decode(e,t)}function p(e,t){return Math.ceil(Math.log(256)/Math.log(t)*e)}exports._useBase=n,exports.decodeBase16=c,exports.decodeBase32=o,exports.decodeBase58=u,exports.decodeBase62=f,exports.encodeBase16=s,exports.encodeBase32=a,exports.encodeBase58=l,exports.encodeBase62=d,exports.estimateSizeForBase=p,exports.useBase=i;
 //# sourceMappingURL=basex.cjs.map

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

@@ -1 +1 @@
-{"version":3,"sources":["/Users/dirk/work/github-zeed/dist/common/data/basex.cjs"],"names":[],"mappings":"AAAA,qIAA2D,oCAAiC,oCAAiC,oCAAiC,ieAA4M","file":"/Users/dirk/work/github-zeed/dist/common/data/basex.cjs"}
+{"version":3,"file":"basex.cjs","names":["toUint8Array"],"sources":["../../../src/common/data/basex.ts"],"sourcesContent":["// Originial code at https://github.com/cryptocoinjs/base-x/blob/master/ts_src/index.ts\n//\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\n\n// \"Fast base encoding / decoding of any given alphabet using bitcoin style leading zero compression.\"\n// \"WARNING: This module is NOT RFC3548 compliant, it cannot be used for base16 (hex), base32, or base64 encoding in a standards compliant manner.\"\n\nimport type { BinInput } from './bin-types'\nimport { toUint8Array } from './bin'\n\nconst alphabets = {\n  '2': '01',\n  '8': '01234567',\n  '11': '0123456789a',\n  '16': '0123456789abcdef',\n  '32': '0123456789abcdefghjkmnpqrtuvwxyz', // Agnoster, because least mix up and good sorting\n  '32-crockford': '0123456789ABCDEFGHJKMNPQRSTVWXYZ', // Crockford\n  '32-geohash': '0123456789bcdefghjkmnpqrstuvwxyz', // https://en.wikipedia.org/wiki/Base32#Geohash\n  '32-agnoster': '0123456789abcdefghjkmnpqrtuvwxyz', // https://github.com/agnoster/base32-js/blob/master/lib/base32.js#L6 without i(1), l(1), o(0), s(5); keeps sort order\n  '32-rfc': 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567', // https://datatracker.ietf.org/doc/html/rfc4648#section-6\n  '32-hex': '0123456789ABCDEFGHIJKLMNOPQRSTUV', // https://datatracker.ietf.org/doc/html/rfc4648#section-7\n  '32-zbase': 'ybndrfg8ejkmcpqxot1uwisza345h769', //  https://en.wikipedia.org/wiki/Base32#z-base-32\n  '36': '0123456789abcdefghijklmnopqrstuvwxyz',\n  '58': '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz',\n  '62': '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz', // Correct sort order\n  '64': 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/',\n  '64-url': 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_', // https://datatracker.ietf.org/doc/html/rfc4648#section-5\n  '66': 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_.!~',\n  '85': '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{|}~', // https://datatracker.ietf.org/doc/html/rfc1924#section-4.2\n}\n\nexport type BaseXEncodeFunction = (source: BinInput, padToLength?: number) => string\nexport type BaseXDecodeFunction = (source: string, padToLength?: number) => Uint8Array\n\nexport function _useBase(alphaOrBase: string | number): {\n  encode: BaseXEncodeFunction\n  decode: BaseXDecodeFunction\n} {\n  let ALPHABET: string | undefined = (alphabets as any)[String(alphaOrBase)]\n\n  if (!ALPHABET) {\n    if (typeof alphaOrBase === 'string')\n      ALPHABET = alphaOrBase\n    else\n      throw new Error(`Unknown base ${alphaOrBase}`)\n  }\n\n  if (ALPHABET.length >= 255)\n    throw new TypeError('Alphabet too long')\n\n  const BASE_MAP = new Uint8Array(256)\n  for (let j = 0; j < BASE_MAP.length; j++)\n    BASE_MAP[j] = 255\n\n  for (let i = 0; i < ALPHABET.length; i++) {\n    const x = ALPHABET.charAt(i)\n    const xc = x.charCodeAt(0)\n\n    if (BASE_MAP[xc] !== 255)\n      throw new TypeError(`${x} is ambiguous`)\n    BASE_MAP[xc] = i\n  }\n\n  const BASE = ALPHABET.length\n  const LEADER = ALPHABET.charAt(0)\n  const FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n  const iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n\n  function encode(source: BinInput, padToLength = -1): string {\n    const data = toUint8Array(source)\n    if (data.byteLength === 0)\n      return ''\n\n    // Skip & count leading zeroes.\n    let length = 0\n    let pbegin = 0\n    const pend = data.byteLength\n\n    while (pbegin !== pend && data[pbegin] === 0) pbegin++\n\n    // Allocate enough space in big-endian base58 representation.\n    const size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n    const dataEncoded = new Uint8Array(size)\n\n    // Process the bytes.\n    while (pbegin !== pend) {\n      let carry = data[pbegin]\n\n      // Apply \"dataEncoded = dataEncoded * 256 + ch\".\n      let i = 0\n      for (\n        let it1 = size - 1;\n        (carry !== 0 || i < length) && it1 !== -1;\n        it1--, i++\n      ) {\n        carry += (256 * dataEncoded[it1]) >>> 0\n        dataEncoded[it1] = carry % BASE >>> 0\n        carry = (carry / BASE) >>> 0\n      }\n\n      if (carry !== 0) {\n        // log.warn('Non-zero carry', data, padToLength, i, size)\n        throw new Error('Non-zero carry')\n      }\n\n      length = i\n      pbegin++\n    }\n\n    let it2 = size - length\n\n    // Skip leading zeroes\n    while (it2 !== size && dataEncoded[it2] === 0) it2++\n\n    // Translate the result into a string.\n    let str = ''\n    for (; it2 < size; ++it2) str += ALPHABET!.charAt(dataEncoded[it2])\n\n    if (padToLength > 0) {\n      // const pad = Math.ceil(source.length * iFACTOR)\n      return str.padStart(padToLength, LEADER)\n    }\n    return str\n  }\n\n  function decode(source: string, padToLength = -1): Uint8Array {\n    if (typeof source !== 'string')\n      throw new TypeError('Expected String')\n    if (source.length === 0)\n      return new Uint8Array()\n\n    // Normalize\n    source = source.replace(/\\s+/g, '')\n\n    let psz = 0\n    let length = 0\n\n    while (source[psz] === LEADER) psz++\n\n    // Allocate enough space in big-endian base256 representation.\n    const size = ((source.length - psz) * FACTOR + 1) >>> 0 // log(58) / log(256), rounded up.\n    const dataDecoded = new Uint8Array(size)\n\n    // Process the characters.\n    while (source[psz]) {\n      let carry = BASE_MAP[source.charCodeAt(psz)]\n\n      // Invalid character\n      if (carry === 255)\n        throw new Error(`Unsupported character \"${source[psz]}\"`)\n\n      let i = 0\n      for (\n        let it3 = size - 1;\n        (carry !== 0 || i < length) && it3 !== -1;\n        it3--, i++\n      ) {\n        carry += (BASE * dataDecoded[it3]) >>> 0\n        dataDecoded[it3] = carry % 256 >>> 0\n        carry = (carry / 256) >>> 0\n      }\n\n      if (carry !== 0)\n        throw new Error('Non-zero carry')\n      length = i\n      psz++\n    }\n\n    // Skip leading zeroes\n    let it4 = size - length\n    while (it4 !== size && dataDecoded[it4] === 0) it4++\n\n    if (padToLength > 0) {\n      return new Uint8Array([\n        ...new Uint8Array(padToLength - dataDecoded.length + it4),\n        ...dataDecoded.slice(it4),\n      ])\n    }\n\n    return dataDecoded.slice(it4)\n  }\n\n  return {\n    encode,\n    decode,\n  }\n}\n\nlet cache: Map<number | string, any> | undefined\n\nexport function useBase(alphaOrBase: string | number) {\n  if (cache == null)\n    cache = new Map()\n\n  function getFromCache() {\n    let fn = cache!.get(alphaOrBase)\n    if (fn == null) {\n      fn = _useBase(alphaOrBase)\n      cache!.set(alphaOrBase, fn)\n    }\n    return fn\n  }\n\n  function encode(source: BinInput, padToLength = -1): string {\n    return getFromCache().encode(source, padToLength)\n  }\n\n  function decode(source: string, padToLength = -1): Uint8Array {\n    return getFromCache().decode(source, padToLength)\n  }\n\n  return { encode, decode }\n}\n\n// Shortcuts\n\nexport function encodeBase32(bin: BinInput, padding = -1) {\n  return useBase(32).encode(bin, padding)\n}\n\nexport function decodeBase32(s: string, padding = -1) {\n  return useBase(32).decode(s\n    .toLocaleLowerCase()\n    .replace(/l/g, '1')\n    .replace(/s/g, '5')\n    .replace(/o/g, '0')\n    .replace(/i/g, '1'), padding)\n}\n\nexport function encodeBase16(bin: BinInput, padding = -1) {\n  return useBase(16).encode(bin, padding)\n}\n\nexport function decodeBase16(s: string, padding = -1) {\n  return useBase(16).decode(s, padding)\n}\n\nexport function encodeBase58(bin: BinInput, padding = -1) {\n  return useBase(58).encode(bin, padding)\n}\n\nexport function decodeBase58(s: string, padding = -1) {\n  return useBase(58).decode(s, padding)\n}\n\nexport function encodeBase62(bin: BinInput, padding = -1) {\n  return useBase(62).encode(bin, padding)\n}\n\nexport function decodeBase62(s: string, padding = -1) {\n  return useBase(62).decode(s, padding)\n}\n\nexport function estimateSizeForBase(bytes: number, base: number) {\n  return Math.ceil(bytes * (Math.log(256) / Math.log(base)))\n}\n"],"mappings":"6GAcM,EAAY,CAChB,EAAK,KACL,EAAK,WACL,GAAM,cACN,GAAM,mBACN,GAAM,mCACN,eAAgB,mCAChB,aAAc,mCACd,cAAe,mCACf,SAAU,mCACV,SAAU,mCACV,WAAY,mCACZ,GAAM,uCACN,GAAM,6DACN,GAAM,iEACN,GAAM,mEACN,SAAU,mEACV,GAAM,sEACN,GAAM,wFACP,CAKD,SAAgB,EAAS,EAGvB,CACA,IAAI,EAAgC,EAAkB,OAAO,EAAY,EAEzE,GAAI,CAAC,EACH,GAAI,OAAO,GAAgB,SACzB,EAAW,OAEX,MAAU,MAAM,gBAAgB,IAAc,CAGlD,GAAI,EAAS,QAAU,IACrB,MAAU,UAAU,oBAAoB,CAE1C,IAAM,EAAW,IAAI,WAAW,IAAI,CACpC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAS,OAAQ,IACnC,EAAS,GAAK,IAEhB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAS,OAAQ,IAAK,CACxC,IAAM,EAAI,EAAS,OAAO,EAAE,CACtB,EAAK,EAAE,WAAW,EAAE,CAE1B,GAAI,EAAS,KAAQ,IACnB,MAAU,UAAU,GAAG,EAAE,eAAe,CAC1C,EAAS,GAAM,EAGjB,IAAM,EAAO,EAAS,OAChB,EAAS,EAAS,OAAO,EAAE,CAC3B,EAAS,KAAK,IAAI,EAAK,CAAG,KAAK,IAAI,IAAI,CACvC,EAAU,KAAK,IAAI,IAAI,CAAG,KAAK,IAAI,EAAK,CAE9C,SAAS,EAAO,EAAkB,EAAc,GAAY,CAC1D,IAAM,EAAOA,EAAAA,EAAa,EAAO,CACjC,GAAI,EAAK,aAAe,EACtB,MAAO,GAGT,IAAI,EAAS,EACT,EAAS,EACP,EAAO,EAAK,WAElB,KAAO,IAAW,GAAQ,EAAK,KAAY,GAAG,IAG9C,IAAM,GAAS,EAAO,GAAU,EAAU,IAAO,EAC3C,EAAc,IAAI,WAAW,EAAK,CAGxC,KAAO,IAAW,GAAM,CACtB,IAAI,EAAQ,EAAK,GAGb,EAAI,EACR,IACE,IAAI,EAAM,EAAO,GAChB,IAAU,GAAK,EAAI,IAAW,IAAQ,GACvC,IAAO,IAEP,GAAU,IAAM,EAAY,KAAU,EACtC,EAAY,GAAO,EAAQ,IAAS,EACpC,EAAS,EAAQ,IAAU,EAG7B,GAAI,IAAU,EAEZ,MAAU,MAAM,iBAAiB,CAGnC,EAAS,EACT,IAGF,IAAI,EAAM,EAAO,EAGjB,KAAO,IAAQ,GAAQ,EAAY,KAAS,GAAG,IAG/C,IAAI,EAAM,GACV,KAAO,EAAM,EAAM,EAAE,EAAK,GAAO,EAAU,OAAO,EAAY,GAAK,CAMnE,OAJI,EAAc,EAET,EAAI,SAAS,EAAa,EAAO,CAEnC,EAGT,SAAS,EAAO,EAAgB,EAAc,GAAgB,CAC5D,GAAI,OAAO,GAAW,SACpB,MAAU,UAAU,kBAAkB,CACxC,GAAI,EAAO,SAAW,EACpB,OAAO,IAAI,WAGb,EAAS,EAAO,QAAQ,OAAQ,GAAG,CAEnC,IAAI,EAAM,EACN,EAAS,EAEb,KAAO,EAAO,KAAS,GAAQ,IAG/B,IAAM,GAAS,EAAO,OAAS,GAAO,EAAS,IAAO,EAChD,EAAc,IAAI,WAAW,EAAK,CAGxC,KAAO,EAAO,IAAM,CAClB,IAAI,EAAQ,EAAS,EAAO,WAAW,EAAI,EAG3C,GAAI,IAAU,IACZ,MAAU,MAAM,0BAA0B,EAAO,GAAK,GAAG,CAE3D,IAAI,EAAI,EACR,IACE,IAAI,EAAM,EAAO,GAChB,IAAU,GAAK,EAAI,IAAW,IAAQ,GACvC,IAAO,IAEP,GAAU,EAAO,EAAY,KAAU,EACvC,EAAY,GAAO,EAAQ,MAAQ,EACnC,EAAS,EAAQ,MAAS,EAG5B,GAAI,IAAU,EACZ,MAAU,MAAM,iBAAiB,CACnC,EAAS,EACT,IAIF,IAAI,EAAM,EAAO,EACjB,KAAO,IAAQ,GAAQ,EAAY,KAAS,GAAG,IAS/C,OAPI,EAAc,EACT,IAAI,WAAW,CACpB,GAAG,IAAI,WAAW,EAAc,EAAY,OAAS,EAAI,CACzD,GAAG,EAAY,MAAM,EAAI,CAC1B,CAAC,CAGG,EAAY,MAAM,EAAI,CAG/B,MAAO,CACL,SACA,SACD,CAGH,IAAI,EAEJ,SAAgB,EAAQ,EAA8B,CACpD,AACE,IAAQ,IAAI,IAEd,SAAS,GAAe,CACtB,IAAI,EAAK,EAAO,IAAI,EAAY,CAKhC,OAJI,IACF,EAAK,EAAS,EAAY,CAC1B,EAAO,IAAI,EAAa,EAAG,EAEtB,EAGT,SAAS,EAAO,EAAkB,EAAc,GAAY,CAC1D,OAAO,GAAc,CAAC,OAAO,EAAQ,EAAY,CAGnD,SAAS,EAAO,EAAgB,EAAc,GAAgB,CAC5D,OAAO,GAAc,CAAC,OAAO,EAAQ,EAAY,CAGnD,MAAO,CAAE,SAAQ,SAAQ,CAK3B,SAAgB,EAAa,EAAe,EAAU,GAAI,CACxD,OAAO,EAAQ,GAAG,CAAC,OAAO,EAAK,EAAQ,CAGzC,SAAgB,EAAa,EAAW,EAAU,GAAI,CACpD,OAAO,EAAQ,GAAG,CAAC,OAAO,EACvB,mBAAmB,CACnB,QAAQ,KAAM,IAAI,CAClB,QAAQ,KAAM,IAAI,CAClB,QAAQ,KAAM,IAAI,CAClB,QAAQ,KAAM,IAAI,CAAE,EAAQ,CAGjC,SAAgB,EAAa,EAAe,EAAU,GAAI,CACxD,OAAO,EAAQ,GAAG,CAAC,OAAO,EAAK,EAAQ,CAGzC,SAAgB,EAAa,EAAW,EAAU,GAAI,CACpD,OAAO,EAAQ,GAAG,CAAC,OAAO,EAAG,EAAQ,CAGvC,SAAgB,EAAa,EAAe,EAAU,GAAI,CACxD,OAAO,EAAQ,GAAG,CAAC,OAAO,EAAK,EAAQ,CAGzC,SAAgB,EAAa,EAAW,EAAU,GAAI,CACpD,OAAO,EAAQ,GAAG,CAAC,OAAO,EAAG,EAAQ,CAGvC,SAAgB,EAAa,EAAe,EAAU,GAAI,CACxD,OAAO,EAAQ,GAAG,CAAC,OAAO,EAAK,EAAQ,CAGzC,SAAgB,EAAa,EAAW,EAAU,GAAI,CACpD,OAAO,EAAQ,GAAG,CAAC,OAAO,EAAG,EAAQ,CAGvC,SAAgB,EAAoB,EAAe,EAAc,CAC/D,OAAO,KAAK,KAAc,KAAK,IAAI,IAAI,CAAG,KAAK,IAAI,EAAK,CAAvC,EAAyC"}

package/dist/common/data/basex.d.cts

@@ -1,23 +1,2 @@
-import { BinInput } from './bin-types.cjs';
-
-type BaseXEncodeFunction = (source: BinInput, padToLength?: number) => string;
-type BaseXDecodeFunction = (source: string, padToLength?: number) => Uint8Array;
-declare function _useBase(alphaOrBase: string | number): {
-    encode: BaseXEncodeFunction;
-    decode: BaseXDecodeFunction;
-};
-declare function useBase(alphaOrBase: string | number): {
-    encode: (source: BinInput, padToLength?: number) => string;
-    decode: (source: string, padToLength?: number) => Uint8Array;
-};
-declare function encodeBase32(bin: BinInput, padding?: number): string;
-declare function decodeBase32(s: string, padding?: number): Uint8Array<ArrayBufferLike>;
-declare function encodeBase16(bin: BinInput, padding?: number): string;
-declare function decodeBase16(s: string, padding?: number): Uint8Array<ArrayBufferLike>;
-declare function encodeBase58(bin: BinInput, padding?: number): string;
-declare function decodeBase58(s: string, padding?: number): Uint8Array<ArrayBufferLike>;
-declare function encodeBase62(bin: BinInput, padding?: number): string;
-declare function decodeBase62(s: string, padding?: number): Uint8Array<ArrayBufferLike>;
-declare function estimateSizeForBase(bytes: number, base: number): number;
-
-export { type BaseXDecodeFunction, type BaseXEncodeFunction, _useBase, decodeBase16, decodeBase32, decodeBase58, decodeBase62, encodeBase16, encodeBase32, encodeBase58, encodeBase62, estimateSizeForBase, useBase };
+import { a as decodeBase32, c as encodeBase16, d as encodeBase62, f as estimateSizeForBase, i as decodeBase16, l as encodeBase32, n as BaseXEncodeFunction, o as decodeBase58, p as useBase, r as _useBase, s as decodeBase62, t as BaseXDecodeFunction, u as encodeBase58 } from "../../basex-csOMK5K7.cjs";
+export { BaseXDecodeFunction, BaseXEncodeFunction, _useBase, decodeBase16, decodeBase32, decodeBase58, decodeBase62, encodeBase16, encodeBase32, encodeBase58, encodeBase62, estimateSizeForBase, useBase };

package/dist/common/data/basex.d.mts

@@ -0,0 +1,2 @@
+import { a as decodeBase32, c as encodeBase16, d as encodeBase62, f as estimateSizeForBase, i as decodeBase16, l as encodeBase32, n as BaseXEncodeFunction, o as decodeBase58, p as useBase, r as _useBase, s as decodeBase62, t as BaseXDecodeFunction, u as encodeBase58 } from "../../basex-D8lNbS7O.mjs";
+export { BaseXDecodeFunction, BaseXEncodeFunction, _useBase, decodeBase16, decodeBase32, decodeBase58, decodeBase62, encodeBase16, encodeBase32, encodeBase58, encodeBase62, estimateSizeForBase, useBase };

package/dist/common/data/basex.mjs

@@ -0,0 +1,2 @@
+import{v as e}from"../../bin-SPdenYkw.mjs";const t={2:`01`,8:`01234567`,11:`0123456789a`,16:`0123456789abcdef`,32:`0123456789abcdefghjkmnpqrtuvwxyz`,"32-crockford":`0123456789ABCDEFGHJKMNPQRSTVWXYZ`,"32-geohash":`0123456789bcdefghjkmnpqrstuvwxyz`,"32-agnoster":`0123456789abcdefghjkmnpqrtuvwxyz`,"32-rfc":`ABCDEFGHIJKLMNOPQRSTUVWXYZ234567`,"32-hex":`0123456789ABCDEFGHIJKLMNOPQRSTUV`,"32-zbase":`ybndrfg8ejkmcpqxot1uwisza345h769`,36:`0123456789abcdefghijklmnopqrstuvwxyz`,58:`123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz`,62:`0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz`,64:`ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/`,"64-url":`ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_`,66:`ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_.!~`,85:"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{|}~"};function n(n){let r=t[String(n)];if(!r)if(typeof n==`string`)r=n;else throw Error(`Unknown base ${n}`);if(r.length>=255)throw TypeError(`Alphabet too long`);let i=new Uint8Array(256);for(let e=0;e<i.length;e++)i[e]=255;for(let e=0;e<r.length;e++){let t=r.charAt(e),n=t.charCodeAt(0);if(i[n]!==255)throw TypeError(`${t} is ambiguous`);i[n]=e}let a=r.length,o=r.charAt(0),s=Math.log(a)/Math.log(256),c=Math.log(256)/Math.log(a);function l(t,n=-1){let i=e(t);if(i.byteLength===0)return``;let s=0,l=0,u=i.byteLength;for(;l!==u&&i[l]===0;)l++;let d=(u-l)*c+1>>>0,f=new Uint8Array(d);for(;l!==u;){let e=i[l],t=0;for(let n=d-1;(e!==0||t<s)&&n!==-1;n--,t++)e+=256*f[n]>>>0,f[n]=e%a>>>0,e=e/a>>>0;if(e!==0)throw Error(`Non-zero carry`);s=t,l++}let p=d-s;for(;p!==d&&f[p]===0;)p++;let m=``;for(;p<d;++p)m+=r.charAt(f[p]);return n>0?m.padStart(n,o):m}function u(e,t=-1){if(typeof e!=`string`)throw TypeError(`Expected String`);if(e.length===0)return new Uint8Array;e=e.replace(/\s+/g,``);let n=0,r=0;for(;e[n]===o;)n++;let c=(e.length-n)*s+1>>>0,l=new Uint8Array(c);for(;e[n];){let t=i[e.charCodeAt(n)];if(t===255)throw Error(`Unsupported character "${e[n]}"`);let o=0;for(let e=c-1;(t!==0||o<r)&&e!==-1;e--,o++)t+=a*l[e]>>>0,l[e]=t%256>>>0,t=t/256>>>0;if(t!==0)throw Error(`Non-zero carry`);r=o,n++}let u=c-r;for(;u!==c&&l[u]===0;)u++;return t>0?new Uint8Array([...new Uint8Array(t-l.length+u),...l.slice(u)]):l.slice(u)}return{encode:l,decode:u}}let r;function i(e){r??=new Map;function t(){let t=r.get(e);return t??(t=n(e),r.set(e,t)),t}function i(e,n=-1){return t().encode(e,n)}function a(e,n=-1){return t().decode(e,n)}return{encode:i,decode:a}}function a(e,t=-1){return i(32).encode(e,t)}function o(e,t=-1){return i(32).decode(e.toLocaleLowerCase().replace(/l/g,`1`).replace(/s/g,`5`).replace(/o/g,`0`).replace(/i/g,`1`),t)}function s(e,t=-1){return i(16).encode(e,t)}function c(e,t=-1){return i(16).decode(e,t)}function l(e,t=-1){return i(58).encode(e,t)}function u(e,t=-1){return i(58).decode(e,t)}function d(e,t=-1){return i(62).encode(e,t)}function f(e,t=-1){return i(62).decode(e,t)}function p(e,t){return Math.ceil(Math.log(256)/Math.log(t)*e)}export{n as _useBase,c as decodeBase16,o as decodeBase32,u as decodeBase58,f as decodeBase62,s as encodeBase16,a as encodeBase32,l as encodeBase58,d as encodeBase62,p as estimateSizeForBase,i as useBase};
+//# sourceMappingURL=basex.mjs.map