zeed 1.3.0 → 1.4.0

package/dist/common/data/signal.cjs

@@ -1,2 +1,40 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`./array.cjs`);function t(t,n){let r=structuredClone(t),i=[];function a(t){e.arrayRemoveElement(i,t)}function o(e){return i.push(e),()=>a(e)}n&&i.push(n);let s=()=>structuredClone(r),c=e=>{if(e!==r){let t=r;r=e,i.forEach(n=>n(e,t))}},l=[s,c,o,a];return l.get=s,l.set=c,l.on=o,l.off=a,l}exports.useSignal=t;
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+const require_common_data_array = require('./array.cjs');
+
+//#region src/common/data/signal.ts
+/** Super simple signal implementation */
+function useSignal(value, onChange) {
+	let signal = structuredClone(value);
+	const watchers = [];
+	function off(fn) {
+		require_common_data_array.arrayRemoveElement(watchers, fn);
+	}
+	function on(fn) {
+		watchers.push(fn);
+		return () => off(fn);
+	}
+	if (onChange) watchers.push(onChange);
+	const get = () => structuredClone(signal);
+	const set = (value) => {
+		if (value !== signal) {
+			const oldValue = signal;
+			signal = value;
+			watchers.forEach((fn) => fn(value, oldValue));
+		}
+	};
+	const obj = [
+		get,
+		set,
+		on,
+		off
+	];
+	obj.get = get;
+	obj.set = set;
+	obj.on = on;
+	obj.off = off;
+	return obj;
+}
+
+//#endregion
+exports.useSignal = useSignal;
 //# sourceMappingURL=signal.cjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"signal.cjs","names":[],"sources":["../../../src/common/data/signal.ts"],"sourcesContent":["import { arrayRemoveElement } from './array'\n\n// I'm aware of this one, but like mine better ;)\n// https://github.com/proposal-signals/proposal-signals\n\nexport type SignalWatcher<T> = (value: T, oldValue: T) => void\n\nexport type Signal<T> = [\n  () => T,\n  (value: T) => void,\n  (fn: SignalWatcher<T>) => () => void,\n  (fn: SignalWatcher<T>) => void,\n] & {\n  get: () => T\n  set: (value: T) => void\n  on: (fn: SignalWatcher<T>) => () => void\n  off: (fn: SignalWatcher<T>) => void\n}\n\n/** Super simple signal implementation */\nexport function useSignal<T = any>(value: T, onChange?: SignalWatcher<T>): Signal<T> {\n  let signal = structuredClone(value)\n\n  const watchers: SignalWatcher<T>[] = []\n\n  function off(fn: SignalWatcher<T>) {\n    arrayRemoveElement(watchers, fn)\n  }\n\n  function on(fn: SignalWatcher<T>) {\n    watchers.push(fn)\n    return () => off(fn)\n  }\n\n  if (onChange)\n    watchers.push(onChange)\n\n  const get = () => structuredClone(signal)\n\n  const set = (value: T) => {\n    if (value !== signal) {\n      const oldValue = signal\n      signal = value\n      watchers.forEach(fn => fn(value, oldValue))\n    }\n  }\n\n  const obj: any = [get, set, on, off]\n  obj.get = get\n  obj.set = set\n  obj.on = on\n  obj.off = off\n  return obj\n}\n"],"mappings":"kGAoBA,SAAgB,EAAmB,EAAU,EAAwC,CACnF,IAAI,EAAS,gBAAgB,EAAM,CAE7B,EAA+B,EAAE,CAEvC,SAAS,EAAI,EAAsB,CACjC,EAAA,mBAAmB,EAAU,EAAG,CAGlC,SAAS,EAAG,EAAsB,CAEhC,OADA,EAAS,KAAK,EAAG,KACJ,EAAI,EAAG,CAGlB,GACF,EAAS,KAAK,EAAS,CAEzB,IAAM,MAAY,gBAAgB,EAAO,CAEnC,EAAO,GAAa,CACxB,GAAI,IAAU,EAAQ,CACpB,IAAM,EAAW,EACjB,EAAS,EACT,EAAS,QAAQ,GAAM,EAAG,EAAO,EAAS,CAAC,GAIzC,EAAW,CAAC,EAAK,EAAK,EAAI,EAAI,CAKpC,MAJA,GAAI,IAAM,EACV,EAAI,IAAM,EACV,EAAI,GAAK,EACT,EAAI,IAAM,EACH"}
+{"version":3,"file":"signal.cjs","names":[],"sources":["../../../src/common/data/signal.ts"],"sourcesContent":["import { arrayRemoveElement } from './array'\n\n// I'm aware of this one, but like mine better ;)\n// https://github.com/proposal-signals/proposal-signals\n\nexport type SignalWatcher<T> = (value: T, oldValue: T) => void\n\nexport type Signal<T> = [\n  () => T,\n  (value: T) => void,\n  (fn: SignalWatcher<T>) => () => void,\n  (fn: SignalWatcher<T>) => void,\n] & {\n  get: () => T\n  set: (value: T) => void\n  on: (fn: SignalWatcher<T>) => () => void\n  off: (fn: SignalWatcher<T>) => void\n}\n\n/** Super simple signal implementation */\nexport function useSignal<T = any>(value: T, onChange?: SignalWatcher<T>): Signal<T> {\n  let signal = structuredClone(value)\n\n  const watchers: SignalWatcher<T>[] = []\n\n  function off(fn: SignalWatcher<T>) {\n    arrayRemoveElement(watchers, fn)\n  }\n\n  function on(fn: SignalWatcher<T>) {\n    watchers.push(fn)\n    return () => off(fn)\n  }\n\n  if (onChange)\n    watchers.push(onChange)\n\n  const get = () => structuredClone(signal)\n\n  const set = (value: T) => {\n    if (value !== signal) {\n      const oldValue = signal\n      signal = value\n      watchers.forEach(fn => fn(value, oldValue))\n    }\n  }\n\n  const obj: any = [get, set, on, off]\n  obj.get = get\n  obj.set = set\n  obj.on = on\n  obj.off = off\n  return obj\n}\n"],"mappings":";;;;;AAoBA,SAAgB,UAAmB,OAAU,UAAwC;CACnF,IAAI,SAAS,gBAAgB,MAAM;CAEnC,MAAM,WAA+B,EAAE;CAEvC,SAAS,IAAI,IAAsB;AACjC,+CAAmB,UAAU,GAAG;;CAGlC,SAAS,GAAG,IAAsB;AAChC,WAAS,KAAK,GAAG;AACjB,eAAa,IAAI,GAAG;;AAGtB,KAAI,SACF,UAAS,KAAK,SAAS;CAEzB,MAAM,YAAY,gBAAgB,OAAO;CAEzC,MAAM,OAAO,UAAa;AACxB,MAAI,UAAU,QAAQ;GACpB,MAAM,WAAW;AACjB,YAAS;AACT,YAAS,SAAQ,OAAM,GAAG,OAAO,SAAS,CAAC;;;CAI/C,MAAM,MAAW;EAAC;EAAK;EAAK;EAAI;EAAI;AACpC,KAAI,MAAM;AACV,KAAI,MAAM;AACV,KAAI,KAAK;AACT,KAAI,MAAM;AACV,QAAO"}

package/dist/common/data/signal.mjs

@@ -1,2 +1,39 @@
-import{arrayRemoveElement as e}from"./array.mjs";function t(t,n){let r=structuredClone(t),i=[];function a(t){e(i,t)}function o(e){return i.push(e),()=>a(e)}n&&i.push(n);let s=()=>structuredClone(r),c=e=>{if(e!==r){let t=r;r=e,i.forEach(n=>n(e,t))}},l=[s,c,o,a];return l.get=s,l.set=c,l.on=o,l.off=a,l}export{t as useSignal};
+import { arrayRemoveElement } from "./array.mjs";
+
+//#region src/common/data/signal.ts
+/** Super simple signal implementation */
+function useSignal(value, onChange) {
+	let signal = structuredClone(value);
+	const watchers = [];
+	function off(fn) {
+		arrayRemoveElement(watchers, fn);
+	}
+	function on(fn) {
+		watchers.push(fn);
+		return () => off(fn);
+	}
+	if (onChange) watchers.push(onChange);
+	const get = () => structuredClone(signal);
+	const set = (value) => {
+		if (value !== signal) {
+			const oldValue = signal;
+			signal = value;
+			watchers.forEach((fn) => fn(value, oldValue));
+		}
+	};
+	const obj = [
+		get,
+		set,
+		on,
+		off
+	];
+	obj.get = get;
+	obj.set = set;
+	obj.on = on;
+	obj.off = off;
+	return obj;
+}
+
+//#endregion
+export { useSignal };
 //# sourceMappingURL=signal.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"signal.mjs","names":[],"sources":["../../../src/common/data/signal.ts"],"sourcesContent":["import { arrayRemoveElement } from './array'\n\n// I'm aware of this one, but like mine better ;)\n// https://github.com/proposal-signals/proposal-signals\n\nexport type SignalWatcher<T> = (value: T, oldValue: T) => void\n\nexport type Signal<T> = [\n  () => T,\n  (value: T) => void,\n  (fn: SignalWatcher<T>) => () => void,\n  (fn: SignalWatcher<T>) => void,\n] & {\n  get: () => T\n  set: (value: T) => void\n  on: (fn: SignalWatcher<T>) => () => void\n  off: (fn: SignalWatcher<T>) => void\n}\n\n/** Super simple signal implementation */\nexport function useSignal<T = any>(value: T, onChange?: SignalWatcher<T>): Signal<T> {\n  let signal = structuredClone(value)\n\n  const watchers: SignalWatcher<T>[] = []\n\n  function off(fn: SignalWatcher<T>) {\n    arrayRemoveElement(watchers, fn)\n  }\n\n  function on(fn: SignalWatcher<T>) {\n    watchers.push(fn)\n    return () => off(fn)\n  }\n\n  if (onChange)\n    watchers.push(onChange)\n\n  const get = () => structuredClone(signal)\n\n  const set = (value: T) => {\n    if (value !== signal) {\n      const oldValue = signal\n      signal = value\n      watchers.forEach(fn => fn(value, oldValue))\n    }\n  }\n\n  const obj: any = [get, set, on, off]\n  obj.get = get\n  obj.set = set\n  obj.on = on\n  obj.off = off\n  return obj\n}\n"],"mappings":"iDAoBA,SAAgB,EAAmB,EAAU,EAAwC,CACnF,IAAI,EAAS,gBAAgB,EAAM,CAE7B,EAA+B,EAAE,CAEvC,SAAS,EAAI,EAAsB,CACjC,EAAmB,EAAU,EAAG,CAGlC,SAAS,EAAG,EAAsB,CAEhC,OADA,EAAS,KAAK,EAAG,KACJ,EAAI,EAAG,CAGlB,GACF,EAAS,KAAK,EAAS,CAEzB,IAAM,MAAY,gBAAgB,EAAO,CAEnC,EAAO,GAAa,CACxB,GAAI,IAAU,EAAQ,CACpB,IAAM,EAAW,EACjB,EAAS,EACT,EAAS,QAAQ,GAAM,EAAG,EAAO,EAAS,CAAC,GAIzC,EAAW,CAAC,EAAK,EAAK,EAAI,EAAI,CAKpC,MAJA,GAAI,IAAM,EACV,EAAI,IAAM,EACV,EAAI,GAAK,EACT,EAAI,IAAM,EACH"}
+{"version":3,"file":"signal.mjs","names":[],"sources":["../../../src/common/data/signal.ts"],"sourcesContent":["import { arrayRemoveElement } from './array'\n\n// I'm aware of this one, but like mine better ;)\n// https://github.com/proposal-signals/proposal-signals\n\nexport type SignalWatcher<T> = (value: T, oldValue: T) => void\n\nexport type Signal<T> = [\n  () => T,\n  (value: T) => void,\n  (fn: SignalWatcher<T>) => () => void,\n  (fn: SignalWatcher<T>) => void,\n] & {\n  get: () => T\n  set: (value: T) => void\n  on: (fn: SignalWatcher<T>) => () => void\n  off: (fn: SignalWatcher<T>) => void\n}\n\n/** Super simple signal implementation */\nexport function useSignal<T = any>(value: T, onChange?: SignalWatcher<T>): Signal<T> {\n  let signal = structuredClone(value)\n\n  const watchers: SignalWatcher<T>[] = []\n\n  function off(fn: SignalWatcher<T>) {\n    arrayRemoveElement(watchers, fn)\n  }\n\n  function on(fn: SignalWatcher<T>) {\n    watchers.push(fn)\n    return () => off(fn)\n  }\n\n  if (onChange)\n    watchers.push(onChange)\n\n  const get = () => structuredClone(signal)\n\n  const set = (value: T) => {\n    if (value !== signal) {\n      const oldValue = signal\n      signal = value\n      watchers.forEach(fn => fn(value, oldValue))\n    }\n  }\n\n  const obj: any = [get, set, on, off]\n  obj.get = get\n  obj.set = set\n  obj.on = on\n  obj.off = off\n  return obj\n}\n"],"mappings":";;;;AAoBA,SAAgB,UAAmB,OAAU,UAAwC;CACnF,IAAI,SAAS,gBAAgB,MAAM;CAEnC,MAAM,WAA+B,EAAE;CAEvC,SAAS,IAAI,IAAsB;AACjC,qBAAmB,UAAU,GAAG;;CAGlC,SAAS,GAAG,IAAsB;AAChC,WAAS,KAAK,GAAG;AACjB,eAAa,IAAI,GAAG;;AAGtB,KAAI,SACF,UAAS,KAAK,SAAS;CAEzB,MAAM,YAAY,gBAAgB,OAAO;CAEzC,MAAM,OAAO,UAAa;AACxB,MAAI,UAAU,QAAQ;GACpB,MAAM,WAAW;AACjB,YAAS;AACT,YAAS,SAAQ,OAAM,GAAG,OAAO,SAAS,CAAC;;;CAI/C,MAAM,MAAW;EAAC;EAAK;EAAK;EAAI;EAAI;AACpC,KAAI,MAAM;AACV,KAAI,MAAM;AACV,KAAI,KAAK;AACT,KAAI,MAAM;AACV,QAAO"}

package/dist/common/data/sortable.cjs

@@ -1,2 +1,36 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`./math.cjs`);function t(t){return t.reduce((e,t)=>Math.min(e,t.sort_weight||0),0)-1-e.getSecureRandomIfPossible()}function n(t){return t.reduce((e,t)=>Math.max(e,t.sort_weight||0),0)+1+e.getSecureRandomIfPossible()}function r(r,a,o){let s=o.length,c=r<a;if(s<=0||r>=s-1)return n(o);if(r<=0)return t(o);o=i([...o]);let l=c?-1:0,u=o[r+l].sort_weight||0,d=(o[r+l+1].sort_weight||0)-u;return d===0?c?t(o):n(o):u+d/2+d*.01*(e.getSecureRandomIfPossible()-.5)}function i(e){return e.sort((e,t)=>(e.sort_weight||0)-(t.sort_weight||0)),e}exports.endSortWeight=n,exports.moveSortWeight=r,exports.sortedItems=i,exports.startSortWeight=t;
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+const require_common_data_math = require('./math.cjs');
+
+//#region src/common/data/sortable.ts
+function startSortWeight(items) {
+	return items.reduce((acc, item) => Math.min(acc, item.sort_weight || 0), 0) - 1 - require_common_data_math.getSecureRandomIfPossible();
+}
+function endSortWeight(items) {
+	return items.reduce((acc, item) => Math.max(acc, item.sort_weight || 0), 0) + 1 + require_common_data_math.getSecureRandomIfPossible();
+}
+function moveSortWeight(newIndex, oldIndex, items) {
+	const count = items.length;
+	const moveLower = newIndex < oldIndex;
+	if (count <= 0 || newIndex >= count - 1) return endSortWeight(items);
+	if (newIndex <= 0) return startSortWeight(items);
+	items = sortedItems([...items]);
+	const step = moveLower ? -1 : 0;
+	const lower = items[newIndex + step].sort_weight || 0;
+	const distance = (items[newIndex + step + 1].sort_weight || 0) - lower;
+	if (distance === 0) {
+		if (moveLower) return startSortWeight(items);
+		return endSortWeight(items);
+	}
+	return lower + distance / 2 + distance * .01 * (require_common_data_math.getSecureRandomIfPossible() - .5);
+}
+function sortedItems(items) {
+	items.sort((a, b) => (a.sort_weight || 0) - (b.sort_weight || 0));
+	return items;
+}
+
+//#endregion
+exports.endSortWeight = endSortWeight;
+exports.moveSortWeight = moveSortWeight;
+exports.sortedItems = sortedItems;
+exports.startSortWeight = startSortWeight;
 //# sourceMappingURL=sortable.cjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"sortable.cjs","names":["getSecureRandomIfPossible"],"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":"iGASA,SAAgB,EAAgB,EAA+B,CAC7D,OACE,EAAM,QAAQ,EAAK,IAAS,KAAK,IAAI,EAAK,EAAK,aAAe,EAAE,CAAE,EAAE,CAClE,EACAA,EAAAA,2BAA2B,CAKjC,SAAgB,EAAc,EAA+B,CAC3D,OACE,EAAM,QAAQ,EAAK,IAAS,KAAK,IAAI,EAAK,EAAK,aAAe,EAAE,CAAE,EAAE,CAClE,EACAA,EAAAA,2BAA2B,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,KAAQA,EAAAA,2BAA2B,CAAG,IAIjE,SAAgB,EAAoC,EAAiB,CAEnE,OADA,EAAM,MAAM,EAAG,KAAO,EAAE,aAAe,IAAM,EAAE,aAAe,GAAG,CAC1D"}
+{"version":3,"file":"sortable.cjs","names":["getSecureRandomIfPossible"],"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":";;;;AASA,SAAgB,gBAAgB,OAA+B;AAC7D,QACE,MAAM,QAAQ,KAAK,SAAS,KAAK,IAAI,KAAK,KAAK,eAAe,EAAE,EAAE,EAAE,GAClE,IACAA,oDAA2B;;AAKjC,SAAgB,cAAc,OAA+B;AAC3D,QACE,MAAM,QAAQ,KAAK,SAAS,KAAK,IAAI,KAAK,KAAK,eAAe,EAAE,EAAE,EAAE,GAClE,IACAA,oDAA2B;;AAKjC,SAAgB,eACd,UACA,UACA,OACQ;CACR,MAAM,QAAQ,MAAM;CAEpB,MAAM,YAAY,WAAW;AAC7B,KAAI,SAAS,KAAK,YAAY,QAAQ,EACpC,QAAO,cAAc,MAAM;AAE7B,KAAI,YAAY,EACd,QAAO,gBAAgB,MAAM;AAG/B,SAAQ,YAAY,CAAC,GAAG,MAAM,CAAC;CAE/B,MAAM,OAAO,YAAY,KAAK;CAC9B,MAAM,QAAQ,MAAM,WAAW,MAAM,eAAe;CAEpD,MAAM,YADQ,MAAM,WAAW,OAAO,GAAG,eAAe,KAC/B;AACzB,KAAI,aAAa,GAAG;AAElB,MAAI,UACF,QAAO,gBAAgB,MAAM;AAE/B,SAAO,cAAc,MAAM;;AAI7B,QAFe,QAAQ,WAAW,IACpB,WAAW,OAAQA,oDAA2B,GAAG;;AAIjE,SAAgB,YAAoC,OAAiB;AACnE,OAAM,MAAM,GAAG,OAAO,EAAE,eAAe,MAAM,EAAE,eAAe,GAAG;AACjE,QAAO"}

package/dist/common/data/sortable.mjs

@@ -1,2 +1,32 @@
-import{getSecureRandomIfPossible as e}from"./math.mjs";function t(t){return t.reduce((e,t)=>Math.min(e,t.sort_weight||0),0)-1-e()}function n(t){return t.reduce((e,t)=>Math.max(e,t.sort_weight||0),0)+1+e()}function r(r,a,o){let s=o.length,c=r<a;if(s<=0||r>=s-1)return n(o);if(r<=0)return t(o);o=i([...o]);let l=c?-1:0,u=o[r+l].sort_weight||0,d=(o[r+l+1].sort_weight||0)-u;return d===0?c?t(o):n(o):u+d/2+d*.01*(e()-.5)}function i(e){return e.sort((e,t)=>(e.sort_weight||0)-(t.sort_weight||0)),e}export{n as endSortWeight,r as moveSortWeight,i as sortedItems,t as startSortWeight};
+import { getSecureRandomIfPossible } from "./math.mjs";
+
+//#region src/common/data/sortable.ts
+function startSortWeight(items) {
+	return items.reduce((acc, item) => Math.min(acc, item.sort_weight || 0), 0) - 1 - getSecureRandomIfPossible();
+}
+function endSortWeight(items) {
+	return items.reduce((acc, item) => Math.max(acc, item.sort_weight || 0), 0) + 1 + getSecureRandomIfPossible();
+}
+function moveSortWeight(newIndex, oldIndex, items) {
+	const count = items.length;
+	const moveLower = newIndex < oldIndex;
+	if (count <= 0 || newIndex >= count - 1) return endSortWeight(items);
+	if (newIndex <= 0) return startSortWeight(items);
+	items = sortedItems([...items]);
+	const step = moveLower ? -1 : 0;
+	const lower = items[newIndex + step].sort_weight || 0;
+	const distance = (items[newIndex + step + 1].sort_weight || 0) - lower;
+	if (distance === 0) {
+		if (moveLower) return startSortWeight(items);
+		return endSortWeight(items);
+	}
+	return lower + distance / 2 + distance * .01 * (getSecureRandomIfPossible() - .5);
+}
+function sortedItems(items) {
+	items.sort((a, b) => (a.sort_weight || 0) - (b.sort_weight || 0));
+	return items;
+}
+
+//#endregion
+export { endSortWeight, moveSortWeight, sortedItems, startSortWeight };
 //# sourceMappingURL=sortable.mjs.map

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

@@ -1 +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"}
+{"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":";;;AASA,SAAgB,gBAAgB,OAA+B;AAC7D,QACE,MAAM,QAAQ,KAAK,SAAS,KAAK,IAAI,KAAK,KAAK,eAAe,EAAE,EAAE,EAAE,GAClE,IACA,2BAA2B;;AAKjC,SAAgB,cAAc,OAA+B;AAC3D,QACE,MAAM,QAAQ,KAAK,SAAS,KAAK,IAAI,KAAK,KAAK,eAAe,EAAE,EAAE,EAAE,GAClE,IACA,2BAA2B;;AAKjC,SAAgB,eACd,UACA,UACA,OACQ;CACR,MAAM,QAAQ,MAAM;CAEpB,MAAM,YAAY,WAAW;AAC7B,KAAI,SAAS,KAAK,YAAY,QAAQ,EACpC,QAAO,cAAc,MAAM;AAE7B,KAAI,YAAY,EACd,QAAO,gBAAgB,MAAM;AAG/B,SAAQ,YAAY,CAAC,GAAG,MAAM,CAAC;CAE/B,MAAM,OAAO,YAAY,KAAK;CAC9B,MAAM,QAAQ,MAAM,WAAW,MAAM,eAAe;CAEpD,MAAM,YADQ,MAAM,WAAW,OAAO,GAAG,eAAe,KAC/B;AACzB,KAAI,aAAa,GAAG;AAElB,MAAI,UACF,QAAO,gBAAgB,MAAM;AAE/B,SAAO,cAAc,MAAM;;AAI7B,QAFe,QAAQ,WAAW,IACpB,WAAW,OAAQ,2BAA2B,GAAG;;AAIjE,SAAgB,YAAoC,OAAiB;AACnE,OAAM,MAAM,GAAG,OAAO,EAAE,eAAe,MAAM,EAAE,eAAe,GAAG;AACjE,QAAO"}

package/dist/common/data/sorted.cjs

@@ -1,2 +1,55 @@
-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;
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+const require_common_data_math = require('./math.cjs');
+
+//#region src/common/data/sorted.ts
+/** CRDT compatible sorting with a single operation. Default name is `sort` */
+function useSorted(config = {}) {
+	const { getter = (item) => item.sort } = config;
+	/** Return sorted list from low to high. */
+	function items(items) {
+		items.sort((a, b) => (getter(a) || 0) - (getter(b) || 0));
+		return items;
+	}
+	/** Get a sort suitable for adding to start of list. */
+	function start(items) {
+		return items.reduce((acc, item) => Math.min(acc, getter(item) || 0), 0) - 1 - require_common_data_math.getSecureRandomIfPossible();
+	}
+	/** Get a sort suitable for adding to end of list. */
+	function end(items) {
+		return items.reduce((acc, item) => Math.max(acc, getter(item) || 0), 0) + 1 + require_common_data_math.getSecureRandomIfPossible();
+	}
+	/** Find a suitable value inbetween a lower and upper bound. */
+	function between(lower, upper) {
+		if (lower == null) lower = (upper ?? 0) - 1;
+		if (upper == null) upper = (lower ?? 0) + 1;
+		const distance = upper - lower;
+		return lower + distance / 2 + distance * .01 * (require_common_data_math.getSecureRandomIfPossible() - .5);
+	}
+	/** Mainly for drag and drop movements, where an item has to be moved to another index. Respects its own move as well. */
+	function move(newIndex, oldIndex, sortableItems) {
+		const count = sortableItems.length;
+		const moveLower = newIndex < oldIndex;
+		if (count <= 0 || newIndex >= count - 1) return end(sortableItems);
+		if (newIndex <= 0) return start(sortableItems);
+		sortableItems = items([...sortableItems]);
+		const step = moveLower ? -1 : 0;
+		const lower = getter(sortableItems[newIndex + step]) || 0;
+		const distance = (getter(sortableItems[newIndex + step + 1]) || 0) - lower;
+		if (distance === 0) {
+			if (moveLower) return start(sortableItems);
+			return end(sortableItems);
+		}
+		return lower + distance / 2 + distance * .01 * (require_common_data_math.getSecureRandomIfPossible() - .5);
+	}
+	return {
+		start,
+		end,
+		between,
+		move,
+		items
+	};
+}
+
+//#endregion
+exports.useSorted = useSorted;
 //# sourceMappingURL=sorted.cjs.map

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

@@ -1 +1 @@
-{"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"}
+{"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":";;;;;AAGA,SAAgB,UACd,SAGI,EAAE,EACN;CACA,MAAM,EACJ,UAAU,SAAsB,KAAK,SAEnC;;CAGJ,SAAS,MAAmB,OAAiB;AAC3C,QAAM,MAAM,GAAG,OAAO,OAAO,EAAE,IAAI,MAAM,OAAO,EAAE,IAAI,GAAG;AACzD,SAAO;;;CAIT,SAAS,MAAM,OAAoB;AACjC,SACE,MAAM,QAAQ,KAAK,SAAS,KAAK,IAAI,KAAK,OAAO,KAAK,IAAI,EAAE,EAAE,EAAE,GAAG,IAAIA,oDAA2B;;;CAKtG,SAAS,IAAI,OAAoB;AAC/B,SACE,MAAM,QAAQ,KAAK,SAAS,KAAK,IAAI,KAAK,OAAO,KAAK,IAAI,EAAE,EAAE,EAAE,GAAG,IAAIA,oDAA2B;;;CAKtG,SAAS,QAAQ,OAAgB,OAAwB;AACvD,MAAI,SAAS,KACX,UAAS,SAAS,KAAK;AACzB,MAAI,SAAS,KACX,UAAS,SAAS,KAAK;EAEzB,MAAM,WAAW,QAAQ;AAKzB,SAFe,QAAQ,WAAW,IACpB,WAAW,OAAQA,oDAA2B,GAAG;;;CAKjE,SAAS,KACP,UACA,UACA,eACQ;EACR,MAAM,QAAQ,cAAc;EAE5B,MAAM,YAAY,WAAW;AAC7B,MAAI,SAAS,KAAK,YAAY,QAAQ,EACpC,QAAO,IAAI,cAAc;AAE3B,MAAI,YAAY,EACd,QAAO,MAAM,cAAc;AAG7B,kBAAgB,MAAM,CAAC,GAAG,cAAc,CAAC;EAEzC,MAAM,OAAO,YAAY,KAAK;EAC9B,MAAM,QAAQ,OAAO,cAAc,WAAW,MAAM,IAAI;EAExD,MAAM,YADQ,OAAO,cAAc,WAAW,OAAO,GAAG,IAAI,KACnC;AACzB,MAAI,aAAa,GAAG;AAElB,OAAI,UACF,QAAO,MAAM,cAAc;AAE7B,UAAO,IAAI,cAAc;;AAI3B,SAFe,QAAQ,WAAW,IACpB,WAAW,OAAQA,oDAA2B,GAAG;;AAIjE,QAAO;EACL;EACA;EACA;EACA;EACA;EACD"}

package/dist/common/data/sorted.mjs

@@ -1,2 +1,54 @@
-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};
+import { getSecureRandomIfPossible } from "./math.mjs";
+
+//#region src/common/data/sorted.ts
+/** CRDT compatible sorting with a single operation. Default name is `sort` */
+function useSorted(config = {}) {
+	const { getter = (item) => item.sort } = config;
+	/** Return sorted list from low to high. */
+	function items(items) {
+		items.sort((a, b) => (getter(a) || 0) - (getter(b) || 0));
+		return items;
+	}
+	/** Get a sort suitable for adding to start of list. */
+	function start(items) {
+		return items.reduce((acc, item) => Math.min(acc, getter(item) || 0), 0) - 1 - getSecureRandomIfPossible();
+	}
+	/** Get a sort suitable for adding to end of list. */
+	function end(items) {
+		return items.reduce((acc, item) => Math.max(acc, getter(item) || 0), 0) + 1 + getSecureRandomIfPossible();
+	}
+	/** Find a suitable value inbetween a lower and upper bound. */
+	function between(lower, upper) {
+		if (lower == null) lower = (upper ?? 0) - 1;
+		if (upper == null) upper = (lower ?? 0) + 1;
+		const distance = upper - lower;
+		return lower + distance / 2 + distance * .01 * (getSecureRandomIfPossible() - .5);
+	}
+	/** Mainly for drag and drop movements, where an item has to be moved to another index. Respects its own move as well. */
+	function move(newIndex, oldIndex, sortableItems) {
+		const count = sortableItems.length;
+		const moveLower = newIndex < oldIndex;
+		if (count <= 0 || newIndex >= count - 1) return end(sortableItems);
+		if (newIndex <= 0) return start(sortableItems);
+		sortableItems = items([...sortableItems]);
+		const step = moveLower ? -1 : 0;
+		const lower = getter(sortableItems[newIndex + step]) || 0;
+		const distance = (getter(sortableItems[newIndex + step + 1]) || 0) - lower;
+		if (distance === 0) {
+			if (moveLower) return start(sortableItems);
+			return end(sortableItems);
+		}
+		return lower + distance / 2 + distance * .01 * (getSecureRandomIfPossible() - .5);
+	}
+	return {
+		start,
+		end,
+		between,
+		move,
+		items
+	};
+}
+
+//#endregion
+export { useSorted };
 //# sourceMappingURL=sorted.mjs.map

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

@@ -1 +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"}
+{"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":";;;;AAGA,SAAgB,UACd,SAGI,EAAE,EACN;CACA,MAAM,EACJ,UAAU,SAAsB,KAAK,SAEnC;;CAGJ,SAAS,MAAmB,OAAiB;AAC3C,QAAM,MAAM,GAAG,OAAO,OAAO,EAAE,IAAI,MAAM,OAAO,EAAE,IAAI,GAAG;AACzD,SAAO;;;CAIT,SAAS,MAAM,OAAoB;AACjC,SACE,MAAM,QAAQ,KAAK,SAAS,KAAK,IAAI,KAAK,OAAO,KAAK,IAAI,EAAE,EAAE,EAAE,GAAG,IAAI,2BAA2B;;;CAKtG,SAAS,IAAI,OAAoB;AAC/B,SACE,MAAM,QAAQ,KAAK,SAAS,KAAK,IAAI,KAAK,OAAO,KAAK,IAAI,EAAE,EAAE,EAAE,GAAG,IAAI,2BAA2B;;;CAKtG,SAAS,QAAQ,OAAgB,OAAwB;AACvD,MAAI,SAAS,KACX,UAAS,SAAS,KAAK;AACzB,MAAI,SAAS,KACX,UAAS,SAAS,KAAK;EAEzB,MAAM,WAAW,QAAQ;AAKzB,SAFe,QAAQ,WAAW,IACpB,WAAW,OAAQ,2BAA2B,GAAG;;;CAKjE,SAAS,KACP,UACA,UACA,eACQ;EACR,MAAM,QAAQ,cAAc;EAE5B,MAAM,YAAY,WAAW;AAC7B,MAAI,SAAS,KAAK,YAAY,QAAQ,EACpC,QAAO,IAAI,cAAc;AAE3B,MAAI,YAAY,EACd,QAAO,MAAM,cAAc;AAG7B,kBAAgB,MAAM,CAAC,GAAG,cAAc,CAAC;EAEzC,MAAM,OAAO,YAAY,KAAK;EAC9B,MAAM,QAAQ,OAAO,cAAc,WAAW,MAAM,IAAI;EAExD,MAAM,YADQ,OAAO,cAAc,WAAW,OAAO,GAAG,IAAI,KACnC;AACzB,MAAI,aAAa,GAAG;AAElB,OAAI,UACF,QAAO,MAAM,cAAc;AAE7B,UAAO,IAAI,cAAc;;AAI3B,SAFe,QAAQ,WAAW,IACpB,WAAW,OAAQ,2BAA2B,GAAG;;AAIjE,QAAO;EACL;EACA;EACA;EACA;EACA;EACD"}

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

@@ -1,2 +1,241 @@
-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;
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+
+//#region src/common/data/string-deburr.ts
+/**
+* The base implementation of `propertyOf` without support for deep paths.
+*/
+function basePropertyOf(object) {
+	return (key) => object == null ? void 0 : object[key];
+}
+/** Used to map Latin Unicode letters to basic Latin letters. */
+const deburredLetters = {
+	À: "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"
+};
+/**
+* Used by `deburr` to convert Latin-1 Supplement and Latin Extended-A
+* letters to basic Latin letters.
+*
+* @private
+* @param {string} letter The matched letter to deburr.
+* @returns {string} Returns the deburred letter.
+*/
+let deburrLetter;
+/** Used to match Latin Unicode letters (excluding mathematical operators). */
+const reLatin = /[\xD8-\xF6\u0100-\u017F]/gi;
+/**
+* Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and
+* [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).
+*/
+let reComboMark;
+/**
+* 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'
+*/
+function deburr(string) {
+	if (reComboMark == null) reComboMark = RegExp(`[\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\u1ab0-\\u1aff\\u1dc0-\\u1dff]`, "g");
+	if (deburrLetter == null) deburrLetter = basePropertyOf(deburredLetters);
+	return string && string.replace(reLatin, deburrLetter).replace(reComboMark, "");
+}
+
+//#endregion
+exports.deburr = deburr;
 //# sourceMappingURL=string-deburr.cjs.map