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

package/build/require/errors/errors.js

@@ -1,46 +1,24 @@
 "use strict";
-/*--------------------------------------------------------------------------
 
-@sinclair/typebox/errors
-
-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.Errors = exports.ValueErrorIterator = exports.ValueErrorsUnknownTypeError = exports.ValueErrorType = void 0;
-const index_1 = require("../value/guard/index");
-const index_2 = require("../system/index");
-const index_3 = require("../type/keyof/index");
-const index_4 = require("../type/registry/index");
+const index_1 = require("../system/index");
+const index_2 = require("../type/keyof/index");
+const index_3 = require("../type/registry/index");
 const extends_undefined_1 = require("../type/extends/extends-undefined");
 const function_1 = require("./function");
-const index_5 = require("../value/deref/index");
-const index_6 = require("../value/hash/index");
-const index_7 = require("../type/symbols/index");
-const index_8 = require("../type/never/index");
-// --------------------------------------------------------------------------
+const index_4 = require("../value/deref/index");
+const index_5 = require("../value/hash/index");
+const index_6 = require("../type/symbols/index");
+const index_7 = require("../type/never/index");
+// ------------------------------------------------------------------
+// ValueGuard
+// ------------------------------------------------------------------
+// prettier-ignore
+const index_8 = require("../value/guard/index");
+// ------------------------------------------------------------------
 // ValueErrorType
-// --------------------------------------------------------------------------
+// ------------------------------------------------------------------
 var ValueErrorType;
 (function (ValueErrorType) {
     ValueErrorType[ValueErrorType["ArrayContains"] = 0] = "ArrayContains";
@@ -107,9 +85,9 @@ var ValueErrorType;
     ValueErrorType[ValueErrorType["Union"] = 61] = "Union";
     ValueErrorType[ValueErrorType["Void"] = 62] = "Void";
 })(ValueErrorType || (exports.ValueErrorType = ValueErrorType = {}));
-// --------------------------------------------------------------------------
+// ------------------------------------------------------------------
 // ValueErrors
-// --------------------------------------------------------------------------
+// ------------------------------------------------------------------
 class ValueErrorsUnknownTypeError extends Error {
     constructor(schema) {
         super('Unknown type');
@@ -117,21 +95,21 @@ class ValueErrorsUnknownTypeError extends Error {
     }
 }
 exports.ValueErrorsUnknownTypeError = ValueErrorsUnknownTypeError;
-// --------------------------------------------------------------------------
+// ------------------------------------------------------------------
 // EscapeKey
-// --------------------------------------------------------------------------
+// ------------------------------------------------------------------
 function EscapeKey(key) {
     return key.replace(/~/g, '~0').replace(/\//g, '~1'); // RFC6901 Path
 }
-// --------------------------------------------------------------------------
+// ------------------------------------------------------------------
 // Guards
-// --------------------------------------------------------------------------
+// ------------------------------------------------------------------
 function IsDefined(value) {
     return value !== undefined;
 }
-// --------------------------------------------------------------------------
+// ------------------------------------------------------------------
 // ValueErrorIterator
-// --------------------------------------------------------------------------
+// ------------------------------------------------------------------
 class ValueErrorIterator {
     constructor(iterator) {
         this.iterator = iterator;
@@ -157,7 +135,7 @@ function Create(type, schema, path, value) {
 // --------------------------------------------------------------------------
 function* TAny(schema, references, path, value) { }
 function* TArray(schema, references, path, value) {
-    if (!(0, index_1.IsArray)(value)) {
+    if (!(0, index_8.IsArray)(value)) {
         return yield Create(ValueErrorType.Array, schema, path, value);
     }
     if (IsDefined(schema.minItems) && !(value.length >= schema.minItems)) {
@@ -171,7 +149,7 @@ function* TArray(schema, references, path, value) {
     }
     // prettier-ignore
     if (schema.uniqueItems === true && !((function () { const set = new Set(); for (const element of value) {
-        const hashed = (0, index_6.Hash)(element);
+        const hashed = (0, index_5.Hash)(element);
         if (set.has(hashed)) {
             return false;
         }
@@ -185,24 +163,24 @@ function* TArray(schema, references, path, value) {
     if (!(IsDefined(schema.contains) || IsDefined(schema.minContains) || IsDefined(schema.maxContains))) {
         return;
     }
-    const containsSchema = IsDefined(schema.contains) ? schema.contains : (0, index_8.Never)();
+    const containsSchema = IsDefined(schema.contains) ? schema.contains : (0, index_7.Never)();
     const containsCount = value.reduce((acc, value, index) => (Visit(containsSchema, references, `${path}${index}`, value).next().done === true ? acc + 1 : acc), 0);
     if (containsCount === 0) {
         yield Create(ValueErrorType.ArrayContains, schema, path, value);
     }
-    if ((0, index_1.IsNumber)(schema.minContains) && containsCount < schema.minContains) {
+    if ((0, index_8.IsNumber)(schema.minContains) && containsCount < schema.minContains) {
         yield Create(ValueErrorType.ArrayMinContains, schema, path, value);
     }
-    if ((0, index_1.IsNumber)(schema.maxContains) && containsCount > schema.maxContains) {
+    if ((0, index_8.IsNumber)(schema.maxContains) && containsCount > schema.maxContains) {
         yield Create(ValueErrorType.ArrayMaxContains, schema, path, value);
     }
 }
 function* TAsyncIterator(schema, references, path, value) {
-    if (!(0, index_1.IsAsyncIterator)(value))
+    if (!(0, index_8.IsAsyncIterator)(value))
         yield Create(ValueErrorType.AsyncIterator, schema, path, value);
 }
 function* TBigInt(schema, references, path, value) {
-    if (!(0, index_1.IsBigInt)(value))
+    if (!(0, index_8.IsBigInt)(value))
         return yield Create(ValueErrorType.BigInt, schema, path, value);
     if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {
         yield Create(ValueErrorType.BigIntExclusiveMaximum, schema, path, value);
@@ -221,14 +199,14 @@ function* TBigInt(schema, references, path, value) {
     }
 }
 function* TBoolean(schema, references, path, value) {
-    if (!(0, index_1.IsBoolean)(value))
+    if (!(0, index_8.IsBoolean)(value))
         yield Create(ValueErrorType.Boolean, schema, path, value);
 }
 function* TConstructor(schema, references, path, value) {
     yield* Visit(schema.returns, references, path, value.prototype);
 }
 function* TDate(schema, references, path, value) {
-    if (!(0, index_1.IsDate)(value))
+    if (!(0, index_8.IsDate)(value))
         return yield Create(ValueErrorType.Date, schema, path, value);
     if (IsDefined(schema.exclusiveMaximumTimestamp) && !(value.getTime() < schema.exclusiveMaximumTimestamp)) {
         yield Create(ValueErrorType.DateExclusiveMaximumTimestamp, schema, path, value);
@@ -247,11 +225,11 @@ function* TDate(schema, references, path, value) {
     }
 }
 function* TFunction(schema, references, path, value) {
-    if (!(0, index_1.IsFunction)(value))
+    if (!(0, index_8.IsFunction)(value))
         yield Create(ValueErrorType.Function, schema, path, value);
 }
 function* TInteger(schema, references, path, value) {
-    if (!(0, index_1.IsInteger)(value))
+    if (!(0, index_8.IsInteger)(value))
         return yield Create(ValueErrorType.Integer, schema, path, value);
     if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {
         yield Create(ValueErrorType.IntegerExclusiveMaximum, schema, path, value);
@@ -278,7 +256,7 @@ function* TIntersect(schema, references, path, value) {
         }
     }
     if (schema.unevaluatedProperties === false) {
-        const keyCheck = new RegExp((0, index_3.KeyOfPattern)(schema));
+        const keyCheck = new RegExp((0, index_2.KeyOfPattern)(schema));
         for (const valueKey of Object.getOwnPropertyNames(value)) {
             if (!keyCheck.test(valueKey)) {
                 yield Create(ValueErrorType.IntersectUnevaluatedProperties, schema, `${path}/${valueKey}`, value);
@@ -286,7 +264,7 @@ function* TIntersect(schema, references, path, value) {
         }
     }
     if (typeof schema.unevaluatedProperties === 'object') {
-        const keyCheck = new RegExp((0, index_3.KeyOfPattern)(schema));
+        const keyCheck = new RegExp((0, index_2.KeyOfPattern)(schema));
         for (const valueKey of Object.getOwnPropertyNames(value)) {
             if (!keyCheck.test(valueKey)) {
                 const next = Visit(schema.unevaluatedProperties, references, `${path}/${valueKey}`, value[valueKey]).next();
@@ -297,7 +275,7 @@ function* TIntersect(schema, references, path, value) {
     }
 }
 function* TIterator(schema, references, path, value) {
-    if (!(0, index_1.IsIterator)(value))
+    if (!(0, index_8.IsIterator)(value))
         yield Create(ValueErrorType.Iterator, schema, path, value);
 }
 function* TLiteral(schema, references, path, value) {
@@ -312,11 +290,11 @@ function* TNot(schema, references, path, value) {
         yield Create(ValueErrorType.Not, schema, path, value);
 }
 function* TNull(schema, references, path, value) {
-    if (!(0, index_1.IsNull)(value))
+    if (!(0, index_8.IsNull)(value))
         yield Create(ValueErrorType.Null, schema, path, value);
 }
 function* TNumber(schema, references, path, value) {
-    if (!index_2.TypeSystemPolicy.IsNumberLike(value))
+    if (!index_1.TypeSystemPolicy.IsNumberLike(value))
         return yield Create(ValueErrorType.Number, schema, path, value);
     if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {
         yield Create(ValueErrorType.NumberExclusiveMaximum, schema, path, value);
@@ -335,7 +313,7 @@ function* TNumber(schema, references, path, value) {
     }
 }
 function* TObject(schema, references, path, value) {
-    if (!index_2.TypeSystemPolicy.IsObjectLike(value))
+    if (!index_1.TypeSystemPolicy.IsObjectLike(value))
         return yield Create(ValueErrorType.Object, schema, path, value);
     if (IsDefined(schema.minProperties) && !(Object.getOwnPropertyNames(value).length >= schema.minProperties)) {
         yield Create(ValueErrorType.ObjectMinProperties, schema, path, value);
@@ -374,18 +352,18 @@ function* TObject(schema, references, path, value) {
             }
         }
         else {
-            if (index_2.TypeSystemPolicy.IsExactOptionalProperty(value, knownKey)) {
+            if (index_1.TypeSystemPolicy.IsExactOptionalProperty(value, knownKey)) {
                 yield* Visit(property, references, `${path}/${EscapeKey(knownKey)}`, value[knownKey]);
             }
         }
     }
 }
 function* TPromise(schema, references, path, value) {
-    if (!(0, index_1.IsPromise)(value))
+    if (!(0, index_8.IsPromise)(value))
         yield Create(ValueErrorType.Promise, schema, path, value);
 }
 function* TRecord(schema, references, path, value) {
-    if (!index_2.TypeSystemPolicy.IsRecordLike(value))
+    if (!index_1.TypeSystemPolicy.IsRecordLike(value))
         return yield Create(ValueErrorType.Object, schema, path, value);
     if (IsDefined(schema.minProperties) && !(Object.getOwnPropertyNames(value).length >= schema.minProperties)) {
         yield Create(ValueErrorType.ObjectMinProperties, schema, path, value);
@@ -414,10 +392,10 @@ function* TRecord(schema, references, path, value) {
     }
 }
 function* TRef(schema, references, path, value) {
-    yield* Visit((0, index_5.Deref)(schema, references), references, path, value);
+    yield* Visit((0, index_4.Deref)(schema, references), references, path, value);
 }
 function* TString(schema, references, path, value) {
-    if (!(0, index_1.IsString)(value))
+    if (!(0, index_8.IsString)(value))
         return yield Create(ValueErrorType.String, schema, path, value);
     if (IsDefined(schema.minLength) && !(value.length >= schema.minLength)) {
         yield Create(ValueErrorType.StringMinLength, schema, path, value);
@@ -425,18 +403,18 @@ function* TString(schema, references, path, value) {
     if (IsDefined(schema.maxLength) && !(value.length <= schema.maxLength)) {
         yield Create(ValueErrorType.StringMaxLength, schema, path, value);
     }
-    if ((0, index_1.IsString)(schema.pattern)) {
+    if ((0, index_8.IsString)(schema.pattern)) {
         const regex = new RegExp(schema.pattern);
         if (!regex.test(value)) {
             yield Create(ValueErrorType.StringPattern, schema, path, value);
         }
     }
-    if ((0, index_1.IsString)(schema.format)) {
-        if (!index_4.FormatRegistry.Has(schema.format)) {
+    if ((0, index_8.IsString)(schema.format)) {
+        if (!index_3.FormatRegistry.Has(schema.format)) {
             yield Create(ValueErrorType.StringFormatUnknown, schema, path, value);
         }
         else {
-            const format = index_4.FormatRegistry.Get(schema.format);
+            const format = index_3.FormatRegistry.Get(schema.format);
             if (!format(value)) {
                 yield Create(ValueErrorType.StringFormat, schema, path, value);
             }
@@ -444,11 +422,11 @@ function* TString(schema, references, path, value) {
     }
 }
 function* TSymbol(schema, references, path, value) {
-    if (!(0, index_1.IsSymbol)(value))
+    if (!(0, index_8.IsSymbol)(value))
         yield Create(ValueErrorType.Symbol, schema, path, value);
 }
 function* TTemplateLiteral(schema, references, path, value) {
-    if (!(0, index_1.IsString)(value))
+    if (!(0, index_8.IsString)(value))
         return yield Create(ValueErrorType.String, schema, path, value);
     const regex = new RegExp(schema.pattern);
     if (!regex.test(value)) {
@@ -456,10 +434,10 @@ function* TTemplateLiteral(schema, references, path, value) {
     }
 }
 function* TThis(schema, references, path, value) {
-    yield* Visit((0, index_5.Deref)(schema, references), references, path, value);
+    yield* Visit((0, index_4.Deref)(schema, references), references, path, value);
 }
 function* TTuple(schema, references, path, value) {
-    if (!(0, index_1.IsArray)(value))
+    if (!(0, index_8.IsArray)(value))
         return yield Create(ValueErrorType.Tuple, schema, path, value);
     if (schema.items === undefined && !(value.length === 0)) {
         return yield Create(ValueErrorType.TupleLength, schema, path, value);
@@ -475,7 +453,7 @@ function* TTuple(schema, references, path, value) {
     }
 }
 function* TUndefined(schema, references, path, value) {
-    if (!(0, index_1.IsUndefined)(value))
+    if (!(0, index_8.IsUndefined)(value))
         yield Create(ValueErrorType.Undefined, schema, path, value);
 }
 function* TUnion(schema, references, path, value) {
@@ -491,7 +469,7 @@ function* TUnion(schema, references, path, value) {
     }
 }
 function* TUint8Array(schema, references, path, value) {
-    if (!(0, index_1.IsUint8Array)(value))
+    if (!(0, index_8.IsUint8Array)(value))
         return yield Create(ValueErrorType.Uint8Array, schema, path, value);
     if (IsDefined(schema.maxByteLength) && !(value.length <= schema.maxByteLength)) {
         yield Create(ValueErrorType.Uint8ArrayMaxByteLength, schema, path, value);
@@ -502,18 +480,18 @@ function* TUint8Array(schema, references, path, value) {
 }
 function* TUnknown(schema, references, path, value) { }
 function* TVoid(schema, references, path, value) {
-    if (!index_2.TypeSystemPolicy.IsVoidLike(value))
+    if (!index_1.TypeSystemPolicy.IsVoidLike(value))
         yield Create(ValueErrorType.Void, schema, path, value);
 }
 function* TKind(schema, references, path, value) {
-    const check = index_4.TypeRegistry.Get(schema[index_7.Kind]);
+    const check = index_3.TypeRegistry.Get(schema[index_6.Kind]);
     if (!check(schema, value))
         yield Create(ValueErrorType.Kind, schema, path, value);
 }
 function* Visit(schema, references, path, value) {
     const references_ = IsDefined(schema.$id) ? [...references, schema] : references;
     const schema_ = schema;
-    switch (schema_[index_7.Kind]) {
+    switch (schema_[index_6.Kind]) {
         case 'Any':
             return yield* TAny(schema_, references_, path, value);
         case 'Array':
@@ -575,7 +553,7 @@ function* Visit(schema, references, path, value) {
         case 'Void':
             return yield* TVoid(schema_, references_, path, value);
         default:
-            if (!index_4.TypeRegistry.Has(schema_[index_7.Kind]))
+            if (!index_3.TypeRegistry.Has(schema_[index_6.Kind]))
                 throw new ValueErrorsUnknownTypeError(schema);
             return yield* TKind(schema_, references_, path, value);
     }

package/build/require/errors/function.js

@@ -1,31 +1,5 @@
 "use strict";
-/*--------------------------------------------------------------------------
 
-@sinclair/typebox/system
-
-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.GetErrorFunction = exports.SetErrorFunction = exports.DefaultErrorFunction = void 0;
 const index_1 = require("../type/symbols/index");

package/build/require/errors/index.js

@@ -1,31 +1,5 @@
 "use strict";
-/*--------------------------------------------------------------------------
 
-@sinclair/typebox/errors
-
-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.SetErrorFunction = exports.GetErrorFunction = exports.DefaultErrorFunction = exports.ValueErrorsUnknownTypeError = exports.ValueErrorType = exports.ValueErrorIterator = exports.Errors = void 0;
 var errors_1 = require("./errors");

package/build/require/index.js

@@ -1,31 +1,5 @@
 "use strict";
-/*--------------------------------------------------------------------------
 
-@sinclair/typebox
-
-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.Lowercase = exports.Capitalize = exports.IntrinsicFromMappedKey = exports.Intrinsic = exports.Iterator = exports.IntersectEvaluated = exports.Intersect = exports.Integer = exports.InstanceType = exports.IndexFromMappedKey = exports.IndexPropertyKeys = exports.Index = exports.Increment = exports.Function = exports.Extract = exports.ExtendsUndefinedCheck = exports.ExtendsResult = exports.ExtendsCheck = exports.Extends = exports.Exclude = exports.Enum = exports.Deref = exports.Date = exports.ConstructorParameters = exports.Constructor = exports.Const = exports.Composite = exports.Boolean = exports.BigInt = exports.Awaited = exports.AsyncIterator = exports.Array = exports.Any = exports.CloneRest = exports.CloneType = exports.ValueGuard = exports.TypeGuard = exports.FormatRegistry = exports.TypeRegistry = exports.PatternStringExact = exports.PatternString = exports.PatternNumberExact = exports.PatternNumber = exports.PatternBooleanExact = exports.PatternBoolean = exports.TransformKind = exports.OptionalKind = exports.ReadonlyKind = exports.Hint = exports.Kind = void 0;
 exports.Type = exports.Void = exports.Unsafe = exports.Unknown = exports.UnionEvaluated = exports.Union = exports.Undefined = exports.Uint8Array = exports.Tuple = exports.TransformEncodeBuilder = exports.TransformDecodeBuilder = exports.Transform = exports.TemplateLiteralGenerate = exports.TemplateLiteralParseExact = exports.TemplateLiteralParse = exports.IsTemplateLiteralFinite = exports.TemplateLiteral = exports.Symbol = exports.String = exports.Strict = exports.ReturnType = exports.Rest = exports.Required = exports.RegExp = exports.Ref = exports.Recursive = exports.Record = exports.ReadonlyOptional = exports.Readonly = exports.Promise = exports.Pick = exports.PartialFromMappedResult = exports.Partial = exports.Parameters = exports.Optional = exports.Omit = exports.Object = exports.Number = exports.Null = exports.Not = exports.Never = exports.MappedResult = exports.MappedKey = exports.Mapped = exports.Literal = exports.KeyOfPattern = exports.KeyOfPropertyKeys = exports.KeyOf = exports.Uppercase = exports.Uncapitalize = void 0;

package/build/require/system/index.js

@@ -1,31 +1,5 @@
 "use strict";
-/*--------------------------------------------------------------------------
 
-@sinclair/typebox/system
-
-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.TypeSystemDuplicateTypeKind = exports.TypeSystemDuplicateFormat = exports.TypeSystem = exports.TypeSystemPolicy = void 0;
 var policy_1 = require("./policy");

package/build/require/system/policy.js

@@ -1,31 +1,5 @@
 "use strict";
-/*--------------------------------------------------------------------------
 
-@sinclair/typebox/system
-
-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.TypeSystemPolicy = void 0;
 const index_1 = require("../value/guard/index");

package/build/require/system/system.js

@@ -1,31 +1,5 @@
 "use strict";
-/*--------------------------------------------------------------------------
 
-@sinclair/typebox/system
-
-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.TypeSystem = exports.TypeSystemDuplicateFormat = exports.TypeSystemDuplicateTypeKind = void 0;
 const index_1 = require("../type/registry/index");

package/build/require/type/any/any.js

@@ -1,31 +1,5 @@
 "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.Any = void 0;
 const index_1 = require("../symbols/index");

package/build/require/type/any/index.js

@@ -1,31 +1,5 @@
 "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.
-
----------------------------------------------------------------------------*/
 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/type/array/array.js

@@ -1,31 +1,5 @@
 "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.Array = void 0;
 const index_1 = require("../symbols/index");