@vinicunca/perkakas 1.9.0 → 1.12.0

package/dist/sum-by.d.cts

@@ -1,3 +1,57 @@
-import "./iterable-container-V5sa0V_H.cjs";
-import { sumBy } from "./sum-by-DH-LAQQ3.cjs";
-export { sumBy };
+import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
+
+//#region src/sum-by.d.ts
+type SumBy<T extends IterableContainer, U extends bigint | number> = T extends readonly [] ? 0 : T extends readonly [unknown, ...ReadonlyArray<unknown>] ? U : 0 | U;
+/**
+ * Returns the sum of the elements of an array using the provided mapper.
+ *
+ * Works for both `number` and `bigint` mappers, but not mappers that return both
+ * types.
+ *
+ * IMPORTANT: The result for empty arrays would be 0 (`number`) regardless of
+ * the type of the mapper; to avoid adding this to the return type for cases
+ * where the array is known to be non-empty you can use `hasAtLeast` or
+ * `isEmpty` to guard against this case.
+ *
+ *
+ * @param callbackfn - Predicate function.
+ * @signature
+ *   P.sumBy(fn)(array)
+ * @example
+ *    P.pipe(
+ *      [{a: 5}, {a: 1}, {a: 3}],
+ *      P.sumBy(x => x.a)
+ *    ) // 9
+ * @dataLast
+ * @category Array
+ */
+declare function sumBy<T extends IterableContainer>(callbackfn: (value: T[number], index: number, data: T) => number): (items: T) => SumBy<T, number>;
+declare function sumBy<T extends IterableContainer>(callbackfn: (value: T[number], index: number, data: T) => bigint): (items: T) => SumBy<T, bigint>;
+/**
+ * Returns the sum of the elements of an array using the provided mapper.
+ *
+ * Works for both `number` and `bigint` mappers, but not mappers that can return both
+ * types.
+ *
+ * IMPORTANT: The result for empty arrays would be 0 (`number`) regardless of
+ * the type of the mapper; to avoid adding this to the return type for cases
+ * where the array is known to be non-empty you can use `hasAtLeast` or
+ * `isEmpty` to guard against this case.
+ *
+ * @param data - The array.
+ * @param callbackfn - Predicate function.
+ * @signature
+ *   P.sumBy(array, fn)
+ * @example
+ *    P.sumBy(
+ *      [{a: 5}, {a: 1}, {a: 3}],
+ *      x => x.a
+ *    ) // 9
+ * @dataFirst
+ * @category Array
+ */
+declare function sumBy<T extends IterableContainer>(data: T, callbackfn: (value: T[number], index: number, data: T) => number): SumBy<T, number>;
+declare function sumBy<T extends IterableContainer>(data: T, callbackfn: (value: T[number], index: number, data: T) => bigint): SumBy<T, bigint>;
+//#endregion
+export { sumBy };
+//# sourceMappingURL=sum-by.d.cts.map

package/dist/sum-by.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sum-by.d.cts","names":[],"sources":["../src/sum-by.ts"],"sourcesContent":[],"mappings":";;;KAGK,gBACO,gDAER,4BAEA,gCAAgC,0BAC9B,QACI;;AAVmE;;;;;;;;AAmC7E;;;;;;;;AAGA;;;;;;AAEiB,iBALD,KAKC,CAAA,UALe,iBAKf,CAAA,CAAA,UAAA,EAAA,CAAA,KAAA,EAJK,CAIL,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAJqC,CAIrC,EAAA,GAAA,MAAA,CAAA,EAAA,CAAA,KAAA,EAHN,CAGM,EAAA,GAHA,KAGA,CAHM,CAGN,EAAA,MAAA,CAAA;AAAK,iBAFN,KAEM,CAAA,UAFU,iBAEV,CAAA,CAAA,UAAA,EAAA,CAAA,KAAA,EADA,CACA,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EADgC,CAChC,EAAA,GAAA,MAAA,CAAA,EAAA,CAAA,KAAA,EAAX,CAAW,EAAA,GAAL,KAAK,CAAC,CAAD,EAAA,MAAA,CAAA;AAyBtB;;;;;;;;AAIA;;;;;;;;;;;;;;;iBAJgB,gBAAgB,yBACxB,uBACc,gCAAgC,eACnD,MAAM;iBACO,gBAAgB,yBACxB,uBACc,gCAAgC,eACnD,MAAM"}

package/dist/sum-by.d.ts

@@ -1,3 +1,57 @@
-import "./iterable-container-F9CDF7ym.js";
-import { sumBy } from "./sum-by-CTPKc8na.js";
-export { sumBy };
+import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
+
+//#region src/sum-by.d.ts
+type SumBy<T extends IterableContainer, U extends bigint | number> = T extends readonly [] ? 0 : T extends readonly [unknown, ...ReadonlyArray<unknown>] ? U : 0 | U;
+/**
+ * Returns the sum of the elements of an array using the provided mapper.
+ *
+ * Works for both `number` and `bigint` mappers, but not mappers that return both
+ * types.
+ *
+ * IMPORTANT: The result for empty arrays would be 0 (`number`) regardless of
+ * the type of the mapper; to avoid adding this to the return type for cases
+ * where the array is known to be non-empty you can use `hasAtLeast` or
+ * `isEmpty` to guard against this case.
+ *
+ *
+ * @param callbackfn - Predicate function.
+ * @signature
+ *   P.sumBy(fn)(array)
+ * @example
+ *    P.pipe(
+ *      [{a: 5}, {a: 1}, {a: 3}],
+ *      P.sumBy(x => x.a)
+ *    ) // 9
+ * @dataLast
+ * @category Array
+ */
+declare function sumBy<T extends IterableContainer>(callbackfn: (value: T[number], index: number, data: T) => number): (items: T) => SumBy<T, number>;
+declare function sumBy<T extends IterableContainer>(callbackfn: (value: T[number], index: number, data: T) => bigint): (items: T) => SumBy<T, bigint>;
+/**
+ * Returns the sum of the elements of an array using the provided mapper.
+ *
+ * Works for both `number` and `bigint` mappers, but not mappers that can return both
+ * types.
+ *
+ * IMPORTANT: The result for empty arrays would be 0 (`number`) regardless of
+ * the type of the mapper; to avoid adding this to the return type for cases
+ * where the array is known to be non-empty you can use `hasAtLeast` or
+ * `isEmpty` to guard against this case.
+ *
+ * @param data - The array.
+ * @param callbackfn - Predicate function.
+ * @signature
+ *   P.sumBy(array, fn)
+ * @example
+ *    P.sumBy(
+ *      [{a: 5}, {a: 1}, {a: 3}],
+ *      x => x.a
+ *    ) // 9
+ * @dataFirst
+ * @category Array
+ */
+declare function sumBy<T extends IterableContainer>(data: T, callbackfn: (value: T[number], index: number, data: T) => number): SumBy<T, number>;
+declare function sumBy<T extends IterableContainer>(data: T, callbackfn: (value: T[number], index: number, data: T) => bigint): SumBy<T, bigint>;
+//#endregion
+export { sumBy };
+//# sourceMappingURL=sum-by.d.ts.map

package/dist/sum-by.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sum-by.d.ts","names":[],"sources":["../src/sum-by.ts"],"sourcesContent":[],"mappings":";;;KAGK,gBACO,gDAER,4BAEA,gCAAgC,0BAC9B,QACI;;AAVmE;;;;;;;;AAmC7E;;;;;;;;AAGA;;;;;;AAEiB,iBALD,KAKC,CAAA,UALe,iBAKf,CAAA,CAAA,UAAA,EAAA,CAAA,KAAA,EAJK,CAIL,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAJqC,CAIrC,EAAA,GAAA,MAAA,CAAA,EAAA,CAAA,KAAA,EAHN,CAGM,EAAA,GAHA,KAGA,CAHM,CAGN,EAAA,MAAA,CAAA;AAAK,iBAFN,KAEM,CAAA,UAFU,iBAEV,CAAA,CAAA,UAAA,EAAA,CAAA,KAAA,EADA,CACA,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EADgC,CAChC,EAAA,GAAA,MAAA,CAAA,EAAA,CAAA,KAAA,EAAX,CAAW,EAAA,GAAL,KAAK,CAAC,CAAD,EAAA,MAAA,CAAA;AAyBtB;;;;;;;;AAIA;;;;;;;;;;;;;;;iBAJgB,gBAAgB,yBACxB,uBACc,gCAAgC,eACnD,MAAM;iBACO,gBAAgB,yBACxB,uBACc,gCAAgC,eACnD,MAAM"}

package/dist/sum-by.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{sumBy as e}from"./sum-by-DKfgHdcr.js";export{e as sumBy};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){let n=e.entries(),r=n.next();if(`done`in r&&r.done)return 0;let{value:[,i]}=r,a=t(i,0,e);for(let[r,i]of n){let n=t(i,r,e);a+=n}return a}export{t as sumBy};
+//# sourceMappingURL=sum-by.js.map

package/dist/sum-by.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sum-by.js","names":[],"sources":["../src/sum-by.ts"],"sourcesContent":["import type { IterableContainer } from './internal/types/iterable-container';\nimport { curry } from './curry';\n\ntype SumBy<\n  T extends IterableContainer,\n  U extends bigint | number,\n> = T extends readonly []\n  ? 0\n  : T extends readonly [unknown, ...ReadonlyArray<unknown>]\n    ? U\n    : 0 | U;\n\n/**\n * Returns the sum of the elements of an array using the provided mapper.\n *\n * Works for both `number` and `bigint` mappers, but not mappers that return both\n * types.\n *\n * IMPORTANT: The result for empty arrays would be 0 (`number`) regardless of\n * the type of the mapper; to avoid adding this to the return type for cases\n * where the array is known to be non-empty you can use `hasAtLeast` or\n * `isEmpty` to guard against this case.\n *\n *\n * @param callbackfn - Predicate function.\n * @signature\n *   P.sumBy(fn)(array)\n * @example\n *    P.pipe(\n *      [{a: 5}, {a: 1}, {a: 3}],\n *      P.sumBy(x => x.a)\n *    ) // 9\n * @dataLast\n * @category Array\n */\nexport function sumBy<T extends IterableContainer>(\n  callbackfn: (value: T[number], index: number, data: T) => number,\n): (items: T) => SumBy<T, number>;\nexport function sumBy<T extends IterableContainer>(\n  callbackfn: (value: T[number], index: number, data: T) => bigint,\n): (items: T) => SumBy<T, bigint>;\n\n/**\n * Returns the sum of the elements of an array using the provided mapper.\n *\n * Works for both `number` and `bigint` mappers, but not mappers that can return both\n * types.\n *\n * IMPORTANT: The result for empty arrays would be 0 (`number`) regardless of\n * the type of the mapper; to avoid adding this to the return type for cases\n * where the array is known to be non-empty you can use `hasAtLeast` or\n * `isEmpty` to guard against this case.\n *\n * @param data - The array.\n * @param callbackfn - Predicate function.\n * @signature\n *   P.sumBy(array, fn)\n * @example\n *    P.sumBy(\n *      [{a: 5}, {a: 1}, {a: 3}],\n *      x => x.a\n *    ) // 9\n * @dataFirst\n * @category Array\n */\nexport function sumBy<T extends IterableContainer>(\n  data: T,\n  callbackfn: (value: T[number], index: number, data: T) => number,\n): SumBy<T, number>;\nexport function sumBy<T extends IterableContainer>(\n  data: T,\n  callbackfn: (value: T[number], index: number, data: T) => bigint,\n): SumBy<T, bigint>;\n\nexport function sumBy(...args: ReadonlyArray<unknown>): unknown {\n  return curry(sumByImplementation, args);\n}\n\n// eslint-disable-next-line sonar/function-return-type\nfunction sumByImplementation<T>(\n  array: ReadonlyArray<T>,\n  callbackfn: (\n    value: T,\n    index: number,\n    data: ReadonlyArray<T>\n  ) => bigint | number,\n): bigint | number {\n  const iter = array.entries();\n\n  const firstEntry = iter.next();\n  if ('done' in firstEntry && firstEntry.done) {\n    return 0;\n  }\n\n  const {\n    value: [, firstValue],\n  } = firstEntry;\n  let sum = callbackfn(firstValue, 0, array);\n  for (const [index, item] of iter) {\n    const summand = callbackfn(item, index, array);\n\n    // @ts-expect-error [ts2365] -- Typescript can't infer that all elements will be a number of the same type.\n    sum += summand;\n  }\n\n  return sum;\n};\n"],"mappings":"wCA0EA,SAAgB,EAAM,GAAG,EAAuC,CAC9D,OAAO,EAAM,EAAqB,EAAK,CAIzC,SAAS,EACP,EACA,EAKiB,CACjB,IAAM,EAAO,EAAM,SAAS,CAEtB,EAAa,EAAK,MAAM,CAC9B,GAAI,SAAU,GAAc,EAAW,KACrC,MAAO,GAGT,GAAM,CACJ,MAAO,EAAG,IACR,EACA,EAAM,EAAW,EAAY,EAAG,EAAM,CAC1C,IAAK,GAAM,CAAC,EAAO,KAAS,EAAM,CAChC,IAAM,EAAU,EAAW,EAAM,EAAO,EAAM,CAG9C,GAAO,EAGT,OAAO"}

package/dist/sum.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./sum-B69a1sb5.cjs`);exports.sum=e.sum;
+const e=require(`./curry-BsY0Z8jH.cjs`);function t(...t){return e.t(n,t)}function n(e){let t=typeof e[0]==`bigint`?0n:0;for(let n of e)t+=n;return t}exports.sum=t;

package/dist/sum.d.cts

@@ -1,3 +1,50 @@
-import "./iterable-container-V5sa0V_H.cjs";
-import { sum } from "./sum-CyC38gTv.cjs";
-export { sum };
+import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
+
+//#region src/sum.d.ts
+type Sum<T extends IterableContainer<bigint> | IterableContainer<number>> = T extends readonly [] ? 0 : T extends readonly [bigint, ...ReadonlyArray<unknown>] ? bigint : T[number] extends bigint ? 0 | bigint : number;
+/**
+ * Sums the numbers in the array, or return 0 for an empty array.
+ *
+ * Works for both `number` and `bigint` arrays, but not arrays that contain both
+ * types.
+ *
+ * IMPORTANT: The result for empty arrays would be 0 (`number`) regardless of
+ * the type of the array; to avoid adding this to the return type for cases
+ * where the array is known to be non-empty you can use `hasAtLeast` or
+ * `isEmpty` to guard against this case.
+ *
+ * @param data - The array of numbers.
+ * @signature
+ *   P.sum(data);
+ * @example
+ *   P.sum([1, 2, 3]); // => 6
+ *   P.sum([1n, 2n, 3n]); // => 6n
+ *   P.sum([]); // => 0
+ * @dataFirst
+ * @category Number
+ */
+declare function sum<T extends IterableContainer<bigint> | IterableContainer<number>>(data: T): Sum<T>;
+/**
+ * Sums the numbers in the array, or return 0 for an empty array.
+ *
+ * Works for both `number` and `bigint` arrays, but not arrays that contain both
+ * types.
+ *
+ * IMPORTANT: The result for empty arrays would be 0 (`number`) regardless of
+ * the type of the array; to avoid adding this to the return type for cases
+ * where the array is known to be non-empty you can use `hasAtLeast` or
+ * `isEmpty`to guard against this case.
+ *
+ * @signature
+ *   P.sum()(data);
+ * @example
+ *   P.pipe([1, 2, 3], P.sum()); // => 6
+ *   P.pipe([1n, 2n, 3n], R.sum()); // => 6n
+ *   P.pipe([], P.sum()); // => 0
+ * @dataLast
+ * @category Number
+ */
+declare function sum(): <T extends IterableContainer<bigint> | IterableContainer<number>>(data: T) => Sum<T>;
+//#endregion
+export { sum };
+//# sourceMappingURL=sum.d.cts.map

package/dist/sum.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sum.d.cts","names":[],"sources":["../src/sum.ts"],"sourcesContent":[],"mappings":";;;KAIK,cAAc,4BAA4B,6BAE3C,4BAGE,+BAA+B,mCAG7B;;AAZqE;;;;;;;;AAsC7E;;;;;;;AAwBA;;;;;AAIK,iBA5BW,GA4BX,CAAA,UA3BO,iBA2BP,CAAA,MAAA,CAAA,GA3BmC,iBA2BnC,CAAA,MAAA,CAAA,CAAA,CAAA,IAAA,EA1BG,CA0BH,CAAA,EA1BO,GA0BP,CA1BW,CA0BX,CAAA;;;;;;;;;;;;;;;;;;;;;iBAJW,GAAA,CAAA,cACJ,4BAA4B,iCAEhC,MACH,IAAI"}

package/dist/sum.d.ts

@@ -1,3 +1,50 @@
-import "./iterable-container-F9CDF7ym.js";
-import { sum } from "./sum-CEgbjhbj.js";
-export { sum };
+import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
+
+//#region src/sum.d.ts
+type Sum<T extends IterableContainer<bigint> | IterableContainer<number>> = T extends readonly [] ? 0 : T extends readonly [bigint, ...ReadonlyArray<unknown>] ? bigint : T[number] extends bigint ? 0 | bigint : number;
+/**
+ * Sums the numbers in the array, or return 0 for an empty array.
+ *
+ * Works for both `number` and `bigint` arrays, but not arrays that contain both
+ * types.
+ *
+ * IMPORTANT: The result for empty arrays would be 0 (`number`) regardless of
+ * the type of the array; to avoid adding this to the return type for cases
+ * where the array is known to be non-empty you can use `hasAtLeast` or
+ * `isEmpty` to guard against this case.
+ *
+ * @param data - The array of numbers.
+ * @signature
+ *   P.sum(data);
+ * @example
+ *   P.sum([1, 2, 3]); // => 6
+ *   P.sum([1n, 2n, 3n]); // => 6n
+ *   P.sum([]); // => 0
+ * @dataFirst
+ * @category Number
+ */
+declare function sum<T extends IterableContainer<bigint> | IterableContainer<number>>(data: T): Sum<T>;
+/**
+ * Sums the numbers in the array, or return 0 for an empty array.
+ *
+ * Works for both `number` and `bigint` arrays, but not arrays that contain both
+ * types.
+ *
+ * IMPORTANT: The result for empty arrays would be 0 (`number`) regardless of
+ * the type of the array; to avoid adding this to the return type for cases
+ * where the array is known to be non-empty you can use `hasAtLeast` or
+ * `isEmpty`to guard against this case.
+ *
+ * @signature
+ *   P.sum()(data);
+ * @example
+ *   P.pipe([1, 2, 3], P.sum()); // => 6
+ *   P.pipe([1n, 2n, 3n], R.sum()); // => 6n
+ *   P.pipe([], P.sum()); // => 0
+ * @dataLast
+ * @category Number
+ */
+declare function sum(): <T extends IterableContainer<bigint> | IterableContainer<number>>(data: T) => Sum<T>;
+//#endregion
+export { sum };
+//# sourceMappingURL=sum.d.ts.map

package/dist/sum.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sum.d.ts","names":[],"sources":["../src/sum.ts"],"sourcesContent":[],"mappings":";;;KAIK,cAAc,4BAA4B,6BAE3C,4BAGE,+BAA+B,mCAG7B;;AAZqE;;;;;;;;AAsC7E;;;;;;;AAwBA;;;;;AAIK,iBA5BW,GA4BX,CAAA,UA3BO,iBA2BP,CAAA,MAAA,CAAA,GA3BmC,iBA2BnC,CAAA,MAAA,CAAA,CAAA,CAAA,IAAA,EA1BG,CA0BH,CAAA,EA1BO,GA0BP,CA1BW,CA0BX,CAAA;;;;;;;;;;;;;;;;;;;;;iBAJW,GAAA,CAAA,cACJ,4BAA4B,iCAEhC,MACH,IAAI"}

package/dist/sum.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{sum as e}from"./sum-BHYsbVr5.js";export{e as sum};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e){let t=typeof e[0]==`bigint`?0n:0;for(let n of e)t+=n;return t}export{t as sum};
+//# sourceMappingURL=sum.js.map

package/dist/sum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sum.js","names":[],"sources":["../src/sum.ts"],"sourcesContent":["import type { IterableContainer } from './internal/types/iterable-container';\n\nimport { curry } from './curry';\n\ntype Sum<T extends IterableContainer<bigint> | IterableContainer<number>>\n  // Empty arrays would always result in a product of (a non-bigint) 1\n  = T extends readonly []\n    ? 0\n    // Non-empty bigint arrays will always result in a bigint sum.\n    : T extends readonly [bigint, ...ReadonlyArray<unknown>]\n      ? bigint\n      // But an empty bigint array would result in a non-bigint 0.\n      : T[number] extends bigint\n        ? 0 | bigint\n        // Non-bigint arrays are always handled correctly.\n        : number;\n\n/**\n * Sums the numbers in the array, or return 0 for an empty array.\n *\n * Works for both `number` and `bigint` arrays, but not arrays that contain both\n * types.\n *\n * IMPORTANT: The result for empty arrays would be 0 (`number`) regardless of\n * the type of the array; to avoid adding this to the return type for cases\n * where the array is known to be non-empty you can use `hasAtLeast` or\n * `isEmpty` to guard against this case.\n *\n * @param data - The array of numbers.\n * @signature\n *   P.sum(data);\n * @example\n *   P.sum([1, 2, 3]); // => 6\n *   P.sum([1n, 2n, 3n]); // => 6n\n *   P.sum([]); // => 0\n * @dataFirst\n * @category Number\n */\nexport function sum<\n  T extends IterableContainer<bigint> | IterableContainer<number>,\n>(data: T): Sum<T>;\n\n/**\n * Sums the numbers in the array, or return 0 for an empty array.\n *\n * Works for both `number` and `bigint` arrays, but not arrays that contain both\n * types.\n *\n * IMPORTANT: The result for empty arrays would be 0 (`number`) regardless of\n * the type of the array; to avoid adding this to the return type for cases\n * where the array is known to be non-empty you can use `hasAtLeast` or\n * `isEmpty`to guard against this case.\n *\n * @signature\n *   P.sum()(data);\n * @example\n *   P.pipe([1, 2, 3], P.sum()); // => 6\n *   P.pipe([1n, 2n, 3n], R.sum()); // => 6n\n *   P.pipe([], P.sum()); // => 0\n * @dataLast\n * @category Number\n */\nexport function sum(): <\n  T extends IterableContainer<bigint> | IterableContainer<number>,\n>(\n  data: T,\n) => Sum<T>;\n\nexport function sum(...args: ReadonlyArray<unknown>): unknown {\n  return curry(sumImplementation, args);\n}\n\nfunction sumImplementation<\n  T extends IterableContainer<bigint> | IterableContainer<number>,\n>(data: T): T[number] {\n  let out = typeof data[0] === 'bigint' ? 0n : 0;\n  for (const value of data) {\n    // @ts-expect-error [ts2365] -- Typescript can't infer that all elements will be a number of the same type.\n\n    out += value;\n  }\n  return out;\n}\n"],"mappings":"wCAoEA,SAAgB,EAAI,GAAG,EAAuC,CAC5D,OAAO,EAAM,EAAmB,EAAK,CAGvC,SAAS,EAEP,EAAoB,CACpB,IAAI,EAAM,OAAO,EAAK,IAAO,SAAW,GAAK,EAC7C,IAAK,IAAM,KAAS,EAGlB,GAAO,EAET,OAAO"}

package/dist/swap-in-place-BHkB_mvV.cjs

@@ -0,0 +1 @@
+function e(e,t,n){[e[t],e[n]]=[e[n],e[t]]}Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return e}});

package/dist/swap-in-place-COm7qHj4.js

@@ -0,0 +1,2 @@
+function e(e,t,n){[e[t],e[n]]=[e[n],e[t]]}export{e as t};
+//# sourceMappingURL=swap-in-place-COm7qHj4.js.map

package/dist/swap-in-place-COm7qHj4.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"swap-in-place-COm7qHj4.js","names":[],"sources":["../src/internal/swap-in-place.ts"],"sourcesContent":["/**\n * An efficient hack to swap the values at two indices in an array *in-place*.\n */\nexport function swapInPlace(\n\n  data: Array<unknown>,\n  i: number,\n  j: number,\n): void {\n  // We use destructuring to perform an in-place swap *without* needing a\n  // temporary variable\n  [data[i], data[j]] = [data[j], data[i]];\n}\n"],"mappings":"AAGA,SAAgB,EAEd,EACA,EACA,EACM,CAGN,CAAC,EAAK,GAAI,EAAK,IAAM,CAAC,EAAK,GAAI,EAAK,GAAG"}

package/dist/swap-indices.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./swap-indices-CsuHWDbY.cjs`);exports.swapIndices=e.swapIndices;
+const e=require(`./curry-BsY0Z8jH.cjs`);function t(...t){return e.t(n,t)}function n(e,t,n){return typeof e==`string`?r([...e],t,n).join(``):r(e,t,n)}function r(e,t,n){let r=[...e];if(Number.isNaN(t)||Number.isNaN(n))return r;let i=t<0?e.length+t:t,a=n<0?e.length+n:n;return i<0||i>e.length||a<0||a>e.length?r:(r[i]=e[a],r[a]=e[i],r)}exports.swapIndices=t;

package/dist/swap-indices.d.cts

@@ -1,3 +1,61 @@
-import "./iterable-container-V5sa0V_H.cjs";
-import { swapIndices } from "./swap-indices-DWG9tWCr.cjs";
-export { swapIndices };
+import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
+import { Join } from "type-fest";
+
+//#region src/swap-indices.d.ts
+
+/**
+ * @see https://github.com/sindresorhus/type-fest/blob/main/source/is-equal.d.ts
+ */
+type isEqual<A, B> = (<G>() => G extends A ? 1 : 2) extends (<G>() => G extends B ? 1 : 2) ? true : false;
+type Difference<A extends number, B extends number> = TupleOfLength<A> extends [...infer U, ...TupleOfLength<B>] ? U['length'] : never;
+type isLessThan<A extends number, B extends number> = isEqual<A, B> extends true ? false : 0 extends A ? true : 0 extends B ? false : isLessThan<Difference<A, 1>, Difference<B, 1>>;
+type TupleOfLength<L extends number, T extends IterableContainer = []> = T['length'] extends L ? T : TupleOfLength<L, [...T, unknown]>;
+type IsNonNegative<T extends number> = number extends T ? false : `${T}` extends `-${string}` ? false : true;
+type CharactersTuple<T extends string> = string extends T ? Array<string> : T extends `${infer C}${infer R}` ? [C, ...CharactersTuple<R>] : [];
+type SwapArrayInternal<T extends IterableContainer, Index1 extends number, Index2 extends number, Position extends ReadonlyArray<unknown> = [], Original extends IterableContainer = T> = T extends readonly [infer AtPosition, ...infer Rest] ? [Position['length'] extends Index1 ? Original[Index2] : Position['length'] extends Index2 ? Original[Index1] : AtPosition, ...SwapArrayInternal<Rest, Index1, Index2, [unknown, ...Position], Original>] : T;
+type SwapString<T extends string, K1 extends number, K2 extends number> = Join<SwapArray<CharactersTuple<T>, K1, K2>, ''>;
+type SwapArray<T extends IterableContainer, K1 extends number, K2 extends number> = IsNonNegative<K1> extends false ? Array<T[number]> : IsNonNegative<K2> extends false ? Array<T[number]> : isLessThan<K1, T['length']> extends false ? T : isLessThan<K2, T['length']> extends false ? T : SwapArrayInternal<T, K1, K2>;
+type SwappedIndices<T extends IterableContainer | string, K1 extends number, K2 extends number> = T extends string ? SwapString<T, K1, K2> : T extends IterableContainer ? SwapArray<T, K1, K2> : never;
+/**
+ * Swaps the positions of two elements in an array or string at the provided indices.
+ *
+ * Negative indices are supported and would be treated as an offset from the end of the array. The resulting type thought would be less strict than when using positive indices.
+ *
+ * If either index is out of bounds the result would be a shallow copy of the input, as-is.
+ *
+ * @param data - The item to be manipulated. This can be an array, or a string.
+ * @param index1 - The first index.
+ * @param index2 - The second index.
+ * @returns Returns the manipulated array or string.
+ * @signature
+ *   swapIndices(data, index1, index2)
+ * @example
+ *   swapIndices(['a', 'b', 'c'], 0, 1) // => ['b', 'a', 'c']
+ *   swapIndices(['a', 'b', 'c'], 1, -1) // => ['a', 'c', 'b']
+ *   swapIndices('abc', 0, 1) // => 'bac'
+ * @dataFirst
+ * @category Array
+ */
+declare function swapIndices<T extends IterableContainer | string, K1 extends number, K2 extends number>(data: T, index1: K1, index2: K2): SwappedIndices<T, K1, K2>;
+/**
+ * Swaps the positions of two elements in an array or string at the provided indices.
+ *
+ * Negative indices are supported and would be treated as an offset from the end of the array. The resulting type thought would be less strict than when using positive indices.
+ *
+ * If either index is out of bounds the result would be a shallow copy of the input, as-is.
+ *
+ * @param index1 - The first index.
+ * @param index2 - The second index.
+ * @returns Returns the manipulated array or string.
+ * @signature
+ *   swapIndices(index1, index2)(data)
+ * @example
+ *   swapIndices(0, 1)(['a', 'b', 'c']) // => ['b', 'a', 'c']
+ *   swapIndices(0, -1)('abc') // => 'cba'
+ * @dataLast
+ * @category Array
+ */
+declare function swapIndices<K1 extends number, K2 extends number>(index1: K1, index2: K2): <T extends IterableContainer | string>(data: T) => SwappedIndices<T, K1, K2>;
+//#endregion
+export { swapIndices };
+//# sourceMappingURL=swap-indices.d.cts.map

package/dist/swap-indices.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"swap-indices.d.cts","names":[],"sources":["../src/swap-indices.ts"],"sourcesContent":[],"mappings":";;;;;;;AAE6E;KAOxE,OACS,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,CAAA,CAAA,CAAA,CAAA,GAAA,GAAA,CAAA,SAAU,CAAV,GAAA,CAAA,GAAA,CAAA,CAAA,UAAA,CAAA,CAAA,CAAA,GAAA,GAAsC,CAAtC,SAAgD,CAAhD,GAAA,CAAA,GAAA,CAAA,IAAA,IAAA,GAAA,KAAA;KAIT,UAJmB,CAAA,UAAA,MAAA,EAAA,UAAA,MAAA,CAAA,GAKpB,aALoB,CAKN,CALM,CAAA,SAAA,CAAA,GAAA,KAAA,EAAA,EAAA,GAKqB,aALrB,CAKmC,CALnC,CAAA,CAAA,GAMlB,CANkB,CAAA,QAAA,CAAA,GAAA,KAAA;KASnB,UAT+C,CAAA,UAAA,MAAA,EAAA,UAAA,MAAA,CAAA,GAUhD,OAVgD,CAUxC,CAVwC,EAUrC,CAVqC,CAAA,SAAA,IAAA,GAAA,KAAA,GAAA,CAAA,SAYpC,CAZoC,GAAA,IAAA,GAAA,CAAA,SAclC,CAdkC,GAAA,KAAA,GAgB1C,UAhB0C,CAgB/B,UAhB+B,CAgBpB,CAhBoB,EAAA,CAAA,CAAA,EAgBb,UAhBa,CAgBF,CAhBE,EAAA,CAAA,CAAA,CAAA;KAkB/C,aAlByD,CAAA,UAAA,MAAA,EAAA,UAoBlD,iBApBkD,GAAA,EAAA,CAAA,GAqB1D,CArB0D,CAAA,QAAA,CAAA,SAqBtC,CArBsC,GAqBlC,CArBkC,GAqB9B,aArB8B,CAqBhB,CArBgB,EAAA,CAAA,GAqBT,CArBS,EAAA,OAAA,CAAA,CAAA;KAuBzD,aAvB0D,CAAA,UAAA,MAAA,CAAA,GAAA,MAAA,SAuBT,CAvBS,GAAA,KAAA,GAAA,GAyBxD,CAzBwD,EAAA,SAAA,IAAA,MAAA,EAAA,GAAA,KAAA,GAAA,IAAA;AAAA,KA6B1D,eAzBU,CAAA,UAAA,MAAA,CAAA,GAAA,MAAA,SAyByC,CAzBzC,GA0BX,KA1BW,CAAA,MAAA,CAAA,GA2BX,CA3BW,SAAA,GAAA,KAAA,EAAA,GAAA,KAAA,EAAA,EAAA,GAAA,CA4BR,CA5BQ,EAAA,GA4BF,eA5BE,CA4Bc,CA5Bd,CAAA,CAAA,GAAA,EAAA;KA+BV,iBA9Ba,CAAA,UA+BN,iBA/BM,EAAA,eAAA,MAAA,EAAA,eAAA,MAAA,EAAA,iBAkCC,aAlCD,CAAA,OAAA,CAAA,GAAA,EAAA,EAAA,iBAmCC,iBAnCD,GAmCqB,CAnCrB,CAAA,GAoCd,CApCc,SAAA,SAAA,CAAA,KAAA,WAAA,EAAA,GAAA,KAAA,KAAA,CAAA,GAAA,CAsCZ,QAtCF,CAAA,QAAA,CAAA,SAsC6B,MAtC7B,GAuCM,QAvCN,CAuCe,MAvCf,CAAA,GAwCM,QAxCN,CAAA,QAAA,CAAA,SAwCiC,MAxCjC,GAyCQ,QAzCR,CAyCiB,MAzCjB,CAAA,GAAA,UAAA,EAAuD,GA2ClD,iBA3CkD,CA4CnD,IA5CmD,EA6CnD,MA7CmD,EA8CnD,MA9CmD,EAAA,CAAd,OAAA,EACvC,GA8Ce,QA9Cf,CAAC,EA+CC,QA/CD,CAAA,CAAA,GAkDH,CA/CC;KAiDA,UAhDO,CAAA,UAAA,MAAA,EAAA,WAAA,MAAA,EAAA,WAAA,MAAA,CAAA,GAgD8D,IAhD9D,CAiDV,SAjDU,CAiDA,eAjDA,CAiDgB,CAjDhB,CAAA,EAiDoB,EAjDpB,EAiDwB,EAjDxB,CAAA,EAAA,EAAA,CAAA;KAqDP,SArDU,CAAA,UAsDH,iBAtDG,EAAA,WAAA,MAAA,EAAA,WAAA,MAAA,CAAA,GAgEX,aAhEW,CAgEG,EAhEH,CAAA,SAAA,KAAA,GAiET,KAjES,CAiEH,CAjEG,CAAA,MAAA,CAAA,CAAA,GAkET,aAlES,CAkEK,EAlEL,CAAA,SAAA,KAAA,GAmEP,KAnEO,CAmED,CAnEC,CAAA,MAAA,CAAA,CAAA,GAsET,UAtES,CAsEE,EAtEF,EAsEM,CAtEN,CAAA,QAAA,CAAA,CAAA,SAAA,KAAA,GAuEL,CAvEK,GAwEL,UAxEK,CAwEM,EAxEN,EAwEU,CAxEV,CAAA,QAAA,CAAA,CAAA,SAAA,KAAA,GAyEH,CAzEG,GA0EH,iBA1EG,CA0Ee,CA1Ef,EA0EkB,EA1ElB,EA0EsB,EA1EtB,CAAA;KA4EV,cA5ED,CAAA,UA6EQ,iBA7ER,GAAA,MAAA,EAAA,WAAA,MAAA,EAAA,WAAA,MAAA,CAAA,GAgFA,CAhFA,SAAA,MAAA,GAiFA,UAjFA,CAiFW,CAjFX,EAiFc,EAjFd,EAiFkB,EAjFlB,CAAA,GAkFA,CAlFA,SAkFU,iBAlFV,GAmFE,SAnFF,CAmFY,CAnFZ,EAmFe,EAnFf,EAmFmB,EAnFnB,CAAA,GAAA,KAAA;;;;;;;;;AAMgB;;;;;;;;;AAKyB;AAIrC;;AAKJ,iBAsFY,WAtFZ,CAAA,UAuFQ,iBAvFR,GAAA,MAAA,EAAA,WAAA,MAAA,EAAA,WAAA,MAAA,CAAA,CAAA,IAAA,EA0FI,CA1FJ,EAAA,MAAA,EA0Fe,EA1Ff,EAAA,MAAA,EA0F2B,EA1F3B,CAAA,EA0FgC,cA1FhC,CA0F+C,CA1F/C,EA0FkD,EA1FlD,EA0FsD,EA1FtD,CAAA;;;;;;AAEwB;;;;;;;;;;;;;AAcP,iBA8FL,WA9FK,CAAA,WAAA,MAAA,EAAA,WAAA,MAAA,CAAA,CAAA,MAAA,EA+FX,EA/FW,EAAA,MAAA,EAgGX,EAhGW,CAAA,EAAA,CAAA,UAiGP,iBAjGO,GAAA,MAAA,CAAA,CAAA,IAAA,EAiG2B,CAjG3B,EAAA,GAiGiC,cAjGjC,CAiGgD,CAjGhD,EAiGmD,EAjGnD,EAiGuD,EAjGvD,CAAA"}

package/dist/swap-indices.d.ts

@@ -1,3 +1,61 @@
-import "./iterable-container-F9CDF7ym.js";
-import { swapIndices } from "./swap-indices-DWsQg1W8.js";
-export { swapIndices };
+import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
+import { Join } from "type-fest";
+
+//#region src/swap-indices.d.ts
+
+/**
+ * @see https://github.com/sindresorhus/type-fest/blob/main/source/is-equal.d.ts
+ */
+type isEqual<A, B> = (<G>() => G extends A ? 1 : 2) extends (<G>() => G extends B ? 1 : 2) ? true : false;
+type Difference<A extends number, B extends number> = TupleOfLength<A> extends [...infer U, ...TupleOfLength<B>] ? U['length'] : never;
+type isLessThan<A extends number, B extends number> = isEqual<A, B> extends true ? false : 0 extends A ? true : 0 extends B ? false : isLessThan<Difference<A, 1>, Difference<B, 1>>;
+type TupleOfLength<L extends number, T extends IterableContainer = []> = T['length'] extends L ? T : TupleOfLength<L, [...T, unknown]>;
+type IsNonNegative<T extends number> = number extends T ? false : `${T}` extends `-${string}` ? false : true;
+type CharactersTuple<T extends string> = string extends T ? Array<string> : T extends `${infer C}${infer R}` ? [C, ...CharactersTuple<R>] : [];
+type SwapArrayInternal<T extends IterableContainer, Index1 extends number, Index2 extends number, Position extends ReadonlyArray<unknown> = [], Original extends IterableContainer = T> = T extends readonly [infer AtPosition, ...infer Rest] ? [Position['length'] extends Index1 ? Original[Index2] : Position['length'] extends Index2 ? Original[Index1] : AtPosition, ...SwapArrayInternal<Rest, Index1, Index2, [unknown, ...Position], Original>] : T;
+type SwapString<T extends string, K1 extends number, K2 extends number> = Join<SwapArray<CharactersTuple<T>, K1, K2>, ''>;
+type SwapArray<T extends IterableContainer, K1 extends number, K2 extends number> = IsNonNegative<K1> extends false ? Array<T[number]> : IsNonNegative<K2> extends false ? Array<T[number]> : isLessThan<K1, T['length']> extends false ? T : isLessThan<K2, T['length']> extends false ? T : SwapArrayInternal<T, K1, K2>;
+type SwappedIndices<T extends IterableContainer | string, K1 extends number, K2 extends number> = T extends string ? SwapString<T, K1, K2> : T extends IterableContainer ? SwapArray<T, K1, K2> : never;
+/**
+ * Swaps the positions of two elements in an array or string at the provided indices.
+ *
+ * Negative indices are supported and would be treated as an offset from the end of the array. The resulting type thought would be less strict than when using positive indices.
+ *
+ * If either index is out of bounds the result would be a shallow copy of the input, as-is.
+ *
+ * @param data - The item to be manipulated. This can be an array, or a string.
+ * @param index1 - The first index.
+ * @param index2 - The second index.
+ * @returns Returns the manipulated array or string.
+ * @signature
+ *   swapIndices(data, index1, index2)
+ * @example
+ *   swapIndices(['a', 'b', 'c'], 0, 1) // => ['b', 'a', 'c']
+ *   swapIndices(['a', 'b', 'c'], 1, -1) // => ['a', 'c', 'b']
+ *   swapIndices('abc', 0, 1) // => 'bac'
+ * @dataFirst
+ * @category Array
+ */
+declare function swapIndices<T extends IterableContainer | string, K1 extends number, K2 extends number>(data: T, index1: K1, index2: K2): SwappedIndices<T, K1, K2>;
+/**
+ * Swaps the positions of two elements in an array or string at the provided indices.
+ *
+ * Negative indices are supported and would be treated as an offset from the end of the array. The resulting type thought would be less strict than when using positive indices.
+ *
+ * If either index is out of bounds the result would be a shallow copy of the input, as-is.
+ *
+ * @param index1 - The first index.
+ * @param index2 - The second index.
+ * @returns Returns the manipulated array or string.
+ * @signature
+ *   swapIndices(index1, index2)(data)
+ * @example
+ *   swapIndices(0, 1)(['a', 'b', 'c']) // => ['b', 'a', 'c']
+ *   swapIndices(0, -1)('abc') // => 'cba'
+ * @dataLast
+ * @category Array
+ */
+declare function swapIndices<K1 extends number, K2 extends number>(index1: K1, index2: K2): <T extends IterableContainer | string>(data: T) => SwappedIndices<T, K1, K2>;
+//#endregion
+export { swapIndices };
+//# sourceMappingURL=swap-indices.d.ts.map

package/dist/swap-indices.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"swap-indices.d.ts","names":[],"sources":["../src/swap-indices.ts"],"sourcesContent":[],"mappings":";;;;;;;AAE6E;KAOxE,OACS,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,CAAA,CAAA,CAAA,CAAA,GAAA,GAAA,CAAA,SAAU,CAAV,GAAA,CAAA,GAAA,CAAA,CAAA,UAAA,CAAA,CAAA,CAAA,GAAA,GAAsC,CAAtC,SAAgD,CAAhD,GAAA,CAAA,GAAA,CAAA,IAAA,IAAA,GAAA,KAAA;KAIT,UAJmB,CAAA,UAAA,MAAA,EAAA,UAAA,MAAA,CAAA,GAKpB,aALoB,CAKN,CALM,CAAA,SAAA,CAAA,GAAA,KAAA,EAAA,EAAA,GAKqB,aALrB,CAKmC,CALnC,CAAA,CAAA,GAMlB,CANkB,CAAA,QAAA,CAAA,GAAA,KAAA;KASnB,UAT+C,CAAA,UAAA,MAAA,EAAA,UAAA,MAAA,CAAA,GAUhD,OAVgD,CAUxC,CAVwC,EAUrC,CAVqC,CAAA,SAAA,IAAA,GAAA,KAAA,GAAA,CAAA,SAYpC,CAZoC,GAAA,IAAA,GAAA,CAAA,SAclC,CAdkC,GAAA,KAAA,GAgB1C,UAhB0C,CAgB/B,UAhB+B,CAgBpB,CAhBoB,EAAA,CAAA,CAAA,EAgBb,UAhBa,CAgBF,CAhBE,EAAA,CAAA,CAAA,CAAA;KAkB/C,aAlByD,CAAA,UAAA,MAAA,EAAA,UAoBlD,iBApBkD,GAAA,EAAA,CAAA,GAqB1D,CArB0D,CAAA,QAAA,CAAA,SAqBtC,CArBsC,GAqBlC,CArBkC,GAqB9B,aArB8B,CAqBhB,CArBgB,EAAA,CAAA,GAqBT,CArBS,EAAA,OAAA,CAAA,CAAA;KAuBzD,aAvB0D,CAAA,UAAA,MAAA,CAAA,GAAA,MAAA,SAuBT,CAvBS,GAAA,KAAA,GAAA,GAyBxD,CAzBwD,EAAA,SAAA,IAAA,MAAA,EAAA,GAAA,KAAA,GAAA,IAAA;AAAA,KA6B1D,eAzBU,CAAA,UAAA,MAAA,CAAA,GAAA,MAAA,SAyByC,CAzBzC,GA0BX,KA1BW,CAAA,MAAA,CAAA,GA2BX,CA3BW,SAAA,GAAA,KAAA,EAAA,GAAA,KAAA,EAAA,EAAA,GAAA,CA4BR,CA5BQ,EAAA,GA4BF,eA5BE,CA4Bc,CA5Bd,CAAA,CAAA,GAAA,EAAA;KA+BV,iBA9Ba,CAAA,UA+BN,iBA/BM,EAAA,eAAA,MAAA,EAAA,eAAA,MAAA,EAAA,iBAkCC,aAlCD,CAAA,OAAA,CAAA,GAAA,EAAA,EAAA,iBAmCC,iBAnCD,GAmCqB,CAnCrB,CAAA,GAoCd,CApCc,SAAA,SAAA,CAAA,KAAA,WAAA,EAAA,GAAA,KAAA,KAAA,CAAA,GAAA,CAsCZ,QAtCF,CAAA,QAAA,CAAA,SAsC6B,MAtC7B,GAuCM,QAvCN,CAuCe,MAvCf,CAAA,GAwCM,QAxCN,CAAA,QAAA,CAAA,SAwCiC,MAxCjC,GAyCQ,QAzCR,CAyCiB,MAzCjB,CAAA,GAAA,UAAA,EAAuD,GA2ClD,iBA3CkD,CA4CnD,IA5CmD,EA6CnD,MA7CmD,EA8CnD,MA9CmD,EAAA,CAAd,OAAA,EACvC,GA8Ce,QA9Cf,CAAC,EA+CC,QA/CD,CAAA,CAAA,GAkDH,CA/CC;KAiDA,UAhDO,CAAA,UAAA,MAAA,EAAA,WAAA,MAAA,EAAA,WAAA,MAAA,CAAA,GAgD8D,IAhD9D,CAiDV,SAjDU,CAiDA,eAjDA,CAiDgB,CAjDhB,CAAA,EAiDoB,EAjDpB,EAiDwB,EAjDxB,CAAA,EAAA,EAAA,CAAA;KAqDP,SArDU,CAAA,UAsDH,iBAtDG,EAAA,WAAA,MAAA,EAAA,WAAA,MAAA,CAAA,GAgEX,aAhEW,CAgEG,EAhEH,CAAA,SAAA,KAAA,GAiET,KAjES,CAiEH,CAjEG,CAAA,MAAA,CAAA,CAAA,GAkET,aAlES,CAkEK,EAlEL,CAAA,SAAA,KAAA,GAmEP,KAnEO,CAmED,CAnEC,CAAA,MAAA,CAAA,CAAA,GAsET,UAtES,CAsEE,EAtEF,EAsEM,CAtEN,CAAA,QAAA,CAAA,CAAA,SAAA,KAAA,GAuEL,CAvEK,GAwEL,UAxEK,CAwEM,EAxEN,EAwEU,CAxEV,CAAA,QAAA,CAAA,CAAA,SAAA,KAAA,GAyEH,CAzEG,GA0EH,iBA1EG,CA0Ee,CA1Ef,EA0EkB,EA1ElB,EA0EsB,EA1EtB,CAAA;KA4EV,cA5ED,CAAA,UA6EQ,iBA7ER,GAAA,MAAA,EAAA,WAAA,MAAA,EAAA,WAAA,MAAA,CAAA,GAgFA,CAhFA,SAAA,MAAA,GAiFA,UAjFA,CAiFW,CAjFX,EAiFc,EAjFd,EAiFkB,EAjFlB,CAAA,GAkFA,CAlFA,SAkFU,iBAlFV,GAmFE,SAnFF,CAmFY,CAnFZ,EAmFe,EAnFf,EAmFmB,EAnFnB,CAAA,GAAA,KAAA;;;;;;;;;AAMgB;;;;;;;;;AAKyB;AAIrC;;AAKJ,iBAsFY,WAtFZ,CAAA,UAuFQ,iBAvFR,GAAA,MAAA,EAAA,WAAA,MAAA,EAAA,WAAA,MAAA,CAAA,CAAA,IAAA,EA0FI,CA1FJ,EAAA,MAAA,EA0Fe,EA1Ff,EAAA,MAAA,EA0F2B,EA1F3B,CAAA,EA0FgC,cA1FhC,CA0F+C,CA1F/C,EA0FkD,EA1FlD,EA0FsD,EA1FtD,CAAA;;;;;;AAEwB;;;;;;;;;;;;;AAcP,iBA8FL,WA9FK,CAAA,WAAA,MAAA,EAAA,WAAA,MAAA,CAAA,CAAA,MAAA,EA+FX,EA/FW,EAAA,MAAA,EAgGX,EAhGW,CAAA,EAAA,CAAA,UAiGP,iBAjGO,GAAA,MAAA,CAAA,CAAA,IAAA,EAiG2B,CAjG3B,EAAA,GAiGiC,cAjGjC,CAiGgD,CAjGhD,EAiGmD,EAjGnD,EAiGuD,EAjGvD,CAAA"}

package/dist/swap-indices.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{swapIndices as e}from"./swap-indices-inhV1_Nb.js";export{e as swapIndices};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t,n){return typeof e==`string`?r([...e],t,n).join(``):r(e,t,n)}function r(e,t,n){let r=[...e];if(Number.isNaN(t)||Number.isNaN(n))return r;let i=t<0?e.length+t:t,a=n<0?e.length+n:n;return i<0||i>e.length||a<0||a>e.length?r:(r[i]=e[a],r[a]=e[i],r)}export{t as swapIndices};
+//# sourceMappingURL=swap-indices.js.map

package/dist/swap-indices.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"swap-indices.js","names":[],"sources":["../src/swap-indices.ts"],"sourcesContent":["import type { Join } from 'type-fest';\n\nimport type { IterableContainer } from './internal/types/iterable-container';\n\nimport { curry } from './curry';\n\n/**\n * @see https://github.com/sindresorhus/type-fest/blob/main/source/is-equal.d.ts\n */\ntype isEqual<A, B>\n  = (<G>() => G extends A ? 1 : 2) extends <G>() => G extends B ? 1 : 2\n    ? true\n    : false;\n\ntype Difference<A extends number, B extends number>\n  = TupleOfLength<A> extends [...infer U, ...TupleOfLength<B>]\n    ? U['length']\n    : never;\n\ntype isLessThan<A extends number, B extends number>\n  = isEqual<A, B> extends true\n    ? false\n    : 0 extends A\n      ? true\n      : 0 extends B\n        ? false\n        : isLessThan<Difference<A, 1>, Difference<B, 1>>;\n\ntype TupleOfLength<\n  L extends number,\n  T extends IterableContainer = [],\n> = T['length'] extends L ? T : TupleOfLength<L, [...T, unknown]>;\n\ntype IsNonNegative<T extends number> = number extends T\n  ? false\n  : `${T}` extends `-${string}`\n    ? false\n    : true;\n\ntype CharactersTuple<T extends string> = string extends T\n  ? Array<string>\n  : T extends `${infer C}${infer R}`\n    ? [C, ...CharactersTuple<R>]\n    : [];\n\ntype SwapArrayInternal<\n  T extends IterableContainer,\n  Index1 extends number,\n  Index2 extends number,\n  Position extends ReadonlyArray<unknown> = [],\n  Original extends IterableContainer = T,\n> = T extends readonly [infer AtPosition, ...infer Rest]\n  ? [\n      Position['length'] extends Index1\n        ? Original[Index2]\n        : Position['length'] extends Index2\n          ? Original[Index1]\n          : AtPosition,\n      ...SwapArrayInternal<\n        Rest,\n        Index1,\n        Index2,\n        [unknown, ...Position],\n        Original\n      >,\n    ]\n  : T;\n\ntype SwapString<T extends string, K1 extends number, K2 extends number> = Join<\n  SwapArray<CharactersTuple<T>, K1, K2>,\n  ''\n>;\n\ntype SwapArray<\n  T extends IterableContainer,\n  K1 extends number,\n  K2 extends number,\n>\n  // TODO: Because of limitations on the typescript version used, we\n  // can't build a proper Absolute number type so we can't implement proper\n  // typing for negative indices and have to opt for a less- strict type\n  // instead.\n  // Check out the history for the PR that introduced this TODO to see how it\n  // could be implemented.\n  = IsNonNegative<K1> extends false\n    ? Array<T[number]>\n    : IsNonNegative<K2> extends false\n      ? Array<T[number]>\n      : // If the indices are not within the input arrays range the result would be\n    // trivially the same as the input array.\n      isLessThan<K1, T['length']> extends false\n        ? T\n        : isLessThan<K2, T['length']> extends false\n          ? T\n          : SwapArrayInternal<T, K1, K2>;\n\ntype SwappedIndices<\n  T extends IterableContainer | string,\n  K1 extends number,\n  K2 extends number,\n> = T extends string\n  ? SwapString<T, K1, K2>\n  : T extends IterableContainer\n    ? SwapArray<T, K1, K2>\n    : never;\n\n/**\n * Swaps the positions of two elements in an array or string at the provided indices.\n *\n * Negative indices are supported and would be treated as an offset from the end of the array. The resulting type thought would be less strict than when using positive indices.\n *\n * If either index is out of bounds the result would be a shallow copy of the input, as-is.\n *\n * @param data - The item to be manipulated. This can be an array, or a string.\n * @param index1 - The first index.\n * @param index2 - The second index.\n * @returns Returns the manipulated array or string.\n * @signature\n *   swapIndices(data, index1, index2)\n * @example\n *   swapIndices(['a', 'b', 'c'], 0, 1) // => ['b', 'a', 'c']\n *   swapIndices(['a', 'b', 'c'], 1, -1) // => ['a', 'c', 'b']\n *   swapIndices('abc', 0, 1) // => 'bac'\n * @dataFirst\n * @category Array\n */\nexport function swapIndices<\n  T extends IterableContainer | string,\n  K1 extends number,\n  K2 extends number,\n>(data: T, index1: K1, index2: K2): SwappedIndices<T, K1, K2>;\n\n/**\n * Swaps the positions of two elements in an array or string at the provided indices.\n *\n * Negative indices are supported and would be treated as an offset from the end of the array. The resulting type thought would be less strict than when using positive indices.\n *\n * If either index is out of bounds the result would be a shallow copy of the input, as-is.\n *\n * @param index1 - The first index.\n * @param index2 - The second index.\n * @returns Returns the manipulated array or string.\n * @signature\n *   swapIndices(index1, index2)(data)\n * @example\n *   swapIndices(0, 1)(['a', 'b', 'c']) // => ['b', 'a', 'c']\n *   swapIndices(0, -1)('abc') // => 'cba'\n * @dataLast\n * @category Array\n */\nexport function swapIndices<K1 extends number, K2 extends number>(\n  index1: K1,\n  index2: K2,\n): <T extends IterableContainer | string>(data: T) => SwappedIndices<T, K1, K2>;\n\nexport function swapIndices(...args: ReadonlyArray<unknown>): unknown {\n  return curry(swapIndicesImplementation, args);\n}\n\nfunction swapIndicesImplementation(\n  data: IterableContainer | string,\n  index1: number,\n  index2: number,\n): unknown {\n  return typeof data === 'string'\n    ? swapArray([...data], index1, index2).join('')\n    : swapArray(data, index1, index2);\n}\n\nfunction swapArray(\n  data: ReadonlyArray<unknown>,\n  index1: number,\n  index2: number,\n): Array<unknown> {\n  const result = [...data];\n\n  if (Number.isNaN(index1) || Number.isNaN(index2)) {\n    return result;\n  }\n\n  const positiveIndexA = index1 < 0 ? data.length + index1 : index1;\n  const positiveIndexB = index2 < 0 ? data.length + index2 : index2;\n\n  if (positiveIndexA < 0 || positiveIndexA > data.length) {\n    return result;\n  }\n\n  if (positiveIndexB < 0 || positiveIndexB > data.length) {\n    return result;\n  }\n\n  result[positiveIndexA] = data[positiveIndexB];\n  result[positiveIndexB] = data[positiveIndexA];\n\n  return result;\n}\n"],"mappings":"wCA2JA,SAAgB,EAAY,GAAG,EAAuC,CACpE,OAAO,EAAM,EAA2B,EAAK,CAG/C,SAAS,EACP,EACA,EACA,EACS,CACT,OAAO,OAAO,GAAS,SACnB,EAAU,CAAC,GAAG,EAAK,CAAE,EAAQ,EAAO,CAAC,KAAK,GAAG,CAC7C,EAAU,EAAM,EAAQ,EAAO,CAGrC,SAAS,EACP,EACA,EACA,EACgB,CAChB,IAAM,EAAS,CAAC,GAAG,EAAK,CAExB,GAAI,OAAO,MAAM,EAAO,EAAI,OAAO,MAAM,EAAO,CAC9C,OAAO,EAGT,IAAM,EAAiB,EAAS,EAAI,EAAK,OAAS,EAAS,EACrD,EAAiB,EAAS,EAAI,EAAK,OAAS,EAAS,EAa3D,OAXI,EAAiB,GAAK,EAAiB,EAAK,QAI5C,EAAiB,GAAK,EAAiB,EAAK,OACvC,GAGT,EAAO,GAAkB,EAAK,GAC9B,EAAO,GAAkB,EAAK,GAEvB"}

package/dist/swap-props.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./swap-props-zfImAv9P.cjs`);exports.swapProps=e.swapProps;
+const e=require(`./curry-BsY0Z8jH.cjs`);function t(...t){return e.t(n,t)}function n(e,t,n){let{[t]:r,[n]:i}=e;return{...e,[t]:i,[n]:r}}exports.swapProps=t;

package/dist/swap-props.d.cts

@@ -1,2 +1,34 @@
-import { swapProps } from "./swap-props-BRHZP2h5.cjs";
-export { swapProps };
+//#region src/swap-props.d.ts
+type SwappedProps<T, K1 extends keyof T, K2 extends keyof T> = { [K in keyof T]: T[K1 extends K ? K2 : K2 extends K ? K1 : K] };
+/**
+ * Swaps the positions of two properties in an object based on the provided keys.
+ *
+ * @param data - The object to be manipulated.
+ * @param key1 - The first property key.
+ * @param key2 - The second property key.
+ * @returns Returns the manipulated object.
+ * @signature
+ *   swap(data, key1, key2)
+ * @example
+ *   swap({a: 1, b: 2, c: 3}, 'a', 'b') // => {a: 2, b: 1, c: 3}
+ * @dataFirst
+ * @category Object
+ */
+declare function swapProps<T extends object, K1 extends keyof T, K2 extends keyof T>(data: T, key1: K1, key2: K2): SwappedProps<T, K1, K2>;
+/**
+ * Swaps the positions of two properties in an object based on the provided keys.
+ *
+ * @param key1 - The first property key.
+ * @param key2 - The second property key.
+ * @returns Returns the manipulated object.
+ * @signature
+ *   swap(key1, key2)(data)
+ * @example
+ *   swap('a', 'b')({a: 1, b: 2, c: 3}) // => {a: 2, b: 1, c: 3}
+ * @dataLast
+ * @category Object
+ */
+declare function swapProps<T extends object, K1 extends keyof T, K2 extends keyof T>(key1: K1, key2: K2): (data: T) => SwappedProps<T, K1, K2>;
+//#endregion
+export { swapProps };
+//# sourceMappingURL=swap-props.d.cts.map

package/dist/swap-props.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"swap-props.d.cts","names":[],"sources":["../src/swap-props.ts"],"sourcesContent":[],"mappings":";KAEK,iCAAiC,oBAAoB,aAArD,MACS,CADT,GACa,CADD,CACG,EADH,SACc,CADd,GACkB,EADlB,GACuB,EADvB,SACkC,CADlC,GACsC,EADtC,GAC2C,CAD3C,CAAA,EAAqB;;;;;;;;;;;;AAkBtC;;;AAIQ,iBAJQ,SAIR,CAAA,UAAA,MAAA,EAAA,WAAA,MAFW,CAEX,EAAA,WAAA,MADW,CACX,CAAA,CAAA,IAAA,EAAA,CAAA,EAAA,IAAA,EAAS,EAAT,EAAA,IAAA,EAAmB,EAAnB,CAAA,EAAwB,YAAxB,CAAqC,CAArC,EAAwC,EAAxC,EAA4C,EAA5C,CAAA;;;;;;;;AAeR;;;;;;AAIiD,iBAJjC,SAIiC,CAAA,UAAA,MAAA,EAAA,WAAA,MAF9B,CAE8B,EAAA,WAAA,MAD9B,CAC8B,CAAA,CAAA,IAAA,EAAzC,EAAyC,EAAA,IAAA,EAA/B,EAA+B,CAAA,EAAA,CAAA,IAAA,EAAnB,CAAmB,EAAA,GAAb,YAAa,CAAA,CAAA,EAAG,EAAH,EAAO,EAAP,CAAA"}

package/dist/swap-props.d.ts

@@ -1,2 +1,34 @@
-import { swapProps } from "./swap-props-pgUf_Wxo.js";
-export { swapProps };
+//#region src/swap-props.d.ts
+type SwappedProps<T, K1 extends keyof T, K2 extends keyof T> = { [K in keyof T]: T[K1 extends K ? K2 : K2 extends K ? K1 : K] };
+/**
+ * Swaps the positions of two properties in an object based on the provided keys.
+ *
+ * @param data - The object to be manipulated.
+ * @param key1 - The first property key.
+ * @param key2 - The second property key.
+ * @returns Returns the manipulated object.
+ * @signature
+ *   swap(data, key1, key2)
+ * @example
+ *   swap({a: 1, b: 2, c: 3}, 'a', 'b') // => {a: 2, b: 1, c: 3}
+ * @dataFirst
+ * @category Object
+ */
+declare function swapProps<T extends object, K1 extends keyof T, K2 extends keyof T>(data: T, key1: K1, key2: K2): SwappedProps<T, K1, K2>;
+/**
+ * Swaps the positions of two properties in an object based on the provided keys.
+ *
+ * @param key1 - The first property key.
+ * @param key2 - The second property key.
+ * @returns Returns the manipulated object.
+ * @signature
+ *   swap(key1, key2)(data)
+ * @example
+ *   swap('a', 'b')({a: 1, b: 2, c: 3}) // => {a: 2, b: 1, c: 3}
+ * @dataLast
+ * @category Object
+ */
+declare function swapProps<T extends object, K1 extends keyof T, K2 extends keyof T>(key1: K1, key2: K2): (data: T) => SwappedProps<T, K1, K2>;
+//#endregion
+export { swapProps };
+//# sourceMappingURL=swap-props.d.ts.map

package/dist/swap-props.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"swap-props.d.ts","names":[],"sources":["../src/swap-props.ts"],"sourcesContent":[],"mappings":";KAEK,iCAAiC,oBAAoB,aAArD,MACS,CADT,GACa,CADD,CACG,EADH,SACc,CADd,GACkB,EADlB,GACuB,EADvB,SACkC,CADlC,GACsC,EADtC,GAC2C,CAD3C,CAAA,EAAqB;;;;;;;;;;;;AAkBtC;;;AAIQ,iBAJQ,SAIR,CAAA,UAAA,MAAA,EAAA,WAAA,MAFW,CAEX,EAAA,WAAA,MADW,CACX,CAAA,CAAA,IAAA,EAAA,CAAA,EAAA,IAAA,EAAS,EAAT,EAAA,IAAA,EAAmB,EAAnB,CAAA,EAAwB,YAAxB,CAAqC,CAArC,EAAwC,EAAxC,EAA4C,EAA5C,CAAA;;;;;;;;AAeR;;;;;;AAIiD,iBAJjC,SAIiC,CAAA,UAAA,MAAA,EAAA,WAAA,MAF9B,CAE8B,EAAA,WAAA,MAD9B,CAC8B,CAAA,CAAA,IAAA,EAAzC,EAAyC,EAAA,IAAA,EAA/B,EAA+B,CAAA,EAAA,CAAA,IAAA,EAAnB,CAAmB,EAAA,GAAb,YAAa,CAAA,CAAA,EAAG,EAAH,EAAO,EAAP,CAAA"}

package/dist/swap-props.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{swapProps as e}from"./swap-props-mp8Z9OU_.js";export{e as swapProps};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t,n){let{[t]:r,[n]:i}=e;return{...e,[t]:i,[n]:r}}export{t as swapProps};
+//# sourceMappingURL=swap-props.js.map

package/dist/swap-props.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"swap-props.js","names":[],"sources":["../src/swap-props.ts"],"sourcesContent":["import { curry } from './curry';\n\ntype SwappedProps<T, K1 extends keyof T, K2 extends keyof T> = {\n  [K in keyof T]: T[K1 extends K ? K2 : K2 extends K ? K1 : K];\n};\n\n/**\n * Swaps the positions of two properties in an object based on the provided keys.\n *\n * @param data - The object to be manipulated.\n * @param key1 - The first property key.\n * @param key2 - The second property key.\n * @returns Returns the manipulated object.\n * @signature\n *   swap(data, key1, key2)\n * @example\n *   swap({a: 1, b: 2, c: 3}, 'a', 'b') // => {a: 2, b: 1, c: 3}\n * @dataFirst\n * @category Object\n */\nexport function swapProps<\n  T extends object,\n  K1 extends keyof T,\n  K2 extends keyof T,\n>(data: T, key1: K1, key2: K2): SwappedProps<T, K1, K2>;\n\n/**\n * Swaps the positions of two properties in an object based on the provided keys.\n *\n * @param key1 - The first property key.\n * @param key2 - The second property key.\n * @returns Returns the manipulated object.\n * @signature\n *   swap(key1, key2)(data)\n * @example\n *   swap('a', 'b')({a: 1, b: 2, c: 3}) // => {a: 2, b: 1, c: 3}\n * @dataLast\n * @category Object\n */\nexport function swapProps<\n  T extends object,\n  K1 extends keyof T,\n  K2 extends keyof T,\n>(key1: K1, key2: K2): (data: T) => SwappedProps<T, K1, K2>;\n\nexport function swapProps(...args: ReadonlyArray<unknown>): unknown {\n  return curry(swapPropsImplementation, args);\n}\n\nfunction swapPropsImplementation<\n  T extends object,\n  K1 extends keyof T,\n  K2 extends keyof T,\n>(\n  obj: T,\n  key1: K1,\n  key2: K2,\n): {\n  [K in PropertyKey]: unknown;\n} {\n  const { [key1]: value1, [key2]: value2 } = obj;\n  return {\n    ...obj,\n    [key1]: value2,\n    [key2]: value1,\n  };\n}\n"],"mappings":"wCA6CA,SAAgB,EAAU,GAAG,EAAuC,CAClE,OAAO,EAAM,EAAyB,EAAK,CAG7C,SAAS,EAKP,EACA,EACA,EAGA,CACA,GAAM,EAAG,GAAO,GAAS,GAAO,GAAW,EAC3C,MAAO,CACL,GAAG,GACF,GAAO,GACP,GAAO,EACT"}

package/dist/take-first-by.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`),require(`./curry-order-rules-UcuuWkKd.cjs`),require(`./has-at-least-D-ahiJB6.cjs`),require(`./swap-in-place-CJrU2n1_.cjs`),require(`./heap-CpdbyWAN.cjs`);const e=require(`./take-first-by-DpgN2xxt.cjs`);exports.takeFirstBy=e.takeFirstBy;
+const e=require(`./curry-order-rules-ClqHrs8_.cjs`),t=require(`./heap-DWDhbxfx.cjs`);function n(...t){return e.n(r,t)}function r(e,n,r){if(r<=0)return[];if(r>=e.length)return[...e];let i=e.slice(0,r);t.n(i,n);let a=e.slice(r);for(let e of a)t.t(i,n,e);return i}exports.takeFirstBy=n;