Publish
This commit is contained in:
96
example/prototypes/discriminated-union.ts
Normal file
96
example/prototypes/discriminated-union.ts
Normal file
@@ -0,0 +1,96 @@
|
||||
|
||||
/*--------------------------------------------------------------------------
|
||||
|
||||
@sinclair/typebox/prototypes
|
||||
|
||||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2017-2025 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 { Static, Kind, TSchema, TObject, SchemaOptions, CreateType, TLiteral, TypeRegistry, ValueGuard, KindGuard, TUnion } from '@sinclair/typebox'
|
||||
import { GetErrorFunction, SetErrorFunction } from 'src/errors/function'
|
||||
import { Value } from '@sinclair/typebox/value'
|
||||
|
||||
// ------------------------------------------------------------------
|
||||
// DiscriminatedUnionError
|
||||
// ------------------------------------------------------------------
|
||||
const errorFunction = GetErrorFunction()
|
||||
|
||||
// prettier-ignore
|
||||
SetErrorFunction((parameter) => {
|
||||
if (parameter.schema[Kind] !== 'DiscriminatedUnion') {
|
||||
return errorFunction(parameter)
|
||||
}
|
||||
const union = parameter.schema as TDiscriminatedUnion
|
||||
// Try generate error when value matches known discriminator literal
|
||||
if (ValueGuard.IsObject(parameter.value) && union.discriminator in parameter.value) {
|
||||
const variant = parameter.schema.anyOf.find((variant: TSchema) => union.discriminator in variant.properties
|
||||
&& (variant.properties[union.discriminator] as TLiteral).const ===
|
||||
(parameter.value as Record<PropertyKey, unknown>)[union.discriminator])
|
||||
if (KindGuard.IsSchema(variant)) {
|
||||
const literal = variant.properties[union.discriminator]
|
||||
return `Invalid value for DiscriminatedUnion variant '${literal.const}'`
|
||||
}
|
||||
}
|
||||
// Return generic error containing possible discriminator types.
|
||||
const options = union.anyOf.map(object => object.properties[union.discriminator].const) as string[]
|
||||
return `Expected value of ${options.map(option => `'${option}'`).join(', ')} for DiscriminatedUnion`
|
||||
})
|
||||
|
||||
// ------------------------------------------------------------------
|
||||
// TDiscriminatedUnionObject
|
||||
//
|
||||
// Constructs a base TObject type requiring 1 discriminator property
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
type TDiscriminatedUnionProperties<Discriminator extends string> = {
|
||||
[_ in Discriminator]: TLiteral
|
||||
}
|
||||
// prettier-ignore
|
||||
type TDiscriminatedUnionObject<Discriminator extends string> = TObject<TDiscriminatedUnionProperties<Discriminator>>
|
||||
|
||||
// ------------------------------------------------------------------
|
||||
// DiscriminatedUnion
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
TypeRegistry.Set('DiscriminatedUnion', (schema: TDiscriminatedUnion, value) => {
|
||||
return schema.anyOf.some(variant => Value.Check(variant, [], value))
|
||||
})
|
||||
// prettier-ignore
|
||||
export interface TDiscriminatedUnion<Discriminator extends string = string, Types extends TObject[] = TObject[]> extends TSchema {
|
||||
[Kind]: 'DiscriminatedUnion'
|
||||
static: Static<TUnion<Types>>
|
||||
discriminator: Discriminator
|
||||
anyOf: Types
|
||||
}
|
||||
|
||||
/** Creates a DiscriminatedUnion. */
|
||||
// prettier-ignore
|
||||
export function DiscriminatedUnion<Discriminator extends string, Types extends TDiscriminatedUnionObject<Discriminator>[]>(
|
||||
discriminator: Discriminator, types: [...Types], options?: SchemaOptions
|
||||
): TDiscriminatedUnion<Discriminator, Types> {
|
||||
return CreateType({ [Kind]: 'DiscriminatedUnion', anyOf: types, discriminator }, options) as never
|
||||
}
|
||||
|
||||
|
||||
|
||||
251
example/prototypes/from-schema.ts
Normal file
251
example/prototypes/from-schema.ts
Normal file
@@ -0,0 +1,251 @@
|
||||
/*--------------------------------------------------------------------------
|
||||
|
||||
@sinclair/typebox/prototypes
|
||||
|
||||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2017-2025 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 * as Type from '@sinclair/typebox'
|
||||
|
||||
// ------------------------------------------------------------------
|
||||
// Schematics
|
||||
// ------------------------------------------------------------------
|
||||
const IsExact = (value: unknown, expect: unknown) => value === expect
|
||||
const IsSValue = (value: unknown): value is SValue => Type.ValueGuard.IsString(value) || Type.ValueGuard.IsNumber(value) || Type.ValueGuard.IsBoolean(value)
|
||||
const IsSEnum = (value: unknown): value is SEnum => Type.ValueGuard.IsObject(value) && Type.ValueGuard.IsArray(value.enum) && value.enum.every((value) => IsSValue(value))
|
||||
const IsSAllOf = (value: unknown): value is SAllOf => Type.ValueGuard.IsObject(value) && Type.ValueGuard.IsArray(value.allOf)
|
||||
const IsSAnyOf = (value: unknown): value is SAnyOf => Type.ValueGuard.IsObject(value) && Type.ValueGuard.IsArray(value.anyOf)
|
||||
const IsSOneOf = (value: unknown): value is SOneOf => Type.ValueGuard.IsObject(value) && Type.ValueGuard.IsArray(value.oneOf)
|
||||
const IsSTuple = (value: unknown): value is STuple => Type.ValueGuard.IsObject(value) && IsExact(value.type, 'array') && Type.ValueGuard.IsArray(value.items)
|
||||
const IsSArray = (value: unknown): value is SArray => Type.ValueGuard.IsObject(value) && IsExact(value.type, 'array') && !Type.ValueGuard.IsArray(value.items) && Type.ValueGuard.IsObject(value.items)
|
||||
const IsSConst = (value: unknown): value is SConst => Type.ValueGuard.IsObject(value) && Type.ValueGuard.IsObject(value['const'])
|
||||
const IsSString = (value: unknown): value is SString => Type.ValueGuard.IsObject(value) && IsExact(value.type, 'string')
|
||||
const IsSRef = (value: unknown): value is SRef => Type.ValueGuard.IsObject(value) && Type.ValueGuard.IsString(value.$ref)
|
||||
const IsSNumber = (value: unknown): value is SNumber => Type.ValueGuard.IsObject(value) && IsExact(value.type, 'number')
|
||||
const IsSInteger = (value: unknown): value is SInteger => Type.ValueGuard.IsObject(value) && IsExact(value.type, 'integer')
|
||||
const IsSBoolean = (value: unknown): value is SBoolean => Type.ValueGuard.IsObject(value) && IsExact(value.type, 'boolean')
|
||||
const IsSNull = (value: unknown): value is SBoolean => Type.ValueGuard.IsObject(value) && IsExact(value.type, 'null')
|
||||
const IsSProperties = (value: unknown): value is SProperties => Type.ValueGuard.IsObject(value)
|
||||
// prettier-ignore
|
||||
const IsSObject = (value: unknown): value is SObject => Type.ValueGuard.IsObject(value) && IsExact(value.type, 'object') && IsSProperties(value.properties) && (value.required === undefined || Type.ValueGuard.IsArray(value.required) && value.required.every((value: unknown) => Type.ValueGuard.IsString(value)))
|
||||
type SValue = string | number | boolean
|
||||
type SEnum = Readonly<{ enum: readonly SValue[] }>
|
||||
type SAllOf = Readonly<{ allOf: readonly unknown[] }>
|
||||
type SAnyOf = Readonly<{ anyOf: readonly unknown[] }>
|
||||
type SOneOf = Readonly<{ oneOf: readonly unknown[] }>
|
||||
type SProperties = Record<PropertyKey, unknown>
|
||||
type SObject = Readonly<{ type: 'object'; properties: SProperties; required?: readonly string[] }>
|
||||
type STuple = Readonly<{ type: 'array'; items: readonly unknown[] }>
|
||||
type SArray = Readonly<{ type: 'array'; items: unknown }>
|
||||
type SConst = Readonly<{ const: SValue }>
|
||||
type SRef = Readonly<{ $ref: string }>
|
||||
type SString = Readonly<{ type: 'string' }>
|
||||
type SNumber = Readonly<{ type: 'number' }>
|
||||
type SInteger = Readonly<{ type: 'integer' }>
|
||||
type SBoolean = Readonly<{ type: 'boolean' }>
|
||||
type SNull = Readonly<{ type: 'null' }>
|
||||
// ------------------------------------------------------------------
|
||||
// FromRest
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
type TFromRest<T extends readonly unknown[], Acc extends Type.TSchema[] = []> = (
|
||||
T extends readonly [infer L extends unknown, ...infer R extends unknown[]]
|
||||
? TFromSchema<L> extends infer S extends Type.TSchema
|
||||
? TFromRest<R, [...Acc, S]>
|
||||
: TFromRest<R, [...Acc]>
|
||||
: Acc
|
||||
)
|
||||
function FromRest<T extends readonly unknown[]>(T: T): TFromRest<T> {
|
||||
return T.map((L) => FromSchema(L)) as never
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// FromEnumRest
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
type TFromEnumRest<T extends readonly SValue[], Acc extends Type.TSchema[] = []> = (
|
||||
T extends readonly [infer L extends SValue, ...infer R extends SValue[]]
|
||||
? TFromEnumRest<R, [...Acc, Type.TLiteral<L>]>
|
||||
: Acc
|
||||
)
|
||||
function FromEnumRest<T extends readonly SValue[]>(T: T): TFromEnumRest<T> {
|
||||
return T.map((L) => Type.Literal(L)) as never
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// AllOf
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
type TFromAllOf<T extends SAllOf> = (
|
||||
TFromRest<T['allOf']> extends infer Rest extends Type.TSchema[]
|
||||
? Type.TIntersectEvaluated<Rest>
|
||||
: Type.TNever
|
||||
)
|
||||
function FromAllOf<T extends SAllOf>(T: T): TFromAllOf<T> {
|
||||
return Type.IntersectEvaluated(FromRest(T.allOf), T)
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// AnyOf
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
type TFromAnyOf<T extends SAnyOf> = (
|
||||
TFromRest<T['anyOf']> extends infer Rest extends Type.TSchema[]
|
||||
? Type.TUnionEvaluated<Rest>
|
||||
: Type.TNever
|
||||
)
|
||||
function FromAnyOf<T extends SAnyOf>(T: T): TFromAnyOf<T> {
|
||||
return Type.UnionEvaluated(FromRest(T.anyOf), T)
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// OneOf
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
type TFromOneOf<T extends SOneOf> = (
|
||||
TFromRest<T['oneOf']> extends infer Rest extends Type.TSchema[]
|
||||
? Type.TUnionEvaluated<Rest>
|
||||
: Type.TNever
|
||||
)
|
||||
function FromOneOf<T extends SOneOf>(T: T): TFromOneOf<T> {
|
||||
return Type.UnionEvaluated(FromRest(T.oneOf), T)
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// Enum
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
type TFromEnum<T extends SEnum> = (
|
||||
TFromEnumRest<T['enum']> extends infer Elements extends Type.TSchema[]
|
||||
? Type.TUnionEvaluated<Elements>
|
||||
: Type.TNever
|
||||
)
|
||||
function FromEnum<T extends SEnum>(T: T): TFromEnum<T> {
|
||||
return Type.UnionEvaluated(FromEnumRest(T.enum))
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// Tuple
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
type TFromTuple<T extends STuple> = (
|
||||
TFromRest<T['items']> extends infer Elements extends Type.TSchema[]
|
||||
? Type.TTuple<Elements>
|
||||
: Type.TTuple<[]>
|
||||
)
|
||||
// prettier-ignore
|
||||
function FromTuple<T extends STuple>(T: T): TFromTuple<T> {
|
||||
return Type.Tuple(FromRest(T.items), T) as never
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// Array
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
type TFromArray<T extends SArray> = (
|
||||
TFromSchema<T['items']> extends infer Items extends Type.TSchema
|
||||
? Type.TArray<Items>
|
||||
: Type.TArray<Type.TUnknown>
|
||||
)
|
||||
// prettier-ignore
|
||||
function FromArray<T extends SArray>(T: T): TFromArray<T> {
|
||||
return Type.Array(FromSchema(T.items), T) as never
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// Const
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
type TFromConst<T extends SConst> = (
|
||||
Type.Ensure<Type.TLiteral<T['const']>>
|
||||
)
|
||||
function FromConst<T extends SConst>(T: T) {
|
||||
return Type.Literal(T.const, T)
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// Ref
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
type TFromRef<T extends SRef> = (
|
||||
Type.Ensure<Type.TRef<T['$ref']>>
|
||||
)
|
||||
function FromRef<T extends SRef>(T: T) {
|
||||
return Type.Ref(T['$ref'])
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// Object
|
||||
// ------------------------------------------------------------------
|
||||
type TFromPropertiesIsOptional<K extends PropertyKey, R extends string | unknown> = unknown extends R ? true : K extends R ? false : true
|
||||
// prettier-ignore
|
||||
type TFromProperties<T extends SProperties, R extends string | unknown> = Type.Evaluate<{
|
||||
-readonly [K in keyof T]: TFromPropertiesIsOptional<K, R> extends true
|
||||
? Type.TOptional<TFromSchema<T[K]>>
|
||||
: TFromSchema<T[K]>
|
||||
}>
|
||||
// prettier-ignore
|
||||
type TFromObject<T extends SObject> = (
|
||||
TFromProperties<T['properties'], Exclude<T['required'], undefined>[number]> extends infer Properties extends Type.TProperties
|
||||
? Type.TObject<Properties>
|
||||
: Type.TObject<{}>
|
||||
)
|
||||
function FromObject<T extends SObject>(T: T): TFromObject<T> {
|
||||
const properties = globalThis.Object.getOwnPropertyNames(T.properties).reduce((Acc, K) => {
|
||||
return { ...Acc, [K]: T.required && T.required.includes(K) ? FromSchema(T.properties[K]) : Type.Optional(FromSchema(T.properties[K])) }
|
||||
}, {} as Type.TProperties)
|
||||
return Type.Object(properties, T) as never
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// FromSchema
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
export type TFromSchema<T> = (
|
||||
T extends SAllOf ? TFromAllOf<T> :
|
||||
T extends SAnyOf ? TFromAnyOf<T> :
|
||||
T extends SOneOf ? TFromOneOf<T> :
|
||||
T extends SEnum ? TFromEnum<T> :
|
||||
T extends SObject ? TFromObject<T> :
|
||||
T extends STuple ? TFromTuple<T> :
|
||||
T extends SArray ? TFromArray<T> :
|
||||
T extends SConst ? TFromConst<T> :
|
||||
T extends SRef ? TFromRef<T> :
|
||||
T extends SString ? Type.TString :
|
||||
T extends SNumber ? Type.TNumber :
|
||||
T extends SInteger ? Type.TInteger :
|
||||
T extends SBoolean ? Type.TBoolean :
|
||||
T extends SNull ? Type.TNull :
|
||||
Type.TUnknown
|
||||
)
|
||||
/** Parses a TypeBox type from raw JsonSchema */
|
||||
export function FromSchema<T>(T: T): TFromSchema<T> {
|
||||
// prettier-ignore
|
||||
return (
|
||||
IsSAllOf(T) ? FromAllOf(T) :
|
||||
IsSAnyOf(T) ? FromAnyOf(T) :
|
||||
IsSOneOf(T) ? FromOneOf(T) :
|
||||
IsSEnum(T) ? FromEnum(T) :
|
||||
IsSObject(T) ? FromObject(T) :
|
||||
IsSTuple(T) ? FromTuple(T) :
|
||||
IsSArray(T) ? FromArray(T) :
|
||||
IsSConst(T) ? FromConst(T) :
|
||||
IsSRef(T) ? FromRef(T) :
|
||||
IsSString(T) ? Type.String(T) :
|
||||
IsSNumber(T) ? Type.Number(T) :
|
||||
IsSInteger(T) ? Type.Integer(T) :
|
||||
IsSBoolean(T) ? Type.Boolean(T) :
|
||||
IsSNull(T) ? Type.Null(T) :
|
||||
Type.Unknown(T || {})
|
||||
) as never
|
||||
}
|
||||
35
example/prototypes/index.ts
Normal file
35
example/prototypes/index.ts
Normal file
@@ -0,0 +1,35 @@
|
||||
/*--------------------------------------------------------------------------
|
||||
|
||||
@sinclair/typebox/prototypes
|
||||
|
||||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2017-2025 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 './discriminated-union'
|
||||
export * from './from-schema'
|
||||
export * from './options'
|
||||
export * from './partial-deep'
|
||||
export * from './recursive-map'
|
||||
export * from './union-enum'
|
||||
export * from './union-oneof'
|
||||
40
example/prototypes/options.ts
Normal file
40
example/prototypes/options.ts
Normal file
@@ -0,0 +1,40 @@
|
||||
/*--------------------------------------------------------------------------
|
||||
|
||||
@sinclair/typebox/prototypes
|
||||
|
||||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2017-2025 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 { TSchema, CloneType } from '@sinclair/typebox'
|
||||
|
||||
// prettier-ignore
|
||||
export type TOptions<Type extends TSchema, Options extends Record<PropertyKey, unknown>> = (
|
||||
Type & Options
|
||||
)
|
||||
|
||||
/** `[Prototype]` Augments a schema with additional generics aware properties */
|
||||
// prettier-ignore
|
||||
export function Options<Type extends TSchema, Options extends Record<PropertyKey, unknown>>(type: Type, options: Options): TOptions<Type, Options> {
|
||||
return CloneType(type, options) as never
|
||||
}
|
||||
68
example/prototypes/partial-deep.ts
Normal file
68
example/prototypes/partial-deep.ts
Normal file
@@ -0,0 +1,68 @@
|
||||
/*--------------------------------------------------------------------------
|
||||
|
||||
@sinclair/typebox/prototypes
|
||||
|
||||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2017-2025 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 { TypeGuard, Type, TSchema, TIntersect, TUnion, TObject, TPartial, TProperties, Evaluate } from '@sinclair/typebox'
|
||||
|
||||
// -------------------------------------------------------------------------------------
|
||||
// TPartialDeepProperties
|
||||
// -------------------------------------------------------------------------------------
|
||||
export type TPartialDeepProperties<T extends TProperties> = {
|
||||
[K in keyof T]: TPartialDeep<T[K]>
|
||||
}
|
||||
function PartialDeepProperties<T extends TProperties>(properties: T): TPartialDeepProperties<T> {
|
||||
return Object.getOwnPropertyNames(properties).reduce((acc, key) => {
|
||||
return {...acc, [key]: PartialDeep(properties[key])}
|
||||
}, {}) as never
|
||||
}
|
||||
// -------------------------------------------------------------------------------------
|
||||
// TPartialDeepRest
|
||||
// -------------------------------------------------------------------------------------
|
||||
export type TPartialDeepRest<T extends TSchema[], Acc extends TSchema[] = []> = (
|
||||
T extends [infer L extends TSchema, ...infer R extends TSchema[]]
|
||||
? TPartialDeepRest<R, [...Acc, TPartialDeep<L>]>
|
||||
: Acc
|
||||
)
|
||||
function PartialDeepRest<T extends TSchema[]>(rest: [...T]): TPartialDeepRest<T> {
|
||||
return rest.map(schema => PartialDeep(schema)) as never
|
||||
}
|
||||
// -------------------------------------------------------------------------------------
|
||||
// TPartialDeep
|
||||
// -------------------------------------------------------------------------------------
|
||||
export type TPartialDeep<T extends TSchema> =
|
||||
T extends TIntersect<infer S> ? TIntersect<TPartialDeepRest<S>> :
|
||||
T extends TUnion<infer S> ? TUnion<TPartialDeepRest<S>> :
|
||||
T extends TObject<infer S> ? TPartial<TObject<Evaluate<TPartialDeepProperties<S>>>> :
|
||||
T
|
||||
export function PartialDeep<T extends TSchema>(schema: T): TPartialDeep<T> {
|
||||
return (
|
||||
TypeGuard.IsIntersect(schema) ? Type.Intersect(PartialDeepRest(schema.allOf)) :
|
||||
TypeGuard.IsUnion(schema) ? Type.Union(PartialDeepRest(schema.anyOf)) :
|
||||
TypeGuard.IsObject(schema) ? Type.Partial(Type.Object(PartialDeepProperties(schema.properties))) :
|
||||
schema
|
||||
) as never
|
||||
}
|
||||
119
example/prototypes/readme.md
Normal file
119
example/prototypes/readme.md
Normal file
@@ -0,0 +1,119 @@
|
||||
# TypeBox Prototypes
|
||||
|
||||
TypeBox prototypes are a set of types that are either under consideration for inclusion into the library, or have been requested by users but cannot be added to the library either due to complexity, using schematics that fall outside the supported TypeBox or should be expressed by users via advanced type composition.
|
||||
|
||||
|
||||
## PartialDeep
|
||||
|
||||
Maps the given schema as deep partial, making all properties and sub properties optional. This type is asked for on occation, but as there is no TypeScript equivalent and because this type is typically handled through end user type mapping, this type is left out of TypeBox.
|
||||
|
||||
```typescript
|
||||
import { PartialDeep } from './prototypes'
|
||||
|
||||
const T = Type.Object({
|
||||
x: Type.Object({
|
||||
x: Type.Number(),
|
||||
y: Type.Number()
|
||||
}),
|
||||
y: Type.Object({
|
||||
x: Type.Number(),
|
||||
y: Type.Number()
|
||||
})
|
||||
})
|
||||
|
||||
const P = PartialDeep(T)
|
||||
|
||||
type P = Static<typeof P> // type P = {
|
||||
// x?: {
|
||||
// x?: number,
|
||||
// y?: number
|
||||
// },
|
||||
// y?: {
|
||||
// x?: number,
|
||||
// y?: number
|
||||
// },
|
||||
// }
|
||||
```
|
||||
|
||||
## UnionEnum
|
||||
|
||||
Creates an `enum` union string schema representation. This type is often requested by OpenAPI users, particularily for documentation presentation. As TypeBox standardizes on `anyOf` for all unions, this type is generally at odds with TypeBox's internal representation. Some considerations for internally remapping this type into a `anyOf` through composition have been considered (and would be feasible), but as TypeScript doesn't have multiple representations for unions, neither should TypeBox, making this type an unlikely candidate.
|
||||
|
||||
```typescript
|
||||
import { UnionEnum } from './prototypes'
|
||||
|
||||
|
||||
const T = UnionEnum(['A', 'B', 'C']) // const T = {
|
||||
// enum: ['A', 'B', 'C']
|
||||
// }
|
||||
|
||||
type T = Static<typeof T> // type T = 'A' | 'B' | 'C'
|
||||
|
||||
```
|
||||
## UnionOneOf
|
||||
|
||||
Creates a `oneOf` union representation. This type is often requested by users looking for discriminated union support (which is not formally supported by JSON Schema). TypeBox omits this type as `oneOf` has the potential to create illogical schematics where values match more than one sub schema (making type inference extremely difficult). TypeBox preferences users explicitly narrowing on a overlapping union post type check, making `anyOf` the ideal representation, leaving the `oneOf` type an unlikely candidate for inclusion in the library.
|
||||
|
||||
|
||||
```typescript
|
||||
import { UnionOneOf } from './prototypes'
|
||||
|
||||
|
||||
const T = UnionOneOf([ // const T = {
|
||||
Type.Literal('A'), // oneOf: [
|
||||
Type.Literal('B'), // { const: 'A' },
|
||||
Type.Literal('C') // { const: 'B' },
|
||||
]) // { const: 'C' },
|
||||
// ]
|
||||
// }
|
||||
|
||||
type T = Static<typeof T> // type T = 'A' | 'B' | 'C'
|
||||
|
||||
```
|
||||
|
||||
## Options
|
||||
|
||||
By default, TypeBox does not represent arbituary options as generics aware properties. However, there are cases where having options observable to the type system can be useful, for example conditionally mapping schematics based on custom metadata. The Options function makes user defined options generics aware.
|
||||
|
||||
```typescript
|
||||
import { Options } from './prototypes'
|
||||
|
||||
const A = Options(Type.String(), { foo: 1 }) // Options<TString, { foo: number }>
|
||||
|
||||
type A = typeof A extends { foo: number } ? true : false // true: foo property is observable to the type system
|
||||
```
|
||||
|
||||
## Recursive Map
|
||||
The Recursive Map type enables deep structural remapping of a type and it's internal constituents. This type accepts a TSchema type and a mapping type function (expressed via HKT). The HKT is applied when traversing the type and it's interior. The mapping HKT can apply conditional tests to each visited type to remap into a new form. The following augments a schematic via Options, and conditionally remaps any schema with an default annotation to make it optional.
|
||||
```typescript
|
||||
import { Type, TOptional, Static, TSchema } from '@sinclair/typebox'
|
||||
|
||||
import { TRecursiveMap, TMappingType, Options } from './prototypes'
|
||||
|
||||
// ------------------------------------------------------------------
|
||||
// StaticDefault
|
||||
// ------------------------------------------------------------------
|
||||
export interface StaticDefaultMapping extends TMappingType {
|
||||
output: (
|
||||
this['input'] extends TSchema // if input schematic contains an default
|
||||
? this['input'] extends { default: unknown } // annotation, remap it to be optional,
|
||||
? TOptional<this['input']> // otherwise just return the schema as is.
|
||||
: this['input']
|
||||
: this['input']
|
||||
)
|
||||
}
|
||||
export type StaticDefault<Type extends TSchema> = (
|
||||
Static<TRecursiveMap<Type, StaticDefaultMapping>>
|
||||
)
|
||||
|
||||
// ------------------------------------------------------------------
|
||||
// Usage
|
||||
// ------------------------------------------------------------------
|
||||
|
||||
const T = Type.Object({
|
||||
x: Options(Type.String(), { default: 'hello' }),
|
||||
y: Type.String()
|
||||
})
|
||||
|
||||
type T = StaticDefault<typeof T> // { x?: string, y: string }
|
||||
type S = Static<typeof T> // { x: string, y: string }
|
||||
153
example/prototypes/recursive-map.ts
Normal file
153
example/prototypes/recursive-map.ts
Normal file
@@ -0,0 +1,153 @@
|
||||
/*--------------------------------------------------------------------------
|
||||
|
||||
@sinclair/typebox/prototypes
|
||||
|
||||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2017-2025 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 * as Types from '@sinclair/typebox'
|
||||
|
||||
// ------------------------------------------------------------------
|
||||
// Mapping: Functions and Type
|
||||
// ------------------------------------------------------------------
|
||||
export type TMappingFunction = (schema: Types.TSchema) => Types.TSchema
|
||||
|
||||
export interface TMappingType {
|
||||
input: unknown
|
||||
output: unknown
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// Record Parameters
|
||||
// ------------------------------------------------------------------
|
||||
function GetRecordPattern(record: Types.TRecord): string {
|
||||
return globalThis.Object.getOwnPropertyNames(record.patternProperties)[0]
|
||||
}
|
||||
function GetRecordKey(record: Types.TRecord): Types.TSchema {
|
||||
const pattern = GetRecordPattern(record)
|
||||
return (
|
||||
pattern === Types.PatternStringExact ? Types.String() :
|
||||
pattern === Types.PatternNumberExact ? Types.Number() :
|
||||
pattern === Types.PatternBooleanExact ? Types.Boolean() :
|
||||
Types.String({ pattern })
|
||||
)
|
||||
}
|
||||
function GetRecordValue(record: Types.TRecord): Types.TSchema {
|
||||
return record.patternProperties[GetRecordPattern(record)]
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// Traversal
|
||||
// ------------------------------------------------------------------
|
||||
// prettier-ignore
|
||||
type TApply<Type extends Types.TSchema, Func extends TMappingType,
|
||||
Mapped = (Func & { input: Type })['output'],
|
||||
Result = Mapped extends Types.TSchema ? Mapped : never
|
||||
> = Result
|
||||
// prettier-ignore
|
||||
type TFromProperties<Properties extends Types.TProperties, Func extends TMappingType, Result extends Types.TProperties = {
|
||||
[Key in keyof Properties]: TRecursiveMap<Properties[Key], Func>
|
||||
}> = Result
|
||||
function FromProperties(properties: Types.TProperties, func: TMappingFunction): Types.TProperties {
|
||||
return globalThis.Object.getOwnPropertyNames(properties).reduce((result, key) => {
|
||||
return {...result, [key]: RecursiveMap(properties[key], func) }
|
||||
}, {})
|
||||
}
|
||||
// prettier-ignore
|
||||
type TFromRest<Types extends Types.TSchema[], Func extends TMappingType, Result extends Types.TSchema[] = []> = (
|
||||
Types extends [infer Left extends Types.TSchema, ...infer Right extends Types.TSchema[]]
|
||||
? TFromRest<Right, Func, [...Result, TRecursiveMap<Left, Func>]>
|
||||
: Result
|
||||
)
|
||||
function FromRest(types: Types.TSchema[], func: TMappingFunction): Types.TSchema[] {
|
||||
return types.map(type => RecursiveMap(type, func))
|
||||
}
|
||||
// prettier-ignore
|
||||
type TFromType<Type extends Types.TSchema, Func extends TMappingType, Result extends Types.TSchema = (
|
||||
TApply<Type, Func>
|
||||
)> = Result
|
||||
function FromType(type: Types.TSchema, func: TMappingFunction): Types.TSchema {
|
||||
return func(type)
|
||||
}
|
||||
// ------------------------------------------------------------------
|
||||
// TRecursiveMap<Type, Mapping>
|
||||
// ------------------------------------------------------------------
|
||||
/** `[Prototype]` Applies a deep recursive map across the given type and sub types. */
|
||||
// prettier-ignore
|
||||
export type TRecursiveMap<Type extends Types.TSchema, Func extends TMappingType,
|
||||
// Maps the Exterior Type
|
||||
Exterior extends Types.TSchema = TFromType<Type, Func>,
|
||||
// Maps the Interior Parameterized Types
|
||||
Interior extends Types.TSchema = (
|
||||
Exterior extends Types.TConstructor<infer Parameters extends Types.TSchema[], infer ReturnType extends Types.TSchema> ? Types.TConstructor<TFromRest<Parameters, Func>, TFromType<ReturnType, Func>> :
|
||||
Exterior extends Types.TFunction<infer Parameters extends Types.TSchema[], infer ReturnType extends Types.TSchema> ? Types.TFunction<TFromRest<Parameters, Func>, TFromType<ReturnType, Func>> :
|
||||
Exterior extends Types.TIntersect<infer Types extends Types.TSchema[]> ? Types.TIntersect<TFromRest<Types, Func>> :
|
||||
Exterior extends Types.TUnion<infer Types extends Types.TSchema[]> ? Types.TUnion<TFromRest<Types, Func>> :
|
||||
Exterior extends Types.TTuple<infer Types extends Types.TSchema[]> ? Types.TTuple<TFromRest<Types, Func>> :
|
||||
Exterior extends Types.TArray<infer Type extends Types.TSchema> ? Types.TArray<TFromType<Type, Func>>:
|
||||
Exterior extends Types.TAsyncIterator<infer Type extends Types.TSchema> ? Types.TAsyncIterator<TFromType<Type, Func>> :
|
||||
Exterior extends Types.TIterator<infer Type extends Types.TSchema> ? Types.TIterator<TFromType<Type, Func>> :
|
||||
Exterior extends Types.TPromise<infer Type extends Types.TSchema> ? Types.TPromise<TFromType<Type, Func>> :
|
||||
Exterior extends Types.TObject<infer Properties extends Types.TProperties> ? Types.TObject<TFromProperties<Properties, Func>> :
|
||||
Exterior extends Types.TRecord<infer Key extends Types.TSchema, infer Value extends Types.TSchema> ? Types.TRecordOrObject<TFromType<Key, Func>, TFromType<Value, Func>> :
|
||||
Exterior
|
||||
),
|
||||
// Modifiers Derived from Exterior Type Mapping
|
||||
IsOptional extends number = Exterior extends Types.TOptional<Types.TSchema> ? 1 : 0,
|
||||
IsReadonly extends number = Exterior extends Types.TReadonly<Types.TSchema> ? 1 : 0,
|
||||
Result extends Types.TSchema = (
|
||||
[IsReadonly, IsOptional] extends [1, 1] ? Types.TReadonlyOptional<Interior> :
|
||||
[IsReadonly, IsOptional] extends [0, 1] ? Types.TOptional<Interior> :
|
||||
[IsReadonly, IsOptional] extends [1, 0] ? Types.TReadonly<Interior> :
|
||||
Interior
|
||||
)
|
||||
> = Result
|
||||
/** `[Prototype]` Applies a deep recursive map across the given type and sub types. */
|
||||
// prettier-ignore
|
||||
export function RecursiveMap(type: Types.TSchema, func: TMappingFunction): Types.TSchema {
|
||||
// Maps the Exterior Type
|
||||
const exterior = Types.CloneType(FromType(type, func), type)
|
||||
// Maps the Interior Parameterized Types
|
||||
const interior = (
|
||||
Types.KindGuard.IsConstructor(type) ? Types.Constructor(FromRest(type.parameters, func), FromType(type.returns, func), exterior) :
|
||||
Types.KindGuard.IsFunction(type) ? Types.Function(FromRest(type.parameters, func), FromType(type.returns, func), exterior) :
|
||||
Types.KindGuard.IsIntersect(type) ? Types.Intersect(FromRest(type.allOf, func), exterior) :
|
||||
Types.KindGuard.IsUnion(type) ? Types.Union(FromRest(type.anyOf, func), exterior) :
|
||||
Types.KindGuard.IsTuple(type) ? Types.Tuple(FromRest(type.items || [], func), exterior) :
|
||||
Types.KindGuard.IsArray(type) ? Types.Array(FromType(type.items, func), exterior) :
|
||||
Types.KindGuard.IsAsyncIterator(type) ? Types.AsyncIterator(FromType(type.items, func), exterior) :
|
||||
Types.KindGuard.IsIterator(type) ? Types.Iterator(FromType(type.items, func), exterior) :
|
||||
Types.KindGuard.IsPromise(type) ? Types.Promise(FromType(type.items, func), exterior) :
|
||||
Types.KindGuard.IsObject(type) ? Types.Object(FromProperties(type.properties, func), exterior) :
|
||||
Types.KindGuard.IsRecord(type) ? Types.Record(FromType(GetRecordKey(type), func), FromType(GetRecordValue(type), func), exterior) :
|
||||
Types.CloneType(exterior, exterior)
|
||||
)
|
||||
// Modifiers Derived from Exterior Type Mapping
|
||||
const isOptional = Types.KindGuard.IsOptional(exterior)
|
||||
const isReadonly = Types.KindGuard.IsOptional(exterior)
|
||||
return (
|
||||
isOptional && isReadonly ? Types.ReadonlyOptional(interior) :
|
||||
isOptional ? Types.Optional(interior) :
|
||||
isReadonly ? Types.Readonly(interior) :
|
||||
interior
|
||||
)
|
||||
}
|
||||
49
example/prototypes/union-enum.ts
Normal file
49
example/prototypes/union-enum.ts
Normal file
@@ -0,0 +1,49 @@
|
||||
/*--------------------------------------------------------------------------
|
||||
|
||||
@sinclair/typebox/prototypes
|
||||
|
||||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2017-2025 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 { TypeRegistry, Kind, TSchema, SchemaOptions } from '@sinclair/typebox'
|
||||
|
||||
// -------------------------------------------------------------------------------------
|
||||
// TUnionEnum
|
||||
// -------------------------------------------------------------------------------------
|
||||
export interface TUnionEnum<T extends (string | number)[]> extends TSchema {
|
||||
[Kind]: 'UnionEnum'
|
||||
static: T[number]
|
||||
enum: T
|
||||
}
|
||||
// -------------------------------------------------------------------------------------
|
||||
// UnionEnum
|
||||
// -------------------------------------------------------------------------------------
|
||||
/** `[Experimental]` Creates a Union type with a `enum` schema representation */
|
||||
export function UnionEnum<T extends (string | number)[]>(values: [...T], options: SchemaOptions = {}) {
|
||||
function UnionEnumCheck(schema: TUnionEnum<(string | number)[]>, value: unknown) {
|
||||
return (typeof value === 'string' || typeof value === 'number') && schema.enum.includes(value)
|
||||
}
|
||||
if (!TypeRegistry.Has('UnionEnum')) TypeRegistry.Set('UnionEnum', UnionEnumCheck)
|
||||
return { ...options, [Kind]: 'UnionEnum', enum: values } as TUnionEnum<T>
|
||||
}
|
||||
50
example/prototypes/union-oneof.ts
Normal file
50
example/prototypes/union-oneof.ts
Normal file
@@ -0,0 +1,50 @@
|
||||
/*--------------------------------------------------------------------------
|
||||
|
||||
@sinclair/typebox/prototypes
|
||||
|
||||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2017-2025 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 { TypeRegistry, Kind, Static, TSchema, SchemaOptions } from '@sinclair/typebox'
|
||||
import { Value } from '@sinclair/typebox/value'
|
||||
|
||||
// -------------------------------------------------------------------------------------
|
||||
// TUnionOneOf
|
||||
// -------------------------------------------------------------------------------------
|
||||
export interface TUnionOneOf<T extends TSchema[]> extends TSchema {
|
||||
[Kind]: 'UnionOneOf'
|
||||
static: { [K in keyof T]: Static<T[K]> }[number]
|
||||
oneOf: T
|
||||
}
|
||||
// -------------------------------------------------------------------------------------
|
||||
// UnionOneOf
|
||||
// -------------------------------------------------------------------------------------
|
||||
/** `[Experimental]` Creates a Union type with a `oneOf` schema representation */
|
||||
export function UnionOneOf<T extends TSchema[]>(oneOf: [...T], options: SchemaOptions = {}) {
|
||||
function UnionOneOfCheck(schema: TUnionOneOf<TSchema[]>, value: unknown) {
|
||||
return 1 === schema.oneOf.reduce((acc: number, schema: any) => (Value.Check(schema, value) ? acc + 1 : acc), 0)
|
||||
}
|
||||
if (!TypeRegistry.Has('UnionOneOf')) TypeRegistry.Set('UnionOneOf', UnionOneOfCheck)
|
||||
return { ...options, [Kind]: 'UnionOneOf', oneOf } as TUnionOneOf<T>
|
||||
}
|
||||
Reference in New Issue
Block a user