type-plus 5.6.0 → 6.0.0

package/README.md

@@ -32,12 +32,12 @@ yarn add type-plus
 
 Type assertion is one of the main features of `type-plus`.
 
-There are 5 kinds of type assertions:
+Type assertions can be `immediate` compile time check, or they can have `runtime` behavior.
 
-- `runtime`: validates during runtime.
-- `immediate`: validates at compile time.
-- `type guard`: [User-defined type guard functions](https://www.typescriptlang.org/docs/handbook/advanced-types.html#user-defined-type-guards) (`if (isBool(s))`) introduced in TypeScript 1.6.
-- `assertion function`: [assertion functions](https://www.typescriptlang.org/docs/handbook/release-notes/typescript-3-7.html#assertion-functions) (`assertIsBool(a)`) introduced in TypeScript 3.7.
+There are 4 kinds of type assertions:
+
+- `type guard`: [User-defined type guard functions][type_guard] (`if (isBool(s))`) introduced in TypeScript 1.6.
+- `assertion function`: [assertion functions][assertion_function] (`assertIsBool(a)`) introduced in TypeScript 3.7.
 - `logical`: functions or generic types that returns `true` or `false` type to be used in type level programming.
 - `filter`: generic type that returns `never` if the test fails.
 
@@ -211,6 +211,18 @@ when doing type-level only equality comparison as you don't have to import `Equa
 These overloads of `isType` allow you to specify a `validator`.
 With these overloads, `subject` can be `unknown` or `any`.
 
+[`isType.never<S>()`](ts/predicates/isType.ts#L25):
+
+✔️ `immediate`
+
+Check is the type `never`.
+
+[`isType.never(s)`](ts/predicates/isType.ts#L29):
+
+✔️ `immediate`
+
+Check is the value is type `never`.
+
 `Equal<A, B>`:
 `IsEqual<A, B>`:
 
@@ -303,8 +315,9 @@ type No = IsAny<1, 'yes', 'no'> // 'no'
 
 ### Array Utilities
 
+- [`At<A, N>`](ts/array_plus/array.ts#L19): gets the element type at index `N` in the array `A`.
 - `CommonPropKeys<A>`: gets common keys inside the records in the array `A` (deprecate `CommonKeys`).
-- `Concat<A, B>`: `[...A, ...B]`.
+- [`Concat<A, B>`](ts/array_plus/array.ts#L38): `[...A, ...B]`.
 - `CreateTuple<L, T>`: Creates `Tuple<T>` with `L` number of elements.
 - `drop(array, value)`: drop a particular value from an array.
 - `DropFirst<A>`: drops the first value type of `A`.
@@ -440,6 +453,14 @@ e.g.:
 There is a problem with generic distribution: <https://github.com/microsoft/TypeScript/issues/41053>
 So you may encounter some weird behavior if your logic is complex.
 
+### Number
+
+- [`Numeric`](ts/number_plus/number.ts#L4): either number or bigint (origin: [type-feat]).
+- [`Zero`](ts/number_plus/number.ts#L9): `0` in number or bigint (origin: [type-feat]).
+- [`Integer<N, Then = N, Else = never>`](ts/number_plus/number.ts#L24): is integer (origin: [type-feat]).
+- [`Negative<N, Then = N, Else = never>`](ts/number_plus/number.ts#39): is negative (origin: [type-feat]).
+- [`NonNegative<N, Then = N, Else = never>`](ts/number_plus/number.ts#58): is non-negative (origin: [type-feat])
+
 ### Math
 
 - `Abs<N, Fail=never>`: `Abs(N)`, `Abs<number>` returns `Fail`.
@@ -588,13 +609,17 @@ Whenever possible, I add attribution to the person who created those **codes** i
 
 ## Similar projects
 
-- [`ts-essentials`](https://github.com/krzkaczor/ts-essentials), all essential TypeScript types in one place.
-- [`ts-toolbelt`](https://github.com/millsp/ts-toolbelt), a more mature type lib.
-- [`type-fest`](https://github.com/sindresorhus/type-fest), a collection of essential TypeScript types.
-- [`type-zoo`](https://github.com/pelotom/type-zoo), a modest type lib usable today.
-- [`typepark`](https://github.com/kgtkr/typepark), a new type collection offering tuple manipulation and `Pipe`.
-- [`typelevel-ts`](https://github.com/gcanti/typelevel-ts), a type lib by [@gcanti](https://github.com/gcanti), author of several FP libraries in TS.
-- [`typical`](https://github.com/KiaraGrouwstra/typical), a playground of type-level operations for TypeScript.
+- [expect-type]: Compile-time tests for types
+- [spec.ts]: write tests for your types!
+- [ts-essentials]: all essential TypeScript types in one place.
+- [ts-expect]: Checks values in TypeScript match expectations.
+- [ts-toolbelt]: TypeScript's largest utility library.
+- [type-fest]: a collection of essential TypeScript types.
+- [type-zoo]: a modest type lib usable today.
+- [typepark]: a new type collection offering tuple manipulation and `Pipe`.
+- [typelevel-ts]: a type lib by [@gcanti], author of several FP libraries in TS.
+- [typical]: a playground of type-level operations for TypeScript.
+- [utility-types]: collection of utility types, complementing TypeScript build-in mapped types ans aliases.
 
 ## Contribute
 
@@ -613,18 +638,27 @@ git push
 # create PR
 ```
 
+[@gcanti]: https://github.com/gcanti
 [codecov-image]: https://codecov.io/gh/unional/type-plus/branch/master/graph/badge.svg
 [codecov-url]: https://codecov.io/gh/unional/type-plus
 [downloads-image]: https://img.shields.io/npm/dm/type-plus.svg?style=flat
 [downloads-url]: https://npmjs.org/package/type-plus
+[expect-type]: https://github.com/mmkal/expect-type
 [github-action-url]: https://github.com/unional/type-plus/actions
 [github-nodejs]: https://github.com/unional/type-plus/workflows/nodejs/badge.svg
 [npm-image]: https://img.shields.io/npm/v/type-plus.svg?style=flat
 [npm-url]: https://npmjs.org/package/type-plus
 [semantic-release-image]: https://img.shields.io/badge/%20%20%F0%9F%93%A6%F0%9F%9A%80-semantic--release-e10079.svg
 [semantic-release-url]: https://github.com/semantic-release/semantic-release
+[ts-expect]: https://github.com/TypeStrong/ts-expect
+[type-feat]: https://github.com/sindresorhus/type-fest
+[type_guard]: https://www.typescriptlang.org/docs/handbook/2/narrowing.html#using-type-predicates
+[typelevel-ts]: https://github.com/gcanti/typelevel-ts
 [TypeScript]: https://www.typescriptlang.org
+[typical]: https://github.com/KiaraGrouwstra/typical
+[utility-types]: https://github.com/piotrwitek/utility-types
 [vscode-image]: https://img.shields.io/badge/vscode-ready-green.svg
 [vscode-url]: https://code.visualstudio.com/
 [wallaby-image]: https://img.shields.io/badge/wallaby.js-configured-green.svg
 [wallaby-url]: https://wallabyjs.com
+[assertion_function]: https://www.typescriptlang.org/docs/handbook/release-notes/typescript-3-7.html#assertion-functions

package/cjs/JSONTypes.js

@@ -1,27 +1,14 @@
 "use strict";
-var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
-    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
-        if (ar || !(i in from)) {
-            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
-            ar[i] = from[i];
-        }
-    }
-    return to.concat(ar || Array.prototype.slice.call(from));
-};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.JSONTypes = void 0;
-exports.JSONTypes = { get: get };
-function get(obj) {
-    var props = [];
-    for (var _i = 1; _i < arguments.length; _i++) {
-        props[_i - 1] = arguments[_i];
-    }
+exports.JSONTypes = { get };
+function get(obj, ...props) {
     if (props.length === 0)
         return obj;
     if (typeof obj !== 'object' || obj === null)
         return undefined;
-    var p = props.shift();
+    const p = props.shift();
     // @ts-ignore
-    return get.apply(void 0, __spreadArray([obj[p]], props, false));
+    return get(obj[p], ...props);
 }
 //# sourceMappingURL=JSONTypes.js.map

package/cjs/JSONTypes.js.map

@@ -1 +1 @@
-{"version":3,"file":"JSONTypes.js","sourceRoot":"","sources":["../ts/JSONTypes.ts"],"names":[],"mappings":";;;;;;;;;;;;AAQa,QAAA,SAAS,GAAG,EAAE,GAAG,KAAA,EAAE,CAAA;AAEhC,SAAS,GAAG,CAAsB,GAAc;IAAE,eAAgC;SAAhC,UAAgC,EAAhC,qBAAgC,EAAhC,IAAgC;QAAhC,8BAAgC;;IAChF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAQ,CAAA;IACvC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,SAAS,CAAA;IAC7D,IAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;IACxB,aAAa;IACb,OAAO,GAAG,8BAAC,GAAG,CAAC,CAAC,CAAC,GAAK,KAAK,SAAM,CAAA;AACnC,CAAC"}
+{"version":3,"file":"JSONTypes.js","sourceRoot":"","sources":["../ts/JSONTypes.ts"],"names":[],"mappings":";;;AAQa,QAAA,SAAS,GAAG,EAAE,GAAG,EAAE,CAAA;AAEhC,SAAS,GAAG,CAAsB,GAAc,EAAE,GAAG,KAA6B;IACjF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAQ,CAAA;IACvC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,SAAS,CAAA;IAC7D,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;IACxB,aAAa;IACb,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAM,CAAA;AAClC,CAAC"}

package/cjs/PrimitiveTypes.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PrimitiveTypes.d.ts","sourceRoot":"","sources":["../ts/PrimitiveTypes.ts"],"names":[],"mappings":"AAGA,MAAM,MAAM,cAAc,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,GAAG,SAAS,GAAG,IAAI,CAAA;AAE/G,MAAM,MAAM,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,EAAE,IAAI,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,IAAI,CAAA"}
+{"version":3,"file":"PrimitiveTypes.d.ts","sourceRoot":"","sources":["../ts/PrimitiveTypes.ts"],"names":[],"mappings":"AAGA,MAAM,MAAM,cAAc,GACvB,OAAO,GACP,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,QAAQ,GACR,SAAS,GACT,IAAI,CAAA;AAEP,MAAM,MAAM,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,EAAE,IAAI,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,IAAI,CAAA"}

package/cjs/UnionToIntersection.d.ts

@@ -1,3 +1,3 @@
-export type UnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends ((k: infer I) => void) ? I : never;
+export type UnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends (k: infer I) => void ? I : never;
 export declare function toIntersection<U>(union: U): UnionToIntersection<U>;
 //# sourceMappingURL=UnionToIntersection.d.ts.map

package/cjs/UnionToIntersection.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"UnionToIntersection.d.ts","sourceRoot":"","sources":["../ts/UnionToIntersection.ts"],"names":[],"mappings":"AAEA,MAAM,MAAM,mBAAmB,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;AAExH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAElE"}
+{"version":3,"file":"UnionToIntersection.d.ts","sourceRoot":"","sources":["../ts/UnionToIntersection.ts"],"names":[],"mappings":"AAEA,MAAM,MAAM,mBAAmB,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,IAAI,GACvG,CAAC,GACD,KAAK,CAAA;AAER,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAElE"}

package/cjs/UnionToIntersection.js.map

@@ -1 +1 @@
-{"version":3,"file":"UnionToIntersection.js","sourceRoot":"","sources":["../ts/UnionToIntersection.ts"],"names":[],"mappings":";;;AAIA,SAAgB,cAAc,CAAI,KAAQ;IACxC,OAAO,KAAsC,CAAA;AAC/C,CAAC;AAFD,wCAEC"}
+{"version":3,"file":"UnionToIntersection.js","sourceRoot":"","sources":["../ts/UnionToIntersection.ts"],"names":[],"mappings":";;;AAMA,SAAgB,cAAc,CAAI,KAAQ;IACzC,OAAO,KAAsC,CAAA;AAC9C,CAAC;AAFD,wCAEC"}

package/cjs/array_plus/_plus.d.ts

@@ -0,0 +1,2 @@
+export type * from './array.js';
+//# sourceMappingURL=_plus.d.ts.map

package/cjs/array_plus/_plus.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_plus.d.ts","sourceRoot":"","sources":["../../ts/array_plus/_plus.ts"],"names":[],"mappings":"AAAA,mBAAmB,YAAY,CAAA"}

package/cjs/array_plus/_plus.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=_plus.js.map

package/cjs/array_plus/_plus.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_plus.js","sourceRoot":"","sources":["../../ts/array_plus/_plus.ts"],"names":[],"mappings":""}

package/cjs/array_plus/array.d.ts

@@ -0,0 +1,31 @@
+import type { Abs } from '../math/Abs.js';
+import type { GreaterThan } from '../math/GreaterThan.js';
+import type { Subtract } from '../math/Subtract.js';
+import type { Negative } from '../number_plus/number.js';
+/**
+ * Gets the type of the array or tuple at index `N`.
+ *
+ * Like `Array.at()`, this type supports negative numbers.
+ *
+ * @alias ArrayPlus.At
+ *
+ * ```
+ * import type { At } from 'type-plus'
+ *
+ * type R = At<[1, 2, 3], -1> // 3
+ * ```
+ */
+export type At<A extends Array<unknown>, N extends number> = A['length'] extends 0 ? never : number extends A['length'] ? A[N] : GreaterThan<Abs<N>, A['length']> extends true ? undefined : Negative<N, A[Subtract<A['length'], Abs<N>>], A[N]>;
+/**
+ * Concats two arrays.
+ *
+ * alias of: `[...A, ...B]`
+ *
+ * ```
+ * import type { Concat } form 'type-plus'
+ *
+ * type R = Concat<[1], [2, 3]> // [1, 2, 3]
+ * ```
+ */
+export type Concat<A extends unknown[], B extends unknown[]> = [...A, ...B];
+//# sourceMappingURL=array.d.ts.map

package/cjs/array_plus/array.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../ts/array_plus/array.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAA;AACzD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAA;AACnD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAA;AAExD;;;;;;;;;;;;GAYG;AACH,MAAM,MAAM,EAAE,CAAC,CAAC,SAAS,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,SAAS,MAAM,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GAC/E,KAAK,GACL,MAAM,SAAS,CAAC,CAAC,QAAQ,CAAC,GAC1B,CAAC,CAAC,CAAC,CAAC,GACJ,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,IAAI,GAC7C,SAAS,GACT,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAEtD;;;;;;;;;;GAUG;AACH,MAAM,MAAM,MAAM,CAAC,CAAC,SAAS,OAAO,EAAE,EAAE,CAAC,SAAS,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA"}

package/cjs/array_plus/array.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=array.js.map

package/cjs/array_plus/array.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.js","sourceRoot":"","sources":["../../ts/array_plus/array.ts"],"names":[],"mappings":""}

package/cjs/array_plus/common_prop_keys.d.ts

@@ -0,0 +1,11 @@
+import type { Tail } from './tail.js';
+/**
+ * Gets the common property keys of the elements in `A`.
+ */
+export type CommonPropKeys<A extends Record<string, unknown>[]> = A['length'] extends 0 ? never : A['length'] extends 1 ? keyof A[0] : A['length'] extends 2 ? keyof A[0] & keyof A[1] : keyof A[0] & keyof A[1] & CommonPropKeys<Tail<Tail<A>>>;
+/**
+ * Gets the common property keys of the elements in `A`.
+ * @deprecated Please use CommonPropKeys instead.
+ */
+export type CommonKeys<A extends Record<string, any>[]> = CommonPropKeys<A>;
+//# sourceMappingURL=common_prop_keys.d.ts.map

package/cjs/array_plus/common_prop_keys.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"common_prop_keys.d.ts","sourceRoot":"","sources":["../../ts/array_plus/common_prop_keys.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAErC;;GAEG;AACH,MAAM,MAAM,cAAc,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GACpF,KAAK,GACL,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GACrB,MAAM,CAAC,CAAC,CAAC,CAAC,GACV,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GACrB,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GACvB,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAE1D;;;GAGG;AACH,MAAM,MAAM,UAAU,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,IAAI,cAAc,CAAC,CAAC,CAAC,CAAA"}

package/cjs/array_plus/common_prop_keys.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=common_prop_keys.js.map

package/cjs/array_plus/common_prop_keys.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"common_prop_keys.js","sourceRoot":"","sources":["../../ts/array_plus/common_prop_keys.ts"],"names":[],"mappings":""}

package/cjs/array_plus/create_tuple.d.ts

@@ -0,0 +1,9 @@
+import type { DigitArray, IsPositive, IsWhole } from '../math/index.js';
+/**
+ * Creates `Tuple<T>` with `L` number of elements.
+ * @note Other cool implementations by @lazytype, @jcalz:
+ * @see https://github.com/microsoft/TypeScript/issues/26223#issuecomment-674514787
+ * @see https://github.com/microsoft/TypeScript/issues/47874#issuecomment-1039157322
+ */
+export type CreateTuple<L extends number, T = any, Fail = never> = number extends L ? T[] : IsPositive<L> extends true ? IsWhole<L> extends true ? DigitArray.ToTuple<[], DigitArray.FromNumber<L>, T> : Fail : Fail;
+//# sourceMappingURL=create_tuple.d.ts.map

package/cjs/array_plus/create_tuple.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"create_tuple.d.ts","sourceRoot":"","sources":["../../ts/array_plus/create_tuple.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAA;AAEvE;;;;;GAKG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,IAAI,GAAG,KAAK,IAAI,MAAM,SAAS,CAAC,GAChF,CAAC,EAAE,GACH,UAAU,CAAC,CAAC,CAAC,SAAS,IAAI,GAC1B,OAAO,CAAC,CAAC,CAAC,SAAS,IAAI,GACtB,UAAU,CAAC,OAAO,CAAC,EAAE,EAAE,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GACnD,IAAI,GACL,IAAI,CAAA"}

package/cjs/array_plus/create_tuple.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=create_tuple.js.map

package/cjs/array_plus/create_tuple.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"create_tuple.js","sourceRoot":"","sources":["../../ts/array_plus/create_tuple.ts"],"names":[],"mappings":""}

package/cjs/array_plus/drop.d.ts

@@ -0,0 +1,19 @@
+import type { Equal } from '../predicates/index.js';
+import type { NonNull, NonUndefined } from '../utils/index.js';
+export type DropFirst<A extends any[]> = number extends A['length'] ? A : A['length'] extends 0 ? never[] : A['length'] extends 1 ? never[] : A extends [any, ...infer Tail] ? Tail : never;
+export type DropLast<A extends any[]> = number extends A['length'] ? A : A['length'] extends 0 ? never[] : A['length'] extends 1 ? never[] : A extends [...infer Heads, any] ? Heads : never;
+type ExcludeUnionOfEmptyTuple<A> = Equal<A, []> extends true ? A : Exclude<A, []>;
+/**
+ * drops entries matching `Criteria` in array or tuple `A`.
+ */
+export type DropMatch<A extends Readonly<Array<any>>, Criteria> = number extends A['length'] ? A[0] extends Criteria ? never[] : undefined extends Criteria ? null extends Criteria ? Array<NonNullable<A[0]>> : Array<NonUndefined<A[0]>> : null extends Criteria ? Array<NonNull<A[0]>> : Criteria extends A[0] ? Array<Exclude<A[0], Criteria>> : A[0] extends Criteria ? A : Array<Exclude<A[0], Criteria>> : DropMatchTuple<A, Criteria>;
+type DropMatchTuple<A extends Readonly<Array<any>>, Criteria> = A['length'] extends 0 ? A : A extends readonly [infer Head, ...infer Tail] ? Tail['length'] extends 0 ? undefined extends Criteria ? ExcludeUnionOfEmptyTuple<Head extends Criteria ? [] : [Head]> : ExcludeUnionOfEmptyTuple<Head extends Criteria ? [] : [Head]> : Exclude<Head, Criteria> extends never ? DropMatch<Tail, Criteria> : [Exclude<Head, Criteria>, ...DropMatch<Tail, Criteria>] : never[];
+export type DropNull<A extends Array<any>> = DropMatch<A, null>;
+export type DropNullable<A extends Array<any>> = DropMatch<A, null | undefined>;
+export type DropUndefined<A extends Array<any>> = DropMatch<A, undefined>;
+/**
+ * drop a particular value from an array
+ */
+export declare function drop<A extends Readonly<Array<any>>, C>(array: A, value: C): DropMatch<A, C>;
+export {};
+//# sourceMappingURL=drop.d.ts.map

package/cjs/array_plus/drop.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"drop.d.ts","sourceRoot":"","sources":["../../ts/array_plus/drop.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAA;AACnD,OAAO,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAA;AAE9D,MAAM,MAAM,SAAS,CAAC,CAAC,SAAS,GAAG,EAAE,IAAI,MAAM,SAAS,CAAC,CAAC,QAAQ,CAAC,GAChE,CAAC,GACD,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GACrB,KAAK,EAAE,GACP,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GACrB,KAAK,EAAE,GACP,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,MAAM,IAAI,CAAC,GAC9B,IAAI,GACJ,KAAK,CAAA;AAER,MAAM,MAAM,QAAQ,CAAC,CAAC,SAAS,GAAG,EAAE,IAAI,MAAM,SAAS,CAAC,CAAC,QAAQ,CAAC,GAC/D,CAAC,GACD,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GACrB,KAAK,EAAE,GACP,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GACrB,KAAK,EAAE,GACP,CAAC,SAAS,CAAC,GAAG,MAAM,KAAK,EAAE,GAAG,CAAC,GAC/B,KAAK,GACL,KAAK,CAAA;AAER,KAAK,wBAAwB,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;AAEjF;;GAEG;AACH,MAAM,MAAM,SAAS,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,IAAI,MAAM,SAAS,CAAC,CAAC,QAAQ,CAAC,GAEzF,CAAC,CAAC,CAAC,CAAC,SAAS,QAAQ,GAEpB,KAAK,EAAE,GACP,SAAS,SAAS,QAAQ,GAC1B,IAAI,SAAS,QAAQ,GACpB,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GACxB,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAC1B,IAAI,SAAS,QAAQ,GACrB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GACpB,QAAQ,SAAS,CAAC,CAAC,CAAC,CAAC,GACrB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAC9B,CAAC,CAAC,CAAC,CAAC,SAAS,QAAQ,GACrB,CAAC,GACD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAC/B,cAAc,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;AAE9B,KAAK,cAAc,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GAElF,CAAC,GACD,CAAC,SAAS,SAAS,CAAC,MAAM,IAAI,EAAE,GAAG,MAAM,IAAI,CAAC,GAC9C,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,GAEvB,SAAS,SAAS,QAAQ,GACzB,wBAAwB,CAAC,IAAI,SAAS,QAAQ,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAC7D,wBAAwB,CAAC,IAAI,SAAS,QAAQ,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAEhE,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,SAAS,KAAK,GACnC,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,GACzB,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,GAAG,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,GACxD,KAAK,EAAE,CAAA;AAEV,MAAM,MAAM,QAAQ,CAAC,CAAC,SAAS,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;AAC/D,MAAM,MAAM,YAAY,CAAC,CAAC,SAAS,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,SAAS,CAAC,CAAA;AAC/E,MAAM,MAAM,aAAa,CAAC,CAAC,SAAS,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;AAEzE;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAE3F"}

package/cjs/array_plus/drop.js

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.drop = void 0;
+/**
+ * drop a particular value from an array
+ */
+function drop(array, value) {
+    return array.filter(v => v !== value);
+}
+exports.drop = drop;
+//# sourceMappingURL=drop.js.map

package/cjs/array_plus/drop.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"drop.js","sourceRoot":"","sources":["../../ts/array_plus/drop.ts"],"names":[],"mappings":";;;AAiEA;;GAEG;AACH,SAAgB,IAAI,CAAoC,KAAQ,EAAE,KAAQ;IACzE,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,CAAoB,CAAA;AACzD,CAAC;AAFD,oBAEC"}

package/cjs/array_plus/filter.d.ts

@@ -0,0 +1,10 @@
+/**
+ * filter the array or tuple `A`, keeping entries satisfying `Criteria`.
+ * @deprecated renaming to `KeepMatch`
+ */
+export type Filter<A extends Array<any>, Criteria> = number extends A['length'] ? A[0] extends Criteria ? A : Criteria extends A[0] ? Array<Criteria> : never[] : A['length'] extends 0 ? never : A extends [infer Head, ...infer Tail] ? Tail['length'] extends 0 ? Head extends Criteria ? [Head] : never[] : Head extends Criteria ? [Head, ...Filter<Tail, Criteria>] : Filter<Tail, Criteria> : never;
+/**
+ * keeps entries satisfying `Criteria` in array or tuple `A`.
+ */
+export type KeepMatch<A extends Array<any>, Criteria> = Filter<A, Criteria>;
+//# sourceMappingURL=filter.d.ts.map

package/cjs/array_plus/filter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter.d.ts","sourceRoot":"","sources":["../../ts/array_plus/filter.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,MAAM,MAAM,CAAC,CAAC,SAAS,KAAK,CAAC,GAAG,CAAC,EAAE,QAAQ,IAAI,MAAM,SAAS,CAAC,CAAC,QAAQ,CAAC,GAE5E,CAAC,CAAC,CAAC,CAAC,SAAS,QAAQ,GACpB,CAAC,GACD,QAAQ,SAAS,CAAC,CAAC,CAAC,CAAC,GACrB,KAAK,CAAC,QAAQ,CAAC,GACf,KAAK,EAAE,GAEV,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GACnB,KAAK,GACL,CAAC,SAAS,CAAC,MAAM,IAAI,EAAE,GAAG,MAAM,IAAI,CAAC,GACrC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,GACvB,IAAI,SAAS,QAAQ,GACpB,CAAC,IAAI,CAAC,GACN,KAAK,EAAE,GACR,IAAI,SAAS,QAAQ,GACrB,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,GACjC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,GACvB,KAAK,CAAA;AAER;;GAEG;AACH,MAAM,MAAM,SAAS,CAAC,CAAC,SAAS,KAAK,CAAC,GAAG,CAAC,EAAE,QAAQ,IAAI,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA"}

package/cjs/array_plus/filter.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=filter.js.map

package/cjs/array_plus/filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter.js","sourceRoot":"","sources":["../../ts/array_plus/filter.ts"],"names":[],"mappings":""}

package/cjs/array_plus/find_first.d.ts

@@ -0,0 +1,6 @@
+export type FindFirst<A extends Array<any>, Criteria> = number extends A['length'] ? A[0] extends Criteria ? A[0] : never : A['length'] extends 0 ? never : A extends [any, ...infer Tail] ? A[0] extends Criteria ? A[0] : FindFirst<Tail, Criteria> : never;
+/**
+ * @deprecated use FindFirst
+ */
+export type First<A extends any[], Criteria> = FindFirst<A, Criteria>;
+//# sourceMappingURL=find_first.d.ts.map

package/cjs/array_plus/find_first.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"find_first.d.ts","sourceRoot":"","sources":["../../ts/array_plus/find_first.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,SAAS,CAAC,CAAC,SAAS,KAAK,CAAC,GAAG,CAAC,EAAE,QAAQ,IAAI,MAAM,SAAS,CAAC,CAAC,QAAQ,CAAC,GAC/E,CAAC,CAAC,CAAC,CAAC,SAAS,QAAQ,GACpB,CAAC,CAAC,CAAC,CAAC,GACJ,KAAK,GACN,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GACrB,KAAK,GACL,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,MAAM,IAAI,CAAC,GAC9B,CAAC,CAAC,CAAC,CAAC,SAAS,QAAQ,GACpB,CAAC,CAAC,CAAC,CAAC,GACJ,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,GAC1B,KAAK,CAAA;AAER;;GAEG;AACH,MAAM,MAAM,KAAK,CAAC,CAAC,SAAS,GAAG,EAAE,EAAE,QAAQ,IAAI,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA"}

package/cjs/array_plus/find_first.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=find_first.js.map

package/cjs/array_plus/find_first.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find_first.js","sourceRoot":"","sources":["../../ts/array_plus/find_first.ts"],"names":[],"mappings":""}

package/cjs/array_plus/find_last.d.ts

@@ -0,0 +1,2 @@
+export type FindLast<A extends Array<any>, Criteria> = number extends A['length'] ? A[0] extends Criteria ? A[0] : never : A['length'] extends 0 ? never : A extends [...infer Heads, infer Last] ? Last extends Criteria ? Last : FindLast<Heads, Criteria> : never;
+//# sourceMappingURL=find_last.d.ts.map

package/cjs/array_plus/find_last.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"find_last.d.ts","sourceRoot":"","sources":["../../ts/array_plus/find_last.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,QAAQ,CAAC,CAAC,SAAS,KAAK,CAAC,GAAG,CAAC,EAAE,QAAQ,IAAI,MAAM,SAAS,CAAC,CAAC,QAAQ,CAAC,GAC9E,CAAC,CAAC,CAAC,CAAC,SAAS,QAAQ,GACpB,CAAC,CAAC,CAAC,CAAC,GACJ,KAAK,GACN,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GACrB,KAAK,GACL,CAAC,SAAS,CAAC,GAAG,MAAM,KAAK,EAAE,MAAM,IAAI,CAAC,GACtC,IAAI,SAAS,QAAQ,GACpB,IAAI,GACJ,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,GAC1B,KAAK,CAAA"}

package/cjs/array_plus/find_last.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=find_last.js.map

package/cjs/array_plus/find_last.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find_last.js","sourceRoot":"","sources":["../../ts/array_plus/find_last.ts"],"names":[],"mappings":""}

package/cjs/array_plus/head.d.ts

@@ -0,0 +1,2 @@
+export type Head<T extends any[]> = T['length'] extends 0 ? never : T[0];
+//# sourceMappingURL=head.d.ts.map

package/cjs/array_plus/head.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"head.d.ts","sourceRoot":"","sources":["../../ts/array_plus/head.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,IAAI,CAAC,CAAC,SAAS,GAAG,EAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA"}

package/cjs/array_plus/head.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=head.js.map

package/cjs/array_plus/head.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"head.js","sourceRoot":"","sources":["../../ts/array_plus/head.ts"],"names":[],"mappings":""}

package/cjs/array_plus/index.d.ts

@@ -0,0 +1,20 @@
+export type * from './array.js';
+export type { CommonKeys, CommonPropKeys } from './common_prop_keys.js';
+export type { CreateTuple } from './create_tuple.js';
+export * from './drop.js';
+export type { Filter, KeepMatch } from './filter.js';
+export type { FindFirst, First } from './find_first.js';
+export type { FindLast } from './find_last.js';
+export type { Head } from './head.js';
+export type { IntersectOfProps, MapToProp } from './intersect_of_props.js';
+export type { IsArray } from './is_array.js';
+export type { Last } from './last.js';
+export * from './literal_array.js';
+export type { PadLeft } from './pad_left.js';
+export * from './reduce_while.js';
+export type { Reverse } from './reverse.js';
+export type { Some } from './some.js';
+export type { Tail } from './tail.js';
+export type { PropUnion, UnionOfProps } from './union_of_props.js';
+export type { ArrayValue, UnionOfValues } from './union_of_values.js';
+//# sourceMappingURL=index.d.ts.map

package/cjs/array_plus/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../ts/array_plus/index.ts"],"names":[],"mappings":"AAAA,mBAAmB,YAAY,CAAA;AAC/B,YAAY,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAA;AACvE,YAAY,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AACpD,cAAc,WAAW,CAAA;AACzB,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AACpD,YAAY,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAA;AACvD,YAAY,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AAC9C,YAAY,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACrC,YAAY,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAA;AAC1E,YAAY,EAAE,OAAO,EAAE,MAAM,eAAe,CAAA;AAC5C,YAAY,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACrC,cAAc,oBAAoB,CAAA;AAClC,YAAY,EAAE,OAAO,EAAE,MAAM,eAAe,CAAA;AAC5C,cAAc,mBAAmB,CAAA;AACjC,YAAY,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAC3C,YAAY,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACrC,YAAY,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACrC,YAAY,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAA;AAClE,YAAY,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAA"}

package/cjs/array_plus/index.js

@@ -0,0 +1,20 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./drop.js"), exports);
+__exportStar(require("./literal_array.js"), exports);
+__exportStar(require("./reduce_while.js"), exports);
+//# sourceMappingURL=index.js.map

package/cjs/array_plus/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../ts/array_plus/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAGA,4CAAyB;AAQzB,qDAAkC;AAElC,oDAAiC"}

package/cjs/array_plus/intersect_of_props.d.ts

@@ -0,0 +1,12 @@
+import type { KeyTypes } from '../object/index.js';
+import type { Tail } from './tail.js';
+/**
+ * Gets the intersect of properties of the elements in `A`
+ */
+export type IntersectOfProps<A extends Record<any, unknown>[], P extends KeyTypes> = A['length'] extends 0 ? never : A['length'] extends 1 ? A[0][P] : A[0][P] & IntersectOfProps<Tail<A>, P>;
+/**
+ * Gets the intersect of properties of the elements in `A`
+ * This will be deprecated in 4.0. Please use IntersectOfProps instead.
+ */
+export type MapToProp<A extends Record<any, any>[], P extends KeyTypes> = IntersectOfProps<A, P>;
+//# sourceMappingURL=intersect_of_props.d.ts.map

package/cjs/array_plus/intersect_of_props.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersect_of_props.d.ts","sourceRoot":"","sources":["../../ts/array_plus/intersect_of_props.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAA;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAErC;;GAEG;AACH,MAAM,MAAM,gBAAgB,CAAC,CAAC,SAAS,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,SAAS,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GACvG,KAAK,GACL,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,GACrB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GACP,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAEzC;;;GAGG;AACH,MAAM,MAAM,SAAS,CAAC,CAAC,SAAS,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,SAAS,QAAQ,IAAI,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA"}

package/cjs/array_plus/intersect_of_props.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=intersect_of_props.js.map

package/cjs/array_plus/intersect_of_props.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersect_of_props.js","sourceRoot":"","sources":["../../ts/array_plus/intersect_of_props.ts"],"names":[],"mappings":""}

package/cjs/array_plus/is_array.d.ts

@@ -0,0 +1,2 @@
+export type IsArray<T, Then = true, Else = false> = T extends any[] ? Then : Else;
+//# sourceMappingURL=is_array.d.ts.map

package/cjs/array_plus/is_array.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"is_array.d.ts","sourceRoot":"","sources":["../../ts/array_plus/is_array.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,EAAE,IAAI,GAAG,KAAK,IAAI,CAAC,SAAS,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAA"}

package/cjs/array_plus/is_array.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=is_array.js.map

package/cjs/array_plus/is_array.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"is_array.js","sourceRoot":"","sources":["../../ts/array_plus/is_array.ts"],"names":[],"mappings":""}

package/cjs/array_plus/last.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Get the last type of an array or tuple.
+ */
+export type Last<T extends any[]> = T extends [...any[], infer R] ? R : T[0];
+//# sourceMappingURL=last.d.ts.map

package/cjs/array_plus/last.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"last.d.ts","sourceRoot":"","sources":["../../ts/array_plus/last.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,MAAM,IAAI,CAAC,CAAC,SAAS,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA"}

package/cjs/array_plus/last.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=last.js.map

package/cjs/array_plus/last.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"last.js","sourceRoot":"","sources":["../../ts/array_plus/last.ts"],"names":[],"mappings":""}

package/cjs/array_plus/literal_array.d.ts

@@ -0,0 +1,3 @@
+import type { KeyTypes } from '../object/index.js';
+export declare function literalArray<T extends KeyTypes>(...entries: T[]): T[];
+//# sourceMappingURL=literal_array.d.ts.map

package/cjs/array_plus/literal_array.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"literal_array.d.ts","sourceRoot":"","sources":["../../ts/array_plus/literal_array.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAA;AAElD,wBAAgB,YAAY,CAAC,CAAC,SAAS,QAAQ,EAAE,GAAG,OAAO,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAErE"}

package/cjs/array_plus/literal_array.js

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.literalArray = void 0;
+function literalArray(...entries) {
+    return entries;
+}
+exports.literalArray = literalArray;
+//# sourceMappingURL=literal_array.js.map

package/cjs/array_plus/literal_array.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"literal_array.js","sourceRoot":"","sources":["../../ts/array_plus/literal_array.ts"],"names":[],"mappings":";;;AAEA,SAAgB,YAAY,CAAqB,GAAG,OAAY;IAC/D,OAAO,OAAO,CAAA;AACf,CAAC;AAFD,oCAEC"}

package/cjs/array_plus/pad_left.d.ts

@@ -0,0 +1,5 @@
+import { Equal, IsAny } from '../predicates/index.js';
+import { CreateTuple } from './create_tuple.js';
+import { UnionOfValues } from './union_of_values.js';
+export type PadLeft<A extends any[], Total extends number, PadWith = any> = number extends A['length'] ? IsAny<UnionOfValues<A>> extends true ? A : Equal<UnionOfValues<A>, PadWith> extends true ? A : PadLeft<[...CreateTuple<Total, PadWith>, ...A], Total, PadWith> : CreateTuple<Total, any> extends [...infer U, ...A] ? number extends U['length'] ? A : [...CreateTuple<U['length'], PadWith>, ...A] : A;
+//# sourceMappingURL=pad_left.d.ts.map

package/cjs/array_plus/pad_left.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pad_left.d.ts","sourceRoot":"","sources":["../../ts/array_plus/pad_left.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAA;AACrD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAA;AAEpD,MAAM,MAAM,OAAO,CAAC,CAAC,SAAS,GAAG,EAAE,EAAE,KAAK,SAAS,MAAM,EAAE,OAAO,GAAG,GAAG,IAAI,MAAM,SAAS,CAAC,CAAC,QAAQ,CAAC,GACnG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,GACnC,CAAC,GACD,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,IAAI,GAC7C,CAAC,GACD,OAAO,CAAC,CAAC,GAAG,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,GAChE,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAClD,MAAM,SAAS,CAAC,CAAC,QAAQ,CAAC,GACzB,CAAC,GACD,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAC7C,CAAC,CAAA"}

package/cjs/array_plus/pad_left.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=pad_left.js.map

package/cjs/array_plus/pad_left.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pad_left.js","sourceRoot":"","sources":["../../ts/array_plus/pad_left.ts"],"names":[],"mappings":""}

package/cjs/array_plus/reduce_while.d.ts

@@ -0,0 +1,2 @@
+export declare function reduceWhile<T, R>(predicate: (acc: R, currentValue: T) => boolean, callbackfn: (previousValue: R, currentValue: T, currentIndex: number, array: T[]) => R, initialValue: R, array: T[]): R;
+//# sourceMappingURL=reduce_while.d.ts.map

package/cjs/array_plus/reduce_while.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduce_while.d.ts","sourceRoot":"","sources":["../../ts/array_plus/reduce_while.ts"],"names":[],"mappings":"AAAA,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,EAC/B,SAAS,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,KAAK,OAAO,EAC/C,UAAU,EAAE,CAAC,aAAa,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,EACtF,YAAY,EAAE,CAAC,EACf,KAAK,EAAE,CAAC,EAAE,KASV"}