@sinclair/typebox 0.31.28 → 0.32.0-dev-2

package/esm/value/cast/index.mjs

@@ -0,0 +1,28 @@
+/*--------------------------------------------------------------------------
+
+@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.
+
+---------------------------------------------------------------------------*/
+export * from './cast.mjs';

package/esm/value/check/check.d.mts

@@ -0,0 +1,10 @@
+import type { TSchema } from '../../type/schema/index.mjs';
+import type { Static } from '../../type/static/index.mjs';
+export declare class ValueCheckUnknownTypeError extends Error {
+    readonly schema: TSchema;
+    constructor(schema: TSchema);
+}
+/** Returns true if the value matches the given type. */
+export declare function Check<T extends TSchema>(schema: T, references: TSchema[], value: unknown): value is Static<T>;
+/** Returns true if the value matches the given type. */
+export declare function Check<T extends TSchema>(schema: T, value: unknown): value is Static<T>;

package/{value/check.js → esm/value/check/check.mjs}

@@ -1,4 +1,3 @@
-"use strict";
 /*--------------------------------------------------------------------------
 
 @sinclair/typebox/value
@@ -26,28 +25,31 @@ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 THE SOFTWARE.
 
 ---------------------------------------------------------------------------*/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Check = exports.ValueCheckUnknownTypeError = void 0;
-const guard_1 = require("./guard");
-const index_1 = require("../system/index");
-const deref_1 = require("./deref");
-const hash_1 = require("./hash");
-const Types = require("../typebox");
+import { IsArray, IsUint8Array, IsDate, IsPromise, IsFunction, IsAsyncIterator, IsIterator, IsBoolean, IsNumber, IsBigInt, IsString, IsSymbol, IsInteger, IsNull, IsUndefined } from '../guard/index.mjs';
+import { TypeSystemPolicy } from '../../system/index.mjs';
+import { Deref } from '../deref/index.mjs';
+import { Hash } from '../hash/index.mjs';
+import { Kind } from '../../type/symbols/index.mjs';
+import { KeyOfStringResolvePattern } from '../../type/keyof/index.mjs';
+import { ExtendsUndefinedCheck } from '../../type/extends/index.mjs';
+import { TSchema as IsSchemaType } from '../../type/guard/type.mjs';
+import { TypeRegistry, FormatRegistry } from '../../type/registry/index.mjs';
+import { Never } from '../../type/never/index.mjs';
 // --------------------------------------------------------------------------
 // Errors
 // --------------------------------------------------------------------------
-class ValueCheckUnknownTypeError extends Types.TypeBoxError {
+export class ValueCheckUnknownTypeError extends Error {
+    schema;
     constructor(schema) {
         super(`Unknown type`);
         this.schema = schema;
     }
 }
-exports.ValueCheckUnknownTypeError = ValueCheckUnknownTypeError;
 // --------------------------------------------------------------------------
 // TypeGuards
 // --------------------------------------------------------------------------
 function IsAnyOrUnknown(schema) {
-    return schema[Types.Kind] === 'Any' || schema[Types.Kind] === 'Unknown';
+    return schema[Kind] === 'Any' || schema[Kind] === 'Unknown';
 }
 // --------------------------------------------------------------------------
 // Guards
@@ -62,7 +64,7 @@ function TAny(schema, references, value) {
     return true;
 }
 function TArray(schema, references, value) {
-    if (!(0, guard_1.IsArray)(value))
+    if (!IsArray(value))
         return false;
     if (IsDefined(schema.minItems) && !(value.length >= schema.minItems)) {
         return false;
@@ -75,7 +77,7 @@ function TArray(schema, references, value) {
     }
     // prettier-ignore
     if (schema.uniqueItems === true && !((function () { const set = new Set(); for (const element of value) {
-        const hashed = (0, hash_1.Hash)(element);
+        const hashed = Hash(element);
         if (set.has(hashed)) {
             return false;
         }
@@ -86,27 +88,27 @@ function TArray(schema, references, value) {
         return false;
     }
     // contains
-    if (!(IsDefined(schema.contains) || (0, guard_1.IsNumber)(schema.minContains) || (0, guard_1.IsNumber)(schema.maxContains))) {
+    if (!(IsDefined(schema.contains) || IsNumber(schema.minContains) || IsNumber(schema.maxContains))) {
         return true; // exit
     }
-    const containsSchema = IsDefined(schema.contains) ? schema.contains : Types.Type.Never();
+    const containsSchema = IsDefined(schema.contains) ? schema.contains : Never();
     const containsCount = value.reduce((acc, value) => (Visit(containsSchema, references, value) ? acc + 1 : acc), 0);
     if (containsCount === 0) {
         return false;
     }
-    if ((0, guard_1.IsNumber)(schema.minContains) && containsCount < schema.minContains) {
+    if (IsNumber(schema.minContains) && containsCount < schema.minContains) {
         return false;
     }
-    if ((0, guard_1.IsNumber)(schema.maxContains) && containsCount > schema.maxContains) {
+    if (IsNumber(schema.maxContains) && containsCount > schema.maxContains) {
         return false;
     }
     return true;
 }
 function TAsyncIterator(schema, references, value) {
-    return (0, guard_1.IsAsyncIterator)(value);
+    return IsAsyncIterator(value);
 }
 function TBigInt(schema, references, value) {
-    if (!(0, guard_1.IsBigInt)(value))
+    if (!IsBigInt(value))
         return false;
     if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {
         return false;
@@ -126,13 +128,13 @@ function TBigInt(schema, references, value) {
     return true;
 }
 function TBoolean(schema, references, value) {
-    return (0, guard_1.IsBoolean)(value);
+    return IsBoolean(value);
 }
 function TConstructor(schema, references, value) {
     return Visit(schema.returns, references, value.prototype);
 }
 function TDate(schema, references, value) {
-    if (!(0, guard_1.IsDate)(value))
+    if (!IsDate(value))
         return false;
     if (IsDefined(schema.exclusiveMaximumTimestamp) && !(value.getTime() < schema.exclusiveMaximumTimestamp)) {
         return false;
@@ -152,10 +154,10 @@ function TDate(schema, references, value) {
     return true;
 }
 function TFunction(schema, references, value) {
-    return (0, guard_1.IsFunction)(value);
+    return IsFunction(value);
 }
 function TInteger(schema, references, value) {
-    if (!(0, guard_1.IsInteger)(value)) {
+    if (!IsInteger(value)) {
         return false;
     }
     if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {
@@ -178,12 +180,12 @@ function TInteger(schema, references, value) {
 function TIntersect(schema, references, value) {
     const check1 = schema.allOf.every((schema) => Visit(schema, references, value));
     if (schema.unevaluatedProperties === false) {
-        const keyPattern = new RegExp(Types.KeyResolver.ResolvePattern(schema));
+        const keyPattern = new RegExp(KeyOfStringResolvePattern(schema));
         const check2 = Object.getOwnPropertyNames(value).every((key) => keyPattern.test(key));
         return check1 && check2;
     }
-    else if (Types.TypeGuard.TSchema(schema.unevaluatedProperties)) {
-        const keyCheck = new RegExp(Types.KeyResolver.ResolvePattern(schema));
+    else if (IsSchemaType(schema.unevaluatedProperties)) {
+        const keyCheck = new RegExp(KeyOfStringResolvePattern(schema));
         const check2 = Object.getOwnPropertyNames(value).every((key) => keyCheck.test(key) || Visit(schema.unevaluatedProperties, references, value[key]));
         return check1 && check2;
     }
@@ -192,7 +194,7 @@ function TIntersect(schema, references, value) {
     }
 }
 function TIterator(schema, references, value) {
-    return (0, guard_1.IsIterator)(value);
+    return IsIterator(value);
 }
 function TLiteral(schema, references, value) {
     return value === schema.const;
@@ -204,10 +206,10 @@ function TNot(schema, references, value) {
     return !Visit(schema.not, references, value);
 }
 function TNull(schema, references, value) {
-    return (0, guard_1.IsNull)(value);
+    return IsNull(value);
 }
 function TNumber(schema, references, value) {
-    if (!index_1.TypeSystemPolicy.IsNumberLike(value))
+    if (!TypeSystemPolicy.IsNumberLike(value))
         return false;
     if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {
         return false;
@@ -227,7 +229,7 @@ function TNumber(schema, references, value) {
     return true;
 }
 function TObject(schema, references, value) {
-    if (!index_1.TypeSystemPolicy.IsObjectLike(value))
+    if (!TypeSystemPolicy.IsObjectLike(value))
         return false;
     if (IsDefined(schema.minProperties) && !(Object.getOwnPropertyNames(value).length >= schema.minProperties)) {
         return false;
@@ -242,12 +244,12 @@ function TObject(schema, references, value) {
             if (!Visit(property, references, value[knownKey])) {
                 return false;
             }
-            if ((Types.ExtendsUndefined.Check(property) || IsAnyOrUnknown(property)) && !(knownKey in value)) {
+            if ((ExtendsUndefinedCheck(property) || IsAnyOrUnknown(property)) && !(knownKey in value)) {
                 return false;
             }
         }
         else {
-            if (index_1.TypeSystemPolicy.IsExactOptionalProperty(value, knownKey) && !Visit(property, references, value[knownKey])) {
+            if (TypeSystemPolicy.IsExactOptionalProperty(value, knownKey) && !Visit(property, references, value[knownKey])) {
                 return false;
             }
         }
@@ -271,10 +273,10 @@ function TObject(schema, references, value) {
     }
 }
 function TPromise(schema, references, value) {
-    return (0, guard_1.IsPromise)(value);
+    return IsPromise(value);
 }
 function TRecord(schema, references, value) {
-    if (!index_1.TypeSystemPolicy.IsRecordLike(value)) {
+    if (!TypeSystemPolicy.IsRecordLike(value)) {
         return false;
     }
     if (IsDefined(schema.minProperties) && !(Object.getOwnPropertyNames(value).length >= schema.minProperties)) {
@@ -301,10 +303,10 @@ function TRecord(schema, references, value) {
     return check1 && check2 && check3;
 }
 function TRef(schema, references, value) {
-    return Visit((0, deref_1.Deref)(schema, references), references, value);
+    return Visit(Deref(schema, references), references, value);
 }
 function TString(schema, references, value) {
-    if (!(0, guard_1.IsString)(value)) {
+    if (!IsString(value)) {
         return false;
     }
     if (IsDefined(schema.minLength)) {
@@ -321,24 +323,24 @@ function TString(schema, references, value) {
             return false;
     }
     if (IsDefined(schema.format)) {
-        if (!Types.FormatRegistry.Has(schema.format))
+        if (!FormatRegistry.Has(schema.format))
             return false;
-        const func = Types.FormatRegistry.Get(schema.format);
+        const func = FormatRegistry.Get(schema.format);
         return func(value);
     }
     return true;
 }
 function TSymbol(schema, references, value) {
-    return (0, guard_1.IsSymbol)(value);
+    return IsSymbol(value);
 }
 function TTemplateLiteral(schema, references, value) {
-    return (0, guard_1.IsString)(value) && new RegExp(schema.pattern).test(value);
+    return IsString(value) && new RegExp(schema.pattern).test(value);
 }
 function TThis(schema, references, value) {
-    return Visit((0, deref_1.Deref)(schema, references), references, value);
+    return Visit(Deref(schema, references), references, value);
 }
 function TTuple(schema, references, value) {
-    if (!(0, guard_1.IsArray)(value)) {
+    if (!IsArray(value)) {
         return false;
     }
     if (schema.items === undefined && !(value.length === 0)) {
@@ -357,13 +359,13 @@ function TTuple(schema, references, value) {
     return true;
 }
 function TUndefined(schema, references, value) {
-    return (0, guard_1.IsUndefined)(value);
+    return IsUndefined(value);
 }
 function TUnion(schema, references, value) {
     return schema.anyOf.some((inner) => Visit(inner, references, value));
 }
 function TUint8Array(schema, references, value) {
-    if (!(0, guard_1.IsUint8Array)(value)) {
+    if (!IsUint8Array(value)) {
         return false;
     }
     if (IsDefined(schema.maxByteLength) && !(value.length <= schema.maxByteLength)) {
@@ -378,18 +380,18 @@ function TUnknown(schema, references, value) {
     return true;
 }
 function TVoid(schema, references, value) {
-    return index_1.TypeSystemPolicy.IsVoidLike(value);
+    return TypeSystemPolicy.IsVoidLike(value);
 }
 function TKind(schema, references, value) {
-    if (!Types.TypeRegistry.Has(schema[Types.Kind]))
+    if (!TypeRegistry.Has(schema[Kind]))
         return false;
-    const func = Types.TypeRegistry.Get(schema[Types.Kind]);
+    const func = TypeRegistry.Get(schema[Kind]);
     return func(schema, value);
 }
 function Visit(schema, references, value) {
     const references_ = IsDefined(schema.$id) ? [...references, schema] : references;
     const schema_ = schema;
-    switch (schema_[Types.Kind]) {
+    switch (schema_[Kind]) {
         case 'Any':
             return TAny(schema_, references_, value);
         case 'Array':
@@ -451,13 +453,12 @@ function Visit(schema, references, value) {
         case 'Void':
             return TVoid(schema_, references_, value);
         default:
-            if (!Types.TypeRegistry.Has(schema_[Types.Kind]))
+            if (!TypeRegistry.Has(schema_[Kind]))
                 throw new ValueCheckUnknownTypeError(schema_);
             return TKind(schema_, references_, value);
     }
 }
 /** Returns true if the value matches the given type. */
-function Check(...args) {
+export function Check(...args) {
     return args.length === 3 ? Visit(args[0], args[1], args[2]) : Visit(args[0], [], args[1]);
 }
-exports.Check = Check;

package/esm/value/check/index.d.mts

@@ -0,0 +1 @@
+export * from './check.mjs';

package/esm/value/check/index.mjs

@@ -0,0 +1,28 @@
+/*--------------------------------------------------------------------------
+
+@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.
+
+---------------------------------------------------------------------------*/
+export * from './check.mjs';

package/esm/value/clean/clean.d.mts

@@ -0,0 +1,5 @@
+import type { TSchema } from '../../type/schema/index.mjs';
+/** `[Mutable]` Removes excess properties from a value and returns the result. This function does not check the value and returns an unknown type. You should Check the result before use. Clean is a mutable operation. To avoid mutation, Clone the value first. */
+export declare function Clean<T extends TSchema>(schema: T, references: TSchema[], value: unknown): unknown;
+/** `[Mutable]` Removes excess properties from a value and returns the result. This function does not check the value and returns an unknown type. You should Check the result before use. Clean is a mutable operation. To avoid mutation, Clone the value first. */
+export declare function Clean<T extends TSchema>(schema: T): unknown;

package/esm/value/clean/clean.mjs

@@ -0,0 +1,163 @@
+/*--------------------------------------------------------------------------
+
+@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.
+
+---------------------------------------------------------------------------*/
+import { IsString, IsObject, IsArray, IsUndefined } from '../guard/index.mjs';
+import { TSchema as IsSchemaType } from '../../type/guard/type.mjs';
+import { KeyOfStringResolve } from '../../type/keyof/keyof-string.mjs';
+import { Check } from '../check/index.mjs';
+import { Clone } from '../clone/index.mjs';
+import { Deref } from '../deref/index.mjs';
+import { Kind } from '../../type/symbols/index.mjs';
+// ------------------------------------------------------------------
+// IsSchema
+// ------------------------------------------------------------------
+function IsSchema(schema) {
+    return IsSchemaType(schema);
+}
+// ------------------------------------------------------------------
+// IsCheckable
+// ------------------------------------------------------------------
+function IsCheckable(schema) {
+    return IsSchemaType(schema) && schema[Kind] !== 'Unsafe';
+}
+// ------------------------------------------------------------------
+// Types
+// ------------------------------------------------------------------
+function TArray(schema, references, value) {
+    if (!IsArray(value))
+        return value;
+    return value.map((value) => Visit(schema.items, references, value));
+}
+function TIntersect(schema, references, value) {
+    const unevaluatedProperties = schema.unevaluatedProperties;
+    const intersections = schema.allOf.map((schema) => Visit(schema, references, Clone(value)));
+    const composite = intersections.reduce((acc, value) => (IsObject(value) ? { ...acc, ...value } : value), {});
+    if (!IsObject(value) || !IsObject(composite) || !IsSchema(unevaluatedProperties))
+        return composite;
+    const knownkeys = KeyOfStringResolve(schema);
+    for (const key of Object.getOwnPropertyNames(value)) {
+        if (knownkeys.includes(key))
+            continue;
+        if (Check(unevaluatedProperties, references, value[key])) {
+            composite[key] = Visit(unevaluatedProperties, references, value[key]);
+        }
+    }
+    return composite;
+}
+function TObject(schema, references, value) {
+    if (!IsObject(value) || IsArray(value))
+        return value; // Check IsArray for AllowArrayObject configuration
+    const additionalProperties = schema.additionalProperties;
+    for (const key of Object.getOwnPropertyNames(value)) {
+        if (key in schema.properties) {
+            value[key] = Visit(schema.properties[key], references, value[key]);
+            continue;
+        }
+        if (IsSchema(additionalProperties) && Check(additionalProperties, references, value[key])) {
+            value[key] = Visit(additionalProperties, references, value[key]);
+            continue;
+        }
+        delete value[key];
+    }
+    return value;
+}
+function TRecord(schema, references, value) {
+    if (!IsObject(value))
+        return value;
+    const additionalProperties = schema.additionalProperties;
+    const propertyKeys = Object.keys(value);
+    const [propertyKey, propertySchema] = Object.entries(schema.patternProperties)[0];
+    const propertyKeyTest = new RegExp(propertyKey);
+    for (const key of propertyKeys) {
+        if (propertyKeyTest.test(key)) {
+            value[key] = Visit(propertySchema, references, value[key]);
+            continue;
+        }
+        if (IsSchema(additionalProperties) && Check(additionalProperties, references, value[key])) {
+            value[key] = Visit(additionalProperties, references, value[key]);
+            continue;
+        }
+        delete value[key];
+    }
+    return value;
+}
+function TRef(schema, references, value) {
+    return Visit(Deref(schema, references), references, value);
+}
+function TThis(schema, references, value) {
+    return Visit(Deref(schema, references), references, value);
+}
+function TTuple(schema, references, value) {
+    if (!IsArray(value))
+        return value;
+    if (IsUndefined(schema.items))
+        return [];
+    const length = Math.min(value.length, schema.items.length);
+    for (let i = 0; i < length; i++) {
+        value[i] = Visit(schema.items[i], references, value[i]);
+    }
+    // prettier-ignore
+    return value.length > length
+        ? value.slice(0, length)
+        : value;
+}
+function TUnion(schema, references, value) {
+    for (const inner of schema.anyOf) {
+        if (IsCheckable(inner) && Check(inner, value)) {
+            return Visit(inner, references, value);
+        }
+    }
+    return value;
+}
+function Visit(schema, references, value) {
+    const references_ = IsString(schema.$id) ? [...references, schema] : references;
+    const schema_ = schema;
+    switch (schema_[Kind]) {
+        case 'Array':
+            return TArray(schema_, references_, value);
+        case 'Intersect':
+            return TIntersect(schema_, references_, value);
+        case 'Object':
+            return TObject(schema_, references_, value);
+        case 'Record':
+            return TRecord(schema_, references_, value);
+        case 'Ref':
+            return TRef(schema_, references_, value);
+        case 'This':
+            return TThis(schema_, references_, value);
+        case 'Tuple':
+            return TTuple(schema_, references_, value);
+        case 'Union':
+            return TUnion(schema_, references_, value);
+        default:
+            return value;
+    }
+}
+/** `[Mutable]` Removes excess properties from a value and returns the result. This function does not check the value and returns an unknown type. You should Check the result before use. Clean is a mutable operation. To avoid mutation, Clone the value first. */
+export function Clean(...args) {
+    return args.length === 3 ? Visit(args[0], args[1], args[2]) : Visit(args[0], [], args[1]);
+}

package/esm/value/clean/index.d.mts

@@ -0,0 +1 @@
+export * from './clean.mjs';

package/esm/value/clean/index.mjs

@@ -0,0 +1,28 @@
+/*--------------------------------------------------------------------------
+
+@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.
+
+---------------------------------------------------------------------------*/
+export * from './clean.mjs';

package/esm/value/clone/clone.mjs

@@ -0,0 +1,64 @@
+/*--------------------------------------------------------------------------
+
+@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.
+
+---------------------------------------------------------------------------*/
+import { IsArray, IsDate, IsPlainObject, IsTypedArray, IsValueType } from '../guard/index.mjs';
+// --------------------------------------------------------------------------
+// Clonable
+// --------------------------------------------------------------------------
+function ObjectType(value) {
+    const keys = [...Object.getOwnPropertyNames(value), ...Object.getOwnPropertySymbols(value)];
+    return keys.reduce((acc, key) => ({ ...acc, [key]: Clone(value[key]) }), {});
+}
+function ArrayType(value) {
+    return value.map((element) => Clone(element));
+}
+function TypedArrayType(value) {
+    return value.slice();
+}
+function DateType(value) {
+    return new Date(value.toISOString());
+}
+function ValueType(value) {
+    return value;
+}
+// --------------------------------------------------------------------------
+// Clone
+// --------------------------------------------------------------------------
+/** Returns a clone of the given value */
+export function Clone(value) {
+    if (IsArray(value))
+        return ArrayType(value);
+    if (IsDate(value))
+        return DateType(value);
+    if (IsPlainObject(value))
+        return ObjectType(value);
+    if (IsTypedArray(value))
+        return TypedArrayType(value);
+    if (IsValueType(value))
+        return ValueType(value);
+    throw new Error('ValueClone: Unable to clone value');
+}

package/esm/value/clone/index.d.mts

@@ -0,0 +1 @@
+export * from './clone.mjs';

package/esm/value/clone/index.mjs

@@ -0,0 +1,28 @@
+/*--------------------------------------------------------------------------
+
+@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.
+
+---------------------------------------------------------------------------*/
+export * from './clone.mjs';