@sinclair/typebox 0.32.0-dev-1 → 0.32.0-dev-2

package/esm/value/check/check.mjs

@@ -0,0 +1,464 @@
+/*--------------------------------------------------------------------------
+
+@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, 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
+// --------------------------------------------------------------------------
+export class ValueCheckUnknownTypeError extends Error {
+    schema;
+    constructor(schema) {
+        super(`Unknown type`);
+        this.schema = schema;
+    }
+}
+// --------------------------------------------------------------------------
+// TypeGuards
+// --------------------------------------------------------------------------
+function IsAnyOrUnknown(schema) {
+    return schema[Kind] === 'Any' || schema[Kind] === 'Unknown';
+}
+// --------------------------------------------------------------------------
+// Guards
+// --------------------------------------------------------------------------
+function IsDefined(value) {
+    return value !== undefined;
+}
+// --------------------------------------------------------------------------
+// Types
+// --------------------------------------------------------------------------
+function TAny(schema, references, value) {
+    return true;
+}
+function TArray(schema, references, value) {
+    if (!IsArray(value))
+        return false;
+    if (IsDefined(schema.minItems) && !(value.length >= schema.minItems)) {
+        return false;
+    }
+    if (IsDefined(schema.maxItems) && !(value.length <= schema.maxItems)) {
+        return false;
+    }
+    if (!value.every((value) => Visit(schema.items, references, value))) {
+        return false;
+    }
+    // prettier-ignore
+    if (schema.uniqueItems === true && !((function () { const set = new Set(); for (const element of value) {
+        const hashed = Hash(element);
+        if (set.has(hashed)) {
+            return false;
+        }
+        else {
+            set.add(hashed);
+        }
+    } return true; })())) {
+        return false;
+    }
+    // contains
+    if (!(IsDefined(schema.contains) || IsNumber(schema.minContains) || IsNumber(schema.maxContains))) {
+        return true; // exit
+    }
+    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 (IsNumber(schema.minContains) && containsCount < schema.minContains) {
+        return false;
+    }
+    if (IsNumber(schema.maxContains) && containsCount > schema.maxContains) {
+        return false;
+    }
+    return true;
+}
+function TAsyncIterator(schema, references, value) {
+    return IsAsyncIterator(value);
+}
+function TBigInt(schema, references, value) {
+    if (!IsBigInt(value))
+        return false;
+    if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {
+        return false;
+    }
+    if (IsDefined(schema.exclusiveMinimum) && !(value > schema.exclusiveMinimum)) {
+        return false;
+    }
+    if (IsDefined(schema.maximum) && !(value <= schema.maximum)) {
+        return false;
+    }
+    if (IsDefined(schema.minimum) && !(value >= schema.minimum)) {
+        return false;
+    }
+    if (IsDefined(schema.multipleOf) && !(value % schema.multipleOf === BigInt(0))) {
+        return false;
+    }
+    return true;
+}
+function TBoolean(schema, references, value) {
+    return IsBoolean(value);
+}
+function TConstructor(schema, references, value) {
+    return Visit(schema.returns, references, value.prototype);
+}
+function TDate(schema, references, value) {
+    if (!IsDate(value))
+        return false;
+    if (IsDefined(schema.exclusiveMaximumTimestamp) && !(value.getTime() < schema.exclusiveMaximumTimestamp)) {
+        return false;
+    }
+    if (IsDefined(schema.exclusiveMinimumTimestamp) && !(value.getTime() > schema.exclusiveMinimumTimestamp)) {
+        return false;
+    }
+    if (IsDefined(schema.maximumTimestamp) && !(value.getTime() <= schema.maximumTimestamp)) {
+        return false;
+    }
+    if (IsDefined(schema.minimumTimestamp) && !(value.getTime() >= schema.minimumTimestamp)) {
+        return false;
+    }
+    if (IsDefined(schema.multipleOfTimestamp) && !(value.getTime() % schema.multipleOfTimestamp === 0)) {
+        return false;
+    }
+    return true;
+}
+function TFunction(schema, references, value) {
+    return IsFunction(value);
+}
+function TInteger(schema, references, value) {
+    if (!IsInteger(value)) {
+        return false;
+    }
+    if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {
+        return false;
+    }
+    if (IsDefined(schema.exclusiveMinimum) && !(value > schema.exclusiveMinimum)) {
+        return false;
+    }
+    if (IsDefined(schema.maximum) && !(value <= schema.maximum)) {
+        return false;
+    }
+    if (IsDefined(schema.minimum) && !(value >= schema.minimum)) {
+        return false;
+    }
+    if (IsDefined(schema.multipleOf) && !(value % schema.multipleOf === 0)) {
+        return false;
+    }
+    return true;
+}
+function TIntersect(schema, references, value) {
+    const check1 = schema.allOf.every((schema) => Visit(schema, references, value));
+    if (schema.unevaluatedProperties === false) {
+        const keyPattern = new RegExp(KeyOfStringResolvePattern(schema));
+        const check2 = Object.getOwnPropertyNames(value).every((key) => keyPattern.test(key));
+        return check1 && check2;
+    }
+    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;
+    }
+    else {
+        return check1;
+    }
+}
+function TIterator(schema, references, value) {
+    return IsIterator(value);
+}
+function TLiteral(schema, references, value) {
+    return value === schema.const;
+}
+function TNever(schema, references, value) {
+    return false;
+}
+function TNot(schema, references, value) {
+    return !Visit(schema.not, references, value);
+}
+function TNull(schema, references, value) {
+    return IsNull(value);
+}
+function TNumber(schema, references, value) {
+    if (!TypeSystemPolicy.IsNumberLike(value))
+        return false;
+    if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {
+        return false;
+    }
+    if (IsDefined(schema.exclusiveMinimum) && !(value > schema.exclusiveMinimum)) {
+        return false;
+    }
+    if (IsDefined(schema.minimum) && !(value >= schema.minimum)) {
+        return false;
+    }
+    if (IsDefined(schema.maximum) && !(value <= schema.maximum)) {
+        return false;
+    }
+    if (IsDefined(schema.multipleOf) && !(value % schema.multipleOf === 0)) {
+        return false;
+    }
+    return true;
+}
+function TObject(schema, references, value) {
+    if (!TypeSystemPolicy.IsObjectLike(value))
+        return false;
+    if (IsDefined(schema.minProperties) && !(Object.getOwnPropertyNames(value).length >= schema.minProperties)) {
+        return false;
+    }
+    if (IsDefined(schema.maxProperties) && !(Object.getOwnPropertyNames(value).length <= schema.maxProperties)) {
+        return false;
+    }
+    const knownKeys = Object.getOwnPropertyNames(schema.properties);
+    for (const knownKey of knownKeys) {
+        const property = schema.properties[knownKey];
+        if (schema.required && schema.required.includes(knownKey)) {
+            if (!Visit(property, references, value[knownKey])) {
+                return false;
+            }
+            if ((ExtendsUndefinedCheck(property) || IsAnyOrUnknown(property)) && !(knownKey in value)) {
+                return false;
+            }
+        }
+        else {
+            if (TypeSystemPolicy.IsExactOptionalProperty(value, knownKey) && !Visit(property, references, value[knownKey])) {
+                return false;
+            }
+        }
+    }
+    if (schema.additionalProperties === false) {
+        const valueKeys = Object.getOwnPropertyNames(value);
+        // optimization: value is valid if schemaKey length matches the valueKey length
+        if (schema.required && schema.required.length === knownKeys.length && valueKeys.length === knownKeys.length) {
+            return true;
+        }
+        else {
+            return valueKeys.every((valueKey) => knownKeys.includes(valueKey));
+        }
+    }
+    else if (typeof schema.additionalProperties === 'object') {
+        const valueKeys = Object.getOwnPropertyNames(value);
+        return valueKeys.every((key) => knownKeys.includes(key) || Visit(schema.additionalProperties, references, value[key]));
+    }
+    else {
+        return true;
+    }
+}
+function TPromise(schema, references, value) {
+    return IsPromise(value);
+}
+function TRecord(schema, references, value) {
+    if (!TypeSystemPolicy.IsRecordLike(value)) {
+        return false;
+    }
+    if (IsDefined(schema.minProperties) && !(Object.getOwnPropertyNames(value).length >= schema.minProperties)) {
+        return false;
+    }
+    if (IsDefined(schema.maxProperties) && !(Object.getOwnPropertyNames(value).length <= schema.maxProperties)) {
+        return false;
+    }
+    const [patternKey, patternSchema] = Object.entries(schema.patternProperties)[0];
+    const regex = new RegExp(patternKey);
+    // prettier-ignore
+    const check1 = Object.entries(value).every(([key, value]) => {
+        return (regex.test(key)) ? Visit(patternSchema, references, value) : true;
+    });
+    // prettier-ignore
+    const check2 = typeof schema.additionalProperties === 'object' ? Object.entries(value).every(([key, value]) => {
+        return (!regex.test(key)) ? Visit(schema.additionalProperties, references, value) : true;
+    }) : true;
+    const check3 = schema.additionalProperties === false
+        ? Object.getOwnPropertyNames(value).every((key) => {
+            return regex.test(key);
+        })
+        : true;
+    return check1 && check2 && check3;
+}
+function TRef(schema, references, value) {
+    return Visit(Deref(schema, references), references, value);
+}
+function TString(schema, references, value) {
+    if (!IsString(value)) {
+        return false;
+    }
+    if (IsDefined(schema.minLength)) {
+        if (!(value.length >= schema.minLength))
+            return false;
+    }
+    if (IsDefined(schema.maxLength)) {
+        if (!(value.length <= schema.maxLength))
+            return false;
+    }
+    if (IsDefined(schema.pattern)) {
+        const regex = new RegExp(schema.pattern);
+        if (!regex.test(value))
+            return false;
+    }
+    if (IsDefined(schema.format)) {
+        if (!FormatRegistry.Has(schema.format))
+            return false;
+        const func = FormatRegistry.Get(schema.format);
+        return func(value);
+    }
+    return true;
+}
+function TSymbol(schema, references, value) {
+    return IsSymbol(value);
+}
+function TTemplateLiteral(schema, references, value) {
+    return IsString(value) && new RegExp(schema.pattern).test(value);
+}
+function TThis(schema, references, value) {
+    return Visit(Deref(schema, references), references, value);
+}
+function TTuple(schema, references, value) {
+    if (!IsArray(value)) {
+        return false;
+    }
+    if (schema.items === undefined && !(value.length === 0)) {
+        return false;
+    }
+    if (!(value.length === schema.maxItems)) {
+        return false;
+    }
+    if (!schema.items) {
+        return true;
+    }
+    for (let i = 0; i < schema.items.length; i++) {
+        if (!Visit(schema.items[i], references, value[i]))
+            return false;
+    }
+    return true;
+}
+function TUndefined(schema, references, value) {
+    return IsUndefined(value);
+}
+function TUnion(schema, references, value) {
+    return schema.anyOf.some((inner) => Visit(inner, references, value));
+}
+function TUint8Array(schema, references, value) {
+    if (!IsUint8Array(value)) {
+        return false;
+    }
+    if (IsDefined(schema.maxByteLength) && !(value.length <= schema.maxByteLength)) {
+        return false;
+    }
+    if (IsDefined(schema.minByteLength) && !(value.length >= schema.minByteLength)) {
+        return false;
+    }
+    return true;
+}
+function TUnknown(schema, references, value) {
+    return true;
+}
+function TVoid(schema, references, value) {
+    return TypeSystemPolicy.IsVoidLike(value);
+}
+function TKind(schema, references, value) {
+    if (!TypeRegistry.Has(schema[Kind]))
+        return false;
+    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_[Kind]) {
+        case 'Any':
+            return TAny(schema_, references_, value);
+        case 'Array':
+            return TArray(schema_, references_, value);
+        case 'AsyncIterator':
+            return TAsyncIterator(schema_, references_, value);
+        case 'BigInt':
+            return TBigInt(schema_, references_, value);
+        case 'Boolean':
+            return TBoolean(schema_, references_, value);
+        case 'Constructor':
+            return TConstructor(schema_, references_, value);
+        case 'Date':
+            return TDate(schema_, references_, value);
+        case 'Function':
+            return TFunction(schema_, references_, value);
+        case 'Integer':
+            return TInteger(schema_, references_, value);
+        case 'Intersect':
+            return TIntersect(schema_, references_, value);
+        case 'Iterator':
+            return TIterator(schema_, references_, value);
+        case 'Literal':
+            return TLiteral(schema_, references_, value);
+        case 'Never':
+            return TNever(schema_, references_, value);
+        case 'Not':
+            return TNot(schema_, references_, value);
+        case 'Null':
+            return TNull(schema_, references_, value);
+        case 'Number':
+            return TNumber(schema_, references_, value);
+        case 'Object':
+            return TObject(schema_, references_, value);
+        case 'Promise':
+            return TPromise(schema_, references_, value);
+        case 'Record':
+            return TRecord(schema_, references_, value);
+        case 'Ref':
+            return TRef(schema_, references_, value);
+        case 'String':
+            return TString(schema_, references_, value);
+        case 'Symbol':
+            return TSymbol(schema_, references_, value);
+        case 'TemplateLiteral':
+            return TTemplateLiteral(schema_, references_, value);
+        case 'This':
+            return TThis(schema_, references_, value);
+        case 'Tuple':
+            return TTuple(schema_, references_, value);
+        case 'Undefined':
+            return TUndefined(schema_, references_, value);
+        case 'Union':
+            return TUnion(schema_, references_, value);
+        case 'Uint8Array':
+            return TUint8Array(schema_, references_, value);
+        case 'Unknown':
+            return TUnknown(schema_, references_, value);
+        case 'Void':
+            return TVoid(schema_, references_, value);
+        default:
+            if (!TypeRegistry.Has(schema_[Kind]))
+                throw new ValueCheckUnknownTypeError(schema_);
+            return TKind(schema_, references_, value);
+    }
+}
+/** Returns true if the value matches the given type. */
+export function Check(...args) {
+    return args.length === 3 ? Visit(args[0], args[1], args[2]) : Visit(args[0], [], args[1]);
+}

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';