@vinicunca/perkakas 1.8.0 → 1.12.0

package/dist/range-EauFMBl4.d.cts

@@ -1,27 +0,0 @@
-//#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

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

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

@@ -1,45 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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

@@ -1 +0,0 @@
-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

@@ -1,2 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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

@@ -1,45 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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/reduce-BXmHWGo2.cjs

@@ -1 +0,0 @@
-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

@@ -1,53 +0,0 @@
-//#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

@@ -1 +0,0 @@
-{"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

@@ -1,53 +0,0 @@
-//#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

@@ -1 +0,0 @@
-{"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

@@ -1,2 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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/reordered-array-BJtughHE.d.ts

@@ -1,7 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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

@@ -1,7 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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

@@ -1,29 +0,0 @@
-//#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

@@ -1 +0,0 @@
-{"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

@@ -1,2 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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

@@ -1 +0,0 @@
-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

@@ -1,29 +0,0 @@
-//#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

@@ -1 +0,0 @@
-{"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/round-BDhuebcp.d.ts

@@ -1,39 +0,0 @@
-//#region src/round.d.ts
-/**
- * Rounds a given number to a specific precision.
- * If you'd like to round to an integer (i.e. use this function with constant `precision === 0`),
- * use `Math.round` instead, as it won't incur the additional library overhead.
- *
- * @param value - The number to round.
- * @param precision - The precision to round to. Must be an integer between -15 and 15.
- * @signature
- *    P.round(value, precision);
- * @example
- *    P.round(123.9876, 3) // => 123.988
- *    P.round(483.22243, 1) // => 483.2
- *    P.round(8541, -1) // => 8540
- *    P.round(456789, -3) // => 457000
- * @dataFirst
- * @category Number
- */
-declare function round(value: number, precision: number): number;
-/**
- * Rounds a given number to a specific precision.
- * If you'd like to round to an integer (i.e. use this function with constant `precision === 0`),
- * use `Math.round` instead, as it won't incur the additional library overhead.
- *
- * @param precision - The precision to round to. Must be an integer between -15 and 15.
- * @signature
- *    P.round(precision)(value);
- * @example
- *    P.round(3)(123.9876) // => 123.988
- *    P.round(1)(483.22243) // => 483.2
- *    P.round(-1)(8541) // => 8540
- *    P.round(-3)(456789) // => 457000
- * @dataLast
- * @category Number
- */
-declare function round(precision: number): (value: number) => number;
-//#endregion
-export { round };
-//# sourceMappingURL=round-BDhuebcp.d.ts.map

package/dist/round-BDhuebcp.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"round-BDhuebcp.d.ts","names":[],"sources":["../src/round.ts"],"sourcesContent":[],"mappings":";;AAoBA;AAkBA;;;;;;;;;;;;;;;iBAlBgB,KAAA;;;;;;;;;;;;;;;;;iBAkBA,KAAA"}

package/dist/round-CBhbfa_y.cjs

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

package/dist/round-DhclizH1.js

@@ -1,2 +0,0 @@
-import{curry as e}from"./curry-CzZjDrpv.js";import{withPrecision as t}from"./with-precision-BoiuafbM.js";function n(...n){return e(t(Math.round),n)}export{n as round};
-//# sourceMappingURL=round-DhclizH1.js.map

package/dist/round-DhclizH1.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"round-DhclizH1.js","names":[],"sources":["../src/round.ts"],"sourcesContent":["import { curry } from './curry';\nimport { withPrecision } from './internal/with-precision';\n\n/**\n * Rounds a given number to a specific precision.\n * If you'd like to round to an integer (i.e. use this function with constant `precision === 0`),\n * use `Math.round` instead, as it won't incur the additional library overhead.\n *\n * @param value - The number to round.\n * @param precision - The precision to round to. Must be an integer between -15 and 15.\n * @signature\n *    P.round(value, precision);\n * @example\n *    P.round(123.9876, 3) // => 123.988\n *    P.round(483.22243, 1) // => 483.2\n *    P.round(8541, -1) // => 8540\n *    P.round(456789, -3) // => 457000\n * @dataFirst\n * @category Number\n */\nexport function round(value: number, precision: number): number;\n\n/**\n * Rounds a given number to a specific precision.\n * If you'd like to round to an integer (i.e. use this function with constant `precision === 0`),\n * use `Math.round` instead, as it won't incur the additional library overhead.\n *\n * @param precision - The precision to round to. Must be an integer between -15 and 15.\n * @signature\n *    P.round(precision)(value);\n * @example\n *    P.round(3)(123.9876) // => 123.988\n *    P.round(1)(483.22243) // => 483.2\n *    P.round(-1)(8541) // => 8540\n *    P.round(-3)(456789) // => 457000\n * @dataLast\n * @category Number\n */\nexport function round(precision: number): (value: number) => number;\n\nexport function round(...args: ReadonlyArray<unknown>): unknown {\n  return curry(withPrecision(Math.round), args);\n}\n"],"mappings":"yGAwCA,SAAgB,EAAM,GAAG,EAAuC,CAC9D,OAAO,EAAM,EAAc,KAAK,MAAM,CAAE,EAAK"}

package/dist/round-rQiLyN4w.d.cts

@@ -1,39 +0,0 @@
-//#region src/round.d.ts
-/**
- * Rounds a given number to a specific precision.
- * If you'd like to round to an integer (i.e. use this function with constant `precision === 0`),
- * use `Math.round` instead, as it won't incur the additional library overhead.
- *
- * @param value - The number to round.
- * @param precision - The precision to round to. Must be an integer between -15 and 15.
- * @signature
- *    P.round(value, precision);
- * @example
- *    P.round(123.9876, 3) // => 123.988
- *    P.round(483.22243, 1) // => 483.2
- *    P.round(8541, -1) // => 8540
- *    P.round(456789, -3) // => 457000
- * @dataFirst
- * @category Number
- */
-declare function round(value: number, precision: number): number;
-/**
- * Rounds a given number to a specific precision.
- * If you'd like to round to an integer (i.e. use this function with constant `precision === 0`),
- * use `Math.round` instead, as it won't incur the additional library overhead.
- *
- * @param precision - The precision to round to. Must be an integer between -15 and 15.
- * @signature
- *    P.round(precision)(value);
- * @example
- *    P.round(3)(123.9876) // => 123.988
- *    P.round(1)(483.22243) // => 483.2
- *    P.round(-1)(8541) // => 8540
- *    P.round(-3)(456789) // => 457000
- * @dataLast
- * @category Number
- */
-declare function round(precision: number): (value: number) => number;
-//#endregion
-export { round };
-//# sourceMappingURL=round-rQiLyN4w.d.cts.map

package/dist/round-rQiLyN4w.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"round-rQiLyN4w.d.cts","names":[],"sources":["../src/round.ts"],"sourcesContent":[],"mappings":";;AAoBA;AAkBA;;;;;;;;;;;;;;;iBAlBgB,KAAA;;;;;;;;;;;;;;;;;iBAkBA,KAAA"}

package/dist/sample-9vI5EmCM.d.cts

@@ -1,69 +0,0 @@
-import { IterableContainer } from "./iterable-container-V5sa0V_H.cjs";
-import { NTuple } from "./n-tuple-Co_jgwEn.cjs";
-import { PartialArray } from "./partial-array-CzOnr197.cjs";
-import { TupleParts } from "./tuple-parts-BIyABPYv.cjs";
-import { CoercedArray } from "./coerced-array-kVJtBrMl.cjs";
-import { FixedLengthArray, IsEqual, IsNever, NonNegativeInteger, Or, Writable } from "type-fest";
-
-//#region src/sample.d.ts
-type Sampled<T extends IterableContainer, N extends number> = Or<IsEqual<N, 0>, IsEqual<T['length'], 0>> extends true ? [] : IsNever<NonNegativeInteger<N>> extends true ? SampledPrimitive<T> : IsLongerThan<T, N> extends true ? SampledLiteral<T, N> : Writable<T>;
-/**
- * When N is not a non-negative integer **literal** we can't use it in our
- * reconstructing logic so we fallback to a simpler definition of the output of
- * sample, which is any sub-tuple shape of T, of **any length**.
- */
-type SampledPrimitive<T extends IterableContainer> = [...FixedSubTuples<TupleParts<T>['required']>, ...PartialArray<FixedSubTuples<TupleParts<T>['optional']>>, ...CoercedArray<TupleParts<T>['item']>, ...FixedSubTuples<TupleParts<T>['suffix']>];
-/**
- * Knowing N is a non-negative literal integer we can construct all sub-tuples
- * of T that are exactly N elements long.
- */
-type SampledLiteral<T extends IterableContainer, N extends number> = Extract<FixedSubTuples<[...TupleParts<T>['required'], ...(IsNever<TupleParts<T>['item']> extends true ? [] : NTuple<TupleParts<T>['item'], N>), ...TupleParts<T>['suffix']]>, FixedLengthArray<unknown, N>> | SubSampled<TupleParts<T>['required'], TupleParts<T>['item'], TupleParts<T>['suffix'], N>;
-type SubSampled<Prefix extends ReadonlyArray<unknown>, Item, Suffix extends ReadonlyArray<unknown>, N extends number> = IsLongerThan<[...Prefix, ...Suffix], N> extends true ? never : [...Prefix, ...Suffix]['length'] extends N ? never : [...Prefix, ...Suffix] | SubSampled<[...Prefix, Item], Item, Suffix, N>;
-type IsLongerThan<T extends ReadonlyArray<unknown>, N extends number> = IsEqual<T[N], undefined> extends true ? false : true;
-type FixedSubTuples<T> = T extends readonly [infer Head, ...infer Rest] ? FixedSubTuples<Rest> | [Head, ...FixedSubTuples<Rest>] : [];
-/**
- * Returns a random subset of size `sampleSize` from `array`.
- *
- * Maintains and infers most of the typing information that could be passed
- * along to the output. This means that when using tuples, the output will be
- * a tuple too, and when using literals, those literals would be preserved.
- *
- * The items in the result are kept in the same order as they are in the input.
- * If you need to get a shuffled response you can pipe the shuffle function
- * after this one.
- *
- * @param data - The array.
- * @param sampleSize - The number of elements to take.
- * @signature
- *    P.sample(array, sampleSize)
- * @example
- *    P.sample(["hello", "world"], 1); // => ["hello"] // typed string[]
- *    P.sample(["hello", "world"] as const, 1); // => ["world"] // typed ["hello" | "world"]
- * @dataFirst
- * @category Array
- */
-declare function sample<const T extends IterableContainer, N extends number = number>(data: T, sampleSize: N): Sampled<T, N>;
-/**
- * Returns a random subset of size `sampleSize` from `array`.
- *
- * Maintains and infers most of the typing information that could be passed
- * along to the output. This means that when using tuples, the output will be
- * a tuple too, and when using literals, those literals would be preserved.
- *
- * The items in the result are kept in the same order as they are in the input.
- * If you need to get a shuffled response you can pipe the shuffle function
- * after this one.
- *
- * @param sampleSize - The number of elements to take.
- * @signature
- *    P.sample(sampleSize)(array)
- * @example
- *    P.sample(1)(["hello", "world"]); // => ["hello"] // typed string[]
- *    P.sample(1)(["hello", "world"] as const); // => ["world"] // typed ["hello" | "world"]
- * @dataLast
- * @category Array
- */
-declare function sample<const T extends IterableContainer, N extends number = number>(sampleSize: N): (data: T) => Sampled<T, N>;
-//#endregion
-export { sample };
-//# sourceMappingURL=sample-9vI5EmCM.d.cts.map

package/dist/sample-9vI5EmCM.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sample-9vI5EmCM.d.cts","names":[],"sources":["../src/sample.ts"],"sourcesContent":[],"mappings":";;;;;;;;KAeK,kBAAkB,uCACnB,GAAG,QAAQ,OAAO,QAAQ,qCAGxB,QAAQ,mBAAmB,mBACzB,iBAAiB,KACjB,aAAa,GAAG,kBACd,eAAe,GAAG,KAIlB,SAAS;;AAd4C;;;;KAqB1D,gBAjBE,CAAA,UAiByB,iBAjBzB,CAAA,GAAA,IAkBF,cAlByB,CAkBV,UAlBU,CAkBC,CAlBD,CAAA,CAAA,UAAA,CAAA,CAAA,KAoBzB,YApBiB,CAoBJ,cApBI,CAoBW,UApBX,CAoBsB,CApBtB,CAAA,CAAA,UAAA,CAAA,CAAA,CAAA,KAqBjB,YArBD,CAqBc,UArBd,CAqByB,CArBzB,CAAA,CAAA,MAAA,CAAA,CAAA,KAsBC,cAnB4B,CAmBb,UAnBa,CAmBF,CAnBE,CAAA,CAAA,QAAA,CAAA,CAAA;;;;;KAyB5B,cAvBmB,CAAA,UAuBM,iBAvBN,EAAA,UAAA,MAAA,CAAA,GAwBlB,OAxBkB,CAyBlB,cAzBkB,CAAA,IA2BX,UA3BL,CA2BgB,CA3BhB,CAAA,CAAA,UAAA,CAAA,KACiB,CA+BX,OA/BW,CA+BH,UA/BG,CA+BQ,CA/BR,CAAA,CAAA,MAAA,CAAA,CAAA,SAAA,IAAA,GAAA,EAAA,GAiCX,MAjCW,CAiCJ,UAjCI,CAiCO,CAjCP,CAAA,CAAA,MAAA,CAAA,EAiCmB,CAjCnB,CAAA,CAAA,KAkCZ,UAlCe,CAkCJ,CAlCI,CAAA,CAAA,QAAA,CAAA,IAsCtB,gBAtCI,CAAA,OAAA,EAsCsB,CAtCtB,CAAA,CAAA,GA2CJ,UA3CI,CA4CJ,UA5CI,CA4CO,CA5CP,CAAA,CAAA,UAAA,CAAA,EA8CJ,UA9CI,CA8CO,CA9CP,CAAA,CAAA,MAAA,CAAA,EA+CJ,UA/CI,CA+CO,CA/CP,CAAA,CAAA,QAAA,CAAA,EAgDJ,CAhDI,CAAA;KAsDL,UAlDc,CAAA,eAmDF,aAnDE,CAAA,OAAA,CAAA,EAAA,IAAA,EAAA,eAqDF,aArDE,CAAA,OAAA,CAAA,EAAA,UAAA,MAAA,CAAA,GAwDf,YAxDe,CAAA,CAAA,GAwDE,MAxDF,EAAA,GAwDa,MAxDb,CAAA,EAwDsB,CAxDtB,CAAA,SAAA,IAAA,GAAA,KAAA,GAAA,CAAA,GA2DT,MA3DS,EAAA,GA2DE,MA3DF,CAAA,CAAA,QAAA,CAAA,SA2D4B,CA3D5B,GAAA,KAAA,GAAA,CAAA,GA6DL,MA7DK,EAAA,GA6DM,MA7DN,CAAA,GA6DgB,UA7DhB,CAAA,CAAA,GA6D+B,MA7D/B,EA6DuC,IA7DvC,CAAA,EA6D8C,IA7D9C,EA6DoD,MA7DpD,EA6D4D,CA7D5D,CAAA;KA+Dd,YA/DK,CAAA,UA+DkB,aA/DlB,CAAA,OAAA,CAAA,EAAA,UAAA,MAAA,CAAA,GAmEN,OAnEM,CAmEE,CAnEF,CAmEI,CAnEJ,CAAA,EAAA,SAAA,CAAA,SAAA,IAAA,GAAA,KAAA,GAAA,IAAA;KAsEL,cAtEa,CAAA,CAAA,CAAA,GAsEO,CAtEP,SAAA,SAAA,CAAA,KAAA,KAAA,EAAA,GAAA,KAAA,KAAA,CAAA,GAwEd,cAxEc,CAwEC,IAxED,CAAA,GAAA,CAwEU,IAxEV,EAAA,GAwEmB,cAxEnB,CAwEkC,IAxElC,CAAA,CAAA,GAAA,EAAA;AAAA;;;;;;;;;;;;;;;;;AAYC;;;;AAUN,iBA0EG,MA1EH,CAAA,gBA0E0B,iBA1E1B,EAAA,UAAA,MAAA,GAAA,MAAA,CAAA,CAAA,IAAA,EA2EL,CA3EK,EAAA,UAAA,EA4EC,CA5ED,CAAA,EA6EV,OA7EU,CA6EF,CA7EE,EA6EC,CA7ED,CAAA;;;;;;;;;;;;;;;;;;;;;AAiBP,iBAkFU,MAlFV,CAAA,gBAkFiC,iBAlFjC,EAAA,UAAA,MAAA,GAAA,MAAA,CAAA,CAAA,UAAA,EAmFQ,CAnFR,CAAA,EAAA,CAAA,IAAA,EAoFI,CApFJ,EAAA,GAoFU,OApFV,CAoFkB,CApFlB,EAoFqB,CApFrB,CAAA"}