@vinicunca/perkakas 1.0.2 → 1.0.4

package/dist/add-prop.d.cts

@@ -1,4 +1,4 @@
-import { U as UpsertProp } from './types-BMu1PIvo.cjs';
+import { U as UpsertProp } from './types-BE3YOWVA.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-BE3YOWVA.js';
 import 'type-fest';
 
 /**

package/dist/add-prop.spec-d.cjs

@@ -0,0 +1 @@
+"use strict";var _chunkFFIQSVSTcjs = require('./chunk-FFIQSVST.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');it("allows redefining prop types",()=>{let t=_chunkFFIQSVSTcjs.a.call(void 0, {},"a",1);expectTypeOf(t).toEqualTypeOf()});it("makes optional fields required",()=>{let t=_chunkFFIQSVSTcjs.a.call(void 0, {},"a","hello");expectTypeOf(t).toEqualTypeOf()});it("allows setting an unknown prop",()=>{let t=_chunkFFIQSVSTcjs.a.call(void 0, {a:"foo"},"b","bar");expectTypeOf(t).toEqualTypeOf()});it("sets literal unions as optional",()=>{let t=_chunkFFIQSVSTcjs.a.call(void 0, {},"b",123);expectTypeOf(t).toEqualTypeOf()});it("keeps the prop optional when the key isn't literal",()=>{let t=_chunkFFIQSVSTcjs.a.call(void 0, {},"a","foo");expectTypeOf(t).toEqualTypeOf()});it("works on simple objects",()=>{let t=_chunkFFIQSVSTcjs.a.call(void 0, {},"a","foo");expectTypeOf(t).toEqualTypeOf()});

package/dist/add-prop.spec-d.d.cts

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

package/dist/add-prop.spec-d.d.ts

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

package/dist/add-prop.spec-d.js

@@ -0,0 +1 @@
+import{a as e}from"./chunk-7JDXDFFQ.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";it("allows redefining prop types",()=>{let t=e({},"a",1);expectTypeOf(t).toEqualTypeOf()});it("makes optional fields required",()=>{let t=e({},"a","hello");expectTypeOf(t).toEqualTypeOf()});it("allows setting an unknown prop",()=>{let t=e({a:"foo"},"b","bar");expectTypeOf(t).toEqualTypeOf()});it("sets literal unions as optional",()=>{let t=e({},"b",123);expectTypeOf(t).toEqualTypeOf()});it("keeps the prop optional when the key isn't literal",()=>{let t=e({},"a","foo");expectTypeOf(t).toEqualTypeOf()});it("works on simple objects",()=>{let t=e({},"a","foo");expectTypeOf(t).toEqualTypeOf()});

package/dist/chunk-2ADWP73S.js

@@ -0,0 +1 @@
+import{a}from"./chunk-JFXZ246Y.js";function c(...e){return a(u,e)}function u(e,n){if(e===n||Object.is(e,n))return!0;if(typeof e!="object"||e===null||typeof n!="object"||n===null)return!1;if(e instanceof Map&&n instanceof Map)return s(e,n);if(e instanceof Set&&n instanceof Set)return f(e,n);let t=Object.keys(e);if(t.length!==Object.keys(n).length)return!1;for(let o of t){if(!Object.prototype.hasOwnProperty.call(n,o))return!1;let{[o]:l}=e,{[o]:r}=n;if(l!==r||!Object.is(l,r))return!1}return!0}function s(e,n){if(e.size!==n.size)return!1;for(let[t,o]of e){let l=n.get(t);if(o!==l||!Object.is(o,l))return!1}return!0}function f(e,n){if(e.size!==n.size)return!1;for(let t of e)if(!n.has(t))return!1;return!0}export{c as a};

package/dist/chunk-2VLHCBHJ.js

@@ -0,0 +1 @@
+var e=class{get foo(){return"a"}},r={array:[1,2,3],bigint:1n,boolean:!1,date:new Date("1985-07-24T07:40:00.000Z"),error:new Error("asd"),function:()=>{},instance:new e,map:new Map,null:null,number:5,object:{a:"asd"},promise:Promise.resolve(5),regex:/test/gu,set:new Set,string:"text",symbol:Symbol("symbol"),tuple:[1,2,3],typedArray:new Uint8Array(1),undefined:void 0},t=Object.values(r);export{r as a,t as b};

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-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-HU67VIVI.js

@@ -0,0 +1 @@
+import{a as n}from"./chunk-JFXZ246Y.js";function o(...t){return n(r,t)}function r(t,e){return t===e||Object.is(t,e)}export{o as a};

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-IRH6TGG5.js

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

package/dist/chunk-J5PNUDDU.js

@@ -0,0 +1 @@
+import{a as o}from"./chunk-JXXXUJM5.js";import{a as t}from"./chunk-73BYESBE.js";function l(...e){return o(i,e)}function i(e,y){if(!t(e,2))return e[0];let[n]=e,[,...u]=e;for(let r of u)y(r,n)<0&&(n=r);return n}export{l as a};

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-MZWACWOX.js

@@ -0,0 +1 @@
+import{a as i}from"./chunk-JFXZ246Y.js";function a(...e){return i(T,e)}function T(e,m){if(e<1)return[];let r=Number.isInteger(e)?e:Math.floor(e),t=new Array(r);for(let n=0;n<r;n++)t[n]=m(n);return t}export{a};

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-QHGCU3LJ.js

@@ -0,0 +1 @@
+import{a as P}from"./chunk-JFXZ246Y.js";function s(...e){return P(r,e)}function r(e,u,t){let[n,...a]=u;if(n===void 0)return t;if(Array.isArray(e)){let o=[...e];return o[n]=r(e[n],a,t),o}let{[n]:T,...y}=e;return{...y,[n]:r(T,a,t)}}export{s as a,r as b};

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-RCENCAXY.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 T(...e){return _chunkY74ER22Ocjs.a.call(void 0, a,e,p)}function a(e,r){return r<0?[...e]:e.slice(r)}function p(e){if(e<=0)return _chunk3X6SAJDQcjs.c;let r=e;return u=>r>0?(r-=1,_chunk3X6SAJDQcjs.a):{done:!1,hasNext:!0,next:u}}exports.a = T;

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-T7S2RC5M.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function c(...e){return _chunkY74ER22Ocjs.a.call(void 0, u,e)}function u(e,n){if(e===n||Object.is(e,n))return!0;if(typeof e!="object"||e===null||typeof n!="object"||n===null)return!1;if(e instanceof Map&&n instanceof Map)return s(e,n);if(e instanceof Set&&n instanceof Set)return f(e,n);let t=Object.keys(e);if(t.length!==Object.keys(n).length)return!1;for(let o of t){if(!Object.prototype.hasOwnProperty.call(n,o))return!1;let{[o]:l}=e,{[o]:r}=n;if(l!==r||!Object.is(l,r))return!1}return!0}function s(e,n){if(e.size!==n.size)return!1;for(let[t,o]of e){let l=n.get(t);if(o!==l||!Object.is(o,l))return!1}return!0}function f(e,n){if(e.size!==n.size)return!1;for(let t of e)if(!n.has(t))return!1;return!0}exports.a = c;

package/dist/chunk-TRIZIXDA.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});function n(e){return e===void 0?!0:typeof e=="string"||Array.isArray(e)?e.length===0:Object.keys(e).length===0}exports.a = n;

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-ULMOKABQ.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function s(...e){return _chunkY74ER22Ocjs.a.call(void 0, r,e)}function r(e,u,t){let[n,...a]=u;if(n===void 0)return t;if(Array.isArray(e)){let o=[...e];return o[n]=r(e[n],a,t),o}let{[n]:T,...y}=e;return{...y,[n]:r(T,a,t)}}exports.a = s; exports.b = r;

package/dist/chunk-UVAWCZB6.js

@@ -0,0 +1 @@
+function n(e){return e===void 0?!0:typeof e=="string"||Array.isArray(e)?e.length===0:Object.keys(e).length===0}export{n as a};

package/dist/chunk-VAUOPMAN.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function o(...t){return _chunkY74ER22Ocjs.a.call(void 0, r,t)}function r(t,e){return t===e||Object.is(t,e)}exports.a = o;

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-XSYAC5NV.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');function a(...e){return _chunkY74ER22Ocjs.a.call(void 0, T,e)}function T(e,m){if(e<1)return[];let r=Number.isInteger(e)?e:Math.floor(e),t=new Array(r);for(let n=0;n<r;n++)t[n]=m(n);return t}exports.a = 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-ZJGZ2TEC.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var e=class{get foo(){return"a"}},r= exports.a ={array:[1,2,3],bigint:1n,boolean:!1,date:new Date("1985-07-24T07:40:00.000Z"),error:new Error("asd"),function:()=>{},instance:new e,map:new Map,null:null,number:5,object:{a:"asd"},promise:Promise.resolve(5),regex:/test/gu,set:new Set,string:"text",symbol:Symbol("symbol"),tuple:[1,2,3],typedArray:new Uint8Array(1),undefined:void 0},t= exports.b =Object.values(r);exports.a = r; exports.b = t;

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-BE3YOWVA.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-BE3YOWVA.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

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

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

package/dist/chunk.spec-d.d.ts

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

package/dist/chunk.spec-d.js

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

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

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

package/dist/conditional.spec-d.d.ts

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

package/dist/conditional.spec-d.js

@@ -0,0 +1 @@
+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/constant.spec-d.cjs

@@ -0,0 +1 @@
+"use strict";var _chunkWLNQOMKLcjs = require('./chunk-WLNQOMKL.cjs');test("supported in any api",()=>{_chunkWLNQOMKLcjs.a.call(void 0, 1),_chunkWLNQOMKLcjs.a.call(void 0, !0),_chunkWLNQOMKLcjs.a.call(void 0, "cat")});test("doesn't break return typing",()=>{_chunkWLNQOMKLcjs.a.call(void 0, "hello"),_chunkWLNQOMKLcjs.a.call(void 0, 123),_chunkWLNQOMKLcjs.a.call(void 0, "mouse")});

package/dist/constant.spec-d.d.cts

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

package/dist/constant.spec-d.d.ts

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

package/dist/constant.spec-d.js

@@ -0,0 +1 @@
+import{a}from"./chunk-T5XG33UI.js";test("supported in any api",()=>{a(1),a(!0),a("cat")});test("doesn't break return typing",()=>{a("hello"),a(123),a("mouse")});

package/dist/{curry-order-rules-BOMf1JS7.d.cts → curry-order-rules-DETxSzle.d.cts}

@@ -1,6 +1,6 @@
 declare const COMPARATORS: {
     readonly asc: <T>(x: T, y: T) => boolean;
-    readonly desc: <T_1>(x: T_1, y: T_1) => boolean;
+    readonly desc: <T>(x: T, y: T) => boolean;
 };
 /**
  * An order rule defines a projection/extractor that returns a comparable from

package/dist/{curry-order-rules-BOMf1JS7.d.ts → curry-order-rules-DETxSzle.d.ts}

@@ -1,6 +1,6 @@
 declare const COMPARATORS: {
     readonly asc: <T>(x: T, y: T) => boolean;
-    readonly desc: <T_1>(x: T_1, y: T_1) => boolean;
+    readonly desc: <T>(x: T, y: T) => boolean;
 };
 /**
  * An order rule defines a projection/extractor that returns a comparable from

package/dist/debounce.spec-d.cjs

@@ -0,0 +1 @@
+"use strict"; function _nullishCoalesce(lhs, rhsFn) { if (lhs != null) { return lhs; } else { return rhsFn(); } }var _chunkMLLA7SGZcjs = require('./chunk-MLLA7SGZ.cjs');var _chunkOLZEQGPJcjs = require('./chunk-OLZEQGPJ.cjs');it("returns undefined on 'trailing' timing",()=>{let t=_chunkOLZEQGPJcjs.a.call(void 0, ()=>"Hello, World!",{waitMs:32,timing:"trailing"}).call();expectTypeOf(t).toEqualTypeOf()});it("doesn't return undefined on 'leading' timing",()=>{let t=_chunkOLZEQGPJcjs.a.call(void 0, ()=>"Hello, World!",{waitMs:32,timing:"leading"}).call();expectTypeOf(t).toEqualTypeOf()});it("doesn't return undefined on 'both' timing",()=>{let t=_chunkOLZEQGPJcjs.a.call(void 0, ()=>"Hello, World!",{waitMs:32,timing:"both"}).call();expectTypeOf(t).toEqualTypeOf()});test("argument typing to be good (all required)",()=>{let e=_chunkOLZEQGPJcjs.a.call(void 0, (t,a,l)=>`${t}${a}${l?"y":"n"}`,{});e.call(),e.call("a"),e.call("a",1),e.call(!0,1,!0),e.call("a",1,!0)});test("argument typing to be good (with optional)",()=>{let e=_chunkOLZEQGPJcjs.a.call(void 0, (t,a,l)=>`${t}${_nullishCoalesce(a, () => ("undefined"))}${l===void 0?"undefined":l?"y":"n"}`,{});e.call(),e.call(!0,1,!0),e.call("a"),e.call("a",1),e.call("a",1,!0)});test("argument typing to be good (with defaults)",()=>{let e=_chunkOLZEQGPJcjs.a.call(void 0, (t,a=2,l=!0)=>`${t}${a}${l?"y":"n"}`,{});e.call(),e.call(!0,1,!0),e.call("a"),e.call("a",1),e.call("a",1,!0)});test("argument typing to be good (with rest param)",()=>{let e=_chunkOLZEQGPJcjs.a.call(void 0, (t,...a)=>`${t}${a.map(l=>l?"y":"n").join(",")}`,{timing:"leading"});e.call(),e.call(!0),e.call("a","b"),e.call(!0,"b"),e.call("a"),e.call("a",!0),e.call("a",!0,!1)});it("doesn't accept maxWaitMs when timing is 'leading'",()=>{_chunkOLZEQGPJcjs.a.call(void 0, _chunkMLLA7SGZcjs.a.call(void 0, ),{timing:"trailing",maxWaitMs:32}),_chunkOLZEQGPJcjs.a.call(void 0, _chunkMLLA7SGZcjs.a.call(void 0, ),{timing:"both",maxWaitMs:32}),_chunkOLZEQGPJcjs.a.call(void 0, _chunkMLLA7SGZcjs.a.call(void 0, ),{timing:"leading",maxWaitMs:32})});

package/dist/debounce.spec-d.d.cts

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

package/dist/debounce.spec-d.d.ts

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

package/dist/debounce.spec-d.js

@@ -0,0 +1 @@
+import{a as i}from"./chunk-WUAU3LTQ.js";import{a as n}from"./chunk-ENPSKQUH.js";it("returns undefined on 'trailing' timing",()=>{let t=n(()=>"Hello, World!",{waitMs:32,timing:"trailing"}).call();expectTypeOf(t).toEqualTypeOf()});it("doesn't return undefined on 'leading' timing",()=>{let t=n(()=>"Hello, World!",{waitMs:32,timing:"leading"}).call();expectTypeOf(t).toEqualTypeOf()});it("doesn't return undefined on 'both' timing",()=>{let t=n(()=>"Hello, World!",{waitMs:32,timing:"both"}).call();expectTypeOf(t).toEqualTypeOf()});test("argument typing to be good (all required)",()=>{let e=n((t,a,l)=>`${t}${a}${l?"y":"n"}`,{});e.call(),e.call("a"),e.call("a",1),e.call(!0,1,!0),e.call("a",1,!0)});test("argument typing to be good (with optional)",()=>{let e=n((t,a,l)=>`${t}${a??"undefined"}${l===void 0?"undefined":l?"y":"n"}`,{});e.call(),e.call(!0,1,!0),e.call("a"),e.call("a",1),e.call("a",1,!0)});test("argument typing to be good (with defaults)",()=>{let e=n((t,a=2,l=!0)=>`${t}${a}${l?"y":"n"}`,{});e.call(),e.call(!0,1,!0),e.call("a"),e.call("a",1),e.call("a",1,!0)});test("argument typing to be good (with rest param)",()=>{let e=n((t,...a)=>`${t}${a.map(l=>l?"y":"n").join(",")}`,{timing:"leading"});e.call(),e.call(!0),e.call("a","b"),e.call(!0,"b"),e.call("a"),e.call("a",!0),e.call("a",!0,!1)});it("doesn't accept maxWaitMs when timing is 'leading'",()=>{n(i(),{timing:"trailing",maxWaitMs:32}),n(i(),{timing:"both",maxWaitMs:32}),n(i(),{timing:"leading",maxWaitMs:32})});

package/dist/do-nothing.spec-d.cjs

@@ -0,0 +1 @@
+"use strict";var _chunkNULDWRPDcjs = require('./chunk-NULDWRPD.cjs');test("supported in any api",()=>{_chunkNULDWRPDcjs.a.call(void 0, ),_chunkNULDWRPDcjs.a.call(void 0, ),_chunkNULDWRPDcjs.a.call(void 0, )});

package/dist/do-nothing.spec-d.d.cts

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

package/dist/do-nothing.spec-d.d.ts

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

package/dist/do-nothing.spec-d.js

@@ -0,0 +1 @@
+import{a as o}from"./chunk-PHKKU45J.js";test("supported in any api",()=>{o(),o(),o()});

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

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