@vinicunca/perkakas 1.13.2 → 1.15.0

package/dist/swap-props.d.cts

@@ -1,34 +0,0 @@
-//#region src/swap-props.d.ts
-type SwappedProps<T, K1 extends keyof T, K2 extends keyof T> = { [K in keyof T]: T[K1 extends K ? K2 : K2 extends K ? K1 : K] };
-/**
- * Swaps the positions of two properties in an object based on the provided keys.
- *
- * @param data - The object to be manipulated.
- * @param key1 - The first property key.
- * @param key2 - The second property key.
- * @returns Returns the manipulated object.
- * @signature
- *   swap(data, key1, key2)
- * @example
- *   swap({a: 1, b: 2, c: 3}, 'a', 'b') // => {a: 2, b: 1, c: 3}
- * @dataFirst
- * @category Object
- */
-declare function swapProps<T extends object, K1 extends keyof T, K2 extends keyof T>(data: T, key1: K1, key2: K2): SwappedProps<T, K1, K2>;
-/**
- * Swaps the positions of two properties in an object based on the provided keys.
- *
- * @param key1 - The first property key.
- * @param key2 - The second property key.
- * @returns Returns the manipulated object.
- * @signature
- *   swap(key1, key2)(data)
- * @example
- *   swap('a', 'b')({a: 1, b: 2, c: 3}) // => {a: 2, b: 1, c: 3}
- * @dataLast
- * @category Object
- */
-declare function swapProps<T extends object, K1 extends keyof T, K2 extends keyof T>(key1: K1, key2: K2): (data: T) => SwappedProps<T, K1, K2>;
-//#endregion
-export { swapProps };
-//# sourceMappingURL=swap-props.d.cts.map

package/dist/swap-props.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"swap-props.d.cts","names":[],"sources":["../src/swap-props.ts"],"sourcesContent":[],"mappings":";KAEK,iCAAiC,oBAAoB,aAArD,MACS,CADT,GACa,CADD,CACG,EADH,SACc,CADd,GACkB,EADlB,GACuB,EADvB,SACkC,CADlC,GACsC,EADtC,GAC2C,CAD3C,CAAA,EAAqB;;;;;;;;;;;;AAkBtC;;;AAIQ,iBAJQ,SAIR,CAAA,UAAA,MAAA,EAAA,WAAA,MAFW,CAEX,EAAA,WAAA,MADW,CACX,CAAA,CAAA,IAAA,EAAA,CAAA,EAAA,IAAA,EAAS,EAAT,EAAA,IAAA,EAAmB,EAAnB,CAAA,EAAwB,YAAxB,CAAqC,CAArC,EAAwC,EAAxC,EAA4C,EAA5C,CAAA;;;;;;;;AAeR;;;;;;AAIiD,iBAJjC,SAIiC,CAAA,UAAA,MAAA,EAAA,WAAA,MAF9B,CAE8B,EAAA,WAAA,MAD9B,CAC8B,CAAA,CAAA,IAAA,EAAzC,EAAyC,EAAA,IAAA,EAA/B,EAA+B,CAAA,EAAA,CAAA,IAAA,EAAnB,CAAmB,EAAA,GAAb,YAAa,CAAA,CAAA,EAAG,EAAH,EAAO,EAAP,CAAA"}

package/dist/swap-props.d.ts

@@ -1,34 +0,0 @@
-//#region src/swap-props.d.ts
-type SwappedProps<T, K1 extends keyof T, K2 extends keyof T> = { [K in keyof T]: T[K1 extends K ? K2 : K2 extends K ? K1 : K] };
-/**
- * Swaps the positions of two properties in an object based on the provided keys.
- *
- * @param data - The object to be manipulated.
- * @param key1 - The first property key.
- * @param key2 - The second property key.
- * @returns Returns the manipulated object.
- * @signature
- *   swap(data, key1, key2)
- * @example
- *   swap({a: 1, b: 2, c: 3}, 'a', 'b') // => {a: 2, b: 1, c: 3}
- * @dataFirst
- * @category Object
- */
-declare function swapProps<T extends object, K1 extends keyof T, K2 extends keyof T>(data: T, key1: K1, key2: K2): SwappedProps<T, K1, K2>;
-/**
- * Swaps the positions of two properties in an object based on the provided keys.
- *
- * @param key1 - The first property key.
- * @param key2 - The second property key.
- * @returns Returns the manipulated object.
- * @signature
- *   swap(key1, key2)(data)
- * @example
- *   swap('a', 'b')({a: 1, b: 2, c: 3}) // => {a: 2, b: 1, c: 3}
- * @dataLast
- * @category Object
- */
-declare function swapProps<T extends object, K1 extends keyof T, K2 extends keyof T>(key1: K1, key2: K2): (data: T) => SwappedProps<T, K1, K2>;
-//#endregion
-export { swapProps };
-//# sourceMappingURL=swap-props.d.ts.map

package/dist/swap-props.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"swap-props.d.ts","names":[],"sources":["../src/swap-props.ts"],"sourcesContent":[],"mappings":";KAEK,iCAAiC,oBAAoB,aAArD,MACS,CADT,GACa,CADD,CACG,EADH,SACc,CADd,GACkB,EADlB,GACuB,EADvB,SACkC,CADlC,GACsC,EADtC,GAC2C,CAD3C,CAAA,EAAqB;;;;;;;;;;;;AAkBtC;;;AAIQ,iBAJQ,SAIR,CAAA,UAAA,MAAA,EAAA,WAAA,MAFW,CAEX,EAAA,WAAA,MADW,CACX,CAAA,CAAA,IAAA,EAAA,CAAA,EAAA,IAAA,EAAS,EAAT,EAAA,IAAA,EAAmB,EAAnB,CAAA,EAAwB,YAAxB,CAAqC,CAArC,EAAwC,EAAxC,EAA4C,EAA5C,CAAA;;;;;;;;AAeR;;;;;;AAIiD,iBAJjC,SAIiC,CAAA,UAAA,MAAA,EAAA,WAAA,MAF9B,CAE8B,EAAA,WAAA,MAD9B,CAC8B,CAAA,CAAA,IAAA,EAAzC,EAAyC,EAAA,IAAA,EAA/B,EAA+B,CAAA,EAAA,CAAA,IAAA,EAAnB,CAAmB,EAAA,GAAb,YAAa,CAAA,CAAA,EAAG,EAAH,EAAO,EAAP,CAAA"}

package/dist/take-first-by.d.cts

@@ -1,41 +0,0 @@
-import { t as NonEmptyArray } from "./non-empty-array-NDjbHRjk.cjs";
-import { t as OrderRule } from "./curry-order-rules-BoF09Dq2.cjs";
-
-//#region src/take-first-by.d.ts
-
-/**
- * Take the first `n` items from `data` based on the provided ordering criteria. This allows you to avoid sorting the array before taking the items. The complexity of this function is *O(Nlogn)* where `N` is the length of the array.
- *
- * For the opposite operation (to drop `n` elements) see `dropFirstBy`.
- *
- * @param data - The input array.
- * @param n - The number of items to take. If `n` is non-positive no items would be returned, if `n` is bigger then data.length a *clone* of `data` would be returned.
- * @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 A subset of the input array.
- * @signature
- *   P.takeFirstBy(data, n, ...rules);
- * @example
- *   P.takeFirstBy(['aa', 'aaaa', 'a', 'aaa'], 2, x => x.length); // => ['a', 'aa']
- * @dataFirst
- * @category Array
- */
-declare function takeFirstBy<T>(data: ReadonlyArray<T>, n: number, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): Array<T>;
-/**
- * Take the first `n` items from `data` based on the provided ordering criteria. This allows you to avoid sorting the array before taking the items. The complexity of this function is *O(Nlogn)* where `N` is the length of the array.
- *
- * For the opposite operation (to drop `n` elements) see `dropFirstBy`.
- *
- * @param n - The number of items to take. If `n` is non-positive no items would be returned, if `n` is bigger then data.length a *clone* of `data` would be returned.
- * @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 A subset of the input array.
- * @signature
- *   P.takeFirstBy(n, ...rules)(data);
- * @example
- *   P.pipe(['aa', 'aaaa', 'a', 'aaa'], P.takeFirstBy(2, x => x.length)); // => ['a', 'aa']
- * @dataLast
- * @category Array
- */
-declare function takeFirstBy<T>(n: number, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): (data: ReadonlyArray<T>) => Array<T>;
-//#endregion
-export { takeFirstBy };
-//# sourceMappingURL=take-first-by.d.cts.map

package/dist/take-first-by.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"take-first-by.d.cts","names":[],"sources":["../src/take-first-by.ts"],"sourcesContent":[],"mappings":";;;;;;;AA0BA;;;;;;;;;;AAqBA;;;;AAEY,iBAvBI,WAuBJ,CAAA,CAAA,CAAA,CAAA,IAAA,EAtBJ,aAsBI,CAtBU,CAsBV,CAAA,EAAA,CAAA,EAAA,MAAA,EAAA,GAAA,KAAA,EApBA,QAoBA,CApBS,aAoBT,CApBuB,SAoBvB,CApBiC,CAoBjC,CAAA,CAAA,CAAA,CAAA,EAnBT,KAmBS,CAnBH,CAmBG,CAAA;;;;;;;;;;;;;;;;iBAFI,oCAEJ,SAAS,cAAc,UAAU,cACnC,cAAc,OAAO,MAAM"}

package/dist/take-first-by.d.ts

@@ -1,41 +0,0 @@
-import { t as NonEmptyArray } from "./non-empty-array-DHAKSw6t.js";
-import { t as OrderRule } from "./curry-order-rules-CoO4bk5I.js";
-
-//#region src/take-first-by.d.ts
-
-/**
- * Take the first `n` items from `data` based on the provided ordering criteria. This allows you to avoid sorting the array before taking the items. The complexity of this function is *O(Nlogn)* where `N` is the length of the array.
- *
- * For the opposite operation (to drop `n` elements) see `dropFirstBy`.
- *
- * @param data - The input array.
- * @param n - The number of items to take. If `n` is non-positive no items would be returned, if `n` is bigger then data.length a *clone* of `data` would be returned.
- * @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 A subset of the input array.
- * @signature
- *   P.takeFirstBy(data, n, ...rules);
- * @example
- *   P.takeFirstBy(['aa', 'aaaa', 'a', 'aaa'], 2, x => x.length); // => ['a', 'aa']
- * @dataFirst
- * @category Array
- */
-declare function takeFirstBy<T>(data: ReadonlyArray<T>, n: number, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): Array<T>;
-/**
- * Take the first `n` items from `data` based on the provided ordering criteria. This allows you to avoid sorting the array before taking the items. The complexity of this function is *O(Nlogn)* where `N` is the length of the array.
- *
- * For the opposite operation (to drop `n` elements) see `dropFirstBy`.
- *
- * @param n - The number of items to take. If `n` is non-positive no items would be returned, if `n` is bigger then data.length a *clone* of `data` would be returned.
- * @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 A subset of the input array.
- * @signature
- *   P.takeFirstBy(n, ...rules)(data);
- * @example
- *   P.pipe(['aa', 'aaaa', 'a', 'aaa'], P.takeFirstBy(2, x => x.length)); // => ['a', 'aa']
- * @dataLast
- * @category Array
- */
-declare function takeFirstBy<T>(n: number, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): (data: ReadonlyArray<T>) => Array<T>;
-//#endregion
-export { takeFirstBy };
-//# sourceMappingURL=take-first-by.d.ts.map

package/dist/take-first-by.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"take-first-by.d.ts","names":[],"sources":["../src/take-first-by.ts"],"sourcesContent":[],"mappings":";;;;;;;AA0BA;;;;;;;;;;AAqBA;;;;AAEY,iBAvBI,WAuBJ,CAAA,CAAA,CAAA,CAAA,IAAA,EAtBJ,aAsBI,CAtBU,CAsBV,CAAA,EAAA,CAAA,EAAA,MAAA,EAAA,GAAA,KAAA,EApBA,QAoBA,CApBS,aAoBT,CApBuB,SAoBvB,CApBiC,CAoBjC,CAAA,CAAA,CAAA,CAAA,EAnBT,KAmBS,CAnBH,CAmBG,CAAA;;;;;;;;;;;;;;;;iBAFI,oCAEJ,SAAS,cAAc,UAAU,cACnC,cAAc,OAAO,MAAM"}

package/dist/take-last-while.d.cts

@@ -1,36 +0,0 @@
-import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
-
-//#region src/take-last-while.d.ts
-
-/**
- * Returns elements from the end of the array until the predicate returns false.
- * The returned elements will be in the same order as in the original array.
- *
- * @param data - The array.
- * @param predicate - The predicate.
- * @signature
- *    P.takeLastWhile(data, predicate)
- * @example
- *    P.takeLastWhile([1, 2, 10, 3, 4, 5], x => x < 10) // => [3, 4, 5]
- * @dataFirst
- * @category Array
- */
-declare function takeLastWhile<T extends IterableContainer, S extends T[number]>(data: T, predicate: (item: T[number], index: number, data: T) => item is S): Array<S>;
-declare function takeLastWhile<T extends IterableContainer>(data: T, predicate: (item: T[number], index: number, data: T) => boolean): Array<T[number]>;
-/**
- * Returns elements from the end of the array until the predicate returns false.
- * The returned elements will be in the same order as in the original array.
- *
- * @param predicate - The predicate.
- * @signature
- *    P.takeLastWhile(predicate)(data)
- * @example
- *    P.pipe([1, 2, 10, 3, 4, 5], P.takeLastWhile(x => x < 10))  // => [3, 4, 5]
- * @dataLast
- * @category Array
- */
-declare function takeLastWhile<T extends IterableContainer, S extends T[number]>(predicate: (item: T[number], index: number, data: T) => item is S): (array: T) => Array<S>;
-declare function takeLastWhile<T extends IterableContainer>(predicate: (item: T[number], index: number, data: T) => boolean): (data: T) => Array<T[number]>;
-//#endregion
-export { takeLastWhile };
-//# sourceMappingURL=take-last-while.d.cts.map

package/dist/take-last-while.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"take-last-while.d.cts","names":[],"sources":["../src/take-last-while.ts"],"sourcesContent":[],"mappings":";;;;;;AAiBA;;;;;;;;;;AAIA;AAAwC,iBAJxB,aAIwB,CAAA,UAJA,iBAIA,EAAA,UAJ6B,CAI7B,CAAA,MAAA,CAAA,CAAA,CAAA,IAAA,EAHhC,CAGgC,EAAA,SAAA,EAAA,CAAA,IAAA,EAFpB,CAEoB,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAFY,CAEZ,EAAA,GAAA,IAAA,IAF0B,CAE1B,CAAA,EADrC,KACqC,CAD/B,CAC+B,CAAA;AAChC,iBADQ,aACR,CAAA,UADgC,iBAChC,CAAA,CAAA,IAAA,EAAA,CAAA,EAAA,SAAA,EAAA,CAAA,IAAA,EACY,CADZ,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAC4C,CAD5C,EAAA,GAAA,OAAA,CAAA,EAEL,KAFK,CAEC,CAFD,CAAA,MAAA,CAAA,CAAA;;;;;;AAgBR;;;;;;;AAEuB,iBAFP,aAEO,CAAA,UAFiB,iBAEjB,EAAA,UAF8C,CAE9C,CAAA,MAAA,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,IAAA,EADH,CACG,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAD6B,CAC7B,EAAA,GAAA,IAAA,IAD2C,CAC3C,CAAA,EAAA,CAAA,KAAA,EAAZ,CAAY,EAAA,GAAN,KAAM,CAAA,CAAA,CAAA;AAAN,iBACD,aADC,CAAA,UACuB,iBADvB,CAAA,CAAA,SAAA,EAAA,CAAA,IAAA,EAEG,CAFH,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAEmC,CAFnC,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,IAAA,EAGP,CAHO,EAAA,GAGD,KAHC,CAGK,CAHL,CAAA,MAAA,CAAA,CAAA"}

package/dist/take-last-while.d.ts

@@ -1,36 +0,0 @@
-import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
-
-//#region src/take-last-while.d.ts
-
-/**
- * Returns elements from the end of the array until the predicate returns false.
- * The returned elements will be in the same order as in the original array.
- *
- * @param data - The array.
- * @param predicate - The predicate.
- * @signature
- *    P.takeLastWhile(data, predicate)
- * @example
- *    P.takeLastWhile([1, 2, 10, 3, 4, 5], x => x < 10) // => [3, 4, 5]
- * @dataFirst
- * @category Array
- */
-declare function takeLastWhile<T extends IterableContainer, S extends T[number]>(data: T, predicate: (item: T[number], index: number, data: T) => item is S): Array<S>;
-declare function takeLastWhile<T extends IterableContainer>(data: T, predicate: (item: T[number], index: number, data: T) => boolean): Array<T[number]>;
-/**
- * Returns elements from the end of the array until the predicate returns false.
- * The returned elements will be in the same order as in the original array.
- *
- * @param predicate - The predicate.
- * @signature
- *    P.takeLastWhile(predicate)(data)
- * @example
- *    P.pipe([1, 2, 10, 3, 4, 5], P.takeLastWhile(x => x < 10))  // => [3, 4, 5]
- * @dataLast
- * @category Array
- */
-declare function takeLastWhile<T extends IterableContainer, S extends T[number]>(predicate: (item: T[number], index: number, data: T) => item is S): (array: T) => Array<S>;
-declare function takeLastWhile<T extends IterableContainer>(predicate: (item: T[number], index: number, data: T) => boolean): (data: T) => Array<T[number]>;
-//#endregion
-export { takeLastWhile };
-//# sourceMappingURL=take-last-while.d.ts.map

package/dist/take-last-while.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"take-last-while.d.ts","names":[],"sources":["../src/take-last-while.ts"],"sourcesContent":[],"mappings":";;;;;;AAiBA;;;;;;;;;;AAIA;AAAwC,iBAJxB,aAIwB,CAAA,UAJA,iBAIA,EAAA,UAJ6B,CAI7B,CAAA,MAAA,CAAA,CAAA,CAAA,IAAA,EAHhC,CAGgC,EAAA,SAAA,EAAA,CAAA,IAAA,EAFpB,CAEoB,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAFY,CAEZ,EAAA,GAAA,IAAA,IAF0B,CAE1B,CAAA,EADrC,KACqC,CAD/B,CAC+B,CAAA;AAChC,iBADQ,aACR,CAAA,UADgC,iBAChC,CAAA,CAAA,IAAA,EAAA,CAAA,EAAA,SAAA,EAAA,CAAA,IAAA,EACY,CADZ,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAC4C,CAD5C,EAAA,GAAA,OAAA,CAAA,EAEL,KAFK,CAEC,CAFD,CAAA,MAAA,CAAA,CAAA;;;;;;AAgBR;;;;;;;AAEuB,iBAFP,aAEO,CAAA,UAFiB,iBAEjB,EAAA,UAF8C,CAE9C,CAAA,MAAA,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,IAAA,EADH,CACG,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAD6B,CAC7B,EAAA,GAAA,IAAA,IAD2C,CAC3C,CAAA,EAAA,CAAA,KAAA,EAAZ,CAAY,EAAA,GAAN,KAAM,CAAA,CAAA,CAAA;AAAN,iBACD,aADC,CAAA,UACuB,iBADvB,CAAA,CAAA,SAAA,EAAA,CAAA,IAAA,EAEG,CAFH,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAEmC,CAFnC,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,IAAA,EAGP,CAHO,EAAA,GAGD,KAHC,CAGK,CAHL,CAAA,MAAA,CAAA,CAAA"}

package/dist/take-last.d.cts

@@ -1,32 +0,0 @@
-import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
-
-//#region src/take-last.d.ts
-
-/**
- * Takes the last `n` elements from the `array`.
- *
- * @param array - The target array.
- * @param n - The number of elements to take.
- * @signature
- *    P.takeLast(array, n)
- * @example
- *    P.takeLast([1, 2, 3, 4, 5], 2) // => [4, 5]
- * @dataFirst
- * @category Array
- */
-declare function takeLast<T extends IterableContainer>(array: T, n: number): Array<T[number]>;
-/**
- * Take the last `n` elements from the `array`.
- *
- * @param n - The number of elements to take.
- * @signature
- *    P.takeLast(n)(array)
- * @example
- *    P.takeLast(2)([1, 2, 3, 4, 5]) // => [4, 5]
- * @dataLast
- * @category Array
- */
-declare function takeLast<T extends IterableContainer>(n: number): (array: T) => Array<T[number]>;
-//#endregion
-export { takeLast };
-//# sourceMappingURL=take-last.d.cts.map

package/dist/take-last.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"take-last.d.cts","names":[],"sources":["../src/take-last.ts"],"sourcesContent":[],"mappings":";;;;;;AAgBA;;;;;;AAeA;;;;AAEiB,iBAjBD,QAiBC,CAAA,UAjBkB,iBAiBlB,CAAA,CAAA,KAAA,EAhBR,CAgBQ,EAAA,CAAA,EAAA,MAAA,CAAA,EAdd,KAcc,CAdR,CAcQ,CAAA,MAAA,CAAA,CAAA;;;;;;;;;;;;iBAFD,mBAAmB,uCAExB,MAAM,MAAM"}

package/dist/take-last.d.ts

@@ -1,32 +0,0 @@
-import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
-
-//#region src/take-last.d.ts
-
-/**
- * Takes the last `n` elements from the `array`.
- *
- * @param array - The target array.
- * @param n - The number of elements to take.
- * @signature
- *    P.takeLast(array, n)
- * @example
- *    P.takeLast([1, 2, 3, 4, 5], 2) // => [4, 5]
- * @dataFirst
- * @category Array
- */
-declare function takeLast<T extends IterableContainer>(array: T, n: number): Array<T[number]>;
-/**
- * Take the last `n` elements from the `array`.
- *
- * @param n - The number of elements to take.
- * @signature
- *    P.takeLast(n)(array)
- * @example
- *    P.takeLast(2)([1, 2, 3, 4, 5]) // => [4, 5]
- * @dataLast
- * @category Array
- */
-declare function takeLast<T extends IterableContainer>(n: number): (array: T) => Array<T[number]>;
-//#endregion
-export { takeLast };
-//# sourceMappingURL=take-last.d.ts.map

package/dist/take-last.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"take-last.d.ts","names":[],"sources":["../src/take-last.ts"],"sourcesContent":[],"mappings":";;;;;;AAgBA;;;;;;AAeA;;;;AAEiB,iBAjBD,QAiBC,CAAA,UAjBkB,iBAiBlB,CAAA,CAAA,KAAA,EAhBR,CAgBQ,EAAA,CAAA,EAAA,MAAA,CAAA,EAdd,KAcc,CAdR,CAcQ,CAAA,MAAA,CAAA,CAAA;;;;;;;;;;;;iBAFD,mBAAmB,uCAExB,MAAM,MAAM"}

package/dist/take-while.d.cts

@@ -1,34 +0,0 @@
-import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
-
-//#region src/take-while.d.ts
-
-/**
- * Returns elements from the array until predicate returns false.
- *
- * @param data - The array.
- * @param predicate - The predicate.
- * @signature
- *    P.takeWhile(data, predicate)
- * @example
- *    P.takeWhile([1, 2, 3, 4, 3, 2, 1], x => x !== 4) // => [1, 2, 3]
- * @dataFirst
- * @category Array
- */
-declare function takeWhile<T extends IterableContainer, S extends T[number]>(data: T, predicate: (item: T[number], index: number, data: T) => item is S): Array<S>;
-declare function takeWhile<T extends IterableContainer>(data: T, predicate: (item: T[number], index: number, data: T) => boolean): Array<T[number]>;
-/**
- * Returns elements from the array until predicate returns false.
- *
- * @param predicate - The predicate.
- * @signature
- *    P.takeWhile(predicate)(data)
- * @example
- *    P.pipe([1, 2, 3, 4, 3, 2, 1], P.takeWhile(x => x !== 4))  // => [1, 2, 3]
- * @dataLast
- * @category Array
- */
-declare function takeWhile<T extends IterableContainer, S extends T[number]>(predicate: (item: T[number], index: number, data: T) => item is S): (array: T) => Array<S>;
-declare function takeWhile<T extends IterableContainer>(predicate: (item: T[number], index: number, data: T) => boolean): (array: T) => Array<T[number]>;
-//#endregion
-export { takeWhile };
-//# sourceMappingURL=take-while.d.cts.map

package/dist/take-while.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"take-while.d.cts","names":[],"sources":["../src/take-while.ts"],"sourcesContent":[],"mappings":";;;;;;AAgBA;;;;;;;;;;AAIgB,iBAJA,SAIS,CAAA,UAJW,iBAIX,EAAA,UAJwC,CAIxC,CAAA,MAAA,CAAA,CAAA,CAAA,IAAA,EAHjB,CAGiB,EAAA,SAAA,EAAA,CAAA,IAAA,EAFL,CAEK,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAF2B,CAE3B,EAAA,GAAA,IAAA,IAFyC,CAEzC,CAAA,EADtB,KACsB,CADhB,CACgB,CAAA;AAAW,iBAApB,SAAoB,CAAA,UAAA,iBAAA,CAAA,CAAA,IAAA,EAC5B,CAD4B,EAAA,SAAA,EAAA,CAAA,IAAA,EAEhB,CAFgB,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAEgB,CAFhB,EAAA,GAAA,OAAA,CAAA,EAGjC,KAHiC,CAG3B,CAH2B,CAAA,MAAA,CAAA,CAAA;;;;;;;AAgBpC;;;;;AACkE,iBADlD,SACkD,CAAA,UAD9B,iBAC8B,EAAA,UADD,CACC,CAAA,MAAA,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,IAAA,EAA9C,CAA8C,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAAd,CAAc,EAAA,GAAA,IAAA,IAAA,CAAA,CAAA,EAAA,CAAA,KAAA,EACvD,CADuD,EAAA,GACjD,KADiD,CAC3C,CAD2C,CAAA;AACvD,iBACK,SADL,CAAA,UACyB,iBADzB,CAAA,CAAA,SAAA,EAAA,CAAA,IAAA,EAES,CAFT,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAEyC,CAFzC,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,KAAA,EAGA,CAHA,EAAA,GAGM,KAHN,CAGY,CAHZ,CAAA,MAAA,CAAA,CAAA"}

package/dist/take-while.d.ts

@@ -1,34 +0,0 @@
-import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
-
-//#region src/take-while.d.ts
-
-/**
- * Returns elements from the array until predicate returns false.
- *
- * @param data - The array.
- * @param predicate - The predicate.
- * @signature
- *    P.takeWhile(data, predicate)
- * @example
- *    P.takeWhile([1, 2, 3, 4, 3, 2, 1], x => x !== 4) // => [1, 2, 3]
- * @dataFirst
- * @category Array
- */
-declare function takeWhile<T extends IterableContainer, S extends T[number]>(data: T, predicate: (item: T[number], index: number, data: T) => item is S): Array<S>;
-declare function takeWhile<T extends IterableContainer>(data: T, predicate: (item: T[number], index: number, data: T) => boolean): Array<T[number]>;
-/**
- * Returns elements from the array until predicate returns false.
- *
- * @param predicate - The predicate.
- * @signature
- *    P.takeWhile(predicate)(data)
- * @example
- *    P.pipe([1, 2, 3, 4, 3, 2, 1], P.takeWhile(x => x !== 4))  // => [1, 2, 3]
- * @dataLast
- * @category Array
- */
-declare function takeWhile<T extends IterableContainer, S extends T[number]>(predicate: (item: T[number], index: number, data: T) => item is S): (array: T) => Array<S>;
-declare function takeWhile<T extends IterableContainer>(predicate: (item: T[number], index: number, data: T) => boolean): (array: T) => Array<T[number]>;
-//#endregion
-export { takeWhile };
-//# sourceMappingURL=take-while.d.ts.map

package/dist/take-while.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"take-while.d.ts","names":[],"sources":["../src/take-while.ts"],"sourcesContent":[],"mappings":";;;;;;AAgBA;;;;;;;;;;AAIgB,iBAJA,SAIS,CAAA,UAJW,iBAIX,EAAA,UAJwC,CAIxC,CAAA,MAAA,CAAA,CAAA,CAAA,IAAA,EAHjB,CAGiB,EAAA,SAAA,EAAA,CAAA,IAAA,EAFL,CAEK,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAF2B,CAE3B,EAAA,GAAA,IAAA,IAFyC,CAEzC,CAAA,EADtB,KACsB,CADhB,CACgB,CAAA;AAAW,iBAApB,SAAoB,CAAA,UAAA,iBAAA,CAAA,CAAA,IAAA,EAC5B,CAD4B,EAAA,SAAA,EAAA,CAAA,IAAA,EAEhB,CAFgB,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAEgB,CAFhB,EAAA,GAAA,OAAA,CAAA,EAGjC,KAHiC,CAG3B,CAH2B,CAAA,MAAA,CAAA,CAAA;;;;;;;AAgBpC;;;;;AACkE,iBADlD,SACkD,CAAA,UAD9B,iBAC8B,EAAA,UADD,CACC,CAAA,MAAA,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,IAAA,EAA9C,CAA8C,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAAd,CAAc,EAAA,GAAA,IAAA,IAAA,CAAA,CAAA,EAAA,CAAA,KAAA,EACvD,CADuD,EAAA,GACjD,KADiD,CAC3C,CAD2C,CAAA;AACvD,iBACK,SADL,CAAA,UACyB,iBADzB,CAAA,CAAA,SAAA,EAAA,CAAA,IAAA,EAES,CAFT,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAEyC,CAFzC,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,KAAA,EAGA,CAHA,EAAA,GAGM,KAHN,CAGY,CAHZ,CAAA,MAAA,CAAA,CAAA"}

package/dist/take.d.cts

@@ -1,34 +0,0 @@
-import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
-
-//#region src/take.d.ts
-
-/**
- * Returns the first `n` elements of `array`.
- *
- * @param array - The array.
- * @param n - The number of elements to take.
- * @signature
- *    P.take(array, n)
- * @example
- *    P.take([1, 2, 3, 4, 3, 2, 1], 3) // => [1, 2, 3]
- * @dataFirst
- * @lazy
- * @category Array
- */
-declare function take<T extends IterableContainer>(array: T, n: number): Array<T[number]>;
-/**
- * Returns the first `n` elements of `array`.
- *
- * @param n - The number of elements to take.
- * @signature
- *    P.take(n)(array)
- * @example
- *    P.pipe([1, 2, 3, 4, 3, 2, 1], P.take(n)) // => [1, 2, 3]
- * @dataLast
- * @lazy
- * @category Array
- */
-declare function take(n: number): <T extends IterableContainer>(array: T) => Array<T[number]>;
-//#endregion
-export { take };
-//# sourceMappingURL=take.d.cts.map

package/dist/take.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"take.d.cts","names":[],"sources":["../src/take.ts"],"sourcesContent":[],"mappings":";;;;;;AAmBA;;;;;;AAiBA;;;;;AAEmD,iBAnBnC,IAmBmC,CAAA,UAnBpB,iBAmBoB,CAAA,CAAA,KAAA,EAlB1C,CAkB0C,EAAA,CAAA,EAAA,MAAA,CAAA,EAhBhD,KAgBgD,CAhB1C,CAgB0C,CAAA,MAAA,CAAA,CAAA;;;;;;;;;;;;;iBAFnC,IAAA,wBAEF,0BAA0B,MAAM,MAAM"}

package/dist/take.d.ts

@@ -1,34 +0,0 @@
-import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
-
-//#region src/take.d.ts
-
-/**
- * Returns the first `n` elements of `array`.
- *
- * @param array - The array.
- * @param n - The number of elements to take.
- * @signature
- *    P.take(array, n)
- * @example
- *    P.take([1, 2, 3, 4, 3, 2, 1], 3) // => [1, 2, 3]
- * @dataFirst
- * @lazy
- * @category Array
- */
-declare function take<T extends IterableContainer>(array: T, n: number): Array<T[number]>;
-/**
- * Returns the first `n` elements of `array`.
- *
- * @param n - The number of elements to take.
- * @signature
- *    P.take(n)(array)
- * @example
- *    P.pipe([1, 2, 3, 4, 3, 2, 1], P.take(n)) // => [1, 2, 3]
- * @dataLast
- * @lazy
- * @category Array
- */
-declare function take(n: number): <T extends IterableContainer>(array: T) => Array<T[number]>;
-//#endregion
-export { take };
-//# sourceMappingURL=take.d.ts.map

package/dist/take.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"take.d.ts","names":[],"sources":["../src/take.ts"],"sourcesContent":[],"mappings":";;;;;;AAmBA;;;;;;AAiBA;;;;;AAEmD,iBAnBnC,IAmBmC,CAAA,UAnBpB,iBAmBoB,CAAA,CAAA,KAAA,EAlB1C,CAkB0C,EAAA,CAAA,EAAA,MAAA,CAAA,EAhBhD,KAgBgD,CAhB1C,CAgB0C,CAAA,MAAA,CAAA,CAAA;;;;;;;;;;;;;iBAFnC,IAAA,wBAEF,0BAA0B,MAAM,MAAM"}

package/dist/tap.d.cts

@@ -1,42 +0,0 @@
-//#region src/tap.d.ts
-/**
- * Calls the given function with the given value, then returns the given value.
- * The return value of the provided function is ignored.
- *
- * This allows "tapping into" a function sequence in a pipe, to perform side
- * effects on intermediate results.
- *
- * @param value - The value to pass into the function.
- * @param fn - The function to call.
- * @signature
- *    P.tap(value, fn)
- * @example
- *    P.tap("foo", console.log) // => "foo"
- * @dataFirst
- * @category Other
- */
-declare function tap<T>(value: T, fn: (value: T) => void): T;
-/**
- * Calls the given function with the given value, then returns the given value.
- * The return value of the provided function is ignored.
- *
- * This allows "tapping into" a function sequence in a pipe, to perform side
- * effects on intermediate results.
- *
- * @param fn - The function to call.
- * @signature
- *    P.tap(fn)(value)
- * @example
- *    P.pipe(
- *      [-5, -1, 2, 3],
- *      P.filter(n => n > 0),
- *      P.tap(console.log), // prints [2, 3]
- *      P.map(n => n * 2)
- *    ) // => [4, 6]
- * @dataLast
- * @category Other
- */
-declare function tap<T, F extends (value: T) => unknown>(fn: F): (value: T) => T;
-//#endregion
-export { tap };
-//# sourceMappingURL=tap.d.cts.map

package/dist/tap.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"tap.d.cts","names":[],"sources":["../src/tap.ts"],"sourcesContent":[],"mappings":";;AAkBA;;;;;AAsBA;;;;;;;;;;iBAtBgB,cAAc,eAAe,aAAa;;;;;;;;;;;;;;;;;;;;;iBAsB1C,yBAAyB,mBAAmB,YAAY,MAAM"}

package/dist/tap.d.ts

@@ -1,42 +0,0 @@
-//#region src/tap.d.ts
-/**
- * Calls the given function with the given value, then returns the given value.
- * The return value of the provided function is ignored.
- *
- * This allows "tapping into" a function sequence in a pipe, to perform side
- * effects on intermediate results.
- *
- * @param value - The value to pass into the function.
- * @param fn - The function to call.
- * @signature
- *    P.tap(value, fn)
- * @example
- *    P.tap("foo", console.log) // => "foo"
- * @dataFirst
- * @category Other
- */
-declare function tap<T>(value: T, fn: (value: T) => void): T;
-/**
- * Calls the given function with the given value, then returns the given value.
- * The return value of the provided function is ignored.
- *
- * This allows "tapping into" a function sequence in a pipe, to perform side
- * effects on intermediate results.
- *
- * @param fn - The function to call.
- * @signature
- *    P.tap(fn)(value)
- * @example
- *    P.pipe(
- *      [-5, -1, 2, 3],
- *      P.filter(n => n > 0),
- *      P.tap(console.log), // prints [2, 3]
- *      P.map(n => n * 2)
- *    ) // => [4, 6]
- * @dataLast
- * @category Other
- */
-declare function tap<T, F extends (value: T) => unknown>(fn: F): (value: T) => T;
-//#endregion
-export { tap };
-//# sourceMappingURL=tap.d.ts.map

package/dist/tap.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"tap.d.ts","names":[],"sources":["../src/tap.ts"],"sourcesContent":[],"mappings":";;AAkBA;;;;;AAsBA;;;;;;;;;;iBAtBgB,cAAc,eAAe,aAAa;;;;;;;;;;;;;;;;;;;;;iBAsB1C,yBAAyB,mBAAmB,YAAY,MAAM"}

package/dist/times.d.cts

@@ -1,48 +0,0 @@
-import { GreaterThan } from "type-fest";
-
-//#region src/times.d.ts
-type MAX_LITERAL_SIZE = 46;
-type TimesArray<T, N extends number, Iteration extends ReadonlyArray<unknown> = []> = number extends N ? Array<T> : `${N}` extends `-${number}` ? [] : `${N}` extends `${infer K extends number}.${number}` ? TimesArray<T, K, Iteration> : GreaterThan<N, MAX_LITERAL_SIZE> extends true ? [...TimesArray<T, MAX_LITERAL_SIZE, Iteration>, ...Array<T>] : N extends Iteration['length'] ? [] : [T, ...TimesArray<T, N, [unknown, ...Iteration]>];
-/**
- * Calls an input function `n` times, returning an array containing the results
- * of those function calls.
- *
- * `fn` is passed one argument: The current value of `n`, which begins at `0`
- * and is gradually incremented to `n - 1`.
- *
- * @param count - A value between `0` and `n - 1`. Increments after each
- * function call.
- * @param fn - The function to invoke. Passed one argument, the current value of
- * `n`.
- * @signature
- *   P.times(count, fn)
- * @example
- *   P.times(5, identity()); //=> [0, 1, 2, 3, 4]
- *
- * @dataFirst
- * @category Array
- */
-declare function times<T, N extends number>(count: N, fn: (index: number) => T): TimesArray<T, N>;
-/**
- * Calls an input function `n` times, returning an array containing the results
- * of those function calls.
- *
- * `fn` is passed one argument: The current value of `n`, which begins at `0`
- * and is gradually incremented to `n - 1`.
- *
- * @param fn - The function to invoke. Passed one argument, the current value of
- * `n`.
- * @returns An array containing the return values of all calls to `fn`.
- *
- * @signature
- *   P.times(count, fn)
- * @example
- *   P.times(identity())(5); //=> [0, 1, 2, 3, 4]
- *
- * @dataLast
- * @category Array
- */
-declare function times<T>(fn: (index: number) => T): <N extends number>(count: N) => TimesArray<T, N>;
-//#endregion
-export { times };
-//# sourceMappingURL=times.d.cts.map

package/dist/times.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"times.d.cts","names":[],"sources":["../src/times.ts"],"sourcesContent":[],"mappings":";;;KAOK,gBAAA;KAEA,kDAGe,8CACD,IAEf,MAAM,QACH,mCAGE,oDAED,WAAW,GAAG,GAAG,aACjB,YAAY,GAAG,qCAGT,WAAW,GAAG,kBAAkB,eAAe,MAAM,MACzD,UAAU,4BAIP,MAAM,WAAW,GAAG,gBAAgB;AA9BJ;AAOxB;;;;;;;;;;;;;;;;;;AAkB8C,iBA0BnD,KA1BmD,CAAA,CAAA,EAAA,UAAA,MAAA,CAAA,CAAA,KAAA,EA2B1D,CA3B0D,EAAA,EAAA,EAAA,CAAA,KAAA,EAAA,MAAA,EAAA,GA4B1C,CA5B0C,CAAA,EA6BhE,UA7BgE,CA6BrD,CA7BqD,EA6BlD,CA7BkD,CAAA;;;;;;;;;;AA0BnE;;;;;;;AAwBA;;;AAE8C,iBAF9B,KAE8B,CAAA,CAAA,CAAA,CAAA,EAAA,EAAA,CAAA,KAAA,EAAA,MAAA,EAAA,GADrB,CACqB,CAAA,EAAA,CAAA,UAAA,MAAA,CAAA,CAAA,KAAA,EAAjB,CAAiB,EAAA,GAAX,UAAW,CAAA,CAAA,EAAG,CAAH,CAAA"}