@vinicunca/perkakas 1.7.0 → 1.8.0

package/dist/random-integer-D27vFslT.js

@@ -0,0 +1,2 @@
+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-D27vFslT.js.map

package/dist/random-integer-D27vFslT.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-integer-D27vFslT.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-integer.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkSJMGQLYScjs = require('./chunk-SJMGQLYS.cjs');require('./chunk-MBGSSEZN.cjs');exports.randomInteger = _chunkSJMGQLYScjs.a;
+const e=require(`./random-integer-6gYh92ze.cjs`);exports.randomInteger=e.randomInteger;

package/dist/random-integer.d.cts

@@ -1,21 +1,3 @@
-import { Or, IsNever, NonNegativeInteger, IsEqual, GreaterThan, GreaterThanOrEqual } from 'type-fest';
-import { I as IntRangeInclusive } from './int-range-inclusive-Cn-qsrAN.cjs';
-
-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>;
-
-export { randomInteger };
+import "./int-range-inclusive-DZG3R2Xl.cjs";
+import { randomInteger } from "./random-integer-6M2bFpGx.cjs";
+export { randomInteger };

package/dist/random-integer.d.ts

@@ -1,21 +1,3 @@
-import { Or, IsNever, NonNegativeInteger, IsEqual, GreaterThan, GreaterThanOrEqual } from 'type-fest';
-import { I as IntRangeInclusive } from './int-range-inclusive-Cn-qsrAN.js';
-
-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>;
-
-export { randomInteger };
+import "./int-range-inclusive-BSXuRjMO.js";
+import { randomInteger } from "./random-integer-BschXumd.js";
+export { randomInteger };

package/dist/random-integer.js

@@ -1 +1 @@
-import{a}from"./chunk-I2Z6A55T.js";import"./chunk-EK7ODJWE.js";export{a as randomInteger};
+import{randomInteger as e}from"./random-integer-D27vFslT.js";export{e as randomInteger};

package/dist/random-string-B49LA01O.js

@@ -0,0 +1,2 @@
+import{curry as e}from"./curry-CzZjDrpv.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-B49LA01O.js.map

package/dist/random-string-B49LA01O.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-string-B49LA01O.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":"4CAgCA,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/random-string-DBUea-au.d.ts

@@ -0,0 +1,29 @@
+//#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-DBUea-au.d.ts.map

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

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

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

@@ -0,0 +1,29 @@
+//#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-DlACN4ZV.d.cts.map

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

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

package/dist/random-string-LG5QFZXR.cjs

@@ -0,0 +1 @@
+const e=require(`./curry-BPVIsvo3.cjs`),t=`ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789`;function n(...t){return e.curry(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(``)}Object.defineProperty(exports,`randomString`,{enumerable:!0,get:function(){return n}});

package/dist/random-string.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk63GGX2BScjs = require('./chunk-63GGX2BS.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.randomString = _chunk63GGX2BScjs.a;
+require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./random-string-LG5QFZXR.cjs`);exports.randomString=e.randomString;

package/dist/random-string.d.cts

@@ -1,27 +1,2 @@
-/**
- * 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;
-
-export { randomString };
+import { randomString } from "./random-string-DlACN4ZV.cjs";
+export { randomString };

package/dist/random-string.d.ts

@@ -1,27 +1,2 @@
-/**
- * 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;
-
-export { randomString };
+import { randomString } from "./random-string-DBUea-au.js";
+export { randomString };

package/dist/random-string.js

@@ -1 +1 @@
-import{a}from"./chunk-U6ZJSHFS.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as randomString};
+import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{randomString as e}from"./random-string-B49LA01O.js";export{e as randomString};

package/dist/range-BNpqskPd.d.ts

@@ -0,0 +1,27 @@
+//#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-BNpqskPd.d.ts.map

package/dist/range-BNpqskPd.d.ts.map

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

package/dist/range-BYm8b8OO.cjs

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

package/dist/range-BtCOvN_L.js

@@ -0,0 +1,2 @@
+import{curry as e}from"./curry-CzZjDrpv.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-BtCOvN_L.js.map

package/dist/range-BtCOvN_L.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"range-BtCOvN_L.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":"4CA2BA,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/range-EauFMBl4.d.cts

@@ -0,0 +1,27 @@
+//#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-EauFMBl4.d.cts.map

package/dist/range-EauFMBl4.d.cts.map

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

package/dist/range.cjs

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

package/dist/range.d.cts

@@ -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-EauFMBl4.cjs";
+export { range };

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}});