@vinicunca/perkakas 1.5.0 → 1.7.0

package/dist/{chunk-EDZFEURO.js → chunk-Z5YZYBC2.js}

@@ -1 +1 @@
-import{a as t}from"./chunk-5SAUYUEK.js";import{a as e}from"./chunk-J6WPJH72.js";function s(...n){return e(r,n,t(a))}function r([n]){return n}function a(){return o}function o(n){return{hasNext:!0,next:n,done:!0}}export{s as a};
+import{a as t}from"./chunk-NHTBBY2L.js";import{a as e}from"./chunk-J6WPJH72.js";function s(...n){return e(r,n,t(a))}function r([n]){return n}function a(){return o}function o(n){return{hasNext:!0,next:n,done:!0}}export{s as a};

package/dist/chunk-Z7D7Q6U3.js

@@ -0,0 +1 @@
+import{a as t}from"./chunk-J6WPJH72.js";function i(...e){return t(s,e)}function s(e,o){let r={};for(let n of o)n in e&&(r[n]=e[n]);return r}export{i 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-ZMG3NQDL.js

@@ -0,0 +1 @@
+var d=/^(?:0|[1-9]\d*)$/u;function s(i){let t=[],a=/\.{0,4096}(?<propName>[^.[\]]+)|\['(?<quoted>.{0,4096}?)'\]|\["(?<doubleQuoted>.{0,4096}?)"\]|\[(?<unquoted>.{0,4096}?)\]/uy,n;for(;(n=a.exec(i))!==null;){let{propName:e,quoted:o,doubleQuoted:u,unquoted:r}=n.groups;if(r!==void 0){t.push(...s(r));continue}t.push(e===void 0?o??u:d.test(e)?Number(e):e)}return t}export{s 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');require('./chunk-MBGSSEZN.cjs');exports.chunk = _chunk2HQM73ITcjs.a;

package/dist/chunk.d.cts

@@ -1,9 +1,19 @@
-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-v6av7LMU.cjs';
+import './perkakas-type-error-8wPb8T2y.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.
@@ -14,71 +24,53 @@ import { T as TupleParts } from './tuple-parts-CP0H7BrE.cjs';
  * 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>;
+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 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 ? [
-    ...Previous,
-    Current,
-    [Head]
-] : [
-    ...Previous,
-    [...Current, Head]
-] : [
-    [Head]
-]> : Result;
+] ? 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 [
+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>]>;
 /**
  * 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<[
+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>]: ChunkFixedTuple<[
         ...NTuple<Item, Padding>,
         ...T
     ], N>;
@@ -88,6 +80,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,19 @@
-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-BTivqbtT.js';
+import './perkakas-type-error-8wPb8T2y.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.
@@ -14,71 +24,53 @@ import { T as TupleParts } from './tuple-parts-CP0H7BrE.js';
  * 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>;
+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 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 ? [
-    ...Previous,
-    Current,
-    [Head]
-] : [
-    ...Previous,
-    [...Current, Head]
-] : [
-    [Head]
-]> : Result;
+] ? 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 [
+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>]>;
 /**
  * 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<[
+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>]: ChunkFixedTuple<[
         ...NTuple<Item, Padding>,
         ...T
     ], N>;
@@ -88,6 +80,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";import"./chunk-EK7ODJWE.js";export{a as chunk};

package/dist/clamp.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkRXUYF4A4cjs = require('./chunk-RXUYF4A4.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.clamp = _chunkRXUYF4A4cjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkRXUYF4A4cjs = require('./chunk-RXUYF4A4.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.clamp = _chunkRXUYF4A4cjs.a;

package/dist/clamp.js

@@ -1 +1 @@
-import{a}from"./chunk-CR5H624Z.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as clamp};
+import{a}from"./chunk-CR5H624Z.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as clamp};

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/clone.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkGFQXVPLPcjs = require('./chunk-GFQXVPLP.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.clone = _chunkGFQXVPLPcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkQGF2XNZScjs = require('./chunk-QGF2XNZS.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.clone = _chunkQGF2XNZScjs.a;

package/dist/clone.js

@@ -1 +1 @@
-import{a}from"./chunk-ICYGL2YZ.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as clone};
+import{a}from"./chunk-JYWIRZ2Z.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as clone};

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/concat.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkYJDSLML5cjs = require('./chunk-YJDSLML5.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.concat = _chunkYJDSLML5cjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkYJDSLML5cjs = require('./chunk-YJDSLML5.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.concat = _chunkYJDSLML5cjs.a;

package/dist/concat.js

@@ -1 +1 @@
-import{a}from"./chunk-32JKKR4M.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as concat};
+import{a}from"./chunk-32JKKR4M.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as concat};

package/dist/conditional.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkWYM2JV5Tcjs = require('./chunk-WYM2JV5T.cjs');exports.conditional = _chunkWYM2JV5Tcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk4BTTPOEUcjs = require('./chunk-4BTTPOEU.cjs');require('./chunk-MBGSSEZN.cjs');exports.conditional = _chunk4BTTPOEUcjs.a;