@vinicunca/perkakas 1.4.0 → 1.6.0

package/dist/sort-by.d.cts

@@ -1,7 +1,7 @@
+import { O as OrderRule } from './curry-order-rules-BKXCPBNx.cjs';
 import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
 import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.cjs';
 import { R as ReorderedArray } from './reordered-array-DTkM8K3n.cjs';
-import { O as OrderRule } from './curry-order-rules-BKXCPBNx.cjs';
 
 /**
  * Sorts `data` using the provided ordering rules. The `sort` is done via the

package/dist/sort-by.d.ts

@@ -1,7 +1,7 @@
+import { O as OrderRule } from './curry-order-rules-BKXCPBNx.js';
 import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
 import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.js';
 import { R as ReorderedArray } from './reordered-array-DVguhAmZ.js';
-import { O as OrderRule } from './curry-order-rules-BKXCPBNx.js';
 
 /**
  * Sorts `data` using the provided ordering rules. The `sort` is done via the

package/dist/take-first-by.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkIXGOK22Acjs = require('./chunk-IXGOK22A.cjs');require('./chunk-FLQYTU5W.cjs');require('./chunk-Z6OOXW67.cjs');require('./chunk-EROXO3T4.cjs');require('./chunk-GVYLRJPB.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.takeFirstBy = _chunkIXGOK22Acjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk5NW4GR2Qcjs = require('./chunk-5NW4GR2Q.cjs');require('./chunk-JHFSYEXB.cjs');require('./chunk-Z6OOXW67.cjs');require('./chunk-EROXO3T4.cjs');require('./chunk-66JP4PUG.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.takeFirstBy = _chunk5NW4GR2Qcjs.a;

package/dist/take-first-by.js

@@ -1 +1 @@
-import{a}from"./chunk-6XVLHSPK.js";import"./chunk-WCPENZWH.js";import"./chunk-YYEJOSR3.js";import"./chunk-7KBK2RWQ.js";import"./chunk-DLXKXNZT.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as takeFirstBy};
+import{a}from"./chunk-673TXH2U.js";import"./chunk-JI5FJX2E.js";import"./chunk-YYEJOSR3.js";import"./chunk-7KBK2RWQ.js";import"./chunk-ITDJLXHO.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as takeFirstBy};

package/dist/take-last-while.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkZQXE6PIVcjs = require('./chunk-ZQXE6PIV.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.takeLastWhile = _chunkZQXE6PIVcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkNVCXF5URcjs = require('./chunk-NVCXF5UR.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.takeLastWhile = _chunkNVCXF5URcjs.a;

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

@@ -13,6 +13,7 @@ import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
  * @dataFirst
  * @category Array
  */
+declare function takeLastWhile<T extends IterableContainer, S extends T[number]>(data: T, predicate: (item: T[number], index: number, data: T) => item is S): Array<S>;
 declare function takeLastWhile<T extends IterableContainer>(data: T, predicate: (item: T[number], index: number, data: T) => boolean): Array<T[number]>;
 /**
  * Returns elements from the end of the array until the predicate returns false.
@@ -26,6 +27,7 @@ declare function takeLastWhile<T extends IterableContainer>(data: T, predicate:
  * @dataLast
  * @category Array
  */
+declare function takeLastWhile<T extends IterableContainer, S extends T[number]>(predicate: (item: T[number], index: number, data: T) => item is S): (array: T) => Array<S>;
 declare function takeLastWhile<T extends IterableContainer>(predicate: (item: T[number], index: number, data: T) => boolean): (data: T) => Array<T[number]>;
 
 export { takeLastWhile };

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

@@ -13,6 +13,7 @@ import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
  * @dataFirst
  * @category Array
  */
+declare function takeLastWhile<T extends IterableContainer, S extends T[number]>(data: T, predicate: (item: T[number], index: number, data: T) => item is S): Array<S>;
 declare function takeLastWhile<T extends IterableContainer>(data: T, predicate: (item: T[number], index: number, data: T) => boolean): Array<T[number]>;
 /**
  * Returns elements from the end of the array until the predicate returns false.
@@ -26,6 +27,7 @@ declare function takeLastWhile<T extends IterableContainer>(data: T, predicate:
  * @dataLast
  * @category Array
  */
+declare function takeLastWhile<T extends IterableContainer, S extends T[number]>(predicate: (item: T[number], index: number, data: T) => item is S): (array: T) => Array<S>;
 declare function takeLastWhile<T extends IterableContainer>(predicate: (item: T[number], index: number, data: T) => boolean): (data: T) => Array<T[number]>;
 
 export { takeLastWhile };

package/dist/take-last-while.js

@@ -1 +1 @@
-import{a}from"./chunk-3CFBQYOQ.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as takeLastWhile};
+import{a}from"./chunk-O74TUGYF.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as takeLastWhile};

package/dist/take-while.d.cts

@@ -12,6 +12,7 @@ import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
  * @dataFirst
  * @category Array
  */
+declare function takeWhile<T extends IterableContainer, S extends T[number]>(data: T, predicate: (item: T[number], index: number, data: T) => item is S): Array<S>;
 declare function takeWhile<T extends IterableContainer>(data: T, predicate: (item: T[number], index: number, data: T) => boolean): Array<T[number]>;
 /**
  * Returns elements from the array until predicate returns false.
@@ -24,6 +25,7 @@ declare function takeWhile<T extends IterableContainer>(data: T, predicate: (ite
  * @dataLast
  * @category Array
  */
+declare function takeWhile<T extends IterableContainer, S extends T[number]>(predicate: (item: T[number], index: number, data: T) => item is S): (array: T) => Array<S>;
 declare function takeWhile<T extends IterableContainer>(predicate: (item: T[number], index: number, data: T) => boolean): (array: T) => Array<T[number]>;
 
 export { takeWhile };

package/dist/take-while.d.ts

@@ -12,6 +12,7 @@ import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
  * @dataFirst
  * @category Array
  */
+declare function takeWhile<T extends IterableContainer, S extends T[number]>(data: T, predicate: (item: T[number], index: number, data: T) => item is S): Array<S>;
 declare function takeWhile<T extends IterableContainer>(data: T, predicate: (item: T[number], index: number, data: T) => boolean): Array<T[number]>;
 /**
  * Returns elements from the array until predicate returns false.
@@ -24,6 +25,7 @@ declare function takeWhile<T extends IterableContainer>(data: T, predicate: (ite
  * @dataLast
  * @category Array
  */
+declare function takeWhile<T extends IterableContainer, S extends T[number]>(predicate: (item: T[number], index: number, data: T) => item is S): (array: T) => Array<S>;
 declare function takeWhile<T extends IterableContainer>(predicate: (item: T[number], index: number, data: T) => boolean): (array: T) => Array<T[number]>;
 
 export { takeWhile };

package/dist/tuple-parts-CrwnkDKX.d.ts

@@ -0,0 +1,100 @@
+import { Tagged, Simplify, Or } from 'type-fest';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
+
+declare const PerkakasErrorSymbol: unique symbol;
+interface PerkakasTypeErrorOptions {
+    type?: unknown;
+    metadata?: unknown;
+}
+/**
+ * Used for reporting type errors in a more useful way than `never`.
+ */
+type PerkakasTypeError<FunctionName extends string, Message extends number | string, Options extends PerkakasTypeErrorOptions = {}> = Tagged<Options extends {
+    type: infer T;
+} ? T : typeof PerkakasErrorSymbol, `PerkakasTypeError(${FunctionName}): ${Message}.`, Options extends {
+    metadata: infer Metadata;
+} ? Metadata : never>;
+
+/**
+ * Takes a tuple and returns the types that make up its parts. These parts
+ * follow TypeScript's only supported format for arrays/tuples:
+ * [<required>, <optional>, ...<rest>[], <suffix>].
+ *
+ * There are some limitations to what shapes TypeScript supports:
+ * tuples can only have a suffix if they also have a non-never rest element,
+ * **and** tuples cannot have both an optional part and a suffix; this means
+ * there are only 10 possible shapes for tuples:
+ *   1.  Empty Tuples: `[]`.
+ *   2.  Fixed Tuples: `[string, number]`.
+ *   3.  Optional Tuples: `[string?, number?]`.
+ *   4.  Mixed Tuples: `[string, number?]`.
+ *   5.  Arrays: `Array<string>`.
+ *   6.  Fixed-Prefix Arrays: `[string, ...Array<string>]`.
+ *   7.  Optional-Prefix Arrays: `[number?, ...Array<boolean>]`.
+ *   8.  Mixed-Prefix Arrays: `[string, number?, ...Array<boolean>]`.
+ *   9.  Fixed-Suffix Arrays: `[...Array<string>, string]`.
+ *   10. Fixed-Elements Arrays: `[string, ...Array<string>, string]`.
+ *
+ * @example [
+ *   ...TupleParts<T>["required"],
+ *   ...Partial<TupleParts<T>["optional"]>,
+ *   ...CoercedArray<TupleParts<T>["item"]>,
+ *   ...TupleParts<T>["suffix"],
+ * ].
+ */
+type TupleParts<T extends IterableContainer, Prefix extends Array<unknown> = []> = T extends readonly [infer Head, ...infer Tail] ? TupleParts<Tail, [...Prefix, Head]> : Simplify<{
+    /**
+     * A fixed tuple that defines the part of the tuple where all its
+     * elements are required. This will always be the first part of the
+     * tuple and will never contain any optional or rest elements. When the
+     * array doesn't have a required part this will be an empty tuple
+     * (`[]`).
+     */
+    required: Prefix;
+} & TuplePartsWithoutRequired<T>>;
+type TuplePartsWithoutRequired<T extends IterableContainer, Suffix extends Array<unknown> = []> = T extends readonly [...infer Head, infer Tail] ? TuplePartsWithoutRequired<Head, [Tail, ...Suffix]> : (Suffix extends readonly [] ? TuplePartsWithoutFixed<T> : // When the suffix is not empty we can skip the optional part and go
+{
+    optional: [];
+} & TuplePartsRest<T>) & {
+    /**
+     * A *fixed* tuple that defines the part of a tuple **after** a non-never
+     * rest parameter. These could never be optional elements, and could
+     * never contain another rest element. When the array doesn't have a
+     * required part this will be an empty tuple (`[]`).
+     */
+    suffix: Suffix;
+};
+type TuplePartsWithoutFixed<T extends IterableContainer, Optional extends Array<unknown> = []> = T extends readonly [(infer Head)?, ...infer Tail] ? Or<T extends readonly [] ? true : false, Array<T[number]> extends Tail ? true : false> extends true ? {
+    /**
+     * A *fixed* tuple that defines the part of a tuple where all its
+     * elements are suffixed with the optional operator (`?`); but with
+     * the optional operator removed (e.g. `[string?]` would be
+     * represented as `[string]`). These elements can only follow the
+     * `required` part (which could be empty).
+     * To add optional operator back wrap the result with the built-in
+     * `Partial` type.
+     * When the array doesn't have a required part this will be an empty
+     * tuple (`[]`).
+     *
+     * @example Partial<TupleParts<T>["optional"]>
+     */
+    optional: Optional;
+} & TuplePartsRest<T> : TuplePartsWithoutFixed<Tail, [...Optional, Head | undefined]> : PerkakasTypeError<'TupleParts', 'Unexpected tuple shape', {
+    type: never;
+    metadata: T;
+}>;
+interface TuplePartsRest<T extends IterableContainer> {
+    /**
+     * The type for the rest parameter of the tuple, if any. Unlike the
+     * other parts of the tuple, this is a single type and not
+     * represented as an array/tuple. When a tuple doesn't have a rest
+     * element, this will be `never`. To convert this to a matching array
+     * type that could be spread into a new type use the `CoercedArray`
+     * type which handles the `never` case correctly.
+     *
+     * @example CoercedArray<TupleParts<T>["item"]>
+     */
+    item: T extends readonly [] ? never : T[number];
+}
+
+export type { PerkakasTypeError as P, TupleParts as T };

package/dist/tuple-parts-DAqFAJP8.d.cts

@@ -0,0 +1,100 @@
+import { Tagged, Simplify, Or } from 'type-fest';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
+
+declare const PerkakasErrorSymbol: unique symbol;
+interface PerkakasTypeErrorOptions {
+    type?: unknown;
+    metadata?: unknown;
+}
+/**
+ * Used for reporting type errors in a more useful way than `never`.
+ */
+type PerkakasTypeError<FunctionName extends string, Message extends number | string, Options extends PerkakasTypeErrorOptions = {}> = Tagged<Options extends {
+    type: infer T;
+} ? T : typeof PerkakasErrorSymbol, `PerkakasTypeError(${FunctionName}): ${Message}.`, Options extends {
+    metadata: infer Metadata;
+} ? Metadata : never>;
+
+/**
+ * Takes a tuple and returns the types that make up its parts. These parts
+ * follow TypeScript's only supported format for arrays/tuples:
+ * [<required>, <optional>, ...<rest>[], <suffix>].
+ *
+ * There are some limitations to what shapes TypeScript supports:
+ * tuples can only have a suffix if they also have a non-never rest element,
+ * **and** tuples cannot have both an optional part and a suffix; this means
+ * there are only 10 possible shapes for tuples:
+ *   1.  Empty Tuples: `[]`.
+ *   2.  Fixed Tuples: `[string, number]`.
+ *   3.  Optional Tuples: `[string?, number?]`.
+ *   4.  Mixed Tuples: `[string, number?]`.
+ *   5.  Arrays: `Array<string>`.
+ *   6.  Fixed-Prefix Arrays: `[string, ...Array<string>]`.
+ *   7.  Optional-Prefix Arrays: `[number?, ...Array<boolean>]`.
+ *   8.  Mixed-Prefix Arrays: `[string, number?, ...Array<boolean>]`.
+ *   9.  Fixed-Suffix Arrays: `[...Array<string>, string]`.
+ *   10. Fixed-Elements Arrays: `[string, ...Array<string>, string]`.
+ *
+ * @example [
+ *   ...TupleParts<T>["required"],
+ *   ...Partial<TupleParts<T>["optional"]>,
+ *   ...CoercedArray<TupleParts<T>["item"]>,
+ *   ...TupleParts<T>["suffix"],
+ * ].
+ */
+type TupleParts<T extends IterableContainer, Prefix extends Array<unknown> = []> = T extends readonly [infer Head, ...infer Tail] ? TupleParts<Tail, [...Prefix, Head]> : Simplify<{
+    /**
+     * A fixed tuple that defines the part of the tuple where all its
+     * elements are required. This will always be the first part of the
+     * tuple and will never contain any optional or rest elements. When the
+     * array doesn't have a required part this will be an empty tuple
+     * (`[]`).
+     */
+    required: Prefix;
+} & TuplePartsWithoutRequired<T>>;
+type TuplePartsWithoutRequired<T extends IterableContainer, Suffix extends Array<unknown> = []> = T extends readonly [...infer Head, infer Tail] ? TuplePartsWithoutRequired<Head, [Tail, ...Suffix]> : (Suffix extends readonly [] ? TuplePartsWithoutFixed<T> : // When the suffix is not empty we can skip the optional part and go
+{
+    optional: [];
+} & TuplePartsRest<T>) & {
+    /**
+     * A *fixed* tuple that defines the part of a tuple **after** a non-never
+     * rest parameter. These could never be optional elements, and could
+     * never contain another rest element. When the array doesn't have a
+     * required part this will be an empty tuple (`[]`).
+     */
+    suffix: Suffix;
+};
+type TuplePartsWithoutFixed<T extends IterableContainer, Optional extends Array<unknown> = []> = T extends readonly [(infer Head)?, ...infer Tail] ? Or<T extends readonly [] ? true : false, Array<T[number]> extends Tail ? true : false> extends true ? {
+    /**
+     * A *fixed* tuple that defines the part of a tuple where all its
+     * elements are suffixed with the optional operator (`?`); but with
+     * the optional operator removed (e.g. `[string?]` would be
+     * represented as `[string]`). These elements can only follow the
+     * `required` part (which could be empty).
+     * To add optional operator back wrap the result with the built-in
+     * `Partial` type.
+     * When the array doesn't have a required part this will be an empty
+     * tuple (`[]`).
+     *
+     * @example Partial<TupleParts<T>["optional"]>
+     */
+    optional: Optional;
+} & TuplePartsRest<T> : TuplePartsWithoutFixed<Tail, [...Optional, Head | undefined]> : PerkakasTypeError<'TupleParts', 'Unexpected tuple shape', {
+    type: never;
+    metadata: T;
+}>;
+interface TuplePartsRest<T extends IterableContainer> {
+    /**
+     * The type for the rest parameter of the tuple, if any. Unlike the
+     * other parts of the tuple, this is a single type and not
+     * represented as an array/tuple. When a tuple doesn't have a rest
+     * element, this will be `never`. To convert this to a matching array
+     * type that could be spread into a new type use the `CoercedArray`
+     * type which handles the `never` case correctly.
+     *
+     * @example CoercedArray<TupleParts<T>["item"]>
+     */
+    item: T extends readonly [] ? never : T[number];
+}
+
+export type { PerkakasTypeError as P, TupleParts as T };

package/dist/type.helpers.cjs

@@ -0,0 +1 @@
+"use strict";require('./chunk-GWXILWA5.cjs');

package/dist/type.helpers.d.cts

@@ -0,0 +1,10 @@
+interface TightMap<O = any> {
+    [key: string]: TightMap | O;
+}
+type DeepPartial<T, O = any> = {
+    [P in keyof T]?: T[P] extends Array<string> ? string : T[P] extends object ? DeepPartial<T[P], O> : T[P];
+} & {
+    [key: string]: O | TightMap<O>;
+};
+
+export type { DeepPartial };

package/dist/type.helpers.d.ts

@@ -0,0 +1,10 @@
+interface TightMap<O = any> {
+    [key: string]: TightMap | O;
+}
+type DeepPartial<T, O = any> = {
+    [P in keyof T]?: T[P] extends Array<string> ? string : T[P] extends object ? DeepPartial<T[P], O> : T[P];
+} & {
+    [key: string]: O | TightMap<O>;
+};
+
+export type { DeepPartial };

package/dist/type.helpers.js

@@ -0,0 +1 @@
+import"./chunk-QFJ3I53F.js";

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@vinicunca/perkakas",
   "type": "module",
-  "version": "1.4.0",
+  "version": "1.6.0",
   "description": "Utility for JavaScript and Typescript.",
   "author": "praburangki<https://github.com/praburangki>",
   "license": "MIT",

package/dist/chunk-2MU3SHCO.js

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

package/dist/chunk-3CFBQYOQ.js

@@ -1 +0,0 @@
-import{a as r}from"./chunk-J6WPJH72.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-5VXKW6SI.cjs

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

package/dist/chunk-APUBIDDU.cjs

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

package/dist/chunk-B5QDOWVQ.cjs

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

package/dist/chunk-B7RHAPUE.js

@@ -1 +0,0 @@
-import{a as t}from"./chunk-J6WPJH72.js";function c(...e){return t(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}export{c as a};

package/dist/chunk-BOOMUHPG.js

@@ -1 +0,0 @@
-import{a as o}from"./chunk-J6WPJH72.js";function i(...e){return o(u,e)}function u(e,a){let n=new Map;for(let[d,y]of e.entries()){let r=a(y,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{i as a};

package/dist/chunk-DLXKXNZT.js

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

package/dist/chunk-I7K3Z4BT.js

@@ -1 +0,0 @@
-import{a}from"./chunk-J6WPJH72.js";function l(...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{l as a};

package/dist/chunk-IJ4I5A3K.js

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

package/dist/chunk-L4ITKDYB.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function l(...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 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 = l;

package/dist/chunk-OEJ5J23C.js

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

package/dist/chunk-PIF5X7RQ.cjs

@@ -1 +0,0 @@
-"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,a){let n=new Map;for(let[d,y]of e.entries()){let r=a(y,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 = i;

package/dist/chunk-PWHX2554.js

@@ -1 +0,0 @@
-import{a as n}from"./chunk-EPU4K3DD.js";import{a as e}from"./chunk-J6WPJH72.js";function u(...a){return e(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}:n}export{u as a};

package/dist/chunk-THE6MSJO.cjs

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

package/dist/chunk-UUYCL4G2.js

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

package/dist/chunk-XLGD5ZUY.cjs

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

package/dist/chunk-YCM6N46T.js

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

package/dist/exact-record-Dhbe_K-E.d.ts

@@ -1,5 +0,0 @@
-import { I as IfBoundedRecord } from './if-bounded-record-Drd4UbBU.js';
-
-type ExactRecord<Key extends PropertyKey, Value> = IfBoundedRecord<Record<Key, Value>, Partial<Record<Key, Value>>, Record<Key, Value>>;
-
-export type { ExactRecord as E };

package/dist/exact-record-_isi2JMR.d.cts

@@ -1,5 +0,0 @@
-import { I as IfBoundedRecord } from './if-bounded-record-Drd4UbBU.cjs';
-
-type ExactRecord<Key extends PropertyKey, Value> = IfBoundedRecord<Record<Key, Value>, Partial<Record<Key, Value>>, Record<Key, Value>>;
-
-export type { ExactRecord as E };

package/dist/n-tuple-5jljrt4c.d.cts

@@ -1,10 +0,0 @@
-/**
- * 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]>;
-
-export type { NTuple as N };

package/dist/n-tuple-5jljrt4c.d.ts

@@ -1,10 +0,0 @@
-/**
- * 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]>;
-
-export type { NTuple as N };

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

@@ -1 +0,0 @@
-"use strict";var _chunkZQXE6PIVcjs = require('./chunk-ZQXE6PIV.cjs');var _chunkWLNQOMKLcjs = require('./chunk-WLNQOMKL.cjs');var _chunkBO34ARLYcjs = require('./chunk-BO34ARLY.cjs');require('./chunk-N5JE6642.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');describe("data-first",()=>{test("empty array",()=>{let e=_chunkZQXE6PIVcjs.a.call(void 0, [],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("regular array",()=>{let e=_chunkZQXE6PIVcjs.a.call(void 0, [],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("regular array with union type",()=>{let e=_chunkZQXE6PIVcjs.a.call(void 0, [],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("prefix array",()=>{let e=_chunkZQXE6PIVcjs.a.call(void 0, [1],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("suffix array",()=>{let e=_chunkZQXE6PIVcjs.a.call(void 0, [1],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let e=_chunkZQXE6PIVcjs.a.call(void 0, [1,"a"],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=_chunkZQXE6PIVcjs.a.call(void 0, [1,"a",!0],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("union of arrays",()=>{let e=_chunkZQXE6PIVcjs.a.call(void 0, [],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()})});describe("data-last",()=>{test("empty array",()=>{let e=_chunkBO34ARLYcjs.a.call(void 0, [],_chunkZQXE6PIVcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("regular array",()=>{let e=_chunkBO34ARLYcjs.a.call(void 0, [],_chunkZQXE6PIVcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("regular array with union type",()=>{let e=_chunkBO34ARLYcjs.a.call(void 0, [],_chunkZQXE6PIVcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("prefix array",()=>{let e=_chunkBO34ARLYcjs.a.call(void 0, [1],_chunkZQXE6PIVcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("suffix array",()=>{let e=_chunkBO34ARLYcjs.a.call(void 0, [1],_chunkZQXE6PIVcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let e=_chunkBO34ARLYcjs.a.call(void 0, [1,"a"],_chunkZQXE6PIVcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=_chunkBO34ARLYcjs.a.call(void 0, [1,"a",!0],_chunkZQXE6PIVcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("union of arrays",()=>{let e=_chunkBO34ARLYcjs.a.call(void 0, [],_chunkZQXE6PIVcjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),describe("predicate is typed correctly",()=>{test("empty array",()=>{_chunkBO34ARLYcjs.a.call(void 0, [],_chunkZQXE6PIVcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("regular array",()=>{_chunkBO34ARLYcjs.a.call(void 0, [],_chunkZQXE6PIVcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("regular array with union type",()=>{_chunkBO34ARLYcjs.a.call(void 0, [],_chunkZQXE6PIVcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("prefix array",()=>{_chunkBO34ARLYcjs.a.call(void 0, [1],_chunkZQXE6PIVcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("suffix array",()=>{_chunkBO34ARLYcjs.a.call(void 0, [1],_chunkZQXE6PIVcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("array with suffix and prefix",()=>{_chunkBO34ARLYcjs.a.call(void 0, [1,"a"],_chunkZQXE6PIVcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("tuple",()=>{_chunkBO34ARLYcjs.a.call(void 0, [1,"a",!0],_chunkZQXE6PIVcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("union of arrays",()=>{_chunkBO34ARLYcjs.a.call(void 0, [],_chunkZQXE6PIVcjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))})})});

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

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

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

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

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

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

package/dist/tuple-parts-CP0H7BrE.d.cts

@@ -1,37 +0,0 @@
-import { IsEqual } from 'type-fest';
-
-/**
- * Takes an array and returns the types that make up its parts. The prefix is
- * anything before the rest parameter (if any), split between it's required
- * part, and it's optional part. The suffix is anything after the rest
- * parameter (if any), and the item is the type of the rest parameter.
- *
- * NOTE: The prefix is split into 2 tuples where all items are non-optional so
- * that types that rely on the presence of a specific element can be built more
- * accurately.
- *
- * TODO: Some existing types use the `prefix` accessor which doesn't handle the optional part correctly. We need to fix each of those types before we can remove it.
- *
- * The output could be used to reconstruct the input: `[
- *   ...TupleParts<T>["required"],
- *   ...Partial<TupleParts<T>["optional"]>,
- *   ...CoercedArray<TupleParts<T>["item"]>,
- *   ...TupleParts<T>["suffix"],
- * ]`.
- */
-type TupleParts<T, PrefixRequired extends Array<unknown> = [], PrefixOptionals extends Array<unknown> = [], Suffix extends Array<unknown> = []> = T extends readonly [infer Head, ...infer Tail] ? TupleParts<Tail, [...PrefixRequired, Head], PrefixOptionals, Suffix> : T extends readonly [...infer Head, infer Tail] ? TupleParts<Head, PrefixRequired, PrefixOptionals, [Tail, ...Suffix]> : IsTupleRestOnly<T> extends true ? T extends ReadonlyArray<infer Item> ? {
-    prefix: [...PrefixRequired, ...Partial<PrefixOptionals>];
-    required: PrefixRequired;
-    optional: PrefixOptionals;
-    item: Item;
-    suffix: Suffix;
-} : never : T extends readonly [(infer OptionalHead)?, ...infer Tail] ? TupleParts<Tail, PrefixRequired, [
-    ...PrefixOptionals,
-    OptionalHead
-], Suffix> : never;
-/**
- * Helper type for `TupleParts`. Checks if T = ReadonlyArray<U> for some U.
- */
-type IsTupleRestOnly<T> = T extends readonly [] ? true : T extends readonly [unknown?, ...infer Tail] ? IsEqual<Readonly<T>, Readonly<Tail>> : false;
-
-export type { TupleParts as T };

package/dist/tuple-parts-CP0H7BrE.d.ts

@@ -1,37 +0,0 @@
-import { IsEqual } from 'type-fest';
-
-/**
- * Takes an array and returns the types that make up its parts. The prefix is
- * anything before the rest parameter (if any), split between it's required
- * part, and it's optional part. The suffix is anything after the rest
- * parameter (if any), and the item is the type of the rest parameter.
- *
- * NOTE: The prefix is split into 2 tuples where all items are non-optional so
- * that types that rely on the presence of a specific element can be built more
- * accurately.
- *
- * TODO: Some existing types use the `prefix` accessor which doesn't handle the optional part correctly. We need to fix each of those types before we can remove it.
- *
- * The output could be used to reconstruct the input: `[
- *   ...TupleParts<T>["required"],
- *   ...Partial<TupleParts<T>["optional"]>,
- *   ...CoercedArray<TupleParts<T>["item"]>,
- *   ...TupleParts<T>["suffix"],
- * ]`.
- */
-type TupleParts<T, PrefixRequired extends Array<unknown> = [], PrefixOptionals extends Array<unknown> = [], Suffix extends Array<unknown> = []> = T extends readonly [infer Head, ...infer Tail] ? TupleParts<Tail, [...PrefixRequired, Head], PrefixOptionals, Suffix> : T extends readonly [...infer Head, infer Tail] ? TupleParts<Head, PrefixRequired, PrefixOptionals, [Tail, ...Suffix]> : IsTupleRestOnly<T> extends true ? T extends ReadonlyArray<infer Item> ? {
-    prefix: [...PrefixRequired, ...Partial<PrefixOptionals>];
-    required: PrefixRequired;
-    optional: PrefixOptionals;
-    item: Item;
-    suffix: Suffix;
-} : never : T extends readonly [(infer OptionalHead)?, ...infer Tail] ? TupleParts<Tail, PrefixRequired, [
-    ...PrefixOptionals,
-    OptionalHead
-], Suffix> : never;
-/**
- * Helper type for `TupleParts`. Checks if T = ReadonlyArray<U> for some U.
- */
-type IsTupleRestOnly<T> = T extends readonly [] ? true : T extends readonly [unknown?, ...infer Tail] ? IsEqual<Readonly<T>, Readonly<Tail>> : false;
-
-export type { TupleParts as T };