@vielzeug/arsenal 26.11.5 → 26.11.6

package/README.md

@@ -30,7 +30,12 @@ const responses = cache<string, unknown>({ ttlMs: 60_000 });
 const profile = await responses.getOrLoad('/profile', () => fetch('/profile').then((response) => response.json()));
 const cachedResponses = responses.entries();
 
-console.log(groupBy(matches, (user) => user.name), data, profile, cachedResponses);
+console.log(
+  groupBy(matches, (user) => user.name),
+  data,
+  profile,
+  cachedResponses,
+);
 pool.dispose();
 ```
 

package/dist/_common/_lruMap.js

@@ -1,4 +1,4 @@
-//#region src/_common/_lruMap.ts
+// src/_common/_lruMap.ts
 var LruMap = class extends Map {
 	maxSize;
 	constructor(e) {
@@ -12,7 +12,6 @@ var LruMap = class extends Map {
 		return !1;
 	}
 };
-//#endregion
 export { LruMap };
 
 //# sourceMappingURL=_lruMap.js.map

package/dist/_common/_selectorSet.js

@@ -1,4 +1,4 @@
-//#region src/_common/_selectorSet.ts
+// src/_common/_selectorSet.ts
 function toSelectorSet(e, t) {
 	return new Set(e.map((e) => t(e)));
 }
@@ -10,7 +10,6 @@ function dedupeBySelector(e, t) {
 	}
 	return r;
 }
-//#endregion
 export { dedupeBySelector, toSelectorSet };
 
 //# sourceMappingURL=_selectorSet.js.map

package/dist/_common/unsafePaths.js

@@ -1,4 +1,4 @@
-//#region src/_common/unsafePaths.ts
+// src/_common/unsafePaths.ts
 var e = /* @__PURE__ */ new Set([
 	"__proto__",
 	"constructor",
@@ -7,7 +7,6 @@ var e = /* @__PURE__ */ new Set([
 function isUnsafeKey(t) {
 	return typeof t == "string" && e.has(t);
 }
-//#endregion
 export { e as UNSAFE_PATH_SEGMENTS, isUnsafeKey };
 
 //# sourceMappingURL=unsafePaths.js.map

package/dist/_dev.js

@@ -1,6 +1,5 @@
-//#region src/_dev.ts
+// src/_dev.ts
 function warn(e) {}
-//#endregion
 export { warn };
 
 //# sourceMappingURL=_dev.js.map

package/dist/array/chunk.js

@@ -1,10 +1,9 @@
-//#region src/array/chunk.ts
+// src/array/chunk.ts
 function chunk(e, t = 2) {
 	if (!Array.isArray(e) && typeof e != "string") throw TypeError("chunk: argument must be an array or string");
 	if (!Number.isInteger(t) || t < 1) throw RangeError("chunk: size must be a positive integer");
 	return Array.from({ length: Math.ceil(e.length / t) }, (n, r) => e.slice(r * t, r * t + t));
 }
-//#endregion
 export { chunk };
 
 //# sourceMappingURL=chunk.js.map

package/dist/array/compact.js

@@ -1,8 +1,7 @@
-//#region src/array/compact.ts
+// src/array/compact.ts
 function compact(e) {
 	return e.filter(Boolean);
 }
-//#endregion
 export { compact };
 
 //# sourceMappingURL=compact.js.map

package/dist/array/compare.js

@@ -1,4 +1,4 @@
-//#region src/array/compare.ts
+// src/array/compare.ts
 var compare = (e, t) => {
 	if (e === t) return 0;
 	if (e === void 0) return 1;
@@ -13,7 +13,6 @@ var compare = (e, t) => {
 	}
 	throw TypeError(`compare: unsupported types "${typeof e}" and "${typeof t}". Supported: number, string, Date, null, undefined.`);
 };
-//#endregion
 export { compare };
 
 //# sourceMappingURL=compare.js.map

package/dist/array/compareBy.js

@@ -1,5 +1,5 @@
 import { compare as e } from "./compare.js";
-//#region src/array/compareBy.ts
+// src/array/compareBy.ts
 var compareBy = (t) => {
 	let n = Object.entries(t);
 	return (t, r) => {
@@ -10,7 +10,6 @@ var compareBy = (t) => {
 		return 0;
 	};
 };
-//#endregion
 export { compareBy };
 
 //# sourceMappingURL=compareBy.js.map

package/dist/array/contains.js

@@ -1,9 +1,8 @@
 import { isEqual as e } from "../guards/isEqual.js";
-//#region src/array/contains.ts
+// src/array/contains.ts
 function contains(t, n) {
 	return typeof n != "object" || !n ? t.includes(n) : t.some((t) => e(t, n));
 }
-//#endregion
 export { contains };
 
 //# sourceMappingURL=contains.js.map

package/dist/array/countBy.js

@@ -1,5 +1,5 @@
 import { isUnsafeKey as e } from "../_common/unsafePaths.js";
-//#region src/array/countBy.ts
+// src/array/countBy.ts
 function countBy(t, n) {
 	let r = {};
 	for (let i = 0; i < t.length; i++) {
@@ -8,7 +8,6 @@ function countBy(t, n) {
 	}
 	return r;
 }
-//#endregion
 export { countBy };
 
 //# sourceMappingURL=countBy.js.map

package/dist/array/difference.js

@@ -1,5 +1,5 @@
 import { toSelectorSet as e } from "../_common/_selectorSet.js";
-//#region src/array/difference.ts
+// src/array/difference.ts
 function difference(t, n, r) {
 	if (!r) {
 		let e = new Set(n);
@@ -8,7 +8,6 @@ function difference(t, n, r) {
 	let i = e(n, r);
 	return t.filter((e) => !i.has(r(e)));
 }
-//#endregion
 export { difference };
 
 //# sourceMappingURL=difference.js.map

package/dist/array/drop.js

@@ -1,9 +1,8 @@
-//#region src/array/drop.ts
+// src/array/drop.ts
 function drop(e, t = 1) {
 	let n = Math.max(0, Math.floor(t));
 	return e.slice(n);
 }
-//#endregion
 export { drop };
 
 //# sourceMappingURL=drop.js.map

package/dist/array/dropLast.js

@@ -1,9 +1,8 @@
-//#region src/array/dropLast.ts
+// src/array/dropLast.ts
 function dropLast(e, t = 1) {
 	let n = Math.max(0, Math.floor(t));
 	return n === 0 ? [...e] : e.slice(0, Math.max(0, e.length - n));
 }
-//#endregion
 export { dropLast };
 
 //# sourceMappingURL=dropLast.js.map

package/dist/array/filterMap.js

@@ -1,4 +1,4 @@
-//#region src/array/filterMap.ts
+// src/array/filterMap.ts
 function filterMap(e, t) {
 	let n = [];
 	for (let r = 0; r < e.length; r++) {
@@ -7,7 +7,6 @@ function filterMap(e, t) {
 	}
 	return n;
 }
-//#endregion
 export { filterMap };
 
 //# sourceMappingURL=filterMap.js.map

package/dist/array/first.js

@@ -1,8 +1,7 @@
-//#region src/array/first.ts
+// src/array/first.ts
 function first(e, t) {
 	return e.length > 0 ? e[0] : t;
 }
-//#endregion
 export { first };
 
 //# sourceMappingURL=first.js.map

package/dist/array/groupBy.js

@@ -1,5 +1,5 @@
 import { isUnsafeKey as e } from "../_common/unsafePaths.js";
-//#region src/array/groupBy.ts
+// src/array/groupBy.ts
 function groupBy(t, n) {
 	let r = {};
 	for (let i of t) {
@@ -8,7 +8,6 @@ function groupBy(t, n) {
 	}
 	return r;
 }
-//#endregion
 export { groupBy };
 
 //# sourceMappingURL=groupBy.js.map

package/dist/array/indexBy.js

@@ -1,5 +1,5 @@
 import { isUnsafeKey as e } from "../_common/unsafePaths.js";
-//#region src/array/indexBy.ts
+// src/array/indexBy.ts
 function indexBy(t, n) {
 	let r = {};
 	for (let i of t) {
@@ -8,7 +8,6 @@ function indexBy(t, n) {
 	}
 	return r;
 }
-//#endregion
 export { indexBy };
 
 //# sourceMappingURL=indexBy.js.map

package/dist/array/intersection.js

@@ -1,5 +1,5 @@
 import { toSelectorSet as e } from "../_common/_selectorSet.js";
-//#region src/array/intersection.ts
+// src/array/intersection.ts
 function intersection(t, n, r) {
 	if (!r) {
 		let e = new Set(n);
@@ -8,7 +8,6 @@ function intersection(t, n, r) {
 	let i = e(n, r);
 	return t.filter((e) => i.has(r(e)));
 }
-//#endregion
 export { intersection };
 
 //# sourceMappingURL=intersection.js.map

package/dist/array/last.js

@@ -1,8 +1,7 @@
-//#region src/array/last.ts
+// src/array/last.ts
 function last(e, t) {
 	return e.length > 0 ? e[e.length - 1] : t;
 }
-//#endregion
 export { last };
 
 //# sourceMappingURL=last.js.map

package/dist/array/paginate.js

@@ -1,4 +1,4 @@
-//#region src/array/paginate.ts
+// src/array/paginate.ts
 function paginate(e, t = {}) {
 	if (!Array.isArray(e)) throw TypeError("paginate: first argument must be an array");
 	let { pageOffset: n = 1, pageSize: r = 20 } = t, i = t.page ?? n;
@@ -13,7 +13,6 @@ function paginate(e, t = {}) {
 		totalPages: a
 	};
 }
-//#endregion
 export { paginate };
 
 //# sourceMappingURL=paginate.js.map

package/dist/array/partition.js

@@ -1,10 +1,9 @@
-//#region src/array/partition.ts
+// src/array/partition.ts
 function partition(e, t) {
 	let n = [], r = [];
 	for (let i = 0; i < e.length; i++) t(e[i], i, e) ? n.push(e[i]) : r.push(e[i]);
 	return [n, r];
 }
-//#endregion
 export { partition };
 
 //# sourceMappingURL=partition.js.map

package/dist/array/replace.js

@@ -1,4 +1,4 @@
-//#region src/array/replace.ts
+// src/array/replace.ts
 function replace(e, t, n) {
 	let r = e.findIndex(t);
 	return r === -1 ? e : [
@@ -7,7 +7,6 @@ function replace(e, t, n) {
 		...e.slice(r + 1)
 	];
 }
-//#endregion
 export { replace };
 
 //# sourceMappingURL=replace.js.map

package/dist/array/rotate.js

@@ -1,10 +1,9 @@
-//#region src/array/rotate.ts
+// src/array/rotate.ts
 function rotate(e, t, { wrap: n = !1 } = {}) {
 	if (e.length === 0) return e;
 	let r = (t % e.length + e.length) % e.length, i = e.slice(r);
 	return n ? [...i, ...e.slice(0, r)] : i;
 }
-//#endregion
 export { rotate };
 
 //# sourceMappingURL=rotate.js.map

package/dist/array/search.js

@@ -1,5 +1,5 @@
 import { similarity as e } from "../string/similarity.js";
-//#region src/array/search.ts
+// src/array/search.ts
 var normalizeText = (e) => e.normalize("NFKD").replace(/\p{M}/gu, ""), termsFor = (e, t) => {
 	let n = t(e);
 	return typeof n == "string" ? [n] : n;
@@ -24,7 +24,6 @@ function fuzzyScore(e, t, n = {}) {
 		score: 1
 	}));
 }
-//#endregion
 export { fuzzyFilter, fuzzyScore };
 
 //# sourceMappingURL=search.js.map

package/dist/array/sort.cjs

@@ -1,2 +1,2 @@
-const e=require("./compare.cjs"),t=require("./compareBy.cjs"),n=require("../object/getPath.cjs");function isCriteriaForm(e){return Array.isArray(e)}function sort(r,i,a=`asc`){if(!Array.isArray(r))throw TypeError(`sort: first argument must be an array`);if(typeof i==`function`){let t=a===`desc`?-1:1;return[...r].sort((n,r)=>e.compare(i(n),i(r))*t)}if(isCriteriaForm(i)){let t=i.map(({direction:e=`asc`,key:t})=>({multiplier:e===`desc`?-1:1,path:String(t)}));return[...r].sort((r,i)=>{for(let{multiplier:a,path:o}of t){let t=e.compare(n.getPath(r,o),n.getPath(i,o))*a;if(t!==0)return t}return 0})}return[...r].sort(t.compareBy(i))}exports.sort=sort;
+const e=require("../object/getPath.cjs"),t=require("./compare.cjs"),n=require("./compareBy.cjs");function isCriteriaForm(e){return Array.isArray(e)}function sort(r,i,a=`asc`){if(!Array.isArray(r))throw TypeError(`sort: first argument must be an array`);if(typeof i==`function`){let e=a===`desc`?-1:1;return[...r].sort((n,r)=>t.compare(i(n),i(r))*e)}if(isCriteriaForm(i)){let n=i.map(({direction:e=`asc`,key:t})=>({multiplier:e===`desc`?-1:1,path:String(t)}));return[...r].sort((r,i)=>{for(let{multiplier:a,path:o}of n){let n=t.compare(e.getPath(r,o),e.getPath(i,o))*a;if(n!==0)return n}return 0})}return[...r].sort(n.compareBy(i))}exports.sort=sort;
 //# sourceMappingURL=sort.cjs.map

package/dist/array/sort.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"sort.cjs","names":["compare","getPath","compareBy","require_compare","require_compareBy","require_getPath","value","array","selectorOrSelectors","multiplier","direction","a","b","criteria","dir","key","result","path"],"sources":["../../src/array/sort.ts"],"sourcesContent":["import { getPath } from '../object/getPath';\nimport { compare } from './compare';\nimport { compareBy } from './compareBy';\n\nexport type SortDirection = 'asc' | 'desc';\nexport type SortSelectors<T> = Partial<Record<keyof T, SortDirection>>;\n\n/**\n * One ordering term: a dot-notation path into the item plus its direction.\n *\n * `key` accepts a `keyof T` or any dotted/bracketed path (`'address.city'`,\n * `'tags[0]'`), because a data grid's sortable columns are strings known only at\n * runtime. Values are resolved with `getPath`, which refuses prototype-access segments.\n */\nexport type SortCriterion<T> = Readonly<{\n  key: keyof T | (string & {});\n  direction?: SortDirection;\n}>;\n\n/**\n * Criteria arrive as a plain or frozen array from callers; `Array.isArray` alone cannot\n * narrow a `ReadonlyArray` member out of a union, so the discriminant gets a name.\n */\nfunction isCriteriaForm<T>(\n  value: ((item: T) => unknown) | ReadonlyArray<SortCriterion<T>> | SortSelectors<T>,\n): value is ReadonlyArray<SortCriterion<T>> {\n  return Array.isArray(value);\n}\n\n/**\n * Sorts an array by a selector function (single-field), by a multi-field object of\n * `{ key: 'asc' | 'desc' }` entries, or by an ordered list of path criteria.\n *\n * The criteria form is the one a grid or table hands over: column ids arrive as\n * runtime strings, so they cannot be typed `keyof T` keys. Ordering is delegated to\n * `compare`, which means a column mixing incompatible value types (a number beside a\n * string) throws a `TypeError` instead of guessing an order — keep columns typed.\n *\n * Ties keep their input order: `Array.prototype.sort` is stable in every supported\n * engine and no tiebreaker is layered on top.\n *\n * @example\n * ```ts\n * // Single field\n * sort([{ a: 2 }, { a: 1 }], item => item.a); // [{ a:1 }, { a:2 }]\n * sort([{ a: 2 }, { a: 1 }], item => item.a, 'desc'); // [{ a:2 }, { a:1 }]\n *\n * // Multi-field by key\n * sort(users, { name: 'asc', age: 'desc' });\n *\n * // Ordered path criteria, nested paths included\n * sort(rows, [{ key: 'address.city' }, { key: 'age', direction: 'desc' }]);\n * ```\n *\n * @param array - The array to sort.\n * @param selector - A function extracting the sort key, a multi-field object, or path criteria.\n * @param direction - `'asc'` (default) or `'desc'`: only applies to single-field mode.\n * @returns A new sorted array.\n *\n * @throws {TypeError} If the first argument is not an array, or a column mixes value types.\n */\nexport function sort<T>(array: readonly T[], selector: (item: T) => unknown, direction?: SortDirection): T[];\nexport function sort<T>(array: readonly T[], selectors: SortSelectors<T>): T[];\nexport function sort<T>(array: readonly T[], criteria: ReadonlyArray<SortCriterion<T>>): T[];\nexport function sort<T>(\n  array: readonly T[],\n  selectorOrSelectors: ((item: T) => unknown) | ReadonlyArray<SortCriterion<T>> | SortSelectors<T>,\n  direction: SortDirection = 'asc',\n): T[] {\n  if (!Array.isArray(array)) throw new TypeError('sort: first argument must be an array');\n\n  if (typeof selectorOrSelectors === 'function') {\n    const multiplier = direction === 'desc' ? -1 : 1;\n\n    return [...array].sort((a, b) => compare(selectorOrSelectors(a), selectorOrSelectors(b)) * multiplier);\n  }\n\n  if (isCriteriaForm(selectorOrSelectors)) {\n    const criteria = selectorOrSelectors.map(({ direction: dir = 'asc', key }) => ({\n      multiplier: dir === 'desc' ? -1 : 1,\n      path: String(key),\n    }));\n\n    return [...array].sort((a, b) => {\n      for (const { multiplier, path } of criteria) {\n        const result = compare(getPath(a, path), getPath(b, path)) * multiplier;\n\n        if (result !== 0) return result;\n      }\n\n      return 0;\n    });\n  }\n\n  return [...array].sort(compareBy(selectorOrSelectors));\n}\n"],"mappings":"A,iGAuBA,SAAS,eACP,EAC0C,CAC1C,OAAO,MAAM,QAAQM,CAAK,CAC5B,CAqCA,SAAgB,KACd,EACA,EACA,EAA2B,MACtB,CACL,GAAI,CAAC,MAAM,QAAQC,CAAK,EAAG,MAAU,UAAU,uCAAuC,EAEtF,GAAI,OAAOC,GAAwB,WAAY,CAC7C,IAAMC,EAAaC,IAAc,OAAS,GAAK,EAE/C,MAAO,CAAC,GAAGH,CAAK,CAAC,CAAC,MAAM,EAAG,IAAMP,EAAAA,QAAQQ,EAAoBG,CAAC,EAAGH,EAAoBI,CAAC,CAAC,EAAIH,CAAU,CACvG,CAEA,GAAI,eAAeD,CAAmB,EAAG,CACvC,IAAMK,EAAWL,EAAoB,KAAK,CAAE,UAAWM,EAAM,MAAO,UAAW,CAC7E,WAAYA,IAAQ,OAAS,GAAK,EAClC,KAAM,OAAOC,CAAG,CAClB,EAAE,EAEF,MAAO,CAAC,GAAGR,CAAK,CAAC,CAAC,MAAM,EAAG,IAAM,CAC/B,IAAK,GAAM,CAAE,aAAY,UAAUM,EAAU,CAC3C,IAAMG,EAAShB,EAAAA,QAAQC,EAAAA,QAAQU,EAAGM,CAAI,EAAGhB,EAAAA,QAAQW,EAAGK,CAAI,CAAC,EAAIR,EAE7D,GAAIO,IAAW,EAAG,OAAOA,CAC3B,CAEA,MAAO,EACT,CAAC,CACH,CAEA,MAAO,CAAC,GAAGT,CAAK,CAAC,CAAC,KAAKL,EAAAA,UAAUM,CAAmB,CAAC,CACvD,C"}
+{"version":3,"file":"sort.cjs","names":["compare","getPath","compareBy","require_getPath","require_compare","require_compareBy","value","array","selectorOrSelectors","multiplier","direction","a","b","criteria","dir","key","result","path"],"sources":["../../src/array/sort.ts"],"sourcesContent":["import { getPath } from '../object/getPath';\nimport { compare } from './compare';\nimport { compareBy } from './compareBy';\n\nexport type SortDirection = 'asc' | 'desc';\nexport type SortSelectors<T> = Partial<Record<keyof T, SortDirection>>;\n\n/**\n * One ordering term: a dot-notation path into the item plus its direction.\n *\n * `key` accepts a `keyof T` or any dotted/bracketed path (`'address.city'`,\n * `'tags[0]'`), because a data grid's sortable columns are strings known only at\n * runtime. Values are resolved with `getPath`, which refuses prototype-access segments.\n */\nexport type SortCriterion<T> = Readonly<{\n  key: keyof T | (string & {});\n  direction?: SortDirection;\n}>;\n\n/**\n * Criteria arrive as a plain or frozen array from callers; `Array.isArray` alone cannot\n * narrow a `ReadonlyArray` member out of a union, so the discriminant gets a name.\n */\nfunction isCriteriaForm<T>(\n  value: ((item: T) => unknown) | ReadonlyArray<SortCriterion<T>> | SortSelectors<T>,\n): value is ReadonlyArray<SortCriterion<T>> {\n  return Array.isArray(value);\n}\n\n/**\n * Sorts an array by a selector function (single-field), by a multi-field object of\n * `{ key: 'asc' | 'desc' }` entries, or by an ordered list of path criteria.\n *\n * The criteria form is the one a grid or table hands over: column ids arrive as\n * runtime strings, so they cannot be typed `keyof T` keys. Ordering is delegated to\n * `compare`, which means a column mixing incompatible value types (a number beside a\n * string) throws a `TypeError` instead of guessing an order — keep columns typed.\n *\n * Ties keep their input order: `Array.prototype.sort` is stable in every supported\n * engine and no tiebreaker is layered on top.\n *\n * @example\n * ```ts\n * // Single field\n * sort([{ a: 2 }, { a: 1 }], item => item.a); // [{ a:1 }, { a:2 }]\n * sort([{ a: 2 }, { a: 1 }], item => item.a, 'desc'); // [{ a:2 }, { a:1 }]\n *\n * // Multi-field by key\n * sort(users, { name: 'asc', age: 'desc' });\n *\n * // Ordered path criteria, nested paths included\n * sort(rows, [{ key: 'address.city' }, { key: 'age', direction: 'desc' }]);\n * ```\n *\n * @param array - The array to sort.\n * @param selector - A function extracting the sort key, a multi-field object, or path criteria.\n * @param direction - `'asc'` (default) or `'desc'`: only applies to single-field mode.\n * @returns A new sorted array.\n *\n * @throws {TypeError} If the first argument is not an array, or a column mixes value types.\n */\nexport function sort<T>(array: readonly T[], selector: (item: T) => unknown, direction?: SortDirection): T[];\nexport function sort<T>(array: readonly T[], selectors: SortSelectors<T>): T[];\nexport function sort<T>(array: readonly T[], criteria: ReadonlyArray<SortCriterion<T>>): T[];\nexport function sort<T>(\n  array: readonly T[],\n  selectorOrSelectors: ((item: T) => unknown) | ReadonlyArray<SortCriterion<T>> | SortSelectors<T>,\n  direction: SortDirection = 'asc',\n): T[] {\n  if (!Array.isArray(array)) throw new TypeError('sort: first argument must be an array');\n\n  if (typeof selectorOrSelectors === 'function') {\n    const multiplier = direction === 'desc' ? -1 : 1;\n\n    return [...array].sort((a, b) => compare(selectorOrSelectors(a), selectorOrSelectors(b)) * multiplier);\n  }\n\n  if (isCriteriaForm(selectorOrSelectors)) {\n    const criteria = selectorOrSelectors.map(({ direction: dir = 'asc', key }) => ({\n      multiplier: dir === 'desc' ? -1 : 1,\n      path: String(key),\n    }));\n\n    return [...array].sort((a, b) => {\n      for (const { multiplier, path } of criteria) {\n        const result = compare(getPath(a, path), getPath(b, path)) * multiplier;\n\n        if (result !== 0) return result;\n      }\n\n      return 0;\n    });\n  }\n\n  return [...array].sort(compareBy(selectorOrSelectors));\n}\n"],"mappings":"A,iGAuBA,SAAS,eACP,EAC0C,CAC1C,OAAO,MAAM,QAAQM,CAAK,CAC5B,CAqCA,SAAgB,KACd,EACA,EACA,EAA2B,MACtB,CACL,GAAI,CAAC,MAAM,QAAQC,CAAK,EAAG,MAAU,UAAU,uCAAuC,EAEtF,GAAI,OAAOC,GAAwB,WAAY,CAC7C,IAAMC,EAAaC,IAAc,OAAS,GAAK,EAE/C,MAAO,CAAC,GAAGH,CAAK,CAAC,CAAC,MAAM,EAAG,IAAMP,EAAAA,QAAQQ,EAAoBG,CAAC,EAAGH,EAAoBI,CAAC,CAAC,EAAIH,CAAU,CACvG,CAEA,GAAI,eAAeD,CAAmB,EAAG,CACvC,IAAMK,EAAWL,EAAoB,KAAK,CAAE,UAAWM,EAAM,MAAO,UAAW,CAC7E,WAAYA,IAAQ,OAAS,GAAK,EAClC,KAAM,OAAOC,CAAG,CAClB,EAAE,EAEF,MAAO,CAAC,GAAGR,CAAK,CAAC,CAAC,MAAM,EAAG,IAAM,CAC/B,IAAK,GAAM,CAAE,aAAY,UAAUM,EAAU,CAC3C,IAAMG,EAAShB,EAAAA,QAAQC,EAAAA,QAAQU,EAAGM,CAAI,EAAGhB,EAAAA,QAAQW,EAAGK,CAAI,CAAC,EAAIR,EAE7D,GAAIO,IAAW,EAAG,OAAOA,CAC3B,CAEA,MAAO,EACT,CAAC,CACH,CAEA,MAAO,CAAC,GAAGT,CAAK,CAAC,CAAC,KAAKL,EAAAA,UAAUM,CAAmB,CAAC,CACvD,C"}

package/dist/array/sort.js

@@ -1,32 +1,31 @@
-import { compare as e } from "./compare.js";
-import { compareBy as t } from "./compareBy.js";
-import { getPath as n } from "../object/getPath.js";
-//#region src/array/sort.ts
+import { getPath as e } from "../object/getPath.js";
+import { compare as t } from "./compare.js";
+import { compareBy as n } from "./compareBy.js";
+// src/array/sort.ts
 function isCriteriaForm(e) {
 	return Array.isArray(e);
 }
 function sort(r, i, a = "asc") {
 	if (!Array.isArray(r)) throw TypeError("sort: first argument must be an array");
 	if (typeof i == "function") {
-		let t = a === "desc" ? -1 : 1;
-		return [...r].sort((n, r) => e(i(n), i(r)) * t);
+		let e = a === "desc" ? -1 : 1;
+		return [...r].sort((n, r) => t(i(n), i(r)) * e);
 	}
 	if (isCriteriaForm(i)) {
-		let t = i.map(({ direction: e = "asc", key: t }) => ({
+		let n = i.map(({ direction: e = "asc", key: t }) => ({
 			multiplier: e === "desc" ? -1 : 1,
 			path: String(t)
 		}));
 		return [...r].sort((r, i) => {
-			for (let { multiplier: a, path: o } of t) {
-				let t = e(n(r, o), n(i, o)) * a;
-				if (t !== 0) return t;
+			for (let { multiplier: a, path: o } of n) {
+				let n = t(e(r, o), e(i, o)) * a;
+				if (n !== 0) return n;
 			}
 			return 0;
 		});
 	}
-	return [...r].sort(t(i));
+	return [...r].sort(n(i));
 }
-//#endregion
 export { sort };
 
 //# sourceMappingURL=sort.js.map

package/dist/array/take.js

@@ -1,9 +1,8 @@
-//#region src/array/take.ts
+// src/array/take.ts
 function take(e, t = 1) {
 	let n = Math.max(0, Math.floor(t));
 	return e.slice(0, n);
 }
-//#endregion
 export { take };
 
 //# sourceMappingURL=take.js.map

package/dist/array/takeLast.js

@@ -1,9 +1,8 @@
-//#region src/array/takeLast.ts
+// src/array/takeLast.ts
 function takeLast(e, t = 1) {
 	let n = Math.max(0, Math.floor(t));
 	return n === 0 ? [] : e.slice(Math.max(0, e.length - n));
 }
-//#endregion
 export { takeLast };
 
 //# sourceMappingURL=takeLast.js.map

package/dist/array/toggle.js

@@ -1,9 +1,8 @@
-//#region src/array/toggle.ts
+// src/array/toggle.ts
 function toggle(e, t, n, r = {}) {
 	let { strategy: i = "append" } = r, a = n ? (e) => n(e) === n(t) : (e) => e === t, o = e.findIndex(a);
 	return o === -1 ? i === "prepend" ? [t, ...e] : [...e, t] : [...e.slice(0, o), ...e.slice(o + 1)];
 }
-//#endregion
 export { toggle };
 
 //# sourceMappingURL=toggle.js.map

package/dist/array/union.js

@@ -1,9 +1,8 @@
 import { dedupeBySelector as e } from "../_common/_selectorSet.js";
-//#region src/array/union.ts
+// src/array/union.ts
 function union(t, n, r) {
 	return r ? e([...t, ...n], r) : [.../* @__PURE__ */ new Set([...t, ...n])];
 }
-//#endregion
 export { union };
 
 //# sourceMappingURL=union.js.map

package/dist/array/uniq.js

@@ -1,9 +1,8 @@
 import { dedupeBySelector as e } from "../_common/_selectorSet.js";
-//#region src/array/uniq.ts
+// src/array/uniq.ts
 function uniq(t, n) {
 	return t.length <= 1 ? [...t] : n ? e(t, n) : [...new Set(t)];
 }
-//#endregion
 export { uniq };
 
 //# sourceMappingURL=uniq.js.map

package/dist/array/unzip.js

@@ -1,11 +1,10 @@
-//#region src/array/unzip.ts
+// src/array/unzip.ts
 function unzip(e) {
 	if (e.length === 0) return [];
 	let t = e[0].length, n = Array.from({ length: t }, () => []);
 	for (let r of e) for (let e = 0; e < t; e++) n[e].push(r[e]);
 	return n;
 }
-//#endregion
 export { unzip };
 
 //# sourceMappingURL=unzip.js.map

package/dist/array/zip.js

@@ -1,11 +1,10 @@
-//#region src/array/zip.ts
+// src/array/zip.ts
 function zip(...e) {
 	if (e.length === 0) return [];
 	let t = Math.max(...e.map((e) => e.length)), n = Array(t);
 	for (let r = 0; r < t; r++) n[r] = e.map((e) => e[r]);
 	return n;
 }
-//#endregion
 export { zip };
 
 //# sourceMappingURL=zip.js.map