@vinicunca/perkakas 1.4.0 → 1.6.0

package/dist/array-required-prefix-BW08fIbb.d.cts

@@ -0,0 +1,35 @@
+import { IsLiteral, And, GreaterThan, IsNever, IsEqual, ReadonlyTuple } from 'type-fest';
+import { C as ClampedIntegerSubtract } from './clamped-integer-subtract-DZ7rsJE4.cjs';
+import { C as CoercedArray } from './coerced-array-DRz3tqda.cjs';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
+import { T as TupleParts, P as PerkakasTypeError } from './tuple-parts-DAqFAJP8.cjs';
+
+type ArrayRequiredPrefix<T extends IterableContainer, N extends number> = IsLiteral<N> extends true ? T extends unknown ? ClampedIntegerSubtract<N, [
+    ...TupleParts<T>['required'],
+    ...TupleParts<T>['suffix']
+]['length']> extends infer Remainder extends number ? Remainder extends 0 ? T : And<GreaterThan<Remainder, TupleParts<T>['optional']['length']>, IsNever<TupleParts<T>['item']>> extends true ? PerkakasTypeError<'ArrayRequiredPrefix', 'The input tuple cannot satisfy the minimum', {
+    type: never;
+    metadata: [T, N];
+}> : WithSameReadonly<T, [
+    ...TupleParts<T>['required'],
+    ...OptionalTupleRequiredPrefix<TupleParts<T>['optional'], Remainder>,
+    ...ReadonlyTuple<TupleParts<T>['item'], ClampedIntegerSubtract<Remainder, TupleParts<T>['optional']['length']>>,
+    ...CoercedArray<TupleParts<T>['item']>,
+    ...TupleParts<T>['suffix']
+]> : PerkakasTypeError<'ArrayRequiredPrefix', 'Remainder didn\'t compute to a number?!', {
+    type: never;
+    metadata: [T, N];
+}> : PerkakasTypeError<'ArrayRequiredPrefix', 'Failed to distribute union?!', {
+    type: never;
+    metadata: T;
+}> : PerkakasTypeError<'ArrayRequiredPrefix', 'Only literal minimums are supported!', {
+    type: never;
+    metadata: N;
+}>;
+type WithSameReadonly<Source, Destination> = IsEqual<Source, Readonly<Source>> extends true ? Readonly<Destination> : Destination;
+type OptionalTupleRequiredPrefix<T extends Array<unknown>, N, Prefix extends Array<unknown> = []> = Prefix['length'] extends N ? [
+    ...Prefix,
+    ...Partial<T>
+] : T extends readonly [infer Head, ...infer Rest] ? OptionalTupleRequiredPrefix<Rest, N, [...Prefix, Head]> : Prefix;
+
+export type { ArrayRequiredPrefix as A };

package/dist/array-required-prefix-a3sgCkd2.d.ts

@@ -0,0 +1,35 @@
+import { IsLiteral, And, GreaterThan, IsNever, IsEqual, ReadonlyTuple } from 'type-fest';
+import { C as ClampedIntegerSubtract } from './clamped-integer-subtract-DZ7rsJE4.js';
+import { C as CoercedArray } from './coerced-array-DRz3tqda.js';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
+import { T as TupleParts, P as PerkakasTypeError } from './tuple-parts-CrwnkDKX.js';
+
+type ArrayRequiredPrefix<T extends IterableContainer, N extends number> = IsLiteral<N> extends true ? T extends unknown ? ClampedIntegerSubtract<N, [
+    ...TupleParts<T>['required'],
+    ...TupleParts<T>['suffix']
+]['length']> extends infer Remainder extends number ? Remainder extends 0 ? T : And<GreaterThan<Remainder, TupleParts<T>['optional']['length']>, IsNever<TupleParts<T>['item']>> extends true ? PerkakasTypeError<'ArrayRequiredPrefix', 'The input tuple cannot satisfy the minimum', {
+    type: never;
+    metadata: [T, N];
+}> : WithSameReadonly<T, [
+    ...TupleParts<T>['required'],
+    ...OptionalTupleRequiredPrefix<TupleParts<T>['optional'], Remainder>,
+    ...ReadonlyTuple<TupleParts<T>['item'], ClampedIntegerSubtract<Remainder, TupleParts<T>['optional']['length']>>,
+    ...CoercedArray<TupleParts<T>['item']>,
+    ...TupleParts<T>['suffix']
+]> : PerkakasTypeError<'ArrayRequiredPrefix', 'Remainder didn\'t compute to a number?!', {
+    type: never;
+    metadata: [T, N];
+}> : PerkakasTypeError<'ArrayRequiredPrefix', 'Failed to distribute union?!', {
+    type: never;
+    metadata: T;
+}> : PerkakasTypeError<'ArrayRequiredPrefix', 'Only literal minimums are supported!', {
+    type: never;
+    metadata: N;
+}>;
+type WithSameReadonly<Source, Destination> = IsEqual<Source, Readonly<Source>> extends true ? Readonly<Destination> : Destination;
+type OptionalTupleRequiredPrefix<T extends Array<unknown>, N, Prefix extends Array<unknown> = []> = Prefix['length'] extends N ? [
+    ...Prefix,
+    ...Partial<T>
+] : T extends readonly [infer Head, ...infer Rest] ? OptionalTupleRequiredPrefix<Rest, N, [...Prefix, Head]> : Prefix;
+
+export type { ArrayRequiredPrefix as A };

package/dist/bounded-partial-CJjczH6j.d.ts

@@ -0,0 +1,14 @@
+import { I as IfBoundedRecord } from './if-bounded-record-Drd4UbBU.js';
+
+/**
+ * Records with an unbounded set of keys have different semantics to those with
+ * a bounded set of keys when using 'noUncheckedIndexedAccess', the former
+ * being implicitly `Partial` whereas the latter are implicitly `Required`.
+ *
+ * @example
+ *    BoundedPartial<{ a: number }>; //=> { a?: number }
+ *    BoundedPartial<Record<string, number>>; //=> Record<string, number>
+ */
+type BoundedPartial<T> = IfBoundedRecord<T, Partial<T>, T>;
+
+export type { BoundedPartial as B };

package/dist/bounded-partial-wqR8ceNQ.d.cts

@@ -0,0 +1,14 @@
+import { I as IfBoundedRecord } from './if-bounded-record-Drd4UbBU.cjs';
+
+/**
+ * Records with an unbounded set of keys have different semantics to those with
+ * a bounded set of keys when using 'noUncheckedIndexedAccess', the former
+ * being implicitly `Partial` whereas the latter are implicitly `Required`.
+ *
+ * @example
+ *    BoundedPartial<{ a: number }>; //=> { a?: number }
+ *    BoundedPartial<Record<string, number>>; //=> Record<string, number>
+ */
+type BoundedPartial<T> = IfBoundedRecord<T, Partial<T>, T>;
+
+export type { BoundedPartial as B };

package/dist/{chunk-AJQEGHF5.cjs → chunk-22AQJBPW.cjs}

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function c(...e){return _chunkXR72I63Wcjs.a.call(void 0, y,e)}function y(e,o){let r={};for(let[a,n]of e.entries()){let d=o(n,a,e);r[d]=n}return r}exports.a = c;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function c(...e){return _chunkXR72I63Wcjs.a.call(void 0, y,e)}function y(e,a){let n=new Map;for(let[d,u]of e.entries()){let r=a(u,d,e);if(r!==void 0){let t=n.get(r);t===void 0?n.set(r,1):n.set(r,t+1)}}return Object.fromEntries(n)}exports.a = c;

package/dist/chunk-2HQM73IT.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function o(...e){return _chunkXR72I63Wcjs.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 a=Math.ceil(e.length/n),u=new Array(a);if(n===1)for(let[r,t]of e.entries())u[r]=[t];else for(let r=0;r<a;r+=1){let t=r*n;u[r]=e.slice(t,t+n)}return u}exports.a = o;

package/dist/chunk-2XGSSTCA.js

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

package/dist/{chunk-6ENW2VLC.cjs → chunk-3LC3CLYE.cjs}

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkN5JE6642cjs = require('./chunk-N5JE6642.cjs');var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function u(...a){return _chunkXR72I63Wcjs.a.call(void 0, l,a,y)}function l(a,r){return a.filter(r)}function y(a){return(r,t,o)=>a(r,t,o)?{done:!1,hasNext:!0,next:r}:_chunkN5JE6642cjs.a}exports.a = u;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkN5JE6642cjs = require('./chunk-N5JE6642.cjs');var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function m(...e){return _chunkXR72I63Wcjs.a.call(void 0, o,e,i)}function o(e,n){return e.filter(n)}function i(e){return(n,a,d)=>e(n,a,d)?{done:!1,hasNext:!0,next:n}:_chunkN5JE6642cjs.a}exports.a = m;

package/dist/chunk-44LUF6RO.js

@@ -0,0 +1 @@
+import{a}from"./chunk-J6WPJH72.js";function i(...e){return a(u,e)}function u(e,d){let r=Object.create(null);for(let n=0;n<e.length;n++){let t=e[n],y=d(t,n,e);if(y!==void 0){let o=r[y];o===void 0?r[y]=[t]:o.push(t)}}return Object.setPrototypeOf(r,Object.prototype),r}export{i as a};

package/dist/{chunk-IXGOK22A.cjs → chunk-5NW4GR2Q.cjs}

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkFLQYTU5Wcjs = require('./chunk-FLQYTU5W.cjs');var _chunkEROXO3T4cjs = require('./chunk-EROXO3T4.cjs');function s(...r){return _chunkEROXO3T4cjs.b.call(void 0, p,r)}function p(r,t,e){if(e<=0)return[];if(e>=r.length)return[...r];let n=r.slice(0,e);_chunkFLQYTU5Wcjs.a.call(void 0, n,t);let i=r.slice(e);for(let u of i)_chunkFLQYTU5Wcjs.b.call(void 0, n,t,u);return n}exports.a = s;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkJHFSYEXBcjs = require('./chunk-JHFSYEXB.cjs');var _chunkEROXO3T4cjs = require('./chunk-EROXO3T4.cjs');function s(...r){return _chunkEROXO3T4cjs.b.call(void 0, p,r)}function p(r,t,e){if(e<=0)return[];if(e>=r.length)return[...r];let n=r.slice(0,e);_chunkJHFSYEXBcjs.a.call(void 0, n,t);let i=r.slice(e);for(let u of i)_chunkJHFSYEXBcjs.b.call(void 0, n,t,u);return n}exports.a = s;

package/dist/chunk-5PMGMODH.js

@@ -0,0 +1 @@
+import{a as t}from"./chunk-J6WPJH72.js";function d(...e){return t(y,e)}function y(e,a){let n={};for(let[o,r]of Object.entries(e)){let u=a(o,r,e);n[u]=r}return n}export{d as a};

package/dist/{chunk-GVYLRJPB.cjs → chunk-66JP4PUG.cjs}

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function i(...e){return _chunkXR72I63Wcjs.a.call(void 0, r,e)}function r(e,t){return e.length>=t}exports.a = i;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function i(...e){return _chunkXR72I63Wcjs.a.call(void 0, n,e)}function n(e,r){return e.length>=r}exports.a = i;

package/dist/{chunk-6XVLHSPK.js → chunk-673TXH2U.js}

@@ -1 +1 @@
-import{a as y,b as a}from"./chunk-WCPENZWH.js";import{b as o}from"./chunk-7KBK2RWQ.js";function s(...r){return o(p,r)}function p(r,t,e){if(e<=0)return[];if(e>=r.length)return[...r];let n=r.slice(0,e);y(n,t);let i=r.slice(e);for(let u of i)a(n,t,u);return n}export{s as a};
+import{a as y,b as a}from"./chunk-JI5FJX2E.js";import{b as o}from"./chunk-7KBK2RWQ.js";function s(...r){return o(p,r)}function p(r,t,e){if(e<=0)return[];if(e>=r.length)return[...r];let n=r.slice(0,e);y(n,t);let i=r.slice(e);for(let u of i)a(n,t,u);return n}export{s as a};

package/dist/chunk-6M4IYQFZ.js

@@ -0,0 +1 @@
+import{a as p}from"./chunk-J6WPJH72.js";function y(...r){return p(s,r)}function s(r,a){let e=Object.create(null);for(let t of r){let o=t?.[a];if(o!==void 0){let n=e[o];n===void 0?e[o]=[t]:n.push(t)}}return Object.setPrototypeOf(e,Object.prototype),e}export{y as a};

package/dist/chunk-B6SBIS6W.js

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

package/dist/{chunk-OL2TQDYM.cjs → chunk-BDBX4ZMW.cjs}

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _nullishCoalesce(lhs, rhsFn) { if (lhs != null) { return lhs; } else { return rhsFn(); } }var _chunkFLQYTU5Wcjs = require('./chunk-FLQYTU5W.cjs');var _chunkEROXO3T4cjs = require('./chunk-EROXO3T4.cjs');function d(...r){return _chunkEROXO3T4cjs.b.call(void 0, s,r)}function s(r,n,e){if(e>=r.length)return[];if(e<=0)return[...r];let o=r.slice(0,e);_chunkFLQYTU5Wcjs.a.call(void 0, o,n);let t=[],i=r.slice(e);for(let y of i){let m=_chunkFLQYTU5Wcjs.b.call(void 0, o,n,y);t.push(_nullishCoalesce(m, () => (y)))}return t}exports.a = d;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _nullishCoalesce(lhs, rhsFn) { if (lhs != null) { return lhs; } else { return rhsFn(); } }var _chunkJHFSYEXBcjs = require('./chunk-JHFSYEXB.cjs');var _chunkEROXO3T4cjs = require('./chunk-EROXO3T4.cjs');function d(...r){return _chunkEROXO3T4cjs.b.call(void 0, s,r)}function s(r,n,e){if(e>=r.length)return[];if(e<=0)return[...r];let o=r.slice(0,e);_chunkJHFSYEXBcjs.a.call(void 0, o,n);let t=[],i=r.slice(e);for(let y of i){let m=_chunkJHFSYEXBcjs.b.call(void 0, o,n,y);t.push(_nullishCoalesce(m, () => (y)))}return t}exports.a = d;

package/dist/chunk-BEMQAYI5.cjs

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

package/dist/chunk-CTGIT5TY.js

@@ -0,0 +1 @@
+import{a as o}from"./chunk-J6WPJH72.js";function c(...e){return o(y,e)}function y(e,a){let n=new Map;for(let[d,u]of e.entries()){let r=a(u,d,e);if(r!==void 0){let t=n.get(r);t===void 0?n.set(r,1):n.set(r,t+1)}}return Object.fromEntries(n)}export{c as a};

package/dist/chunk-FGMSPUSF.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function b(...e){return _chunkXR72I63Wcjs.a.call(void 0, l,e)}function l(e,o,i){let t={};for(let[r,n]of e.entries()){let u=o(n,r,e),d=i(n,r,e);t[u]=d}return t}exports.a = b;

package/dist/{chunk-Z46FX2Y4.js → chunk-FP3LV577.js}

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

package/dist/{chunk-22IDCBFS.js → chunk-GFXNX2W7.js}

@@ -1 +1 @@
-import{a as u,b as a}from"./chunk-WCPENZWH.js";import{b as p}from"./chunk-7KBK2RWQ.js";function d(...r){return p(s,r)}function s(r,n,e){if(e>=r.length)return[];if(e<=0)return[...r];let o=r.slice(0,e);u(o,n);let t=[],i=r.slice(e);for(let y of i){let m=a(o,n,y);t.push(m??y)}return t}export{d as a};
+import{a as u,b as a}from"./chunk-JI5FJX2E.js";import{b as p}from"./chunk-7KBK2RWQ.js";function d(...r){return p(s,r)}function s(r,n,e){if(e>=r.length)return[];if(e<=0)return[...r];let o=r.slice(0,e);u(o,n);let t=[],i=r.slice(e);for(let y of i){let m=a(o,n,y);t.push(m??y)}return t}export{d as a};

package/dist/chunk-GW4KDK3D.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function i(...e){return _chunkXR72I63Wcjs.a.call(void 0, u,e)}function u(e,d){let r=Object.create(null);for(let n=0;n<e.length;n++){let t=e[n],y=d(t,n,e);if(y!==void 0){let o=r[y];o===void 0?r[y]=[t]:o.push(t)}}return Object.setPrototypeOf(r,Object.prototype),r}exports.a = i;

package/dist/chunk-GWXILWA5.cjs

@@ -0,0 +1 @@
+"use strict";

package/dist/chunk-HSNPZS6R.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _optionalChain(ops) { let lastAccessLHS = undefined; let value = ops[0]; let i = 1; while (i < ops.length) { const op = ops[i]; const fn = ops[i + 1]; i += 2; if ((op === 'optionalAccess' || op === 'optionalCall') && value == null) { return undefined; } if (op === 'access' || op === 'optionalAccess') { lastAccessLHS = value; value = fn(value); } else if (op === 'call' || op === 'optionalCall') { value = fn((...args) => value.call(lastAccessLHS, ...args)); lastAccessLHS = undefined; } } return value; }var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function y(...r){return _chunkXR72I63Wcjs.a.call(void 0, s,r)}function s(r,a){let e=Object.create(null);for(let t of r){let o=_optionalChain([t, 'optionalAccess', _ => _[a]]);if(o!==void 0){let n=e[o];n===void 0?e[o]=[t]:n.push(t)}}return Object.setPrototypeOf(e,Object.prototype),e}exports.a = y;

package/dist/chunk-ITDJLXHO.js

@@ -0,0 +1 @@
+import{a as t}from"./chunk-J6WPJH72.js";function i(...e){return t(n,e)}function n(e,r){return e.length>=r}export{i as a};

package/dist/{chunk-QQMFHVPX.cjs → chunk-J3ZXNDMT.cjs}

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkEROXO3T4cjs = require('./chunk-EROXO3T4.cjs');var _chunkGVYLRJPBcjs = require('./chunk-GVYLRJPB.cjs');function p(...n){return _chunkEROXO3T4cjs.a.call(void 0, a,n)}function a(n,y){if(!_chunkGVYLRJPBcjs.a.call(void 0, n,2))return n[0];let[e]=n,[,...i]=n;for(let r of i)y(r,e)<0&&(e=r);return e}exports.a = p;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkEROXO3T4cjs = require('./chunk-EROXO3T4.cjs');var _chunk66JP4PUGcjs = require('./chunk-66JP4PUG.cjs');function p(...n){return _chunkEROXO3T4cjs.a.call(void 0, a,n)}function a(n,y){if(!_chunk66JP4PUGcjs.a.call(void 0, n,2))return n[0];let[e]=n,[,...i]=n;for(let r of i)y(r,e)<0&&(e=r);return e}exports.a = p;

package/dist/{chunk-FLQYTU5W.cjs → chunk-JHFSYEXB.cjs}

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkZ6OOXW67cjs = require('./chunk-Z6OOXW67.cjs');var _chunkGVYLRJPBcjs = require('./chunk-GVYLRJPB.cjs');function T(n,o){for(let r=Math.floor(n.length/2)-1;r>=0;r--)c(n,r,o)}function m(n,o,r){if(!_chunkGVYLRJPBcjs.a.call(void 0, n,1))return;let[t]=n;if(!(o(r,t)>=0))return n[0]=r,c(n,0,o),t}function c(n,o,r){let t=o;for(;t*2+1<n.length;){let i=t*2+1,e=r(n[t],n[i])<0?i:t,f=i+1;if(f<n.length&&r(n[e],n[f])<0&&(e=f),e===t)return;_chunkZ6OOXW67cjs.a.call(void 0, n,t,e),t=e}}exports.a = T; exports.b = m;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkZ6OOXW67cjs = require('./chunk-Z6OOXW67.cjs');var _chunk66JP4PUGcjs = require('./chunk-66JP4PUG.cjs');function T(n,o){for(let r=Math.floor(n.length/2)-1;r>=0;r--)c(n,r,o)}function m(n,o,r){if(!_chunk66JP4PUGcjs.a.call(void 0, n,1))return;let[t]=n;if(!(o(r,t)>=0))return n[0]=r,c(n,0,o),t}function c(n,o,r){let t=o;for(;t*2+1<n.length;){let i=t*2+1,e=r(n[t],n[i])<0?i:t,f=i+1;if(f<n.length&&r(n[e],n[f])<0&&(e=f),e===t)return;_chunkZ6OOXW67cjs.a.call(void 0, n,t,e),t=e}}exports.a = T; exports.b = m;

package/dist/{chunk-WCPENZWH.js → chunk-JI5FJX2E.js}

@@ -1 +1 @@
-import{a as d}from"./chunk-YYEJOSR3.js";import{a as u}from"./chunk-DLXKXNZT.js";function T(n,o){for(let r=Math.floor(n.length/2)-1;r>=0;r--)c(n,r,o)}function m(n,o,r){if(!u(n,1))return;let[t]=n;if(!(o(r,t)>=0))return n[0]=r,c(n,0,o),t}function c(n,o,r){let t=o;for(;t*2+1<n.length;){let i=t*2+1,e=r(n[t],n[i])<0?i:t,f=i+1;if(f<n.length&&r(n[e],n[f])<0&&(e=f),e===t)return;d(n,t,e),t=e}}export{T as a,m as b};
+import{a as d}from"./chunk-YYEJOSR3.js";import{a as u}from"./chunk-ITDJLXHO.js";function T(n,o){for(let r=Math.floor(n.length/2)-1;r>=0;r--)c(n,r,o)}function m(n,o,r){if(!u(n,1))return;let[t]=n;if(!(o(r,t)>=0))return n[0]=r,c(n,0,o),t}function c(n,o,r){let t=o;for(;t*2+1<n.length;){let i=t*2+1,e=r(n[t],n[i])<0?i:t,f=i+1;if(f<n.length&&r(n[e],n[f])<0&&(e=f),e===t)return;d(n,t,e),t=e}}export{T as a,m as b};

package/dist/chunk-K26HQR4Y.cjs

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

package/dist/chunk-KYMVIFAW.cjs

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

package/dist/{chunk-ZQXE6PIV.cjs → chunk-NVCXF5UR.cjs}

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function o(...e){return _chunkXR72I63Wcjs.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;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function o(...e){return _chunkXR72I63Wcjs.a.call(void 0, a,e)}function a(e,r){for(let n=e.length-1;n>=0;n--)if(!r(e[n],n,e))return e.slice(n+1);return[...e]}exports.a = o;

package/dist/chunk-O74TUGYF.js

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

package/dist/{chunk-MHEODCN3.cjs → chunk-OMHZCALN.cjs}

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkGVYLRJPBcjs = require('./chunk-GVYLRJPB.cjs');var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function y(...t){return _chunkXR72I63Wcjs.a.call(void 0, f,t)}function f(t,e){if(!_chunkGVYLRJPBcjs.a.call(void 0, e,1))return{...t};if(!_chunkGVYLRJPBcjs.a.call(void 0, e,2)){let{[e[0]]:r,...m}=t;return m}let o={...t};for(let r of e)delete o[r];return o}exports.a = y;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk66JP4PUGcjs = require('./chunk-66JP4PUG.cjs');var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function y(...t){return _chunkXR72I63Wcjs.a.call(void 0, f,t)}function f(t,e){if(!_chunk66JP4PUGcjs.a.call(void 0, e,1))return{...t};if(!_chunk66JP4PUGcjs.a.call(void 0, e,2)){let{[e[0]]:r,...m}=t;return m}let o={...t};for(let r of e)delete o[r];return o}exports.a = y;

package/dist/chunk-R4O7XE2F.cjs

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

package/dist/chunk-TVMG2NYC.js

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

package/dist/chunk-UWMBE6BM.js

@@ -0,0 +1 @@
+import{a as i}from"./chunk-J6WPJH72.js";function o(...e){return i(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 a=Math.ceil(e.length/n),u=new Array(a);if(n===1)for(let[r,t]of e.entries())u[r]=[t];else for(let r=0;r<a;r+=1){let t=r*n;u[r]=e.slice(t,t+n)}return u}export{o as a};

package/dist/{chunk-VBH6SKKO.js → chunk-VI2QG3FU.js}

@@ -1 +1 @@
-import{a as n}from"./chunk-DLXKXNZT.js";import{a as i}from"./chunk-J6WPJH72.js";function y(...t){return i(f,t)}function f(t,e){if(!n(e,1))return{...t};if(!n(e,2)){let{[e[0]]:r,...m}=t;return m}let o={...t};for(let r of e)delete o[r];return o}export{y as a};
+import{a as n}from"./chunk-ITDJLXHO.js";import{a as i}from"./chunk-J6WPJH72.js";function y(...t){return i(f,t)}function f(t,e){if(!n(e,1))return{...t};if(!n(e,2)){let{[e[0]]:r,...m}=t;return m}let o={...t};for(let r of e)delete o[r];return o}export{y as a};

package/dist/chunk-YCSQX2SY.js

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

package/dist/chunk-ZITGCTSW.js

@@ -0,0 +1 @@
+import{a as r}from"./chunk-EPU4K3DD.js";import{a as t}from"./chunk-J6WPJH72.js";function m(...e){return t(o,e,i)}function o(e,n){return e.filter(n)}function i(e){return(n,a,d)=>e(n,a,d)?{done:!1,hasNext:!0,next:n}:r}export{m as a};

package/dist/chunk.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkL4ITKDYBcjs = require('./chunk-L4ITKDYB.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.chunk = _chunkL4ITKDYBcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk2HQM73ITcjs = require('./chunk-2HQM73IT.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.chunk = _chunk2HQM73ITcjs.a;

package/dist/chunk.d.cts

@@ -1,9 +1,18 @@
-import { IsNumericLiteral, LessThan, IfNever, Subtract, ValueOf, IntRange } from 'type-fest';
+import { IsNumericLiteral, LessThan, IfNever, ValueOf, Subtract, IntRange } from 'type-fest';
 import { I as IntRangeInclusive } from './int-range-inclusive-Cn-qsrAN.cjs';
 import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
-import { N as NTuple } from './n-tuple-5jljrt4c.cjs';
 import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.cjs';
-import { T as TupleParts } from './tuple-parts-CP0H7BrE.cjs';
+import { P as PartialArray } from './partial-array-Vnf1fBtl.cjs';
+import { T as TupleParts } from './tuple-parts-DAqFAJP8.cjs';
+
+/**
+ * An array with *exactly* N elements in it.
+ *
+ * Only literal N values are supported. For very large N the type might result
+ * in a recurse depth error. For negative N the type would result in an infinite
+ * recursion. None of these have protections because this is an internal type!
+ */
+type NTuple<T, N extends number, Result extends Array<unknown> = []> = Result['length'] extends N ? Result : NTuple<T, N, [...Result, T]>;
 
 /**
  * This prevents typescript from failing on complex arrays and large chunks.
@@ -17,14 +26,12 @@ 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>;
+type LiteralChunk<T extends IterableContainer, N extends number> = ChunkRestElement<ChunkFixedTuple<TuplePrefix<T>, N>, TupleParts<T>['item'], TupleParts<T>['suffix'], N> | ([...TuplePrefix<T>, ...TupleParts<T>['suffix']] extends readonly [] ? [] : never);
 /**
- * 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.
+ * This type **only** works if the input array `T` is a fixed tuple. 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 [
+type ChunkFixedTuple<T, N extends number, Result = []> = T extends readonly [infer Head, ...infer Rest] ? ChunkFixedTuple<Rest, N, Result extends [
     ...infer Previous extends Array<Array<unknown>>,
     infer Current extends Array<unknown>
 ] ? Current['length'] extends N ? [
@@ -43,27 +50,27 @@ type ChunkFinite<T, N extends number, Result = []> = T extends readonly [infer H
  * 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 [
+type ChunkRestElement<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<{
+] ? ValueOf<{
     [Padding in IntRangeInclusive<0, Subtract<N, LastPrefixChunk['length']>>]: [
         ...PrefixFullChunks,
-        ...ChunkFinite<[
+        ...ChunkFixedTuple<[
             ...LastPrefixChunk,
             ...NTuple<Item, Padding>,
             ...Suffix
         ], N>
     ];
-}> : [
+}> | [
+    ...PrefixFullChunks,
+    [
+        ...LastPrefixChunk,
+        ...NTuple<Item, Subtract<N, LastPrefixChunk['length']>>
+    ],
+    ...Array<NTuple<Item, N>>,
+    ...SuffixChunk<Suffix, Item, N>
+] : [
     ...Array<NTuple<Item, N>>,
     ...SuffixChunk<Suffix, Item, N>
 ]>;
@@ -78,7 +85,7 @@ type SuffixChunk<T extends Array<unknown>, Item, N extends number> = T extends r
         [K in IntRangeInclusive<1, N>]: NTuple<Item, K>;
     }>
 ] : ValueOf<{
-    [Padding in IntRange<0, N>]: ChunkFinite<[
+    [Padding in IntRange<0, N>]: ChunkFixedTuple<[
         ...NTuple<Item, Padding>,
         ...T
     ], N>;
@@ -88,6 +95,10 @@ type SuffixChunk<T extends Array<unknown>, Item, N extends number> = T extends r
  * 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 TuplePrefix<T extends IterableContainer> = [
+    ...TupleParts<T>['required'],
+    ...PartialArray<TupleParts<T>['optional']>
+];
 /**
  * Split an array into groups the length of `size`. If `array` can't be split evenly, the final chunk will be the remaining elements.
  *

package/dist/chunk.d.ts

@@ -1,9 +1,18 @@
-import { IsNumericLiteral, LessThan, IfNever, Subtract, ValueOf, IntRange } from 'type-fest';
+import { IsNumericLiteral, LessThan, IfNever, ValueOf, Subtract, IntRange } from 'type-fest';
 import { I as IntRangeInclusive } from './int-range-inclusive-Cn-qsrAN.js';
 import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
-import { N as NTuple } from './n-tuple-5jljrt4c.js';
 import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.js';
-import { T as TupleParts } from './tuple-parts-CP0H7BrE.js';
+import { P as PartialArray } from './partial-array-Vnf1fBtl.js';
+import { T as TupleParts } from './tuple-parts-CrwnkDKX.js';
+
+/**
+ * An array with *exactly* N elements in it.
+ *
+ * Only literal N values are supported. For very large N the type might result
+ * in a recurse depth error. For negative N the type would result in an infinite
+ * recursion. None of these have protections because this is an internal type!
+ */
+type NTuple<T, N extends number, Result extends Array<unknown> = []> = Result['length'] extends N ? Result : NTuple<T, N, [...Result, T]>;
 
 /**
  * This prevents typescript from failing on complex arrays and large chunks.
@@ -17,14 +26,12 @@ 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>;
+type LiteralChunk<T extends IterableContainer, N extends number> = ChunkRestElement<ChunkFixedTuple<TuplePrefix<T>, N>, TupleParts<T>['item'], TupleParts<T>['suffix'], N> | ([...TuplePrefix<T>, ...TupleParts<T>['suffix']] extends readonly [] ? [] : never);
 /**
- * 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.
+ * This type **only** works if the input array `T` is a fixed tuple. 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 [
+type ChunkFixedTuple<T, N extends number, Result = []> = T extends readonly [infer Head, ...infer Rest] ? ChunkFixedTuple<Rest, N, Result extends [
     ...infer Previous extends Array<Array<unknown>>,
     infer Current extends Array<unknown>
 ] ? Current['length'] extends N ? [
@@ -43,27 +50,27 @@ type ChunkFinite<T, N extends number, Result = []> = T extends readonly [infer H
  * 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 [
+type ChunkRestElement<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<{
+] ? ValueOf<{
     [Padding in IntRangeInclusive<0, Subtract<N, LastPrefixChunk['length']>>]: [
         ...PrefixFullChunks,
-        ...ChunkFinite<[
+        ...ChunkFixedTuple<[
             ...LastPrefixChunk,
             ...NTuple<Item, Padding>,
             ...Suffix
         ], N>
     ];
-}> : [
+}> | [
+    ...PrefixFullChunks,
+    [
+        ...LastPrefixChunk,
+        ...NTuple<Item, Subtract<N, LastPrefixChunk['length']>>
+    ],
+    ...Array<NTuple<Item, N>>,
+    ...SuffixChunk<Suffix, Item, N>
+] : [
     ...Array<NTuple<Item, N>>,
     ...SuffixChunk<Suffix, Item, N>
 ]>;
@@ -78,7 +85,7 @@ type SuffixChunk<T extends Array<unknown>, Item, N extends number> = T extends r
         [K in IntRangeInclusive<1, N>]: NTuple<Item, K>;
     }>
 ] : ValueOf<{
-    [Padding in IntRange<0, N>]: ChunkFinite<[
+    [Padding in IntRange<0, N>]: ChunkFixedTuple<[
         ...NTuple<Item, Padding>,
         ...T
     ], N>;
@@ -88,6 +95,10 @@ type SuffixChunk<T extends Array<unknown>, Item, N extends number> = T extends r
  * 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 TuplePrefix<T extends IterableContainer> = [
+    ...TupleParts<T>['required'],
+    ...PartialArray<TupleParts<T>['optional']>
+];
 /**
  * Split an array into groups the length of `size`. If `array` can't be split evenly, the final chunk will be the remaining elements.
  *

package/dist/chunk.js

@@ -1 +1 @@
-import{a}from"./chunk-I7K3Z4BT.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as chunk};
+import{a}from"./chunk-UWMBE6BM.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as chunk};

package/dist/clamped-integer-subtract-DZ7rsJE4.d.cts

@@ -0,0 +1,15 @@
+/**
+ * We built our own version of Subtract instead of using type-fest's one
+ * because we needed a simpler implementation that isn't as prone to excessive
+ * recursion issues and that is clamped at 0 so that we don't need to handle
+ * negative values using even more utilities.
+ */
+type ClampedIntegerSubtract<Minuend, Subtrahend, SubtrahendBag extends Array<unknown> = [], ResultBag extends Array<unknown> = []> = [...SubtrahendBag, ...ResultBag]['length'] extends Minuend ? ResultBag['length'] : SubtrahendBag['length'] extends Subtrahend ? ClampedIntegerSubtract<Minuend, Subtrahend, SubtrahendBag, [
+    ...ResultBag,
+    unknown
+]> : ClampedIntegerSubtract<Minuend, Subtrahend, [
+    ...SubtrahendBag,
+    unknown
+], ResultBag>;
+
+export type { ClampedIntegerSubtract as C };

package/dist/clamped-integer-subtract-DZ7rsJE4.d.ts

@@ -0,0 +1,15 @@
+/**
+ * We built our own version of Subtract instead of using type-fest's one
+ * because we needed a simpler implementation that isn't as prone to excessive
+ * recursion issues and that is clamped at 0 so that we don't need to handle
+ * negative values using even more utilities.
+ */
+type ClampedIntegerSubtract<Minuend, Subtrahend, SubtrahendBag extends Array<unknown> = [], ResultBag extends Array<unknown> = []> = [...SubtrahendBag, ...ResultBag]['length'] extends Minuend ? ResultBag['length'] : SubtrahendBag['length'] extends Subtrahend ? ClampedIntegerSubtract<Minuend, Subtrahend, SubtrahendBag, [
+    ...ResultBag,
+    unknown
+]> : ClampedIntegerSubtract<Minuend, Subtrahend, [
+    ...SubtrahendBag,
+    unknown
+], ResultBag>;
+
+export type { ClampedIntegerSubtract as C };

package/dist/coerced-array-DRz3tqda.d.cts

@@ -0,0 +1,14 @@
+import { IfNever } from 'type-fest';
+
+/**
+ * `never[]` and `[]` are not the same type, and in some cases they aren't
+ * interchangeable.
+ *
+ * This type makes it easier to use the result of TupleParts when the input is a
+ * fixed-length tuple but we still want to spread the rest of the array. e.g.
+ * `[...CoercedArray<TupleParts<T>["item"]>, ...TupleParts<T>["suffix"]]`.
+ *
+ */
+type CoercedArray<T> = IfNever<T, [], Array<T>>;
+
+export type { CoercedArray as C };

package/dist/coerced-array-DRz3tqda.d.ts

@@ -0,0 +1,14 @@
+import { IfNever } from 'type-fest';
+
+/**
+ * `never[]` and `[]` are not the same type, and in some cases they aren't
+ * interchangeable.
+ *
+ * This type makes it easier to use the result of TupleParts when the input is a
+ * fixed-length tuple but we still want to spread the rest of the array. e.g.
+ * `[...CoercedArray<TupleParts<T>["item"]>, ...TupleParts<T>["suffix"]]`.
+ *
+ */
+type CoercedArray<T> = IfNever<T, [], Array<T>>;
+
+export type { CoercedArray as C };

package/dist/count-by.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkPIF5X7RQcjs = require('./chunk-PIF5X7RQ.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.countBy = _chunkPIF5X7RQcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk22AQJBPWcjs = require('./chunk-22AQJBPW.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.countBy = _chunk22AQJBPWcjs.a;

package/dist/count-by.d.cts

@@ -1,4 +1,4 @@
-import { E as ExactRecord } from './exact-record-_isi2JMR.cjs';
+import { B as BoundedPartial } from './bounded-partial-wqR8ceNQ.cjs';
 import './if-bounded-record-Drd4UbBU.cjs';
 import 'type-fest';
 
@@ -19,7 +19,7 @@ import 'type-fest';
  * @dataFirst
  * @category Array
  */
-declare function countBy<T, K extends PropertyKey>(data: ReadonlyArray<T>, categorizationFn: (value: T, index: number, data: ReadonlyArray<T>) => K | undefined): ExactRecord<K, number>;
+declare function countBy<T, K extends PropertyKey>(data: ReadonlyArray<T>, categorizationFn: (value: T, index: number, data: ReadonlyArray<T>) => K | undefined): BoundedPartial<Record<K, number>>;
 /**
  * Categorize and count elements in an array using a defined callback function.
  * The callback function is applied to each element in the array to determine
@@ -36,6 +36,6 @@ declare function countBy<T, K extends PropertyKey>(data: ReadonlyArray<T>, categ
  * @dataLast
  * @category Array
  */
-declare function countBy<T, K extends PropertyKey>(categorizationFn: (value: T, index: number, data: ReadonlyArray<T>) => K | undefined): (data: ReadonlyArray<T>) => ExactRecord<K, number>;
+declare function countBy<T, K extends PropertyKey>(categorizationFn: (value: T, index: number, data: ReadonlyArray<T>) => K | undefined): (data: ReadonlyArray<T>) => BoundedPartial<Record<K, number>>;
 
 export { countBy };

package/dist/count-by.d.ts

@@ -1,4 +1,4 @@
-import { E as ExactRecord } from './exact-record-Dhbe_K-E.js';
+import { B as BoundedPartial } from './bounded-partial-CJjczH6j.js';
 import './if-bounded-record-Drd4UbBU.js';
 import 'type-fest';
 
@@ -19,7 +19,7 @@ import 'type-fest';
  * @dataFirst
  * @category Array
  */
-declare function countBy<T, K extends PropertyKey>(data: ReadonlyArray<T>, categorizationFn: (value: T, index: number, data: ReadonlyArray<T>) => K | undefined): ExactRecord<K, number>;
+declare function countBy<T, K extends PropertyKey>(data: ReadonlyArray<T>, categorizationFn: (value: T, index: number, data: ReadonlyArray<T>) => K | undefined): BoundedPartial<Record<K, number>>;
 /**
  * Categorize and count elements in an array using a defined callback function.
  * The callback function is applied to each element in the array to determine
@@ -36,6 +36,6 @@ declare function countBy<T, K extends PropertyKey>(data: ReadonlyArray<T>, categ
  * @dataLast
  * @category Array
  */
-declare function countBy<T, K extends PropertyKey>(categorizationFn: (value: T, index: number, data: ReadonlyArray<T>) => K | undefined): (data: ReadonlyArray<T>) => ExactRecord<K, number>;
+declare function countBy<T, K extends PropertyKey>(categorizationFn: (value: T, index: number, data: ReadonlyArray<T>) => K | undefined): (data: ReadonlyArray<T>) => BoundedPartial<Record<K, number>>;
 
 export { countBy };

package/dist/count-by.js

@@ -1 +1 @@
-import{a}from"./chunk-BOOMUHPG.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as countBy};
+import{a}from"./chunk-CTGIT5TY.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as countBy};