zeed 1.2.2 → 1.3.0

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

@@ -0,0 +1 @@
+{"version":3,"file":"sortable.mjs","names":[],"sources":["../../../src/common/data/sortable.ts"],"sourcesContent":["import { getSecureRandomIfPossible } from './math'\n\n// Get a sort_weight suitable for adding to top of list\n// Original idea https://holtwick.de/en/blog/smart-table-reordering\n\nexport interface SortableItem {\n  sort_weight: number\n}\n\nexport function startSortWeight(items: SortableItem[]): number {\n  return (\n    items.reduce((acc, item) => Math.min(acc, item.sort_weight || 0), 0)\n    - 1\n    - getSecureRandomIfPossible()\n  )\n}\n\n// Get a sort_weight suitable for adding to end of list\nexport function endSortWeight(items: SortableItem[]): number {\n  return (\n    items.reduce((acc, item) => Math.max(acc, item.sort_weight || 0), 0)\n    + 1\n    + getSecureRandomIfPossible()\n  )\n}\n\n// The real magic\nexport function moveSortWeight(\n  newIndex: number,\n  oldIndex: number,\n  items: SortableItem[],\n): number {\n  const count = items.length\n\n  const moveLower = newIndex < oldIndex\n  if (count <= 0 || newIndex >= count - 1)\n    return endSortWeight(items)\n\n  if (newIndex <= 0)\n    return startSortWeight(items)\n\n  // Make sure they are sorted\n  items = sortedItems([...items])\n\n  const step = moveLower ? -1 : 0 // use Math.sign(?) for performance?\n  const lower = items[newIndex + step].sort_weight || 0\n  const upper = items[newIndex + step + 1].sort_weight || 0\n  const distance = upper - lower\n  if (distance === 0) {\n    // Ugly list with no presets, make the best guess\n    if (moveLower)\n      return startSortWeight(items)\n\n    return endSortWeight(items)\n  }\n  const middle = lower + distance / 2\n  const fuzzy = distance * 0.01 * (getSecureRandomIfPossible() - 0.5) // 1% fuzziness to avoid conflicts\n  return middle + fuzzy\n}\n\nexport function sortedItems<T extends SortableItem>(items: T[]): T[] {\n  items.sort((a, b) => (a.sort_weight || 0) - (b.sort_weight || 0))\n  return items\n}\n"],"mappings":"uDASA,SAAgB,EAAgB,EAA+B,CAC7D,OACE,EAAM,QAAQ,EAAK,IAAS,KAAK,IAAI,EAAK,EAAK,aAAe,EAAE,CAAE,EAAE,CAClE,EACA,GAA2B,CAKjC,SAAgB,EAAc,EAA+B,CAC3D,OACE,EAAM,QAAQ,EAAK,IAAS,KAAK,IAAI,EAAK,EAAK,aAAe,EAAE,CAAE,EAAE,CAClE,EACA,GAA2B,CAKjC,SAAgB,EACd,EACA,EACA,EACQ,CACR,IAAM,EAAQ,EAAM,OAEd,EAAY,EAAW,EAC7B,GAAI,GAAS,GAAK,GAAY,EAAQ,EACpC,OAAO,EAAc,EAAM,CAE7B,GAAI,GAAY,EACd,OAAO,EAAgB,EAAM,CAG/B,EAAQ,EAAY,CAAC,GAAG,EAAM,CAAC,CAE/B,IAAM,EAAO,EAAY,GAAK,EACxB,EAAQ,EAAM,EAAW,GAAM,aAAe,EAE9C,GADQ,EAAM,EAAW,EAAO,GAAG,aAAe,GAC/B,EAUzB,OATI,IAAa,EAEX,EACK,EAAgB,EAAM,CAExB,EAAc,EAAM,CAEd,EAAQ,EAAW,EACpB,EAAW,KAAQ,GAA2B,CAAG,IAIjE,SAAgB,EAAoC,EAAiB,CAEnE,OADA,EAAM,MAAM,EAAG,KAAO,EAAE,aAAe,IAAM,EAAE,aAAe,GAAG,CAC1D"}

package/dist/common/data/sorted.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkCHR4BOAAcjs = require('../../chunk-CHR4BOAA.cjs');require('../../chunk-UXW3L3L6.cjs');require('../../chunk-P7XCQ7WV.cjs');exports.useSorted = _chunkCHR4BOAAcjs.a;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`./math.cjs`);function t(t={}){let{getter:n=e=>e.sort}=t;function r(e){return e.sort((e,t)=>(n(e)||0)-(n(t)||0)),e}function i(t){return t.reduce((e,t)=>Math.min(e,n(t)||0),0)-1-e.getSecureRandomIfPossible()}function a(t){return t.reduce((e,t)=>Math.max(e,n(t)||0),0)+1+e.getSecureRandomIfPossible()}function o(t,n){t??=(n??0)-1,n??=(t??0)+1;let r=n-t;return t+r/2+r*.01*(e.getSecureRandomIfPossible()-.5)}function s(t,o,s){let c=s.length,l=t<o;if(c<=0||t>=c-1)return a(s);if(t<=0)return i(s);s=r([...s]);let u=l?-1:0,d=n(s[t+u])||0,f=(n(s[t+u+1])||0)-d;return f===0?l?i(s):a(s):d+f/2+f*.01*(e.getSecureRandomIfPossible()-.5)}return{start:i,end:a,between:o,move:s,items:r}}exports.useSorted=t;
 //# sourceMappingURL=sorted.cjs.map

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

@@ -1 +1 @@
-{"version":3,"sources":["/Users/dirk/work/github-zeed/dist/common/data/sorted.cjs"],"names":[],"mappings":"AAAA,qIAAuC,oCAAiC,oCAAiC,wCAAuB","file":"/Users/dirk/work/github-zeed/dist/common/data/sorted.cjs"}
+{"version":3,"file":"sorted.cjs","names":["getSecureRandomIfPossible"],"sources":["../../../src/common/data/sorted.ts"],"sourcesContent":["import { getSecureRandomIfPossible } from './math'\n\n/** CRDT compatible sorting with a single operation. Default name is `sort` */\nexport function useSorted<S extends Record<string, any>>(\n  config: {\n    getter?: (item: S) => number\n    // setter?: (item: S, value: number) => void\n  } = {},\n) {\n  const {\n    getter = (item: any): number => item.sort,\n    // setter = (item: any, value) => (item.sort = value),\n  } = config\n\n  /** Return sorted list from low to high. */\n  function items<T extends S>(items: T[]): T[] {\n    items.sort((a, b) => (getter(a) || 0) - (getter(b) || 0))\n    return items\n  }\n\n  /** Get a sort suitable for adding to start of list. */\n  function start(items: S[]): number {\n    return (\n      items.reduce((acc, item) => Math.min(acc, getter(item) || 0), 0) - 1 - getSecureRandomIfPossible()\n    )\n  }\n\n  /** Get a sort suitable for adding to end of list. */\n  function end(items: S[]): number {\n    return (\n      items.reduce((acc, item) => Math.max(acc, getter(item) || 0), 0) + 1 + getSecureRandomIfPossible()\n    )\n  }\n\n  /** Find a suitable value inbetween a lower and upper bound. */\n  function between(lower?: number, upper?: number): number {\n    if (lower == null)\n      lower = (upper ?? 0) - 1\n    if (upper == null)\n      upper = (lower ?? 0) + 1\n\n    const distance = upper - lower\n    // if (distance === 0)\n\n    const middle = lower + distance / 2\n    const fuzzy = distance * 0.01 * (getSecureRandomIfPossible() - 0.5) // 1% fuzziness to avoid conflicts\n    return middle + fuzzy\n  }\n\n  /** Mainly for drag and drop movements, where an item has to be moved to another index. Respects its own move as well. */\n  function move(\n    newIndex: number,\n    oldIndex: number,\n    sortableItems: S[],\n  ): number {\n    const count = sortableItems.length\n\n    const moveLower = newIndex < oldIndex\n    if (count <= 0 || newIndex >= count - 1)\n      return end(sortableItems)\n\n    if (newIndex <= 0)\n      return start(sortableItems)\n\n    // Make sure they are sorted\n    sortableItems = items([...sortableItems])\n\n    const step = moveLower ? -1 : 0 // use Math.sign(?) for performance?\n    const lower = getter(sortableItems[newIndex + step]) || 0\n    const upper = getter(sortableItems[newIndex + step + 1]) || 0\n    const distance = upper - lower\n    if (distance === 0) {\n      // Ugly list with no presets, make the best guess\n      if (moveLower)\n        return start(sortableItems)\n\n      return end(sortableItems)\n    }\n    const middle = lower + distance / 2\n    const fuzzy = distance * 0.01 * (getSecureRandomIfPossible() - 0.5) // 1% fuzziness to avoid conflicts\n    return middle + fuzzy\n  }\n\n  return {\n    start,\n    end,\n    between,\n    move,\n    items,\n  }\n}\n"],"mappings":"iGAGA,SAAgB,EACd,EAGI,EAAE,CACN,CACA,GAAM,CACJ,SAAU,GAAsB,EAAK,MAEnC,EAGJ,SAAS,EAAmB,EAAiB,CAE3C,OADA,EAAM,MAAM,EAAG,KAAO,EAAO,EAAE,EAAI,IAAM,EAAO,EAAE,EAAI,GAAG,CAClD,EAIT,SAAS,EAAM,EAAoB,CACjC,OACE,EAAM,QAAQ,EAAK,IAAS,KAAK,IAAI,EAAK,EAAO,EAAK,EAAI,EAAE,CAAE,EAAE,CAAG,EAAIA,EAAAA,2BAA2B,CAKtG,SAAS,EAAI,EAAoB,CAC/B,OACE,EAAM,QAAQ,EAAK,IAAS,KAAK,IAAI,EAAK,EAAO,EAAK,EAAI,EAAE,CAAE,EAAE,CAAG,EAAIA,EAAAA,2BAA2B,CAKtG,SAAS,EAAQ,EAAgB,EAAwB,CACvD,AACE,KAAS,GAAS,GAAK,EACzB,AACE,KAAS,GAAS,GAAK,EAEzB,IAAM,EAAW,EAAQ,EAKzB,OAFe,EAAQ,EAAW,EACpB,EAAW,KAAQA,EAAAA,2BAA2B,CAAG,IAKjE,SAAS,EACP,EACA,EACA,EACQ,CACR,IAAM,EAAQ,EAAc,OAEtB,EAAY,EAAW,EAC7B,GAAI,GAAS,GAAK,GAAY,EAAQ,EACpC,OAAO,EAAI,EAAc,CAE3B,GAAI,GAAY,EACd,OAAO,EAAM,EAAc,CAG7B,EAAgB,EAAM,CAAC,GAAG,EAAc,CAAC,CAEzC,IAAM,EAAO,EAAY,GAAK,EACxB,EAAQ,EAAO,EAAc,EAAW,GAAM,EAAI,EAElD,GADQ,EAAO,EAAc,EAAW,EAAO,GAAG,EAAI,GACnC,EAUzB,OATI,IAAa,EAEX,EACK,EAAM,EAAc,CAEtB,EAAI,EAAc,CAEZ,EAAQ,EAAW,EACpB,EAAW,KAAQA,EAAAA,2BAA2B,CAAG,IAIjE,MAAO,CACL,QACA,MACA,UACA,OACA,QACD"}

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

@@ -1,12 +1,2 @@
-/** CRDT compatible sorting with a single operation. Default name is `sort` */
-declare function useSorted<S extends Record<string, any>>(config?: {
-    getter?: (item: S) => number;
-}): {
-    start: (items: S[]) => number;
-    end: (items: S[]) => number;
-    between: (lower?: number, upper?: number) => number;
-    move: (newIndex: number, oldIndex: number, sortableItems: S[]) => number;
-    items: <T extends S>(items: T[]) => T[];
-};
-
-export { useSorted };
+import { t as useSorted } from "../../sorted-Courj5_n.cjs";
+export { useSorted };

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

@@ -0,0 +1,2 @@
+import { t as useSorted } from "../../sorted-CmOkJROt.mjs";
+export { useSorted };

package/dist/common/data/sorted.mjs

@@ -0,0 +1,2 @@
+import{getSecureRandomIfPossible as e}from"./math.mjs";function t(t={}){let{getter:n=e=>e.sort}=t;function r(e){return e.sort((e,t)=>(n(e)||0)-(n(t)||0)),e}function i(t){return t.reduce((e,t)=>Math.min(e,n(t)||0),0)-1-e()}function a(t){return t.reduce((e,t)=>Math.max(e,n(t)||0),0)+1+e()}function o(t,n){t??=(n??0)-1,n??=(t??0)+1;let r=n-t;return t+r/2+r*.01*(e()-.5)}function s(t,o,s){let c=s.length,l=t<o;if(c<=0||t>=c-1)return a(s);if(t<=0)return i(s);s=r([...s]);let u=l?-1:0,d=n(s[t+u])||0,f=(n(s[t+u+1])||0)-d;return f===0?l?i(s):a(s):d+f/2+f*.01*(e()-.5)}return{start:i,end:a,between:o,move:s,items:r}}export{t as useSorted};
+//# sourceMappingURL=sorted.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sorted.mjs","names":[],"sources":["../../../src/common/data/sorted.ts"],"sourcesContent":["import { getSecureRandomIfPossible } from './math'\n\n/** CRDT compatible sorting with a single operation. Default name is `sort` */\nexport function useSorted<S extends Record<string, any>>(\n  config: {\n    getter?: (item: S) => number\n    // setter?: (item: S, value: number) => void\n  } = {},\n) {\n  const {\n    getter = (item: any): number => item.sort,\n    // setter = (item: any, value) => (item.sort = value),\n  } = config\n\n  /** Return sorted list from low to high. */\n  function items<T extends S>(items: T[]): T[] {\n    items.sort((a, b) => (getter(a) || 0) - (getter(b) || 0))\n    return items\n  }\n\n  /** Get a sort suitable for adding to start of list. */\n  function start(items: S[]): number {\n    return (\n      items.reduce((acc, item) => Math.min(acc, getter(item) || 0), 0) - 1 - getSecureRandomIfPossible()\n    )\n  }\n\n  /** Get a sort suitable for adding to end of list. */\n  function end(items: S[]): number {\n    return (\n      items.reduce((acc, item) => Math.max(acc, getter(item) || 0), 0) + 1 + getSecureRandomIfPossible()\n    )\n  }\n\n  /** Find a suitable value inbetween a lower and upper bound. */\n  function between(lower?: number, upper?: number): number {\n    if (lower == null)\n      lower = (upper ?? 0) - 1\n    if (upper == null)\n      upper = (lower ?? 0) + 1\n\n    const distance = upper - lower\n    // if (distance === 0)\n\n    const middle = lower + distance / 2\n    const fuzzy = distance * 0.01 * (getSecureRandomIfPossible() - 0.5) // 1% fuzziness to avoid conflicts\n    return middle + fuzzy\n  }\n\n  /** Mainly for drag and drop movements, where an item has to be moved to another index. Respects its own move as well. */\n  function move(\n    newIndex: number,\n    oldIndex: number,\n    sortableItems: S[],\n  ): number {\n    const count = sortableItems.length\n\n    const moveLower = newIndex < oldIndex\n    if (count <= 0 || newIndex >= count - 1)\n      return end(sortableItems)\n\n    if (newIndex <= 0)\n      return start(sortableItems)\n\n    // Make sure they are sorted\n    sortableItems = items([...sortableItems])\n\n    const step = moveLower ? -1 : 0 // use Math.sign(?) for performance?\n    const lower = getter(sortableItems[newIndex + step]) || 0\n    const upper = getter(sortableItems[newIndex + step + 1]) || 0\n    const distance = upper - lower\n    if (distance === 0) {\n      // Ugly list with no presets, make the best guess\n      if (moveLower)\n        return start(sortableItems)\n\n      return end(sortableItems)\n    }\n    const middle = lower + distance / 2\n    const fuzzy = distance * 0.01 * (getSecureRandomIfPossible() - 0.5) // 1% fuzziness to avoid conflicts\n    return middle + fuzzy\n  }\n\n  return {\n    start,\n    end,\n    between,\n    move,\n    items,\n  }\n}\n"],"mappings":"uDAGA,SAAgB,EACd,EAGI,EAAE,CACN,CACA,GAAM,CACJ,SAAU,GAAsB,EAAK,MAEnC,EAGJ,SAAS,EAAmB,EAAiB,CAE3C,OADA,EAAM,MAAM,EAAG,KAAO,EAAO,EAAE,EAAI,IAAM,EAAO,EAAE,EAAI,GAAG,CAClD,EAIT,SAAS,EAAM,EAAoB,CACjC,OACE,EAAM,QAAQ,EAAK,IAAS,KAAK,IAAI,EAAK,EAAO,EAAK,EAAI,EAAE,CAAE,EAAE,CAAG,EAAI,GAA2B,CAKtG,SAAS,EAAI,EAAoB,CAC/B,OACE,EAAM,QAAQ,EAAK,IAAS,KAAK,IAAI,EAAK,EAAO,EAAK,EAAI,EAAE,CAAE,EAAE,CAAG,EAAI,GAA2B,CAKtG,SAAS,EAAQ,EAAgB,EAAwB,CACvD,AACE,KAAS,GAAS,GAAK,EACzB,AACE,KAAS,GAAS,GAAK,EAEzB,IAAM,EAAW,EAAQ,EAKzB,OAFe,EAAQ,EAAW,EACpB,EAAW,KAAQ,GAA2B,CAAG,IAKjE,SAAS,EACP,EACA,EACA,EACQ,CACR,IAAM,EAAQ,EAAc,OAEtB,EAAY,EAAW,EAC7B,GAAI,GAAS,GAAK,GAAY,EAAQ,EACpC,OAAO,EAAI,EAAc,CAE3B,GAAI,GAAY,EACd,OAAO,EAAM,EAAc,CAG7B,EAAgB,EAAM,CAAC,GAAG,EAAc,CAAC,CAEzC,IAAM,EAAO,EAAY,GAAK,EACxB,EAAQ,EAAO,EAAc,EAAW,GAAM,EAAI,EAElD,GADQ,EAAO,EAAc,EAAW,EAAO,GAAG,EAAI,GACnC,EAUzB,OATI,IAAa,EAEX,EACK,EAAM,EAAc,CAEtB,EAAI,EAAc,CAEZ,EAAQ,EAAW,EACpB,EAAW,KAAQ,GAA2B,CAAG,IAIjE,MAAO,CACL,QACA,MACA,UACA,OACA,QACD"}

package/dist/common/data/string-deburr.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkKFNJHRCBcjs = require('../../chunk-KFNJHRCB.cjs');require('../../chunk-P7XCQ7WV.cjs');exports.deburr = _chunkKFNJHRCBcjs.a;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});function e(e){return t=>e?.[t]}const t={À:`A`,Á:`A`,Â:`A`,Ã:`A`,Ä:`A`,Å:`A`,à:`a`,á:`a`,â:`a`,ã:`a`,ä:`a`,å:`a`,Ç:`C`,ç:`c`,Ð:`D`,ð:`d`,È:`E`,É:`E`,Ê:`E`,Ë:`E`,è:`e`,é:`e`,ê:`e`,ë:`e`,Ì:`I`,Í:`I`,Î:`I`,Ï:`I`,ì:`i`,í:`i`,î:`i`,ï:`i`,Ñ:`N`,ñ:`n`,Ò:`O`,Ó:`O`,Ô:`O`,Õ:`O`,Ö:`O`,Ø:`O`,ò:`o`,ó:`o`,ô:`o`,õ:`o`,ö:`o`,ø:`o`,Ù:`U`,Ú:`U`,Û:`U`,Ü:`U`,ù:`u`,ú:`u`,û:`u`,ü:`u`,Ý:`Y`,ý:`y`,ÿ:`y`,Æ:`Ae`,æ:`ae`,Þ:`Th`,þ:`th`,ß:`ss`,Ā:`A`,Ă:`A`,Ą:`A`,ā:`a`,ă:`a`,ą:`a`,Ć:`C`,Ĉ:`C`,Ċ:`C`,Č:`C`,ć:`c`,ĉ:`c`,ċ:`c`,č:`c`,Ď:`D`,Đ:`D`,ď:`d`,đ:`d`,Ē:`E`,Ĕ:`E`,Ė:`E`,Ę:`E`,Ě:`E`,ē:`e`,ĕ:`e`,ė:`e`,ę:`e`,ě:`e`,Ĝ:`G`,Ğ:`G`,Ġ:`G`,Ģ:`G`,ĝ:`g`,ğ:`g`,ġ:`g`,ģ:`g`,Ĥ:`H`,Ħ:`H`,ĥ:`h`,ħ:`h`,Ĩ:`I`,Ī:`I`,Ĭ:`I`,Į:`I`,İ:`I`,ĩ:`i`,ī:`i`,ĭ:`i`,į:`i`,ı:`i`,Ĵ:`J`,ĵ:`j`,Ķ:`K`,ķ:`k`,ĸ:`k`,Ĺ:`L`,Ļ:`L`,Ľ:`L`,Ŀ:`L`,Ł:`L`,ĺ:`l`,ļ:`l`,ľ:`l`,ŀ:`l`,ł:`l`,Ń:`N`,Ņ:`N`,Ň:`N`,Ŋ:`N`,ń:`n`,ņ:`n`,ň:`n`,ŋ:`n`,Ō:`O`,Ŏ:`O`,Ő:`O`,ō:`o`,ŏ:`o`,ő:`o`,Ŕ:`R`,Ŗ:`R`,Ř:`R`,ŕ:`r`,ŗ:`r`,ř:`r`,Ś:`S`,Ŝ:`S`,Ş:`S`,Š:`S`,ś:`s`,ŝ:`s`,ş:`s`,š:`s`,Ţ:`T`,Ť:`T`,Ŧ:`T`,ţ:`t`,ť:`t`,ŧ:`t`,Ũ:`U`,Ū:`U`,Ŭ:`U`,Ů:`U`,Ű:`U`,Ų:`U`,ũ:`u`,ū:`u`,ŭ:`u`,ů:`u`,ű:`u`,ų:`u`,Ŵ:`W`,ŵ:`w`,Ŷ:`Y`,ŷ:`y`,Ÿ:`Y`,Ź:`Z`,Ż:`Z`,Ž:`Z`,ź:`z`,ż:`z`,ž:`z`,IJ:`IJ`,ij:`ij`,Œ:`Oe`,œ:`oe`,ʼn:`'n`,ſ:`s`};let n;const r=/[\xD8-\xF6\u0100-\u017F]/gi;let i;function a(a){return i??=RegExp(`[\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\u1ab0-\\u1aff\\u1dc0-\\u1dff]`,`g`),n??=e(t),a&&a.replace(r,n).replace(i,``)}exports.deburr=a;
 //# sourceMappingURL=string-deburr.cjs.map

package/dist/common/data/string-deburr.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/dirk/work/github-zeed/dist/common/data/string-deburr.cjs"],"names":[],"mappings":"AAAA,qIAAuC,oCAAiC,qCAAoB","file":"/Users/dirk/work/github-zeed/dist/common/data/string-deburr.cjs"}
+{"version":3,"file":"string-deburr.cjs","names":[],"sources":["../../../src/common/data/string-deburr.ts"],"sourcesContent":["// Via lodash, MIT, https://github.com/lodash/lodash/blob/4.17.15/lodash.js#L14181\n\n/**\n * The base implementation of `propertyOf` without support for deep paths.\n */\nfunction basePropertyOf(object: any): any {\n  return (key: any) => object == null ? undefined : object[key]\n}\n\n/** Used to map Latin Unicode letters to basic Latin letters. */\nconst deburredLetters = {\n  // Latin-1 Supplement block.\n  À: 'A',\n  Á: 'A',\n  Â: 'A',\n  Ã: 'A',\n  Ä: 'A',\n  Å: 'A',\n  à: 'a',\n  á: 'a',\n  â: 'a',\n  ã: 'a',\n  ä: 'a',\n  å: 'a',\n  Ç: 'C',\n  ç: 'c',\n  Ð: 'D',\n  ð: 'd',\n  È: 'E',\n  É: 'E',\n  Ê: 'E',\n  Ë: 'E',\n  è: 'e',\n  é: 'e',\n  ê: 'e',\n  ë: 'e',\n  Ì: 'I',\n  Í: 'I',\n  Î: 'I',\n  Ï: 'I',\n  ì: 'i',\n  í: 'i',\n  î: 'i',\n  ï: 'i',\n  Ñ: 'N',\n  ñ: 'n',\n  Ò: 'O',\n  Ó: 'O',\n  Ô: 'O',\n  Õ: 'O',\n  Ö: 'O',\n  Ø: 'O',\n  ò: 'o',\n  ó: 'o',\n  ô: 'o',\n  õ: 'o',\n  ö: 'o',\n  ø: 'o',\n  Ù: 'U',\n  Ú: 'U',\n  Û: 'U',\n  Ü: 'U',\n  ù: 'u',\n  ú: 'u',\n  û: 'u',\n  ü: 'u',\n  Ý: 'Y',\n  ý: 'y',\n  ÿ: 'y',\n  Æ: 'Ae',\n  æ: 'ae',\n  Þ: 'Th',\n  þ: 'th',\n  ß: 'ss',\n  // Latin Extended-A block.\n  Ā: 'A',\n  Ă: 'A',\n  Ą: 'A',\n  ā: 'a',\n  ă: 'a',\n  ą: 'a',\n  Ć: 'C',\n  Ĉ: 'C',\n  Ċ: 'C',\n  Č: 'C',\n  ć: 'c',\n  ĉ: 'c',\n  ċ: 'c',\n  č: 'c',\n  Ď: 'D',\n  Đ: 'D',\n  ď: 'd',\n  đ: 'd',\n  Ē: 'E',\n  Ĕ: 'E',\n  Ė: 'E',\n  Ę: 'E',\n  Ě: 'E',\n  ē: 'e',\n  ĕ: 'e',\n  ė: 'e',\n  ę: 'e',\n  ě: 'e',\n  Ĝ: 'G',\n  Ğ: 'G',\n  Ġ: 'G',\n  Ģ: 'G',\n  ĝ: 'g',\n  ğ: 'g',\n  ġ: 'g',\n  ģ: 'g',\n  Ĥ: 'H',\n  Ħ: 'H',\n  ĥ: 'h',\n  ħ: 'h',\n  Ĩ: 'I',\n  Ī: 'I',\n  Ĭ: 'I',\n  Į: 'I',\n  İ: 'I',\n  ĩ: 'i',\n  ī: 'i',\n  ĭ: 'i',\n  į: 'i',\n  ı: 'i',\n  Ĵ: 'J',\n  ĵ: 'j',\n  Ķ: 'K',\n  ķ: 'k',\n  ĸ: 'k',\n  Ĺ: 'L',\n  Ļ: 'L',\n  Ľ: 'L',\n  Ŀ: 'L',\n  Ł: 'L',\n  ĺ: 'l',\n  ļ: 'l',\n  ľ: 'l',\n  ŀ: 'l',\n  ł: 'l',\n  Ń: 'N',\n  Ņ: 'N',\n  Ň: 'N',\n  Ŋ: 'N',\n  ń: 'n',\n  ņ: 'n',\n  ň: 'n',\n  ŋ: 'n',\n  Ō: 'O',\n  Ŏ: 'O',\n  Ő: 'O',\n  ō: 'o',\n  ŏ: 'o',\n  ő: 'o',\n  Ŕ: 'R',\n  Ŗ: 'R',\n  Ř: 'R',\n  ŕ: 'r',\n  ŗ: 'r',\n  ř: 'r',\n  Ś: 'S',\n  Ŝ: 'S',\n  Ş: 'S',\n  Š: 'S',\n  ś: 's',\n  ŝ: 's',\n  ş: 's',\n  š: 's',\n  Ţ: 'T',\n  Ť: 'T',\n  Ŧ: 'T',\n  ţ: 't',\n  ť: 't',\n  ŧ: 't',\n  Ũ: 'U',\n  Ū: 'U',\n  Ŭ: 'U',\n  Ů: 'U',\n  Ű: 'U',\n  Ų: 'U',\n  ũ: 'u',\n  ū: 'u',\n  ŭ: 'u',\n  ů: 'u',\n  ű: 'u',\n  ų: 'u',\n  Ŵ: 'W',\n  ŵ: 'w',\n  Ŷ: 'Y',\n  ŷ: 'y',\n  Ÿ: 'Y',\n  Ź: 'Z',\n  Ż: 'Z',\n  Ž: 'Z',\n  ź: 'z',\n  ż: 'z',\n  ž: 'z',\n  IJ: 'IJ',\n  ij: 'ij',\n  Œ: 'Oe',\n  œ: 'oe',\n  ʼn: '\\'n',\n  ſ: 's',\n}\n\n/**\n * Used by `deburr` to convert Latin-1 Supplement and Latin Extended-A\n * letters to basic Latin letters.\n *\n * @private\n * @param {string} letter The matched letter to deburr.\n * @returns {string} Returns the deburred letter.\n */\nlet deburrLetter: any\n\n/** Used to match Latin Unicode letters (excluding mathematical operators). */\nconst reLatin = /[\\xD8-\\xF6\\u0100-\\u017F]/gi\n\n/**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\n\nlet reComboMark: RegExp | undefined\n\n/**\n * Deburrs `string` by converting\n * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n * letters to basic Latin letters and removing\n * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n *\n * @param {string} string The string to deburr.\n * @returns {string} Returns the deburred string.\n * @example\n *\n * deburr('déjà vu')\n * // => 'deja vu'\n */\nexport function deburr(string: string): string {\n  if (reComboMark == null) {\n    /** Used to compose unicode character classes. */\n    const rsComboMarksRange = '\\\\u0300-\\\\u036f'\n    const reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f'\n    const rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff'\n    const rsComboMarksExtendedRange = '\\\\u1ab0-\\\\u1aff'\n    const rsComboMarksSupplementRange = '\\\\u1dc0-\\\\u1dff'\n    const rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange + rsComboMarksExtendedRange + rsComboMarksSupplementRange\n\n    /** Used to compose unicode capture groups. */\n    const rsCombo = `[${rsComboRange}]`\n    // eslint-disable-next-line no-misleading-character-class\n    reComboMark = RegExp(rsCombo, 'g')\n  }\n  if (deburrLetter == null)\n    deburrLetter = basePropertyOf(deburredLetters)\n  return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '')\n}\n"],"mappings":"mEAKA,SAAS,EAAe,EAAkB,CACxC,MAAQ,IAAa,IAAoC,GAI3D,MAAM,EAAkB,CAEtB,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,KACH,EAAG,KACH,EAAG,KACH,EAAG,KACH,EAAG,KAEH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,KACH,EAAG,KACH,EAAG,KACH,EAAG,KACH,EAAG,KACH,EAAG,IACJ,CAUD,IAAI,EAGJ,MAAM,EAAU,6BAOhB,IAAI,EAgBJ,SAAgB,EAAO,EAAwB,CAiB7C,MAhBA,CAYE,IAAc,OAFE,gFAEc,IAAI,CAEpC,AACE,IAAe,EAAe,EAAgB,CACzC,GAAU,EAAO,QAAQ,EAAS,EAAa,CAAC,QAAQ,EAAa,GAAG"}

package/dist/common/data/string-deburr.d.cts

@@ -1,17 +1,2 @@
-/**
- * Deburrs `string` by converting
- * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)
- * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)
- * letters to basic Latin letters and removing
- * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).
- *
- * @param {string} string The string to deburr.
- * @returns {string} Returns the deburred string.
- * @example
- *
- * deburr('déjà vu')
- * // => 'deja vu'
- */
-declare function deburr(string: string): string;
-
-export { deburr };
+import { t as deburr } from "../../string-deburr-Cv_lg211.cjs";
+export { deburr };

package/dist/common/data/string-deburr.d.mts

@@ -0,0 +1,2 @@
+import { t as deburr } from "../../string-deburr-B9tMg1ur.mjs";
+export { deburr };

package/dist/common/data/string-deburr.mjs

@@ -0,0 +1,2 @@
+function e(e){return t=>e?.[t]}const t={À:`A`,Á:`A`,Â:`A`,Ã:`A`,Ä:`A`,Å:`A`,à:`a`,á:`a`,â:`a`,ã:`a`,ä:`a`,å:`a`,Ç:`C`,ç:`c`,Ð:`D`,ð:`d`,È:`E`,É:`E`,Ê:`E`,Ë:`E`,è:`e`,é:`e`,ê:`e`,ë:`e`,Ì:`I`,Í:`I`,Î:`I`,Ï:`I`,ì:`i`,í:`i`,î:`i`,ï:`i`,Ñ:`N`,ñ:`n`,Ò:`O`,Ó:`O`,Ô:`O`,Õ:`O`,Ö:`O`,Ø:`O`,ò:`o`,ó:`o`,ô:`o`,õ:`o`,ö:`o`,ø:`o`,Ù:`U`,Ú:`U`,Û:`U`,Ü:`U`,ù:`u`,ú:`u`,û:`u`,ü:`u`,Ý:`Y`,ý:`y`,ÿ:`y`,Æ:`Ae`,æ:`ae`,Þ:`Th`,þ:`th`,ß:`ss`,Ā:`A`,Ă:`A`,Ą:`A`,ā:`a`,ă:`a`,ą:`a`,Ć:`C`,Ĉ:`C`,Ċ:`C`,Č:`C`,ć:`c`,ĉ:`c`,ċ:`c`,č:`c`,Ď:`D`,Đ:`D`,ď:`d`,đ:`d`,Ē:`E`,Ĕ:`E`,Ė:`E`,Ę:`E`,Ě:`E`,ē:`e`,ĕ:`e`,ė:`e`,ę:`e`,ě:`e`,Ĝ:`G`,Ğ:`G`,Ġ:`G`,Ģ:`G`,ĝ:`g`,ğ:`g`,ġ:`g`,ģ:`g`,Ĥ:`H`,Ħ:`H`,ĥ:`h`,ħ:`h`,Ĩ:`I`,Ī:`I`,Ĭ:`I`,Į:`I`,İ:`I`,ĩ:`i`,ī:`i`,ĭ:`i`,į:`i`,ı:`i`,Ĵ:`J`,ĵ:`j`,Ķ:`K`,ķ:`k`,ĸ:`k`,Ĺ:`L`,Ļ:`L`,Ľ:`L`,Ŀ:`L`,Ł:`L`,ĺ:`l`,ļ:`l`,ľ:`l`,ŀ:`l`,ł:`l`,Ń:`N`,Ņ:`N`,Ň:`N`,Ŋ:`N`,ń:`n`,ņ:`n`,ň:`n`,ŋ:`n`,Ō:`O`,Ŏ:`O`,Ő:`O`,ō:`o`,ŏ:`o`,ő:`o`,Ŕ:`R`,Ŗ:`R`,Ř:`R`,ŕ:`r`,ŗ:`r`,ř:`r`,Ś:`S`,Ŝ:`S`,Ş:`S`,Š:`S`,ś:`s`,ŝ:`s`,ş:`s`,š:`s`,Ţ:`T`,Ť:`T`,Ŧ:`T`,ţ:`t`,ť:`t`,ŧ:`t`,Ũ:`U`,Ū:`U`,Ŭ:`U`,Ů:`U`,Ű:`U`,Ų:`U`,ũ:`u`,ū:`u`,ŭ:`u`,ů:`u`,ű:`u`,ų:`u`,Ŵ:`W`,ŵ:`w`,Ŷ:`Y`,ŷ:`y`,Ÿ:`Y`,Ź:`Z`,Ż:`Z`,Ž:`Z`,ź:`z`,ż:`z`,ž:`z`,IJ:`IJ`,ij:`ij`,Œ:`Oe`,œ:`oe`,ʼn:`'n`,ſ:`s`};let n;const r=/[\xD8-\xF6\u0100-\u017F]/gi;let i;function a(a){return i??=RegExp(`[\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\u1ab0-\\u1aff\\u1dc0-\\u1dff]`,`g`),n??=e(t),a&&a.replace(r,n).replace(i,``)}export{a as deburr};
+//# sourceMappingURL=string-deburr.mjs.map

package/dist/common/data/string-deburr.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"string-deburr.mjs","names":[],"sources":["../../../src/common/data/string-deburr.ts"],"sourcesContent":["// Via lodash, MIT, https://github.com/lodash/lodash/blob/4.17.15/lodash.js#L14181\n\n/**\n * The base implementation of `propertyOf` without support for deep paths.\n */\nfunction basePropertyOf(object: any): any {\n  return (key: any) => object == null ? undefined : object[key]\n}\n\n/** Used to map Latin Unicode letters to basic Latin letters. */\nconst deburredLetters = {\n  // Latin-1 Supplement block.\n  À: 'A',\n  Á: 'A',\n  Â: 'A',\n  Ã: 'A',\n  Ä: 'A',\n  Å: 'A',\n  à: 'a',\n  á: 'a',\n  â: 'a',\n  ã: 'a',\n  ä: 'a',\n  å: 'a',\n  Ç: 'C',\n  ç: 'c',\n  Ð: 'D',\n  ð: 'd',\n  È: 'E',\n  É: 'E',\n  Ê: 'E',\n  Ë: 'E',\n  è: 'e',\n  é: 'e',\n  ê: 'e',\n  ë: 'e',\n  Ì: 'I',\n  Í: 'I',\n  Î: 'I',\n  Ï: 'I',\n  ì: 'i',\n  í: 'i',\n  î: 'i',\n  ï: 'i',\n  Ñ: 'N',\n  ñ: 'n',\n  Ò: 'O',\n  Ó: 'O',\n  Ô: 'O',\n  Õ: 'O',\n  Ö: 'O',\n  Ø: 'O',\n  ò: 'o',\n  ó: 'o',\n  ô: 'o',\n  õ: 'o',\n  ö: 'o',\n  ø: 'o',\n  Ù: 'U',\n  Ú: 'U',\n  Û: 'U',\n  Ü: 'U',\n  ù: 'u',\n  ú: 'u',\n  û: 'u',\n  ü: 'u',\n  Ý: 'Y',\n  ý: 'y',\n  ÿ: 'y',\n  Æ: 'Ae',\n  æ: 'ae',\n  Þ: 'Th',\n  þ: 'th',\n  ß: 'ss',\n  // Latin Extended-A block.\n  Ā: 'A',\n  Ă: 'A',\n  Ą: 'A',\n  ā: 'a',\n  ă: 'a',\n  ą: 'a',\n  Ć: 'C',\n  Ĉ: 'C',\n  Ċ: 'C',\n  Č: 'C',\n  ć: 'c',\n  ĉ: 'c',\n  ċ: 'c',\n  č: 'c',\n  Ď: 'D',\n  Đ: 'D',\n  ď: 'd',\n  đ: 'd',\n  Ē: 'E',\n  Ĕ: 'E',\n  Ė: 'E',\n  Ę: 'E',\n  Ě: 'E',\n  ē: 'e',\n  ĕ: 'e',\n  ė: 'e',\n  ę: 'e',\n  ě: 'e',\n  Ĝ: 'G',\n  Ğ: 'G',\n  Ġ: 'G',\n  Ģ: 'G',\n  ĝ: 'g',\n  ğ: 'g',\n  ġ: 'g',\n  ģ: 'g',\n  Ĥ: 'H',\n  Ħ: 'H',\n  ĥ: 'h',\n  ħ: 'h',\n  Ĩ: 'I',\n  Ī: 'I',\n  Ĭ: 'I',\n  Į: 'I',\n  İ: 'I',\n  ĩ: 'i',\n  ī: 'i',\n  ĭ: 'i',\n  į: 'i',\n  ı: 'i',\n  Ĵ: 'J',\n  ĵ: 'j',\n  Ķ: 'K',\n  ķ: 'k',\n  ĸ: 'k',\n  Ĺ: 'L',\n  Ļ: 'L',\n  Ľ: 'L',\n  Ŀ: 'L',\n  Ł: 'L',\n  ĺ: 'l',\n  ļ: 'l',\n  ľ: 'l',\n  ŀ: 'l',\n  ł: 'l',\n  Ń: 'N',\n  Ņ: 'N',\n  Ň: 'N',\n  Ŋ: 'N',\n  ń: 'n',\n  ņ: 'n',\n  ň: 'n',\n  ŋ: 'n',\n  Ō: 'O',\n  Ŏ: 'O',\n  Ő: 'O',\n  ō: 'o',\n  ŏ: 'o',\n  ő: 'o',\n  Ŕ: 'R',\n  Ŗ: 'R',\n  Ř: 'R',\n  ŕ: 'r',\n  ŗ: 'r',\n  ř: 'r',\n  Ś: 'S',\n  Ŝ: 'S',\n  Ş: 'S',\n  Š: 'S',\n  ś: 's',\n  ŝ: 's',\n  ş: 's',\n  š: 's',\n  Ţ: 'T',\n  Ť: 'T',\n  Ŧ: 'T',\n  ţ: 't',\n  ť: 't',\n  ŧ: 't',\n  Ũ: 'U',\n  Ū: 'U',\n  Ŭ: 'U',\n  Ů: 'U',\n  Ű: 'U',\n  Ų: 'U',\n  ũ: 'u',\n  ū: 'u',\n  ŭ: 'u',\n  ů: 'u',\n  ű: 'u',\n  ų: 'u',\n  Ŵ: 'W',\n  ŵ: 'w',\n  Ŷ: 'Y',\n  ŷ: 'y',\n  Ÿ: 'Y',\n  Ź: 'Z',\n  Ż: 'Z',\n  Ž: 'Z',\n  ź: 'z',\n  ż: 'z',\n  ž: 'z',\n  IJ: 'IJ',\n  ij: 'ij',\n  Œ: 'Oe',\n  œ: 'oe',\n  ʼn: '\\'n',\n  ſ: 's',\n}\n\n/**\n * Used by `deburr` to convert Latin-1 Supplement and Latin Extended-A\n * letters to basic Latin letters.\n *\n * @private\n * @param {string} letter The matched letter to deburr.\n * @returns {string} Returns the deburred letter.\n */\nlet deburrLetter: any\n\n/** Used to match Latin Unicode letters (excluding mathematical operators). */\nconst reLatin = /[\\xD8-\\xF6\\u0100-\\u017F]/gi\n\n/**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\n\nlet reComboMark: RegExp | undefined\n\n/**\n * Deburrs `string` by converting\n * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n * letters to basic Latin letters and removing\n * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n *\n * @param {string} string The string to deburr.\n * @returns {string} Returns the deburred string.\n * @example\n *\n * deburr('déjà vu')\n * // => 'deja vu'\n */\nexport function deburr(string: string): string {\n  if (reComboMark == null) {\n    /** Used to compose unicode character classes. */\n    const rsComboMarksRange = '\\\\u0300-\\\\u036f'\n    const reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f'\n    const rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff'\n    const rsComboMarksExtendedRange = '\\\\u1ab0-\\\\u1aff'\n    const rsComboMarksSupplementRange = '\\\\u1dc0-\\\\u1dff'\n    const rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange + rsComboMarksExtendedRange + rsComboMarksSupplementRange\n\n    /** Used to compose unicode capture groups. */\n    const rsCombo = `[${rsComboRange}]`\n    // eslint-disable-next-line no-misleading-character-class\n    reComboMark = RegExp(rsCombo, 'g')\n  }\n  if (deburrLetter == null)\n    deburrLetter = basePropertyOf(deburredLetters)\n  return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '')\n}\n"],"mappings":"AAKA,SAAS,EAAe,EAAkB,CACxC,MAAQ,IAAa,IAAoC,GAI3D,MAAM,EAAkB,CAEtB,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,KACH,EAAG,KACH,EAAG,KACH,EAAG,KACH,EAAG,KAEH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,IACH,EAAG,KACH,EAAG,KACH,EAAG,KACH,EAAG,KACH,EAAG,KACH,EAAG,IACJ,CAUD,IAAI,EAGJ,MAAM,EAAU,6BAOhB,IAAI,EAgBJ,SAAgB,EAAO,EAAwB,CAiB7C,MAhBA,CAYE,IAAc,OAFE,gFAEc,IAAI,CAEpC,AACE,IAAe,EAAe,EAAgB,CACzC,GAAU,EAAO,QAAQ,EAAS,EAAa,CAAC,QAAQ,EAAa,GAAG"}

package/dist/common/data/string-hash-fnv.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk2UQU3IBAcjs = require('../../chunk-2UQU3IBA.cjs');require('../../chunk-P7XCQ7WV.cjs');exports.stringHashFNV1a = _chunk2UQU3IBAcjs.a;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});function e(e){let t=e.length,n,r,i=0,a=40389,o=0,s=33052;for(r=0;r<t;r++)n=e.charCodeAt(r),n<128?a^=n:n<2048?(a^=n>>6|192,i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535,a^=n&63|128):(n&64512)==55296&&r+1<t&&(e.charCodeAt(r+1)&64512)==56320?(n=65536+((n&1023)<<10)+(e.charCodeAt(++r)&1023),a^=n>>18|240,i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535,a^=n>>12&63|128,i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535,a^=n>>6&63|128,i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535,a^=n&63|128):(a^=n>>12|224,i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535,a^=n>>6&63|128,i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535,a^=n&63|128),i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535;return(s<<16>>>0)+a}exports.stringHashFNV1a=e;
 //# sourceMappingURL=string-hash-fnv.cjs.map

package/dist/common/data/string-hash-fnv.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/dirk/work/github-zeed/dist/common/data/string-hash-fnv.cjs"],"names":[],"mappings":"AAAA,qIAAuC,oCAAiC,8CAA6B","file":"/Users/dirk/work/github-zeed/dist/common/data/string-hash-fnv.cjs"}
+{"version":3,"file":"string-hash-fnv.cjs","names":[],"sources":["../../../src/common/data/string-hash-fnv.ts"],"sourcesContent":["// Why FNV-1a (32-bit) https://softwareengineering.stackexchange.com/a/250750/366573\n// A simple implementation https://gist.github.com/vaiorabbit/5657561\n// This implementation  https://github.com/tjwebb/fnv-plus/blob/master/index.js#L341\n// Alternative implementation https://github.com/sindresorhus/fnv1a\n\nexport function stringHashFNV1a(str: string): number {\n  const l = str.length\n  let c: number\n  let i: number\n  let t0 = 0\n  let v0 = 0x9DC5\n  let t1 = 0\n  let v1 = 0x811C\n\n  for (i = 0; i < l; i++) {\n    c = str.charCodeAt(i)\n    if (c < 128) {\n      v0 ^= c\n    }\n    else if (c < 2048) {\n      v0 ^= (c >> 6) | 192\n      t0 = v0 * 403\n      t1 = v1 * 403\n      t1 += v0 << 8\n      v1 = (t1 + (t0 >>> 16)) & 65535\n      v0 = t0 & 65535\n      v0 ^= (c & 63) | 128\n    }\n    else if (((c & 64512) === 55296) && (i + 1) < l && ((str.charCodeAt(i + 1) & 64512) === 56320)) {\n      c = 65536 + ((c & 1023) << 10) + (str.charCodeAt(++i) & 1023)\n      v0 ^= (c >> 18) | 240\n      t0 = v0 * 403\n      t1 = v1 * 403\n      t1 += v0 << 8\n      v1 = (t1 + (t0 >>> 16)) & 65535\n      v0 = t0 & 65535\n      v0 ^= ((c >> 12) & 63) | 128\n      t0 = v0 * 403\n      t1 = v1 * 403\n      t1 += v0 << 8\n      v1 = (t1 + (t0 >>> 16)) & 65535\n      v0 = t0 & 65535\n      v0 ^= ((c >> 6) & 63) | 128\n      t0 = v0 * 403\n      t1 = v1 * 403\n      t1 += v0 << 8\n      v1 = (t1 + (t0 >>> 16)) & 65535\n      v0 = t0 & 65535\n      v0 ^= (c & 63) | 128\n    }\n    else {\n      v0 ^= (c >> 12) | 224\n      t0 = v0 * 403\n      t1 = v1 * 403\n      t1 += v0 << 8\n      v1 = (t1 + (t0 >>> 16)) & 65535\n      v0 = t0 & 65535\n      v0 ^= ((c >> 6) & 63) | 128\n      t0 = v0 * 403\n      t1 = v1 * 403\n      t1 += v0 << 8\n      v1 = (t1 + (t0 >>> 16)) & 65535\n      v0 = t0 & 65535\n      v0 ^= (c & 63) | 128\n    }\n    t0 = v0 * 403\n    t1 = v1 * 403\n    t1 += v0 << 8\n    v1 = (t1 + (t0 >>> 16)) & 65535\n    v0 = t0 & 65535\n  }\n\n  return ((v1 << 16) >>> 0) + v0\n}\n"],"mappings":"mEAKA,SAAgB,EAAgB,EAAqB,CACnD,IAAM,EAAI,EAAI,OACV,EACA,EACA,EAAK,EACL,EAAK,MACL,EAAK,EACL,EAAK,MAET,IAAK,EAAI,EAAG,EAAI,EAAG,IACjB,EAAI,EAAI,WAAW,EAAE,CACjB,EAAI,IACN,GAAM,EAEC,EAAI,MACX,GAAO,GAAK,EAAK,IACjB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MACV,GAAO,EAAI,GAAM,MAER,EAAI,QAAW,OAAW,EAAI,EAAK,IAAO,EAAI,WAAW,EAAI,EAAE,CAAG,QAAW,OACtF,EAAI,QAAU,EAAI,OAAS,KAAO,EAAI,WAAW,EAAE,EAAE,CAAG,MACxD,GAAO,GAAK,GAAM,IAClB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MACV,GAAQ,GAAK,GAAM,GAAM,IACzB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MACV,GAAQ,GAAK,EAAK,GAAM,IACxB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MACV,GAAO,EAAI,GAAM,MAGjB,GAAO,GAAK,GAAM,IAClB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MACV,GAAQ,GAAK,EAAK,GAAM,IACxB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MACV,GAAO,EAAI,GAAM,KAEnB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MAGZ,OAAS,GAAM,KAAQ,GAAK"}

package/dist/common/data/string-hash-fnv.d.cts

@@ -1,3 +1,2 @@
-declare function stringHashFNV1a(str: string): number;
-
-export { stringHashFNV1a };
+import { t as stringHashFNV1a } from "../../string-hash-fnv-CVzlSefX.cjs";
+export { stringHashFNV1a };

package/dist/common/data/string-hash-fnv.d.mts

@@ -0,0 +1,2 @@
+import { t as stringHashFNV1a } from "../../string-hash-fnv-Bu6vEZjL.mjs";
+export { stringHashFNV1a };

package/dist/common/data/string-hash-fnv.mjs

@@ -0,0 +1,2 @@
+function e(e){let t=e.length,n,r,i=0,a=40389,o=0,s=33052;for(r=0;r<t;r++)n=e.charCodeAt(r),n<128?a^=n:n<2048?(a^=n>>6|192,i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535,a^=n&63|128):(n&64512)==55296&&r+1<t&&(e.charCodeAt(r+1)&64512)==56320?(n=65536+((n&1023)<<10)+(e.charCodeAt(++r)&1023),a^=n>>18|240,i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535,a^=n>>12&63|128,i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535,a^=n>>6&63|128,i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535,a^=n&63|128):(a^=n>>12|224,i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535,a^=n>>6&63|128,i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535,a^=n&63|128),i=a*403,o=s*403,o+=a<<8,s=o+(i>>>16)&65535,a=i&65535;return(s<<16>>>0)+a}export{e as stringHashFNV1a};
+//# sourceMappingURL=string-hash-fnv.mjs.map

package/dist/common/data/string-hash-fnv.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"string-hash-fnv.mjs","names":[],"sources":["../../../src/common/data/string-hash-fnv.ts"],"sourcesContent":["// Why FNV-1a (32-bit) https://softwareengineering.stackexchange.com/a/250750/366573\n// A simple implementation https://gist.github.com/vaiorabbit/5657561\n// This implementation  https://github.com/tjwebb/fnv-plus/blob/master/index.js#L341\n// Alternative implementation https://github.com/sindresorhus/fnv1a\n\nexport function stringHashFNV1a(str: string): number {\n  const l = str.length\n  let c: number\n  let i: number\n  let t0 = 0\n  let v0 = 0x9DC5\n  let t1 = 0\n  let v1 = 0x811C\n\n  for (i = 0; i < l; i++) {\n    c = str.charCodeAt(i)\n    if (c < 128) {\n      v0 ^= c\n    }\n    else if (c < 2048) {\n      v0 ^= (c >> 6) | 192\n      t0 = v0 * 403\n      t1 = v1 * 403\n      t1 += v0 << 8\n      v1 = (t1 + (t0 >>> 16)) & 65535\n      v0 = t0 & 65535\n      v0 ^= (c & 63) | 128\n    }\n    else if (((c & 64512) === 55296) && (i + 1) < l && ((str.charCodeAt(i + 1) & 64512) === 56320)) {\n      c = 65536 + ((c & 1023) << 10) + (str.charCodeAt(++i) & 1023)\n      v0 ^= (c >> 18) | 240\n      t0 = v0 * 403\n      t1 = v1 * 403\n      t1 += v0 << 8\n      v1 = (t1 + (t0 >>> 16)) & 65535\n      v0 = t0 & 65535\n      v0 ^= ((c >> 12) & 63) | 128\n      t0 = v0 * 403\n      t1 = v1 * 403\n      t1 += v0 << 8\n      v1 = (t1 + (t0 >>> 16)) & 65535\n      v0 = t0 & 65535\n      v0 ^= ((c >> 6) & 63) | 128\n      t0 = v0 * 403\n      t1 = v1 * 403\n      t1 += v0 << 8\n      v1 = (t1 + (t0 >>> 16)) & 65535\n      v0 = t0 & 65535\n      v0 ^= (c & 63) | 128\n    }\n    else {\n      v0 ^= (c >> 12) | 224\n      t0 = v0 * 403\n      t1 = v1 * 403\n      t1 += v0 << 8\n      v1 = (t1 + (t0 >>> 16)) & 65535\n      v0 = t0 & 65535\n      v0 ^= ((c >> 6) & 63) | 128\n      t0 = v0 * 403\n      t1 = v1 * 403\n      t1 += v0 << 8\n      v1 = (t1 + (t0 >>> 16)) & 65535\n      v0 = t0 & 65535\n      v0 ^= (c & 63) | 128\n    }\n    t0 = v0 * 403\n    t1 = v1 * 403\n    t1 += v0 << 8\n    v1 = (t1 + (t0 >>> 16)) & 65535\n    v0 = t0 & 65535\n  }\n\n  return ((v1 << 16) >>> 0) + v0\n}\n"],"mappings":"AAKA,SAAgB,EAAgB,EAAqB,CACnD,IAAM,EAAI,EAAI,OACV,EACA,EACA,EAAK,EACL,EAAK,MACL,EAAK,EACL,EAAK,MAET,IAAK,EAAI,EAAG,EAAI,EAAG,IACjB,EAAI,EAAI,WAAW,EAAE,CACjB,EAAI,IACN,GAAM,EAEC,EAAI,MACX,GAAO,GAAK,EAAK,IACjB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MACV,GAAO,EAAI,GAAM,MAER,EAAI,QAAW,OAAW,EAAI,EAAK,IAAO,EAAI,WAAW,EAAI,EAAE,CAAG,QAAW,OACtF,EAAI,QAAU,EAAI,OAAS,KAAO,EAAI,WAAW,EAAE,EAAE,CAAG,MACxD,GAAO,GAAK,GAAM,IAClB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MACV,GAAQ,GAAK,GAAM,GAAM,IACzB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MACV,GAAQ,GAAK,EAAK,GAAM,IACxB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MACV,GAAO,EAAI,GAAM,MAGjB,GAAO,GAAK,GAAM,IAClB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MACV,GAAQ,GAAK,EAAK,GAAM,IACxB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MACV,GAAO,EAAI,GAAM,KAEnB,EAAK,EAAK,IACV,EAAK,EAAK,IACV,GAAM,GAAM,EACZ,EAAM,GAAM,IAAO,IAAO,MAC1B,EAAK,EAAK,MAGZ,OAAS,GAAM,KAAQ,GAAK"}

package/dist/common/data/string-hash-pool.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk2TNLYCZHcjs = require('../../chunk-2TNLYCZH.cjs');require('../../chunk-2UQU3IBA.cjs');require('../../chunk-P7XCQ7WV.cjs');exports.useStringHashPool = _chunk2TNLYCZHcjs.a;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`./string-hash-fnv.cjs`);function t(){let t=new Map,n=new Map;function r(r){let i=n.get(r);if(i==null){if(i=e.stringHashFNV1a(r),t.has(i))throw Error(`Hash for '${r}' is already in use for '${t.get(i)}`);t.set(i,r),n.set(r,i)}return i}function i(e){return t.get(e)}return{hash:r,stringForHash:i}}exports.useStringHashPool=t;
 //# sourceMappingURL=string-hash-pool.cjs.map

package/dist/common/data/string-hash-pool.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/dirk/work/github-zeed/dist/common/data/string-hash-pool.cjs"],"names":[],"mappings":"AAAA,qIAAuC,oCAAiC,oCAAiC,gDAA+B","file":"/Users/dirk/work/github-zeed/dist/common/data/string-hash-pool.cjs"}
+{"version":3,"file":"string-hash-pool.cjs","names":["stringHashFNV1a"],"sources":["../../../src/common/data/string-hash-pool.ts"],"sourcesContent":["import { stringHashFNV1a } from './string-hash-fnv'\n\nexport function useStringHashPool() {\n  const hashToString: Map<number, string> = new Map()\n  const stringToHash: Map<string, number> = new Map()\n\n  function hash(s: string) {\n    let v: number | undefined = stringToHash.get(s)\n    if (v == null) {\n      v = stringHashFNV1a(s)\n      if (hashToString.has(v))\n        throw new Error(`Hash for '${s}' is already in use for '${hashToString.get(v)}`)\n      hashToString.set(v, s)\n      stringToHash.set(s, v)\n    }\n    return v\n  }\n\n  function stringForHash(v: number) {\n    return hashToString.get(v)\n  }\n\n  return {\n    hash,\n    stringForHash,\n  }\n}\n\nexport type UseStringHashPool = ReturnType<typeof useStringHashPool>\n"],"mappings":"4GAEA,SAAgB,GAAoB,CAClC,IAAM,EAAoC,IAAI,IACxC,EAAoC,IAAI,IAE9C,SAAS,EAAK,EAAW,CACvB,IAAI,EAAwB,EAAa,IAAI,EAAE,CAC/C,GAAI,GAAK,KAAM,CAEb,GADA,EAAIA,EAAAA,gBAAgB,EAAE,CAClB,EAAa,IAAI,EAAE,CACrB,MAAU,MAAM,aAAa,EAAE,2BAA2B,EAAa,IAAI,EAAE,GAAG,CAClF,EAAa,IAAI,EAAG,EAAE,CACtB,EAAa,IAAI,EAAG,EAAE,CAExB,OAAO,EAGT,SAAS,EAAc,EAAW,CAChC,OAAO,EAAa,IAAI,EAAE,CAG5B,MAAO,CACL,OACA,gBACD"}

package/dist/common/data/string-hash-pool.d.cts

@@ -1,7 +1,2 @@
-declare function useStringHashPool(): {
-    hash: (s: string) => number;
-    stringForHash: (v: number) => string | undefined;
-};
-type UseStringHashPool = ReturnType<typeof useStringHashPool>;
-
-export { type UseStringHashPool, useStringHashPool };
+import { n as useStringHashPool, t as UseStringHashPool } from "../../string-hash-pool-9wgUkvIQ.cjs";
+export { UseStringHashPool, useStringHashPool };

package/dist/common/data/string-hash-pool.d.mts

@@ -0,0 +1,2 @@
+import { n as useStringHashPool, t as UseStringHashPool } from "../../string-hash-pool-BHDYziM7.mjs";
+export { UseStringHashPool, useStringHashPool };

package/dist/common/data/string-hash-pool.mjs

@@ -0,0 +1,2 @@
+import{stringHashFNV1a as e}from"./string-hash-fnv.mjs";function t(){let t=new Map,n=new Map;function r(r){let i=n.get(r);if(i==null){if(i=e(r),t.has(i))throw Error(`Hash for '${r}' is already in use for '${t.get(i)}`);t.set(i,r),n.set(r,i)}return i}function i(e){return t.get(e)}return{hash:r,stringForHash:i}}export{t as useStringHashPool};
+//# sourceMappingURL=string-hash-pool.mjs.map

package/dist/common/data/string-hash-pool.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"string-hash-pool.mjs","names":[],"sources":["../../../src/common/data/string-hash-pool.ts"],"sourcesContent":["import { stringHashFNV1a } from './string-hash-fnv'\n\nexport function useStringHashPool() {\n  const hashToString: Map<number, string> = new Map()\n  const stringToHash: Map<string, number> = new Map()\n\n  function hash(s: string) {\n    let v: number | undefined = stringToHash.get(s)\n    if (v == null) {\n      v = stringHashFNV1a(s)\n      if (hashToString.has(v))\n        throw new Error(`Hash for '${s}' is already in use for '${hashToString.get(v)}`)\n      hashToString.set(v, s)\n      stringToHash.set(s, v)\n    }\n    return v\n  }\n\n  function stringForHash(v: number) {\n    return hashToString.get(v)\n  }\n\n  return {\n    hash,\n    stringForHash,\n  }\n}\n\nexport type UseStringHashPool = ReturnType<typeof useStringHashPool>\n"],"mappings":"wDAEA,SAAgB,GAAoB,CAClC,IAAM,EAAoC,IAAI,IACxC,EAAoC,IAAI,IAE9C,SAAS,EAAK,EAAW,CACvB,IAAI,EAAwB,EAAa,IAAI,EAAE,CAC/C,GAAI,GAAK,KAAM,CAEb,GADA,EAAI,EAAgB,EAAE,CAClB,EAAa,IAAI,EAAE,CACrB,MAAU,MAAM,aAAa,EAAE,2BAA2B,EAAa,IAAI,EAAE,GAAG,CAClF,EAAa,IAAI,EAAG,EAAE,CACtB,EAAa,IAAI,EAAG,EAAE,CAExB,OAAO,EAGT,SAAS,EAAc,EAAW,CAChC,OAAO,EAAa,IAAI,EAAE,CAG5B,MAAO,CACL,OACA,gBACD"}

package/dist/common/data/url.cjs

@@ -1,2 +1,3 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkHTEAHUXGcjs = require('../../chunk-HTEAHUXG.cjs');require('../../chunk-X764QBCC.cjs');require('../../chunk-P7XCQ7WV.cjs');exports.RX_URL = _chunkHTEAHUXGcjs.b; exports.encodeQuery = _chunkHTEAHUXGcjs.f; exports.linkifyPlainText = _chunkHTEAHUXGcjs.d; exports.linkifyPlainTextSimple = _chunkHTEAHUXGcjs.c; exports.linkifyPlainTextWithLineBreaks = _chunkHTEAHUXGcjs.e; exports.parseQuery = _chunkHTEAHUXGcjs.g; exports.toHumanReadableUrl = _chunkHTEAHUXGcjs.a;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`./html.cjs`);function t(e){return e.replace(/^(https?:\/\/(www\.)?|mailto:)/gi,``).replace(/\/$/,``)}const n=/((?:(?:https?|ftp):)?\/\/(?:\S+@)?(?:(?!(?:10|127)(?:\.\d{1,3}){3})(?!(?:169\.254|192\.168)(?:\.\d{1,3}){2})(?!172\.(?:1[6-9]|2\d|3[01])(?:\.\d{1,3}){2})(?:[1-9]\d?|1\d\d|2[01]\d|22[0-3])(?:\.(?:1?\d{1,2}|2[0-4]\d|25[0-5])){2}\.(?:[1-9]\d?|1\d\d|2[0-4]\d|25[0-4])|(?:(?:[a-z0-9\u00A1-\uFFFF][\w\u00A1-\uFFFF-]{0,62})?[a-z0-9\u00A1-\uFFFF]\.)+[a-z\u00A1-\uFFFF]{2,}\.?)(?::\d{2,5})?(?:[/?#]\S*)?)/gi;function r(r){return r.split(n).map((n,r)=>{let i=e.escapeHTML(n);return r%2?`<a target="_blank" rel="noopener noreferrer" href="${i}">${t(i)}</a>`:i}).join(``)}const i=/((mailto:)?[a-zA-Z0-9._%+-]+@[a-zA-Z0-9.-]+\.[a-zA-Z]{2,})/gi,a=/([a-zA-Z0-9]+\.[a-zA-Z]{2,})/gi;function o(n){var r=n,i=[];let a=r.replace(/[.,!?;:]*$/,``);if(i.unshift(r.slice(a.length)),r.includes(`://`)){r=a;let e=(r.match(/[\(\[\{]/g)||[]).length,t=(r.match(/[\)\]\}]/g)||[]).length;if(t>e){let n=t-e,a=RegExp(`[\\)\\]\\}]{0,${n}}$`,`g`),o=r.replace(a,``);i.unshift(r.slice(o.length)),r=o}}else r.includes(`@`)?r.startsWith(`mailto:`)||(r=`mailto:${a}`):r=`https://${a}`;let o=e.escapeHTML(i.join(``)),s=e.escapeHTML(t(r)),c=e.escapeHTML(r);return`<a target="_blank" rel="noopener noreferrer"${r.startsWith(`http://`)?` class="_warn"`:``} href="${c}">${s}</a>${o}`}var s=void 0;function c(t,r={}){s==null?s=RegExp(`((${n.source})|(${i.source})|(${a.source}))`,`gi`):s.lastIndex=0;var c=0;let l=[];return t.replace(s,(n,...r)=>{let i=r[r.length-2],a=t.slice(c,i)??``;return l.push(e.escapeHTML(a)),c=i+n.length,l.push(o(n)),n}),l.join(``)+e.escapeHTML(t.slice(c))}function l(e,t={}){return e.split(`
+`).map(e=>c(e,t)).join(`<br>`)}function u(e,t){let n=[];for(let[r,i]of Object.entries(e))if(i!=null){Array.isArray(i)||(i=[i]);for(let e of i)t&&!t(e)||e!=null&&n.push(`${encodeURIComponent(r)}=${encodeURIComponent(String(e))}`)}return n.join(`&`)}function d(e){let t={};for(;e.startsWith(`?`);)e=e.substring(1);let n=e.split(`&`);for(let e=0;e<n.length;e++){let r=n[e],i=r.indexOf(`=`);if(r.length===0)continue;let a=i<0?r:decodeURIComponent(r.substring(0,i)),o=i<0?``:decodeURIComponent(r.substring(i+1));t[a]==null?t[a]=o:(Array.isArray(t[a])||(t[a]=[t[a]]),t[a].push(o))}return t}exports.RX_URL=n,exports.encodeQuery=u,exports.linkifyPlainText=c,exports.linkifyPlainTextSimple=r,exports.linkifyPlainTextWithLineBreaks=l,exports.parseQuery=d,exports.toHumanReadableUrl=t;
 //# sourceMappingURL=url.cjs.map

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

@@ -1 +1 @@
-{"version":3,"sources":["/Users/dirk/work/github-zeed/dist/common/data/url.cjs"],"names":[],"mappings":"AAAA,qIAAmD,oCAAiC,oCAAiC,gVAAmK","file":"/Users/dirk/work/github-zeed/dist/common/data/url.cjs"}
+{"version":3,"file":"url.cjs","names":["escapeHTML"],"sources":["../../../src/common/data/url.ts"],"sourcesContent":["// https://mathiasbynens.be/demo/url-regex\n// https://gist.github.com/dperini/729294\n\nimport { escapeHTML } from './html'\n\n/// Remove scheme, www. and trailing slash for display purposes\nexport function toHumanReadableUrl(url: string): string {\n  return url.replace(/^(https?:\\/\\/(www\\.)?|mailto:)/gi, '').replace(/\\/$/, '')\n}\n\n//\n\nexport const RX_URL = /((?:(?:https?|ftp):)?\\/\\/(?:\\S+@)?(?:(?!(?:10|127)(?:\\.\\d{1,3}){3})(?!(?:169\\.254|192\\.168)(?:\\.\\d{1,3}){2})(?!172\\.(?:1[6-9]|2\\d|3[01])(?:\\.\\d{1,3}){2})(?:[1-9]\\d?|1\\d\\d|2[01]\\d|22[0-3])(?:\\.(?:1?\\d{1,2}|2[0-4]\\d|25[0-5])){2}\\.(?:[1-9]\\d?|1\\d\\d|2[0-4]\\d|25[0-4])|(?:(?:[a-z0-9\\u00A1-\\uFFFF][\\w\\u00A1-\\uFFFF-]{0,62})?[a-z0-9\\u00A1-\\uFFFF]\\.)+[a-z\\u00A1-\\uFFFF]{2,}\\.?)(?::\\d{2,5})?(?:[/?#]\\S*)?)/gi\n\n/** @deprecated use linkifyPlainText */\nexport function linkifyPlainTextSimple(text: string): string {\n  return text\n    .split(RX_URL)\n    .map((part, i) => {\n      const escapedPart = escapeHTML(part)\n      return i % 2\n        ? `<a target=\"_blank\" rel=\"noopener noreferrer\" href=\"${escapedPart}\">${toHumanReadableUrl(\n          escapedPart,\n        )}</a>`\n        : escapedPart\n    })\n    .join('')\n}\n\n// Advanced implementation that also handles email addresses and simple URLs without protocol\n\nconst RX_EMAIL = /((mailto:)?[a-zA-Z0-9._%+-]+@[a-zA-Z0-9.-]+\\.[a-zA-Z]{2,})/gi\nconst RX_SIMPLE_URL = /([a-zA-Z0-9]+\\.[a-zA-Z]{2,})/gi\n\nfunction handleUrlString(part: string): string {\n  var url = part\n  var rests = []\n\n  // Remove trailing punctuation from URLs\n  const urlWithoutPunctuation = url.replace(/[.,!?;:]*$/, '')\n  rests.unshift(url.slice(urlWithoutPunctuation.length))\n\n  // Full URL with protocol\n  if (url.includes('://')) {\n\n    // Remove trailing closing brackets if unbalanced\n    url = urlWithoutPunctuation\n    const openingBrackets = (url.match(/[\\(\\[\\{]/g) || []).length\n    const closingBrackets = (url.match(/[\\)\\]\\}]/g) || []).length\n    if (closingBrackets > openingBrackets) {\n      const diff = closingBrackets - openingBrackets\n      const rx = new RegExp(`[\\\\)\\\\]\\\\}]{0,${diff}}$`, 'g')\n      const urlWithoutTrailing = url.replace(rx, '')\n      rests.unshift(url.slice(urlWithoutTrailing.length))\n      url = urlWithoutTrailing\n    }\n\n  }\n\n  // Email address\n  else if (url.includes('@')) {\n    if (!url.startsWith('mailto:'))\n      url = `mailto:${urlWithoutPunctuation}`\n  }\n\n  // Simple URL without protocol\n  else {\n    url = `https://${urlWithoutPunctuation}`\n  }\n\n  const escapedRest = escapeHTML(rests.join(''))\n  const escapedHumanReadableUrl = escapeHTML(toHumanReadableUrl(url))\n  const escapedUrl = escapeHTML(url)\n  const classInsecureHttp = url.startsWith('http://') ? ' class=\"_warn\"' : ''\n  return `<a target=\"_blank\" rel=\"noopener noreferrer\"${classInsecureHttp} href=\"${escapedUrl}\">${escapedHumanReadableUrl}</a>${escapedRest}`\n}\n\nvar rxJoined: RegExp | undefined = undefined\n\nexport interface LinkifyOptions {\n}\n\nexport function linkifyPlainText(text: string, options: LinkifyOptions = {}): string {\n  if (rxJoined == null) {\n    rxJoined = new RegExp(`((${RX_URL.source})|(${RX_EMAIL.source})|(${RX_SIMPLE_URL.source}))`, 'gi')\n  } else {\n    rxJoined.lastIndex = 0\n  }\n\n  var index = 0\n  const parts: string[] = []\n\n  text.replace(rxJoined, (match, ...args) => {\n    const offset = args[args.length - 2]\n    const leading = text.slice(index, offset) ?? ''\n    parts.push(escapeHTML(leading))\n    index = offset + match.length\n    parts.push(handleUrlString(match))\n    return match\n  })\n\n  return parts.join('') + escapeHTML(text.slice(index))\n}\n\n\nexport function linkifyPlainTextWithLineBreaks(text: string, options: LinkifyOptions = {}): string {\n  return text.split('\\n').map(l => linkifyPlainText(l, options)).join('<br>')\n}\n\n//\n\nexport function encodeQuery(data: Record<string, any>, filterValue?: (value: any) => boolean) {\n  const pairs = []\n  for (let [key, value] of Object.entries(data)) {\n    if (value != null) {\n      if (!Array.isArray(value))\n        value = [value]\n      for (const v of value) {\n        if (filterValue && !filterValue(v))\n          continue\n        else if (v == null)\n          continue\n        pairs.push(`${encodeURIComponent(key)}=${encodeURIComponent(String(v))}`)\n      }\n    }\n  }\n  return pairs.join('&')\n}\n\nexport function parseQuery(queryString: string) {\n  const query: any = {}\n  while (queryString.startsWith('?')) {\n    queryString = queryString.substring(1)\n  }\n  const pairs = queryString.split('&')\n  for (let i = 0; i < pairs.length; i++) {\n    const part = pairs[i]\n    const idx = part.indexOf('=')\n    if (part.length === 0) continue\n    const key = idx < 0 ? part : decodeURIComponent(part.substring(0, idx))\n    const value = idx < 0 ? '' : decodeURIComponent(part.substring(idx + 1))\n    if (query[key] != null) {\n      if (!Array.isArray(query[key]))\n        query[key] = [query[key]]\n      query[key].push(value)\n    }\n    else {\n      query[key] = value\n    }\n  }\n  return query\n}\n"],"mappings":"iGAMA,SAAgB,EAAmB,EAAqB,CACtD,OAAO,EAAI,QAAQ,mCAAoC,GAAG,CAAC,QAAQ,MAAO,GAAG,CAK/E,MAAa,EAAS,gZAGtB,SAAgB,EAAuB,EAAsB,CAC3D,OAAO,EACJ,MAAM,EAAO,CACb,KAAK,EAAM,IAAM,CAChB,IAAM,EAAcA,EAAAA,WAAW,EAAK,CACpC,OAAO,EAAI,EACP,sDAAsD,EAAY,IAAI,EACtE,EACD,CAAC,MACA,GACJ,CACD,KAAK,GAAG,CAKb,MAAM,EAAW,+DACX,EAAgB,iCAEtB,SAAS,EAAgB,EAAsB,CAC7C,IAAI,EAAM,EACN,EAAQ,EAAE,CAGd,IAAM,EAAwB,EAAI,QAAQ,aAAc,GAAG,CAI3D,GAHA,EAAM,QAAQ,EAAI,MAAM,EAAsB,OAAO,CAAC,CAGlD,EAAI,SAAS,MAAM,CAAE,CAGvB,EAAM,EACN,IAAM,GAAmB,EAAI,MAAM,YAAY,EAAI,EAAE,EAAE,OACjD,GAAmB,EAAI,MAAM,YAAY,EAAI,EAAE,EAAE,OACvD,GAAI,EAAkB,EAAiB,CACrC,IAAM,EAAO,EAAkB,EACzB,EAAS,OAAO,iBAAiB,EAAK,IAAK,IAAI,CAC/C,EAAqB,EAAI,QAAQ,EAAI,GAAG,CAC9C,EAAM,QAAQ,EAAI,MAAM,EAAmB,OAAO,CAAC,CACnD,EAAM,QAMD,EAAI,SAAS,IAAI,CACnB,EAAI,WAAW,UAAU,GAC5B,EAAM,UAAU,KAKlB,EAAM,WAAW,IAGnB,IAAM,EAAcA,EAAAA,WAAW,EAAM,KAAK,GAAG,CAAC,CACxC,EAA0BA,EAAAA,WAAW,EAAmB,EAAI,CAAC,CAC7D,EAAaA,EAAAA,WAAW,EAAI,CAElC,MAAO,+CADmB,EAAI,WAAW,UAAU,CAAG,iBAAmB,GACD,SAAS,EAAW,IAAI,EAAwB,MAAM,IAGhI,IAAI,EAA+B,IAAA,GAKnC,SAAgB,EAAiB,EAAc,EAA0B,EAAE,CAAU,CAC/E,GAAY,KACd,EAAe,OAAO,KAAK,EAAO,OAAO,KAAK,EAAS,OAAO,KAAK,EAAc,OAAO,IAAK,KAAK,CAElG,EAAS,UAAY,EAGvB,IAAI,EAAQ,EACZ,IAAM,EAAkB,EAAE,CAW1B,OATA,EAAK,QAAQ,GAAW,EAAO,GAAG,IAAS,CACzC,IAAM,EAAS,EAAK,EAAK,OAAS,GAC5B,EAAU,EAAK,MAAM,EAAO,EAAO,EAAI,GAI7C,OAHA,EAAM,KAAKA,EAAAA,WAAW,EAAQ,CAAC,CAC/B,EAAQ,EAAS,EAAM,OACvB,EAAM,KAAK,EAAgB,EAAM,CAAC,CAC3B,GACP,CAEK,EAAM,KAAK,GAAG,CAAGA,EAAAA,WAAW,EAAK,MAAM,EAAM,CAAC,CAIvD,SAAgB,EAA+B,EAAc,EAA0B,EAAE,CAAU,CACjG,OAAO,EAAK,MAAM;EAAK,CAAC,IAAI,GAAK,EAAiB,EAAG,EAAQ,CAAC,CAAC,KAAK,OAAO,CAK7E,SAAgB,EAAY,EAA2B,EAAuC,CAC5F,IAAM,EAAQ,EAAE,CAChB,IAAK,GAAI,CAAC,EAAK,KAAU,OAAO,QAAQ,EAAK,CAC3C,GAAI,GAAS,KAAM,CACZ,MAAM,QAAQ,EAAM,GACvB,EAAQ,CAAC,EAAM,EACjB,IAAK,IAAM,KAAK,EACV,GAAe,CAAC,EAAY,EAAE,EAEzB,GAAK,MAEd,EAAM,KAAK,GAAG,mBAAmB,EAAI,CAAC,GAAG,mBAAmB,OAAO,EAAE,CAAC,GAAG,CAI/E,OAAO,EAAM,KAAK,IAAI,CAGxB,SAAgB,EAAW,EAAqB,CAC9C,IAAM,EAAa,EAAE,CACrB,KAAO,EAAY,WAAW,IAAI,EAChC,EAAc,EAAY,UAAU,EAAE,CAExC,IAAM,EAAQ,EAAY,MAAM,IAAI,CACpC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrC,IAAM,EAAO,EAAM,GACb,EAAM,EAAK,QAAQ,IAAI,CAC7B,GAAI,EAAK,SAAW,EAAG,SACvB,IAAM,EAAM,EAAM,EAAI,EAAO,mBAAmB,EAAK,UAAU,EAAG,EAAI,CAAC,CACjE,EAAQ,EAAM,EAAI,GAAK,mBAAmB,EAAK,UAAU,EAAM,EAAE,CAAC,CACpE,EAAM,IAAQ,KAMhB,EAAM,GAAO,GALR,MAAM,QAAQ,EAAM,GAAK,GAC5B,EAAM,GAAO,CAAC,EAAM,GAAK,EAC3B,EAAM,GAAK,KAAK,EAAM,EAM1B,OAAO"}

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

@@ -1,12 +1,2 @@
-declare function toHumanReadableUrl(url: string): string;
-declare const RX_URL: RegExp;
-/** @deprecated use linkifyPlainText */
-declare function linkifyPlainTextSimple(text: string): string;
-interface LinkifyOptions {
-}
-declare function linkifyPlainText(text: string, options?: LinkifyOptions): string;
-declare function linkifyPlainTextWithLineBreaks(text: string, options?: LinkifyOptions): string;
-declare function encodeQuery(data: Record<string, any>, filterValue?: (value: any) => boolean): string;
-declare function parseQuery(queryString: string): any;
-
-export { type LinkifyOptions, RX_URL, encodeQuery, linkifyPlainText, linkifyPlainTextSimple, linkifyPlainTextWithLineBreaks, parseQuery, toHumanReadableUrl };
+import { a as linkifyPlainTextSimple, c as toHumanReadableUrl, i as linkifyPlainText, n as RX_URL, o as linkifyPlainTextWithLineBreaks, r as encodeQuery, s as parseQuery, t as LinkifyOptions } from "../../url-4ihUPRLi.cjs";
+export { LinkifyOptions, RX_URL, encodeQuery, linkifyPlainText, linkifyPlainTextSimple, linkifyPlainTextWithLineBreaks, parseQuery, toHumanReadableUrl };

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

@@ -0,0 +1,2 @@
+import { a as linkifyPlainTextSimple, c as toHumanReadableUrl, i as linkifyPlainText, n as RX_URL, o as linkifyPlainTextWithLineBreaks, r as encodeQuery, s as parseQuery, t as LinkifyOptions } from "../../url-Bz-wgbtY.mjs";
+export { LinkifyOptions, RX_URL, encodeQuery, linkifyPlainText, linkifyPlainTextSimple, linkifyPlainTextWithLineBreaks, parseQuery, toHumanReadableUrl };

package/dist/common/data/url.mjs

@@ -0,0 +1,3 @@
+import{escapeHTML as e}from"./html.mjs";function t(e){return e.replace(/^(https?:\/\/(www\.)?|mailto:)/gi,``).replace(/\/$/,``)}const n=/((?:(?:https?|ftp):)?\/\/(?:\S+@)?(?:(?!(?:10|127)(?:\.\d{1,3}){3})(?!(?:169\.254|192\.168)(?:\.\d{1,3}){2})(?!172\.(?:1[6-9]|2\d|3[01])(?:\.\d{1,3}){2})(?:[1-9]\d?|1\d\d|2[01]\d|22[0-3])(?:\.(?:1?\d{1,2}|2[0-4]\d|25[0-5])){2}\.(?:[1-9]\d?|1\d\d|2[0-4]\d|25[0-4])|(?:(?:[a-z0-9\u00A1-\uFFFF][\w\u00A1-\uFFFF-]{0,62})?[a-z0-9\u00A1-\uFFFF]\.)+[a-z\u00A1-\uFFFF]{2,}\.?)(?::\d{2,5})?(?:[/?#]\S*)?)/gi;function r(r){return r.split(n).map((n,r)=>{let i=e(n);return r%2?`<a target="_blank" rel="noopener noreferrer" href="${i}">${t(i)}</a>`:i}).join(``)}const i=/((mailto:)?[a-zA-Z0-9._%+-]+@[a-zA-Z0-9.-]+\.[a-zA-Z]{2,})/gi,a=/([a-zA-Z0-9]+\.[a-zA-Z]{2,})/gi;function o(n){var r=n,i=[];let a=r.replace(/[.,!?;:]*$/,``);if(i.unshift(r.slice(a.length)),r.includes(`://`)){r=a;let e=(r.match(/[\(\[\{]/g)||[]).length,t=(r.match(/[\)\]\}]/g)||[]).length;if(t>e){let n=t-e,a=RegExp(`[\\)\\]\\}]{0,${n}}$`,`g`),o=r.replace(a,``);i.unshift(r.slice(o.length)),r=o}}else r.includes(`@`)?r.startsWith(`mailto:`)||(r=`mailto:${a}`):r=`https://${a}`;let o=e(i.join(``)),s=e(t(r)),c=e(r);return`<a target="_blank" rel="noopener noreferrer"${r.startsWith(`http://`)?` class="_warn"`:``} href="${c}">${s}</a>${o}`}var s=void 0;function c(t,r={}){s==null?s=RegExp(`((${n.source})|(${i.source})|(${a.source}))`,`gi`):s.lastIndex=0;var c=0;let l=[];return t.replace(s,(n,...r)=>{let i=r[r.length-2],a=t.slice(c,i)??``;return l.push(e(a)),c=i+n.length,l.push(o(n)),n}),l.join(``)+e(t.slice(c))}function l(e,t={}){return e.split(`
+`).map(e=>c(e,t)).join(`<br>`)}function u(e,t){let n=[];for(let[r,i]of Object.entries(e))if(i!=null){Array.isArray(i)||(i=[i]);for(let e of i)t&&!t(e)||e!=null&&n.push(`${encodeURIComponent(r)}=${encodeURIComponent(String(e))}`)}return n.join(`&`)}function d(e){let t={};for(;e.startsWith(`?`);)e=e.substring(1);let n=e.split(`&`);for(let e=0;e<n.length;e++){let r=n[e],i=r.indexOf(`=`);if(r.length===0)continue;let a=i<0?r:decodeURIComponent(r.substring(0,i)),o=i<0?``:decodeURIComponent(r.substring(i+1));t[a]==null?t[a]=o:(Array.isArray(t[a])||(t[a]=[t[a]]),t[a].push(o))}return t}export{n as RX_URL,u as encodeQuery,c as linkifyPlainText,r as linkifyPlainTextSimple,l as linkifyPlainTextWithLineBreaks,d as parseQuery,t as toHumanReadableUrl};
+//# sourceMappingURL=url.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"url.mjs","names":[],"sources":["../../../src/common/data/url.ts"],"sourcesContent":["// https://mathiasbynens.be/demo/url-regex\n// https://gist.github.com/dperini/729294\n\nimport { escapeHTML } from './html'\n\n/// Remove scheme, www. and trailing slash for display purposes\nexport function toHumanReadableUrl(url: string): string {\n  return url.replace(/^(https?:\\/\\/(www\\.)?|mailto:)/gi, '').replace(/\\/$/, '')\n}\n\n//\n\nexport const RX_URL = /((?:(?:https?|ftp):)?\\/\\/(?:\\S+@)?(?:(?!(?:10|127)(?:\\.\\d{1,3}){3})(?!(?:169\\.254|192\\.168)(?:\\.\\d{1,3}){2})(?!172\\.(?:1[6-9]|2\\d|3[01])(?:\\.\\d{1,3}){2})(?:[1-9]\\d?|1\\d\\d|2[01]\\d|22[0-3])(?:\\.(?:1?\\d{1,2}|2[0-4]\\d|25[0-5])){2}\\.(?:[1-9]\\d?|1\\d\\d|2[0-4]\\d|25[0-4])|(?:(?:[a-z0-9\\u00A1-\\uFFFF][\\w\\u00A1-\\uFFFF-]{0,62})?[a-z0-9\\u00A1-\\uFFFF]\\.)+[a-z\\u00A1-\\uFFFF]{2,}\\.?)(?::\\d{2,5})?(?:[/?#]\\S*)?)/gi\n\n/** @deprecated use linkifyPlainText */\nexport function linkifyPlainTextSimple(text: string): string {\n  return text\n    .split(RX_URL)\n    .map((part, i) => {\n      const escapedPart = escapeHTML(part)\n      return i % 2\n        ? `<a target=\"_blank\" rel=\"noopener noreferrer\" href=\"${escapedPart}\">${toHumanReadableUrl(\n          escapedPart,\n        )}</a>`\n        : escapedPart\n    })\n    .join('')\n}\n\n// Advanced implementation that also handles email addresses and simple URLs without protocol\n\nconst RX_EMAIL = /((mailto:)?[a-zA-Z0-9._%+-]+@[a-zA-Z0-9.-]+\\.[a-zA-Z]{2,})/gi\nconst RX_SIMPLE_URL = /([a-zA-Z0-9]+\\.[a-zA-Z]{2,})/gi\n\nfunction handleUrlString(part: string): string {\n  var url = part\n  var rests = []\n\n  // Remove trailing punctuation from URLs\n  const urlWithoutPunctuation = url.replace(/[.,!?;:]*$/, '')\n  rests.unshift(url.slice(urlWithoutPunctuation.length))\n\n  // Full URL with protocol\n  if (url.includes('://')) {\n\n    // Remove trailing closing brackets if unbalanced\n    url = urlWithoutPunctuation\n    const openingBrackets = (url.match(/[\\(\\[\\{]/g) || []).length\n    const closingBrackets = (url.match(/[\\)\\]\\}]/g) || []).length\n    if (closingBrackets > openingBrackets) {\n      const diff = closingBrackets - openingBrackets\n      const rx = new RegExp(`[\\\\)\\\\]\\\\}]{0,${diff}}$`, 'g')\n      const urlWithoutTrailing = url.replace(rx, '')\n      rests.unshift(url.slice(urlWithoutTrailing.length))\n      url = urlWithoutTrailing\n    }\n\n  }\n\n  // Email address\n  else if (url.includes('@')) {\n    if (!url.startsWith('mailto:'))\n      url = `mailto:${urlWithoutPunctuation}`\n  }\n\n  // Simple URL without protocol\n  else {\n    url = `https://${urlWithoutPunctuation}`\n  }\n\n  const escapedRest = escapeHTML(rests.join(''))\n  const escapedHumanReadableUrl = escapeHTML(toHumanReadableUrl(url))\n  const escapedUrl = escapeHTML(url)\n  const classInsecureHttp = url.startsWith('http://') ? ' class=\"_warn\"' : ''\n  return `<a target=\"_blank\" rel=\"noopener noreferrer\"${classInsecureHttp} href=\"${escapedUrl}\">${escapedHumanReadableUrl}</a>${escapedRest}`\n}\n\nvar rxJoined: RegExp | undefined = undefined\n\nexport interface LinkifyOptions {\n}\n\nexport function linkifyPlainText(text: string, options: LinkifyOptions = {}): string {\n  if (rxJoined == null) {\n    rxJoined = new RegExp(`((${RX_URL.source})|(${RX_EMAIL.source})|(${RX_SIMPLE_URL.source}))`, 'gi')\n  } else {\n    rxJoined.lastIndex = 0\n  }\n\n  var index = 0\n  const parts: string[] = []\n\n  text.replace(rxJoined, (match, ...args) => {\n    const offset = args[args.length - 2]\n    const leading = text.slice(index, offset) ?? ''\n    parts.push(escapeHTML(leading))\n    index = offset + match.length\n    parts.push(handleUrlString(match))\n    return match\n  })\n\n  return parts.join('') + escapeHTML(text.slice(index))\n}\n\n\nexport function linkifyPlainTextWithLineBreaks(text: string, options: LinkifyOptions = {}): string {\n  return text.split('\\n').map(l => linkifyPlainText(l, options)).join('<br>')\n}\n\n//\n\nexport function encodeQuery(data: Record<string, any>, filterValue?: (value: any) => boolean) {\n  const pairs = []\n  for (let [key, value] of Object.entries(data)) {\n    if (value != null) {\n      if (!Array.isArray(value))\n        value = [value]\n      for (const v of value) {\n        if (filterValue && !filterValue(v))\n          continue\n        else if (v == null)\n          continue\n        pairs.push(`${encodeURIComponent(key)}=${encodeURIComponent(String(v))}`)\n      }\n    }\n  }\n  return pairs.join('&')\n}\n\nexport function parseQuery(queryString: string) {\n  const query: any = {}\n  while (queryString.startsWith('?')) {\n    queryString = queryString.substring(1)\n  }\n  const pairs = queryString.split('&')\n  for (let i = 0; i < pairs.length; i++) {\n    const part = pairs[i]\n    const idx = part.indexOf('=')\n    if (part.length === 0) continue\n    const key = idx < 0 ? part : decodeURIComponent(part.substring(0, idx))\n    const value = idx < 0 ? '' : decodeURIComponent(part.substring(idx + 1))\n    if (query[key] != null) {\n      if (!Array.isArray(query[key]))\n        query[key] = [query[key]]\n      query[key].push(value)\n    }\n    else {\n      query[key] = value\n    }\n  }\n  return query\n}\n"],"mappings":"wCAMA,SAAgB,EAAmB,EAAqB,CACtD,OAAO,EAAI,QAAQ,mCAAoC,GAAG,CAAC,QAAQ,MAAO,GAAG,CAK/E,MAAa,EAAS,gZAGtB,SAAgB,EAAuB,EAAsB,CAC3D,OAAO,EACJ,MAAM,EAAO,CACb,KAAK,EAAM,IAAM,CAChB,IAAM,EAAc,EAAW,EAAK,CACpC,OAAO,EAAI,EACP,sDAAsD,EAAY,IAAI,EACtE,EACD,CAAC,MACA,GACJ,CACD,KAAK,GAAG,CAKb,MAAM,EAAW,+DACX,EAAgB,iCAEtB,SAAS,EAAgB,EAAsB,CAC7C,IAAI,EAAM,EACN,EAAQ,EAAE,CAGd,IAAM,EAAwB,EAAI,QAAQ,aAAc,GAAG,CAI3D,GAHA,EAAM,QAAQ,EAAI,MAAM,EAAsB,OAAO,CAAC,CAGlD,EAAI,SAAS,MAAM,CAAE,CAGvB,EAAM,EACN,IAAM,GAAmB,EAAI,MAAM,YAAY,EAAI,EAAE,EAAE,OACjD,GAAmB,EAAI,MAAM,YAAY,EAAI,EAAE,EAAE,OACvD,GAAI,EAAkB,EAAiB,CACrC,IAAM,EAAO,EAAkB,EACzB,EAAS,OAAO,iBAAiB,EAAK,IAAK,IAAI,CAC/C,EAAqB,EAAI,QAAQ,EAAI,GAAG,CAC9C,EAAM,QAAQ,EAAI,MAAM,EAAmB,OAAO,CAAC,CACnD,EAAM,QAMD,EAAI,SAAS,IAAI,CACnB,EAAI,WAAW,UAAU,GAC5B,EAAM,UAAU,KAKlB,EAAM,WAAW,IAGnB,IAAM,EAAc,EAAW,EAAM,KAAK,GAAG,CAAC,CACxC,EAA0B,EAAW,EAAmB,EAAI,CAAC,CAC7D,EAAa,EAAW,EAAI,CAElC,MAAO,+CADmB,EAAI,WAAW,UAAU,CAAG,iBAAmB,GACD,SAAS,EAAW,IAAI,EAAwB,MAAM,IAGhI,IAAI,EAA+B,IAAA,GAKnC,SAAgB,EAAiB,EAAc,EAA0B,EAAE,CAAU,CAC/E,GAAY,KACd,EAAe,OAAO,KAAK,EAAO,OAAO,KAAK,EAAS,OAAO,KAAK,EAAc,OAAO,IAAK,KAAK,CAElG,EAAS,UAAY,EAGvB,IAAI,EAAQ,EACZ,IAAM,EAAkB,EAAE,CAW1B,OATA,EAAK,QAAQ,GAAW,EAAO,GAAG,IAAS,CACzC,IAAM,EAAS,EAAK,EAAK,OAAS,GAC5B,EAAU,EAAK,MAAM,EAAO,EAAO,EAAI,GAI7C,OAHA,EAAM,KAAK,EAAW,EAAQ,CAAC,CAC/B,EAAQ,EAAS,EAAM,OACvB,EAAM,KAAK,EAAgB,EAAM,CAAC,CAC3B,GACP,CAEK,EAAM,KAAK,GAAG,CAAG,EAAW,EAAK,MAAM,EAAM,CAAC,CAIvD,SAAgB,EAA+B,EAAc,EAA0B,EAAE,CAAU,CACjG,OAAO,EAAK,MAAM;EAAK,CAAC,IAAI,GAAK,EAAiB,EAAG,EAAQ,CAAC,CAAC,KAAK,OAAO,CAK7E,SAAgB,EAAY,EAA2B,EAAuC,CAC5F,IAAM,EAAQ,EAAE,CAChB,IAAK,GAAI,CAAC,EAAK,KAAU,OAAO,QAAQ,EAAK,CAC3C,GAAI,GAAS,KAAM,CACZ,MAAM,QAAQ,EAAM,GACvB,EAAQ,CAAC,EAAM,EACjB,IAAK,IAAM,KAAK,EACV,GAAe,CAAC,EAAY,EAAE,EAEzB,GAAK,MAEd,EAAM,KAAK,GAAG,mBAAmB,EAAI,CAAC,GAAG,mBAAmB,OAAO,EAAE,CAAC,GAAG,CAI/E,OAAO,EAAM,KAAK,IAAI,CAGxB,SAAgB,EAAW,EAAqB,CAC9C,IAAM,EAAa,EAAE,CACrB,KAAO,EAAY,WAAW,IAAI,EAChC,EAAc,EAAY,UAAU,EAAE,CAExC,IAAM,EAAQ,EAAY,MAAM,IAAI,CACpC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrC,IAAM,EAAO,EAAM,GACb,EAAM,EAAK,QAAQ,IAAI,CAC7B,GAAI,EAAK,SAAW,EAAG,SACvB,IAAM,EAAM,EAAM,EAAI,EAAO,mBAAmB,EAAK,UAAU,EAAG,EAAI,CAAC,CACjE,EAAQ,EAAM,EAAI,GAAK,mBAAmB,EAAK,UAAU,EAAM,EAAE,CAAC,CACpE,EAAM,IAAQ,KAMhB,EAAM,GAAO,GALR,MAAM,QAAQ,EAAM,GAAK,GAC5B,EAAM,GAAO,CAAC,EAAM,GAAK,EAC3B,EAAM,GAAK,KAAK,EAAM,EAM1B,OAAO"}

package/dist/common/data/utils.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkIXH5D35Scjs = require('../../chunk-IXH5D35S.cjs');require('../../chunk-5RHVNJKM.cjs');require('../../chunk-P7XCQ7WV.cjs');exports.cloneJsonObject = _chunkIXH5D35Scjs.h; exports.cloneObject = _chunkIXH5D35Scjs.g; exports.empty = _chunkIXH5D35Scjs.f; exports.ensureKey = _chunkIXH5D35Scjs.a; exports.ensureKeyAsync = _chunkIXH5D35Scjs.b; exports.first = _chunkIXH5D35Scjs.d; exports.forTimes = _chunkIXH5D35Scjs.k; exports.last = _chunkIXH5D35Scjs.e; exports.memoize = _chunkIXH5D35Scjs.i; exports.memoizeAsync = _chunkIXH5D35Scjs.j; exports.size = _chunkIXH5D35Scjs.c;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`./json.cjs`);function t(e,t,n){let r=e[t];return r===void 0&&(r=n(t,e),e[t]=r),r}async function n(e,t,n){let r=e[t];return r===void 0&&(r=await n(t,e),e[t]=r),r}function r(e){return e==null?0:e.size==null?e.length==null?Object.keys(e).length:e.length:e.size}function i(e){return e!=null&&e.length>0?e[0]:void 0}function a(e){return e!=null&&e.length>0?e[e.length-1]:void 0}function o(e){try{if(e!=null)return Array.isArray(e)||typeof e==`string`?e.length<=0:e?.size==null?Object.keys(e).length<=0:e.size<=0}catch(t){console.warn(`Failed to check if empty for`,e,t)}return!0}function s(t){return Object(t)===t?JSON.parse(e.jsonStringifySafe(t)):t}function c(t){return Object(t)===t?JSON.parse(e.jsonStringifySafe(t)):t}function l(e){let t=new Map;return n=>{if(t.has(n))return t.get(n);let r=e(n);return t.set(n,r),r}}function u(t){let n=new Map;return async(...r)=>{let i=e.jsonStringifySafe(r);if(n.has(i))return n.get(i);let a=await t(...r);return n.set(i,a),a}}function d(e,t){let n=[];for(let r=0;r<e;r++)n.push(t(r,e));return n}exports.cloneJsonObject=c,exports.cloneObject=s,exports.empty=o,exports.ensureKey=t,exports.ensureKeyAsync=n,exports.first=i,exports.forTimes=d,exports.last=a,exports.memoize=l,exports.memoizeAsync=u,exports.size=r;
 //# sourceMappingURL=utils.cjs.map

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

@@ -1 +1 @@
-{"version":3,"sources":["/Users/dirk/work/github-zeed/dist/common/data/utils.cjs"],"names":[],"mappings":"AAAA,qIAA2D,oCAAiC,oCAAiC,6bAAwK","file":"/Users/dirk/work/github-zeed/dist/common/data/utils.cjs"}
+{"version":3,"file":"utils.cjs","names":["jsonStringifySafe"],"sources":["../../../src/common/data/utils.ts"],"sourcesContent":["import type { Json } from '../types'\nimport { jsonStringifySafe } from './json'\n\n/**\n * Call a create function if key does not yet exist on an object. Returns the found or created object. Example:\n *\n * ```js\n * function createRoom(room, rooms) { return new Room() }\n * ensureKey(rooms, room, createRoom).enter()\n * ```\n */\nexport function ensureKey<T>(\n  obj: Record<string, T>,\n  key: string,\n  createFn: (key?: string, obj?: Record<string, T>) => T,\n): T {\n  let value = obj[key]\n  if (value === undefined) {\n    value = createFn(key, obj)\n    obj[key] = value\n  }\n  return value\n}\n\n/**\n * Call a create function if key does not yet exist on an object. Returns the found or created object. Example:\n *\n * ```js\n * async function fetchItem(id, cache) { ... }\n * let data = await ensureKey(cache, id, fetchItem)\n * ```\n */\nexport async function ensureKeyAsync<T>(\n  obj: Record<string, T>,\n  key: string,\n  createFn: (key?: string, obj?: Record<string, T>) => Promise<T>,\n): Promise<T> {\n  let value = obj[key]\n  if (value === undefined) {\n    value = await createFn(key, obj)\n    obj[key] = value\n  }\n  return value\n}\n\n/**\n * Returns the size of an object, array, string or similar. For example:\n */\nexport function size(obj: any) {\n  if (obj != null) {\n    if (obj.size != null)\n      return obj.size\n\n    if (obj.length != null)\n      return obj.length\n\n    return Object.keys(obj).length\n  }\n  return 0\n}\n\nexport function first<T>(array?: T[]): T | undefined {\n  return (array != null && array.length > 0) ? array[0] : undefined\n}\n\nexport function last<T>(array?: T[]): T | undefined {\n  return (array != null && array.length > 0) ? array[array.length - 1] : undefined\n}\n\n// True for [], {}, \"\", Map(), Set() and all primitives\nexport function empty(value: any): boolean {\n  try {\n    if (value != null) {\n      if (Array.isArray(value))\n        return value.length <= 0\n      else if (typeof value === 'string')\n        return value.length <= 0\n      else if (value?.size != null)\n        return value.size <= 0\n      else\n        return Object.keys(value).length <= 0\n    }\n  }\n  catch (err) {\n    console.warn('Failed to check if empty for', value, err)\n  }\n  return true\n}\n\n// Also see common/data/deep.ts\nexport function cloneObject<T>(obj: T): T {\n  // Primitives are immutable anyway\n  if (Object(obj) !== obj)\n    return obj\n\n  // Rude but very efficient way to clone\n  return JSON.parse(jsonStringifySafe(obj))\n}\n\n// export const cloneObject = typeof structuredClone !== 'undefined' ? structuredClone : _cloneObject\n\n// Also see common/data/deep.ts\nexport function cloneJsonObject<T = Json>(obj: T): T {\n  // Primitives are immutable anyway\n  if (Object(obj) !== obj)\n    return obj\n\n  // Rude but very efficient way to clone\n  return JSON.parse(jsonStringifySafe(obj))\n}\n\n// export function cloneStructuredObject<T>(obj: T): T {\n//   // Primitives are immutable anyway\n//   if (Object(obj) !== obj) return obj\n\n//   // https://developer.mozilla.org/en-US/docs/Web/API/structuredClone\n//   // @ts-ignore\n//   return typeof structuredClone !== \"undefined\"\n//     ? // @ts-ignore\n//       structuredClone(obj)\n//     : // Rude but very efficient way to clone\n//       JSON.parse(JSON.stringify(obj))\n// }\n\n/**\n * Cache result of a function. Same arguments have to always return the same result in order to get expected optimization!\n *\n * ```\n * const square = memoize((value) => value * value)`\n * square(2) // == 2\n * ```\n */\nexport function memoize<In, Out>(fn: (arg: In) => Out): (arg: In) => Out {\n  const cache = new Map<In, Out>()\n  return (n: In): Out => {\n    if (cache.has(n))\n      return cache.get(n)!\n    const result = fn(n)\n    cache.set(n, result)\n    return result\n  }\n}\n\nexport function memoizeAsync<In extends any[], Out extends Promise<any>>(fn: (...arg: In) => Out): (...arg: In) => Promise<Out> {\n  const cache = new Map<string, Out>()\n  return async (...n: In): Promise<Out> => {\n    const key = jsonStringifySafe(n)\n    if (cache.has(key))\n      return cache.get(key)!\n\n    const result = await fn(...n)\n    cache.set(key, result)\n    return result\n  }\n}\n\n// let cacheMemoizeDomain: any\n\n// /**\n//  * Same as `memoize` but does not require global const.\n//  */\n// export function memoizeDomain<In, Out>(domain: string, fn: (arg: In) => Out): (arg: In) => Out {\n//   if (cacheMemoizeDomain == null)\n//     cacheMemoizeDomain = new Map<string, Map<In, Out>>()\n//   if (!cacheMemoizeDomain.has(domain))\n//     cacheMemoizeDomain.set(domain, new Map())\n//   const cache = cacheMemoizeDomain.get(domain)\n//   return (n: In): Out => {\n//     if (cache.has(n))\n//       return cache.get(n)!\n//     const result = fn(n)\n//     cache.set(n, result)\n//     return result\n//   }\n// }\n\n// export default function memoizeMultiArguments<T extends Function>(func: T) {\n//   const cache = new Map()\n\n//   const memoized = function (...args: any[]) {\n//     let innerCache = cache\n\n//     // first layer of the map is the arguments length\n//     // if two calls have different number of arguments\n//     // then they cannot be the same call\n//     if (!innerCache.has(args.length))\n//       innerCache.set(args.length, new Map())\n\n//     innerCache = innerCache.get(args.length)\n\n//     // using args.length because func.length is 0 for variadic functions\n//     for (let i = 0; i < args.length - 1; i++) {\n//       const key = args[i]\n//       if (!innerCache.has(key))\n//         innerCache.set(key, new Map())\n\n//       innerCache = innerCache.get(key)\n//     }\n\n//     const key = args[args.length - 1]\n//     if (innerCache.has(key))\n//       return innerCache.get(key)\n\n//     const result = func(...args)\n//     innerCache.set(key, result)\n//     return result\n//   }\n\n//   return memoized\n// }\n\n/** Repeat `count` times. Starts with `0` */\nexport function forTimes<T = undefined>(\n  count: number,\n  fn: (i: number, count: number) => T,\n): T[] {\n  const result = []\n  for (let i = 0; i < count; i++)\n    result.push(fn(i, count))\n\n  return result\n}\n"],"mappings":"iGAWA,SAAgB,EACd,EACA,EACA,EACG,CACH,IAAI,EAAQ,EAAI,GAKhB,OAJI,IAAU,IAAA,KACZ,EAAQ,EAAS,EAAK,EAAI,CAC1B,EAAI,GAAO,GAEN,EAWT,eAAsB,EACpB,EACA,EACA,EACY,CACZ,IAAI,EAAQ,EAAI,GAKhB,OAJI,IAAU,IAAA,KACZ,EAAQ,MAAM,EAAS,EAAK,EAAI,CAChC,EAAI,GAAO,GAEN,EAMT,SAAgB,EAAK,EAAU,CAU7B,OATI,GAAO,KASJ,EARD,EAAI,MAAQ,KAGZ,EAAI,QAAU,KAGX,OAAO,KAAK,EAAI,CAAC,OAFf,EAAI,OAHJ,EAAI,KAUjB,SAAgB,EAAS,EAA4B,CACnD,OAAQ,GAAS,MAAQ,EAAM,OAAS,EAAK,EAAM,GAAK,IAAA,GAG1D,SAAgB,EAAQ,EAA4B,CAClD,OAAQ,GAAS,MAAQ,EAAM,OAAS,EAAK,EAAM,EAAM,OAAS,GAAK,IAAA,GAIzE,SAAgB,EAAM,EAAqB,CACzC,GAAI,CACF,GAAI,GAAS,KAQT,OAPE,MAAM,QAAQ,EAAM,EAEf,OAAO,GAAU,SADjB,EAAM,QAAU,EAGhB,GAAO,MAAQ,KAGf,OAAO,KAAK,EAAM,CAAC,QAAU,EAF7B,EAAM,MAAQ,QAKpB,EAAK,CACV,QAAQ,KAAK,+BAAgC,EAAO,EAAI,CAE1D,MAAO,GAIT,SAAgB,EAAe,EAAW,CAMxC,OAJI,OAAO,EAAI,GAAK,EAIb,KAAK,MAAMA,EAAAA,kBAAkB,EAAI,CAAC,CAHhC,EASX,SAAgB,EAA0B,EAAW,CAMnD,OAJI,OAAO,EAAI,GAAK,EAIb,KAAK,MAAMA,EAAAA,kBAAkB,EAAI,CAAC,CAHhC,EA2BX,SAAgB,EAAiB,EAAwC,CACvE,IAAM,EAAQ,IAAI,IAClB,MAAQ,IAAe,CACrB,GAAI,EAAM,IAAI,EAAE,CACd,OAAO,EAAM,IAAI,EAAE,CACrB,IAAM,EAAS,EAAG,EAAE,CAEpB,OADA,EAAM,IAAI,EAAG,EAAO,CACb,GAIX,SAAgB,EAAyD,EAAuD,CAC9H,IAAM,EAAQ,IAAI,IAClB,OAAO,MAAO,GAAG,IAAwB,CACvC,IAAM,EAAMA,EAAAA,kBAAkB,EAAE,CAChC,GAAI,EAAM,IAAI,EAAI,CAChB,OAAO,EAAM,IAAI,EAAI,CAEvB,IAAM,EAAS,MAAM,EAAG,GAAG,EAAE,CAE7B,OADA,EAAM,IAAI,EAAK,EAAO,CACf,GA4DX,SAAgB,EACd,EACA,EACK,CACL,IAAM,EAAS,EAAE,CACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,IACzB,EAAO,KAAK,EAAG,EAAG,EAAM,CAAC,CAE3B,OAAO"}

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

@@ -1,43 +1,2 @@
-import { Json } from '../types.cjs';
-
-/**
- * Call a create function if key does not yet exist on an object. Returns the found or created object. Example:
- *
- * ```js
- * function createRoom(room, rooms) { return new Room() }
- * ensureKey(rooms, room, createRoom).enter()
- * ```
- */
-declare function ensureKey<T>(obj: Record<string, T>, key: string, createFn: (key?: string, obj?: Record<string, T>) => T): T;
-/**
- * Call a create function if key does not yet exist on an object. Returns the found or created object. Example:
- *
- * ```js
- * async function fetchItem(id, cache) { ... }
- * let data = await ensureKey(cache, id, fetchItem)
- * ```
- */
-declare function ensureKeyAsync<T>(obj: Record<string, T>, key: string, createFn: (key?: string, obj?: Record<string, T>) => Promise<T>): Promise<T>;
-/**
- * Returns the size of an object, array, string or similar. For example:
- */
-declare function size(obj: any): any;
-declare function first<T>(array?: T[]): T | undefined;
-declare function last<T>(array?: T[]): T | undefined;
-declare function empty(value: any): boolean;
-declare function cloneObject<T>(obj: T): T;
-declare function cloneJsonObject<T = Json>(obj: T): T;
-/**
- * Cache result of a function. Same arguments have to always return the same result in order to get expected optimization!
- *
- * ```
- * const square = memoize((value) => value * value)`
- * square(2) // == 2
- * ```
- */
-declare function memoize<In, Out>(fn: (arg: In) => Out): (arg: In) => Out;
-declare function memoizeAsync<In extends any[], Out extends Promise<any>>(fn: (...arg: In) => Out): (...arg: In) => Promise<Out>;
-/** Repeat `count` times. Starts with `0` */
-declare function forTimes<T = undefined>(count: number, fn: (i: number, count: number) => T): T[];
-
-export { cloneJsonObject, cloneObject, empty, ensureKey, ensureKeyAsync, first, forTimes, last, memoize, memoizeAsync, size };
+import { a as ensureKeyAsync, c as last, d as size, i as ensureKey, l as memoize, n as cloneObject, o as first, r as empty, s as forTimes, t as cloneJsonObject, u as memoizeAsync } from "../../utils-DxFqV18u.cjs";
+export { cloneJsonObject, cloneObject, empty, ensureKey, ensureKeyAsync, first, forTimes, last, memoize, memoizeAsync, size };

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

@@ -0,0 +1,2 @@
+import { a as ensureKeyAsync, c as last, d as size, i as ensureKey, l as memoize, n as cloneObject, o as first, r as empty, s as forTimes, t as cloneJsonObject, u as memoizeAsync } from "../../utils-DX0sASsJ.mjs";
+export { cloneJsonObject, cloneObject, empty, ensureKey, ensureKeyAsync, first, forTimes, last, memoize, memoizeAsync, size };

package/dist/common/data/utils.mjs

@@ -0,0 +1,2 @@
+import{jsonStringifySafe as e}from"./json.mjs";function t(e,t,n){let r=e[t];return r===void 0&&(r=n(t,e),e[t]=r),r}async function n(e,t,n){let r=e[t];return r===void 0&&(r=await n(t,e),e[t]=r),r}function r(e){return e==null?0:e.size==null?e.length==null?Object.keys(e).length:e.length:e.size}function i(e){return e!=null&&e.length>0?e[0]:void 0}function a(e){return e!=null&&e.length>0?e[e.length-1]:void 0}function o(e){try{if(e!=null)return Array.isArray(e)||typeof e==`string`?e.length<=0:e?.size==null?Object.keys(e).length<=0:e.size<=0}catch(t){console.warn(`Failed to check if empty for`,e,t)}return!0}function s(t){return Object(t)===t?JSON.parse(e(t)):t}function c(t){return Object(t)===t?JSON.parse(e(t)):t}function l(e){let t=new Map;return n=>{if(t.has(n))return t.get(n);let r=e(n);return t.set(n,r),r}}function u(t){let n=new Map;return async(...r)=>{let i=e(r);if(n.has(i))return n.get(i);let a=await t(...r);return n.set(i,a),a}}function d(e,t){let n=[];for(let r=0;r<e;r++)n.push(t(r,e));return n}export{c as cloneJsonObject,s as cloneObject,o as empty,t as ensureKey,n as ensureKeyAsync,i as first,d as forTimes,a as last,l as memoize,u as memoizeAsync,r as size};
+//# sourceMappingURL=utils.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"utils.mjs","names":[],"sources":["../../../src/common/data/utils.ts"],"sourcesContent":["import type { Json } from '../types'\nimport { jsonStringifySafe } from './json'\n\n/**\n * Call a create function if key does not yet exist on an object. Returns the found or created object. Example:\n *\n * ```js\n * function createRoom(room, rooms) { return new Room() }\n * ensureKey(rooms, room, createRoom).enter()\n * ```\n */\nexport function ensureKey<T>(\n  obj: Record<string, T>,\n  key: string,\n  createFn: (key?: string, obj?: Record<string, T>) => T,\n): T {\n  let value = obj[key]\n  if (value === undefined) {\n    value = createFn(key, obj)\n    obj[key] = value\n  }\n  return value\n}\n\n/**\n * Call a create function if key does not yet exist on an object. Returns the found or created object. Example:\n *\n * ```js\n * async function fetchItem(id, cache) { ... }\n * let data = await ensureKey(cache, id, fetchItem)\n * ```\n */\nexport async function ensureKeyAsync<T>(\n  obj: Record<string, T>,\n  key: string,\n  createFn: (key?: string, obj?: Record<string, T>) => Promise<T>,\n): Promise<T> {\n  let value = obj[key]\n  if (value === undefined) {\n    value = await createFn(key, obj)\n    obj[key] = value\n  }\n  return value\n}\n\n/**\n * Returns the size of an object, array, string or similar. For example:\n */\nexport function size(obj: any) {\n  if (obj != null) {\n    if (obj.size != null)\n      return obj.size\n\n    if (obj.length != null)\n      return obj.length\n\n    return Object.keys(obj).length\n  }\n  return 0\n}\n\nexport function first<T>(array?: T[]): T | undefined {\n  return (array != null && array.length > 0) ? array[0] : undefined\n}\n\nexport function last<T>(array?: T[]): T | undefined {\n  return (array != null && array.length > 0) ? array[array.length - 1] : undefined\n}\n\n// True for [], {}, \"\", Map(), Set() and all primitives\nexport function empty(value: any): boolean {\n  try {\n    if (value != null) {\n      if (Array.isArray(value))\n        return value.length <= 0\n      else if (typeof value === 'string')\n        return value.length <= 0\n      else if (value?.size != null)\n        return value.size <= 0\n      else\n        return Object.keys(value).length <= 0\n    }\n  }\n  catch (err) {\n    console.warn('Failed to check if empty for', value, err)\n  }\n  return true\n}\n\n// Also see common/data/deep.ts\nexport function cloneObject<T>(obj: T): T {\n  // Primitives are immutable anyway\n  if (Object(obj) !== obj)\n    return obj\n\n  // Rude but very efficient way to clone\n  return JSON.parse(jsonStringifySafe(obj))\n}\n\n// export const cloneObject = typeof structuredClone !== 'undefined' ? structuredClone : _cloneObject\n\n// Also see common/data/deep.ts\nexport function cloneJsonObject<T = Json>(obj: T): T {\n  // Primitives are immutable anyway\n  if (Object(obj) !== obj)\n    return obj\n\n  // Rude but very efficient way to clone\n  return JSON.parse(jsonStringifySafe(obj))\n}\n\n// export function cloneStructuredObject<T>(obj: T): T {\n//   // Primitives are immutable anyway\n//   if (Object(obj) !== obj) return obj\n\n//   // https://developer.mozilla.org/en-US/docs/Web/API/structuredClone\n//   // @ts-ignore\n//   return typeof structuredClone !== \"undefined\"\n//     ? // @ts-ignore\n//       structuredClone(obj)\n//     : // Rude but very efficient way to clone\n//       JSON.parse(JSON.stringify(obj))\n// }\n\n/**\n * Cache result of a function. Same arguments have to always return the same result in order to get expected optimization!\n *\n * ```\n * const square = memoize((value) => value * value)`\n * square(2) // == 2\n * ```\n */\nexport function memoize<In, Out>(fn: (arg: In) => Out): (arg: In) => Out {\n  const cache = new Map<In, Out>()\n  return (n: In): Out => {\n    if (cache.has(n))\n      return cache.get(n)!\n    const result = fn(n)\n    cache.set(n, result)\n    return result\n  }\n}\n\nexport function memoizeAsync<In extends any[], Out extends Promise<any>>(fn: (...arg: In) => Out): (...arg: In) => Promise<Out> {\n  const cache = new Map<string, Out>()\n  return async (...n: In): Promise<Out> => {\n    const key = jsonStringifySafe(n)\n    if (cache.has(key))\n      return cache.get(key)!\n\n    const result = await fn(...n)\n    cache.set(key, result)\n    return result\n  }\n}\n\n// let cacheMemoizeDomain: any\n\n// /**\n//  * Same as `memoize` but does not require global const.\n//  */\n// export function memoizeDomain<In, Out>(domain: string, fn: (arg: In) => Out): (arg: In) => Out {\n//   if (cacheMemoizeDomain == null)\n//     cacheMemoizeDomain = new Map<string, Map<In, Out>>()\n//   if (!cacheMemoizeDomain.has(domain))\n//     cacheMemoizeDomain.set(domain, new Map())\n//   const cache = cacheMemoizeDomain.get(domain)\n//   return (n: In): Out => {\n//     if (cache.has(n))\n//       return cache.get(n)!\n//     const result = fn(n)\n//     cache.set(n, result)\n//     return result\n//   }\n// }\n\n// export default function memoizeMultiArguments<T extends Function>(func: T) {\n//   const cache = new Map()\n\n//   const memoized = function (...args: any[]) {\n//     let innerCache = cache\n\n//     // first layer of the map is the arguments length\n//     // if two calls have different number of arguments\n//     // then they cannot be the same call\n//     if (!innerCache.has(args.length))\n//       innerCache.set(args.length, new Map())\n\n//     innerCache = innerCache.get(args.length)\n\n//     // using args.length because func.length is 0 for variadic functions\n//     for (let i = 0; i < args.length - 1; i++) {\n//       const key = args[i]\n//       if (!innerCache.has(key))\n//         innerCache.set(key, new Map())\n\n//       innerCache = innerCache.get(key)\n//     }\n\n//     const key = args[args.length - 1]\n//     if (innerCache.has(key))\n//       return innerCache.get(key)\n\n//     const result = func(...args)\n//     innerCache.set(key, result)\n//     return result\n//   }\n\n//   return memoized\n// }\n\n/** Repeat `count` times. Starts with `0` */\nexport function forTimes<T = undefined>(\n  count: number,\n  fn: (i: number, count: number) => T,\n): T[] {\n  const result = []\n  for (let i = 0; i < count; i++)\n    result.push(fn(i, count))\n\n  return result\n}\n"],"mappings":"+CAWA,SAAgB,EACd,EACA,EACA,EACG,CACH,IAAI,EAAQ,EAAI,GAKhB,OAJI,IAAU,IAAA,KACZ,EAAQ,EAAS,EAAK,EAAI,CAC1B,EAAI,GAAO,GAEN,EAWT,eAAsB,EACpB,EACA,EACA,EACY,CACZ,IAAI,EAAQ,EAAI,GAKhB,OAJI,IAAU,IAAA,KACZ,EAAQ,MAAM,EAAS,EAAK,EAAI,CAChC,EAAI,GAAO,GAEN,EAMT,SAAgB,EAAK,EAAU,CAU7B,OATI,GAAO,KASJ,EARD,EAAI,MAAQ,KAGZ,EAAI,QAAU,KAGX,OAAO,KAAK,EAAI,CAAC,OAFf,EAAI,OAHJ,EAAI,KAUjB,SAAgB,EAAS,EAA4B,CACnD,OAAQ,GAAS,MAAQ,EAAM,OAAS,EAAK,EAAM,GAAK,IAAA,GAG1D,SAAgB,EAAQ,EAA4B,CAClD,OAAQ,GAAS,MAAQ,EAAM,OAAS,EAAK,EAAM,EAAM,OAAS,GAAK,IAAA,GAIzE,SAAgB,EAAM,EAAqB,CACzC,GAAI,CACF,GAAI,GAAS,KAQT,OAPE,MAAM,QAAQ,EAAM,EAEf,OAAO,GAAU,SADjB,EAAM,QAAU,EAGhB,GAAO,MAAQ,KAGf,OAAO,KAAK,EAAM,CAAC,QAAU,EAF7B,EAAM,MAAQ,QAKpB,EAAK,CACV,QAAQ,KAAK,+BAAgC,EAAO,EAAI,CAE1D,MAAO,GAIT,SAAgB,EAAe,EAAW,CAMxC,OAJI,OAAO,EAAI,GAAK,EAIb,KAAK,MAAM,EAAkB,EAAI,CAAC,CAHhC,EASX,SAAgB,EAA0B,EAAW,CAMnD,OAJI,OAAO,EAAI,GAAK,EAIb,KAAK,MAAM,EAAkB,EAAI,CAAC,CAHhC,EA2BX,SAAgB,EAAiB,EAAwC,CACvE,IAAM,EAAQ,IAAI,IAClB,MAAQ,IAAe,CACrB,GAAI,EAAM,IAAI,EAAE,CACd,OAAO,EAAM,IAAI,EAAE,CACrB,IAAM,EAAS,EAAG,EAAE,CAEpB,OADA,EAAM,IAAI,EAAG,EAAO,CACb,GAIX,SAAgB,EAAyD,EAAuD,CAC9H,IAAM,EAAQ,IAAI,IAClB,OAAO,MAAO,GAAG,IAAwB,CACvC,IAAM,EAAM,EAAkB,EAAE,CAChC,GAAI,EAAM,IAAI,EAAI,CAChB,OAAO,EAAM,IAAI,EAAI,CAEvB,IAAM,EAAS,MAAM,EAAG,GAAG,EAAE,CAE7B,OADA,EAAM,IAAI,EAAK,EAAO,CACf,GA4DX,SAAgB,EACd,EACA,EACK,CACL,IAAM,EAAS,EAAE,CACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,IACzB,EAAO,KAAK,EAAG,EAAG,EAAM,CAAC,CAE3B,OAAO"}

package/dist/common/data/wordlist.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkKJ3RKZH5cjs = require('../../chunk-KJ3RKZH5.cjs');require('../../chunk-KFNJHRCB.cjs');require('../../chunk-TNMEWZPW.cjs');require('../../chunk-5RHVNJKM.cjs');require('../../chunk-P7XCQ7WV.cjs');exports.Uint8ArrayToWords = _chunkKJ3RKZH5cjs.a; exports.wordsToUint8Array = _chunkKJ3RKZH5cjs.b;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`../../bin-Ce3i6ABn.cjs`),t=require(`./string-deburr.cjs`),n=`aardvark.absurd.accrue.acme.adrift.adult.afflict.ahead.aimless.Algol.allow.alone.ammo.ancient.apple.artist.assume.Athens.atlas.Aztec.baboon.backfield.backward.basalt.beaming.bedlamp.beehive.beeswax.befriend.Belfast.berserk.billiard.bison.blackjack.blockade.blowtorch.bluebird.bombast.bookshelf.brackish.breadline.breakup.brickyard.briefcase.Burbank.button.buzzard.cement.chairlift.chatter.checkup.chisel.choking.chopper.Christmas.clamshell.classic.classroom.cleanup.clockwork.cobra.commence.concert.cowbell.crackdown.cranky.crowfoot.crucial.crumpled.crusade.cubic.deadbolt.deckhand.dogsled.dosage.dragnet.drainage.dreadful.drifter.dropper.drumbeat.drunken.Dupont.dwelling.eating.edict.egghead.eightball.endorse.endow.enlist.erase.escape.exceed.eyeglass.eyetooth.facial.fallout.flagpole.flatfoot.flytrap.fracture.fragile.framework.freedom.frighten.gazelle.Geiger.Glasgow.glitter.glucose.goggles.goldfish.gremlin.guidance.hamlet.highchair.hockey.hotdog.indoors.indulge.inverse.involve.island.Janus.jawbone.keyboard.kickoff.kiwi.klaxon.lockup.merit.minnow.miser.Mohawk.mural.music.Neptune.newborn.nightbird.obtuse.offload.oilfield.optic.orca.payday.peachy.pheasant.physique.playhouse.Pluto.preclude.prefer.preshrunk.printer.profile.prowler.pupil.puppy.python.quadrant.quiver.quota.ragtime.ratchet.rebirth.reform.regain.reindeer.rematch.repay.retouch.revenge.reward.rhythm.ringbolt.robust.rocker.ruffled.sawdust.scallion.scenic.scorecard.Scotland.seabird.select.sentence.shadow.showgirl.skullcap.skydive.slingshot.slothful.slowdown.snapline.snapshot.snowcap.snowslide.solo.spaniel.spearhead.spellbind.spheroid.spigot.spindle.spoilage.spyglass.stagehand.stagnate.stairway.standard.stapler.steamship.stepchild.sterling.stockman.stopwatch.stormy.sugar.surmount.suspense.swelter.tactics.talon.tapeworm.tempest.tiger.tissue.tonic.tracker.transit.trauma.treadmill.Trojan.trouble.tumor.tunnel.tycoon.umpire.uncut.unearth.unwind.uproot.upset.upshot.vapor.village.virus.Vulcan.waffle.wallet.watchword.wayside.willow.woodlark.Zulu`.split(`.`),r=`adroitness.adviser.aggregate.alkali.almighty.amulet.amusement.antenna.applicant.Apollo.armistice.article.asteroid.Atlantic.atmosphere.autopsy.Babylon.backwater.barbecue.belowground.bifocals.bodyguard.borderline.bottomless.Bradbury.Brazilian.breakaway.Burlington.businessman.butterfat.Camelot.candidate.cannonball.Capricorn.caravan.caretaker.celebrate.cellulose.certify.chambermaid.Cherokee.Chicago.clergyman.coherence.combustion.commando.company.component.concurrent.confidence.conformist.congregate.consensus.consulting.corporate.corrosion.councilman.crossover.cumbersome.customer.Dakota.decadence.December.decimal.designing.detector.detergent.determine.dictator.dinosaur.direction.disable.disbelief.disruptive.distortion.divisive.document.embezzle.enchanting.enrollment.enterprise.equation.equipment.escapade.Eskimo.everyday.examine.existence.exodus.fascinate.filament.finicky.forever.fortitude.frequency.gadgetry.Galveston.getaway.glossary.gossamer.graduate.gravity.guitarist.hamburger.Hamilton.handiwork.hazardous.headwaters.hemisphere.hesitate.hideaway.holiness.hurricane.hydraulic.impartial.impetus.inception.indigo.inertia.infancy.inferno.informant.insincere.insurgent.integrate.intention.inventive.Istanbul.Jamaica.Jupiter.leprosy.letterhead.liberty.maritime.matchmaker.maverick.Medusa.megaton.microscope.microwave.midsummer.millionaire.miracle.misnomer.molasses.molecule.Montana.monument.mosquito.narrative.nebula.newsletter.Norwegian.October.Ohio.onlooker.opulent.Orlando.outfielder.Pacific.pandemic.pandora.paperweight.paragon.paragraph.paramount.passenger.pedigree.Pegasus.penetrate.perceptive.performance.pharmacy.phonetic.photograph.pioneer.pocketful.politeness.positive.potato.processor.prophecy.provincial.proximate.puberty.publisher.pyramid.quantity.racketeer.rebellion.recipe.recover.repellent.replica.reproduce.resistor.responsive.retraction.retrieval.retrospect.revenue.revival.revolver.Sahara.sandalwood.sardonic.Saturday.savagery.scavenger.sensation.sociable.souvenir.specialist.speculate.stethoscope.stupendous.supportive.surrender.suspicious.sympathy.tambourine.telephone.therapist.tobacco.tolerance.tomorrow.torpedo.tradition.travesty.trombonist.truncated.typewriter.ultimate.undaunted.underfoot.unicorn.unify.universe.unravel.upcoming.vacancy.vagabond.versatile.vertigo.Virginia.visitor.vocalist.voyager.warranty.Waterloo.whimsical.Wichita.Wilmington.Wyoming.yesteryear.Yucatan`.split(`.`);function i(e,t=` `,i=` `){return Array.from(e).map((e,a)=>a%2?r[e]+i:n[e]+t).join(``).slice(0,-(e.length%2?t:i).length)}function a(i){return e.v(i.map((e,i)=>(i%2?r:n).findIndex(n=>n.toLocaleLowerCase()===t.deburr(e).toLocaleLowerCase().trim())))}exports.Uint8ArrayToWords=i,exports.wordsToUint8Array=a;
 //# sourceMappingURL=wordlist.cjs.map

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

@@ -1 +1 @@
-{"version":3,"sources":["/Users/dirk/work/github-zeed/dist/common/data/wordlist.cjs"],"names":[],"mappings":"AAAA,qIAAyC,oCAAiC,oCAAiC,oCAAiC,oCAAiC,iGAAsD","file":"/Users/dirk/work/github-zeed/dist/common/data/wordlist.cjs"}
+{"version":3,"file":"wordlist.cjs","names":["toUint8Array","deburr"],"sources":["../../../src/common/data/wordlist.ts"],"sourcesContent":["// PGP Word List from https://web.mit.edu/network/pgpfone/manual/index.html#PGP000062\n// See https://en.wikipedia.org/wiki/PGP_word_list\n\nimport { toUint8Array } from './bin'\nimport { deburr } from './string-deburr'\n\nconst wordsEven = ['aardvark', 'absurd', 'accrue', 'acme', 'adrift', 'adult', 'afflict', 'ahead', 'aimless', 'Algol', 'allow', 'alone', 'ammo', 'ancient', 'apple', 'artist', 'assume', 'Athens', 'atlas', 'Aztec', 'baboon', 'backfield', 'backward', 'basalt', 'beaming', 'bedlamp', 'beehive', 'beeswax', 'befriend', 'Belfast', 'berserk', 'billiard', 'bison', 'blackjack', 'blockade', 'blowtorch', 'bluebird', 'bombast', 'bookshelf', 'brackish', 'breadline', 'breakup', 'brickyard', 'briefcase', 'Burbank', 'button', 'buzzard', 'cement', 'chairlift', 'chatter', 'checkup', 'chisel', 'choking', 'chopper', 'Christmas', 'clamshell', 'classic', 'classroom', 'cleanup', 'clockwork', 'cobra', 'commence', 'concert', 'cowbell', 'crackdown', 'cranky', 'crowfoot', 'crucial', 'crumpled', 'crusade', 'cubic', 'deadbolt', 'deckhand', 'dogsled', 'dosage', 'dragnet', 'drainage', 'dreadful', 'drifter', 'dropper', 'drumbeat', 'drunken', 'Dupont', 'dwelling', 'eating', 'edict', 'egghead', 'eightball', 'endorse', 'endow', 'enlist', 'erase', 'escape', 'exceed', 'eyeglass', 'eyetooth', 'facial', 'fallout', 'flagpole', 'flatfoot', 'flytrap', 'fracture', 'fragile', 'framework', 'freedom', 'frighten', 'gazelle', 'Geiger', 'Glasgow', 'glitter', 'glucose', 'goggles', 'goldfish', 'gremlin', 'guidance', 'hamlet', 'highchair', 'hockey', 'hotdog', 'indoors', 'indulge', 'inverse', 'involve', 'island', 'Janus', 'jawbone', 'keyboard', 'kickoff', 'kiwi', 'klaxon', 'lockup', 'merit', 'minnow', 'miser', 'Mohawk', 'mural', 'music', 'Neptune', 'newborn', 'nightbird', 'obtuse', 'offload', 'oilfield', 'optic', 'orca', 'payday', 'peachy', 'pheasant', 'physique', 'playhouse', 'Pluto', 'preclude', 'prefer', 'preshrunk', 'printer', 'profile', 'prowler', 'pupil', 'puppy', 'python', 'quadrant', 'quiver', 'quota', 'ragtime', 'ratchet', 'rebirth', 'reform', 'regain', 'reindeer', 'rematch', 'repay', 'retouch', 'revenge', 'reward', 'rhythm', 'ringbolt', 'robust', 'rocker', 'ruffled', 'sawdust', 'scallion', 'scenic', 'scorecard', 'Scotland', 'seabird', 'select', 'sentence', 'shadow', 'showgirl', 'skullcap', 'skydive', 'slingshot', 'slothful', 'slowdown', 'snapline', 'snapshot', 'snowcap', 'snowslide', 'solo', 'spaniel', 'spearhead', 'spellbind', 'spheroid', 'spigot', 'spindle', 'spoilage', 'spyglass', 'stagehand', 'stagnate', 'stairway', 'standard', 'stapler', 'steamship', 'stepchild', 'sterling', 'stockman', 'stopwatch', 'stormy', 'sugar', 'surmount', 'suspense', 'swelter', 'tactics', 'talon', 'tapeworm', 'tempest', 'tiger', 'tissue', 'tonic', 'tracker', 'transit', 'trauma', 'treadmill', 'Trojan', 'trouble', 'tumor', 'tunnel', 'tycoon', 'umpire', 'uncut', 'unearth', 'unwind', 'uproot', 'upset', 'upshot', 'vapor', 'village', 'virus', 'Vulcan', 'waffle', 'wallet', 'watchword', 'wayside', 'willow', 'woodlark', 'Zulu']\nconst wordsOdd = ['adroitness', 'adviser', 'aggregate', 'alkali', 'almighty', 'amulet', 'amusement', 'antenna', 'applicant', 'Apollo', 'armistice', 'article', 'asteroid', 'Atlantic', 'atmosphere', 'autopsy', 'Babylon', 'backwater', 'barbecue', 'belowground', 'bifocals', 'bodyguard', 'borderline', 'bottomless', 'Bradbury', 'Brazilian', 'breakaway', 'Burlington', 'businessman', 'butterfat', 'Camelot', 'candidate', 'cannonball', 'Capricorn', 'caravan', 'caretaker', 'celebrate', 'cellulose', 'certify', 'chambermaid', 'Cherokee', 'Chicago', 'clergyman', 'coherence', 'combustion', 'commando', 'company', 'component', 'concurrent', 'confidence', 'conformist', 'congregate', 'consensus', 'consulting', 'corporate', 'corrosion', 'councilman', 'crossover', 'cumbersome', 'customer', 'Dakota', 'decadence', 'December', 'decimal', 'designing', 'detector', 'detergent', 'determine', 'dictator', 'dinosaur', 'direction', 'disable', 'disbelief', 'disruptive', 'distortion', 'divisive', 'document', 'embezzle', 'enchanting', 'enrollment', 'enterprise', 'equation', 'equipment', 'escapade', 'Eskimo', 'everyday', 'examine', 'existence', 'exodus', 'fascinate', 'filament', 'finicky', 'forever', 'fortitude', 'frequency', 'gadgetry', 'Galveston', 'getaway', 'glossary', 'gossamer', 'graduate', 'gravity', 'guitarist', 'hamburger', 'Hamilton', 'handiwork', 'hazardous', 'headwaters', 'hemisphere', 'hesitate', 'hideaway', 'holiness', 'hurricane', 'hydraulic', 'impartial', 'impetus', 'inception', 'indigo', 'inertia', 'infancy', 'inferno', 'informant', 'insincere', 'insurgent', 'integrate', 'intention', 'inventive', 'Istanbul', 'Jamaica', 'Jupiter', 'leprosy', 'letterhead', 'liberty', 'maritime', 'matchmaker', 'maverick', 'Medusa', 'megaton', 'microscope', 'microwave', 'midsummer', 'millionaire', 'miracle', 'misnomer', 'molasses', 'molecule', 'Montana', 'monument', 'mosquito', 'narrative', 'nebula', 'newsletter', 'Norwegian', 'October', 'Ohio', 'onlooker', 'opulent', 'Orlando', 'outfielder', 'Pacific', 'pandemic', 'pandora', 'paperweight', 'paragon', 'paragraph', 'paramount', 'passenger', 'pedigree', 'Pegasus', 'penetrate', 'perceptive', 'performance', 'pharmacy', 'phonetic', 'photograph', 'pioneer', 'pocketful', 'politeness', 'positive', 'potato', 'processor', 'prophecy', 'provincial', 'proximate', 'puberty', 'publisher', 'pyramid', 'quantity', 'racketeer', 'rebellion', 'recipe', 'recover', 'repellent', 'replica', 'reproduce', 'resistor', 'responsive', 'retraction', 'retrieval', 'retrospect', 'revenue', 'revival', 'revolver', 'Sahara', 'sandalwood', 'sardonic', 'Saturday', 'savagery', 'scavenger', 'sensation', 'sociable', 'souvenir', 'specialist', 'speculate', 'stethoscope', 'stupendous', 'supportive', 'surrender', 'suspicious', 'sympathy', 'tambourine', 'telephone', 'therapist', 'tobacco', 'tolerance', 'tomorrow', 'torpedo', 'tradition', 'travesty', 'trombonist', 'truncated', 'typewriter', 'ultimate', 'undaunted', 'underfoot', 'unicorn', 'unify', 'universe', 'unravel', 'upcoming', 'vacancy', 'vagabond', 'versatile', 'vertigo', 'Virginia', 'visitor', 'vocalist', 'voyager', 'warranty', 'Waterloo', 'whimsical', 'Wichita', 'Wilmington', 'Wyoming', 'yesteryear', 'Yucatan']\n\nexport function Uint8ArrayToWords(bytes: Uint8Array, sepPair = ' ', sepGroup = ' '): string {\n  return Array.from(bytes).map((byte, pos) => pos % 2 ? wordsOdd[byte] + sepGroup : wordsEven[byte] + sepPair).join('').slice(0, -(bytes.length % 2 ? sepPair : sepGroup).length)\n}\n\nexport function wordsToUint8Array(words: string[]): Uint8Array {\n  return toUint8Array(words.map((w, pos) => (pos % 2 ? wordsOdd : wordsEven).findIndex(wl => wl.toLocaleLowerCase() === deburr(w).toLocaleLowerCase().trim())))\n}\n"],"mappings":"8IAMM,EAAY,6+DAAiuF,CAC7uF,EAAW,g3EAAomG,CAErnG,SAAgB,EAAkB,EAAmB,EAAU,IAAK,EAAW,IAAa,CAC1F,OAAO,MAAM,KAAK,EAAM,CAAC,KAAK,EAAM,IAAQ,EAAM,EAAI,EAAS,GAAQ,EAAW,EAAU,GAAQ,EAAQ,CAAC,KAAK,GAAG,CAAC,MAAM,EAAG,EAAE,EAAM,OAAS,EAAI,EAAU,GAAU,OAAO,CAGjL,SAAgB,EAAkB,EAA6B,CAC7D,OAAOA,EAAAA,EAAa,EAAM,KAAK,EAAG,KAAS,EAAM,EAAI,EAAW,GAAW,UAAU,GAAM,EAAG,mBAAmB,GAAKC,EAAAA,OAAO,EAAE,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC"}

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

@@ -1,4 +1,2 @@
-declare function Uint8ArrayToWords(bytes: Uint8Array, sepPair?: string, sepGroup?: string): string;
-declare function wordsToUint8Array(words: string[]): Uint8Array;
-
-export { Uint8ArrayToWords, wordsToUint8Array };
+import { n as wordsToUint8Array, t as Uint8ArrayToWords } from "../../wordlist-b4438KR_.cjs";
+export { Uint8ArrayToWords, wordsToUint8Array };

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

@@ -0,0 +1,2 @@
+import { n as wordsToUint8Array, t as Uint8ArrayToWords } from "../../wordlist-B9EjFfv6.mjs";
+export { Uint8ArrayToWords, wordsToUint8Array };

package/dist/common/data/wordlist.mjs

@@ -0,0 +1,2 @@
+import{v as e}from"../../bin-SPdenYkw.mjs";import{deburr as t}from"./string-deburr.mjs";const n=`aardvark.absurd.accrue.acme.adrift.adult.afflict.ahead.aimless.Algol.allow.alone.ammo.ancient.apple.artist.assume.Athens.atlas.Aztec.baboon.backfield.backward.basalt.beaming.bedlamp.beehive.beeswax.befriend.Belfast.berserk.billiard.bison.blackjack.blockade.blowtorch.bluebird.bombast.bookshelf.brackish.breadline.breakup.brickyard.briefcase.Burbank.button.buzzard.cement.chairlift.chatter.checkup.chisel.choking.chopper.Christmas.clamshell.classic.classroom.cleanup.clockwork.cobra.commence.concert.cowbell.crackdown.cranky.crowfoot.crucial.crumpled.crusade.cubic.deadbolt.deckhand.dogsled.dosage.dragnet.drainage.dreadful.drifter.dropper.drumbeat.drunken.Dupont.dwelling.eating.edict.egghead.eightball.endorse.endow.enlist.erase.escape.exceed.eyeglass.eyetooth.facial.fallout.flagpole.flatfoot.flytrap.fracture.fragile.framework.freedom.frighten.gazelle.Geiger.Glasgow.glitter.glucose.goggles.goldfish.gremlin.guidance.hamlet.highchair.hockey.hotdog.indoors.indulge.inverse.involve.island.Janus.jawbone.keyboard.kickoff.kiwi.klaxon.lockup.merit.minnow.miser.Mohawk.mural.music.Neptune.newborn.nightbird.obtuse.offload.oilfield.optic.orca.payday.peachy.pheasant.physique.playhouse.Pluto.preclude.prefer.preshrunk.printer.profile.prowler.pupil.puppy.python.quadrant.quiver.quota.ragtime.ratchet.rebirth.reform.regain.reindeer.rematch.repay.retouch.revenge.reward.rhythm.ringbolt.robust.rocker.ruffled.sawdust.scallion.scenic.scorecard.Scotland.seabird.select.sentence.shadow.showgirl.skullcap.skydive.slingshot.slothful.slowdown.snapline.snapshot.snowcap.snowslide.solo.spaniel.spearhead.spellbind.spheroid.spigot.spindle.spoilage.spyglass.stagehand.stagnate.stairway.standard.stapler.steamship.stepchild.sterling.stockman.stopwatch.stormy.sugar.surmount.suspense.swelter.tactics.talon.tapeworm.tempest.tiger.tissue.tonic.tracker.transit.trauma.treadmill.Trojan.trouble.tumor.tunnel.tycoon.umpire.uncut.unearth.unwind.uproot.upset.upshot.vapor.village.virus.Vulcan.waffle.wallet.watchword.wayside.willow.woodlark.Zulu`.split(`.`),r=`adroitness.adviser.aggregate.alkali.almighty.amulet.amusement.antenna.applicant.Apollo.armistice.article.asteroid.Atlantic.atmosphere.autopsy.Babylon.backwater.barbecue.belowground.bifocals.bodyguard.borderline.bottomless.Bradbury.Brazilian.breakaway.Burlington.businessman.butterfat.Camelot.candidate.cannonball.Capricorn.caravan.caretaker.celebrate.cellulose.certify.chambermaid.Cherokee.Chicago.clergyman.coherence.combustion.commando.company.component.concurrent.confidence.conformist.congregate.consensus.consulting.corporate.corrosion.councilman.crossover.cumbersome.customer.Dakota.decadence.December.decimal.designing.detector.detergent.determine.dictator.dinosaur.direction.disable.disbelief.disruptive.distortion.divisive.document.embezzle.enchanting.enrollment.enterprise.equation.equipment.escapade.Eskimo.everyday.examine.existence.exodus.fascinate.filament.finicky.forever.fortitude.frequency.gadgetry.Galveston.getaway.glossary.gossamer.graduate.gravity.guitarist.hamburger.Hamilton.handiwork.hazardous.headwaters.hemisphere.hesitate.hideaway.holiness.hurricane.hydraulic.impartial.impetus.inception.indigo.inertia.infancy.inferno.informant.insincere.insurgent.integrate.intention.inventive.Istanbul.Jamaica.Jupiter.leprosy.letterhead.liberty.maritime.matchmaker.maverick.Medusa.megaton.microscope.microwave.midsummer.millionaire.miracle.misnomer.molasses.molecule.Montana.monument.mosquito.narrative.nebula.newsletter.Norwegian.October.Ohio.onlooker.opulent.Orlando.outfielder.Pacific.pandemic.pandora.paperweight.paragon.paragraph.paramount.passenger.pedigree.Pegasus.penetrate.perceptive.performance.pharmacy.phonetic.photograph.pioneer.pocketful.politeness.positive.potato.processor.prophecy.provincial.proximate.puberty.publisher.pyramid.quantity.racketeer.rebellion.recipe.recover.repellent.replica.reproduce.resistor.responsive.retraction.retrieval.retrospect.revenue.revival.revolver.Sahara.sandalwood.sardonic.Saturday.savagery.scavenger.sensation.sociable.souvenir.specialist.speculate.stethoscope.stupendous.supportive.surrender.suspicious.sympathy.tambourine.telephone.therapist.tobacco.tolerance.tomorrow.torpedo.tradition.travesty.trombonist.truncated.typewriter.ultimate.undaunted.underfoot.unicorn.unify.universe.unravel.upcoming.vacancy.vagabond.versatile.vertigo.Virginia.visitor.vocalist.voyager.warranty.Waterloo.whimsical.Wichita.Wilmington.Wyoming.yesteryear.Yucatan`.split(`.`);function i(e,t=` `,i=` `){return Array.from(e).map((e,a)=>a%2?r[e]+i:n[e]+t).join(``).slice(0,-(e.length%2?t:i).length)}function a(i){return e(i.map((e,i)=>(i%2?r:n).findIndex(n=>n.toLocaleLowerCase()===t(e).toLocaleLowerCase().trim())))}export{i as Uint8ArrayToWords,a as wordsToUint8Array};
+//# sourceMappingURL=wordlist.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"wordlist.mjs","names":[],"sources":["../../../src/common/data/wordlist.ts"],"sourcesContent":["// PGP Word List from https://web.mit.edu/network/pgpfone/manual/index.html#PGP000062\n// See https://en.wikipedia.org/wiki/PGP_word_list\n\nimport { toUint8Array } from './bin'\nimport { deburr } from './string-deburr'\n\nconst wordsEven = ['aardvark', 'absurd', 'accrue', 'acme', 'adrift', 'adult', 'afflict', 'ahead', 'aimless', 'Algol', 'allow', 'alone', 'ammo', 'ancient', 'apple', 'artist', 'assume', 'Athens', 'atlas', 'Aztec', 'baboon', 'backfield', 'backward', 'basalt', 'beaming', 'bedlamp', 'beehive', 'beeswax', 'befriend', 'Belfast', 'berserk', 'billiard', 'bison', 'blackjack', 'blockade', 'blowtorch', 'bluebird', 'bombast', 'bookshelf', 'brackish', 'breadline', 'breakup', 'brickyard', 'briefcase', 'Burbank', 'button', 'buzzard', 'cement', 'chairlift', 'chatter', 'checkup', 'chisel', 'choking', 'chopper', 'Christmas', 'clamshell', 'classic', 'classroom', 'cleanup', 'clockwork', 'cobra', 'commence', 'concert', 'cowbell', 'crackdown', 'cranky', 'crowfoot', 'crucial', 'crumpled', 'crusade', 'cubic', 'deadbolt', 'deckhand', 'dogsled', 'dosage', 'dragnet', 'drainage', 'dreadful', 'drifter', 'dropper', 'drumbeat', 'drunken', 'Dupont', 'dwelling', 'eating', 'edict', 'egghead', 'eightball', 'endorse', 'endow', 'enlist', 'erase', 'escape', 'exceed', 'eyeglass', 'eyetooth', 'facial', 'fallout', 'flagpole', 'flatfoot', 'flytrap', 'fracture', 'fragile', 'framework', 'freedom', 'frighten', 'gazelle', 'Geiger', 'Glasgow', 'glitter', 'glucose', 'goggles', 'goldfish', 'gremlin', 'guidance', 'hamlet', 'highchair', 'hockey', 'hotdog', 'indoors', 'indulge', 'inverse', 'involve', 'island', 'Janus', 'jawbone', 'keyboard', 'kickoff', 'kiwi', 'klaxon', 'lockup', 'merit', 'minnow', 'miser', 'Mohawk', 'mural', 'music', 'Neptune', 'newborn', 'nightbird', 'obtuse', 'offload', 'oilfield', 'optic', 'orca', 'payday', 'peachy', 'pheasant', 'physique', 'playhouse', 'Pluto', 'preclude', 'prefer', 'preshrunk', 'printer', 'profile', 'prowler', 'pupil', 'puppy', 'python', 'quadrant', 'quiver', 'quota', 'ragtime', 'ratchet', 'rebirth', 'reform', 'regain', 'reindeer', 'rematch', 'repay', 'retouch', 'revenge', 'reward', 'rhythm', 'ringbolt', 'robust', 'rocker', 'ruffled', 'sawdust', 'scallion', 'scenic', 'scorecard', 'Scotland', 'seabird', 'select', 'sentence', 'shadow', 'showgirl', 'skullcap', 'skydive', 'slingshot', 'slothful', 'slowdown', 'snapline', 'snapshot', 'snowcap', 'snowslide', 'solo', 'spaniel', 'spearhead', 'spellbind', 'spheroid', 'spigot', 'spindle', 'spoilage', 'spyglass', 'stagehand', 'stagnate', 'stairway', 'standard', 'stapler', 'steamship', 'stepchild', 'sterling', 'stockman', 'stopwatch', 'stormy', 'sugar', 'surmount', 'suspense', 'swelter', 'tactics', 'talon', 'tapeworm', 'tempest', 'tiger', 'tissue', 'tonic', 'tracker', 'transit', 'trauma', 'treadmill', 'Trojan', 'trouble', 'tumor', 'tunnel', 'tycoon', 'umpire', 'uncut', 'unearth', 'unwind', 'uproot', 'upset', 'upshot', 'vapor', 'village', 'virus', 'Vulcan', 'waffle', 'wallet', 'watchword', 'wayside', 'willow', 'woodlark', 'Zulu']\nconst wordsOdd = ['adroitness', 'adviser', 'aggregate', 'alkali', 'almighty', 'amulet', 'amusement', 'antenna', 'applicant', 'Apollo', 'armistice', 'article', 'asteroid', 'Atlantic', 'atmosphere', 'autopsy', 'Babylon', 'backwater', 'barbecue', 'belowground', 'bifocals', 'bodyguard', 'borderline', 'bottomless', 'Bradbury', 'Brazilian', 'breakaway', 'Burlington', 'businessman', 'butterfat', 'Camelot', 'candidate', 'cannonball', 'Capricorn', 'caravan', 'caretaker', 'celebrate', 'cellulose', 'certify', 'chambermaid', 'Cherokee', 'Chicago', 'clergyman', 'coherence', 'combustion', 'commando', 'company', 'component', 'concurrent', 'confidence', 'conformist', 'congregate', 'consensus', 'consulting', 'corporate', 'corrosion', 'councilman', 'crossover', 'cumbersome', 'customer', 'Dakota', 'decadence', 'December', 'decimal', 'designing', 'detector', 'detergent', 'determine', 'dictator', 'dinosaur', 'direction', 'disable', 'disbelief', 'disruptive', 'distortion', 'divisive', 'document', 'embezzle', 'enchanting', 'enrollment', 'enterprise', 'equation', 'equipment', 'escapade', 'Eskimo', 'everyday', 'examine', 'existence', 'exodus', 'fascinate', 'filament', 'finicky', 'forever', 'fortitude', 'frequency', 'gadgetry', 'Galveston', 'getaway', 'glossary', 'gossamer', 'graduate', 'gravity', 'guitarist', 'hamburger', 'Hamilton', 'handiwork', 'hazardous', 'headwaters', 'hemisphere', 'hesitate', 'hideaway', 'holiness', 'hurricane', 'hydraulic', 'impartial', 'impetus', 'inception', 'indigo', 'inertia', 'infancy', 'inferno', 'informant', 'insincere', 'insurgent', 'integrate', 'intention', 'inventive', 'Istanbul', 'Jamaica', 'Jupiter', 'leprosy', 'letterhead', 'liberty', 'maritime', 'matchmaker', 'maverick', 'Medusa', 'megaton', 'microscope', 'microwave', 'midsummer', 'millionaire', 'miracle', 'misnomer', 'molasses', 'molecule', 'Montana', 'monument', 'mosquito', 'narrative', 'nebula', 'newsletter', 'Norwegian', 'October', 'Ohio', 'onlooker', 'opulent', 'Orlando', 'outfielder', 'Pacific', 'pandemic', 'pandora', 'paperweight', 'paragon', 'paragraph', 'paramount', 'passenger', 'pedigree', 'Pegasus', 'penetrate', 'perceptive', 'performance', 'pharmacy', 'phonetic', 'photograph', 'pioneer', 'pocketful', 'politeness', 'positive', 'potato', 'processor', 'prophecy', 'provincial', 'proximate', 'puberty', 'publisher', 'pyramid', 'quantity', 'racketeer', 'rebellion', 'recipe', 'recover', 'repellent', 'replica', 'reproduce', 'resistor', 'responsive', 'retraction', 'retrieval', 'retrospect', 'revenue', 'revival', 'revolver', 'Sahara', 'sandalwood', 'sardonic', 'Saturday', 'savagery', 'scavenger', 'sensation', 'sociable', 'souvenir', 'specialist', 'speculate', 'stethoscope', 'stupendous', 'supportive', 'surrender', 'suspicious', 'sympathy', 'tambourine', 'telephone', 'therapist', 'tobacco', 'tolerance', 'tomorrow', 'torpedo', 'tradition', 'travesty', 'trombonist', 'truncated', 'typewriter', 'ultimate', 'undaunted', 'underfoot', 'unicorn', 'unify', 'universe', 'unravel', 'upcoming', 'vacancy', 'vagabond', 'versatile', 'vertigo', 'Virginia', 'visitor', 'vocalist', 'voyager', 'warranty', 'Waterloo', 'whimsical', 'Wichita', 'Wilmington', 'Wyoming', 'yesteryear', 'Yucatan']\n\nexport function Uint8ArrayToWords(bytes: Uint8Array, sepPair = ' ', sepGroup = ' '): string {\n  return Array.from(bytes).map((byte, pos) => pos % 2 ? wordsOdd[byte] + sepGroup : wordsEven[byte] + sepPair).join('').slice(0, -(bytes.length % 2 ? sepPair : sepGroup).length)\n}\n\nexport function wordsToUint8Array(words: string[]): Uint8Array {\n  return toUint8Array(words.map((w, pos) => (pos % 2 ? wordsOdd : wordsEven).findIndex(wl => wl.toLocaleLowerCase() === deburr(w).toLocaleLowerCase().trim())))\n}\n"],"mappings":"wFAMA,MAAM,EAAY,6+DAAiuF,CAC7uF,EAAW,g3EAAomG,CAErnG,SAAgB,EAAkB,EAAmB,EAAU,IAAK,EAAW,IAAa,CAC1F,OAAO,MAAM,KAAK,EAAM,CAAC,KAAK,EAAM,IAAQ,EAAM,EAAI,EAAS,GAAQ,EAAW,EAAU,GAAQ,EAAQ,CAAC,KAAK,GAAG,CAAC,MAAM,EAAG,EAAE,EAAM,OAAS,EAAI,EAAU,GAAU,OAAO,CAGjL,SAAgB,EAAkB,EAA6B,CAC7D,OAAO,EAAa,EAAM,KAAK,EAAG,KAAS,EAAM,EAAI,EAAW,GAAW,UAAU,GAAM,EAAG,mBAAmB,GAAK,EAAO,EAAE,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC"}