@vielzeug/toolkit 1.0.11

package/dist/math/min.js

@@ -0,0 +1,12 @@
+import { compare as e } from "../function/compare.js";
+import { boil as f } from "./boil.js";
+function u(t, m) {
+  return f(t, (r, o) => {
+    const n = m || ((i) => i);
+    return e(n(r), n(o)) < 0 ? r : o;
+  });
+}
+export {
+  u as min
+};
+//# sourceMappingURL=min.js.map

package/dist/math/min.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min.js","sources":["../../src/math/min.ts"],"sourcesContent":["import { compare } from '../function/compare';\nimport { boil } from './boil';\n\n/**\n * Finds the minimum item in an array.\n *\n * @description\n * This function can be used to find the minimum number, string, or any other type of item in an array.\n *\n * @example\n * ```ts\n * min([1, 2, 3]); // 1\n * min([{ value: 1 }, { value: 2 }, { value: 3 }], item => item.value); // 1\n * min(['apple', 'banana', 'cherry']); // 'apple'\n * min([new Date('2023-01-01'), new Date('2022-01-01')]); // 2022-01-01\n * ```\n *\n * @param array - The array to be searched.\n * @param [callback] - (optional) The function to invoke for each element in the array to determine its value.\n *\n * @return The item with the minimum value as determined by the callback function.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport function min<T>(array: T[], callback?: (item: T) => string | number | Date): T | undefined {\n  return boil(array, (a, b) => {\n    const fn = callback || ((item: T) => item);\n    return compare(fn(a), fn(b)) < 0 ? a : b;\n  });\n}\n"],"names":["min","array","callback","boil","a","b","fn","item","compare"],"mappings":";;AAwBO,SAASA,EAAOC,GAAYC,GAA+D;AAChG,SAAOC,EAAKF,GAAO,CAACG,GAAGC,MAAM;AAC3B,UAAMC,IAAKJ,MAAa,CAACK,MAAYA;AACrC,WAAOC,EAAQF,EAAGF,CAAC,GAAGE,EAAGD,CAAC,CAAC,IAAI,IAAID,IAAIC;AAAA,EACzC,CAAC;AACH;"}

package/dist/math/range.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function a(r,n,e){if(e===0)throw new Error("Step cannot be 0");if(r===n)return[];const o=Math.max(0,Math.ceil((n-r)/e+Number.EPSILON));return Array.from({length:o},(i,t)=>r+t*e)}exports.range=a;
+//# sourceMappingURL=range.cjs.map

package/dist/math/range.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"range.cjs","sources":["../../src/math/range.ts"],"sourcesContent":["/**\n * Creates an array of numbers progressing from start up to, but not including, end. A step is used to specify the difference between each number in the array.\n *\n * @example\n * ```ts\n * const start = 0;\n * const stop = 10;\n * const step = 2;\n *\n * range(start, stop, step) // [0, 2, 4, 6, 8];\n * ```\n *\n * @param start - The start of the range.\n * @param stop - The end of the range.\n * @param step - The value to increment or decrement by.\n *\n * @returns The range of numbers.\n */\nexport function range(start: number, stop: number, step: number) {\n  if (step === 0) throw new Error('Step cannot be 0');\n  if (start === stop) return [];\n  const length = Math.max(0, Math.ceil((stop - start) / step + Number.EPSILON));\n  return Array.from({ length }, (_, i) => start + i * step);\n}\n"],"names":["range","start","stop","step","length","_","i"],"mappings":"gFAkBO,SAASA,EAAMC,EAAeC,EAAcC,EAAc,CAC/D,GAAIA,IAAS,EAAG,MAAM,IAAI,MAAM,kBAAkB,EAClD,GAAIF,IAAUC,EAAM,MAAO,CAAA,EAC3B,MAAME,EAAS,KAAK,IAAI,EAAG,KAAK,MAAMF,EAAOD,GAASE,EAAO,OAAO,OAAO,CAAC,EAC5E,OAAO,MAAM,KAAK,CAAE,OAAAC,CAAA,EAAU,CAACC,EAAGC,IAAML,EAAQK,EAAIH,CAAI,CAC1D"}

package/dist/math/range.js

@@ -0,0 +1,10 @@
+function f(r, e, n) {
+  if (n === 0) throw new Error("Step cannot be 0");
+  if (r === e) return [];
+  const o = Math.max(0, Math.ceil((e - r) / n + Number.EPSILON));
+  return Array.from({ length: o }, (c, a) => r + a * n);
+}
+export {
+  f as range
+};
+//# sourceMappingURL=range.js.map

package/dist/math/range.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"range.js","sources":["../../src/math/range.ts"],"sourcesContent":["/**\n * Creates an array of numbers progressing from start up to, but not including, end. A step is used to specify the difference between each number in the array.\n *\n * @example\n * ```ts\n * const start = 0;\n * const stop = 10;\n * const step = 2;\n *\n * range(start, stop, step) // [0, 2, 4, 6, 8];\n * ```\n *\n * @param start - The start of the range.\n * @param stop - The end of the range.\n * @param step - The value to increment or decrement by.\n *\n * @returns The range of numbers.\n */\nexport function range(start: number, stop: number, step: number) {\n  if (step === 0) throw new Error('Step cannot be 0');\n  if (start === stop) return [];\n  const length = Math.max(0, Math.ceil((stop - start) / step + Number.EPSILON));\n  return Array.from({ length }, (_, i) => start + i * step);\n}\n"],"names":["range","start","stop","step","length","_","i"],"mappings":"AAkBO,SAASA,EAAMC,GAAeC,GAAcC,GAAc;AAC/D,MAAIA,MAAS,EAAG,OAAM,IAAI,MAAM,kBAAkB;AAClD,MAAIF,MAAUC,EAAM,QAAO,CAAA;AAC3B,QAAME,IAAS,KAAK,IAAI,GAAG,KAAK,MAAMF,IAAOD,KAASE,IAAO,OAAO,OAAO,CAAC;AAC5E,SAAO,MAAM,KAAK,EAAE,QAAAC,EAAA,GAAU,CAACC,GAAGC,MAAML,IAAQK,IAAIH,CAAI;AAC1D;"}

package/dist/math/rate.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function u(r,t,e=5){if(e===1)return[r];const o=(t-r)/(e-1);return Array.from({length:e},(a,n)=>r+n*o)}exports.rate=u;
+//# sourceMappingURL=rate.cjs.map

package/dist/math/rate.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"rate.cjs","sources":["../../src/math/rate.ts"],"sourcesContent":["/**\n * Creates an array of numbers progressing from min to max with a specified number of steps.\n *\n * @example\n * ```ts\n * const min = 0;\n * const max = 10;\n * const steps = 5;\n *\n * rate(min, max, steps) // [0, 2.5, 5, 7.5, 10];\n * ```\n *\n * @param min - The start of the range.\n * @param max - The end of the range.\n * @param [steps=5] - The number of steps between min and max.\n *\n * @returns The range of numbers.\n */\nexport function rate(min: number, max: number, steps = 5) {\n  if (steps === 1) return [min];\n  const stepSize = (max - min) / (steps - 1);\n  return Array.from({ length: steps }, (_, i) => min + i * stepSize);\n}\n"],"names":["rate","min","max","steps","stepSize","_","i"],"mappings":"gFAkBO,SAASA,EAAKC,EAAaC,EAAaC,EAAQ,EAAG,CACxD,GAAIA,IAAU,EAAG,MAAO,CAACF,CAAG,EAC5B,MAAMG,GAAYF,EAAMD,IAAQE,EAAQ,GACxC,OAAO,MAAM,KAAK,CAAE,OAAQA,CAAA,EAAS,CAACE,EAAGC,IAAML,EAAMK,EAAIF,CAAQ,CACnE"}

package/dist/math/rate.js

@@ -0,0 +1,9 @@
+function u(r, e, t = 5) {
+  if (t === 1) return [r];
+  const n = (e - r) / (t - 1);
+  return Array.from({ length: t }, (f, o) => r + o * n);
+}
+export {
+  u as rate
+};
+//# sourceMappingURL=rate.js.map

package/dist/math/rate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rate.js","sources":["../../src/math/rate.ts"],"sourcesContent":["/**\n * Creates an array of numbers progressing from min to max with a specified number of steps.\n *\n * @example\n * ```ts\n * const min = 0;\n * const max = 10;\n * const steps = 5;\n *\n * rate(min, max, steps) // [0, 2.5, 5, 7.5, 10];\n * ```\n *\n * @param min - The start of the range.\n * @param max - The end of the range.\n * @param [steps=5] - The number of steps between min and max.\n *\n * @returns The range of numbers.\n */\nexport function rate(min: number, max: number, steps = 5) {\n  if (steps === 1) return [min];\n  const stepSize = (max - min) / (steps - 1);\n  return Array.from({ length: steps }, (_, i) => min + i * stepSize);\n}\n"],"names":["rate","min","max","steps","stepSize","_","i"],"mappings":"AAkBO,SAASA,EAAKC,GAAaC,GAAaC,IAAQ,GAAG;AACxD,MAAIA,MAAU,EAAG,QAAO,CAACF,CAAG;AAC5B,QAAMG,KAAYF,IAAMD,MAAQE,IAAQ;AACxC,SAAO,MAAM,KAAK,EAAE,QAAQA,EAAA,GAAS,CAACE,GAAGC,MAAML,IAAMK,IAAIF,CAAQ;AACnE;"}

package/dist/math/round.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function u(t,n=0,o=Math.round){if(n===0)return o(t);const r=10**Math.max(-323,Math.min(n,292));return o(t*r)/r}exports.round=u;
+//# sourceMappingURL=round.cjs.map

package/dist/math/round.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"round.cjs","sources":["../../src/math/round.ts"],"sourcesContent":["/**\n * Rounds a number to a specified number of decimal places.\n *\n * The `precision` argument is limited to be within the range of -323 to +292 to avoid NaN results.\n *\n * @example\n * ```ts\n * round(123.456) // 123\n * round(123.456, -1) // 120\n * round(123.456, 1, Math.ceil) // 123.5\n * round(123.456, 1, Math.floor) // 123.4\n * ```\n *\n * @param value - The number to round.\n * @param precision - The number of decimal places to round to.\n * @param [parser] - (optional) function to convert the number to a value.\n *\n * @returns The rounded number.\n */\nexport function round(value: number, precision = 0, parser: (value: number) => number = Math.round): number {\n  if (precision === 0) return parser(value);\n\n  const factor = 10 ** Math.max(-323, Math.min(precision, 292));\n  return parser(value * factor) / factor;\n}\n"],"names":["round","value","precision","parser","factor"],"mappings":"gFAmBO,SAASA,EAAMC,EAAeC,EAAY,EAAGC,EAAoC,KAAK,MAAe,CAC1G,GAAID,IAAc,EAAG,OAAOC,EAAOF,CAAK,EAExC,MAAMG,EAAS,IAAM,KAAK,IAAI,KAAM,KAAK,IAAIF,EAAW,GAAG,CAAC,EAC5D,OAAOC,EAAOF,EAAQG,CAAM,EAAIA,CAClC"}

package/dist/math/round.js

@@ -0,0 +1,9 @@
+function u(t, n = 0, o = Math.round) {
+  if (n === 0) return o(t);
+  const r = 10 ** Math.max(-323, Math.min(n, 292));
+  return o(t * r) / r;
+}
+export {
+  u as round
+};
+//# sourceMappingURL=round.js.map

package/dist/math/round.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"round.js","sources":["../../src/math/round.ts"],"sourcesContent":["/**\n * Rounds a number to a specified number of decimal places.\n *\n * The `precision` argument is limited to be within the range of -323 to +292 to avoid NaN results.\n *\n * @example\n * ```ts\n * round(123.456) // 123\n * round(123.456, -1) // 120\n * round(123.456, 1, Math.ceil) // 123.5\n * round(123.456, 1, Math.floor) // 123.4\n * ```\n *\n * @param value - The number to round.\n * @param precision - The number of decimal places to round to.\n * @param [parser] - (optional) function to convert the number to a value.\n *\n * @returns The rounded number.\n */\nexport function round(value: number, precision = 0, parser: (value: number) => number = Math.round): number {\n  if (precision === 0) return parser(value);\n\n  const factor = 10 ** Math.max(-323, Math.min(precision, 292));\n  return parser(value * factor) / factor;\n}\n"],"names":["round","value","precision","parser","factor"],"mappings":"AAmBO,SAASA,EAAMC,GAAeC,IAAY,GAAGC,IAAoC,KAAK,OAAe;AAC1G,MAAID,MAAc,EAAG,QAAOC,EAAOF,CAAK;AAExC,QAAMG,IAAS,MAAM,KAAK,IAAI,MAAM,KAAK,IAAIF,GAAW,GAAG,CAAC;AAC5D,SAAOC,EAAOF,IAAQG,CAAM,IAAIA;AAClC;"}

package/dist/math/sum.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function i(t,e){if(t.length!==0)return t.reduce((n,u)=>{const r=e?e(u):u;if(r instanceof Date)return o(r,n);if(typeof r=="number")return s(n,r);throw new TypeError("sum only supports numbers and Date objects")},void 0)}function o(t,e){const n=t.getTime();return e===void 0?new Date(n):e instanceof Date?new Date(e.getTime()+n):new Date(e+n)}function s(t,e){return t===void 0?e:t instanceof Date?new Date(t.getTime()+e):t+e}exports.sum=i;
+//# sourceMappingURL=sum.cjs.map

package/dist/math/sum.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sum.cjs","sources":["../../src/math/sum.ts"],"sourcesContent":["/**\n * Sum numbers in an array or numbers mapped by a callback function.\n *\n * @example\n * ```ts\n * sum([1, 2, 3]) // 6\n * sum([{value: 1}, {value: 2}, {value: 3}], (item) => item.value) // 6\n * sum(['apple', 'banana', 'cherry']) // TypeError\n * sum([new Date('2023-01-01'), new Date('2022-01-01')]) // 467308800000\n * ```\n *\n * @param array - The array to sum.\n * @param callback - An optional callback function to map the values.\n *\n * @returns The sum of the numbers in the array or the sum of the mapped values.\n */\nexport function sum<T>(array: T[], callback?: (item: T) => number | Date): number | Date | undefined {\n  if (array.length === 0) return undefined;\n\n  return array.reduce<number | Date | undefined>((acc, item) => {\n    const value = callback ? callback(item) : item;\n    if (value instanceof Date) {\n      return sumDate(value, acc);\n    }\n    if (typeof value === 'number') {\n      return sumNumbers(acc, value);\n    }\n    throw new TypeError('sum only supports numbers and Date objects');\n  }, undefined);\n}\n\nfunction sumDate(value: Date, acc: number | Date | undefined) {\n  const valueTime = value.getTime();\n  if (acc === undefined) return new Date(valueTime);\n  if (acc instanceof Date) return new Date(acc.getTime() + valueTime);\n  return new Date(acc + valueTime);\n}\n\nfunction sumNumbers<T>(acc: number | Date | undefined, value: number | (T & number)) {\n  if (acc === undefined) return value;\n  if (acc instanceof Date) return new Date(acc.getTime() + value);\n  return acc + value;\n}\n"],"names":["sum","array","callback","acc","item","value","sumDate","sumNumbers","valueTime"],"mappings":"gFAgBO,SAASA,EAAOC,EAAYC,EAAkE,CACnG,GAAID,EAAM,SAAW,EAErB,OAAOA,EAAM,OAAkC,CAACE,EAAKC,IAAS,CAC5D,MAAMC,EAAQH,EAAWA,EAASE,CAAI,EAAIA,EAC1C,GAAIC,aAAiB,KACnB,OAAOC,EAAQD,EAAOF,CAAG,EAE3B,GAAI,OAAOE,GAAU,SACnB,OAAOE,EAAWJ,EAAKE,CAAK,EAE9B,MAAM,IAAI,UAAU,4CAA4C,CAClE,EAAG,MAAS,CACd,CAEA,SAASC,EAAQD,EAAaF,EAAgC,CAC5D,MAAMK,EAAYH,EAAM,QAAA,EACxB,OAAIF,IAAQ,OAAkB,IAAI,KAAKK,CAAS,EAC5CL,aAAe,KAAa,IAAI,KAAKA,EAAI,QAAA,EAAYK,CAAS,EAC3D,IAAI,KAAKL,EAAMK,CAAS,CACjC,CAEA,SAASD,EAAcJ,EAAgCE,EAA8B,CACnF,OAAIF,IAAQ,OAAkBE,EAC1BF,aAAe,KAAa,IAAI,KAAKA,EAAI,QAAA,EAAYE,CAAK,EACvDF,EAAME,CACf"}

package/dist/math/sum.js

@@ -0,0 +1,22 @@
+function f(t, e) {
+  if (t.length !== 0)
+    return t.reduce((n, u) => {
+      const r = e ? e(u) : u;
+      if (r instanceof Date)
+        return i(r, n);
+      if (typeof r == "number")
+        return o(n, r);
+      throw new TypeError("sum only supports numbers and Date objects");
+    }, void 0);
+}
+function i(t, e) {
+  const n = t.getTime();
+  return e === void 0 ? new Date(n) : e instanceof Date ? new Date(e.getTime() + n) : new Date(e + n);
+}
+function o(t, e) {
+  return t === void 0 ? e : t instanceof Date ? new Date(t.getTime() + e) : t + e;
+}
+export {
+  f as sum
+};
+//# sourceMappingURL=sum.js.map

package/dist/math/sum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sum.js","sources":["../../src/math/sum.ts"],"sourcesContent":["/**\n * Sum numbers in an array or numbers mapped by a callback function.\n *\n * @example\n * ```ts\n * sum([1, 2, 3]) // 6\n * sum([{value: 1}, {value: 2}, {value: 3}], (item) => item.value) // 6\n * sum(['apple', 'banana', 'cherry']) // TypeError\n * sum([new Date('2023-01-01'), new Date('2022-01-01')]) // 467308800000\n * ```\n *\n * @param array - The array to sum.\n * @param callback - An optional callback function to map the values.\n *\n * @returns The sum of the numbers in the array or the sum of the mapped values.\n */\nexport function sum<T>(array: T[], callback?: (item: T) => number | Date): number | Date | undefined {\n  if (array.length === 0) return undefined;\n\n  return array.reduce<number | Date | undefined>((acc, item) => {\n    const value = callback ? callback(item) : item;\n    if (value instanceof Date) {\n      return sumDate(value, acc);\n    }\n    if (typeof value === 'number') {\n      return sumNumbers(acc, value);\n    }\n    throw new TypeError('sum only supports numbers and Date objects');\n  }, undefined);\n}\n\nfunction sumDate(value: Date, acc: number | Date | undefined) {\n  const valueTime = value.getTime();\n  if (acc === undefined) return new Date(valueTime);\n  if (acc instanceof Date) return new Date(acc.getTime() + valueTime);\n  return new Date(acc + valueTime);\n}\n\nfunction sumNumbers<T>(acc: number | Date | undefined, value: number | (T & number)) {\n  if (acc === undefined) return value;\n  if (acc instanceof Date) return new Date(acc.getTime() + value);\n  return acc + value;\n}\n"],"names":["sum","array","callback","acc","item","value","sumDate","sumNumbers","valueTime"],"mappings":"AAgBO,SAASA,EAAOC,GAAYC,GAAkE;AACnG,MAAID,EAAM,WAAW;AAErB,WAAOA,EAAM,OAAkC,CAACE,GAAKC,MAAS;AAC5D,YAAMC,IAAQH,IAAWA,EAASE,CAAI,IAAIA;AAC1C,UAAIC,aAAiB;AACnB,eAAOC,EAAQD,GAAOF,CAAG;AAE3B,UAAI,OAAOE,KAAU;AACnB,eAAOE,EAAWJ,GAAKE,CAAK;AAE9B,YAAM,IAAI,UAAU,4CAA4C;AAAA,IAClE,GAAG,MAAS;AACd;AAEA,SAASC,EAAQD,GAAaF,GAAgC;AAC5D,QAAMK,IAAYH,EAAM,QAAA;AACxB,SAAIF,MAAQ,SAAkB,IAAI,KAAKK,CAAS,IAC5CL,aAAe,OAAa,IAAI,KAAKA,EAAI,QAAA,IAAYK,CAAS,IAC3D,IAAI,KAAKL,IAAMK,CAAS;AACjC;AAEA,SAASD,EAAcJ,GAAgCE,GAA8B;AACnF,SAAIF,MAAQ,SAAkBE,IAC1BF,aAAe,OAAa,IAAI,KAAKA,EAAI,QAAA,IAAYE,CAAK,IACvDF,IAAME;AACf;"}

package/dist/object/clone.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(e){return structuredClone(e)}exports.clone=t;
+//# sourceMappingURL=clone.cjs.map

package/dist/object/clone.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"clone.cjs","sources":["../../src/object/clone.ts"],"sourcesContent":["/**\n * Creates a deep copy of the provided data using the structuredClone algorithm.\n *\n * @example\n * ```ts\n * const obj = { a: 1, b: { c: 2 } };\n * const dup = clone(obj);\n *\n * dup.b.c = 3;\n * console.log(obj.b.c); // logs 2\n * console.log(dup.b.c); // logs 3\n * ```\n *\n * @param item - The data to clone.\n *\n * @returns A deep copy of the provided data.\n */\nexport function clone<T>(item: T): T {\n  return structuredClone(item);\n}\n"],"names":["clone","item"],"mappings":"gFAiBO,SAASA,EAASC,EAAY,CACnC,OAAO,gBAAgBA,CAAI,CAC7B"}

package/dist/object/clone.js

@@ -0,0 +1,7 @@
+function n(e) {
+  return structuredClone(e);
+}
+export {
+  n as clone
+};
+//# sourceMappingURL=clone.js.map

package/dist/object/clone.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clone.js","sources":["../../src/object/clone.ts"],"sourcesContent":["/**\n * Creates a deep copy of the provided data using the structuredClone algorithm.\n *\n * @example\n * ```ts\n * const obj = { a: 1, b: { c: 2 } };\n * const dup = clone(obj);\n *\n * dup.b.c = 3;\n * console.log(obj.b.c); // logs 2\n * console.log(dup.b.c); // logs 3\n * ```\n *\n * @param item - The data to clone.\n *\n * @returns A deep copy of the provided data.\n */\nexport function clone<T>(item: T): T {\n  return structuredClone(item);\n}\n"],"names":["clone","item"],"mappings":"AAiBO,SAASA,EAASC,GAAY;AACnC,SAAO,gBAAgBA,CAAI;AAC7B;"}

package/dist/object/diff.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("../typed/isEqual.cjs"),r=require("../typed/isObject.cjs");function u(s,i,f=b.isEqual){if(!s&&!i)return{};const n={};for(const e of new Set([...Object.keys(s??{}),...Object.keys(i??{})])){const t=s?.[e],c=i?.[e];if(r.isObject(t)&&r.isObject(c)){const o=u(t,c,f);Object.keys(o).length>0&&(n[e]=o)}else f(t,c)||(n[e]=t)}return n}exports.diff=u;
+//# sourceMappingURL=diff.cjs.map

package/dist/object/diff.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff.cjs","sources":["../../src/object/diff.ts"],"sourcesContent":["import { isEqual } from '../typed/isEqual';\nimport { isObject } from '../typed/isObject';\nimport type { Obj } from '../types';\n\n/**\n * Computes the difference between two objects.\n *\n * @example\n * ```ts\n * const obj1 = { a: 1, b: 2, c: 3 };\n * const obj2 = { b: 2, c: 3, d: 4 };\n *\n * diff(obj1, obj2); // { d: 4 }\n * ```\n *\n * @param curr - The current object.\n * @param prev - The previous object.\n * @param [compareFn] - A custom function to compare values.\n * @returns An object containing new/modified properties.\n */\nexport function diff<T extends Obj>(\n  curr?: T,\n  prev?: T,\n  compareFn: (a: unknown, b: unknown) => boolean = isEqual,\n): Partial<T> {\n  if (!curr && !prev) return {} as Partial<T>;\n\n  const result: Record<string, unknown> = {};\n\n  for (const key of new Set([...Object.keys(curr ?? {}), ...Object.keys(prev ?? {})])) {\n    const _curr = curr?.[key];\n    const _prev = prev?.[key];\n\n    if (isObject(_curr) && isObject(_prev)) {\n      const nestedDiff = diff(_curr, _prev, compareFn) as Partial<T[keyof T]>;\n      if (Object.keys(nestedDiff).length > 0) {\n        result[key] = nestedDiff;\n      }\n    } else if (!compareFn(_curr, _prev)) {\n      result[key] = _curr;\n    }\n  }\n\n  return result as Partial<T>;\n}\n"],"names":["diff","curr","prev","compareFn","isEqual","result","key","_curr","_prev","isObject","nestedDiff"],"mappings":"2JAoBO,SAASA,EACdC,EACAC,EACAC,EAAiDC,EAAAA,QACrC,CACZ,GAAI,CAACH,GAAQ,CAACC,QAAa,CAAA,EAE3B,MAAMG,EAAkC,CAAA,EAExC,UAAWC,KAAO,IAAI,IAAI,CAAC,GAAG,OAAO,KAAKL,GAAQ,CAAA,CAAE,EAAG,GAAG,OAAO,KAAKC,GAAQ,CAAA,CAAE,CAAC,CAAC,EAAG,CACnF,MAAMK,EAAQN,IAAOK,CAAG,EAClBE,EAAQN,IAAOI,CAAG,EAExB,GAAIG,EAAAA,SAASF,CAAK,GAAKE,EAAAA,SAASD,CAAK,EAAG,CACtC,MAAME,EAAaV,EAAKO,EAAOC,EAAOL,CAAS,EAC3C,OAAO,KAAKO,CAAU,EAAE,OAAS,IACnCL,EAAOC,CAAG,EAAII,EAElB,MAAYP,EAAUI,EAAOC,CAAK,IAChCH,EAAOC,CAAG,EAAIC,EAElB,CAEA,OAAOF,CACT"}

package/dist/object/diff.js

@@ -0,0 +1,18 @@
+import { isEqual as b } from "../typed/isEqual.js";
+import { isObject as r } from "../typed/isObject.js";
+function j(f, s, n = b) {
+  if (!f && !s) return {};
+  const o = {};
+  for (const t of /* @__PURE__ */ new Set([...Object.keys(f ?? {}), ...Object.keys(s ?? {})])) {
+    const e = f?.[t], i = s?.[t];
+    if (r(e) && r(i)) {
+      const c = j(e, i, n);
+      Object.keys(c).length > 0 && (o[t] = c);
+    } else n(e, i) || (o[t] = e);
+  }
+  return o;
+}
+export {
+  j as diff
+};
+//# sourceMappingURL=diff.js.map

package/dist/object/diff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff.js","sources":["../../src/object/diff.ts"],"sourcesContent":["import { isEqual } from '../typed/isEqual';\nimport { isObject } from '../typed/isObject';\nimport type { Obj } from '../types';\n\n/**\n * Computes the difference between two objects.\n *\n * @example\n * ```ts\n * const obj1 = { a: 1, b: 2, c: 3 };\n * const obj2 = { b: 2, c: 3, d: 4 };\n *\n * diff(obj1, obj2); // { d: 4 }\n * ```\n *\n * @param curr - The current object.\n * @param prev - The previous object.\n * @param [compareFn] - A custom function to compare values.\n * @returns An object containing new/modified properties.\n */\nexport function diff<T extends Obj>(\n  curr?: T,\n  prev?: T,\n  compareFn: (a: unknown, b: unknown) => boolean = isEqual,\n): Partial<T> {\n  if (!curr && !prev) return {} as Partial<T>;\n\n  const result: Record<string, unknown> = {};\n\n  for (const key of new Set([...Object.keys(curr ?? {}), ...Object.keys(prev ?? {})])) {\n    const _curr = curr?.[key];\n    const _prev = prev?.[key];\n\n    if (isObject(_curr) && isObject(_prev)) {\n      const nestedDiff = diff(_curr, _prev, compareFn) as Partial<T[keyof T]>;\n      if (Object.keys(nestedDiff).length > 0) {\n        result[key] = nestedDiff;\n      }\n    } else if (!compareFn(_curr, _prev)) {\n      result[key] = _curr;\n    }\n  }\n\n  return result as Partial<T>;\n}\n"],"names":["diff","curr","prev","compareFn","isEqual","result","key","_curr","_prev","isObject","nestedDiff"],"mappings":";;AAoBO,SAASA,EACdC,GACAC,GACAC,IAAiDC,GACrC;AACZ,MAAI,CAACH,KAAQ,CAACC,UAAa,CAAA;AAE3B,QAAMG,IAAkC,CAAA;AAExC,aAAWC,KAAO,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAKL,KAAQ,CAAA,CAAE,GAAG,GAAG,OAAO,KAAKC,KAAQ,CAAA,CAAE,CAAC,CAAC,GAAG;AACnF,UAAMK,IAAQN,IAAOK,CAAG,GAClBE,IAAQN,IAAOI,CAAG;AAExB,QAAIG,EAASF,CAAK,KAAKE,EAASD,CAAK,GAAG;AACtC,YAAME,IAAaV,EAAKO,GAAOC,GAAOL,CAAS;AAC/C,MAAI,OAAO,KAAKO,CAAU,EAAE,SAAS,MACnCL,EAAOC,CAAG,IAAII;AAAA,IAElB,MAAA,CAAYP,EAAUI,GAAOC,CAAK,MAChCH,EAAOC,CAAG,IAAIC;AAAA,EAElB;AAEA,SAAOF;AACT;"}

package/dist/object/entries.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("../function/assert.cjs"),r=require("../typed/isObject.cjs");function s(e){return t.assert(r.isObject(e),r.IS_OBJECT_ERROR_MSG,{args:{item:e},type:TypeError}),Object.entries(e)}exports.entries=s;
+//# sourceMappingURL=entries.cjs.map

package/dist/object/entries.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"entries.cjs","sources":["../../src/object/entries.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_OBJECT_ERROR_MSG, isObject } from '../typed/isObject';\nimport type { Obj } from '../types';\n\ntype Entries<T> = { [K in keyof T]: [K, T[K]] }[keyof T][];\n\n/**\n * Returns an array of a given object's own enumerable string-keyed property [key, value] pairs.\n *\n * @example\n * ```ts\n * const obj = { a: 1, b: 2, c: 3 };\n * entries(obj); // logs [['a', 1], ['b', 2], ['c', 3]]\n * ```\n *\n * @param item - The object whose properties are to be returned.\n *\n * @returns an array of the object's own enumerable string-keyed property [key, value] pairs.\n */\nexport function entries<T extends Obj>(item: T): Entries<T> {\n  assert(isObject(item), IS_OBJECT_ERROR_MSG, { args: { item }, type: TypeError });\n\n  return Object.entries(item) as Entries<T>;\n}\n"],"names":["entries","item","assert","isObject","IS_OBJECT_ERROR_MSG"],"mappings":"6JAmBO,SAASA,EAAuBC,EAAqB,CAC1DC,OAAAA,EAAAA,OAAOC,EAAAA,SAASF,CAAI,EAAGG,sBAAqB,CAAE,KAAM,CAAE,KAAAH,CAAA,EAAQ,KAAM,UAAW,EAExE,OAAO,QAAQA,CAAI,CAC5B"}

package/dist/object/entries.js

@@ -0,0 +1,9 @@
+import { assert as e } from "../function/assert.js";
+import { IS_OBJECT_ERROR_MSG as t, isObject as o } from "../typed/isObject.js";
+function p(r) {
+  return e(o(r), t, { args: { item: r }, type: TypeError }), Object.entries(r);
+}
+export {
+  p as entries
+};
+//# sourceMappingURL=entries.js.map

package/dist/object/entries.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entries.js","sources":["../../src/object/entries.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_OBJECT_ERROR_MSG, isObject } from '../typed/isObject';\nimport type { Obj } from '../types';\n\ntype Entries<T> = { [K in keyof T]: [K, T[K]] }[keyof T][];\n\n/**\n * Returns an array of a given object's own enumerable string-keyed property [key, value] pairs.\n *\n * @example\n * ```ts\n * const obj = { a: 1, b: 2, c: 3 };\n * entries(obj); // logs [['a', 1], ['b', 2], ['c', 3]]\n * ```\n *\n * @param item - The object whose properties are to be returned.\n *\n * @returns an array of the object's own enumerable string-keyed property [key, value] pairs.\n */\nexport function entries<T extends Obj>(item: T): Entries<T> {\n  assert(isObject(item), IS_OBJECT_ERROR_MSG, { args: { item }, type: TypeError });\n\n  return Object.entries(item) as Entries<T>;\n}\n"],"names":["entries","item","assert","isObject","IS_OBJECT_ERROR_MSG"],"mappings":";;AAmBO,SAASA,EAAuBC,GAAqB;AAC1D,SAAAC,EAAOC,EAASF,CAAI,GAAGG,GAAqB,EAAE,MAAM,EAAE,MAAAH,EAAA,GAAQ,MAAM,WAAW,GAExE,OAAO,QAAQA,CAAI;AAC5B;"}

package/dist/object/keys.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("../function/assert.cjs"),r=require("../typed/isObject.cjs");function t(e){return s.assert(r.isObject(e),r.IS_OBJECT_ERROR_MSG,{args:{item:e},type:TypeError}),Object.keys(e)}exports.keys=t;
+//# sourceMappingURL=keys.cjs.map

package/dist/object/keys.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"keys.cjs","sources":["../../src/object/keys.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_OBJECT_ERROR_MSG, isObject } from '../typed/isObject';\nimport type { Obj } from '../types';\n\n/**\n * Returns an array of the keys for an object's properties.\n *\n * @example\n * ```ts\n * const obj = { a: 1, b: 2, c: 3 };\n *\n * keys(obj); // ['a', 'b', 'c']\n * ```\n *\n * @param item - The object to query.\n *\n * @returns true if the object has the property, false otherwise.\n */\nexport function keys<T extends Obj, K extends keyof T>(item: T) {\n  assert(isObject(item), IS_OBJECT_ERROR_MSG, { args: { item }, type: TypeError });\n\n  return Object.keys(item) as K[];\n}\n"],"names":["keys","item","assert","isObject","IS_OBJECT_ERROR_MSG"],"mappings":"6JAkBO,SAASA,EAAuCC,EAAS,CAC9DC,OAAAA,EAAAA,OAAOC,EAAAA,SAASF,CAAI,EAAGG,sBAAqB,CAAE,KAAM,CAAE,KAAAH,CAAA,EAAQ,KAAM,UAAW,EAExE,OAAO,KAAKA,CAAI,CACzB"}

package/dist/object/keys.js

@@ -0,0 +1,9 @@
+import { assert as e } from "../function/assert.js";
+import { IS_OBJECT_ERROR_MSG as o, isObject as t } from "../typed/isObject.js";
+function y(r) {
+  return e(t(r), o, { args: { item: r }, type: TypeError }), Object.keys(r);
+}
+export {
+  y as keys
+};
+//# sourceMappingURL=keys.js.map

package/dist/object/keys.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"keys.js","sources":["../../src/object/keys.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_OBJECT_ERROR_MSG, isObject } from '../typed/isObject';\nimport type { Obj } from '../types';\n\n/**\n * Returns an array of the keys for an object's properties.\n *\n * @example\n * ```ts\n * const obj = { a: 1, b: 2, c: 3 };\n *\n * keys(obj); // ['a', 'b', 'c']\n * ```\n *\n * @param item - The object to query.\n *\n * @returns true if the object has the property, false otherwise.\n */\nexport function keys<T extends Obj, K extends keyof T>(item: T) {\n  assert(isObject(item), IS_OBJECT_ERROR_MSG, { args: { item }, type: TypeError });\n\n  return Object.keys(item) as K[];\n}\n"],"names":["keys","item","assert","isObject","IS_OBJECT_ERROR_MSG"],"mappings":";;AAkBO,SAASA,EAAuCC,GAAS;AAC9D,SAAAC,EAAOC,EAASF,CAAI,GAAGG,GAAqB,EAAE,MAAM,EAAE,MAAAH,EAAA,GAAQ,MAAM,WAAW,GAExE,OAAO,KAAKA,CAAI;AACzB;"}

package/dist/object/merge.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("../typed/isArray.cjs"),f=require("../typed/isObject.cjs");function a(r="deep",...n){return n.length===0?{}:r==="shallow"?Object.assign({},...n):n.reduce((e,i)=>l(e,i,r),{})}function l(r,n,e){if(!f.isObject(n))return n;const i={...r};for(const c in n){if(!Object.hasOwn(n,c))continue;const t=n[c],u=i[c];i[c]=o.isArray(t)&&o.isArray(u)?b(u,t,e):f.isObject(t)&&f.isObject(u)?l(u,t,e):O(u,t,e)}return i}function b(r,n,e){return r?e==="arrayConcat"?r.concat(n):e==="arrayReplace"?n:Array.from(new Set([...r,...n])):n}function O(r,n,e){return typeof e=="function"?e(r,n):e==="lastWins"||n!==void 0?n:r}exports.merge=a;
+//# sourceMappingURL=merge.cjs.map

package/dist/object/merge.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge.cjs","sources":["../../src/object/merge.ts"],"sourcesContent":["import { isArray } from '../typed/isArray';\nimport { isObject } from '../typed/isObject';\nimport type { Obj } from '../types';\n\ntype MergeStrategy =\n  | 'deep'\n  | 'shallow'\n  | 'lastWins'\n  | 'arrayConcat'\n  | 'arrayReplace'\n  // biome-ignore lint/suspicious/noExplicitAny: -\n  | ((target: any, source: any) => any);\n\ntype DeepMerge<T, U> = T extends Obj\n  ? U extends Obj\n    ? {\n        [K in keyof T | keyof U]: K extends keyof T\n          ? K extends keyof U\n            ? DeepMerge<T[K], U[K]>\n            : T[K]\n          : K extends keyof U\n            ? U[K]\n            : never;\n      }\n    : U\n  : U;\n\ntype Merge<T extends Obj[]> = T extends [infer First, ...infer Rest]\n  ? First extends Obj\n    ? Rest extends Obj[]\n      ? DeepMerge<First, Merge<Rest>>\n      : First\n    : Obj\n  : Obj;\n\n/**\n * Merges multiple objects based on a specified merge strategy.\n *\n * @example\n * ```ts\n * const obj1 = { a: 1, b: { x: 10, y: \"hello\" }, c: [1] };\n * const obj2 = { b: { y: 20, z: true }, c: [2] };\n * const obj3 = { d: false, c: [3] };\n *\n * merge(\"deep\", obj1, obj2, obj3); // { a: 1, b: { x: 10, y: 20, z: true }, c: [1, 2, 3], d: false }\n * merge(\"shallow\", obj1, obj2, obj3); // { a: 1, b: { y: 20, z: true }, c: [3], d: false }\n * ```\n *\n * @param [strategy='deep'] - The merging strategy to use.\n * @param items - The objects to merge.\n * @returns A new merged object.\n */\nexport function merge<T extends Obj[]>(strategy: MergeStrategy = 'deep', ...items: [...T]): Merge<T> {\n  if (items.length === 0) return {} as Merge<T>;\n\n  if (strategy === 'shallow') {\n    return Object.assign({}, ...items) as Merge<T>;\n  }\n\n  // @ts-expect-error\n  return items.reduce<Merge<T>>(\n    // @ts-expect-error\n    (acc, obj) => {\n      return deepMerge(acc, obj, strategy);\n    },\n    {} as Merge<T>,\n  );\n}\n\n/**\n * Deeply merges two objects based on the provided strategy.\n *\n * - Uses **direct property access** for performance.\n * - **Avoids redundant deep merging** where unnecessary.\n * - Optimized **array merging strategies**.\n *\n * @param target - The target object.\n * @param source - The source object.\n * @param strategy - The merge strategy.\n * @returns A new merged object.\n */\nfunction deepMerge<T extends Obj, U extends Obj>(target: T, source: U, strategy: MergeStrategy): DeepMerge<T, U> {\n  if (!isObject(source)) return source as DeepMerge<T, U>;\n\n  const result = { ...target } as DeepMerge<T, U>;\n\n  for (const key in source) {\n    if (!Object.hasOwn(source, key)) continue; // Prevent prototype pollution\n\n    const sourceValue = source[key];\n    const targetValue = result[key];\n\n    // biome-ignore lint/suspicious/noExplicitAny: -\n    (result as any)[key] =\n      isArray(sourceValue) && isArray(targetValue)\n        ? handleArrayMerge(targetValue, sourceValue, strategy)\n        : isObject(sourceValue) && isObject(targetValue)\n          ? deepMerge(targetValue, sourceValue, strategy)\n          : applyMergeStrategy(targetValue, sourceValue, strategy);\n  }\n\n  return result;\n}\n\n/**\n * Optimized array merge based on strategy.\n *\n * - `\"arrayConcat\"` → Concatenates arrays.\n * - `\"arrayReplace\"` → Replaces the existing array.\n * - Default: **Unique merge** (Set-based optimization).\n */\nfunction handleArrayMerge<T, U>(targetArray: T[] | undefined, sourceArray: U[], strategy: MergeStrategy): (T | U)[] {\n  if (!targetArray) return sourceArray;\n  // biome-ignore lint/suspicious/noExplicitAny: -\n  if (strategy === 'arrayConcat') return targetArray.concat(sourceArray as any);\n  if (strategy === 'arrayReplace') return sourceArray;\n  return Array.from(new Set([...targetArray, ...sourceArray])); // Unique merge\n}\n\n/**\n * Determines the appropriate value to assign based on the merge strategy.\n *\n * - `\"lastWins\"` → Overwrites with the latest value.\n * - Custom functions → Allows user-defined behavior.\n */\nfunction applyMergeStrategy<T, U>(target: T, source: U, strategy: MergeStrategy): T | U {\n  if (typeof strategy === 'function') return strategy(target, source);\n  return strategy === 'lastWins' || source !== undefined ? source : target;\n}\n"],"names":["merge","strategy","items","acc","obj","deepMerge","target","source","isObject","result","key","sourceValue","targetValue","isArray","handleArrayMerge","applyMergeStrategy","targetArray","sourceArray"],"mappings":"2JAoDO,SAASA,EAAuBC,EAA0B,UAAWC,EAAyB,CACnG,OAAIA,EAAM,SAAW,EAAU,CAAA,EAE3BD,IAAa,UACR,OAAO,OAAO,CAAA,EAAI,GAAGC,CAAK,EAI5BA,EAAM,OAEX,CAACC,EAAKC,IACGC,EAAUF,EAAKC,EAAKH,CAAQ,EAErC,CAAA,CAAC,CAEL,CAcA,SAASI,EAAwCC,EAAWC,EAAWN,EAA0C,CAC/G,GAAI,CAACO,EAAAA,SAASD,CAAM,EAAG,OAAOA,EAE9B,MAAME,EAAS,CAAE,GAAGH,CAAA,EAEpB,UAAWI,KAAOH,EAAQ,CACxB,GAAI,CAAC,OAAO,OAAOA,EAAQG,CAAG,EAAG,SAEjC,MAAMC,EAAcJ,EAAOG,CAAG,EACxBE,EAAcH,EAAOC,CAAG,EAG7BD,EAAeC,CAAG,EACjBG,EAAAA,QAAQF,CAAW,GAAKE,EAAAA,QAAQD,CAAW,EACvCE,EAAiBF,EAAaD,EAAaV,CAAQ,EACnDO,EAAAA,SAASG,CAAW,GAAKH,EAAAA,SAASI,CAAW,EAC3CP,EAAUO,EAAaD,EAAaV,CAAQ,EAC5Cc,EAAmBH,EAAaD,EAAaV,CAAQ,CAC/D,CAEA,OAAOQ,CACT,CASA,SAASK,EAAuBE,EAA8BC,EAAkBhB,EAAoC,CAClH,OAAKe,EAEDf,IAAa,cAAsBe,EAAY,OAAOC,CAAkB,EACxEhB,IAAa,eAAuBgB,EACjC,MAAM,KAAK,IAAI,IAAI,CAAC,GAAGD,EAAa,GAAGC,CAAW,CAAC,CAAC,EAJlCA,CAK3B,CAQA,SAASF,EAAyBT,EAAWC,EAAWN,EAAgC,CACtF,OAAI,OAAOA,GAAa,WAAmBA,EAASK,EAAQC,CAAM,EAC3DN,IAAa,YAAcM,IAAW,OAAYA,EAASD,CACpE"}

package/dist/object/merge.js

@@ -0,0 +1,29 @@
+import { isArray as c } from "../typed/isArray.js";
+import { isObject as u } from "../typed/isObject.js";
+function m(r = "deep", ...n) {
+  return n.length === 0 ? {} : r === "shallow" ? Object.assign({}, ...n) : n.reduce(
+    // @ts-expect-error
+    (e, i) => l(e, i, r),
+    {}
+  );
+}
+function l(r, n, e) {
+  if (!u(n)) return n;
+  const i = { ...r };
+  for (const o in n) {
+    if (!Object.hasOwn(n, o)) continue;
+    const t = n[o], f = i[o];
+    i[o] = c(t) && c(f) ? p(f, t, e) : u(t) && u(f) ? l(f, t, e) : a(f, t, e);
+  }
+  return i;
+}
+function p(r, n, e) {
+  return r ? e === "arrayConcat" ? r.concat(n) : e === "arrayReplace" ? n : Array.from(/* @__PURE__ */ new Set([...r, ...n])) : n;
+}
+function a(r, n, e) {
+  return typeof e == "function" ? e(r, n) : e === "lastWins" || n !== void 0 ? n : r;
+}
+export {
+  m as merge
+};
+//# sourceMappingURL=merge.js.map

package/dist/object/merge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge.js","sources":["../../src/object/merge.ts"],"sourcesContent":["import { isArray } from '../typed/isArray';\nimport { isObject } from '../typed/isObject';\nimport type { Obj } from '../types';\n\ntype MergeStrategy =\n  | 'deep'\n  | 'shallow'\n  | 'lastWins'\n  | 'arrayConcat'\n  | 'arrayReplace'\n  // biome-ignore lint/suspicious/noExplicitAny: -\n  | ((target: any, source: any) => any);\n\ntype DeepMerge<T, U> = T extends Obj\n  ? U extends Obj\n    ? {\n        [K in keyof T | keyof U]: K extends keyof T\n          ? K extends keyof U\n            ? DeepMerge<T[K], U[K]>\n            : T[K]\n          : K extends keyof U\n            ? U[K]\n            : never;\n      }\n    : U\n  : U;\n\ntype Merge<T extends Obj[]> = T extends [infer First, ...infer Rest]\n  ? First extends Obj\n    ? Rest extends Obj[]\n      ? DeepMerge<First, Merge<Rest>>\n      : First\n    : Obj\n  : Obj;\n\n/**\n * Merges multiple objects based on a specified merge strategy.\n *\n * @example\n * ```ts\n * const obj1 = { a: 1, b: { x: 10, y: \"hello\" }, c: [1] };\n * const obj2 = { b: { y: 20, z: true }, c: [2] };\n * const obj3 = { d: false, c: [3] };\n *\n * merge(\"deep\", obj1, obj2, obj3); // { a: 1, b: { x: 10, y: 20, z: true }, c: [1, 2, 3], d: false }\n * merge(\"shallow\", obj1, obj2, obj3); // { a: 1, b: { y: 20, z: true }, c: [3], d: false }\n * ```\n *\n * @param [strategy='deep'] - The merging strategy to use.\n * @param items - The objects to merge.\n * @returns A new merged object.\n */\nexport function merge<T extends Obj[]>(strategy: MergeStrategy = 'deep', ...items: [...T]): Merge<T> {\n  if (items.length === 0) return {} as Merge<T>;\n\n  if (strategy === 'shallow') {\n    return Object.assign({}, ...items) as Merge<T>;\n  }\n\n  // @ts-expect-error\n  return items.reduce<Merge<T>>(\n    // @ts-expect-error\n    (acc, obj) => {\n      return deepMerge(acc, obj, strategy);\n    },\n    {} as Merge<T>,\n  );\n}\n\n/**\n * Deeply merges two objects based on the provided strategy.\n *\n * - Uses **direct property access** for performance.\n * - **Avoids redundant deep merging** where unnecessary.\n * - Optimized **array merging strategies**.\n *\n * @param target - The target object.\n * @param source - The source object.\n * @param strategy - The merge strategy.\n * @returns A new merged object.\n */\nfunction deepMerge<T extends Obj, U extends Obj>(target: T, source: U, strategy: MergeStrategy): DeepMerge<T, U> {\n  if (!isObject(source)) return source as DeepMerge<T, U>;\n\n  const result = { ...target } as DeepMerge<T, U>;\n\n  for (const key in source) {\n    if (!Object.hasOwn(source, key)) continue; // Prevent prototype pollution\n\n    const sourceValue = source[key];\n    const targetValue = result[key];\n\n    // biome-ignore lint/suspicious/noExplicitAny: -\n    (result as any)[key] =\n      isArray(sourceValue) && isArray(targetValue)\n        ? handleArrayMerge(targetValue, sourceValue, strategy)\n        : isObject(sourceValue) && isObject(targetValue)\n          ? deepMerge(targetValue, sourceValue, strategy)\n          : applyMergeStrategy(targetValue, sourceValue, strategy);\n  }\n\n  return result;\n}\n\n/**\n * Optimized array merge based on strategy.\n *\n * - `\"arrayConcat\"` → Concatenates arrays.\n * - `\"arrayReplace\"` → Replaces the existing array.\n * - Default: **Unique merge** (Set-based optimization).\n */\nfunction handleArrayMerge<T, U>(targetArray: T[] | undefined, sourceArray: U[], strategy: MergeStrategy): (T | U)[] {\n  if (!targetArray) return sourceArray;\n  // biome-ignore lint/suspicious/noExplicitAny: -\n  if (strategy === 'arrayConcat') return targetArray.concat(sourceArray as any);\n  if (strategy === 'arrayReplace') return sourceArray;\n  return Array.from(new Set([...targetArray, ...sourceArray])); // Unique merge\n}\n\n/**\n * Determines the appropriate value to assign based on the merge strategy.\n *\n * - `\"lastWins\"` → Overwrites with the latest value.\n * - Custom functions → Allows user-defined behavior.\n */\nfunction applyMergeStrategy<T, U>(target: T, source: U, strategy: MergeStrategy): T | U {\n  if (typeof strategy === 'function') return strategy(target, source);\n  return strategy === 'lastWins' || source !== undefined ? source : target;\n}\n"],"names":["merge","strategy","items","acc","obj","deepMerge","target","source","isObject","result","key","sourceValue","targetValue","isArray","handleArrayMerge","applyMergeStrategy","targetArray","sourceArray"],"mappings":";;AAoDO,SAASA,EAAuBC,IAA0B,WAAWC,GAAyB;AACnG,SAAIA,EAAM,WAAW,IAAU,CAAA,IAE3BD,MAAa,YACR,OAAO,OAAO,CAAA,GAAI,GAAGC,CAAK,IAI5BA,EAAM;AAAA;AAAA,IAEX,CAACC,GAAKC,MACGC,EAAUF,GAAKC,GAAKH,CAAQ;AAAA,IAErC,CAAA;AAAA,EAAC;AAEL;AAcA,SAASI,EAAwCC,GAAWC,GAAWN,GAA0C;AAC/G,MAAI,CAACO,EAASD,CAAM,EAAG,QAAOA;AAE9B,QAAME,IAAS,EAAE,GAAGH,EAAA;AAEpB,aAAWI,KAAOH,GAAQ;AACxB,QAAI,CAAC,OAAO,OAAOA,GAAQG,CAAG,EAAG;AAEjC,UAAMC,IAAcJ,EAAOG,CAAG,GACxBE,IAAcH,EAAOC,CAAG;AAG7B,IAAAD,EAAeC,CAAG,IACjBG,EAAQF,CAAW,KAAKE,EAAQD,CAAW,IACvCE,EAAiBF,GAAaD,GAAaV,CAAQ,IACnDO,EAASG,CAAW,KAAKH,EAASI,CAAW,IAC3CP,EAAUO,GAAaD,GAAaV,CAAQ,IAC5Cc,EAAmBH,GAAaD,GAAaV,CAAQ;AAAA,EAC/D;AAEA,SAAOQ;AACT;AASA,SAASK,EAAuBE,GAA8BC,GAAkBhB,GAAoC;AAClH,SAAKe,IAEDf,MAAa,gBAAsBe,EAAY,OAAOC,CAAkB,IACxEhB,MAAa,iBAAuBgB,IACjC,MAAM,KAAK,oBAAI,IAAI,CAAC,GAAGD,GAAa,GAAGC,CAAW,CAAC,CAAC,IAJlCA;AAK3B;AAQA,SAASF,EAAyBT,GAAWC,GAAWN,GAAgC;AACtF,SAAI,OAAOA,KAAa,aAAmBA,EAASK,GAAQC,CAAM,IAC3DN,MAAa,cAAcM,MAAW,SAAYA,IAASD;AACpE;"}

package/dist/object/parseJSON.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("../logit/dist/logit.cjs"),n=require("../typed/isNil.cjs"),u=require("../typed/isString.cjs");function l(e,s={}){const{defaultValue:t,reviver:a,validator:i,silent:o=!1}=s;if(!u.isString(e))return n.isNil(e)?t:e;try{const r=JSON.parse(e,a);if(i&&!i(r))throw new TypeError("Parsed JSON does not match the expected structure");return r??t}catch(r){return o||c.Logit.error("parseJSON() -> failed to parse object",r),t}}exports.parseJSON=l;
+//# sourceMappingURL=parseJSON.cjs.map

package/dist/object/parseJSON.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"parseJSON.cjs","sources":["../../src/object/parseJSON.ts"],"sourcesContent":["import { Logit } from '@vielzeug/logit';\nimport { isNil } from '../typed/isNil';\nimport { isString } from '../typed/isString';\n\ntype JSONValue = string | number | boolean | null | JSONValue[] | { [key: string]: JSONValue };\n\ninterface ParseJSONOptions<T> {\n  defaultValue?: T;\n  // biome-ignore lint/suspicious/noExplicitAny: -\n  reviver?: (key: string, value: any) => any;\n  // biome-ignore lint/suspicious/noExplicitAny: -\n  validator?: (value: any) => boolean;\n  silent?: boolean;\n}\n\n/**\n * Parses a JSON string and returns the resulting object.\n *\n * @example\n * ```ts\n * const json = '{\"a\":1,\"b\":2,\"c\":3}';\n * const result = parseJSON<Record<string, number>>(json, {\n *   defaultValue: { a: 0, b: 0, c: 0 },\n *   validator: (value) => Object.values(value).every(v => typeof v === 'number'),\n *   errorHandler: (err) => console.warn('Parsing failed:', err.message),\n *   silent: true\n * });\n * console.log(result); // { a: 1, b: 2, c: 3 }\n * ```\n *\n * @template T - The expected type of the parsed JSON.\n * @param json - The JSON string to parse. If not a string, it is returned as is.\n * @param options - Configuration options for parsing.\n *\n * @returns The parsed object if successful, otherwise the default value.\n */\nexport function parseJSON<T extends JSONValue>(json: unknown, options: ParseJSONOptions<T> = {}): T | undefined {\n  const { defaultValue, reviver, validator, silent = false } = options;\n\n  if (!isString(json)) return isNil(json) ? defaultValue : (json as T);\n\n  try {\n    const parsed = JSON.parse(json as string, reviver);\n\n    if (validator && !validator(parsed)) {\n      throw new TypeError('Parsed JSON does not match the expected structure');\n    }\n\n    return parsed ?? defaultValue;\n  } catch (err) {\n    if (!silent) {\n      Logit.error('parseJSON() -> failed to parse object', err);\n    }\n\n    return defaultValue;\n  }\n}\n"],"names":["parseJSON","json","options","defaultValue","reviver","validator","silent","isString","isNil","parsed","err","Logit"],"mappings":"8LAoCO,SAASA,EAA+BC,EAAeC,EAA+B,GAAmB,CAC9G,KAAM,CAAE,aAAAC,EAAc,QAAAC,EAAS,UAAAC,EAAW,OAAAC,EAAS,IAAUJ,EAE7D,GAAI,CAACK,EAAAA,SAASN,CAAI,SAAUO,EAAAA,MAAMP,CAAI,EAAIE,EAAgBF,EAE1D,GAAI,CACF,MAAMQ,EAAS,KAAK,MAAMR,EAAgBG,CAAO,EAEjD,GAAIC,GAAa,CAACA,EAAUI,CAAM,EAChC,MAAM,IAAI,UAAU,mDAAmD,EAGzE,OAAOA,GAAUN,CACnB,OAASO,EAAK,CACZ,OAAKJ,GACHK,QAAM,MAAM,wCAAyCD,CAAG,EAGnDP,CACT,CACF"}

package/dist/object/parseJSON.js

@@ -0,0 +1,19 @@
+import { Logit as p } from "../logit/dist/logit.js";
+import { isNil as f } from "../typed/isNil.js";
+import { isString as c } from "../typed/isString.js";
+function l(r, o = {}) {
+  const { defaultValue: t, reviver: a, validator: i, silent: s = !1 } = o;
+  if (!c(r)) return f(r) ? t : r;
+  try {
+    const e = JSON.parse(r, a);
+    if (i && !i(e))
+      throw new TypeError("Parsed JSON does not match the expected structure");
+    return e ?? t;
+  } catch (e) {
+    return s || p.error("parseJSON() -> failed to parse object", e), t;
+  }
+}
+export {
+  l as parseJSON
+};
+//# sourceMappingURL=parseJSON.js.map

package/dist/object/parseJSON.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parseJSON.js","sources":["../../src/object/parseJSON.ts"],"sourcesContent":["import { Logit } from '@vielzeug/logit';\nimport { isNil } from '../typed/isNil';\nimport { isString } from '../typed/isString';\n\ntype JSONValue = string | number | boolean | null | JSONValue[] | { [key: string]: JSONValue };\n\ninterface ParseJSONOptions<T> {\n  defaultValue?: T;\n  // biome-ignore lint/suspicious/noExplicitAny: -\n  reviver?: (key: string, value: any) => any;\n  // biome-ignore lint/suspicious/noExplicitAny: -\n  validator?: (value: any) => boolean;\n  silent?: boolean;\n}\n\n/**\n * Parses a JSON string and returns the resulting object.\n *\n * @example\n * ```ts\n * const json = '{\"a\":1,\"b\":2,\"c\":3}';\n * const result = parseJSON<Record<string, number>>(json, {\n *   defaultValue: { a: 0, b: 0, c: 0 },\n *   validator: (value) => Object.values(value).every(v => typeof v === 'number'),\n *   errorHandler: (err) => console.warn('Parsing failed:', err.message),\n *   silent: true\n * });\n * console.log(result); // { a: 1, b: 2, c: 3 }\n * ```\n *\n * @template T - The expected type of the parsed JSON.\n * @param json - The JSON string to parse. If not a string, it is returned as is.\n * @param options - Configuration options for parsing.\n *\n * @returns The parsed object if successful, otherwise the default value.\n */\nexport function parseJSON<T extends JSONValue>(json: unknown, options: ParseJSONOptions<T> = {}): T | undefined {\n  const { defaultValue, reviver, validator, silent = false } = options;\n\n  if (!isString(json)) return isNil(json) ? defaultValue : (json as T);\n\n  try {\n    const parsed = JSON.parse(json as string, reviver);\n\n    if (validator && !validator(parsed)) {\n      throw new TypeError('Parsed JSON does not match the expected structure');\n    }\n\n    return parsed ?? defaultValue;\n  } catch (err) {\n    if (!silent) {\n      Logit.error('parseJSON() -> failed to parse object', err);\n    }\n\n    return defaultValue;\n  }\n}\n"],"names":["parseJSON","json","options","defaultValue","reviver","validator","silent","isString","isNil","parsed","err","Logit"],"mappings":";;;AAoCO,SAASA,EAA+BC,GAAeC,IAA+B,IAAmB;AAC9G,QAAM,EAAE,cAAAC,GAAc,SAAAC,GAAS,WAAAC,GAAW,QAAAC,IAAS,OAAUJ;AAE7D,MAAI,CAACK,EAASN,CAAI,UAAUO,EAAMP,CAAI,IAAIE,IAAgBF;AAE1D,MAAI;AACF,UAAMQ,IAAS,KAAK,MAAMR,GAAgBG,CAAO;AAEjD,QAAIC,KAAa,CAACA,EAAUI,CAAM;AAChC,YAAM,IAAI,UAAU,mDAAmD;AAGzE,WAAOA,KAAUN;AAAA,EACnB,SAASO,GAAK;AACZ,WAAKJ,KACHK,EAAM,MAAM,yCAAyCD,CAAG,GAGnDP;AAAA,EACT;AACF;"}

package/dist/object/path.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("../function/assert.cjs"),p=require("../typed/isArray.cjs"),y=require("../typed/isNil.cjs"),i=require("../typed/isObject.cjs");function d(e,n,o,c={}){l.assert(i.isObject(e),i.IS_OBJECT_ERROR_MSG,{args:{item:e},type:TypeError});const{throwOnMissing:s=!1,allowArrayIndex:f=!1}=c,u=n.split(/[.[\]]+/).filter(Boolean);let r=e;for(const t of u){if(y.isNil(r)||typeof r!="object")return a(`Cannot read property '${t}' of ${r}`,s,o);if(r=f&&p.isArray(r)&&/^\d+$/.test(t)?r[Number(t)]:r[t],r===void 0)return a(`Property '${t}' does not exist`,s,o)}return r}function a(e,n,o){if(n)throw new Error(e);return o}exports.path=d;
+//# sourceMappingURL=path.cjs.map

package/dist/object/path.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"path.cjs","sources":["../../src/object/path.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { isArray } from '../typed/isArray';\nimport { isNil } from '../typed/isNil';\nimport { IS_OBJECT_ERROR_MSG, isObject } from '../typed/isObject';\nimport type { Obj } from '../types';\n\ntype PathValue<T, P extends string> = P extends `${infer Key}.${infer Rest}`\n  ? Key extends keyof T\n    ? PathValue<T[Key], Rest>\n    : undefined\n  : P extends keyof T\n    ? T[P]\n    : undefined;\n\ntype PathOptions = {\n  throwOnMissing?: boolean;\n  allowArrayIndex?: boolean;\n};\n\n/**\n * Retrieves the value at a given path of the object. If the value is undefined, the default value is returned.\n *\n * @example\n * ```ts\n * const obj = { a: { b: { c: 3 } }, d: [1, 2, 3] };\n *\n * getValue(obj, 'a.b.c'); // 3\n * getValue(obj, 'a.b.d', 'default'); // 'default'\n * getValue(obj, 'd[1]', undefined, { allowArrayIndex: true }); // 2\n * getValue(obj, 'e.f.g', 'default', { throwOnMissing: true }); // throws Error\n * ```\n *\n * @template T - The type of the object to query.\n * @template P - The type of the path string.\n * @param item - The object to query.\n * @param path - The path of the property to get.\n * @param [defaultValue] - The value returned for undefined resolved values.\n * @param [options] - Additional options for value retrieval.\n *\n * @returns The resolved value.\n *\n * @throws If throwOnMissing is true and the path doesn't exist.\n */\nexport function path<T extends Obj, P extends string>(\n  item: T,\n  path: P,\n  defaultValue?: unknown,\n  options: PathOptions = {},\n): PathValue<T, P> | undefined {\n  assert(isObject(item), IS_OBJECT_ERROR_MSG, { args: { item }, type: TypeError });\n\n  const { throwOnMissing = false, allowArrayIndex = false } = options;\n\n  const fragments = path.split(/[.[\\]]+/).filter(Boolean);\n  // biome-ignore lint/suspicious/noExplicitAny: -\n  let current: any = item;\n\n  for (const fragment of fragments) {\n    if (isNil(current) || typeof current !== 'object') {\n      return handleError(`Cannot read property '${fragment}' of ${current}`, throwOnMissing, defaultValue);\n    }\n\n    current =\n      allowArrayIndex && isArray(current) && /^\\d+$/.test(fragment) ? current[Number(fragment)] : current[fragment];\n\n    if (current === undefined) {\n      return handleError(`Property '${fragment}' does not exist`, throwOnMissing, defaultValue);\n    }\n  }\n\n  return current as PathValue<T, P>;\n}\n\nfunction handleError<T extends Obj, P extends string>(\n  message: string,\n  throwOnMissing: boolean,\n  defaultValue?: unknown,\n): PathValue<T, P> | undefined {\n  if (throwOnMissing) throw new Error(message);\n  return defaultValue as PathValue<T, P>;\n}\n"],"names":["path","item","defaultValue","options","assert","isObject","IS_OBJECT_ERROR_MSG","throwOnMissing","allowArrayIndex","fragments","current","fragment","isNil","handleError","isArray","message"],"mappings":"+NA2CO,SAASA,EACdC,EACAD,EACAE,EACAC,EAAuB,CAAA,EACM,CAC7BC,EAAAA,OAAOC,EAAAA,SAASJ,CAAI,EAAGK,sBAAqB,CAAE,KAAM,CAAE,KAAAL,CAAA,EAAQ,KAAM,UAAW,EAE/E,KAAM,CAAE,eAAAM,EAAiB,GAAO,gBAAAC,EAAkB,IAAUL,EAEtDM,EAAYT,EAAK,MAAM,SAAS,EAAE,OAAO,OAAO,EAEtD,IAAIU,EAAeT,EAEnB,UAAWU,KAAYF,EAAW,CAChC,GAAIG,EAAAA,MAAMF,CAAO,GAAK,OAAOA,GAAY,SACvC,OAAOG,EAAY,yBAAyBF,CAAQ,QAAQD,CAAO,GAAIH,EAAgBL,CAAY,EAMrG,GAHAQ,EACEF,GAAmBM,EAAAA,QAAQJ,CAAO,GAAK,QAAQ,KAAKC,CAAQ,EAAID,EAAQ,OAAOC,CAAQ,CAAC,EAAID,EAAQC,CAAQ,EAE1GD,IAAY,OACd,OAAOG,EAAY,aAAaF,CAAQ,mBAAoBJ,EAAgBL,CAAY,CAE5F,CAEA,OAAOQ,CACT,CAEA,SAASG,EACPE,EACAR,EACAL,EAC6B,CAC7B,GAAIK,EAAgB,MAAM,IAAI,MAAMQ,CAAO,EAC3C,OAAOb,CACT"}

package/dist/object/path.js

@@ -0,0 +1,24 @@
+import { assert as m } from "../function/assert.js";
+import { isArray as c } from "../typed/isArray.js";
+import { isNil as l } from "../typed/isNil.js";
+import { IS_OBJECT_ERROR_MSG as y, isObject as u } from "../typed/isObject.js";
+function w(o, n, e, i = {}) {
+  m(u(o), y, { args: { item: o }, type: TypeError });
+  const { throwOnMissing: s = !1, allowArrayIndex: p = !1 } = i, a = n.split(/[.[\]]+/).filter(Boolean);
+  let r = o;
+  for (const t of a) {
+    if (l(r) || typeof r != "object")
+      return f(`Cannot read property '${t}' of ${r}`, s, e);
+    if (r = p && c(r) && /^\d+$/.test(t) ? r[Number(t)] : r[t], r === void 0)
+      return f(`Property '${t}' does not exist`, s, e);
+  }
+  return r;
+}
+function f(o, n, e) {
+  if (n) throw new Error(o);
+  return e;
+}
+export {
+  w as path
+};
+//# sourceMappingURL=path.js.map

package/dist/object/path.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"path.js","sources":["../../src/object/path.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { isArray } from '../typed/isArray';\nimport { isNil } from '../typed/isNil';\nimport { IS_OBJECT_ERROR_MSG, isObject } from '../typed/isObject';\nimport type { Obj } from '../types';\n\ntype PathValue<T, P extends string> = P extends `${infer Key}.${infer Rest}`\n  ? Key extends keyof T\n    ? PathValue<T[Key], Rest>\n    : undefined\n  : P extends keyof T\n    ? T[P]\n    : undefined;\n\ntype PathOptions = {\n  throwOnMissing?: boolean;\n  allowArrayIndex?: boolean;\n};\n\n/**\n * Retrieves the value at a given path of the object. If the value is undefined, the default value is returned.\n *\n * @example\n * ```ts\n * const obj = { a: { b: { c: 3 } }, d: [1, 2, 3] };\n *\n * getValue(obj, 'a.b.c'); // 3\n * getValue(obj, 'a.b.d', 'default'); // 'default'\n * getValue(obj, 'd[1]', undefined, { allowArrayIndex: true }); // 2\n * getValue(obj, 'e.f.g', 'default', { throwOnMissing: true }); // throws Error\n * ```\n *\n * @template T - The type of the object to query.\n * @template P - The type of the path string.\n * @param item - The object to query.\n * @param path - The path of the property to get.\n * @param [defaultValue] - The value returned for undefined resolved values.\n * @param [options] - Additional options for value retrieval.\n *\n * @returns The resolved value.\n *\n * @throws If throwOnMissing is true and the path doesn't exist.\n */\nexport function path<T extends Obj, P extends string>(\n  item: T,\n  path: P,\n  defaultValue?: unknown,\n  options: PathOptions = {},\n): PathValue<T, P> | undefined {\n  assert(isObject(item), IS_OBJECT_ERROR_MSG, { args: { item }, type: TypeError });\n\n  const { throwOnMissing = false, allowArrayIndex = false } = options;\n\n  const fragments = path.split(/[.[\\]]+/).filter(Boolean);\n  // biome-ignore lint/suspicious/noExplicitAny: -\n  let current: any = item;\n\n  for (const fragment of fragments) {\n    if (isNil(current) || typeof current !== 'object') {\n      return handleError(`Cannot read property '${fragment}' of ${current}`, throwOnMissing, defaultValue);\n    }\n\n    current =\n      allowArrayIndex && isArray(current) && /^\\d+$/.test(fragment) ? current[Number(fragment)] : current[fragment];\n\n    if (current === undefined) {\n      return handleError(`Property '${fragment}' does not exist`, throwOnMissing, defaultValue);\n    }\n  }\n\n  return current as PathValue<T, P>;\n}\n\nfunction handleError<T extends Obj, P extends string>(\n  message: string,\n  throwOnMissing: boolean,\n  defaultValue?: unknown,\n): PathValue<T, P> | undefined {\n  if (throwOnMissing) throw new Error(message);\n  return defaultValue as PathValue<T, P>;\n}\n"],"names":["path","item","defaultValue","options","assert","isObject","IS_OBJECT_ERROR_MSG","throwOnMissing","allowArrayIndex","fragments","current","fragment","isNil","handleError","isArray","message"],"mappings":";;;;AA2CO,SAASA,EACdC,GACAD,GACAE,GACAC,IAAuB,CAAA,GACM;AAC7B,EAAAC,EAAOC,EAASJ,CAAI,GAAGK,GAAqB,EAAE,MAAM,EAAE,MAAAL,EAAA,GAAQ,MAAM,WAAW;AAE/E,QAAM,EAAE,gBAAAM,IAAiB,IAAO,iBAAAC,IAAkB,OAAUL,GAEtDM,IAAYT,EAAK,MAAM,SAAS,EAAE,OAAO,OAAO;AAEtD,MAAIU,IAAeT;AAEnB,aAAWU,KAAYF,GAAW;AAChC,QAAIG,EAAMF,CAAO,KAAK,OAAOA,KAAY;AACvC,aAAOG,EAAY,yBAAyBF,CAAQ,QAAQD,CAAO,IAAIH,GAAgBL,CAAY;AAMrG,QAHAQ,IACEF,KAAmBM,EAAQJ,CAAO,KAAK,QAAQ,KAAKC,CAAQ,IAAID,EAAQ,OAAOC,CAAQ,CAAC,IAAID,EAAQC,CAAQ,GAE1GD,MAAY;AACd,aAAOG,EAAY,aAAaF,CAAQ,oBAAoBJ,GAAgBL,CAAY;AAAA,EAE5F;AAEA,SAAOQ;AACT;AAEA,SAASG,EACPE,GACAR,GACAL,GAC6B;AAC7B,MAAIK,EAAgB,OAAM,IAAI,MAAMQ,CAAO;AAC3C,SAAOb;AACT;"}

package/dist/object/seek.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("../function/assert.cjs"),c=require("../string/similarity.cjs"),s=require("../typed/is.cjs"),o=require("../typed/isWithin.cjs");function a(e,t,i=1){return f.assert(o.isWithin(i,0,1),o.IS_WITHIN_ERROR_MSG,{args:{max:1,min:0,tone:i},type:TypeError}),s.is("string",e)||s.is("number",e)?c.similarity(e,t)>=i:Object.values(e).some(r=>s.is("nil",r)?!1:s.is("array",r)?r.some(n=>s.is("object",n)?a(n,t,i):c.similarity(n,t)>=i):s.is("object",r)?a(r,t,i):c.similarity(r,t)>=i)}exports.seek=a;
+//# sourceMappingURL=seek.cjs.map

package/dist/object/seek.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"seek.cjs","sources":["../../src/object/seek.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { similarity } from '../string/similarity';\nimport { is } from '../typed/is';\nimport { IS_WITHIN_ERROR_MSG, isWithin } from '../typed/isWithin';\n\n/**\n * Recursively checks if an object contains a value similar to the search string.\n *\n * @example\n * ```ts\n * const obj = { a: 'hello', b: { c: 'world' }, d: [1, 2, 3] };\n *\n * seek(obj, 'hello'); // true\n * seek(obj, 'world'); // true\n * seek(obj, 'foo'); // false\n * seek(obj, 'hello', 0.5); // true\n * seek(obj, 'hello', 0.8); // true\n * seek(obj, 'hello', 1); // true\n * seek(obj, 'hello', 1.5); // false\n * seek(obj, 'hello', -1); // false\n * seek(obj, 'hello', 0); // false\n * ```\n *\n * @param item - The object to search within.\n * @param query - The search string.\n * @param [tone=1] - The similarity threshold.\n *\n * @returns Whether the object contains a matching value.\n */\nexport function seek<T>(item: T, query: string, tone = 1): boolean {\n  assert(isWithin(tone, 0, 1), IS_WITHIN_ERROR_MSG, { args: { max: 1, min: 0, tone }, type: TypeError });\n\n  if (is('string', item) || is('number', item)) {\n    // Lowercase both sides for case-insensitive comparison\n    return similarity(item, query) >= tone;\n  }\n\n  return Object.values(item as Record<string, unknown>).some((value) => {\n    if (is('nil', value)) return false;\n\n    if (is('array', value)) {\n      return value.some((v) => (is('object', v) ? seek(v, query, tone) : similarity(v, query) >= tone));\n    }\n\n    if (is('object', value)) {\n      return seek(value, query, tone);\n    }\n\n    return similarity(value, query) >= tone;\n  });\n}\n"],"names":["seek","item","query","tone","assert","isWithin","IS_WITHIN_ERROR_MSG","is","similarity","value","v"],"mappings":"gOA6BO,SAASA,EAAQC,EAASC,EAAeC,EAAO,EAAY,CAGjE,OAFAC,EAAAA,OAAOC,EAAAA,SAASF,EAAM,EAAG,CAAC,EAAGG,EAAAA,oBAAqB,CAAE,KAAM,CAAE,IAAK,EAAG,IAAK,EAAG,KAAAH,GAAQ,KAAM,UAAW,EAEjGI,EAAAA,GAAG,SAAUN,CAAI,GAAKM,EAAAA,GAAG,SAAUN,CAAI,EAElCO,aAAWP,EAAMC,CAAK,GAAKC,EAG7B,OAAO,OAAOF,CAA+B,EAAE,KAAMQ,GACtDF,KAAG,MAAOE,CAAK,EAAU,GAEzBF,EAAAA,GAAG,QAASE,CAAK,EACZA,EAAM,KAAMC,GAAOH,EAAAA,GAAG,SAAUG,CAAC,EAAIV,EAAKU,EAAGR,EAAOC,CAAI,EAAIK,EAAAA,WAAWE,EAAGR,CAAK,GAAKC,CAAK,EAG9FI,EAAAA,GAAG,SAAUE,CAAK,EACbT,EAAKS,EAAOP,EAAOC,CAAI,EAGzBK,aAAWC,EAAOP,CAAK,GAAKC,CACpC,CACH"}

package/dist/object/seek.js

@@ -0,0 +1,11 @@
+import { assert as p } from "../function/assert.js";
+import { similarity as o } from "../string/similarity.js";
+import { is as s } from "../typed/is.js";
+import { IS_WITHIN_ERROR_MSG as b, isWithin as c } from "../typed/isWithin.js";
+function n(t, m, r = 1) {
+  return p(c(r, 0, 1), b, { args: { max: 1, min: 0, tone: r }, type: TypeError }), s("string", t) || s("number", t) ? o(t, m) >= r : Object.values(t).some((i) => s("nil", i) ? !1 : s("array", i) ? i.some((f) => s("object", f) ? n(f, m, r) : o(f, m) >= r) : s("object", i) ? n(i, m, r) : o(i, m) >= r);
+}
+export {
+  n as seek
+};
+//# sourceMappingURL=seek.js.map

package/dist/object/seek.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"seek.js","sources":["../../src/object/seek.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { similarity } from '../string/similarity';\nimport { is } from '../typed/is';\nimport { IS_WITHIN_ERROR_MSG, isWithin } from '../typed/isWithin';\n\n/**\n * Recursively checks if an object contains a value similar to the search string.\n *\n * @example\n * ```ts\n * const obj = { a: 'hello', b: { c: 'world' }, d: [1, 2, 3] };\n *\n * seek(obj, 'hello'); // true\n * seek(obj, 'world'); // true\n * seek(obj, 'foo'); // false\n * seek(obj, 'hello', 0.5); // true\n * seek(obj, 'hello', 0.8); // true\n * seek(obj, 'hello', 1); // true\n * seek(obj, 'hello', 1.5); // false\n * seek(obj, 'hello', -1); // false\n * seek(obj, 'hello', 0); // false\n * ```\n *\n * @param item - The object to search within.\n * @param query - The search string.\n * @param [tone=1] - The similarity threshold.\n *\n * @returns Whether the object contains a matching value.\n */\nexport function seek<T>(item: T, query: string, tone = 1): boolean {\n  assert(isWithin(tone, 0, 1), IS_WITHIN_ERROR_MSG, { args: { max: 1, min: 0, tone }, type: TypeError });\n\n  if (is('string', item) || is('number', item)) {\n    // Lowercase both sides for case-insensitive comparison\n    return similarity(item, query) >= tone;\n  }\n\n  return Object.values(item as Record<string, unknown>).some((value) => {\n    if (is('nil', value)) return false;\n\n    if (is('array', value)) {\n      return value.some((v) => (is('object', v) ? seek(v, query, tone) : similarity(v, query) >= tone));\n    }\n\n    if (is('object', value)) {\n      return seek(value, query, tone);\n    }\n\n    return similarity(value, query) >= tone;\n  });\n}\n"],"names":["seek","item","query","tone","assert","isWithin","IS_WITHIN_ERROR_MSG","is","similarity","value","v"],"mappings":";;;;AA6BO,SAASA,EAAQC,GAASC,GAAeC,IAAO,GAAY;AAGjE,SAFAC,EAAOC,EAASF,GAAM,GAAG,CAAC,GAAGG,GAAqB,EAAE,MAAM,EAAE,KAAK,GAAG,KAAK,GAAG,MAAAH,KAAQ,MAAM,WAAW,GAEjGI,EAAG,UAAUN,CAAI,KAAKM,EAAG,UAAUN,CAAI,IAElCO,EAAWP,GAAMC,CAAK,KAAKC,IAG7B,OAAO,OAAOF,CAA+B,EAAE,KAAK,CAACQ,MACtDF,EAAG,OAAOE,CAAK,IAAU,KAEzBF,EAAG,SAASE,CAAK,IACZA,EAAM,KAAK,CAACC,MAAOH,EAAG,UAAUG,CAAC,IAAIV,EAAKU,GAAGR,GAAOC,CAAI,IAAIK,EAAWE,GAAGR,CAAK,KAAKC,CAAK,IAG9FI,EAAG,UAAUE,CAAK,IACbT,EAAKS,GAAOP,GAAOC,CAAI,IAGzBK,EAAWC,GAAOP,CAAK,KAAKC,CACpC;AACH;"}

package/dist/object/values.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("../function/assert.cjs"),r=require("../typed/isObject.cjs");function t(e){return s.assert(r.isObject(e),r.IS_OBJECT_ERROR_MSG,{args:{item:e},type:TypeError}),Object.values(e)}exports.values=t;
+//# sourceMappingURL=values.cjs.map

package/dist/object/values.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"values.cjs","sources":["../../src/object/values.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_OBJECT_ERROR_MSG, isObject } from '../typed/isObject';\nimport type { Obj } from '../types';\n\n/**\n * Returns an array of values for an object's properties\n *\n * @example\n * ```ts\n * const obj = { a: 1, b: 2, c: 3 };\n * toValues(obj); // [1, 2, 3]\n * ```\n *\n * @param item - The object whose property values are to be returned.\n *\n * @returns an array of the object's own enumerable string-keyed property values.\n */\nexport function values<T extends Obj, K extends keyof T>(item: T) {\n  assert(isObject(item), IS_OBJECT_ERROR_MSG, { args: { item }, type: TypeError });\n\n  return Object.values(item) as T[K][];\n}\n"],"names":["values","item","assert","isObject","IS_OBJECT_ERROR_MSG"],"mappings":"6JAiBO,SAASA,EAAyCC,EAAS,CAChEC,OAAAA,EAAAA,OAAOC,EAAAA,SAASF,CAAI,EAAGG,sBAAqB,CAAE,KAAM,CAAE,KAAAH,CAAA,EAAQ,KAAM,UAAW,EAExE,OAAO,OAAOA,CAAI,CAC3B"}

package/dist/object/values.js

@@ -0,0 +1,9 @@
+import { assert as e } from "../function/assert.js";
+import { IS_OBJECT_ERROR_MSG as o, isObject as t } from "../typed/isObject.js";
+function a(r) {
+  return e(t(r), o, { args: { item: r }, type: TypeError }), Object.values(r);
+}
+export {
+  a as values
+};
+//# sourceMappingURL=values.js.map

package/dist/object/values.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"values.js","sources":["../../src/object/values.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_OBJECT_ERROR_MSG, isObject } from '../typed/isObject';\nimport type { Obj } from '../types';\n\n/**\n * Returns an array of values for an object's properties\n *\n * @example\n * ```ts\n * const obj = { a: 1, b: 2, c: 3 };\n * toValues(obj); // [1, 2, 3]\n * ```\n *\n * @param item - The object whose property values are to be returned.\n *\n * @returns an array of the object's own enumerable string-keyed property values.\n */\nexport function values<T extends Obj, K extends keyof T>(item: T) {\n  assert(isObject(item), IS_OBJECT_ERROR_MSG, { args: { item }, type: TypeError });\n\n  return Object.values(item) as T[K][];\n}\n"],"names":["values","item","assert","isObject","IS_OBJECT_ERROR_MSG"],"mappings":";;AAiBO,SAASA,EAAyCC,GAAS;AAChE,SAAAC,EAAOC,EAASF,CAAI,GAAGG,GAAqB,EAAE,MAAM,EAAE,MAAAH,EAAA,GAAQ,MAAM,WAAW,GAExE,OAAO,OAAOA,CAAI;AAC3B;"}

package/dist/random/draw.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("../function/assert.cjs"),r=require("../typed/isArray.cjs"),s=require("./random.cjs"),n=e=>{if(t.assert(r.isArray(e),r.IS_ARRAY_ERROR_MSG,{args:{array:e},type:TypeError}),e.length!==0)return e[s.random(0,e.length-1)]};exports.draw=n;
+//# sourceMappingURL=draw.cjs.map

package/dist/random/draw.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"draw.cjs","sources":["../../src/random/draw.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { random } from './random';\n\n/**\n * “Draw” a random item from an array.\n *\n * @example\n * ```ts\n * draw([1, 2, 3]) // 3\n * ```\n *\n * @param array - The array to draw from.\n *\n * @returns A random item from the array or `undefined` if the array is empty.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport const draw = <T>(array: T[]): T | undefined => {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  if (array.length === 0) return undefined;\n\n  return array[random(0, array.length - 1)];\n};\n"],"names":["draw","array","assert","isArray","IS_ARRAY_ERROR_MSG","random"],"mappings":"sLAkBaA,EAAWC,GAA8B,CAGpD,GAFAC,EAAAA,OAAOC,EAAAA,QAAQF,CAAK,EAAGG,qBAAoB,CAAE,KAAM,CAAE,MAAAH,CAAA,EAAS,KAAM,UAAW,EAE3EA,EAAM,SAAW,EAErB,OAAOA,EAAMI,EAAAA,OAAO,EAAGJ,EAAM,OAAS,CAAC,CAAC,CAC1C"}

package/dist/random/draw.js

@@ -0,0 +1,11 @@
+import { assert as o } from "../function/assert.js";
+import { IS_ARRAY_ERROR_MSG as t, isArray as e } from "../typed/isArray.js";
+import { random as m } from "./random.js";
+const s = (r) => {
+  if (o(e(r), t, { args: { array: r }, type: TypeError }), r.length !== 0)
+    return r[m(0, r.length - 1)];
+};
+export {
+  s as draw
+};
+//# sourceMappingURL=draw.js.map

package/dist/random/draw.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"draw.js","sources":["../../src/random/draw.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\nimport { random } from './random';\n\n/**\n * “Draw” a random item from an array.\n *\n * @example\n * ```ts\n * draw([1, 2, 3]) // 3\n * ```\n *\n * @param array - The array to draw from.\n *\n * @returns A random item from the array or `undefined` if the array is empty.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport const draw = <T>(array: T[]): T | undefined => {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  if (array.length === 0) return undefined;\n\n  return array[random(0, array.length - 1)];\n};\n"],"names":["draw","array","assert","isArray","IS_ARRAY_ERROR_MSG","random"],"mappings":";;;AAkBO,MAAMA,IAAO,CAAIC,MAA8B;AAGpD,MAFAC,EAAOC,EAAQF,CAAK,GAAGG,GAAoB,EAAE,MAAM,EAAE,OAAAH,EAAA,GAAS,MAAM,WAAW,GAE3EA,EAAM,WAAW;AAErB,WAAOA,EAAMI,EAAO,GAAGJ,EAAM,SAAS,CAAC,CAAC;AAC1C;"}

package/dist/random/random.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("../function/assert.cjs");function o(r,e){a.assert(r<=e,"Minimum value must be less than maximum value",{args:{max:e,min:r},type:RangeError});const t=crypto?crypto.getRandomValues(new Uint32Array(1))[0]/4294967295:Math.random();return Math.floor(t*(e-r+1))+r}exports.random=o;
+//# sourceMappingURL=random.cjs.map

package/dist/random/random.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"random.cjs","sources":["../../src/random/random.ts"],"sourcesContent":["import { assert } from '../function/assert';\n\n/**\n * Generates a random integer between two values, inclusive.\n *\n * @example\n * ```ts\n * random(1, 10); // a random integer between 1 and 10\n * ```\n *\n * @param min - The minimum value.\n * @param max - The maximum value.\n * @returns A random integer between min and max.\n */\nexport function random(min: number, max: number): number {\n  assert(min <= max, 'Minimum value must be less than maximum value', { args: { max, min }, type: RangeError });\n\n  const randomValue = crypto ? crypto.getRandomValues(new Uint32Array(1))[0] / 0xffffffff : Math.random();\n\n  return Math.floor(randomValue * (max - min + 1)) + min;\n}\n"],"names":["random","min","max","assert","randomValue"],"mappings":"0HAcO,SAASA,EAAOC,EAAaC,EAAqB,CACvDC,EAAAA,OAAOF,GAAOC,EAAK,gDAAiD,CAAE,KAAM,CAAE,IAAAA,EAAK,IAAAD,CAAA,EAAO,KAAM,UAAA,CAAY,EAE5G,MAAMG,EAAc,OAAS,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,EAAI,WAAa,KAAK,OAAA,EAE/F,OAAO,KAAK,MAAMA,GAAeF,EAAMD,EAAM,EAAE,EAAIA,CACrD"}

package/dist/random/random.js

@@ -0,0 +1,10 @@
+import { assert as o } from "../function/assert.js";
+function n(r, t) {
+  o(r <= t, "Minimum value must be less than maximum value", { args: { max: t, min: r }, type: RangeError });
+  const a = crypto ? crypto.getRandomValues(new Uint32Array(1))[0] / 4294967295 : Math.random();
+  return Math.floor(a * (t - r + 1)) + r;
+}
+export {
+  n as random
+};
+//# sourceMappingURL=random.js.map

package/dist/random/random.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"random.js","sources":["../../src/random/random.ts"],"sourcesContent":["import { assert } from '../function/assert';\n\n/**\n * Generates a random integer between two values, inclusive.\n *\n * @example\n * ```ts\n * random(1, 10); // a random integer between 1 and 10\n * ```\n *\n * @param min - The minimum value.\n * @param max - The maximum value.\n * @returns A random integer between min and max.\n */\nexport function random(min: number, max: number): number {\n  assert(min <= max, 'Minimum value must be less than maximum value', { args: { max, min }, type: RangeError });\n\n  const randomValue = crypto ? crypto.getRandomValues(new Uint32Array(1))[0] / 0xffffffff : Math.random();\n\n  return Math.floor(randomValue * (max - min + 1)) + min;\n}\n"],"names":["random","min","max","assert","randomValue"],"mappings":";AAcO,SAASA,EAAOC,GAAaC,GAAqB;AACvD,EAAAC,EAAOF,KAAOC,GAAK,iDAAiD,EAAE,MAAM,EAAE,KAAAA,GAAK,KAAAD,EAAA,GAAO,MAAM,WAAA,CAAY;AAE5G,QAAMG,IAAc,SAAS,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,aAAa,KAAK,OAAA;AAE/F,SAAO,KAAK,MAAMA,KAAeF,IAAMD,IAAM,EAAE,IAAIA;AACrD;"}

package/dist/random/shuffle.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("../function/assert.cjs"),o=require("../typed/isArray.cjs");function u(t){n.assert(o.isArray(t),o.IS_ARRAY_ERROR_MSG,{args:{array:t},type:TypeError});const e=[...t];for(let r=e.length-1;r>0;r--){const s=Math.floor(Math.random()*(r+1));[e[r],e[s]]=[e[s],e[r]]}return e}exports.shuffle=u;
+//# sourceMappingURL=shuffle.cjs.map

package/dist/random/shuffle.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"shuffle.cjs","sources":["../../src/random/shuffle.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\n\n/**\n * Shuffles an array randomly.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * shuffle(arr); // a shuffled version of the array\n * ```\n *\n * @param array - The array to shuffle.\n *\n * @returns A new shuffled array.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport function shuffle<T>(array: T[]): T[] {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const result = [...array];\n\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = Math.floor(Math.random() * (i + 1));\n    [result[i], result[j]] = [result[j], result[i]];\n  }\n\n  return result;\n}\n"],"names":["shuffle","array","assert","isArray","IS_ARRAY_ERROR_MSG","result","i","j"],"mappings":"4JAkBO,SAASA,EAAWC,EAAiB,CAC1CC,EAAAA,OAAOC,EAAAA,QAAQF,CAAK,EAAGG,qBAAoB,CAAE,KAAM,CAAE,MAAAH,CAAA,EAAS,KAAM,UAAW,EAE/E,MAAMI,EAAS,CAAC,GAAGJ,CAAK,EAExB,QAASK,EAAID,EAAO,OAAS,EAAGC,EAAI,EAAGA,IAAK,CAC1C,MAAMC,EAAI,KAAK,MAAM,KAAK,UAAYD,EAAI,EAAE,EAC5C,CAACD,EAAOC,CAAC,EAAGD,EAAOE,CAAC,CAAC,EAAI,CAACF,EAAOE,CAAC,EAAGF,EAAOC,CAAC,CAAC,CAChD,CAEA,OAAOD,CACT"}

package/dist/random/shuffle.js

@@ -0,0 +1,15 @@
+import { assert as s } from "../function/assert.js";
+import { IS_ARRAY_ERROR_MSG as f, isArray as n } from "../typed/isArray.js";
+function m(o) {
+  s(n(o), f, { args: { array: o }, type: TypeError });
+  const r = [...o];
+  for (let t = r.length - 1; t > 0; t--) {
+    const e = Math.floor(Math.random() * (t + 1));
+    [r[t], r[e]] = [r[e], r[t]];
+  }
+  return r;
+}
+export {
+  m as shuffle
+};
+//# sourceMappingURL=shuffle.js.map

package/dist/random/shuffle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shuffle.js","sources":["../../src/random/shuffle.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\n\n/**\n * Shuffles an array randomly.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * shuffle(arr); // a shuffled version of the array\n * ```\n *\n * @param array - The array to shuffle.\n *\n * @returns A new shuffled array.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport function shuffle<T>(array: T[]): T[] {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const result = [...array];\n\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = Math.floor(Math.random() * (i + 1));\n    [result[i], result[j]] = [result[j], result[i]];\n  }\n\n  return result;\n}\n"],"names":["shuffle","array","assert","isArray","IS_ARRAY_ERROR_MSG","result","i","j"],"mappings":";;AAkBO,SAASA,EAAWC,GAAiB;AAC1C,EAAAC,EAAOC,EAAQF,CAAK,GAAGG,GAAoB,EAAE,MAAM,EAAE,OAAAH,EAAA,GAAS,MAAM,WAAW;AAE/E,QAAMI,IAAS,CAAC,GAAGJ,CAAK;AAExB,WAASK,IAAID,EAAO,SAAS,GAAGC,IAAI,GAAGA,KAAK;AAC1C,UAAMC,IAAI,KAAK,MAAM,KAAK,YAAYD,IAAI,EAAE;AAC5C,KAACD,EAAOC,CAAC,GAAGD,EAAOE,CAAC,CAAC,IAAI,CAACF,EAAOE,CAAC,GAAGF,EAAOC,CAAC,CAAC;AAAA,EAChD;AAEA,SAAOD;AACT;"}