@vinicunca/perkakas 1.0.3 → 1.0.5

package/dist/add-prop.d.cts

@@ -1,4 +1,4 @@
-import { U as UpsertProp } from './types-BMu1PIvo.cjs';
+import { U as UpsertProp } from './types-CC8iZVKO.cjs';
 import 'type-fest';
 
 /**

package/dist/add-prop.d.ts

@@ -1,4 +1,4 @@
-import { U as UpsertProp } from './types-BMu1PIvo.js';
+import { U as UpsertProp } from './types-CC8iZVKO.js';
 import 'type-fest';
 
 /**

package/dist/chunk-3DFX2FQG.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function o(...e){return _chunkY74ER22Ocjs.a.call(void 0, t,e)}function t(e,n){return n>0?e.slice(Math.max(0,e.length-n)):[]}exports.a = o;

package/dist/chunk-4WU7JGWS.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function u(...r){return _chunkY74ER22Ocjs.a.call(void 0, l,r)}function l(r){let n=[...r];for(let e=0;e<r.length;e++){let t=e+Math.floor(Math.random()*(r.length-e)),a=n[t];n[t]=n[e],n[e]=a}return n}exports.a = u;

package/dist/chunk-AACZ5UGG.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function a(...r){return _chunkY74ER22Ocjs.a.call(void 0, t,r)}function t(r,e){return e>0?r.slice(0,Math.max(0,r.length-e)):[...r]}exports.a = a;

package/dist/chunk-AKGWT6GC.js

@@ -0,0 +1 @@
+import{a as r}from"./chunk-C6L5NLLB.js";import{a as t}from"./chunk-MYLYERXO.js";function l(...e){return r(i,e)}function i(e){return(n,a,o)=>o.findIndex(u=>e(n,u))===a?{done:!1,hasNext:!0,next:n}:t}export{l as a};

package/dist/chunk-BT3FI7L7.js

@@ -0,0 +1 @@
+import{a}from"./chunk-JFXZ246Y.js";function o(...e){return a(s,e)}function s(e,n){if(n<1)throw new RangeError(`chunk: A chunk size of '${n}' would result in an infinite array`);if(e.length===0)return[];if(n>=e.length)return[[...e]];let i=Math.ceil(e.length/n),u=new Array(i);if(n===1)for(let[r,t]of e.entries())u[r]=[t];else for(let r=0;r<i;r+=1){let t=r*n;u[r]=e.slice(t,t+n)}return u}export{o as a};

package/dist/chunk-D5B5IQRS.js

@@ -0,0 +1 @@
+import{a as n,c as o}from"./chunk-MYLYERXO.js";import{a as t}from"./chunk-JFXZ246Y.js";function i(...e){return t(p,e,u)}function p(e,r){return r<0?[...e]:e.slice(r)}function u(e){if(e<=0)return o;let r=e;return a=>r>0?(r-=1,n):{done:!1,hasNext:!0,next:a}}export{i as a};

package/dist/{chunk-XQOKSJ5R.cjs → chunk-E6RBEL5Z.cjs}

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkNLX7PGPIcjs = require('./chunk-NLX7PGPI.cjs');var _chunk3X6SAJDQcjs = require('./chunk-3X6SAJDQ.cjs');function l(...a){return _chunkNLX7PGPIcjs.a.call(void 0, i,a)}function i(a){return(n,o,u)=>u.findIndex(e=>a(n,e))===o?{done:!1,hasNext:!0,next:n}:_chunk3X6SAJDQcjs.a}exports.a = l;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkNLX7PGPIcjs = require('./chunk-NLX7PGPI.cjs');var _chunk3X6SAJDQcjs = require('./chunk-3X6SAJDQ.cjs');function l(...e){return _chunkNLX7PGPIcjs.a.call(void 0, i,e)}function i(e){return(n,a,o)=>o.findIndex(u=>e(n,u))===a?{done:!1,hasNext:!0,next:n}:_chunk3X6SAJDQcjs.a}exports.a = l;

package/dist/chunk-EPHUNAE5.js

@@ -0,0 +1 @@
+import{b as t}from"./chunk-MYLYERXO.js";import{a as n}from"./chunk-JFXZ246Y.js";function p(...r){return n(o,r,u)}function o(r,e){return e<0?[]:r.slice(0,e)}function u(r){if(r<=0)return t;let e=r;return a=>(e-=1,{done:e<=0,hasNext:!0,next:a})}export{p as a};

package/dist/chunk-G7BJFBAZ.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function i(...e){return _chunkY74ER22Ocjs.a.call(void 0, o,e)}function o(e,t){for(let r=e.length-1;r>=0;r--)if(!t(e[r],r,e))return e.slice(0,r+1);return[]}exports.a = i;

package/dist/{chunk-YIUDV3OA.cjs → chunk-HTO3K3VA.cjs}

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkNLX7PGPIcjs = require('./chunk-NLX7PGPI.cjs');var _chunk3X6SAJDQcjs = require('./chunk-3X6SAJDQ.cjs');function y(...r){return _chunkNLX7PGPIcjs.a.call(void 0, a,r)}function a(){let r=new Set;return n=>r.has(n)?_chunk3X6SAJDQcjs.a:(r.add(n),{done:!1,hasNext:!0,next:n})}exports.a = y;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkNLX7PGPIcjs = require('./chunk-NLX7PGPI.cjs');var _chunk3X6SAJDQcjs = require('./chunk-3X6SAJDQ.cjs');function i(...e){return _chunkNLX7PGPIcjs.a.call(void 0, o,e)}function o(){let e=new Set;return t=>e.has(t)?_chunk3X6SAJDQcjs.a:(e.add(t),{done:!1,hasNext:!0,next:t})}exports.a = i;

package/dist/chunk-IABWIMQT.js

@@ -0,0 +1 @@
+import{a as r}from"./chunk-JFXZ246Y.js";function m(...e){return r(i,e)}function i(e,t){for(let[n,o]of e.entries())if(!t(o,n,e))return e.slice(n);return[]}export{m as a};

package/dist/chunk-IOSBDH5J.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});function t(r,n){let e=Math.ceil(r),o=Math.floor(n);if(o<e)throw new RangeError(`randomInt: The range [${r},${n}] contains no integer`);return Math.floor(Math.random()*(o-e+1)+e)}exports.a = t;

package/dist/chunk-KAA6IVBL.js

@@ -0,0 +1 @@
+import{a as r}from"./chunk-JFXZ246Y.js";function o(...e){return r(a,e)}function a(e,t){for(let n=e.length-1;n>=0;n--)if(!t(e[n],n,e))return e.slice(n+1);return[...e]}export{o as a};

package/dist/chunk-MADDQNAR.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkNLX7PGPIcjs = require('./chunk-NLX7PGPI.cjs');var _chunk3X6SAJDQcjs = require('./chunk-3X6SAJDQ.cjs');function p(...e){return _chunkNLX7PGPIcjs.a.call(void 0, d,e)}function d(e){let n=new Set;return(t,u,i)=>{let r=e(t,u,i);return n.has(r)?_chunk3X6SAJDQcjs.a:(n.add(r),{done:!1,hasNext:!0,next:t})}}exports.a = p;

package/dist/chunk-OJ2QGTFS.js

@@ -0,0 +1 @@
+import{a as r}from"./chunk-JFXZ246Y.js";function o(...e){return r(t,e)}function t(e,n){return n>0?e.slice(Math.max(0,e.length-n)):[]}export{o as a};

package/dist/chunk-PFLGL4YP.js

@@ -0,0 +1 @@
+import{a as o}from"./chunk-JFXZ246Y.js";function u(...r){return o(l,r)}function l(r){let n=[...r];for(let e=0;e<r.length;e++){let t=e+Math.floor(Math.random()*(r.length-e)),a=n[t];n[t]=n[e],n[e]=a}return n}export{u as a};

package/dist/chunk-QT66COHU.js

@@ -0,0 +1 @@
+function t(r,n){let e=Math.ceil(r),o=Math.floor(n);if(o<e)throw new RangeError(`randomInt: The range [${r},${n}] contains no integer`);return Math.floor(Math.random()*(o-e+1)+e)}export{t as a};

package/dist/chunk-QTQTKNWA.js

@@ -0,0 +1 @@
+import{a as n}from"./chunk-JFXZ246Y.js";function i(...e){return n(o,e)}function o(e,t){for(let r=e.length-1;r>=0;r--)if(!t(e[r],r,e))return e.slice(0,r+1);return[]}export{i as a};

package/dist/chunk-RJAVPEJT.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function m(...e){return _chunkY74ER22Ocjs.a.call(void 0, i,e)}function i(e,t){for(let[n,o]of e.entries())if(!t(o,n,e))return e.slice(n);return[]}exports.a = m;

package/dist/chunk-U2BXIRBJ.js

@@ -0,0 +1 @@
+import{a as n}from"./chunk-JFXZ246Y.js";function a(...r){return n(t,r)}function t(r,e){return e>0?r.slice(0,Math.max(0,r.length-e)):[...r]}export{a};

package/dist/chunk-VN2OAM2N.js

@@ -0,0 +1 @@
+import{a as t}from"./chunk-JFXZ246Y.js";function u(...e){return t(i,e)}function i(e,a){let n=[];for(let[o,r]of e.entries()){if(!a(r,o,e))break;n.push(r)}return n}export{u as a};

package/dist/chunk-VPG3W5JH.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function o(...e){return _chunkY74ER22Ocjs.a.call(void 0, a,e)}function a(e,t){for(let n=e.length-1;n>=0;n--)if(!t(e[n],n,e))return e.slice(n+1);return[...e]}exports.a = o;

package/dist/chunk-WQDEYM64.js

@@ -0,0 +1 @@
+import{a as r}from"./chunk-C6L5NLLB.js";import{a as n}from"./chunk-MYLYERXO.js";function i(...e){return r(o,e)}function o(){let e=new Set;return t=>e.has(t)?n:(e.add(t),{done:!1,hasNext:!0,next:t})}export{i as a};

package/dist/chunk-WRKGH4XX.js

@@ -0,0 +1 @@
+import{a as o}from"./chunk-C6L5NLLB.js";import{a}from"./chunk-MYLYERXO.js";function p(...e){return o(d,e)}function d(e){let n=new Set;return(t,u,i)=>{let r=e(t,u,i);return n.has(r)?a:(n.add(r),{done:!1,hasNext:!0,next:t})}}export{p as a};

package/dist/chunk-Y3WI7FPB.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function o(...e){return _chunkY74ER22Ocjs.a.call(void 0, s,e)}function s(e,n){if(n<1)throw new RangeError(`chunk: A chunk size of '${n}' would result in an infinite array`);if(e.length===0)return[];if(n>=e.length)return[[...e]];let i=Math.ceil(e.length/n),u=new Array(i);if(n===1)for(let[r,t]of e.entries())u[r]=[t];else for(let r=0;r<i;r+=1){let t=r*n;u[r]=e.slice(t,t+n)}return u}exports.a = o;

package/dist/chunk-Z5UEQBZP.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk3X6SAJDQcjs = require('./chunk-3X6SAJDQ.cjs');var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function p(...r){return _chunkY74ER22Ocjs.a.call(void 0, o,r,u)}function o(r,e){return e<0?[]:r.slice(0,e)}function u(r){if(r<=0)return _chunk3X6SAJDQcjs.b;let e=r;return a=>(e-=1,{done:e<=0,hasNext:!0,next:a})}exports.a = p;

package/dist/chunk-Z6HCXPKS.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk3X6SAJDQcjs = require('./chunk-3X6SAJDQ.cjs');var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function i(...e){return _chunkY74ER22Ocjs.a.call(void 0, p,e,u)}function p(e,r){return r<0?[...e]:e.slice(r)}function u(e){if(e<=0)return _chunk3X6SAJDQcjs.c;let r=e;return a=>r>0?(r-=1,_chunk3X6SAJDQcjs.a):{done:!1,hasNext:!0,next:a}}exports.a = i;

package/dist/chunk-ZO4ND36N.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function u(...e){return _chunkY74ER22Ocjs.a.call(void 0, i,e)}function i(e,a){let n=[];for(let[o,r]of e.entries()){if(!a(r,o,e))break;n.push(r)}return n}exports.a = u;

package/dist/chunk.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkVNLOBA2Bcjs = require('./chunk-VNLOBA2B.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.chunk = _chunkVNLOBA2Bcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY3WI7FPBcjs = require('./chunk-Y3WI7FPB.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.chunk = _chunkY3WI7FPBcjs.a;

package/dist/chunk.d.cts

@@ -1,7 +1,93 @@
-import { I as IterableContainer, N as NonEmptyArray } from './types-BMu1PIvo.cjs';
-import 'type-fest';
+import { IsNumericLiteral, LessThan, IfNever, Subtract, ValueOf, IntRange } from 'type-fest';
+import { I as IterableContainer, T as TupleParts, N as NTuple, a as NonEmptyArray } from './types-CC8iZVKO.cjs';
 
-type Chunked<T extends IterableContainer> = T[number] extends never ? [] : T extends readonly [...Array<unknown>, unknown] | readonly [unknown, ...Array<unknown>] ? NonEmptyArray<NonEmptyArray<T[number]>> : Array<NonEmptyArray<T[number]>>;
+/**
+ * This prevents typescript from failing on complex arrays and large chunks.
+ * It allows the typing to remain useful even when very large chunks are needed,
+ * without loosing fidelity on smaller ones. It was chosen by trial-and-error,
+ * and given some more wiggle room because the complexity of the array also
+ * plays a role in when typescript fails to recurse.
+ * See the type tests for an example.
+ */
+type MAX_LITERAL_SIZE = 350;
+type Chunk<T extends IterableContainer, N extends number> = T extends readonly [] ? [] : IsNumericLiteral<N> extends true ? LessThan<N, 1> extends true ? never : LessThan<N, MAX_LITERAL_SIZE> extends true ? [
+    ...LiteralChunk<T, N>
+] : GenericChunk<T> : GenericChunk<T>;
+type LiteralChunk<T, N extends number, Parts extends TupleParts<T> = TupleParts<T>> = ([...Parts['prefix'], ...Parts['suffix']]['length'] extends 0 ? [] : never) | ChunkInfinite<ChunkFinite<Parts['prefix'], N>, Parts['item'], Parts['suffix'], N>;
+/**
+ * This type **only** works if the input array `T` is a finite tuple (
+ * `[number, "abc", true, { a: "hello" }]` etc..., and it doesn't contain a rest
+ * parameter). For these inputs the chunked output could be computed as literal
+ * finite tuples too.
+ */
+type ChunkFinite<T, N extends number, Result = []> = T extends readonly [infer Head, ...infer Rest] ? ChunkFinite<Rest, N, Result extends [
+    ...infer Previous extends Array<Array<unknown>>,
+    infer Current extends Array<unknown>
+] ? Current['length'] extends N ? [
+    ...Previous,
+    Current,
+    [Head]
+] : [
+    ...Previous,
+    [...Current, Head]
+] : [
+    [Head]
+]> : Result;
+/**
+ * Here lies the main complexity of building the chunk type. It takes the prefix
+ * chunks, the rest param item type, and the suffix (not chunked!) and it
+ * creates all possible combinations of adding items to the prefix and suffix
+ * for all possible scenarios for how many items the rest param "represents".
+ */
+type ChunkInfinite<PrefixChunks, Item, Suffix extends Array<unknown>, N extends number> = IfNever<Item, PrefixChunks, PrefixChunks extends [
+    ...infer PrefixFullChunks extends Array<Array<unknown>>,
+    infer LastPrefixChunk extends Array<unknown>
+] ? [
+    ...PrefixFullChunks,
+    [
+        ...LastPrefixChunk,
+        ...NTuple<Item, Subtract<N, LastPrefixChunk['length']>>
+    ],
+    ...Array<NTuple<Item, N>>,
+    ...SuffixChunk<Suffix, Item, N>
+] | ValueOf<{
+    [Padding in IntRangeInclusive<0, Subtract<N, LastPrefixChunk['length']>>]: [
+        ...PrefixFullChunks,
+        ...ChunkFinite<[
+            ...LastPrefixChunk,
+            ...NTuple<Item, Padding>,
+            ...Suffix
+        ], N>
+    ];
+}> : [
+    ...Array<NTuple<Item, N>>,
+    ...SuffixChunk<Suffix, Item, N>
+]>;
+/**
+ * This type assumes it takes a finite tuple that represents the suffix of our
+ * input array. It builds all possible combinations of adding items to the
+ * **head** of the suffix in order to pad the suffix until the last chunk is
+ * full.
+ */
+type SuffixChunk<T extends Array<unknown>, Item, N extends number> = T extends readonly [] ? [
+    ValueOf<{
+        [K in IntRangeInclusive<1, N>]: NTuple<Item, K>;
+    }>
+] : ValueOf<{
+    [Padding in IntRange<0, N>]: ChunkFinite<[
+        ...NTuple<Item, Padding>,
+        ...T
+    ], N>;
+}>;
+/**
+ * This is the legacy type used when we don't know what N is. We can only adjust
+ * our output based on if we know for sure that the array is empty or not.
+ */
+type GenericChunk<T extends IterableContainer> = T extends readonly [...Array<unknown>, unknown] | readonly [unknown, ...Array<unknown>] ? NonEmptyArray<NonEmptyArray<T[number]>> : Array<NonEmptyArray<T[number]>>;
+/**
+ * Type-fest's IntRange doesn't include the `To` value, but we need it!
+ */
+type IntRangeInclusive<From extends number, To extends number> = IntRange<From, To> | To;
 /**
  * Split an array into groups the length of `size`. If `array` can't be split evenly, the final chunk will be the remaining elements.
  *
@@ -15,7 +101,7 @@ type Chunked<T extends IterableContainer> = T[number] extends never ? [] : T ext
  * @dataFirst
  * @category Array
  */
-declare function chunk<T extends IterableContainer>(array: T, size: number): Chunked<T>;
+declare function chunk<T extends IterableContainer, N extends number>(array: T, size: N): Chunk<T, N>;
 /**
  * Split an array into groups the length of `size`. If `array` can't be split evenly, the final chunk will be the remaining elements.
  *
@@ -28,6 +114,6 @@ declare function chunk<T extends IterableContainer>(array: T, size: number): Chu
  * @dataLast
  * @category Array
  */
-declare function chunk<T extends IterableContainer>(size: number): (array: T) => Chunked<T>;
+declare function chunk<N extends number>(size: N): <T extends IterableContainer>(array: T) => Chunk<T, N>;
 
 export { chunk };

package/dist/chunk.d.ts

@@ -1,7 +1,93 @@
-import { I as IterableContainer, N as NonEmptyArray } from './types-BMu1PIvo.js';
-import 'type-fest';
+import { IsNumericLiteral, LessThan, IfNever, Subtract, ValueOf, IntRange } from 'type-fest';
+import { I as IterableContainer, T as TupleParts, N as NTuple, a as NonEmptyArray } from './types-CC8iZVKO.js';
 
-type Chunked<T extends IterableContainer> = T[number] extends never ? [] : T extends readonly [...Array<unknown>, unknown] | readonly [unknown, ...Array<unknown>] ? NonEmptyArray<NonEmptyArray<T[number]>> : Array<NonEmptyArray<T[number]>>;
+/**
+ * This prevents typescript from failing on complex arrays and large chunks.
+ * It allows the typing to remain useful even when very large chunks are needed,
+ * without loosing fidelity on smaller ones. It was chosen by trial-and-error,
+ * and given some more wiggle room because the complexity of the array also
+ * plays a role in when typescript fails to recurse.
+ * See the type tests for an example.
+ */
+type MAX_LITERAL_SIZE = 350;
+type Chunk<T extends IterableContainer, N extends number> = T extends readonly [] ? [] : IsNumericLiteral<N> extends true ? LessThan<N, 1> extends true ? never : LessThan<N, MAX_LITERAL_SIZE> extends true ? [
+    ...LiteralChunk<T, N>
+] : GenericChunk<T> : GenericChunk<T>;
+type LiteralChunk<T, N extends number, Parts extends TupleParts<T> = TupleParts<T>> = ([...Parts['prefix'], ...Parts['suffix']]['length'] extends 0 ? [] : never) | ChunkInfinite<ChunkFinite<Parts['prefix'], N>, Parts['item'], Parts['suffix'], N>;
+/**
+ * This type **only** works if the input array `T` is a finite tuple (
+ * `[number, "abc", true, { a: "hello" }]` etc..., and it doesn't contain a rest
+ * parameter). For these inputs the chunked output could be computed as literal
+ * finite tuples too.
+ */
+type ChunkFinite<T, N extends number, Result = []> = T extends readonly [infer Head, ...infer Rest] ? ChunkFinite<Rest, N, Result extends [
+    ...infer Previous extends Array<Array<unknown>>,
+    infer Current extends Array<unknown>
+] ? Current['length'] extends N ? [
+    ...Previous,
+    Current,
+    [Head]
+] : [
+    ...Previous,
+    [...Current, Head]
+] : [
+    [Head]
+]> : Result;
+/**
+ * Here lies the main complexity of building the chunk type. It takes the prefix
+ * chunks, the rest param item type, and the suffix (not chunked!) and it
+ * creates all possible combinations of adding items to the prefix and suffix
+ * for all possible scenarios for how many items the rest param "represents".
+ */
+type ChunkInfinite<PrefixChunks, Item, Suffix extends Array<unknown>, N extends number> = IfNever<Item, PrefixChunks, PrefixChunks extends [
+    ...infer PrefixFullChunks extends Array<Array<unknown>>,
+    infer LastPrefixChunk extends Array<unknown>
+] ? [
+    ...PrefixFullChunks,
+    [
+        ...LastPrefixChunk,
+        ...NTuple<Item, Subtract<N, LastPrefixChunk['length']>>
+    ],
+    ...Array<NTuple<Item, N>>,
+    ...SuffixChunk<Suffix, Item, N>
+] | ValueOf<{
+    [Padding in IntRangeInclusive<0, Subtract<N, LastPrefixChunk['length']>>]: [
+        ...PrefixFullChunks,
+        ...ChunkFinite<[
+            ...LastPrefixChunk,
+            ...NTuple<Item, Padding>,
+            ...Suffix
+        ], N>
+    ];
+}> : [
+    ...Array<NTuple<Item, N>>,
+    ...SuffixChunk<Suffix, Item, N>
+]>;
+/**
+ * This type assumes it takes a finite tuple that represents the suffix of our
+ * input array. It builds all possible combinations of adding items to the
+ * **head** of the suffix in order to pad the suffix until the last chunk is
+ * full.
+ */
+type SuffixChunk<T extends Array<unknown>, Item, N extends number> = T extends readonly [] ? [
+    ValueOf<{
+        [K in IntRangeInclusive<1, N>]: NTuple<Item, K>;
+    }>
+] : ValueOf<{
+    [Padding in IntRange<0, N>]: ChunkFinite<[
+        ...NTuple<Item, Padding>,
+        ...T
+    ], N>;
+}>;
+/**
+ * This is the legacy type used when we don't know what N is. We can only adjust
+ * our output based on if we know for sure that the array is empty or not.
+ */
+type GenericChunk<T extends IterableContainer> = T extends readonly [...Array<unknown>, unknown] | readonly [unknown, ...Array<unknown>] ? NonEmptyArray<NonEmptyArray<T[number]>> : Array<NonEmptyArray<T[number]>>;
+/**
+ * Type-fest's IntRange doesn't include the `To` value, but we need it!
+ */
+type IntRangeInclusive<From extends number, To extends number> = IntRange<From, To> | To;
 /**
  * Split an array into groups the length of `size`. If `array` can't be split evenly, the final chunk will be the remaining elements.
  *
@@ -15,7 +101,7 @@ type Chunked<T extends IterableContainer> = T[number] extends never ? [] : T ext
  * @dataFirst
  * @category Array
  */
-declare function chunk<T extends IterableContainer>(array: T, size: number): Chunked<T>;
+declare function chunk<T extends IterableContainer, N extends number>(array: T, size: N): Chunk<T, N>;
 /**
  * Split an array into groups the length of `size`. If `array` can't be split evenly, the final chunk will be the remaining elements.
  *
@@ -28,6 +114,6 @@ declare function chunk<T extends IterableContainer>(array: T, size: number): Chu
  * @dataLast
  * @category Array
  */
-declare function chunk<T extends IterableContainer>(size: number): (array: T) => Chunked<T>;
+declare function chunk<N extends number>(size: N): <T extends IterableContainer>(array: T) => Chunk<T, N>;
 
 export { chunk };

package/dist/chunk.js

@@ -1 +1 @@
-import{a}from"./chunk-TR5T6KUC.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as chunk};
+import{a}from"./chunk-BT3FI7L7.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as chunk};

package/dist/chunk.spec-d.cjs

@@ -1 +1 @@
-"use strict";var _chunkVNLOBA2Bcjs = require('./chunk-VNLOBA2B.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');test("empty tuple",()=>{let t=_chunkVNLOBA2Bcjs.a.call(void 0, [],2);expectTypeOf(t).toEqualTypeOf()});test("readonly empty tuple",()=>{let t=_chunkVNLOBA2Bcjs.a.call(void 0, [],2);expectTypeOf(t).toEqualTypeOf()});test("array",()=>{let t=_chunkVNLOBA2Bcjs.a.call(void 0, [],2);expectTypeOf(t).toEqualTypeOf()});test("readonly array",()=>{let t=_chunkVNLOBA2Bcjs.a.call(void 0, [],2);expectTypeOf(t).toEqualTypeOf()});test("tuple",()=>{let t=_chunkVNLOBA2Bcjs.a.call(void 0, [123,456,789],2);expectTypeOf(t).toEqualTypeOf()});test("readonly tuple",()=>{let t=_chunkVNLOBA2Bcjs.a.call(void 0, [123,456,789],2);expectTypeOf(t).toEqualTypeOf()});test("tuple with rest tail",()=>{let t=_chunkVNLOBA2Bcjs.a.call(void 0, [123,456],2);expectTypeOf(t).toEqualTypeOf()});test("readonly tuple with rest tail",()=>{let t=_chunkVNLOBA2Bcjs.a.call(void 0, [123,456],2);expectTypeOf(t).toEqualTypeOf()});test("tuple with rest middle",()=>{let t=_chunkVNLOBA2Bcjs.a.call(void 0, [123,456],2);expectTypeOf(t).toEqualTypeOf()});test("readonly tuple with rest middle",()=>{let t=_chunkVNLOBA2Bcjs.a.call(void 0, [123,456],2);expectTypeOf(t).toEqualTypeOf()});test("tuple with rest head",()=>{let t=_chunkVNLOBA2Bcjs.a.call(void 0, [123,456],2);expectTypeOf(t).toEqualTypeOf()});test("readonly tuple with rest head",()=>{let t=_chunkVNLOBA2Bcjs.a.call(void 0, [123,456],2);expectTypeOf(t).toEqualTypeOf()});
+"use strict";var _chunkY3WI7FPBcjs = require('./chunk-Y3WI7FPB.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');describe("edge-cases",()=>{test("0 chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1,2,3],0);expectTypeOf(e).toEqualTypeOf()}),test("negative chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1,2,3],-10);expectTypeOf(e).toEqualTypeOf()})});describe("regular (non-literal) size",()=>{describe("mutable",()=>{test("empty tuple",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [],2);expectTypeOf(e).toEqualTypeOf()}),test("array",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,456,789],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple with rest tail",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,456],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple with rest middle",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,456],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple with rest head",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,456],2);expectTypeOf(e).toEqualTypeOf()})}),describe("readonly",()=>{test("empty tuple",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [],2);expectTypeOf(e).toEqualTypeOf()}),test("array",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,456,789],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple with rest tail",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,456],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple with rest middle",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,456],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple with rest head",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,456],2);expectTypeOf(e).toEqualTypeOf()})})});describe("literal size",()=>{describe("mutable",()=>{test("empty tuple",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [],2);expectTypeOf(e).toEqualTypeOf()}),test("array",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,456,789],2);expectTypeOf(e).toEqualTypeOf()}),describe("infinite tuples (rest/spread item)",()=>{describe("prefix arrays",()=>{test("prefix is shorter than chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1],2);expectTypeOf(e).toEqualTypeOf()}),test("prefix is same size as chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1,2],2);expectTypeOf(e).toEqualTypeOf()}),test("prefix is longer than chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1,2,3],2);expectTypeOf(e).toEqualTypeOf()})}),describe("suffix arrays",()=>{test("suffix is shorter than chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1],2);expectTypeOf(e).toEqualTypeOf()}),test("suffix is same size as chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1,2],2);expectTypeOf(e).toEqualTypeOf()}),test("suffix is larger than chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1,2,3],2);expectTypeOf(e).toEqualTypeOf()})}),test("both prefix and suffix",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,"abc"],2);expectTypeOf(e).toEqualTypeOf()})})}),describe("readonly",()=>{test("empty tuple",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [],2);expectTypeOf(e).toEqualTypeOf()}),test("array",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,456,789],2);expectTypeOf(e).toEqualTypeOf()}),test("const",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,456,789],2);expectTypeOf(e).toEqualTypeOf()}),describe("infinite tuples (rest/spread item)",()=>{describe("prefix arrays",()=>{test("prefix is shorter than chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1],2);expectTypeOf(e).toEqualTypeOf()}),test("prefix is same size as chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1,2],2);expectTypeOf(e).toEqualTypeOf()}),test("prefix is longer than chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1,2,3],2);expectTypeOf(e).toEqualTypeOf()})}),describe("suffix arrays",()=>{test("suffix is shorter than chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1],2);expectTypeOf(e).toEqualTypeOf()}),test("suffix is same size as chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1,2],2);expectTypeOf(e).toEqualTypeOf()}),test("suffix is larger than chunk size",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [1,2,3],2);expectTypeOf(e).toEqualTypeOf()})}),test("both prefix and suffix",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, [123,"abc"],2);expectTypeOf(e).toEqualTypeOf()})})}),describe("max literal chunk size",()=>{test("below max",()=>{let[[e,o,...n]]=_chunkY3WI7FPBcjs.a.call(void 0, ["abc",!0],200);expectTypeOf(e).toEqualTypeOf(),expectTypeOf(o).toEqualTypeOf(),expectTypeOf(n[197]).toEqualTypeOf(),expectTypeOf(n[198]).toEqualTypeOf()})}),test("above max",()=>{let e=_chunkY3WI7FPBcjs.a.call(void 0, ["abc",!0],1e3);expectTypeOf(e).toEqualTypeOf()})});

package/dist/chunk.spec-d.js

@@ -1 +1 @@
-import{a as e}from"./chunk-TR5T6KUC.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";test("empty tuple",()=>{let t=e([],2);expectTypeOf(t).toEqualTypeOf()});test("readonly empty tuple",()=>{let t=e([],2);expectTypeOf(t).toEqualTypeOf()});test("array",()=>{let t=e([],2);expectTypeOf(t).toEqualTypeOf()});test("readonly array",()=>{let t=e([],2);expectTypeOf(t).toEqualTypeOf()});test("tuple",()=>{let t=e([123,456,789],2);expectTypeOf(t).toEqualTypeOf()});test("readonly tuple",()=>{let t=e([123,456,789],2);expectTypeOf(t).toEqualTypeOf()});test("tuple with rest tail",()=>{let t=e([123,456],2);expectTypeOf(t).toEqualTypeOf()});test("readonly tuple with rest tail",()=>{let t=e([123,456],2);expectTypeOf(t).toEqualTypeOf()});test("tuple with rest middle",()=>{let t=e([123,456],2);expectTypeOf(t).toEqualTypeOf()});test("readonly tuple with rest middle",()=>{let t=e([123,456],2);expectTypeOf(t).toEqualTypeOf()});test("tuple with rest head",()=>{let t=e([123,456],2);expectTypeOf(t).toEqualTypeOf()});test("readonly tuple with rest head",()=>{let t=e([123,456],2);expectTypeOf(t).toEqualTypeOf()});
+import{a as r}from"./chunk-BT3FI7L7.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";describe("edge-cases",()=>{test("0 chunk size",()=>{let e=r([1,2,3],0);expectTypeOf(e).toEqualTypeOf()}),test("negative chunk size",()=>{let e=r([1,2,3],-10);expectTypeOf(e).toEqualTypeOf()})});describe("regular (non-literal) size",()=>{describe("mutable",()=>{test("empty tuple",()=>{let e=r([],2);expectTypeOf(e).toEqualTypeOf()}),test("array",()=>{let e=r([],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=r([123,456,789],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple with rest tail",()=>{let e=r([123,456],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple with rest middle",()=>{let e=r([123,456],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple with rest head",()=>{let e=r([123,456],2);expectTypeOf(e).toEqualTypeOf()})}),describe("readonly",()=>{test("empty tuple",()=>{let e=r([],2);expectTypeOf(e).toEqualTypeOf()}),test("array",()=>{let e=r([],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=r([123,456,789],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple with rest tail",()=>{let e=r([123,456],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple with rest middle",()=>{let e=r([123,456],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple with rest head",()=>{let e=r([123,456],2);expectTypeOf(e).toEqualTypeOf()})})});describe("literal size",()=>{describe("mutable",()=>{test("empty tuple",()=>{let e=r([],2);expectTypeOf(e).toEqualTypeOf()}),test("array",()=>{let e=r([],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=r([123,456,789],2);expectTypeOf(e).toEqualTypeOf()}),describe("infinite tuples (rest/spread item)",()=>{describe("prefix arrays",()=>{test("prefix is shorter than chunk size",()=>{let e=r([1],2);expectTypeOf(e).toEqualTypeOf()}),test("prefix is same size as chunk size",()=>{let e=r([1,2],2);expectTypeOf(e).toEqualTypeOf()}),test("prefix is longer than chunk size",()=>{let e=r([1,2,3],2);expectTypeOf(e).toEqualTypeOf()})}),describe("suffix arrays",()=>{test("suffix is shorter than chunk size",()=>{let e=r([1],2);expectTypeOf(e).toEqualTypeOf()}),test("suffix is same size as chunk size",()=>{let e=r([1,2],2);expectTypeOf(e).toEqualTypeOf()}),test("suffix is larger than chunk size",()=>{let e=r([1,2,3],2);expectTypeOf(e).toEqualTypeOf()})}),test("both prefix and suffix",()=>{let e=r([123,"abc"],2);expectTypeOf(e).toEqualTypeOf()})})}),describe("readonly",()=>{test("empty tuple",()=>{let e=r([],2);expectTypeOf(e).toEqualTypeOf()}),test("array",()=>{let e=r([],2);expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=r([123,456,789],2);expectTypeOf(e).toEqualTypeOf()}),test("const",()=>{let e=r([123,456,789],2);expectTypeOf(e).toEqualTypeOf()}),describe("infinite tuples (rest/spread item)",()=>{describe("prefix arrays",()=>{test("prefix is shorter than chunk size",()=>{let e=r([1],2);expectTypeOf(e).toEqualTypeOf()}),test("prefix is same size as chunk size",()=>{let e=r([1,2],2);expectTypeOf(e).toEqualTypeOf()}),test("prefix is longer than chunk size",()=>{let e=r([1,2,3],2);expectTypeOf(e).toEqualTypeOf()})}),describe("suffix arrays",()=>{test("suffix is shorter than chunk size",()=>{let e=r([1],2);expectTypeOf(e).toEqualTypeOf()}),test("suffix is same size as chunk size",()=>{let e=r([1,2],2);expectTypeOf(e).toEqualTypeOf()}),test("suffix is larger than chunk size",()=>{let e=r([1,2,3],2);expectTypeOf(e).toEqualTypeOf()})}),test("both prefix and suffix",()=>{let e=r([123,"abc"],2);expectTypeOf(e).toEqualTypeOf()})})}),describe("max literal chunk size",()=>{test("below max",()=>{let[[e,o,...n]]=r(["abc",!0],200);expectTypeOf(e).toEqualTypeOf(),expectTypeOf(o).toEqualTypeOf(),expectTypeOf(n[197]).toEqualTypeOf(),expectTypeOf(n[198]).toEqualTypeOf()})}),test("above max",()=>{let e=r(["abc",!0],1e3);expectTypeOf(e).toEqualTypeOf()})});

package/dist/concat.d.cts

@@ -1,4 +1,4 @@
-import { I as IterableContainer } from './types-BMu1PIvo.cjs';
+import { I as IterableContainer } from './types-CC8iZVKO.cjs';
 import 'type-fest';
 
 /**

package/dist/concat.d.ts

@@ -1,4 +1,4 @@
-import { I as IterableContainer } from './types-BMu1PIvo.js';
+import { I as IterableContainer } from './types-CC8iZVKO.js';
 import 'type-fest';
 
 /**

package/dist/conditional.d.cts

@@ -1,4 +1,4 @@
-import { G as GuardType } from './types-BMu1PIvo.cjs';
+import { G as GuardType } from './types-CC8iZVKO.cjs';
 import 'type-fest';
 
 type Case<In, Out, When extends (x: In) => boolean = (x: In) => boolean> = readonly [when: When, then: (x: GuardType<When, In> & In) => Out];

package/dist/conditional.d.ts

@@ -1,4 +1,4 @@
-import { G as GuardType } from './types-BMu1PIvo.js';
+import { G as GuardType } from './types-CC8iZVKO.js';
 import 'type-fest';
 
 type Case<In, Out, When extends (x: In) => boolean = (x: In) => boolean> = readonly [when: When, then: (x: GuardType<When, In> & In) => Out];

package/dist/conditional.spec-d.cjs

@@ -1 +1 @@
-"use strict";var _chunkXUEOOIR6cjs = require('./chunk-XUEOOIR6.cjs');var _chunkYWTY4X2Rcjs = require('./chunk-YWTY4X2R.cjs');var _chunkDAFN5EJRcjs = require('./chunk-DAFN5EJR.cjs');var _chunkSXTSJOEEcjs = require('./chunk-SXTSJOEE.cjs');var _chunkEHJK4JRFcjs = require('./chunk-EHJK4JRF.cjs');var _chunkDHNCWVVTcjs = require('./chunk-DHNCWVVT.cjs');var _chunkI6VXEY44cjs = require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');require('./chunk-FWQYL4Y4.cjs');require('./chunk-G66EZBJS.cjs');var _chunkE6JSDI5Scjs = require('./chunk-E6JSDI5S.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');describe("data-first",()=>{it("narrows types in the transformers",()=>{_chunkE6JSDI5Scjs.a.call(void 0, 3,[_chunkEHJK4JRFcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkYWTY4X2Rcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkXUEOOIR6cjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkDAFN5EJRcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[e=>e===3,e=>{expectTypeOf(e).toEqualTypeOf()}])}),it("narrows types when using `isNullish`/`isNonNullish` with complex data",()=>{let t=_chunkDHNCWVVTcjs.a.call(void 0, [{x:10},{x:20}],_chunkSXTSJOEEcjs.a.call(void 0, "x"));_chunkE6JSDI5Scjs.a.call(void 0, t,[_chunkXUEOOIR6cjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkDAFN5EJRcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}])}),it("passes the trivial defaultCase's type to the output",()=>{let t=_chunkE6JSDI5Scjs.a.call(void 0, "Jokic",[_chunkEHJK4JRFcjs.a,()=>"hello"],_chunkE6JSDI5Scjs.a.defaultCase());expectTypeOf(t).toEqualTypeOf()}),it("passes the defaultCase's type to the output",()=>{let t=_chunkE6JSDI5Scjs.a.call(void 0, "Jokic",[_chunkEHJK4JRFcjs.a,()=>"hello"],_chunkE6JSDI5Scjs.a.defaultCase(()=>123));expectTypeOf(t).toEqualTypeOf()})});describe("data-last",()=>{it("narrows types in the transformers",()=>{_chunkI6VXEY44cjs.a.call(void 0, 3,_chunkE6JSDI5Scjs.a.call(void 0, [_chunkEHJK4JRFcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkYWTY4X2Rcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkXUEOOIR6cjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkDAFN5EJRcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[e=>e===3,e=>{expectTypeOf(e).toEqualTypeOf()}]))}),it("narrows types when using `isNullish`/`isNonNullish` with complex data",()=>{_chunkI6VXEY44cjs.a.call(void 0, [{x:10},{x:20}],_chunkDHNCWVVTcjs.a.call(void 0, _chunkSXTSJOEEcjs.a.call(void 0, "x")),_chunkE6JSDI5Scjs.a.call(void 0, [_chunkXUEOOIR6cjs.a,t=>{expectTypeOf(t).toEqualTypeOf()}],[_chunkDAFN5EJRcjs.a,t=>{expectTypeOf(t).toEqualTypeOf()}]))}),it("passes the trivial defaultCase's type to the output",()=>{let t=_chunkI6VXEY44cjs.a.call(void 0, "Jokic",_chunkE6JSDI5Scjs.a.call(void 0, [_chunkEHJK4JRFcjs.a,()=>"hello"],_chunkE6JSDI5Scjs.a.defaultCase()));expectTypeOf(t).toEqualTypeOf()}),it("passes the defaultCase's type to the output",()=>{let t=_chunkI6VXEY44cjs.a.call(void 0, "Jokic",_chunkE6JSDI5Scjs.a.call(void 0, [_chunkEHJK4JRFcjs.a,()=>"hello"],_chunkE6JSDI5Scjs.a.defaultCase(()=>123)));expectTypeOf(t).toEqualTypeOf()})});
+"use strict";var _chunkYWTY4X2Rcjs = require('./chunk-YWTY4X2R.cjs');var _chunkDAFN5EJRcjs = require('./chunk-DAFN5EJR.cjs');var _chunkXUEOOIR6cjs = require('./chunk-XUEOOIR6.cjs');var _chunkSXTSJOEEcjs = require('./chunk-SXTSJOEE.cjs');var _chunkEHJK4JRFcjs = require('./chunk-EHJK4JRF.cjs');var _chunkDHNCWVVTcjs = require('./chunk-DHNCWVVT.cjs');var _chunkI6VXEY44cjs = require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');require('./chunk-FWQYL4Y4.cjs');require('./chunk-G66EZBJS.cjs');var _chunkE6JSDI5Scjs = require('./chunk-E6JSDI5S.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');describe("data-first",()=>{it("narrows types in the transformers",()=>{_chunkE6JSDI5Scjs.a.call(void 0, 3,[_chunkEHJK4JRFcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkYWTY4X2Rcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkXUEOOIR6cjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkDAFN5EJRcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[e=>e===3,e=>{expectTypeOf(e).toEqualTypeOf()}])}),it("narrows types when using `isNullish`/`isNonNullish` with complex data",()=>{let t=_chunkDHNCWVVTcjs.a.call(void 0, [{x:10},{x:20}],_chunkSXTSJOEEcjs.a.call(void 0, "x"));_chunkE6JSDI5Scjs.a.call(void 0, t,[_chunkXUEOOIR6cjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkDAFN5EJRcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}])}),it("passes the trivial defaultCase's type to the output",()=>{let t=_chunkE6JSDI5Scjs.a.call(void 0, "Jokic",[_chunkEHJK4JRFcjs.a,()=>"hello"],_chunkE6JSDI5Scjs.a.defaultCase());expectTypeOf(t).toEqualTypeOf()}),it("passes the defaultCase's type to the output",()=>{let t=_chunkE6JSDI5Scjs.a.call(void 0, "Jokic",[_chunkEHJK4JRFcjs.a,()=>"hello"],_chunkE6JSDI5Scjs.a.defaultCase(()=>123));expectTypeOf(t).toEqualTypeOf()})});describe("data-last",()=>{it("narrows types in the transformers",()=>{_chunkI6VXEY44cjs.a.call(void 0, 3,_chunkE6JSDI5Scjs.a.call(void 0, [_chunkEHJK4JRFcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkYWTY4X2Rcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkXUEOOIR6cjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[_chunkDAFN5EJRcjs.a,e=>{expectTypeOf(e).toEqualTypeOf()}],[e=>e===3,e=>{expectTypeOf(e).toEqualTypeOf()}]))}),it("narrows types when using `isNullish`/`isNonNullish` with complex data",()=>{_chunkI6VXEY44cjs.a.call(void 0, [{x:10},{x:20}],_chunkDHNCWVVTcjs.a.call(void 0, _chunkSXTSJOEEcjs.a.call(void 0, "x")),_chunkE6JSDI5Scjs.a.call(void 0, [_chunkXUEOOIR6cjs.a,t=>{expectTypeOf(t).toEqualTypeOf()}],[_chunkDAFN5EJRcjs.a,t=>{expectTypeOf(t).toEqualTypeOf()}]))}),it("passes the trivial defaultCase's type to the output",()=>{let t=_chunkI6VXEY44cjs.a.call(void 0, "Jokic",_chunkE6JSDI5Scjs.a.call(void 0, [_chunkEHJK4JRFcjs.a,()=>"hello"],_chunkE6JSDI5Scjs.a.defaultCase()));expectTypeOf(t).toEqualTypeOf()}),it("passes the defaultCase's type to the output",()=>{let t=_chunkI6VXEY44cjs.a.call(void 0, "Jokic",_chunkE6JSDI5Scjs.a.call(void 0, [_chunkEHJK4JRFcjs.a,()=>"hello"],_chunkE6JSDI5Scjs.a.defaultCase(()=>123)));expectTypeOf(t).toEqualTypeOf()})});

package/dist/conditional.spec-d.js

@@ -1 +1 @@
-import{a}from"./chunk-TBXEXWSK.js";import{a as r}from"./chunk-Q2HW4RVT.js";import{a as o}from"./chunk-QPP664N4.js";import{a as f}from"./chunk-USNHLUEU.js";import{a as p}from"./chunk-UYLVIAK4.js";import{a as l}from"./chunk-J5PNUDDU.js";import{a as i}from"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";import"./chunk-JXXXUJM5.js";import"./chunk-73BYESBE.js";import{a as s}from"./chunk-H2E5GCCP.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";describe("data-first",()=>{it("narrows types in the transformers",()=>{s(3,[p,e=>{expectTypeOf(e).toEqualTypeOf()}],[r,e=>{expectTypeOf(e).toEqualTypeOf()}],[a,e=>{expectTypeOf(e).toEqualTypeOf()}],[o,e=>{expectTypeOf(e).toEqualTypeOf()}],[e=>e===3,e=>{expectTypeOf(e).toEqualTypeOf()}])}),it("narrows types when using `isNullish`/`isNonNullish` with complex data",()=>{let t=l([{x:10},{x:20}],f("x"));s(t,[a,e=>{expectTypeOf(e).toEqualTypeOf()}],[o,e=>{expectTypeOf(e).toEqualTypeOf()}])}),it("passes the trivial defaultCase's type to the output",()=>{let t=s("Jokic",[p,()=>"hello"],s.defaultCase());expectTypeOf(t).toEqualTypeOf()}),it("passes the defaultCase's type to the output",()=>{let t=s("Jokic",[p,()=>"hello"],s.defaultCase(()=>123));expectTypeOf(t).toEqualTypeOf()})});describe("data-last",()=>{it("narrows types in the transformers",()=>{i(3,s([p,e=>{expectTypeOf(e).toEqualTypeOf()}],[r,e=>{expectTypeOf(e).toEqualTypeOf()}],[a,e=>{expectTypeOf(e).toEqualTypeOf()}],[o,e=>{expectTypeOf(e).toEqualTypeOf()}],[e=>e===3,e=>{expectTypeOf(e).toEqualTypeOf()}]))}),it("narrows types when using `isNullish`/`isNonNullish` with complex data",()=>{i([{x:10},{x:20}],l(f("x")),s([a,t=>{expectTypeOf(t).toEqualTypeOf()}],[o,t=>{expectTypeOf(t).toEqualTypeOf()}]))}),it("passes the trivial defaultCase's type to the output",()=>{let t=i("Jokic",s([p,()=>"hello"],s.defaultCase()));expectTypeOf(t).toEqualTypeOf()}),it("passes the defaultCase's type to the output",()=>{let t=i("Jokic",s([p,()=>"hello"],s.defaultCase(()=>123)));expectTypeOf(t).toEqualTypeOf()})});
+import{a as r}from"./chunk-Q2HW4RVT.js";import{a as o}from"./chunk-QPP664N4.js";import{a}from"./chunk-TBXEXWSK.js";import{a as f}from"./chunk-USNHLUEU.js";import{a as p}from"./chunk-UYLVIAK4.js";import{a as l}from"./chunk-J5PNUDDU.js";import{a as i}from"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";import"./chunk-JXXXUJM5.js";import"./chunk-73BYESBE.js";import{a as s}from"./chunk-H2E5GCCP.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";describe("data-first",()=>{it("narrows types in the transformers",()=>{s(3,[p,e=>{expectTypeOf(e).toEqualTypeOf()}],[r,e=>{expectTypeOf(e).toEqualTypeOf()}],[a,e=>{expectTypeOf(e).toEqualTypeOf()}],[o,e=>{expectTypeOf(e).toEqualTypeOf()}],[e=>e===3,e=>{expectTypeOf(e).toEqualTypeOf()}])}),it("narrows types when using `isNullish`/`isNonNullish` with complex data",()=>{let t=l([{x:10},{x:20}],f("x"));s(t,[a,e=>{expectTypeOf(e).toEqualTypeOf()}],[o,e=>{expectTypeOf(e).toEqualTypeOf()}])}),it("passes the trivial defaultCase's type to the output",()=>{let t=s("Jokic",[p,()=>"hello"],s.defaultCase());expectTypeOf(t).toEqualTypeOf()}),it("passes the defaultCase's type to the output",()=>{let t=s("Jokic",[p,()=>"hello"],s.defaultCase(()=>123));expectTypeOf(t).toEqualTypeOf()})});describe("data-last",()=>{it("narrows types in the transformers",()=>{i(3,s([p,e=>{expectTypeOf(e).toEqualTypeOf()}],[r,e=>{expectTypeOf(e).toEqualTypeOf()}],[a,e=>{expectTypeOf(e).toEqualTypeOf()}],[o,e=>{expectTypeOf(e).toEqualTypeOf()}],[e=>e===3,e=>{expectTypeOf(e).toEqualTypeOf()}]))}),it("narrows types when using `isNullish`/`isNonNullish` with complex data",()=>{i([{x:10},{x:20}],l(f("x")),s([a,t=>{expectTypeOf(t).toEqualTypeOf()}],[o,t=>{expectTypeOf(t).toEqualTypeOf()}]))}),it("passes the trivial defaultCase's type to the output",()=>{let t=i("Jokic",s([p,()=>"hello"],s.defaultCase()));expectTypeOf(t).toEqualTypeOf()}),it("passes the defaultCase's type to the output",()=>{let t=i("Jokic",s([p,()=>"hello"],s.defaultCase(()=>123)));expectTypeOf(t).toEqualTypeOf()})});

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

@@ -1,4 +1,4 @@
-import { N as NonEmptyArray } from './types-BMu1PIvo.cjs';
+import { a as NonEmptyArray } from './types-CC8iZVKO.cjs';
 import { O as OrderRule } from './curry-order-rules-DETxSzle.cjs';
 import 'type-fest';
 

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

@@ -1,4 +1,4 @@
-import { N as NonEmptyArray } from './types-BMu1PIvo.js';
+import { a as NonEmptyArray } from './types-CC8iZVKO.js';
 import { O as OrderRule } from './curry-order-rules-DETxSzle.js';
 import 'type-fest';
 

package/dist/drop-last-while.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkP7OXTPPHcjs = require('./chunk-P7OXTPPH.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.dropLastWhile = _chunkP7OXTPPHcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkG7BJFBAZcjs = require('./chunk-G7BJFBAZ.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.dropLastWhile = _chunkG7BJFBAZcjs.a;

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

@@ -1,3 +1,6 @@
+import { I as IterableContainer } from './types-CC8iZVKO.cjs';
+import 'type-fest';
+
 /**
  * Removes elements from the end of the array until the predicate returns false.
  *
@@ -12,7 +15,7 @@
  * @dataFirst
  * @category Array
  */
-declare function dropLastWhile<T>(data: ReadonlyArray<T>, predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): Array<T>;
+declare function dropLastWhile<T extends IterableContainer>(data: T, predicate: (item: T[number], index: number, data: T) => boolean): Array<T[number]>;
 /**
  * Removes elements from the end of the array until the predicate returns false.
  *
@@ -26,6 +29,6 @@ declare function dropLastWhile<T>(data: ReadonlyArray<T>, predicate: (item: T, i
  * @dataLast
  * @category Array
  */
-declare function dropLastWhile<T>(predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): (data: ReadonlyArray<T>) => Array<T>;
+declare function dropLastWhile<T extends IterableContainer>(predicate: (item: T[number], index: number, data: T) => boolean): (data: T) => Array<T[number]>;
 
 export { dropLastWhile };

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

@@ -1,3 +1,6 @@
+import { I as IterableContainer } from './types-CC8iZVKO.js';
+import 'type-fest';
+
 /**
  * Removes elements from the end of the array until the predicate returns false.
  *
@@ -12,7 +15,7 @@
  * @dataFirst
  * @category Array
  */
-declare function dropLastWhile<T>(data: ReadonlyArray<T>, predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): Array<T>;
+declare function dropLastWhile<T extends IterableContainer>(data: T, predicate: (item: T[number], index: number, data: T) => boolean): Array<T[number]>;
 /**
  * Removes elements from the end of the array until the predicate returns false.
  *
@@ -26,6 +29,6 @@ declare function dropLastWhile<T>(data: ReadonlyArray<T>, predicate: (item: T, i
  * @dataLast
  * @category Array
  */
-declare function dropLastWhile<T>(predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): (data: ReadonlyArray<T>) => Array<T>;
+declare function dropLastWhile<T extends IterableContainer>(predicate: (item: T[number], index: number, data: T) => boolean): (data: T) => Array<T[number]>;
 
 export { dropLastWhile };

package/dist/drop-last-while.js

@@ -1 +1 @@
-import{a}from"./chunk-QTCQZ7LU.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as dropLastWhile};
+import{a}from"./chunk-QTQTKNWA.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as dropLastWhile};

package/dist/drop-last-while.spec-d.cjs

@@ -0,0 +1 @@
+"use strict";var _chunkG7BJFBAZcjs = require('./chunk-G7BJFBAZ.cjs');var _chunkI6VXEY44cjs = require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');var _chunkWLNQOMKLcjs = require('./chunk-WLNQOMKL.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');describe("data-first",()=>{test("empty array",()=>{let e=_chunkG7BJFBAZcjs.a.call(void 0, [],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("regular array",()=>{let e=_chunkG7BJFBAZcjs.a.call(void 0, [],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("regular array with union type",()=>{let e=_chunkG7BJFBAZcjs.a.call(void 0, [],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("prefix array",()=>{let e=_chunkG7BJFBAZcjs.a.call(void 0, [1],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("suffix array",()=>{let e=_chunkG7BJFBAZcjs.a.call(void 0, [1],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let e=_chunkG7BJFBAZcjs.a.call(void 0, [1,"a"],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=_chunkG7BJFBAZcjs.a.call(void 0, [1,"a",!0],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("union of arrays",()=>{let e=_chunkG7BJFBAZcjs.a.call(void 0, [],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()})});describe("data-last",()=>{test("empty array",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [],_chunkG7BJFBAZcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("regular array",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [],_chunkG7BJFBAZcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("regular array with union type",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [],_chunkG7BJFBAZcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("prefix array",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [1],_chunkG7BJFBAZcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("suffix array",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [1],_chunkG7BJFBAZcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [1,"a"],_chunkG7BJFBAZcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [1,"a",!0],_chunkG7BJFBAZcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("union of arrays",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [],_chunkG7BJFBAZcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),describe("predicate is typed correctly",()=>{test("empty array",()=>{_chunkI6VXEY44cjs.a.call(void 0, [],_chunkG7BJFBAZcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("regular array",()=>{_chunkI6VXEY44cjs.a.call(void 0, [],_chunkG7BJFBAZcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("regular array with union type",()=>{_chunkI6VXEY44cjs.a.call(void 0, [],_chunkG7BJFBAZcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("prefix array",()=>{_chunkI6VXEY44cjs.a.call(void 0, [1],_chunkG7BJFBAZcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("suffix array",()=>{_chunkI6VXEY44cjs.a.call(void 0, [1],_chunkG7BJFBAZcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("array with suffix and prefix",()=>{_chunkI6VXEY44cjs.a.call(void 0, [1,"a"],_chunkG7BJFBAZcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("tuple",()=>{_chunkI6VXEY44cjs.a.call(void 0, [1,"a",!0],_chunkG7BJFBAZcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("union of arrays",()=>{_chunkI6VXEY44cjs.a.call(void 0, [],_chunkG7BJFBAZcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))})})});

package/dist/drop-last-while.spec-d.d.cts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/drop-last-while.spec-d.d.ts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/drop-last-while.spec-d.js

@@ -0,0 +1 @@
+import{a as r}from"./chunk-QTQTKNWA.js";import{a as t}from"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";import{a}from"./chunk-T5XG33UI.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";describe("data-first",()=>{test("empty array",()=>{let e=r([],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("regular array",()=>{let e=r([],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("regular array with union type",()=>{let e=r([],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("prefix array",()=>{let e=r([1],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("suffix array",()=>{let e=r([1],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let e=r([1,"a"],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=r([1,"a",!0],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("union of arrays",()=>{let e=r([],a(!0));expectTypeOf(e).toEqualTypeOf()})});describe("data-last",()=>{test("empty array",()=>{let e=t([],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("regular array",()=>{let e=t([],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("regular array with union type",()=>{let e=t([],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("prefix array",()=>{let e=t([1],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("suffix array",()=>{let e=t([1],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let e=t([1,"a"],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=t([1,"a",!0],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("union of arrays",()=>{let e=t([],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),describe("predicate is typed correctly",()=>{test("empty array",()=>{t([],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("regular array",()=>{t([],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("regular array with union type",()=>{t([],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("prefix array",()=>{t([1],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("suffix array",()=>{t([1],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("array with suffix and prefix",()=>{t([1,"a"],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("tuple",()=>{t([1,"a",!0],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("union of arrays",()=>{t([],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))})})});

package/dist/drop-last.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkZCFTW5HOcjs = require('./chunk-ZCFTW5HO.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.dropLast = _chunkZCFTW5HOcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkAACZ5UGGcjs = require('./chunk-AACZ5UGG.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.dropLast = _chunkAACZ5UGGcjs.a;

package/dist/drop-last.d.cts

@@ -1,3 +1,6 @@
+import { I as IterableContainer } from './types-CC8iZVKO.cjs';
+import 'type-fest';
+
 /**
  * Removes last `n` elements from the `array`.
  *
@@ -10,7 +13,7 @@
  * @dataFirst
  * @category Array
  */
-declare function dropLast<T>(array: ReadonlyArray<T>, n: number): Array<T>;
+declare function dropLast<T extends IterableContainer>(array: T, n: number): Array<T[number]>;
 /**
  * Removes last `n` elements from the `array`.
  *
@@ -22,6 +25,6 @@ declare function dropLast<T>(array: ReadonlyArray<T>, n: number): Array<T>;
  * @dataLast
  * @category Array
  */
-declare function dropLast<T>(n: number): (array: ReadonlyArray<T>) => Array<T>;
+declare function dropLast(n: number): <T extends IterableContainer>(array: T) => Array<T[number]>;
 
 export { dropLast };