@vinicunca/perkakas 1.13.2 → 1.14.0

package/dist/random-integer.d.cts

@@ -1,23 +0,0 @@
-import { t as IntRangeInclusive } from "./int-range-inclusive-KocNpK0p.cjs";
-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.cts.map

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

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

@@ -1,23 +0,0 @@
-import { t as IntRangeInclusive } from "./int-range-inclusive-BlGXX6Cz.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

@@ -1 +0,0 @@
-{"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-string.d.cts

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

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

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

package/dist/range.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.d.cts.map

package/dist/range.d.cts.map

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

package/dist/range.d.ts.map

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

package/dist/rank-by.d.cts

@@ -1,45 +0,0 @@
-import { t as NonEmptyArray } from "./non-empty-array-NDjbHRjk.cjs";
-import { t as OrderRule } from "./curry-order-rules-BoF09Dq2.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

@@ -1 +0,0 @@
-{"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,45 +0,0 @@
-import { t as NonEmptyArray } from "./non-empty-array-DHAKSw6t.js";
-import { t as OrderRule } from "./curry-order-rules-CoO4bk5I.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

@@ -1 +0,0 @@
-{"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/reduce.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.d.cts.map

package/dist/reduce.d.cts.map

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

package/dist/reduce.d.ts.map

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

@@ -1,7 +0,0 @@
-import { t as IterableContainer } from "./iterable-container-Dv5vSKht.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-BWG6tVSK.d.ts.map

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

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

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

@@ -1,7 +0,0 @@
-import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.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-CmReuxDi.d.cts.map

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

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

package/dist/reverse.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.d.cts.map

package/dist/reverse.d.cts.map

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

package/dist/reverse.d.ts.map

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

package/dist/round.d.cts.map

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

package/dist/round.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.d.ts.map

package/dist/round.d.ts.map

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