zeed 1.2.4 → 1.3.1

package/dist/common/data/rounding.mjs

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"rounding.mjs","names":[],"sources":["../../../src/common/data/rounding.ts"],"sourcesContent":["// From https://v2.dinerojs.com/docs/api/formatting/to-unit MIT\n\nimport { sum } from './math'\n\nexport type RoundingMode = (value: number) => number\n\nexport function isHalf(value: number): boolean {\n  return Math.abs(value) % 1 === 0.5\n}\nexport function isEven(value: number): boolean {\n  return value % 2 === 0\n}\n\nexport const roundUp: RoundingMode = value => Math.ceil(value)\nexport const roundDown: RoundingMode = value => Math.floor(value)\nexport const roundHalfUp: RoundingMode = value => Math.round(value)\n\n/**\n * Round a number with half values to nearest odd integer.\n */\nexport const roundHalfOdd: RoundingMode = (value) => {\n  const rounded = Math.round(value)\n  if (!isHalf(value))\n    return rounded\n\n  return isEven(rounded) ? rounded - 1 : rounded\n}\n\n/**\n * Round a number with half values to nearest integer farthest from zero.\n */\nexport const roundHalfAwayFromZero: RoundingMode = (value) => {\n  return isHalf(value)\n    ? Math.sign(value) * Math.ceil(Math.abs(value))\n    : Math.round(value)\n}\n\n/**\n * Round a number with half values down.\n */\nexport const roundHalfDown: RoundingMode = value =>\n  isHalf(value) ? Math.floor(value) : Math.round(value)\n\n/**\n * Round a number with half values to nearest even integer.\n * https://wiki.c2.com/?BankersRounding\n */\nexport const roundHalfEven: RoundingMode = (value) => {\n  const rounded = Math.round(value)\n  if (!isHalf(value))\n    return rounded\n\n  return isEven(rounded) ? rounded : rounded - 1\n}\n\n/**\n * Round a number with half values to nearest integer closest to zero.\n */\nexport const roundHalfTowardsZero: RoundingMode = value =>\n  isHalf(value)\n    ? Math.sign(value) * Math.floor(Math.abs(value))\n    : Math.round(value)\n\n/**\n * This is useful for percentages that should sum up to 100.\n * But can also be fine tuned.\n *\n * Original from https://github.com/super-ienien/percent-round\n */\nexport function roundArrayOfNumbersToMatchSum(ipt: number[], max = 100, decimalPlaces = 0) {\n  const iptPercents: number[] = [...ipt]\n  const length = ipt.length\n  const out: number[] = []\n  out.fill(0, length)\n\n  const total = sum(iptPercents)\n\n  if (total !== 0) {\n    const powDecimalPlaces = 10 ** decimalPlaces\n    const pow100 = max * powDecimalPlaces\n    let check100 = 0\n    for (let i = length - 1; i >= 0; i--) {\n      iptPercents[i] = max * iptPercents[i] / total\n      check100 += out[i] = Math.round(iptPercents[i] * powDecimalPlaces)\n    }\n\n    if (check100 !== pow100) {\n      const totalDiff = (check100 - pow100)\n      const roundGrain = 1\n      let grainCount = Math.abs(totalDiff)\n      const diffs = iptPercents.map((_, i) => Math.abs(out[i] - iptPercents[i] * powDecimalPlaces))\n\n      while (grainCount > 0) {\n        let idx = 0\n        let maxDiff = diffs[0]\n        for (let i = 1; i < length; i++) {\n          if (maxDiff < diffs[i]) {\n            // avoid negative result\n            if (check100 > pow100 && out[i] - roundGrain < 0)\n              continue\n            idx = i\n            maxDiff = diffs[i]\n          }\n        }\n        if (check100 > pow100)\n          out[idx] -= roundGrain\n        else\n          out[idx] += roundGrain\n\n        diffs[idx] -= roundGrain\n        grainCount--\n      }\n    }\n\n    if (powDecimalPlaces > 1)\n      return out.map(n => +((n / powDecimalPlaces).toFixed(decimalPlaces)))\n  }\n\n  return out\n}\n\nexport function roundArrayOfObjectsToMatchSum<T extends Record<string, any>>(arr: T[], name: string, max = 100, decimalPlaces = 0): T[] {\n  return roundArrayOfNumbersToMatchSum(arr.map(o => o[name]), max, decimalPlaces)\n    .map((o, i) => ({\n      ...arr[i],\n      [name]: o,\n    }))\n}\n"],"mappings":";;;AAMA,SAAgB,OAAO,OAAwB;AAC7C,QAAO,KAAK,IAAI,MAAM,GAAG,MAAM;;AAEjC,SAAgB,OAAO,OAAwB;AAC7C,QAAO,QAAQ,MAAM;;AAGvB,MAAa,WAAwB,UAAS,KAAK,KAAK,MAAM;AAC9D,MAAa,aAA0B,UAAS,KAAK,MAAM,MAAM;AACjE,MAAa,eAA4B,UAAS,KAAK,MAAM,MAAM;;;;AAKnE,MAAa,gBAA8B,UAAU;CACnD,MAAM,UAAU,KAAK,MAAM,MAAM;AACjC,KAAI,CAAC,OAAO,MAAM,CAChB,QAAO;AAET,QAAO,OAAO,QAAQ,GAAG,UAAU,IAAI;;;;;AAMzC,MAAa,yBAAuC,UAAU;AAC5D,QAAO,OAAO,MAAM,GAChB,KAAK,KAAK,MAAM,GAAG,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC,GAC7C,KAAK,MAAM,MAAM;;;;;AAMvB,MAAa,iBAA8B,UACzC,OAAO,MAAM,GAAG,KAAK,MAAM,MAAM,GAAG,KAAK,MAAM,MAAM;;;;;AAMvD,MAAa,iBAA+B,UAAU;CACpD,MAAM,UAAU,KAAK,MAAM,MAAM;AACjC,KAAI,CAAC,OAAO,MAAM,CAChB,QAAO;AAET,QAAO,OAAO,QAAQ,GAAG,UAAU,UAAU;;;;;AAM/C,MAAa,wBAAqC,UAChD,OAAO,MAAM,GACT,KAAK,KAAK,MAAM,GAAG,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,GAC9C,KAAK,MAAM,MAAM;;;;;;;AAQvB,SAAgB,8BAA8B,KAAe,MAAM,KAAK,gBAAgB,GAAG;CACzF,MAAM,cAAwB,CAAC,GAAG,IAAI;CACtC,MAAM,SAAS,IAAI;CACnB,MAAM,MAAgB,EAAE;AACxB,KAAI,KAAK,GAAG,OAAO;CAEnB,MAAM,QAAQ,IAAI,YAAY;AAE9B,KAAI,UAAU,GAAG;EACf,MAAM,mBAAmB,MAAM;EAC/B,MAAM,SAAS,MAAM;EACrB,IAAI,WAAW;AACf,OAAK,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACpC,eAAY,KAAK,MAAM,YAAY,KAAK;AACxC,eAAY,IAAI,KAAK,KAAK,MAAM,YAAY,KAAK,iBAAiB;;AAGpE,MAAI,aAAa,QAAQ;GACvB,MAAM,YAAa,WAAW;GAC9B,MAAM,aAAa;GACnB,IAAI,aAAa,KAAK,IAAI,UAAU;GACpC,MAAM,QAAQ,YAAY,KAAK,GAAG,MAAM,KAAK,IAAI,IAAI,KAAK,YAAY,KAAK,iBAAiB,CAAC;AAE7F,UAAO,aAAa,GAAG;IACrB,IAAI,MAAM;IACV,IAAI,UAAU,MAAM;AACpB,SAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAC1B,KAAI,UAAU,MAAM,IAAI;AAEtB,SAAI,WAAW,UAAU,IAAI,KAAK,aAAa,EAC7C;AACF,WAAM;AACN,eAAU,MAAM;;AAGpB,QAAI,WAAW,OACb,KAAI,QAAQ;QAEZ,KAAI,QAAQ;AAEd,UAAM,QAAQ;AACd;;;AAIJ,MAAI,mBAAmB,EACrB,QAAO,IAAI,KAAI,MAAK,EAAG,IAAI,kBAAkB,QAAQ,cAAc,CAAE;;AAGzE,QAAO;;AAGT,SAAgB,8BAA6D,KAAU,MAAc,MAAM,KAAK,gBAAgB,GAAQ;AACtI,QAAO,8BAA8B,IAAI,KAAI,MAAK,EAAE,MAAM,EAAE,KAAK,cAAc,CAC5E,KAAK,GAAG,OAAO;EACd,GAAG,IAAI;GACN,OAAO;EACT,EAAE"}

package/dist/common/data/signal.cjs

@@ -1,2 +1,40 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkBTOZJX47cjs = require('../../chunk-BTOZJX47.cjs');require('../../chunk-KYDHX5HW.cjs');require('../../chunk-B2XPF5R4.cjs');require('../../chunk-UXW3L3L6.cjs');require('../../chunk-P7XCQ7WV.cjs');exports.useSignal = _chunkBTOZJX47cjs.a;
+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,"sources":["/Users/dirk/work/github-zeed/dist/common/data/signal.cjs"],"names":[],"mappings":"AAAA,qIAAuC,oCAAiC,oCAAiC,oCAAiC,oCAAiC,wCAAuB","file":"/Users/dirk/work/github-zeed/dist/common/data/signal.cjs"}
+{"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.d.cts

@@ -1,16 +1,2 @@
-type SignalWatcher<T> = (value: T, oldValue: T) => void;
-type Signal<T> = [
-    () => T,
-    (value: T) => void,
-    (fn: SignalWatcher<T>) => () => void,
-    (fn: SignalWatcher<T>) => void
-] & {
-    get: () => T;
-    set: (value: T) => void;
-    on: (fn: SignalWatcher<T>) => () => void;
-    off: (fn: SignalWatcher<T>) => void;
-};
-/** Super simple signal implementation */
-declare function useSignal<T = any>(value: T, onChange?: SignalWatcher<T>): Signal<T>;
-
-export { type Signal, type SignalWatcher, useSignal };
+import { n as SignalWatcher, r as useSignal, t as Signal } from "../../signal-DEcbUmTc.cjs";
+export { Signal, SignalWatcher, useSignal };

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

@@ -0,0 +1,2 @@
+import { n as SignalWatcher, r as useSignal, t as Signal } from "../../signal-BXgI1Dl7.mjs";
+export { Signal, SignalWatcher, useSignal };

package/dist/common/data/signal.mjs

@@ -0,0 +1,39 @@
+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

@@ -0,0 +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":";;;;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 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk7HXAZLZNcjs = require('../../chunk-7HXAZLZN.cjs');require('../../chunk-UXW3L3L6.cjs');require('../../chunk-P7XCQ7WV.cjs');exports.endSortWeight = _chunk7HXAZLZNcjs.b; exports.moveSortWeight = _chunk7HXAZLZNcjs.c; exports.sortedItems = _chunk7HXAZLZNcjs.d; exports.startSortWeight = _chunk7HXAZLZNcjs.a;
+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,"sources":["/Users/dirk/work/github-zeed/dist/common/data/sortable.cjs"],"names":[],"mappings":"AAAA,qIAA6C,oCAAiC,oCAAiC,oLAAqF","file":"/Users/dirk/work/github-zeed/dist/common/data/sortable.cjs"}
+{"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.d.cts

@@ -1,9 +1,2 @@
-interface SortableItem {
-    sort_weight: number;
-}
-declare function startSortWeight(items: SortableItem[]): number;
-declare function endSortWeight(items: SortableItem[]): number;
-declare function moveSortWeight(newIndex: number, oldIndex: number, items: SortableItem[]): number;
-declare function sortedItems<T extends SortableItem>(items: T[]): T[];
-
-export { type SortableItem, endSortWeight, moveSortWeight, sortedItems, startSortWeight };
+import { a as startSortWeight, i as sortedItems, n as endSortWeight, r as moveSortWeight, t as SortableItem } from "../../sortable-CHnX8u4i.cjs";
+export { SortableItem, endSortWeight, moveSortWeight, sortedItems, startSortWeight };

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

@@ -0,0 +1,2 @@
+import { a as startSortWeight, i as sortedItems, n as endSortWeight, r as moveSortWeight, t as SortableItem } from "../../sortable-CDHRy7L6.mjs";
+export { SortableItem, endSortWeight, moveSortWeight, sortedItems, startSortWeight };

package/dist/common/data/sortable.mjs

@@ -0,0 +1,32 @@
+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

@@ -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":";;;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 @@
-"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 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,"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":";;;;;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.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,54 @@
+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

@@ -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":";;;;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"}