@vinicunca/perkakas 1.8.0 → 1.12.0

package/dist/random-integer.d.ts

@@ -1,3 +1,23 @@
-import "./int-range-inclusive-BSXuRjMO.js";
-import { randomInteger } from "./random-integer-BschXumd.js";
-export { randomInteger };
+import { t as IntRangeInclusive } from "./int-range-inclusive-ClGdUant.js";
+import { GreaterThan, GreaterThanOrEqual, IsEqual, IsNever, NonNegativeInteger, Or } from "type-fest";
+
+//#region src/random-integer.d.ts
+type RandomInteger<From extends number, To extends number> = Or<IsNever<NonNegativeInteger<From>>, IsNever<NonNegativeInteger<To>>> extends true ? number : IsEqual<From, To> extends true ? From : GreaterThan<From, To> extends true ? never : GreaterThanOrEqual<To, 1000> extends true ? number : IntRangeInclusive<From, To>;
+/**
+ * Generate a random integer between `from` and `to` (inclusive).
+ *
+ * @param from - The minimum value.
+ * @param to - The maximum value.
+ * @returns The random integer.
+ * @signature
+ *   P.randomInt(from, to)
+ * @example
+ *   P.randomInt(1, 10) // => 5
+ *   P.randomInt(1.5, 2.6) // => 2
+ * @dataFirst
+ * @category Number
+ */
+declare function randomInteger<From extends number, To extends number>(from: From, to: To): RandomInteger<From, To>;
+//#endregion
+export { randomInteger };
+//# sourceMappingURL=random-integer.d.ts.map

package/dist/random-integer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-integer.d.ts","names":[],"sources":["../src/random-integer.ts"],"sourcesContent":[],"mappings":";;;;KAUK,wDACD,GACA,QAAQ,mBAAmB,QAC3B,QAAQ,mBAAmB,8BAGzB,QAAQ,MAAM,mBACZ,OACA,YAAY,MAAM,2BAEhB,mBAAmB,kCAEjB,kBAAkB,MAAM;;AAd0C;;;;;;;;;;;;;AAUpD,iBAoBV,aApBU,CAAA,aAAA,MAAA,EAAA,WAAA,MAAA,CAAA,CAAA,IAAA,EAqBlB,IArBkB,EAAA,EAAA,EAsBpB,EAtBoB,CAAA,EAuBvB,aAvBuB,CAuBT,IAvBS,EAuBH,EAvBG,CAAA"}

package/dist/random-integer.js

@@ -1 +1,2 @@
-import{randomInteger as e}from"./random-integer-D27vFslT.js";export{e as randomInteger};
+function e(e,t){let n=Math.ceil(e),r=Math.floor(t);if(r<n)throw RangeError(`randomInt: The range [${e},${t}] contains no integer`);return Math.floor(Math.random()*(r-n+1)+n)}export{e as randomInteger};
+//# sourceMappingURL=random-integer.js.map

package/dist/random-integer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-integer.js","names":[],"sources":["../src/random-integer.ts"],"sourcesContent":["import type {\n  GreaterThan,\n  GreaterThanOrEqual,\n  IsEqual,\n  IsNever,\n  NonNegativeInteger,\n  Or,\n} from 'type-fest';\nimport type { IntRangeInclusive } from './internal/types/int-range-inclusive';\n\ntype RandomInteger<From extends number, To extends number>\n  = Or<\n    IsNever<NonNegativeInteger<From>>,\n    IsNever<NonNegativeInteger<To>>\n  > extends true\n    ? number\n    : IsEqual<From, To> extends true\n      ? From\n      : GreaterThan<From, To> extends true\n        ? never\n        : GreaterThanOrEqual<To, 1000> extends true\n          ? number\n          : IntRangeInclusive<From, To>;\n\n/**\n * Generate a random integer between `from` and `to` (inclusive).\n *\n * @param from - The minimum value.\n * @param to - The maximum value.\n * @returns The random integer.\n * @signature\n *   P.randomInt(from, to)\n * @example\n *   P.randomInt(1, 10) // => 5\n *   P.randomInt(1.5, 2.6) // => 2\n * @dataFirst\n * @category Number\n */\nexport function randomInteger<From extends number, To extends number>(\n  from: From,\n  to: To,\n): RandomInteger<From, To> {\n  const fromCeiled = Math.ceil(from);\n  const toFloored = Math.floor(to);\n\n  if (toFloored < fromCeiled) {\n    throw new RangeError(\n      `randomInt: The range [${from},${to}] contains no integer`,\n    );\n  }\n\n  return Math.floor(\n    Math.random() * (toFloored - fromCeiled + 1) + fromCeiled,\n  ) as RandomInteger<From, To>;\n}\n"],"mappings":"AAsCA,SAAgB,EACd,EACA,EACyB,CACzB,IAAM,EAAa,KAAK,KAAK,EAAK,CAC5B,EAAY,KAAK,MAAM,EAAG,CAEhC,GAAI,EAAY,EACd,MAAU,WACR,yBAAyB,EAAK,GAAG,EAAG,uBACrC,CAGH,OAAO,KAAK,MACV,KAAK,QAAQ,EAAI,EAAY,EAAa,GAAK,EAChD"}

package/dist/random-string.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./random-string-LG5QFZXR.cjs`);exports.randomString=e.randomString;
+const e=require(`./curry-BsY0Z8jH.cjs`),t=`ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789`;function n(...t){return e.t(r,t)}function r(e){let t=[];for(let n=0;n<e;n++){let e=`ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789`[Math.floor(Math.random()*62)];t.push(e)}return t.join(``)}exports.randomString=n;

package/dist/random-string.d.cts

@@ -1,2 +1,29 @@
-import { randomString } from "./random-string-DlACN4ZV.cjs";
-export { randomString };
+//#region src/random-string.d.ts
+/**
+ * Random a non-cryptographic random string from characters a-zA-Z0-9.
+ *
+ * @param length - The length of the random string.
+ * @returns The random string.
+ * @signature
+ *   P.randomString(length)
+ * @example
+ *   P.randomString(5) // => aB92J
+ * @dataFirst
+ * @category String
+ */
+declare function randomString(length: number): string;
+/**
+ * Random a non-cryptographic random string from characters a-zA-Z0-9.
+ *
+ * @returns The random string.
+ * @signature
+ *   P.randomString()(length)
+ * @example
+ *   P.pipe(5, P.randomString()) // => aB92J
+ * @dataLast
+ * @category String
+ */
+declare function randomString(): (length: number) => string;
+//#endregion
+export { randomString };
+//# sourceMappingURL=random-string.d.cts.map

package/dist/random-string.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-string.d.cts","names":[],"sources":["../src/random-string.ts"],"sourcesContent":[],"mappings":";;AAiBA;AAaA;;;;;;;;;;iBAbgB,YAAA;;;;;;;;;;;;iBAaA,YAAA,CAAA"}

package/dist/random-string.d.ts

@@ -1,2 +1,29 @@
-import { randomString } from "./random-string-DBUea-au.js";
-export { randomString };
+//#region src/random-string.d.ts
+/**
+ * Random a non-cryptographic random string from characters a-zA-Z0-9.
+ *
+ * @param length - The length of the random string.
+ * @returns The random string.
+ * @signature
+ *   P.randomString(length)
+ * @example
+ *   P.randomString(5) // => aB92J
+ * @dataFirst
+ * @category String
+ */
+declare function randomString(length: number): string;
+/**
+ * Random a non-cryptographic random string from characters a-zA-Z0-9.
+ *
+ * @returns The random string.
+ * @signature
+ *   P.randomString()(length)
+ * @example
+ *   P.pipe(5, P.randomString()) // => aB92J
+ * @dataLast
+ * @category String
+ */
+declare function randomString(): (length: number) => string;
+//#endregion
+export { randomString };
+//# sourceMappingURL=random-string.d.ts.map

package/dist/random-string.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-string.d.ts","names":[],"sources":["../src/random-string.ts"],"sourcesContent":[],"mappings":";;AAiBA;AAaA;;;;;;;;;;iBAbgB,YAAA;;;;;;;;;;;;iBAaA,YAAA,CAAA"}

package/dist/random-string.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{randomString as e}from"./random-string-B49LA01O.js";export{e as randomString};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e){let t=[];for(let n=0;n<e;n++){let e=`ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789`[Math.floor(Math.random()*62)];t.push(e)}return t.join(``)}export{t as randomString};
+//# sourceMappingURL=random-string.js.map

package/dist/random-string.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-string.js","names":["out: Array<string>"],"sources":["../src/random-string.ts"],"sourcesContent":["import { curry } from './curry';\n\nconst ALPHABET\n  = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';\n\n/**\n * Random a non-cryptographic random string from characters a-zA-Z0-9.\n *\n * @param length - The length of the random string.\n * @returns The random string.\n * @signature\n *   P.randomString(length)\n * @example\n *   P.randomString(5) // => aB92J\n * @dataFirst\n * @category String\n */\nexport function randomString(length: number): string;\n\n/**\n * Random a non-cryptographic random string from characters a-zA-Z0-9.\n *\n * @returns The random string.\n * @signature\n *   P.randomString()(length)\n * @example\n *   P.pipe(5, P.randomString()) // => aB92J\n * @dataLast\n * @category String\n */\nexport function randomString(): (length: number) => string;\n\nexport function randomString(...args: ReadonlyArray<unknown>): unknown {\n  return curry(randomStringImplementation, args);\n}\n\nfunction randomStringImplementation(length: number): string {\n  const out: Array<string> = [];\n  for (let iteration = 0; iteration < length; iteration++) {\n    const randomChar = ALPHABET[Math.floor(Math.random() * ALPHABET.length)]!;\n    out.push(randomChar);\n  }\n  return out.join('');\n}\n"],"mappings":"wCAgCA,SAAgB,EAAa,GAAG,EAAuC,CACrE,OAAO,EAAM,EAA4B,EAAK,CAGhD,SAAS,EAA2B,EAAwB,CAC1D,IAAMA,EAAqB,EAAE,CAC7B,IAAK,IAAI,EAAY,EAAG,EAAY,EAAQ,IAAa,CACvD,IAAM,EAAa,iEAAS,KAAK,MAAM,KAAK,QAAQ,CAAG,GAAgB,EACvE,EAAI,KAAK,EAAW,CAEtB,OAAO,EAAI,KAAK,GAAG"}

package/dist/range.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./range-BYm8b8OO.cjs`);exports.range=e.range;
+const e=require(`./curry-BsY0Z8jH.cjs`);function t(...t){return e.t(n,t)}function n(e,t){let n=[];for(let r=e;r<t;r++)n.push(r);return n}exports.range=t;

package/dist/range.d.cts

@@ -1,2 +1,27 @@
-import { range } from "./range-EauFMBl4.cjs";
-export { range };
+//#region src/range.d.ts
+/**
+ * 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>;
+//#endregion
+export { range };
+//# sourceMappingURL=range.d.cts.map

package/dist/range.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"range.d.cts","names":[],"sources":["../src/range.ts"],"sourcesContent":[],"mappings":";;AAaA;AAYA;;;;;;;;;iBAZgB,KAAA,8BAAmC;;;;;;;;;;;iBAYnC,KAAA,kCAAuC"}

package/dist/range.d.ts

@@ -1,2 +1,27 @@
-import { range } from "./range-BNpqskPd.js";
-export { range };
+//#region src/range.d.ts
+/**
+ * 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>;
+//#endregion
+export { range };
+//# sourceMappingURL=range.d.ts.map

package/dist/range.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"range.d.ts","names":[],"sources":["../src/range.ts"],"sourcesContent":[],"mappings":";;AAaA;AAYA;;;;;;;;;iBAZgB,KAAA,8BAAmC;;;;;;;;;;;iBAYnC,KAAA,kCAAuC"}

package/dist/range.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{range as e}from"./range-BtCOvN_L.js";export{e as range};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){let n=[];for(let r=e;r<t;r++)n.push(r);return n}export{t as range};
+//# sourceMappingURL=range.js.map

package/dist/range.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"range.js","names":["ret: Array<number>"],"sources":["../src/range.ts"],"sourcesContent":["import { curry } from './curry';\n\n/**\n * Returns a list of numbers from `start` (inclusive) to `end` (exclusive).\n *\n * @param start - The start number.\n * @param end - The end number.\n * @signature range(start, end)\n * @example\n *    P.range(1, 5) // => [1, 2, 3, 4]\n * @dataFirst\n * @category Array\n */\nexport function range(start: number, end: number): Array<number>;\n\n/**\n * Returns a list of numbers from `start` (inclusive) to `end` (exclusive).\n *\n * @param end - The end number.\n * @signature range(end)(start)\n * @example\n *    P.range(5)(1) // => [1, 2, 3, 4]\n * @dataFirst\n * @category Array\n */\nexport function range(end: number): (start: number) => Array<number>;\n\nexport function range(...args: ReadonlyArray<unknown>): unknown {\n  return curry(rangeImplementation, args);\n}\n\nfunction rangeImplementation(start: number, end: number): Array<number> {\n  const ret: Array<number> = [];\n  for (let i = start; i < end; i++) {\n    ret.push(i);\n  }\n  return ret;\n}\n"],"mappings":"wCA2BA,SAAgB,EAAM,GAAG,EAAuC,CAC9D,OAAO,EAAM,EAAqB,EAAK,CAGzC,SAAS,EAAoB,EAAe,EAA4B,CACtE,IAAMA,EAAqB,EAAE,CAC7B,IAAK,IAAI,EAAI,EAAO,EAAI,EAAK,IAC3B,EAAI,KAAK,EAAE,CAEb,OAAO"}

package/dist/rank-by.cjs

@@ -1 +1 @@
-require(`./curry-order-rules-UcuuWkKd.cjs`);const e=require(`./rank-by-B778jLnu.cjs`);exports.rankBy=e.rankBy;
+const e=require(`./curry-order-rules-ClqHrs8_.cjs`);function t(...t){return e.n(n,t)}function n(e,t,n){let r=0;for(let i of e)t(n,i)>0&&(r+=1);return r}exports.rankBy=t;

package/dist/rank-by.d.cts

@@ -1,4 +1,45 @@
-import "./non-empty-array-D3ZRHApS.cjs";
-import "./curry-order-rules-1zjlAgqa.cjs";
-import { rankBy } from "./rank-by-B5nxlwg6.cjs";
-export { rankBy };
+import { t as NonEmptyArray } from "./non-empty-array-CFG7wGD-.cjs";
+import { t as OrderRule } from "./curry-order-rules-cezUWcSx.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.d.cts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rank-by.d.cts","names":[],"sources":["../src/rank-by.ts"],"sourcesContent":[],"mappings":";;;;;;;AA0BA;;;;;;;;;AAuBA;;;;;;;AAGU,iBA1BM,MA0BN,CAAA,CAAA,CAAA,CAAA,IAAA,EAzBF,aAyBE,CAzBY,CAyBZ,CAAA,EAAA,IAAA,EAxBF,CAwBE,EAAA,GAAA,KAAA,EAvBE,QAuBF,CAvBW,aAuBX,CAvByB,SAuBzB,CAvBmC,CAuBnC,CAAA,CAAA,CAAA,CAAA,EAAA,MAAA;;;;;;;;;;;;;;;;;;iBAHM,gBACR,aACI,SAAS,cAAc,UAAU,cACnC,cAAc"}

package/dist/rank-by.d.ts

@@ -1,4 +1,45 @@
-import "./non-empty-array-D3HWDPMt.js";
-import "./curry-order-rules-Cthu8rj4.js";
-import { rankBy } from "./rank-by-urjGYBfY.js";
-export { rankBy };
+import { t as NonEmptyArray } from "./non-empty-array-DXkY7ynY.js";
+import { t as OrderRule } from "./curry-order-rules-BCcwbNxd.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.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rank-by.d.ts","names":[],"sources":["../src/rank-by.ts"],"sourcesContent":[],"mappings":";;;;;;;AA0BA;;;;;;;;;AAuBA;;;;;;;AAGU,iBA1BM,MA0BN,CAAA,CAAA,CAAA,CAAA,IAAA,EAzBF,aAyBE,CAzBY,CAyBZ,CAAA,EAAA,IAAA,EAxBF,CAwBE,EAAA,GAAA,KAAA,EAvBE,QAuBF,CAvBW,aAuBX,CAvByB,SAuBzB,CAvBmC,CAuBnC,CAAA,CAAA,CAAA,CAAA,EAAA,MAAA;;;;;;;;;;;;;;;;;;iBAHM,gBACR,aACI,SAAS,cAAc,UAAU,cACnC,cAAc"}

package/dist/rank-by.js

@@ -1 +1,2 @@
-import"./curry-order-rules-BuA7D1F4.js";import{rankBy as e}from"./rank-by-D3jUXMA3.js";export{e as rankBy};
+import{n as e}from"./curry-order-rules-C6bwcUwC.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.js.map

package/dist/rank-by.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rank-by.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":"oDAsDA,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/reduce.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./reduce-BXmHWGo2.cjs`);exports.reduce=e.reduce;
+const e=require(`./curry-BsY0Z8jH.cjs`);function t(...t){return e.t(n,t)}function n(e,t,n){return e.reduce(t,n)}exports.reduce=t;

package/dist/reduce.d.cts

@@ -1,2 +1,53 @@
-import { reduce } from "./reduce-DYv-piI7.cjs";
-export { reduce };
+//#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.d.cts.map

package/dist/reduce.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduce.d.cts","names":[],"sources":["../src/reduce.ts"],"sourcesContent":[],"mappings":";;AA0BA;;;;;;;;;;;AAkCA;;;;;;;;;;;;iBAlCgB,mBACR,cAAc,gCAEH,iBACD,+BAER,cAAc,OACjB,iBACS,IACb;;;;;;;;;;;;;;;;;;;;;;;;iBAyBa,yCAEG,iBACD,+BAER,cAAc,OACjB,iBACS,WACN,cAAc,OAAO"}

package/dist/reduce.d.ts

@@ -1,2 +1,53 @@
-import { reduce } from "./reduce-RFXB_tDG.js";
-export { reduce };
+//#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.d.ts.map

package/dist/reduce.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduce.d.ts","names":[],"sources":["../src/reduce.ts"],"sourcesContent":[],"mappings":";;AA0BA;;;;;;;;;;;AAkCA;;;;;;;;;;;;iBAlCgB,mBACR,cAAc,gCAEH,iBACD,+BAER,cAAc,OACjB,iBACS,IACb;;;;;;;;;;;;;;;;;;;;;;;;iBAyBa,yCAEG,iBACD,+BAER,cAAc,OACjB,iBACS,WACN,cAAc,OAAO"}

package/dist/reduce.js

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

package/dist/reduce.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduce.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":"wCAsEA,SAAgB,EAAO,GAAG,EAAuC,CAC/D,OAAO,EAAM,EAAsB,EAAK,CAG1C,SAAS,EACP,EACA,EAMA,EACG,CACH,OAAO,EAAK,OAAO,EAAY,EAAa"}

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

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

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

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

package/dist/reordered-array-BsUBOnYh.d.cts

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

package/dist/reordered-array-BsUBOnYh.d.cts.map

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

package/dist/reverse.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./reverse-l_bD9Y9C.cjs`);exports.reverse=e.reverse;
+const e=require(`./curry-BsY0Z8jH.cjs`);function t(...t){return e.t(n,t)}function n(e){return[...e].reverse()}exports.reverse=t;

package/dist/reverse.d.cts

@@ -1,2 +1,29 @@
-import { reverse } from "./reverse-Bu350kg_.cjs";
-export { reverse };
+//#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.d.cts.map

package/dist/reverse.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reverse.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;;;;;;;;;;;;AAOE,iBAiBE,OAjBF,CAAA,UAiBoB,aAjBpB,CAAA,OAAA,CAAA,CAAA,CAAA,KAAA,EAiBmD,CAjBnD,CAAA,EAiBuD,OAjBvD,CAiB+D,CAjB/D,CAAA;;;;AAJA;;;;;AAqBd;;AAAiE,iBAYjD,OAZiD,CAAA,UAY/B,aAZ+B,CAAA,OAAA,CAAA,CAAA,CAAA,CAAA,EAAA,CAAA,KAAA,EAaxD,CAbwD,EAAA,GAc5D,OAd4D,CAcpD,CAdoD,CAAA"}

package/dist/reverse.d.ts

@@ -1,2 +1,29 @@
-import { reverse } from "./reverse-w5Ru5uLJ.js";
-export { reverse };
+//#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.d.ts.map

package/dist/reverse.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reverse.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;;;;;;;;;;;;AAOE,iBAiBE,OAjBF,CAAA,UAiBoB,aAjBpB,CAAA,OAAA,CAAA,CAAA,CAAA,KAAA,EAiBmD,CAjBnD,CAAA,EAiBuD,OAjBvD,CAiB+D,CAjB/D,CAAA;;;;AAJA;;;;;AAqBd;;AAAiE,iBAYjD,OAZiD,CAAA,UAY/B,aAZ+B,CAAA,OAAA,CAAA,CAAA,CAAA,CAAA,EAAA,CAAA,KAAA,EAaxD,CAbwD,EAAA,GAc5D,OAd4D,CAcpD,CAdoD,CAAA"}

package/dist/reverse.js

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

package/dist/reverse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reverse.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":"wCA0CA,SAAgB,EAAQ,GAAG,EAAuC,CAChE,OAAO,EAAM,EAAuB,EAAK,CAG3C,SAAS,EAAyB,EAAmC,CAEnE,MAAO,CAAC,GAAG,EAAM,CAAC,SAAS"}

package/dist/round.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`),require(`./with-precision-BgF-Y_mF.cjs`);const e=require(`./round-CBhbfa_y.cjs`);exports.round=e.round;
+const e=require(`./curry-BsY0Z8jH.cjs`),t=require(`./with-precision-dQAYLrgr.cjs`);function n(...n){return e.t(t.t(Math.round),n)}exports.round=n;