@vinicunca/perkakas 1.7.1 → 1.8.0

package/dist/range.d.ts

@@ -1,25 +1,2 @@
-/**
- * Returns a list of numbers from `start` (inclusive) to `end` (exclusive).
- *
- * @param start - The start number.
- * @param end - The end number.
- * @signature range(start, end)
- * @example
- *    P.range(1, 5) // => [1, 2, 3, 4]
- * @dataFirst
- * @category Array
- */
-declare function range(start: number, end: number): Array<number>;
-/**
- * Returns a list of numbers from `start` (inclusive) to `end` (exclusive).
- *
- * @param end - The end number.
- * @signature range(end)(start)
- * @example
- *    P.range(5)(1) // => [1, 2, 3, 4]
- * @dataFirst
- * @category Array
- */
-declare function range(end: number): (start: number) => Array<number>;
-
-export { range };
+import { range } from "./range-BNpqskPd.js";
+export { range };

package/dist/range.js

@@ -1 +1 @@
-import{a}from"./chunk-XWQ3IM2J.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as range};
+import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{range as e}from"./range-BtCOvN_L.js";export{e as range};

package/dist/rank-by-B5nxlwg6.d.cts

@@ -0,0 +1,45 @@
+import { NonEmptyArray } from "./non-empty-array-D3ZRHApS.cjs";
+import { OrderRule } from "./curry-order-rules-1zjlAgqa.cjs";
+
+//#region src/rank-by.d.ts
+
+/**
+ * Calculates the rank of an item in an array based on `rules`. The rank is the position where the item would appear in the sorted array. This function provides an efficient way to determine the rank in *O(n)* time, compared to *O(nlogn)* for the equivalent `sortedIndex(sortBy(data, ...rules), item)`.
+ *
+ * @param data - The input array.
+ * @param item - The item whose rank is to be determined.
+ * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
+ * @returns The rank of the item in the sorted array in the range [0..data.length].
+ * @signature
+ *   P.rankBy(data, item, ...rules)
+ * @example
+ *   const DATA = [{ a: 5 }, { a: 1 }, { a: 3 }] as const;
+ *   P.rankBy(DATA, 0, P.prop('a')) // => 0
+ *   P.rankBy(DATA, 1, P.prop('a')) // => 1
+ *   P.rankBy(DATA, 2, P.prop('a')) // => 1
+ *   P.rankBy(DATA, 3, P.prop('a')) // => 2
+ * @dataFirst
+ * @category Array
+ */
+declare function rankBy<T>(data: ReadonlyArray<T>, item: T, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): number;
+/**
+ * Calculates the rank of an item in an array based on `rules`. The rank is the position where the item would appear in the sorted array. This function provides an efficient way to determine the rank in *O(n)* time, compared to *O(nlogn)* for the equivalent `sortedIndex(sortBy(data, ...rules), item)`.
+ *
+ * @param item - The item whose rank is to be determined.
+ * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
+ * @returns The rank of the item in the sorted array in the range [0..data.length].
+ * @signature
+ *   P.rankBy(item, ...rules)(data)
+ * @example
+ *   const DATA = [{ a: 5 }, { a: 1 }, { a: 3 }] as const;
+ *   P.pipe(DATA, P.rankBy(0, P.prop('a'))) // => 0
+ *   P.pipe(DATA, P.rankBy(1, P.prop('a'))) // => 1
+ *   P.pipe(DATA, P.rankBy(2, P.prop('a'))) // => 1
+ *   P.pipe(DATA, P.rankBy(3, P.prop('a'))) // => 2
+ * @dataLast
+ * @category Array
+ */
+declare function rankBy<T>(item: T, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): (data: ReadonlyArray<T>) => number;
+//#endregion
+export { rankBy };
+//# sourceMappingURL=rank-by-B5nxlwg6.d.cts.map

package/dist/rank-by-B5nxlwg6.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rank-by-B5nxlwg6.d.cts","names":[],"sources":["../src/rank-by.ts"],"sourcesContent":[],"mappings":";;;;;;;AA0BA;;;;;;;;;;AAuBA;;;;;;AAEY,iBAzBI,MAyBJ,CAAA,CAAA,CAAA,CAAA,IAAA,EAxBJ,aAwBI,CAxBU,CAwBV,CAAA,EAAA,IAAA,EAvBJ,CAuBI,EAAA,GAAA,KAAA,EAtBA,QAsBA,CAtBS,aAsBT,CAtBuB,SAsBvB,CAtBiC,CAsBjC,CAAA,CAAA,CAAA,CAAA,EAAA,MAAA;;;;;;;;;;;;;;;;;;iBAFI,gBACR,aACI,SAAS,cAAc,UAAU,cACnC,cAAc"}

package/dist/rank-by-B778jLnu.cjs

@@ -0,0 +1 @@
+const e=require(`./curry-order-rules-UcuuWkKd.cjs`);function t(...t){return e.curryOrderRulesWithArgument(n,t)}function n(e,t,n){let r=0;for(let i of e)t(n,i)>0&&(r+=1);return r}Object.defineProperty(exports,`rankBy`,{enumerable:!0,get:function(){return t}});

package/dist/rank-by-D3jUXMA3.js

@@ -0,0 +1,2 @@
+import{curryOrderRulesWithArgument as e}from"./curry-order-rules-BuA7D1F4.js";function t(...t){return e(n,t)}function n(e,t,n){let r=0;for(let i of e)t(n,i)>0&&(r+=1);return r}export{t as rankBy};
+//# sourceMappingURL=rank-by-D3jUXMA3.js.map

package/dist/rank-by-D3jUXMA3.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rank-by-D3jUXMA3.js","names":[],"sources":["../src/rank-by.ts"],"sourcesContent":["import type { OrderRule } from './internal/curry-order-rules';\nimport type { CompareFunction } from './internal/types/compare-function';\nimport type { NonEmptyArray } from './internal/types/non-empty-array';\nimport {\n  curryOrderRulesWithArgument,\n\n} from './internal/curry-order-rules';\n\n/**\n * Calculates the rank of an item in an array based on `rules`. The rank is the position where the item would appear in the sorted array. This function provides an efficient way to determine the rank in *O(n)* time, compared to *O(nlogn)* for the equivalent `sortedIndex(sortBy(data, ...rules), item)`.\n *\n * @param data - The input array.\n * @param item - The item whose rank is to be determined.\n * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, \"desc\"]` for descending order.\n * @returns The rank of the item in the sorted array in the range [0..data.length].\n * @signature\n *   P.rankBy(data, item, ...rules)\n * @example\n *   const DATA = [{ a: 5 }, { a: 1 }, { a: 3 }] as const;\n *   P.rankBy(DATA, 0, P.prop('a')) // => 0\n *   P.rankBy(DATA, 1, P.prop('a')) // => 1\n *   P.rankBy(DATA, 2, P.prop('a')) // => 1\n *   P.rankBy(DATA, 3, P.prop('a')) // => 2\n * @dataFirst\n * @category Array\n */\nexport function rankBy<T>(\n  data: ReadonlyArray<T>,\n  item: T,\n  ...rules: Readonly<NonEmptyArray<OrderRule<T>>>\n): number;\n\n/**\n * Calculates the rank of an item in an array based on `rules`. The rank is the position where the item would appear in the sorted array. This function provides an efficient way to determine the rank in *O(n)* time, compared to *O(nlogn)* for the equivalent `sortedIndex(sortBy(data, ...rules), item)`.\n *\n * @param item - The item whose rank is to be determined.\n * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, \"desc\"]` for descending order.\n * @returns The rank of the item in the sorted array in the range [0..data.length].\n * @signature\n *   P.rankBy(item, ...rules)(data)\n * @example\n *   const DATA = [{ a: 5 }, { a: 1 }, { a: 3 }] as const;\n *   P.pipe(DATA, P.rankBy(0, P.prop('a'))) // => 0\n *   P.pipe(DATA, P.rankBy(1, P.prop('a'))) // => 1\n *   P.pipe(DATA, P.rankBy(2, P.prop('a'))) // => 1\n *   P.pipe(DATA, P.rankBy(3, P.prop('a'))) // => 2\n * @dataLast\n * @category Array\n */\nexport function rankBy<T>(\n  item: T,\n  ...rules: Readonly<NonEmptyArray<OrderRule<T>>>\n): (data: ReadonlyArray<T>) => number;\n\nexport function rankBy(...args: ReadonlyArray<unknown>): unknown {\n  return curryOrderRulesWithArgument(rankByImplementation, args);\n}\n\nfunction rankByImplementation<T>(\n  data: ReadonlyArray<T>,\n  compareFn: CompareFunction<T>,\n  targetItem: T,\n): number {\n  let rank = 0;\n  for (const item of data) {\n    if (compareFn(targetItem, item) > 0) {\n      // The rank of the item is equivalent to the number of items that would\n      // come before it if the array was sorted. We assume that the\n      rank += 1;\n    }\n  }\n  return rank;\n}\n"],"mappings":"8EAsDA,SAAgB,EAAO,GAAG,EAAuC,CAC/D,OAAO,EAA4B,EAAsB,EAAK,CAGhE,SAAS,EACP,EACA,EACA,EACQ,CACR,IAAI,EAAO,EACX,IAAK,IAAM,KAAQ,EACb,EAAU,EAAY,EAAK,CAAG,IAGhC,GAAQ,GAGZ,OAAO"}

package/dist/rank-by-urjGYBfY.d.ts

@@ -0,0 +1,45 @@
+import { NonEmptyArray } from "./non-empty-array-D3HWDPMt.js";
+import { OrderRule } from "./curry-order-rules-Cthu8rj4.js";
+
+//#region src/rank-by.d.ts
+
+/**
+ * Calculates the rank of an item in an array based on `rules`. The rank is the position where the item would appear in the sorted array. This function provides an efficient way to determine the rank in *O(n)* time, compared to *O(nlogn)* for the equivalent `sortedIndex(sortBy(data, ...rules), item)`.
+ *
+ * @param data - The input array.
+ * @param item - The item whose rank is to be determined.
+ * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
+ * @returns The rank of the item in the sorted array in the range [0..data.length].
+ * @signature
+ *   P.rankBy(data, item, ...rules)
+ * @example
+ *   const DATA = [{ a: 5 }, { a: 1 }, { a: 3 }] as const;
+ *   P.rankBy(DATA, 0, P.prop('a')) // => 0
+ *   P.rankBy(DATA, 1, P.prop('a')) // => 1
+ *   P.rankBy(DATA, 2, P.prop('a')) // => 1
+ *   P.rankBy(DATA, 3, P.prop('a')) // => 2
+ * @dataFirst
+ * @category Array
+ */
+declare function rankBy<T>(data: ReadonlyArray<T>, item: T, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): number;
+/**
+ * Calculates the rank of an item in an array based on `rules`. The rank is the position where the item would appear in the sorted array. This function provides an efficient way to determine the rank in *O(n)* time, compared to *O(nlogn)* for the equivalent `sortedIndex(sortBy(data, ...rules), item)`.
+ *
+ * @param item - The item whose rank is to be determined.
+ * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
+ * @returns The rank of the item in the sorted array in the range [0..data.length].
+ * @signature
+ *   P.rankBy(item, ...rules)(data)
+ * @example
+ *   const DATA = [{ a: 5 }, { a: 1 }, { a: 3 }] as const;
+ *   P.pipe(DATA, P.rankBy(0, P.prop('a'))) // => 0
+ *   P.pipe(DATA, P.rankBy(1, P.prop('a'))) // => 1
+ *   P.pipe(DATA, P.rankBy(2, P.prop('a'))) // => 1
+ *   P.pipe(DATA, P.rankBy(3, P.prop('a'))) // => 2
+ * @dataLast
+ * @category Array
+ */
+declare function rankBy<T>(item: T, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): (data: ReadonlyArray<T>) => number;
+//#endregion
+export { rankBy };
+//# sourceMappingURL=rank-by-urjGYBfY.d.ts.map

package/dist/rank-by-urjGYBfY.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rank-by-urjGYBfY.d.ts","names":[],"sources":["../src/rank-by.ts"],"sourcesContent":[],"mappings":";;;;;;;AA0BA;;;;;;;;;;AAuBA;;;;;;AAEY,iBAzBI,MAyBJ,CAAA,CAAA,CAAA,CAAA,IAAA,EAxBJ,aAwBI,CAxBU,CAwBV,CAAA,EAAA,IAAA,EAvBJ,CAuBI,EAAA,GAAA,KAAA,EAtBA,QAsBA,CAtBS,aAsBT,CAtBuB,SAsBvB,CAtBiC,CAsBjC,CAAA,CAAA,CAAA,CAAA,EAAA,MAAA;;;;;;;;;;;;;;;;;;iBAFI,gBACR,aACI,SAAS,cAAc,UAAU,cACnC,cAAc"}

package/dist/rank-by.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkZLNSRDW7cjs = require('./chunk-ZLNSRDW7.cjs');require('./chunk-EROXO3T4.cjs');require('./chunk-MBGSSEZN.cjs');exports.rankBy = _chunkZLNSRDW7cjs.a;
+require(`./curry-order-rules-UcuuWkKd.cjs`);const e=require(`./rank-by-B778jLnu.cjs`);exports.rankBy=e.rankBy;

package/dist/rank-by.d.cts

@@ -1,42 +1,4 @@
-import { O as OrderRule } from './curry-order-rules-BKXCPBNx.cjs';
-import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.cjs';
-
-/**
- * Calculates the rank of an item in an array based on `rules`. The rank is the position where the item would appear in the sorted array. This function provides an efficient way to determine the rank in *O(n)* time, compared to *O(nlogn)* for the equivalent `sortedIndex(sortBy(data, ...rules), item)`.
- *
- * @param data - The input array.
- * @param item - The item whose rank is to be determined.
- * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
- * @returns The rank of the item in the sorted array in the range [0..data.length].
- * @signature
- *   P.rankBy(data, item, ...rules)
- * @example
- *   const DATA = [{ a: 5 }, { a: 1 }, { a: 3 }] as const;
- *   P.rankBy(DATA, 0, P.prop('a')) // => 0
- *   P.rankBy(DATA, 1, P.prop('a')) // => 1
- *   P.rankBy(DATA, 2, P.prop('a')) // => 1
- *   P.rankBy(DATA, 3, P.prop('a')) // => 2
- * @dataFirst
- * @category Array
- */
-declare function rankBy<T>(data: ReadonlyArray<T>, item: T, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): number;
-/**
- * Calculates the rank of an item in an array based on `rules`. The rank is the position where the item would appear in the sorted array. This function provides an efficient way to determine the rank in *O(n)* time, compared to *O(nlogn)* for the equivalent `sortedIndex(sortBy(data, ...rules), item)`.
- *
- * @param item - The item whose rank is to be determined.
- * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
- * @returns The rank of the item in the sorted array in the range [0..data.length].
- * @signature
- *   P.rankBy(item, ...rules)(data)
- * @example
- *   const DATA = [{ a: 5 }, { a: 1 }, { a: 3 }] as const;
- *   P.pipe(DATA, P.rankBy(0, P.prop('a'))) // => 0
- *   P.pipe(DATA, P.rankBy(1, P.prop('a'))) // => 1
- *   P.pipe(DATA, P.rankBy(2, P.prop('a'))) // => 1
- *   P.pipe(DATA, P.rankBy(3, P.prop('a'))) // => 2
- * @dataLast
- * @category Array
- */
-declare function rankBy<T>(item: T, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): (data: ReadonlyArray<T>) => number;
-
-export { rankBy };
+import "./non-empty-array-D3ZRHApS.cjs";
+import "./curry-order-rules-1zjlAgqa.cjs";
+import { rankBy } from "./rank-by-B5nxlwg6.cjs";
+export { rankBy };

package/dist/rank-by.d.ts

@@ -1,42 +1,4 @@
-import { O as OrderRule } from './curry-order-rules-BKXCPBNx.js';
-import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.js';
-
-/**
- * Calculates the rank of an item in an array based on `rules`. The rank is the position where the item would appear in the sorted array. This function provides an efficient way to determine the rank in *O(n)* time, compared to *O(nlogn)* for the equivalent `sortedIndex(sortBy(data, ...rules), item)`.
- *
- * @param data - The input array.
- * @param item - The item whose rank is to be determined.
- * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
- * @returns The rank of the item in the sorted array in the range [0..data.length].
- * @signature
- *   P.rankBy(data, item, ...rules)
- * @example
- *   const DATA = [{ a: 5 }, { a: 1 }, { a: 3 }] as const;
- *   P.rankBy(DATA, 0, P.prop('a')) // => 0
- *   P.rankBy(DATA, 1, P.prop('a')) // => 1
- *   P.rankBy(DATA, 2, P.prop('a')) // => 1
- *   P.rankBy(DATA, 3, P.prop('a')) // => 2
- * @dataFirst
- * @category Array
- */
-declare function rankBy<T>(data: ReadonlyArray<T>, item: T, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): number;
-/**
- * Calculates the rank of an item in an array based on `rules`. The rank is the position where the item would appear in the sorted array. This function provides an efficient way to determine the rank in *O(n)* time, compared to *O(nlogn)* for the equivalent `sortedIndex(sortBy(data, ...rules), item)`.
- *
- * @param item - The item whose rank is to be determined.
- * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
- * @returns The rank of the item in the sorted array in the range [0..data.length].
- * @signature
- *   P.rankBy(item, ...rules)(data)
- * @example
- *   const DATA = [{ a: 5 }, { a: 1 }, { a: 3 }] as const;
- *   P.pipe(DATA, P.rankBy(0, P.prop('a'))) // => 0
- *   P.pipe(DATA, P.rankBy(1, P.prop('a'))) // => 1
- *   P.pipe(DATA, P.rankBy(2, P.prop('a'))) // => 1
- *   P.pipe(DATA, P.rankBy(3, P.prop('a'))) // => 2
- * @dataLast
- * @category Array
- */
-declare function rankBy<T>(item: T, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): (data: ReadonlyArray<T>) => number;
-
-export { rankBy };
+import "./non-empty-array-D3HWDPMt.js";
+import "./curry-order-rules-Cthu8rj4.js";
+import { rankBy } from "./rank-by-urjGYBfY.js";
+export { rankBy };

package/dist/rank-by.js

@@ -1 +1 @@
-import{a}from"./chunk-G57ZPKMR.js";import"./chunk-7KBK2RWQ.js";import"./chunk-EK7ODJWE.js";export{a as rankBy};
+import"./curry-order-rules-BuA7D1F4.js";import{rankBy as e}from"./rank-by-D3jUXMA3.js";export{e as rankBy};

package/dist/reduce-BXmHWGo2.cjs

@@ -0,0 +1 @@
+const e=require(`./curry-BPVIsvo3.cjs`);function t(...t){return e.curry(n,t)}function n(e,t,n){return e.reduce(t,n)}Object.defineProperty(exports,`reduce`,{enumerable:!0,get:function(){return t}});

package/dist/reduce-DYv-piI7.d.cts

@@ -0,0 +1,53 @@
+//#region src/reduce.d.ts
+/**
+ * Executes a user-supplied "reducer" callback function on each element of the
+ * array, in order, passing in the return value from the calculation on the
+ * preceding element. The final result of running the reducer across all
+ * elements of the array is a single value. Equivalent to
+ * `Array.prototype.reduce`.
+ *
+ * @param data - The items to reduce.
+ * @param callbackfn - A function to execute for each element in the array. Its
+ * return value becomes the value of the accumulator parameter on the next
+ * invocation of callbackFn. For the last invocation, the return value becomes
+ * the return value of reduce().
+ * @param initialValue - A value to which accumulator is initialized the first
+ * time the callback is called. CallbackFn starts executing with the first value
+ * in the array as currentValue.
+ * @returns The value that results from running the "reducer" callback function
+ * to completion over the entire array.
+ * @signature
+ *    P.reduce(data, callbackfn, initialValue)
+ * @example
+ *    P.reduce([1, 2, 3, 4, 5], (acc, x) => acc + x, 100) // => 115
+ * @dataFirst
+ * @category Array
+ */
+declare function reduce<T, U>(data: ReadonlyArray<T>, callbackfn: (previousValue: U, currentValue: T, currentIndex: number, data: ReadonlyArray<T>) => U, initialValue: U): U;
+/**
+ * Executes a user-supplied "reducer" callback function on each element of the
+ * array, in order, passing in the return value from the calculation on the
+ * preceding element. The final result of running the reducer across all
+ * elements of the array is a single value. Equivalent to
+ * `Array.prototype.reduce`.
+ *
+ * @param callbackfn - A function to execute for each element in the array. Its
+ * return value becomes the value of the accumulator parameter on the next
+ * invocation of callbackFn. For the last invocation, the return value becomes
+ * the return value of reduce().
+ * @param initialValue - A value to which accumulator is initialized the first
+ * time the callback is called. CallbackFn starts executing with the first value
+ * in the array as currentValue.
+ * @returns The value that results from running the "reducer" callback function
+ * to completion over the entire array.
+ * @signature
+ *    P.reduce(fn, initialValue)(array)
+ * @example
+ *    P.pipe([1, 2, 3, 4, 5], P.reduce((acc, x) => acc + x, 100)) // => 115
+ * @dataLast
+ * @category Array
+ */
+declare function reduce<T, U>(callbackfn: (previousValue: U, currentValue: T, currentIndex: number, data: ReadonlyArray<T>) => U, initialValue: U): (data: ReadonlyArray<T>) => U;
+//#endregion
+export { reduce };
+//# sourceMappingURL=reduce-DYv-piI7.d.cts.map

package/dist/reduce-DYv-piI7.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduce-DYv-piI7.d.cts","names":[],"sources":["../src/reduce.ts"],"sourcesContent":[],"mappings":";;AA0BA;;;;;;;;;;;;AAkCA;;;;;;;;;;;AAQgC,iBA1ChB,MA0CgB,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EAzCxB,aAyCwB,CAzCV,CAyCU,CAAA,EAAA,UAAA,EAAA,CAAA,aAAA,EAvCb,CAuCa,EAAA,YAAA,EAtCd,CAsCc,EAAA,YAAA,EAAA,MAAA,EAAA,IAAA,EApCtB,aAoCsB,CApCR,CAoCQ,CAAA,EAAA,GAnCzB,CAmCyB,EAAA,YAAA,EAlChB,CAkCgB,CAAA,EAjC7B,CAiC6B;;;;;;;;;;;;;;;;;;;;;;;;iBARhB,yCAEG,iBACD,+BAER,cAAc,OACjB,iBACS,WACN,cAAc,OAAO"}

package/dist/reduce-RFXB_tDG.d.ts

@@ -0,0 +1,53 @@
+//#region src/reduce.d.ts
+/**
+ * Executes a user-supplied "reducer" callback function on each element of the
+ * array, in order, passing in the return value from the calculation on the
+ * preceding element. The final result of running the reducer across all
+ * elements of the array is a single value. Equivalent to
+ * `Array.prototype.reduce`.
+ *
+ * @param data - The items to reduce.
+ * @param callbackfn - A function to execute for each element in the array. Its
+ * return value becomes the value of the accumulator parameter on the next
+ * invocation of callbackFn. For the last invocation, the return value becomes
+ * the return value of reduce().
+ * @param initialValue - A value to which accumulator is initialized the first
+ * time the callback is called. CallbackFn starts executing with the first value
+ * in the array as currentValue.
+ * @returns The value that results from running the "reducer" callback function
+ * to completion over the entire array.
+ * @signature
+ *    P.reduce(data, callbackfn, initialValue)
+ * @example
+ *    P.reduce([1, 2, 3, 4, 5], (acc, x) => acc + x, 100) // => 115
+ * @dataFirst
+ * @category Array
+ */
+declare function reduce<T, U>(data: ReadonlyArray<T>, callbackfn: (previousValue: U, currentValue: T, currentIndex: number, data: ReadonlyArray<T>) => U, initialValue: U): U;
+/**
+ * Executes a user-supplied "reducer" callback function on each element of the
+ * array, in order, passing in the return value from the calculation on the
+ * preceding element. The final result of running the reducer across all
+ * elements of the array is a single value. Equivalent to
+ * `Array.prototype.reduce`.
+ *
+ * @param callbackfn - A function to execute for each element in the array. Its
+ * return value becomes the value of the accumulator parameter on the next
+ * invocation of callbackFn. For the last invocation, the return value becomes
+ * the return value of reduce().
+ * @param initialValue - A value to which accumulator is initialized the first
+ * time the callback is called. CallbackFn starts executing with the first value
+ * in the array as currentValue.
+ * @returns The value that results from running the "reducer" callback function
+ * to completion over the entire array.
+ * @signature
+ *    P.reduce(fn, initialValue)(array)
+ * @example
+ *    P.pipe([1, 2, 3, 4, 5], P.reduce((acc, x) => acc + x, 100)) // => 115
+ * @dataLast
+ * @category Array
+ */
+declare function reduce<T, U>(callbackfn: (previousValue: U, currentValue: T, currentIndex: number, data: ReadonlyArray<T>) => U, initialValue: U): (data: ReadonlyArray<T>) => U;
+//#endregion
+export { reduce };
+//# sourceMappingURL=reduce-RFXB_tDG.d.ts.map

package/dist/reduce-RFXB_tDG.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduce-RFXB_tDG.d.ts","names":[],"sources":["../src/reduce.ts"],"sourcesContent":[],"mappings":";;AA0BA;;;;;;;;;;;;AAkCA;;;;;;;;;;;AAQgC,iBA1ChB,MA0CgB,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EAzCxB,aAyCwB,CAzCV,CAyCU,CAAA,EAAA,UAAA,EAAA,CAAA,aAAA,EAvCb,CAuCa,EAAA,YAAA,EAtCd,CAsCc,EAAA,YAAA,EAAA,MAAA,EAAA,IAAA,EApCtB,aAoCsB,CApCR,CAoCQ,CAAA,EAAA,GAnCzB,CAmCyB,EAAA,YAAA,EAlChB,CAkCgB,CAAA,EAjC7B,CAiC6B;;;;;;;;;;;;;;;;;;;;;;;;iBARhB,yCAEG,iBACD,+BAER,cAAc,OACjB,iBACS,WACN,cAAc,OAAO"}

package/dist/reduce-RxP5hmH5.js

@@ -0,0 +1,2 @@
+import{curry as e}from"./curry-CzZjDrpv.js";function t(...t){return e(n,t)}function n(e,t,n){return e.reduce(t,n)}export{t as reduce};
+//# sourceMappingURL=reduce-RxP5hmH5.js.map

package/dist/reduce-RxP5hmH5.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduce-RxP5hmH5.js","names":[],"sources":["../src/reduce.ts"],"sourcesContent":["import { curry } from './curry';\n\n/**\n * Executes a user-supplied \"reducer\" callback function on each element of the\n * array, in order, passing in the return value from the calculation on the\n * preceding element. The final result of running the reducer across all\n * elements of the array is a single value. Equivalent to\n * `Array.prototype.reduce`.\n *\n * @param data - The items to reduce.\n * @param callbackfn - A function to execute for each element in the array. Its\n * return value becomes the value of the accumulator parameter on the next\n * invocation of callbackFn. For the last invocation, the return value becomes\n * the return value of reduce().\n * @param initialValue - A value to which accumulator is initialized the first\n * time the callback is called. CallbackFn starts executing with the first value\n * in the array as currentValue.\n * @returns The value that results from running the \"reducer\" callback function\n * to completion over the entire array.\n * @signature\n *    P.reduce(data, callbackfn, initialValue)\n * @example\n *    P.reduce([1, 2, 3, 4, 5], (acc, x) => acc + x, 100) // => 115\n * @dataFirst\n * @category Array\n */\nexport function reduce<T, U>(\n  data: ReadonlyArray<T>,\n  callbackfn: (\n    previousValue: U,\n    currentValue: T,\n    currentIndex: number,\n    data: ReadonlyArray<T>,\n  ) => U,\n  initialValue: U,\n): U;\n\n/**\n * Executes a user-supplied \"reducer\" callback function on each element of the\n * array, in order, passing in the return value from the calculation on the\n * preceding element. The final result of running the reducer across all\n * elements of the array is a single value. Equivalent to\n * `Array.prototype.reduce`.\n *\n * @param callbackfn - A function to execute for each element in the array. Its\n * return value becomes the value of the accumulator parameter on the next\n * invocation of callbackFn. For the last invocation, the return value becomes\n * the return value of reduce().\n * @param initialValue - A value to which accumulator is initialized the first\n * time the callback is called. CallbackFn starts executing with the first value\n * in the array as currentValue.\n * @returns The value that results from running the \"reducer\" callback function\n * to completion over the entire array.\n * @signature\n *    P.reduce(fn, initialValue)(array)\n * @example\n *    P.pipe([1, 2, 3, 4, 5], P.reduce((acc, x) => acc + x, 100)) // => 115\n * @dataLast\n * @category Array\n */\nexport function reduce<T, U>(\n  callbackfn: (\n    previousValue: U,\n    currentValue: T,\n    currentIndex: number,\n    data: ReadonlyArray<T>,\n  ) => U,\n  initialValue: U,\n): (data: ReadonlyArray<T>) => U;\n\nexport function reduce(...args: ReadonlyArray<unknown>): unknown {\n  return curry(reduceImplementation, args);\n}\n\nfunction reduceImplementation<T, U>(\n  data: ReadonlyArray<T>,\n  callbackfn: (\n    previousValue: U,\n    currentValue: T,\n    currentIndex: number,\n    data: ReadonlyArray<T>,\n  ) => U,\n  initialValue: U,\n): U {\n  return data.reduce(callbackfn, initialValue);\n}\n"],"mappings":"4CAsEA,SAAgB,EAAO,GAAG,EAAuC,CAC/D,OAAO,EAAM,EAAsB,EAAK,CAG1C,SAAS,EACP,EACA,EAMA,EACG,CACH,OAAO,EAAK,OAAO,EAAY,EAAa"}

package/dist/reduce.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkH6WDSTL3cjs = require('./chunk-H6WDSTL3.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.reduce = _chunkH6WDSTL3cjs.a;
+require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./reduce-BXmHWGo2.cjs`);exports.reduce=e.reduce;

package/dist/reduce.d.cts

@@ -1,51 +1,2 @@
-/**
- * Executes a user-supplied "reducer" callback function on each element of the
- * array, in order, passing in the return value from the calculation on the
- * preceding element. The final result of running the reducer across all
- * elements of the array is a single value. Equivalent to
- * `Array.prototype.reduce`.
- *
- * @param data - The items to reduce.
- * @param callbackfn - A function to execute for each element in the array. Its
- * return value becomes the value of the accumulator parameter on the next
- * invocation of callbackFn. For the last invocation, the return value becomes
- * the return value of reduce().
- * @param initialValue - A value to which accumulator is initialized the first
- * time the callback is called. CallbackFn starts executing with the first value
- * in the array as currentValue.
- * @returns The value that results from running the "reducer" callback function
- * to completion over the entire array.
- * @signature
- *    P.reduce(data, callbackfn, initialValue)
- * @example
- *    P.reduce([1, 2, 3, 4, 5], (acc, x) => acc + x, 100) // => 115
- * @dataFirst
- * @category Array
- */
-declare function reduce<T, U>(data: ReadonlyArray<T>, callbackfn: (previousValue: U, currentValue: T, currentIndex: number, data: ReadonlyArray<T>) => U, initialValue: U): U;
-/**
- * Executes a user-supplied "reducer" callback function on each element of the
- * array, in order, passing in the return value from the calculation on the
- * preceding element. The final result of running the reducer across all
- * elements of the array is a single value. Equivalent to
- * `Array.prototype.reduce`.
- *
- * @param callbackfn - A function to execute for each element in the array. Its
- * return value becomes the value of the accumulator parameter on the next
- * invocation of callbackFn. For the last invocation, the return value becomes
- * the return value of reduce().
- * @param initialValue - A value to which accumulator is initialized the first
- * time the callback is called. CallbackFn starts executing with the first value
- * in the array as currentValue.
- * @returns The value that results from running the "reducer" callback function
- * to completion over the entire array.
- * @signature
- *    P.reduce(fn, initialValue)(array)
- * @example
- *    P.pipe([1, 2, 3, 4, 5], P.reduce((acc, x) => acc + x, 100)) // => 115
- * @dataLast
- * @category Array
- */
-declare function reduce<T, U>(callbackfn: (previousValue: U, currentValue: T, currentIndex: number, data: ReadonlyArray<T>) => U, initialValue: U): (data: ReadonlyArray<T>) => U;
-
-export { reduce };
+import { reduce } from "./reduce-DYv-piI7.cjs";
+export { reduce };

package/dist/reduce.d.ts

@@ -1,51 +1,2 @@
-/**
- * Executes a user-supplied "reducer" callback function on each element of the
- * array, in order, passing in the return value from the calculation on the
- * preceding element. The final result of running the reducer across all
- * elements of the array is a single value. Equivalent to
- * `Array.prototype.reduce`.
- *
- * @param data - The items to reduce.
- * @param callbackfn - A function to execute for each element in the array. Its
- * return value becomes the value of the accumulator parameter on the next
- * invocation of callbackFn. For the last invocation, the return value becomes
- * the return value of reduce().
- * @param initialValue - A value to which accumulator is initialized the first
- * time the callback is called. CallbackFn starts executing with the first value
- * in the array as currentValue.
- * @returns The value that results from running the "reducer" callback function
- * to completion over the entire array.
- * @signature
- *    P.reduce(data, callbackfn, initialValue)
- * @example
- *    P.reduce([1, 2, 3, 4, 5], (acc, x) => acc + x, 100) // => 115
- * @dataFirst
- * @category Array
- */
-declare function reduce<T, U>(data: ReadonlyArray<T>, callbackfn: (previousValue: U, currentValue: T, currentIndex: number, data: ReadonlyArray<T>) => U, initialValue: U): U;
-/**
- * Executes a user-supplied "reducer" callback function on each element of the
- * array, in order, passing in the return value from the calculation on the
- * preceding element. The final result of running the reducer across all
- * elements of the array is a single value. Equivalent to
- * `Array.prototype.reduce`.
- *
- * @param callbackfn - A function to execute for each element in the array. Its
- * return value becomes the value of the accumulator parameter on the next
- * invocation of callbackFn. For the last invocation, the return value becomes
- * the return value of reduce().
- * @param initialValue - A value to which accumulator is initialized the first
- * time the callback is called. CallbackFn starts executing with the first value
- * in the array as currentValue.
- * @returns The value that results from running the "reducer" callback function
- * to completion over the entire array.
- * @signature
- *    P.reduce(fn, initialValue)(array)
- * @example
- *    P.pipe([1, 2, 3, 4, 5], P.reduce((acc, x) => acc + x, 100)) // => 115
- * @dataLast
- * @category Array
- */
-declare function reduce<T, U>(callbackfn: (previousValue: U, currentValue: T, currentIndex: number, data: ReadonlyArray<T>) => U, initialValue: U): (data: ReadonlyArray<T>) => U;
-
-export { reduce };
+import { reduce } from "./reduce-RFXB_tDG.js";
+export { reduce };

package/dist/reduce.js

@@ -1 +1 @@
-import{a}from"./chunk-IZWZPKOA.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as reduce};
+import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{reduce as e}from"./reduce-RxP5hmH5.js";export{e as reduce};

package/dist/reordered-array-BJtughHE.d.ts

@@ -0,0 +1,7 @@
+import { IterableContainer } from "./iterable-container-wtkYslN_.js";
+
+//#region src/internal/types/reordered-array.d.ts
+type ReorderedArray<T extends IterableContainer> = { -readonly [P in keyof T]: T[number] };
+//#endregion
+export { ReorderedArray };
+//# sourceMappingURL=reordered-array-BJtughHE.d.ts.map

package/dist/reordered-array-BJtughHE.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reordered-array-BJtughHE.d.ts","names":[],"sources":["../src/internal/types/reordered-array.ts"],"sourcesContent":[],"mappings":";;;KAEY,yBAAyB,6CACb,IAAI,WAD5B"}

package/dist/reordered-array-CNK-grX0.d.cts

@@ -0,0 +1,7 @@
+import { IterableContainer } from "./iterable-container-V5sa0V_H.cjs";
+
+//#region src/internal/types/reordered-array.d.ts
+type ReorderedArray<T extends IterableContainer> = { -readonly [P in keyof T]: T[number] };
+//#endregion
+export { ReorderedArray };
+//# sourceMappingURL=reordered-array-CNK-grX0.d.cts.map

package/dist/reordered-array-CNK-grX0.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reordered-array-CNK-grX0.d.cts","names":[],"sources":["../src/internal/types/reordered-array.ts"],"sourcesContent":[],"mappings":";;;KAEY,yBAAyB,6CACb,IAAI,WAD5B"}

package/dist/reverse-Bu350kg_.d.cts

@@ -0,0 +1,29 @@
+//#region src/reverse.d.ts
+type Reverse<T extends ReadonlyArray<unknown>, R extends ReadonlyArray<unknown> = []> = ReturnType<T extends IsNoTuple<T> ? () => [...T, ...R] : T extends readonly [infer F, ...infer L] ? () => Reverse<L, [F, ...R]> : () => R>;
+type IsNoTuple<T> = T extends readonly [unknown, ...Array<unknown>] ? never : T;
+/**
+ * Reverses array.
+ *
+ * @param array - The array.
+ * @signature
+ *    P.reverse(arr);
+ * @example
+ *    P.reverse([1, 2, 3]) // [3, 2, 1]
+ * @dataFirst
+ * @category Array
+ */
+declare function reverse<T extends ReadonlyArray<unknown>>(array: T): Reverse<T>;
+/**
+ * Reverses array.
+ *
+ * @signature
+ *    P.reverse()(array);
+ * @example
+ *    P.reverse()([1, 2, 3]) // [3, 2, 1]
+ * @dataLast
+ * @category Array
+ */
+declare function reverse<T extends ReadonlyArray<unknown>>(): (array: T) => Reverse<T>;
+//#endregion
+export { reverse };
+//# sourceMappingURL=reverse-Bu350kg_.d.cts.map

package/dist/reverse-Bu350kg_.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reverse-Bu350kg_.d.cts","names":[],"sources":["../src/reverse.ts"],"sourcesContent":[],"mappings":";KAEK,kBACO,kCACA,+BACR,WACF,UAAU,UAAU,eACN,MAAM,KAChB,iDACQ,QAAQ,IAAI,MAAM,YAClB;KAGT,SAXO,CAAA,CAAA,CAAA,GAWQ,CAXR,SAAA,SAAA,CAAA,OAAA,EAAA,GAWwC,KAXxC,CAAA,OAAA,CAAA,CAAA,GAAA,KAAA,GAWkE,CAXlE;;;;;;;;;;;;AAOoB,iBAiBhB,OAjBgB,CAAA,UAiBE,aAjBF,CAAA,OAAA,CAAA,CAAA,CAAA,KAAA,EAiBiC,CAjBjC,CAAA,EAiBqC,OAjBrC,CAiB6C,CAjB7C,CAAA;;;;;AAJlB;;;;;;AAqBE,iBAYA,OAZO,CAAA,UAYW,aAZX,CAAA,OAAA,CAAA,CAAA,CAAA,CAAA,EAAA,CAAA,KAAA,EAad,CAbc,EAAA,GAclB,OAdkB,CAcV,CAdU,CAAA"}

package/dist/reverse-DZc8DCPA.js

@@ -0,0 +1,2 @@
+import{curry as e}from"./curry-CzZjDrpv.js";function t(...t){return e(n,t)}function n(e){return[...e].reverse()}export{t as reverse};
+//# sourceMappingURL=reverse-DZc8DCPA.js.map

package/dist/reverse-DZc8DCPA.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reverse-DZc8DCPA.js","names":[],"sources":["../src/reverse.ts"],"sourcesContent":["import { curry } from './curry';\n\ntype Reverse<\n  T extends ReadonlyArray<unknown>,\n  R extends ReadonlyArray<unknown> = [],\n> = ReturnType<\n  T extends IsNoTuple<T>\n    ? () => [...T, ...R]\n    : T extends readonly [infer F, ...infer L]\n      ? () => Reverse<L, [F, ...R]>\n      : () => R\n>;\n\ntype IsNoTuple<T> = T extends readonly [unknown, ...Array<unknown>] ? never : T;\n\n/**\n * Reverses array.\n *\n * @param array - The array.\n * @signature\n *    P.reverse(arr);\n * @example\n *    P.reverse([1, 2, 3]) // [3, 2, 1]\n * @dataFirst\n * @category Array\n */\nexport function reverse<T extends ReadonlyArray<unknown>>(array: T): Reverse<T>;\n\n/**\n * Reverses array.\n *\n * @signature\n *    P.reverse()(array);\n * @example\n *    P.reverse()([1, 2, 3]) // [3, 2, 1]\n * @dataLast\n * @category Array\n */\nexport function reverse<T extends ReadonlyArray<unknown>>(): (\n  array: T,\n) => Reverse<T>;\n\nexport function reverse(...args: ReadonlyArray<unknown>): unknown {\n  return curry(reverseImplementation, args);\n}\n\nfunction reverseImplementation<T>(array: ReadonlyArray<T>): Array<T> {\n  // TODO: When node 18 reaches end-of-life bump target lib to ES2023+ and use `Array.prototype.toReversed` here.\n  return [...array].reverse();\n}\n"],"mappings":"4CA0CA,SAAgB,EAAQ,GAAG,EAAuC,CAChE,OAAO,EAAM,EAAuB,EAAK,CAG3C,SAAS,EAAyB,EAAmC,CAEnE,MAAO,CAAC,GAAG,EAAM,CAAC,SAAS"}

package/dist/reverse-l_bD9Y9C.cjs

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

package/dist/reverse-w5Ru5uLJ.d.ts

@@ -0,0 +1,29 @@
+//#region src/reverse.d.ts
+type Reverse<T extends ReadonlyArray<unknown>, R extends ReadonlyArray<unknown> = []> = ReturnType<T extends IsNoTuple<T> ? () => [...T, ...R] : T extends readonly [infer F, ...infer L] ? () => Reverse<L, [F, ...R]> : () => R>;
+type IsNoTuple<T> = T extends readonly [unknown, ...Array<unknown>] ? never : T;
+/**
+ * Reverses array.
+ *
+ * @param array - The array.
+ * @signature
+ *    P.reverse(arr);
+ * @example
+ *    P.reverse([1, 2, 3]) // [3, 2, 1]
+ * @dataFirst
+ * @category Array
+ */
+declare function reverse<T extends ReadonlyArray<unknown>>(array: T): Reverse<T>;
+/**
+ * Reverses array.
+ *
+ * @signature
+ *    P.reverse()(array);
+ * @example
+ *    P.reverse()([1, 2, 3]) // [3, 2, 1]
+ * @dataLast
+ * @category Array
+ */
+declare function reverse<T extends ReadonlyArray<unknown>>(): (array: T) => Reverse<T>;
+//#endregion
+export { reverse };
+//# sourceMappingURL=reverse-w5Ru5uLJ.d.ts.map

package/dist/reverse-w5Ru5uLJ.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reverse-w5Ru5uLJ.d.ts","names":[],"sources":["../src/reverse.ts"],"sourcesContent":[],"mappings":";KAEK,kBACO,kCACA,+BACR,WACF,UAAU,UAAU,eACN,MAAM,KAChB,iDACQ,QAAQ,IAAI,MAAM,YAClB;KAGT,SAXO,CAAA,CAAA,CAAA,GAWQ,CAXR,SAAA,SAAA,CAAA,OAAA,EAAA,GAWwC,KAXxC,CAAA,OAAA,CAAA,CAAA,GAAA,KAAA,GAWkE,CAXlE;;;;;;;;;;;;AAOoB,iBAiBhB,OAjBgB,CAAA,UAiBE,aAjBF,CAAA,OAAA,CAAA,CAAA,CAAA,KAAA,EAiBiC,CAjBjC,CAAA,EAiBqC,OAjBrC,CAiB6C,CAjB7C,CAAA;;;;;AAJlB;;;;;;AAqBE,iBAYA,OAZO,CAAA,UAYW,aAZX,CAAA,OAAA,CAAA,CAAA,CAAA,CAAA,EAAA,CAAA,KAAA,EAad,CAbc,EAAA,GAclB,OAdkB,CAcV,CAdU,CAAA"}

package/dist/reverse.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkVAU7HZPOcjs = require('./chunk-VAU7HZPO.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.reverse = _chunkVAU7HZPOcjs.a;
+require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./reverse-l_bD9Y9C.cjs`);exports.reverse=e.reverse;