@sinclair/typebox 0.32.0-dev-17 → 0.32.0-dev-19

package/build/require/value/transform/has.js

@@ -1,110 +1,90 @@
 "use strict";
-/*--------------------------------------------------------------------------
 
-@sinclair/typebox/value
-
-The MIT License (MIT)
-
-Copyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-
----------------------------------------------------------------------------*/
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.HasTransform = void 0;
+const index_1 = require("../deref/index");
+const index_2 = require("../../type/symbols/index");
+// ------------------------------------------------------------------
+// TypeGuard
+// ------------------------------------------------------------------
 const type_1 = require("../../type/guard/type");
-const index_1 = require("../guard/index");
-const index_2 = require("../deref/index");
-const index_3 = require("../../type/symbols/index");
+// ------------------------------------------------------------------
+// ValueGuard
+// ------------------------------------------------------------------
+const index_3 = require("../guard/index");
 // prettier-ignore
 function TArray(schema, references) {
-    return (0, type_1.TTransform)(schema) || Visit(schema.items, references);
+    return (0, type_1.IsTransform)(schema) || Visit(schema.items, references);
 }
 // prettier-ignore
 function TAsyncIterator(schema, references) {
-    return (0, type_1.TTransform)(schema) || Visit(schema.items, references);
+    return (0, type_1.IsTransform)(schema) || Visit(schema.items, references);
 }
 // prettier-ignore
 function TConstructor(schema, references) {
-    return (0, type_1.TTransform)(schema) || Visit(schema.returns, references) || schema.parameters.some((schema) => Visit(schema, references));
+    return (0, type_1.IsTransform)(schema) || Visit(schema.returns, references) || schema.parameters.some((schema) => Visit(schema, references));
 }
 // prettier-ignore
 function TFunction(schema, references) {
-    return (0, type_1.TTransform)(schema) || Visit(schema.returns, references) || schema.parameters.some((schema) => Visit(schema, references));
+    return (0, type_1.IsTransform)(schema) || Visit(schema.returns, references) || schema.parameters.some((schema) => Visit(schema, references));
 }
 // prettier-ignore
 function TIntersect(schema, references) {
-    return (0, type_1.TTransform)(schema) || (0, type_1.TTransform)(schema.unevaluatedProperties) || schema.allOf.some((schema) => Visit(schema, references));
+    return (0, type_1.IsTransform)(schema) || (0, type_1.IsTransform)(schema.unevaluatedProperties) || schema.allOf.some((schema) => Visit(schema, references));
 }
 // prettier-ignore
 function TIterator(schema, references) {
-    return (0, type_1.TTransform)(schema) || Visit(schema.items, references);
+    return (0, type_1.IsTransform)(schema) || Visit(schema.items, references);
 }
 // prettier-ignore
 function TNot(schema, references) {
-    return (0, type_1.TTransform)(schema) || Visit(schema.not, references);
+    return (0, type_1.IsTransform)(schema) || Visit(schema.not, references);
 }
 // prettier-ignore
 function TObject(schema, references) {
-    return ((0, type_1.TTransform)(schema) ||
+    return ((0, type_1.IsTransform)(schema) ||
         Object.values(schema.properties).some((schema) => Visit(schema, references)) ||
-        ((0, type_1.TSchema)(schema.additionalProperties) && Visit(schema.additionalProperties, references)));
+        ((0, type_1.IsSchema)(schema.additionalProperties) && Visit(schema.additionalProperties, references)));
 }
 // prettier-ignore
 function TPromise(schema, references) {
-    return (0, type_1.TTransform)(schema) || Visit(schema.item, references);
+    return (0, type_1.IsTransform)(schema) || Visit(schema.item, references);
 }
 // prettier-ignore
 function TRecord(schema, references) {
     const pattern = Object.getOwnPropertyNames(schema.patternProperties)[0];
     const property = schema.patternProperties[pattern];
-    return (0, type_1.TTransform)(schema) || Visit(property, references) || ((0, type_1.TSchema)(schema.additionalProperties) && (0, type_1.TTransform)(schema.additionalProperties));
+    return (0, type_1.IsTransform)(schema) || Visit(property, references) || ((0, type_1.IsSchema)(schema.additionalProperties) && (0, type_1.IsTransform)(schema.additionalProperties));
 }
 // prettier-ignore
 function TRef(schema, references) {
-    if ((0, type_1.TTransform)(schema))
+    if ((0, type_1.IsTransform)(schema))
         return true;
-    return Visit((0, index_2.Deref)(schema, references), references);
+    return Visit((0, index_1.Deref)(schema, references), references);
 }
 // prettier-ignore
 function TThis(schema, references) {
-    if ((0, type_1.TTransform)(schema))
+    if ((0, type_1.IsTransform)(schema))
         return true;
-    return Visit((0, index_2.Deref)(schema, references), references);
+    return Visit((0, index_1.Deref)(schema, references), references);
 }
 // prettier-ignore
 function TTuple(schema, references) {
-    return (0, type_1.TTransform)(schema) || (!(0, index_1.IsUndefined)(schema.items) && schema.items.some((schema) => Visit(schema, references)));
+    return (0, type_1.IsTransform)(schema) || (!(0, index_3.IsUndefined)(schema.items) && schema.items.some((schema) => Visit(schema, references)));
 }
 // prettier-ignore
 function TUnion(schema, references) {
-    return (0, type_1.TTransform)(schema) || schema.anyOf.some((schema) => Visit(schema, references));
+    return (0, type_1.IsTransform)(schema) || schema.anyOf.some((schema) => Visit(schema, references));
 }
 // prettier-ignore
 function Visit(schema, references) {
-    const references_ = (0, index_1.IsString)(schema.$id) ? [...references, schema] : references;
+    const references_ = (0, index_3.IsString)(schema.$id) ? [...references, schema] : references;
     const schema_ = schema;
     if (schema.$id && visited.has(schema.$id))
         return false;
     if (schema.$id)
         visited.add(schema.$id);
-    switch (schema[index_3.Kind]) {
+    switch (schema[index_2.Kind]) {
         case 'Array':
             return TArray(schema_, references_);
         case 'AsyncIterator':
@@ -134,7 +114,7 @@ function Visit(schema, references) {
         case 'Union':
             return TUnion(schema_, references_);
         default:
-            return (0, type_1.TTransform)(schema);
+            return (0, type_1.IsTransform)(schema);
     }
 }
 const visited = new Set();

package/build/require/value/transform/index.js

@@ -1,31 +1,5 @@
 "use strict";
-/*--------------------------------------------------------------------------
 
-@sinclair/typebox/value
-
-The MIT License (MIT)
-
-Copyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-
----------------------------------------------------------------------------*/
 var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
     if (k2 === undefined) k2 = k;
     var desc = Object.getOwnPropertyDescriptor(m, k);

package/build/require/value/value/index.js

@@ -1,31 +1,5 @@
 "use strict";
-/*--------------------------------------------------------------------------
 
-@sinclair/typebox/value
-
-The MIT License (MIT)
-
-Copyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-
----------------------------------------------------------------------------*/
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Value = void 0;
 exports.Value = require("./value");

package/build/require/value/value/value.js

@@ -1,31 +1,5 @@
 "use strict";
-/*--------------------------------------------------------------------------
 
-@sinclair/typebox/value
-
-The MIT License (MIT)
-
-Copyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-
----------------------------------------------------------------------------*/
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Mutate = exports.Patch = exports.Hash = exports.Diff = exports.Equal = exports.Errors = exports.Encode = exports.Default = exports.Decode = exports.Clone = exports.Convert = exports.Clean = exports.Check = exports.Create = exports.Cast = void 0;
 const index_1 = require("../transform/index");

package/license

@@ -1,4 +1,6 @@
-TypeBox: Json Schema Type Builder with Static Type Resolution for TypeScript 
+TypeBox
+
+Json Schema Type Builder with Static Type Resolution for TypeScript 
 
 The MIT License (MIT)
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@sinclair/typebox",
-  "version": "0.32.0-dev-17",
+  "version": "0.32.0-dev-19",
   "description": "Json Schema Type Builder with Static Type Resolution for TypeScript",
   "keywords": [
     "typescript",

package/readme.md

@@ -1136,16 +1136,16 @@ type S = Static<typeof T>                            // type S = 'A' | 'B' | 'C'
 
 ### TypeGuard
 
-TypeBox can type check its own types with the TypeGuard module. This module is written for reflection and provides structural tests for every built-in TypeBox type. Functions of this module return `is` guards which can be used with TypeScript control flow assertions to obtain schema inference. The following guards that the value A is TString.
+TypeBox can type check its own types with the TypeGuard module. This module is written for reflection and provides structural tests for every built-in TypeBox type. Functions of this module return `is` guards which can be used with TypeScript control flow assertions to obtain schema inference. The following guards that the value `T` is TString.
 
 ```typescript
-import { Type, TypeGuard } from '@sinclair/typebox'
+import { TypeGuard, Kind } from '@sinclair/typebox'
 
-const A: unknown = { ... }
+const T: unknown = { [Kind]: 'String', type: 'string' }
 
-if(TypeGuard.TString(A)) {
+if(TypeGuard.IsString(T)) {
 
-  A.type                                             // A.type = 'string'
+  // T is TString
 }
 ```
 
@@ -1723,7 +1723,7 @@ For additional comparative benchmarks, please refer to [typescript-runtime-type-
 
 ### Compile
 
-This benchmark measures compilation performance for varying types. You can review this benchmark [here](https://github.com/sinclairzx81/typebox/blob/master/build/benchmark/measurement/module/compile.ts).
+This benchmark measures compilation performance for varying types.
 
 ```typescript
 ┌────────────────────────────┬────────────┬──────────────┬──────────────┬──────────────┐
@@ -1765,7 +1765,7 @@ This benchmark measures compilation performance for varying types. You can revie
 
 ### Validate
 
-This benchmark measures validation performance for varying types. You can review this benchmark [here](https://github.com/sinclairzx81/typebox/blob/master/build/benchmark/measurement/module/check.ts).
+This benchmark measures validation performance for varying types.
 
 ```typescript
 ┌────────────────────────────┬────────────┬──────────────┬──────────────┬──────────────┬──────────────┐

package/build/import/type/indexed/indexed-result.d.mts

@@ -1,33 +0,0 @@
-import { type TSchema, SchemaOptions } from '../schema/index.mjs';
-import { type TObject, type TProperties } from '../object/index.mjs';
-import { type TNever } from '../never/index.mjs';
-import { type TRecursive } from '../recursive/index.mjs';
-import { type TIntersect } from '../intersect/index.mjs';
-import { type TUnion } from '../union/index.mjs';
-import { type TTuple } from '../tuple/index.mjs';
-import { type TArray } from '../array/index.mjs';
-import { IntersectEvaluated } from '../intersect/index.mjs';
-import { UnionEvaluated } from '../union/index.mjs';
-type FromRest<T extends TSchema[], K extends PropertyKey> = (T extends [infer L extends TSchema, ...infer R extends TSchema[]] ? [FromKey<L, K>, ...FromRest<R, K>] : []);
-declare function FromRest<T extends TSchema[], K extends PropertyKey>(T: [...T], K: K): FromRest<T, K>;
-type FromIntersectRest<T extends TSchema[]> = (T extends [infer L extends TSchema, ...infer R extends TSchema[]] ? L extends TNever ? [...FromIntersectRest<R>] : [L, ...FromIntersectRest<R>] : []);
-declare function FromIntersectRest<T extends TSchema[]>(T: [...T]): FromIntersectRest<T>;
-type FromIntersect<T extends TSchema[], K extends PropertyKey> = (IntersectEvaluated<FromIntersectRest<FromRest<T, K>>>);
-declare function FromIntersect<T extends TSchema[], K extends PropertyKey>(T: [...T], K: K): FromIntersect<T, K>;
-type FromUnionRest<T extends TSchema[], S = T> = (T extends [infer L extends TSchema, ...infer R extends TSchema[]] ? L extends TNever ? [] : FromUnionRest<R, S> : S);
-declare function FromUnionRest<T extends TSchema[]>(T: [...T], S?: [...T]): FromUnionRest<T>;
-type FromUnion<T extends TSchema[], K extends PropertyKey> = (UnionEvaluated<FromUnionRest<FromRest<T, K>>>);
-declare function FromUnion<T extends TSchema[], K extends PropertyKey>(T: [...T], K: K): FromUnion<T, K>;
-type FromTuple<T extends TSchema[], K extends PropertyKey> = (K extends keyof T ? T[K] : K extends '[number]' ? UnionEvaluated<T> : TNever);
-declare function FromTuple<T extends TSchema[], K extends PropertyKey>(T: [...T], K: K): FromTuple<T, K>;
-type FromArray<T extends TSchema, K extends PropertyKey> = (K extends '[number]' ? T : TNever);
-declare function FromArray<T extends TSchema, K extends PropertyKey>(T: T, K: K): FromArray<T, K>;
-type FromProperty<T extends TProperties, K extends PropertyKey> = (K extends keyof T ? T[K] : TNever);
-declare function FromProperty<T extends TProperties, K extends PropertyKey>(T: T, K: K): FromProperty<T, K>;
-type FromKey<T extends TSchema, K extends PropertyKey> = (T extends TRecursive<infer S> ? FromKey<S, K> : T extends TIntersect<infer S> ? FromIntersect<S, K> : T extends TUnion<infer S> ? FromUnion<S, K> : T extends TTuple<infer S> ? FromTuple<S, K> : T extends TArray<infer S> ? FromArray<S, K> : T extends TObject<infer S> ? FromProperty<S, K> : TNever);
-declare function FromKey<T extends TSchema, K extends PropertyKey>(T: T, K: K): FromKey<T, K>;
-type FromKeys<T extends TSchema, K extends PropertyKey[]> = (K extends [infer L extends PropertyKey, ...infer R extends PropertyKey[]] ? [FromKey<T, L>, ...FromKeys<T, R>] : []);
-declare function FromKeys<T extends TSchema, K extends PropertyKey[]>(T: T, K: [...K]): FromKeys<T, K>;
-export type TIndexResult<T extends TSchema, K extends PropertyKey[]> = (UnionEvaluated<FromKeys<T, K>>);
-export declare function IndexResult<T extends TSchema, K extends PropertyKey[]>(T: T, K: [...K], options: SchemaOptions): TIndexResult<T, K>;
-export {};

package/build/import/type/indexed/indexed-result.mjs

@@ -1,107 +0,0 @@
-/*--------------------------------------------------------------------------
-
-@sinclair/typebox/type
-
-The MIT License (MIT)
-
-Copyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-
----------------------------------------------------------------------------*/
-import { Never } from '../never/index.mjs';
-import { IntersectEvaluated } from '../intersect/index.mjs';
-import { UnionEvaluated } from '../union/index.mjs';
-import { CloneType } from '../clone/type.mjs';
-// ------------------------------------------------------------------
-// TypeGuard
-// ------------------------------------------------------------------
-// prettier-ignore
-import { TArray as IsArrayType, TIntersect as IsIntersectType, TObject as IsObjectType, TNever as IsNeverType, TTuple as IsTupleType, TUnion as IsUnionType } from '../guard/type.mjs';
-// prettier-ignore
-function FromRest(T, K) {
-    const [L, ...R] = T;
-    return (T.length > 0
-        ? [FromKey(L, K), ...FromRest(R, K)]
-        : []);
-}
-// prettier-ignore
-function FromIntersectRest(T) {
-    const [L, ...R] = T;
-    return (T.length > 0
-        ? IsNeverType(L)
-            ? [...FromIntersectRest(R)]
-            : [L, ...FromIntersectRest(R)]
-        : []);
-}
-// prettier-ignore
-function FromIntersect(T, K) {
-    return (IntersectEvaluated(FromIntersectRest(FromRest(T, K))));
-}
-// prettier-ignore
-function FromUnionRest(T, S = T) {
-    const [L, ...R] = T;
-    return (T.length > 0
-        ? IsNeverType(L)
-            ? []
-            : FromUnionRest(R, S)
-        : S);
-}
-// prettier-ignore
-function FromUnion(T, K) {
-    return (UnionEvaluated(FromUnionRest(FromRest(T, K))));
-}
-// prettier-ignore
-function FromTuple(T, K) {
-    return (K in T ? T[K] :
-        K === '[number]' ? UnionEvaluated(T) :
-            Never());
-}
-// prettier-ignore
-function FromArray(T, K) {
-    return (K === '[number]'
-        ? T
-        : Never());
-}
-// prettier-ignore
-function FromProperty(T, K) {
-    return (K in T
-        ? T[K]
-        : Never());
-}
-// prettier-ignore
-function FromKey(T, K) {
-    return (IsIntersectType(T) ? FromIntersect(T.allOf, K) :
-        IsUnionType(T) ? FromUnion(T.anyOf, K) :
-            IsTupleType(T) ? FromTuple(T.items ?? [], K) :
-                IsArrayType(T) ? FromArray(T.items, K) :
-                    IsObjectType(T) ? FromProperty(T.properties, K) :
-                        Never());
-}
-// prettier-ignore
-function FromKeys(T, K) {
-    const [L, ...R] = K;
-    return (K.length > 0
-        ? [FromKey(T, L), ...FromKeys(T, R)]
-        : []);
-}
-// prettier-ignore
-export function IndexResult(T, K, options) {
-    return (CloneType(UnionEvaluated(FromKeys(T, K)), options));
-}

package/build/require/type/indexed/indexed-result.d.ts

@@ -1,33 +0,0 @@
-import { type TSchema, SchemaOptions } from '../schema/index';
-import { type TObject, type TProperties } from '../object/index';
-import { type TNever } from '../never/index';
-import { type TRecursive } from '../recursive/index';
-import { type TIntersect } from '../intersect/index';
-import { type TUnion } from '../union/index';
-import { type TTuple } from '../tuple/index';
-import { type TArray } from '../array/index';
-import { IntersectEvaluated } from '../intersect/index';
-import { UnionEvaluated } from '../union/index';
-type FromRest<T extends TSchema[], K extends PropertyKey> = (T extends [infer L extends TSchema, ...infer R extends TSchema[]] ? [FromKey<L, K>, ...FromRest<R, K>] : []);
-declare function FromRest<T extends TSchema[], K extends PropertyKey>(T: [...T], K: K): FromRest<T, K>;
-type FromIntersectRest<T extends TSchema[]> = (T extends [infer L extends TSchema, ...infer R extends TSchema[]] ? L extends TNever ? [...FromIntersectRest<R>] : [L, ...FromIntersectRest<R>] : []);
-declare function FromIntersectRest<T extends TSchema[]>(T: [...T]): FromIntersectRest<T>;
-type FromIntersect<T extends TSchema[], K extends PropertyKey> = (IntersectEvaluated<FromIntersectRest<FromRest<T, K>>>);
-declare function FromIntersect<T extends TSchema[], K extends PropertyKey>(T: [...T], K: K): FromIntersect<T, K>;
-type FromUnionRest<T extends TSchema[], S = T> = (T extends [infer L extends TSchema, ...infer R extends TSchema[]] ? L extends TNever ? [] : FromUnionRest<R, S> : S);
-declare function FromUnionRest<T extends TSchema[]>(T: [...T], S?: [...T]): FromUnionRest<T>;
-type FromUnion<T extends TSchema[], K extends PropertyKey> = (UnionEvaluated<FromUnionRest<FromRest<T, K>>>);
-declare function FromUnion<T extends TSchema[], K extends PropertyKey>(T: [...T], K: K): FromUnion<T, K>;
-type FromTuple<T extends TSchema[], K extends PropertyKey> = (K extends keyof T ? T[K] : K extends '[number]' ? UnionEvaluated<T> : TNever);
-declare function FromTuple<T extends TSchema[], K extends PropertyKey>(T: [...T], K: K): FromTuple<T, K>;
-type FromArray<T extends TSchema, K extends PropertyKey> = (K extends '[number]' ? T : TNever);
-declare function FromArray<T extends TSchema, K extends PropertyKey>(T: T, K: K): FromArray<T, K>;
-type FromProperty<T extends TProperties, K extends PropertyKey> = (K extends keyof T ? T[K] : TNever);
-declare function FromProperty<T extends TProperties, K extends PropertyKey>(T: T, K: K): FromProperty<T, K>;
-type FromKey<T extends TSchema, K extends PropertyKey> = (T extends TRecursive<infer S> ? FromKey<S, K> : T extends TIntersect<infer S> ? FromIntersect<S, K> : T extends TUnion<infer S> ? FromUnion<S, K> : T extends TTuple<infer S> ? FromTuple<S, K> : T extends TArray<infer S> ? FromArray<S, K> : T extends TObject<infer S> ? FromProperty<S, K> : TNever);
-declare function FromKey<T extends TSchema, K extends PropertyKey>(T: T, K: K): FromKey<T, K>;
-type FromKeys<T extends TSchema, K extends PropertyKey[]> = (K extends [infer L extends PropertyKey, ...infer R extends PropertyKey[]] ? [FromKey<T, L>, ...FromKeys<T, R>] : []);
-declare function FromKeys<T extends TSchema, K extends PropertyKey[]>(T: T, K: [...K]): FromKeys<T, K>;
-export type TIndexResult<T extends TSchema, K extends PropertyKey[]> = (UnionEvaluated<FromKeys<T, K>>);
-export declare function IndexResult<T extends TSchema, K extends PropertyKey[]>(T: T, K: [...K], options: SchemaOptions): TIndexResult<T, K>;
-export {};

package/build/require/type/indexed/indexed-result.js

@@ -1,111 +0,0 @@
-"use strict";
-/*--------------------------------------------------------------------------
-
-@sinclair/typebox/type
-
-The MIT License (MIT)
-
-Copyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-
----------------------------------------------------------------------------*/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.IndexResult = void 0;
-const index_1 = require("../never/index");
-const index_2 = require("../intersect/index");
-const index_3 = require("../union/index");
-const type_1 = require("../clone/type");
-// ------------------------------------------------------------------
-// TypeGuard
-// ------------------------------------------------------------------
-// prettier-ignore
-const type_2 = require("../guard/type");
-// prettier-ignore
-function FromRest(T, K) {
-    const [L, ...R] = T;
-    return (T.length > 0
-        ? [FromKey(L, K), ...FromRest(R, K)]
-        : []);
-}
-// prettier-ignore
-function FromIntersectRest(T) {
-    const [L, ...R] = T;
-    return (T.length > 0
-        ? (0, type_2.TNever)(L)
-            ? [...FromIntersectRest(R)]
-            : [L, ...FromIntersectRest(R)]
-        : []);
-}
-// prettier-ignore
-function FromIntersect(T, K) {
-    return ((0, index_2.IntersectEvaluated)(FromIntersectRest(FromRest(T, K))));
-}
-// prettier-ignore
-function FromUnionRest(T, S = T) {
-    const [L, ...R] = T;
-    return (T.length > 0
-        ? (0, type_2.TNever)(L)
-            ? []
-            : FromUnionRest(R, S)
-        : S);
-}
-// prettier-ignore
-function FromUnion(T, K) {
-    return ((0, index_3.UnionEvaluated)(FromUnionRest(FromRest(T, K))));
-}
-// prettier-ignore
-function FromTuple(T, K) {
-    return (K in T ? T[K] :
-        K === '[number]' ? (0, index_3.UnionEvaluated)(T) :
-            (0, index_1.Never)());
-}
-// prettier-ignore
-function FromArray(T, K) {
-    return (K === '[number]'
-        ? T
-        : (0, index_1.Never)());
-}
-// prettier-ignore
-function FromProperty(T, K) {
-    return (K in T
-        ? T[K]
-        : (0, index_1.Never)());
-}
-// prettier-ignore
-function FromKey(T, K) {
-    return ((0, type_2.TIntersect)(T) ? FromIntersect(T.allOf, K) :
-        (0, type_2.TUnion)(T) ? FromUnion(T.anyOf, K) :
-            (0, type_2.TTuple)(T) ? FromTuple(T.items ?? [], K) :
-                (0, type_2.TArray)(T) ? FromArray(T.items, K) :
-                    (0, type_2.TObject)(T) ? FromProperty(T.properties, K) :
-                        (0, index_1.Never)());
-}
-// prettier-ignore
-function FromKeys(T, K) {
-    const [L, ...R] = K;
-    return (K.length > 0
-        ? [FromKey(T, L), ...FromKeys(T, R)]
-        : []);
-}
-// prettier-ignore
-function IndexResult(T, K, options) {
-    return ((0, type_1.CloneType)((0, index_3.UnionEvaluated)(FromKeys(T, K)), options));
-}
-exports.IndexResult = IndexResult;