@routier/core 0.2.0 → 0.3.0

package/dist/collections/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"collections/index.js","sources":["webpack://@routier/core/./src/collections/Changes.ts","webpack://@routier/core/./src/collections/IdSet.ts","webpack://@routier/core/./src/collections/MemoryDataCollection.ts","webpack://@routier/core/./src/collections/ReadonlySchemaCollection.ts","webpack://@routier/core/./src/collections/SchemaCollection.ts","webpack://@routier/core/./src/collections/TagCollection.ts","webpack://@routier/core/./src/results/Result.ts","webpack://@routier/core/./src/schema/types.ts","webpack://@routier/core/./src/utilities/uuid.ts","webpack://@routier/core/webpack/runtime/define_property_getters","webpack://@routier/core/webpack/runtime/has_own_property","webpack://@routier/core/webpack/runtime/make_namespace_object","webpack://@routier/core/./src/collections/index.ts"],"sourcesContent":["import { EntityUpdateInfo } from \"../plugins/types\";\nimport { InferCreateType, InferType, SchemaId } from \"../schema\";\nimport { TagCollection } from \"./TagCollection\";\nexport class BulkPersistResult extends Map<SchemaId, SchemaPersistResult> {\n\n    resolve(schemaId: SchemaId): SchemaPersistResult {\n        if (this.has(schemaId)) {\n            return this.get(schemaId);\n        }\n\n        this.set(schemaId, new SchemaPersistResult());\n\n        return this.get(schemaId);\n    }\n\n    override get<T extends {} = Record<string, unknown>>(schemaId: SchemaId) {\n        return super.get(schemaId) as SchemaPersistResult<T>\n    }\n\n    get aggregate() {\n        return {\n            size: this.aggregateSize,\n            adds: this.aggregateAddsSize,\n            updates: this.aggregateUpdatesSize,\n            removes: this.aggregateRemovesSize\n        }\n    }\n\n    private get aggregateSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.total;\n        }\n\n        return count;\n    }\n\n    private get aggregateAddsSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.adds.length;\n        }\n\n        return count;\n    }\n\n    private get aggregateUpdatesSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.updates.length;\n        }\n\n        return count;\n    }\n\n    private get aggregateRemovesSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.removes.length;\n        }\n\n        return count;\n    }\n}\n\nexport class BulkPersistChanges extends Map<SchemaId, SchemaPersistChanges> {\n\n    resolve(schemaId: SchemaId): SchemaPersistChanges {\n        if (this.has(schemaId)) {\n            return this.get(schemaId);\n        }\n\n        this.set(schemaId, new SchemaPersistChanges());\n\n        return this.get(schemaId);\n    }\n\n    override get<T extends {} = Record<string, unknown>>(schemaId: SchemaId) {\n        return super.get(schemaId) as SchemaPersistChanges<T>\n    }\n\n    get aggregate() {\n        return {\n            size: this.aggregateSize,\n            adds: this.aggregateAddsSize,\n            updates: this.aggregateUpdatesSize,\n            removes: this.aggregateRemovesSize\n        }\n    }\n\n    private get aggregateSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.total;\n        }\n\n        return count;\n    }\n\n    private get aggregateAddsSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.adds.length;\n        }\n\n        return count;\n    }\n\n    private get aggregateUpdatesSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.updates.length;\n        }\n\n        return count;\n    }\n\n    private get aggregateRemovesSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.removes.length;\n        }\n\n        return count;\n    }\n\n    /**\n     * Ensures the result has the same result sets as the change sets\n     * @returns \n     */\n    toResult() {\n        const result = new BulkPersistResult();\n\n        for (const [schemaId] of this) {\n            result.set(schemaId, new SchemaPersistResult());\n        }\n\n        return result;\n    }\n}\n\nexport class SchemaPersistChanges<T extends {} = Record<string, unknown>> {\n    adds: InferCreateType<T>[] = [];\n    updates: EntityUpdateInfo<T>[] = [];\n    removes: InferType<T>[] = [];\n    tags: TagCollection = new TagCollection();\n\n    get hasItems() {\n        return this.total > 0;\n    }\n\n    get total() {\n        return this.adds.length + this.updates.length + this.removes.length;\n    }\n}\n\nexport class SchemaPersistResult<T extends {} = Record<string, unknown>> {\n    adds: InferType<T>[] = [];\n    updates: InferType<T>[] = [];\n    removes: InferType<T>[] = [];\n\n    get hasItems() {\n        return this.total > 0;\n    }\n\n    get total() {\n        return this.adds.length + this.updates.length + this.removes.length;\n    }\n}","import { IdType } from \"../schema\";\n\nexport class IdSet {\n\n    readonly ids: readonly IdType[];\n\n    constructor(...ids: IdType[]) {\n        this.ids = Object.freeze(ids);\n    }\n\n    equals(other: IdSet): boolean {\n\n        if (this.ids.length === 1) {\n            return this.ids[0] === other.ids[0];\n        }\n\n        return this.toString() === other.toString();\n    }\n\n    toString(): string {\n\n        if (this.ids.length === 1) {\n            return String(this.ids[0]);\n        }\n\n        return this.ids.toString();\n    }\n}","import { CompiledSchema, IdType, InferType, PropertyInfo, SchemaTypes } from \"../schema\";\nimport { CallbackResult, Result } from \"../results\";\nimport { uuidv4 } from \"../utilities\";\nimport { IdSet } from \"./IdSet\";\n\nexport class MemoryDataCollection {\n\n    protected readonly nextNumericalIds: Map<string, number>;\n    protected readonly data: Map<string, Record<string, unknown>>;\n    protected readonly schema: CompiledSchema<any>;\n    protected readonly idProperties: PropertyInfo<any>[];\n\n    get size() {\n        return this.data.size;\n    }\n\n    get records() {\n        return [...this.data.values()];\n    }\n\n    constructor(schema: CompiledSchema<any>) {\n        this.data = new Map<string, Record<string, unknown>>();\n        this.nextNumericalIds = new Map<string, number>();\n        this.schema = schema;\n        this.idProperties = schema.idProperties;\n    }\n\n    private _getNextId(property: PropertyInfo<any>) {\n\n        let nextId = 1;\n\n        if (this.nextNumericalIds.has(property.id) === true) {\n            nextId = this.nextNumericalIds.get(property.id) + 1;\n        }\n\n        this.nextNumericalIds.set(property.id, nextId);\n\n        return nextId;\n    }\n\n    private resolveId(property: PropertyInfo<any>, value: unknown) {\n        if (typeof value !== \"number\") {\n            return;\n        }\n\n        const currentIdForProperty = this.nextNumericalIds.get(property.id);\n\n        if (value <= currentIdForProperty) {\n            return;\n        }\n\n        this.nextNumericalIds.set(property.id, value);\n    }\n\n    private getAndSetId(item: Record<string, unknown>, property: PropertyInfo<any>): IdType {\n        if (item[property.name] != null) {\n            return item[property.name] as IdType;\n        }\n\n        if (property.type === SchemaTypes.String) {\n            const uuid = uuidv4()\n            item[property.name] = uuid;\n            return uuid;\n        }\n\n        if (property.type === SchemaTypes.Number) {\n            const id = this._getNextId(property);\n            item[property.name] = id;\n            return id;\n        }\n\n        throw new Error(`Id Property '${property.name}' must be string or number, found '${property.type}'`)\n    }\n\n    seed(items: Record<string, unknown>[]) {\n        for (let i = 0, length = items.length; i < length; i++) {\n            const id = this.resolveIdSet(items[i] as InferType<unknown>);\n            this.data.set(id.toString(), items[i]);\n        }\n    }\n\n    private resolveCurrentIdSet(item: Record<string, unknown>): IdSet {\n        const idProperties = this.schema.idProperties;\n        const ids: IdType[] = [];\n        // ensure keys\n        for (let j = 0, l = idProperties.length; j < l; j++) {\n            const property = idProperties[j];\n            const value = property.getValue(item);\n\n            if (value == null) {\n                throw new Error(`Key cannot be null.  Key: ${property.name}`);\n            }\n\n            ids.push(value);\n        }\n\n        return new IdSet(...ids);\n    }\n\n    private resolveIdSet(item: Record<string, unknown>): IdSet {\n\n        if (this.schema.hasIdentityKeys) {\n            const idProperties = this.schema.idProperties;\n            const ids: IdType[] = new Array<IdType>(idProperties.length);\n\n            // Need to make sure we allow for seeding the collection when we call add vs seed\n            // There will be an existing id, but the id type could still be identity\n            if (idProperties.length === 1) {\n                const value = this.getAndSetId(item, idProperties[0]);\n                this.resolveId(idProperties[0], value);\n                ids[0] = value;\n            } else {\n                for (let j = 0, l = idProperties.length; j < l; j++) {\n                    const value = this.getAndSetId(item, idProperties[j]);\n                    this.resolveId(idProperties[j], value);\n                    ids[j] = value;\n                }\n            }\n\n            return new IdSet(...ids);\n        }\n\n        return this.resolveCurrentIdSet(item);\n    }\n\n    add(item: Record<string, unknown>) {\n        const id = this.resolveIdSet(item);\n        this.data.set(id.toString(), item);\n    }\n\n    remove(item: Record<string, unknown>) {\n        const id = this.resolveCurrentIdSet(item);\n        this.data.delete(id.toString());\n    }\n\n    update(item: Record<string, unknown>) {\n        const id = this.resolveCurrentIdSet(item);\n        this.data.set(id.toString(), item);\n    }\n\n    destroy(done: CallbackResult<never>) {\n        this.nextNumericalIds.clear();\n        this.data.clear();\n        done(Result.success());\n    }\n\n    load(done: CallbackResult<never>) {\n        done(Result.success())\n    }\n\n    save(done: CallbackResult<never>) {\n        done(Result.success())\n    }\n}","import { CompiledSchema, SchemaId } from \"../schema\";\n\n/**\n * Collection of schemas with generic typing for type-safe schema retrieval\n */\nexport class ReadonlySchemaCollection {\n\n    protected data: Map<SchemaId, CompiledSchema<Record<string, unknown>>>;\n\n    constructor(data?: [SchemaId, CompiledSchema<Record<string, unknown>>][]) {\n        this.data = new Map<SchemaId, CompiledSchema<Record<string, unknown>>>(data);\n    }\n\n    get<T>(schemaId: SchemaId): CompiledSchema<T> | undefined {\n        return this.data.get(schemaId) as CompiledSchema<T> | undefined;\n    }\n\n    has(schemaId: SchemaId): boolean {\n        return this.data.has(schemaId);\n    }\n\n    get size(): number {\n        return this.data.size;\n    }\n\n    keys(): IterableIterator<SchemaId> {\n        return this.data.keys();\n    }\n\n    values(): IterableIterator<CompiledSchema<Record<string, unknown>>> {\n        return this.data.values();\n    }\n\n    entries(): IterableIterator<[SchemaId, CompiledSchema<Record<string, unknown>>]> {\n        return this.data.entries();\n    }\n\n    forEach(callbackfn: (value: CompiledSchema<Record<string, unknown>>, key: SchemaId, map: Map<SchemaId, CompiledSchema<Record<string, unknown>>>) => void, thisArg?: any): void {\n        this.data.forEach(callbackfn, thisArg);\n    }\n\n    [Symbol.iterator](): IterableIterator<[SchemaId, CompiledSchema<Record<string, unknown>>]> {\n        return this.data[Symbol.iterator]();\n    }\n\n    getByName<T>(collectionName: string): CompiledSchema<T> | undefined {\n        const found = [...this.data].find(x => x[1].collectionName === collectionName);\n\n        if (found != null) {\n            return found[1] as CompiledSchema<T>;\n        }\n\n        return undefined;\n    }\n}","import { CompiledSchema, SchemaId } from \"../schema\";\nimport { ReadonlySchemaCollection } from \"./ReadonlySchemaCollection\";\n\n/**\n * Collection of schemas with generic typing for type-safe schema retrieval\n */\nexport class SchemaCollection extends ReadonlySchemaCollection {\n\n    set<T>(schemaId: SchemaId, schema: CompiledSchema<T>): this {\n        this.data.set(schemaId, schema as CompiledSchema<Record<string, unknown>>);\n        return this;\n    }\n\n    delete(schemaId: SchemaId): boolean {\n        return this.data.delete(schemaId);\n    }\n\n    clear(): void {\n        this.data.clear();\n    }\n}","export class TagCollection implements Disposable {\n\n    private data: Map<Object, unknown> = new Map<Object, unknown>();\n    private _size: number = 0;\n\n    get size() {\n        return this._size;\n    }\n\n    get(key: Object) {\n        return this.data.get(key);\n    }\n\n    has(key: Object) {\n        return this.data.has(key);\n    }\n\n    set(key: Object, tag: unknown) {\n        this._size++;\n        return this.data.set(key, tag);\n    }\n\n    delete(key: Object) {\n        const result = this.data.delete(key);\n\n        if (result) {\n            this._size--;\n        }\n\n        return result;\n    }\n\n    setMany(keys: Object[], tag: unknown) {\n        this._size += keys.length;\n        for (let i = 0, length = keys.length; i < length; i++) {\n            const key = keys[i];\n            this.set(key, tag);\n        }\n    }\n\n    combine(tags: TagCollection) {\n        for (const [key, value] of tags) {\n            this.data.set(key, value);\n        }\n    }\n\n    values() {\n        return this.data.values();\n    }\n\n    keys() {\n        return this.data.keys();\n    }\n\n    [Symbol.dispose]() {\n        this.data.clear();\n    }\n\n    [Symbol.iterator]() {\n        return this.data[Symbol.iterator]();\n    }\n}","import { PartialResultType, PluginEventPartialResultType, PluginEventResultType, ResultType } from \"./types\";\n\nabstract class BaseResult {\n    static ERROR = \"error\" as const;\n    static SUCCESS = \"success\" as const;\n    static PARTIAL = \"partial\" as const;\n\n    static resolve<T>(result: ResultType<T> | PartialResultType<T>, resolve: (data: T) => void, reject: (error?: any) => void) {\n        if (result.ok === BaseResult.SUCCESS) {\n            resolve(result.data);\n            return;\n        }\n\n        if (result.ok === BaseResult.PARTIAL) {\n            reject({\n                partial: result.data,\n                error: result.error\n            });\n            return;\n        }\n\n        reject(result.error);\n    }\n\n    static assertSuccess<T>(result: any): asserts result is { ok: \"success\"; data: T } {\n        if (result.ok !== BaseResult.SUCCESS) {\n            throw new Error(`Expected success result, but got ${result.ok}: ${result.error}`);\n        }\n    }\n}\n\nexport class Result extends BaseResult {\n    static success<T>(data: T): ResultType<T>;\n    static success<T>(): ResultType<never>;\n    static success<T>(data?: T): ResultType<T> {\n        return {\n            ok: Result.SUCCESS,\n            data\n        }\n    }\n\n    static error<T>(error: any): ResultType<T> {\n        return {\n            ok: Result.ERROR,\n            error\n        }\n    }\n\n    static partial<T>(data: T, error: any): PartialResultType<T> {\n        return {\n            ok: Result.PARTIAL,\n            data,\n            error\n        }\n    }\n}\n\nexport class PluginEventResult extends BaseResult {\n    static success<T>(id: string, data: T): PluginEventResultType<T>;\n    static success<T>(id: string): PluginEventResultType<never>;\n    static success<T>(id: string, data?: T): PluginEventResultType<T> {\n        return {\n            id,\n            ok: Result.SUCCESS,\n            data\n        }\n    }\n\n    static error<T>(id: string, error: any): PluginEventResultType<T> {\n        return {\n            id,\n            ok: Result.ERROR,\n            error\n        }\n    }\n\n    static partial<T>(id: string, data: T, error: any): PluginEventPartialResultType<T> {\n        return {\n            id,\n            ok: Result.PARTIAL,\n            data,\n            error\n        }\n    }\n\n    static assertSuccess<T>(result: PluginEventResultType<T>): asserts result is { ok: \"success\"; data: T; id: string } {\n        if (result.ok !== Result.SUCCESS) {\n            throw new Error(`Expected success result, but got ${result.ok}: ${result.error}`);\n        }\n    }\n}\n","import { SchemaDefinition } from \"./SchemaDefinition\";\nimport { SchemaBase } from \"./property/base/SchemaBase\";\nimport { SchemaArray } from \"./property/types/SchemaArray\";\nimport { SchemaObject } from \"./property/types/SchemaObject\";\nimport { PropertyInfo } from \"./PropertyInfo\";\nimport { DeepPartial } from \"../types\";\nimport { SchemaFunction } from \"./table\";\nimport { SchemaOptional } from \"./property/modifiers\";\nimport { Branded } from \"../utilities/types\";\n\nexport type DefaultValue<T, I = never> = T | ((injected: I) => T);\nexport type FunctionBody<TEntity, TResult> = (entity: TEntity, collectionName: CollectionName) => TResult;\nexport type IdType = string | number;\n\nexport enum SchemaTypes {\n    Array = \"Array\",\n    Boolean = \"Boolean\",\n    Date = \"Date\",\n    Number = \"Number\",\n    Object = \"Object\",\n    String = \"String\",\n    Definition = \"Definition\",\n    Function = \"Function\",\n    Computed = \"Computed\"\n}\n\nexport type ArrayShape = string | number | Date | {};\n\nexport type ExpandedProperty = ExpandedChildProperty & {\n    assignmentPath: string;\n    selectorPath: string;\n    properties: Map<string, ExpandedChildProperty>;\n    childDegree: number;\n};\n\nexport type ExpandedChildProperty = {\n    propertyName: string;\n    type: SchemaTypes;\n    isNullableOrOptional: boolean;\n    isReadonly: boolean;\n    isIdentity: boolean;\n    isUnmapped: boolean;\n}\n\nexport enum HashType {\n    Ids = \"Ids\",\n    Object = \"Object\"\n}\n\nexport type HashFunction<TEntity extends {}> = {\n    (entity: InferCreateType<TEntity>, type: HashType.Object): string;\n    (entity: InferType<TEntity>, type: HashType.Ids): string;\n}\n\nexport type GetHashTypeFunction<TEntity extends {}> = {\n    (entity: InferCreateType<TEntity>): HashType.Object;\n    (entity: InferType<TEntity>): HashType.Ids;\n}\n\nexport type ChangeTrackingType = \"proxy\" | \"diff\" | \"immutable\";\n\nexport type IndexType = \"single\" | \"compound\" | \"unique\" | \"primary-key\"\nexport type Index = {\n    properties: PropertyInfo<any>[],\n    type: IndexType;\n    name: string;\n}\n\n/**\n * Represents changes to subscriptions, categorizing them by modifications to\n * entities (additions, updates, removals) or query-driven removals.\n * @template T - The type of the entities in the subscription.\n */\nexport type SubscriptionChanges<T extends {}> = {\n    /**\n     * Entities that have been added to the subscription.\n     */\n    adds: InferType<T>[];\n    /**\n     * Entities that have been updated within the subscription.\n     */\n    updates: InferType<T>[];\n    /**\n     * Entities that have been removed from the subscription.\n     */\n    removals: InferType<T>[];\n    /**\n     * Entities that have been added/updated/removed from the subscription and it is unknown \n     * if the entities have been added/updated/removed.\n     */\n    unknown: InferType<T>[];\n}\n\nexport interface ISchemaSubscription<T extends {}> extends Disposable {\n    send(changes: SubscriptionChanges<T>): void;\n    onMessage(callback: (changes: SubscriptionChanges<T>) => void): void;\n}\n\ntype Enrich<TEntity extends {}> = {\n    (entity: InferType<TEntity>, changeTrackingType: ChangeTrackingType): InferType<TEntity>;\n    (entity: InferCreateType<TEntity>, changeTrackingType: ChangeTrackingType): InferCreateType<TEntity>;\n}\nexport type Prepare<TEntity extends {}> = {\n    (entity: InferCreateType<TEntity>): InferCreateType<TEntity>;\n    (entity: InferType<TEntity>): InferType<TEntity>;\n}\nexport type Preprocess<TEntity extends {}> = {\n    (entity: InferCreateType<TEntity>): InferType<TEntity>;\n    (entity: InferType<TEntity>): InferType<TEntity>;\n}\n\nexport type CompiledSchemaCore<TEntity extends {}> = Omit<CompiledSchema<TEntity>, \"createSubscription\">;\n\n/**\n * Represents a fully compiled schema with all utilities and metadata for an entity type.\n */\nexport type CompiledSchema<TEntity extends {}> = {\n\n    deserializePartial: (item: Record<string, unknown>, properties: PropertyInfo<TEntity>[]) => DeepPartial<InferType<TEntity>>;\n\n    createSubscription: (abortSignal?: AbortSignal) => ISchemaSubscription<TEntity>;\n    /** Returns the property info for a given id (full path) */\n    getProperty: (id: string) => PropertyInfo<TEntity>;\n    /** Returns the ID of the given entity. */\n    getId: (entity: InferType<TEntity>) => IdType;\n    /** Returns a deep clone of the given entity. */\n    clone: (entity: InferType<TEntity>) => InferType<TEntity>;\n    /** Removes unmapped or extraneous properties from the entity. */\n    strip: (entity: InferType<TEntity>) => InferType<TEntity>;\n    /** Prepares a new entity for creation, applying defaults and transformations. */\n    prepare: Prepare<TEntity>;\n    /** Merges the source entity into the destination entity. */\n    merge: (destination: InferType<TEntity> | InferCreateType<TEntity>, source: InferType<TEntity>) => InferType<TEntity>;\n    /** Indicates if the schema has identity properties. */\n    hasIdentities: boolean;\n    /** List of properties that are identity keys. */\n    idProperties: PropertyInfo<TEntity>[];\n    /** All property metadata for the schema. */\n    properties: PropertyInfo<TEntity>[],\n    /** The hash type used for this schema. */\n    hashType: HashType;\n    /** Computes a hash for the given entity. */\n    hash: HashFunction<TEntity>;\n    /** Returns the hash type for the given entity. */\n    getHashType: GetHashTypeFunction<TEntity>;\n    /** Compares two entities for equality. */\n    compare: (a: InferType<TEntity>, fromDb: InferType<TEntity>) => boolean;\n    /** Deserializes an entity from storage format. */\n    deserialize: (entity: InferType<TEntity>) => InferType<TEntity>;\n\n    /** Combines serializing and preparing an entity for saving. */\n    preprocess: Preprocess<TEntity>;\n    /** Combines deserializing and enriching an entity for selection. */\n    postprocess: Enrich<TEntity>;\n\n    /** Serializes an entity to storage format. */\n    serialize: (entity: InferType<TEntity>) => InferType<TEntity>;\n    /** Unique id for the schema. */\n    id: SchemaId,\n    /** The name of the collection for this schema. */\n    collectionName: CollectionName;\n    /** Returns all IDs for the given entity (usually a single-element tuple). */\n    getIds: (entity: InferType<TEntity>) => [IdType];\n    /** Enriches the entity with change tracking or other metadata. */\n    enrich: Enrich<TEntity>;\n    /** Indicates if the schema has identity keys. */\n    hasIdentityKeys: boolean;\n    /** Returns a deeply frozen (immutable) version of the entity. */\n    freeze: (entity: InferType<TEntity>) => InferType<TEntity>;\n    /** Enables change tracking on the entity. */\n    enableChangeTracking: (entity: InferType<TEntity>) => InferType<TEntity>;\n    /** The schema definition object. */\n    definition: SchemaDefinition<TEntity>;\n    /** Returns all indexes defined for this schema. */\n    getIndexes: () => Index[];\n    /** Compares two entities for Id equality. */\n    compareIds: (a: InferType<TEntity>, b: InferType<TEntity>) => boolean;\n}\n\nexport type PropertySerializer<T extends any> = (value: T) => string | number;\nexport type PropertyDeserializer<T extends any> = (value: string | number) => T;\n\nexport type SchemaId = Branded<number, \"SchemaId\">;\nexport type CollectionName = Branded<string, \"CollectionName\">;\n\nexport type SchemaModifiers = \"default\" | \"deserialize\" |\n    \"identity\" | \"key\" |\n    \"nullable\" | \"optional\" |\n    \"readonly\" | \"serialize\" |\n    \"unmapped\" | \"computed\" |\n    \"distinct\";\n\ntype InferPrimitive<T> =\n    T extends SchemaOptional<infer C, infer __> ? C extends (string | number | Date) ? C : { [K in keyof C]: InferPrimitive<C[K]> } :\n    T extends SchemaArray<infer Y, infer __> ? InferPrimitive<Y>[]\n    : T extends SchemaObject<infer Obj, infer _> ?\n    { [K in keyof Obj]: InferPrimitive<Obj[K]> } : // Process nested objects\n    T extends SchemaFunction<infer F, infer __> ? F : T extends SchemaBase<infer X, infer _> ?\n    X extends Array<infer A> ? InferPrimitive<A>[] : X : // Extract the primitive type\n    never;\n\nexport type InferType<T> = T extends CompiledSchema<infer R> ? InferCompiledSchema<R> : T extends {} ? InferCompiledSchema<T> : T;\nexport type InferCreateType<T> = T extends CompiledSchema<infer R> ? InferCompiledCreateSchema<R> : T extends {} ? InferCompiledCreateSchema<T> : unknown;\nexport type InferMappedType<T> = T extends SchemaBase<infer K, infer __> ? InferType<K> : InferCompiledSchema<T>;\n\ntype HasModifier<T, K extends keyof T, M extends SchemaModifiers> =\n    T[K] extends SchemaBase<any, infer Mods> ?\n    M extends Mods ? true : false :\n    false;\n\ntype IsPlainProperty<T, K extends keyof T> =\n    [\n        HasModifier<T, K, \"readonly\">,\n        HasModifier<T, K, \"optional\">,\n        HasModifier<T, K, \"nullable\">\n    ] extends [\n        false,\n        false,\n        false\n    ] ? true : false;\n\ntype IsPlainCreateProperty<T, K extends keyof T> =\n    [\n        HasModifier<T, K, \"identity\">,\n        HasModifier<T, K, \"default\">,\n        HasModifier<T, K, \"computed\">,\n        HasModifier<T, K, \"unmapped\">,\n        HasModifier<T, K, \"optional\">,\n        HasModifier<T, K, \"nullable\">\n    ] extends [\n        false,\n        false,\n        false,\n        false,\n        false,\n        false\n    ] ? true : false;\n\ntype InferCompiledSchema<T> = CoalesceEmpty<{\n    [K in keyof T as IsPlainProperty<T, K> extends true ? K : never]: InferPrimitive<T[K]>\n}, {\n        readonly [K in keyof T as HasModifier<T, K, \"readonly\"> extends true ? K : never]: InferPrimitive<T[K]>\n    }, {\n        [K in keyof T as HasModifier<T, K, \"optional\"> extends true ? K : never]?: InferPrimitive<T[K]>\n    }, {\n        [K in keyof T as HasModifier<T, K, \"nullable\"> extends true ? K : never]: null | InferPrimitive<T[K]>\n    }>;\n\ntype InferCompiledCreateSchema<T> = CoalesceEmpty<{\n    [K in keyof T as IsPlainCreateProperty<T, K> extends true ? K : never]: InferPrimitive<T[K]>\n}, {\n        [K in keyof T as HasModifier<T, K, \"optional\"> extends true ? K : never]?: InferPrimitive<T[K]>\n    }, {\n        [K in keyof T as HasModifier<T, K, \"default\"> extends true ? K : never]?: InferPrimitive<T[K]>\n    }, {\n        [K in keyof T as HasModifier<T, K, \"nullable\"> extends true ? K : never]: null | InferPrimitive<T[K]>\n    }>;\n\ntype IsEmptyObject<T> = keyof T extends never ? true : false;\ntype CoalesceEmpty<T1 extends {}, T2 extends {}, T3 extends {}, T4 extends {}> = (IsEmptyObject<T1> extends true ? {} : T1) & (IsEmptyObject<T2> extends true ? {} : T2) & (IsEmptyObject<T3> extends true ? {} : T3) & (IsEmptyObject<T4> extends true ? {} : T4);\n","export const uuid = (length: number = 16): string => {\n    const chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';\n    const charLength = chars.length;\n    let result = '';\n\n    for (let i = 0; i < length; i++) {\n        result += chars[Math.random() * charLength | 0];\n    }\n    return result;\n}\n\nconst HEX_CHARS = '0123456789abcdef';\nconst UUID_TEMPLATE = 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx';\n\nconst hasCrypto =\n    typeof crypto !== 'undefined' && typeof crypto.getRandomValues === 'function';\n\nexport const uuidv4 = (): string => {\n    let randomBytes: Uint8Array | null = null;\n    if (hasCrypto) {\n        randomBytes = crypto.getRandomValues(new Uint8Array(16));\n    }\n\n    let byteIndex = 0;\n    let uuid = '';\n\n    for (let i = 0; i < UUID_TEMPLATE.length; i++) {\n        const c = UUID_TEMPLATE[i];\n        if (c === '-') {\n            uuid += '-';\n            continue;\n        }\n\n        let r: number;\n        if (hasCrypto && randomBytes) {\n            // Each byte gives two hex digits (nibbles)\n            r =\n                (i % 2 === 0\n                    ? randomBytes[byteIndex] >> 4\n                    : randomBytes[byteIndex++] & 0x0f);\n        } else {\n            r = Math.floor(Math.random() * 16);\n        }\n\n        if (c === 'x') {\n            uuid += HEX_CHARS[r];\n        } else if (c === 'y') {\n            // Variant bits: 8, 9, A, or B\n            uuid += HEX_CHARS[(r & 0x3) | 0x8];\n        } else if (c === '4') {\n            uuid += '4';\n        }\n    }\n\n    return uuid;\n};\n","__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n        if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n            Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n        }\n    }\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","export * from './Changes';\nexport * from './TagCollection';\nexport * from './IdSet';\nexport * from './MemoryDataCollection';\nexport * from './SchemaCollection';\nexport * from './ReadonlySchemaCollection';"],"names":[],"mappings":";;;;;;;;;;AAEgD;AACzC,MAAM,iBAAkB,SAAQ,GAAkC;IAErE,OAAO,CAAC,QAAkB;QACtB,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,mBAAmB,EAAE,CAAC,CAAC;QAE9C,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAEQ,GAAG,CAAyC,QAAkB;QACnE,OAAO,KAAK,CAAC,GAAG,CAAC,QAAQ,CAA2B;IACxD,CAAC;IAED,IAAI,SAAS;QACT,OAAO;YACH,IAAI,EAAE,IAAI,CAAC,aAAa;YACxB,IAAI,EAAE,IAAI,CAAC,iBAAiB;YAC5B,OAAO,EAAE,IAAI,CAAC,oBAAoB;YAClC,OAAO,EAAE,IAAI,CAAC,oBAAoB;SACrC;IACL,CAAC;IAED,IAAY,aAAa;QACrB,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC;QAC1B,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,IAAY,iBAAiB;QACzB,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;QAChC,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,IAAY,oBAAoB;QAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;QACnC,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,IAAY,oBAAoB;QAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;QACnC,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;CACJ;AAEM,MAAM,kBAAmB,SAAQ,GAAmC;IAEvE,OAAO,CAAC,QAAkB;QACtB,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,oBAAoB,EAAE,CAAC,CAAC;QAE/C,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAEQ,GAAG,CAAyC,QAAkB;QACnE,OAAO,KAAK,CAAC,GAAG,CAAC,QAAQ,CAA4B;IACzD,CAAC;IAED,IAAI,SAAS;QACT,OAAO;YACH,IAAI,EAAE,IAAI,CAAC,aAAa;YACxB,IAAI,EAAE,IAAI,CAAC,iBAAiB;YAC5B,OAAO,EAAE,IAAI,CAAC,oBAAoB;YAClC,OAAO,EAAE,IAAI,CAAC,oBAAoB;SACrC;IACL,CAAC;IAED,IAAY,aAAa;QACrB,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC;QAC1B,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,IAAY,iBAAiB;QACzB,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;QAChC,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,IAAY,oBAAoB;QAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;QACnC,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,IAAY,oBAAoB;QAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;QACnC,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,QAAQ;QACJ,MAAM,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;QAEvC,KAAK,MAAM,CAAC,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,mBAAmB,EAAE,CAAC,CAAC;QACpD,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;CACJ;AAEM,MAAM,oBAAoB;IAC7B,IAAI,GAAyB,EAAE,CAAC;IAChC,OAAO,GAA0B,EAAE,CAAC;IACpC,OAAO,GAAmB,EAAE,CAAC;IAC7B,IAAI,GAAkB,IAAI,6CAAa,EAAE,CAAC;IAE1C,IAAI,QAAQ;QACR,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,IAAI,KAAK;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IACxE,CAAC;CACJ;AAEM,MAAM,mBAAmB;IAC5B,IAAI,GAAmB,EAAE,CAAC;IAC1B,OAAO,GAAmB,EAAE,CAAC;IAC7B,OAAO,GAAmB,EAAE,CAAC;IAE7B,IAAI,QAAQ;QACR,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,IAAI,KAAK;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IACxE,CAAC;CACJ;;;;;;;;;AC9KM,MAAM,KAAK;IAEL,GAAG,CAAoB;IAEhC,YAAY,GAAG,GAAa;QACxB,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,CAAC,KAAY;QAEf,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QAED,OAAO,IAAI,CAAC,QAAQ,EAAE,KAAK,KAAK,CAAC,QAAQ,EAAE,CAAC;IAChD,CAAC;IAED,QAAQ;QAEJ,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC;CACJ;;;;;;;;;;;;;AC3BwF;AACrC;AACd;AACN;AAEzB,MAAM,oBAAoB;IAEV,gBAAgB,CAAsB;IACtC,IAAI,CAAuC;IAC3C,MAAM,CAAsB;IAC5B,YAAY,CAAsB;IAErD,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IAC1B,CAAC;IAED,IAAI,OAAO;QACP,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,YAAY,MAA2B;QACnC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,EAAmC,CAAC;QACvD,IAAI,CAAC,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;QAClD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC;IAC5C,CAAC;IAEO,UAAU,CAAC,QAA2B;QAE1C,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,IAAI,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC;YAClD,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QACxD,CAAC;QAED,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAE/C,OAAO,MAAM,CAAC;IAClB,CAAC;IAEO,SAAS,CAAC,QAA2B,EAAE,KAAc;QACzD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC5B,OAAO;QACX,CAAC;QAED,MAAM,oBAAoB,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAEpE,IAAI,KAAK,IAAI,oBAAoB,EAAE,CAAC;YAChC,OAAO;QACX,CAAC;QAED,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAClD,CAAC;IAEO,WAAW,CAAC,IAA6B,EAAE,QAA2B;QAC1E,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAW,CAAC;QACzC,CAAC;QAED,IAAI,QAAQ,CAAC,IAAI,KAAK,2CAAkB,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,sCAAM,EAAE;YACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YAC3B,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,QAAQ,CAAC,IAAI,KAAK,2CAAkB,EAAE,CAAC;YACvC,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACrC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;YACzB,OAAO,EAAE,CAAC;QACd,CAAC;QAED,MAAM,IAAI,KAAK,CAAC,gBAAgB,QAAQ,CAAC,IAAI,sCAAsC,QAAQ,CAAC,IAAI,GAAG,CAAC;IACxG,CAAC;IAED,IAAI,CAAC,KAAgC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrD,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAuB,CAAC,CAAC;YAC7D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;IACL,CAAC;IAEO,mBAAmB,CAAC,IAA6B;QACrD,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC;QAC9C,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,cAAc;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAEtC,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;gBAChB,MAAM,IAAI,KAAK,CAAC,6BAA6B,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;YAClE,CAAC;YAED,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;QAED,OAAO,IAAI,6BAAK,CAAC,GAAG,GAAG,CAAC,CAAC;IAC7B,CAAC;IAEO,YAAY,CAAC,IAA6B;QAE9C,IAAI,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;YAC9B,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC;YAC9C,MAAM,GAAG,GAAa,IAAI,KAAK,CAAS,YAAY,CAAC,MAAM,CAAC,CAAC;YAE7D,iFAAiF;YACjF,wEAAwE;YACxE,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtD,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBACvC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACJ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClD,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;oBACtD,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;oBACvC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;gBACnB,CAAC;YACL,CAAC;YAED,OAAO,IAAI,6BAAK,CAAC,GAAG,GAAG,CAAC,CAAC;QAC7B,CAAC;QAED,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED,GAAG,CAAC,IAA6B;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,MAAM,CAAC,IAA6B;QAChC,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,CAAC,IAA6B;QAChC,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,CAAC,IAA2B;QAC/B,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QAClB,IAAI,CAAC,wCAAc,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED,IAAI,CAAC,IAA2B;QAC5B,IAAI,CAAC,wCAAc,EAAE,CAAC;IAC1B,CAAC;IAED,IAAI,CAAC,IAA2B;QAC5B,IAAI,CAAC,wCAAc,EAAE,CAAC;IAC1B,CAAC;CACJ;;;;;;;;;ACvJD;;GAEG;AACI,MAAM,wBAAwB;IAEvB,IAAI,CAAyD;IAEvE,YAAY,IAA4D;QACpE,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,CAAoD,IAAI,CAAC,CAAC;IACjF,CAAC;IAED,GAAG,CAAI,QAAkB;QACrB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAkC,CAAC;IACpE,CAAC;IAED,GAAG,CAAC,QAAkB;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;IAED,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IAC1B,CAAC;IAED,IAAI;QACA,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED,MAAM;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;IAC9B,CAAC;IAED,OAAO;QACH,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,OAAO,CAAC,UAAgJ,EAAE,OAAa;QACnK,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAC3C,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;IAED,SAAS,CAAI,cAAsB;QAC/B,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,KAAK,cAAc,CAAC,CAAC;QAE/E,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;YAChB,OAAO,KAAK,CAAC,CAAC,CAAsB,CAAC;QACzC,CAAC;QAED,OAAO,SAAS,CAAC;IACrB,CAAC;CACJ;;;;;;;;;;ACrDqE;AAEtE;;GAEG;AACI,MAAM,gBAAiB,SAAQ,mEAAwB;IAE1D,GAAG,CAAI,QAAkB,EAAE,MAAyB;QAChD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAiD,CAAC,CAAC;QAC3E,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,CAAC,QAAkB;QACrB,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC;IAED,KAAK;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;CACJ;;;;;;;;;ACpBM,MAAM,aAAa;IAEd,IAAI,GAAyB,IAAI,GAAG,EAAmB,CAAC;IACxD,KAAK,GAAW,CAAC,CAAC;IAE1B,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAED,GAAG,CAAC,GAAW;QACX,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,GAAG,CAAC,GAAW;QACX,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,GAAG,CAAC,GAAW,EAAE,GAAY;QACzB,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,CAAC,GAAW;QACd,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAErC,IAAI,MAAM,EAAE,CAAC;YACT,IAAI,CAAC,KAAK,EAAE,CAAC;QACjB,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,OAAO,CAAC,IAAc,EAAE,GAAY;QAChC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACvB,CAAC;IACL,CAAC;IAED,OAAO,CAAC,IAAmB;QACvB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC9B,CAAC;IACL,CAAC;IAED,MAAM;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;IAC9B,CAAC;IAED,IAAI;QACA,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED,CAAC,MAAM,CAAC,OAAO,CAAC;QACZ,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;CACJ;;;;;;;;;;AC3DD,MAAe,UAAU;IACrB,MAAM,CAAC,KAAK,GAAG,OAAgB,CAAC;IAChC,MAAM,CAAC,OAAO,GAAG,SAAkB,CAAC;IACpC,MAAM,CAAC,OAAO,GAAG,SAAkB,CAAC;IAEpC,MAAM,CAAC,OAAO,CAAI,MAA4C,EAAE,OAA0B,EAAE,MAA6B;QACrH,IAAI,MAAM,CAAC,EAAE,KAAK,UAAU,CAAC,OAAO,EAAE,CAAC;YACnC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACrB,OAAO;QACX,CAAC;QAED,IAAI,MAAM,CAAC,EAAE,KAAK,UAAU,CAAC,OAAO,EAAE,CAAC;YACnC,MAAM,CAAC;gBACH,OAAO,EAAE,MAAM,CAAC,IAAI;gBACpB,KAAK,EAAE,MAAM,CAAC,KAAK;aACtB,CAAC,CAAC;YACH,OAAO;QACX,CAAC;QAED,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,MAAM,CAAC,aAAa,CAAI,MAAW;QAC/B,IAAI,MAAM,CAAC,EAAE,KAAK,UAAU,CAAC,OAAO,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,oCAAoC,MAAM,CAAC,EAAE,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QACtF,CAAC;IACL,CAAC;;AAGE,MAAM,MAAO,SAAQ,UAAU;IAGlC,MAAM,CAAC,OAAO,CAAI,IAAQ;QACtB,OAAO;YACH,EAAE,EAAE,MAAM,CAAC,OAAO;YAClB,IAAI;SACP;IACL,CAAC;IAED,MAAM,CAAC,KAAK,CAAI,KAAU;QACtB,OAAO;YACH,EAAE,EAAE,MAAM,CAAC,KAAK;YAChB,KAAK;SACR;IACL,CAAC;IAED,MAAM,CAAC,OAAO,CAAI,IAAO,EAAE,KAAU;QACjC,OAAO;YACH,EAAE,EAAE,MAAM,CAAC,OAAO;YAClB,IAAI;YACJ,KAAK;SACR;IACL,CAAC;CACJ;AAEM,MAAM,iBAAkB,SAAQ,UAAU;IAG7C,MAAM,CAAC,OAAO,CAAI,EAAU,EAAE,IAAQ;QAClC,OAAO;YACH,EAAE;YACF,EAAE,EAAE,MAAM,CAAC,OAAO;YAClB,IAAI;SACP;IACL,CAAC;IAED,MAAM,CAAC,KAAK,CAAI,EAAU,EAAE,KAAU;QAClC,OAAO;YACH,EAAE;YACF,EAAE,EAAE,MAAM,CAAC,KAAK;YAChB,KAAK;SACR;IACL,CAAC;IAED,MAAM,CAAC,OAAO,CAAI,EAAU,EAAE,IAAO,EAAE,KAAU;QAC7C,OAAO;YACH,EAAE;YACF,EAAE,EAAE,MAAM,CAAC,OAAO;YAClB,IAAI;YACJ,KAAK;SACR;IACL,CAAC;IAED,MAAM,CAAC,aAAa,CAAI,MAAgC;QACpD,IAAI,MAAM,CAAC,EAAE,KAAK,MAAM,CAAC,OAAO,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,oCAAoC,MAAM,CAAC,EAAE,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QACtF,CAAC;IACL,CAAC;CACJ;;;;;;;;;;AC5ED,IAAY,WAUX;AAVD,WAAY,WAAW;IACnB,8BAAe;IACf,kCAAmB;IACnB,4BAAa;IACb,gCAAiB;IACjB,gCAAiB;IACjB,gCAAiB;IACjB,wCAAyB;IACzB,oCAAqB;IACrB,oCAAqB;AACzB,CAAC,EAVW,WAAW,KAAX,WAAW,QAUtB;AAoBD,IAAY,QAGX;AAHD,WAAY,QAAQ;IAChB,uBAAW;IACX,6BAAiB;AACrB,CAAC,EAHW,QAAQ,KAAR,QAAQ,QAGnB;;;;;;;;;;AC/CM,MAAM,IAAI,GAAG,CAAC,SAAiB,EAAE,EAAU,EAAE;IAChD,MAAM,KAAK,GAAG,gEAAgE,CAAC;IAC/E,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;IAChC,IAAI,MAAM,GAAG,EAAE,CAAC;IAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,MAAM,SAAS,GAAG,kBAAkB,CAAC;AACrC,MAAM,aAAa,GAAG,sCAAsC,CAAC;AAE7D,MAAM,SAAS,GACX,OAAO,MAAM,KAAK,WAAW,IAAI,OAAO,MAAM,CAAC,eAAe,KAAK,UAAU,CAAC;AAE3E,MAAM,MAAM,GAAG,GAAW,EAAE;IAC/B,IAAI,WAAW,GAAsB,IAAI,CAAC;IAC1C,IAAI,SAAS,EAAE,CAAC;QACZ,WAAW,GAAG,MAAM,CAAC,eAAe,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,IAAI,GAAG,EAAE,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACZ,IAAI,IAAI,GAAG,CAAC;YACZ,SAAS;QACb,CAAC;QAED,IAAI,CAAS,CAAC;QACd,IAAI,SAAS,IAAI,WAAW,EAAE,CAAC;YAC3B,2CAA2C;YAC3C,CAAC;gBACG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;oBACR,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC7B,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;QAC/C,CAAC;aAAM,CAAC;YACJ,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QACvC,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACZ,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;aAAM,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACnB,8BAA8B;YAC9B,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;QACvC,CAAC;aAAM,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACnB,IAAI,IAAI,GAAG,CAAC;QAChB,CAAC;IACL,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACvDF;AACA;AACA;AACA,kDAAkD,wCAAwC;AAC1F;AACA;AACA,E;;;;ACNA,wF;;;;ACAA;AACA;AACA;AACA,uDAAuD,iBAAiB;AACxE;AACA,gDAAgD,aAAa;AAC7D,E;;;;;;;;;;;;;;;;;;;;;;;ACN0B;AACM;AACR;AACe;AACJ;AACQ"}
+{"version":3,"file":"collections/index.js","sources":["webpack://@routier/core/./src/collections/Changes.ts","webpack://@routier/core/./src/collections/ReadonlySchemaCollection.ts","webpack://@routier/core/./src/collections/SchemaCollection.ts","webpack://@routier/core/./src/collections/TagCollection.ts","webpack://@routier/core/./src/results/Result.ts","webpack://@routier/core/./src/schema/types.ts","webpack://@routier/core/./src/utilities/uuid.ts","webpack://@routier/core/webpack/runtime/define_property_getters","webpack://@routier/core/webpack/runtime/has_own_property","webpack://@routier/core/./src/collections/IdSet.ts","webpack://@routier/core/./src/collections/MemoryDataCollection.ts","webpack://@routier/core/./src/collections/index.ts"],"sourcesContent":["import { EntityUpdateInfo } from \"../plugins/types\";\nimport { InferCreateType, InferType, SchemaId } from \"../schema\";\nimport { TagCollection } from \"./TagCollection\";\nexport class BulkPersistResult extends Map<SchemaId, SchemaPersistResult> {\n\n    resolve<T extends {} = Record<string, unknown>>(schemaId: SchemaId): SchemaPersistResult<T> {\n        if (this.has(schemaId)) {\n            return this.get(schemaId);\n        }\n\n        this.set(schemaId, new SchemaPersistResult<T>());\n\n        return this.get(schemaId);\n    }\n\n    override get<T extends {} = Record<string, unknown>>(schemaId: SchemaId) {\n        return super.get(schemaId) as SchemaPersistResult<T>\n    }\n\n    get aggregate() {\n        return {\n            size: this.aggregateSize,\n            adds: this.aggregateAddsSize,\n            updates: this.aggregateUpdatesSize,\n            removes: this.aggregateRemovesSize\n        }\n    }\n\n    private get aggregateSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.total;\n        }\n\n        return count;\n    }\n\n    private get aggregateAddsSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.adds.length;\n        }\n\n        return count;\n    }\n\n    private get aggregateUpdatesSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.updates.length;\n        }\n\n        return count;\n    }\n\n    private get aggregateRemovesSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.removes.length;\n        }\n\n        return count;\n    }\n}\n\nexport class BulkPersistChanges extends Map<SchemaId, SchemaPersistChanges> {\n\n    resolve<T extends {} = Record<string, unknown>>(schemaId: SchemaId): SchemaPersistChanges<T> {\n        if (this.has(schemaId)) {\n            return this.get(schemaId);\n        }\n\n        this.set(schemaId, new SchemaPersistChanges<T>());\n\n        return this.get(schemaId);\n    }\n\n    override get<T extends {} = Record<string, unknown>>(schemaId: SchemaId) {\n        return super.get(schemaId) as SchemaPersistChanges<T>\n    }\n\n    get aggregate() {\n        return {\n            size: this.aggregateSize,\n            adds: this.aggregateAddsSize,\n            updates: this.aggregateUpdatesSize,\n            removes: this.aggregateRemovesSize\n        }\n    }\n\n    private get aggregateSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.total;\n        }\n\n        return count;\n    }\n\n    private get aggregateAddsSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.adds.length;\n        }\n\n        return count;\n    }\n\n    private get aggregateUpdatesSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.updates.length;\n        }\n\n        return count;\n    }\n\n    private get aggregateRemovesSize() {\n        let count = 0;\n\n        for (const [, result] of this) {\n            count += result.removes.length;\n        }\n\n        return count;\n    }\n\n    /**\n     * Ensures the result has the same result sets as the change sets\n     * @returns \n     */\n    toResult() {\n        const result = new BulkPersistResult();\n\n        for (const [schemaId] of this) {\n            result.set(schemaId, new SchemaPersistResult());\n        }\n\n        return result;\n    }\n}\n\nexport class SchemaPersistChanges<T extends {} = Record<string, unknown>> {\n    adds: InferCreateType<T>[] = [];\n    updates: EntityUpdateInfo<T>[] = [];\n    removes: InferType<T>[] = [];\n    tags: TagCollection = new TagCollection();\n\n    get hasItems() {\n        return this.total > 0;\n    }\n\n    get total() {\n        return this.adds.length + this.updates.length + this.removes.length;\n    }\n}\n\nexport class SchemaPersistResult<T extends {} = Record<string, unknown>> {\n    adds: InferType<T>[] = [];\n    updates: InferType<T>[] = [];\n    removes: InferType<T>[] = [];\n\n    get hasItems() {\n        return this.total > 0;\n    }\n\n    get total() {\n        return this.adds.length + this.updates.length + this.removes.length;\n    }\n}","import { CompiledSchema, SchemaId } from \"../schema\";\n\n/**\n * Collection of schemas with generic typing for type-safe schema retrieval\n */\nexport class ReadonlySchemaCollection {\n\n    protected data: Map<SchemaId, CompiledSchema<Record<string, unknown>>>;\n\n    constructor(data?: [SchemaId, CompiledSchema<Record<string, unknown>>][]) {\n        this.data = new Map<SchemaId, CompiledSchema<Record<string, unknown>>>(data);\n    }\n\n    get<T>(schemaId: SchemaId): CompiledSchema<T> | undefined {\n        return this.data.get(schemaId) as CompiledSchema<T> | undefined;\n    }\n\n    has(schemaId: SchemaId): boolean {\n        return this.data.has(schemaId);\n    }\n\n    get size(): number {\n        return this.data.size;\n    }\n\n    keys(): IterableIterator<SchemaId> {\n        return this.data.keys();\n    }\n\n    values(): IterableIterator<CompiledSchema<Record<string, unknown>>> {\n        return this.data.values();\n    }\n\n    entries(): IterableIterator<[SchemaId, CompiledSchema<Record<string, unknown>>]> {\n        return this.data.entries();\n    }\n\n    forEach(callbackfn: (value: CompiledSchema<Record<string, unknown>>, key: SchemaId, map: Map<SchemaId, CompiledSchema<Record<string, unknown>>>) => void, thisArg?: any): void {\n        this.data.forEach(callbackfn, thisArg);\n    }\n\n    [Symbol.iterator](): IterableIterator<[SchemaId, CompiledSchema<Record<string, unknown>>]> {\n        return this.data[Symbol.iterator]();\n    }\n\n    getByName<T>(collectionName: string): CompiledSchema<T> | undefined {\n        const found = [...this.data].find(x => x[1].collectionName === collectionName);\n\n        if (found != null) {\n            return found[1] as CompiledSchema<T>;\n        }\n\n        return undefined;\n    }\n}","import { CompiledSchema, SchemaId } from \"../schema\";\nimport { ReadonlySchemaCollection } from \"./ReadonlySchemaCollection\";\n\n/**\n * Collection of schemas with generic typing for type-safe schema retrieval\n */\nexport class SchemaCollection extends ReadonlySchemaCollection {\n\n    set<T>(schemaId: SchemaId, schema: CompiledSchema<T>): this {\n        this.data.set(schemaId, schema as CompiledSchema<Record<string, unknown>>);\n        return this;\n    }\n\n    delete(schemaId: SchemaId): boolean {\n        return this.data.delete(schemaId);\n    }\n\n    clear(): void {\n        this.data.clear();\n    }\n}","export class TagCollection implements Disposable {\n\n    private data: Map<object, unknown> = new Map<object, unknown>();\n\n    // Delegated to the map rather than tracked in a counter field: every mutation path\n    // (set, setMany, combine, delete, dispose) would otherwise have to maintain it, and\n    // a missed path silently reports a size that disagrees with the contents.\n    get size() {\n        return this.data.size;\n    }\n\n    get(key: object) {\n        return this.data.get(key);\n    }\n\n    has(key: object) {\n        return this.data.has(key);\n    }\n\n    set(key: object, tag: unknown) {\n        return this.data.set(key, tag);\n    }\n\n    delete(key: object) {\n        return this.data.delete(key);\n    }\n\n    setMany(keys: object[], tag: unknown) {\n        for (let i = 0, length = keys.length; i < length; i++) {\n            const key = keys[i];\n            this.set(key, tag);\n        }\n    }\n\n    combine(tags: TagCollection) {\n        for (const [key, value] of tags) {\n            this.set(key, value);\n        }\n    }\n\n    values() {\n        return this.data.values();\n    }\n\n    keys() {\n        return this.data.keys();\n    }\n\n    [Symbol.dispose]() {\n        this.data.clear();\n    }\n\n    [Symbol.iterator]() {\n        return this.data[Symbol.iterator]();\n    }\n}","import { PartialResultType, PluginEventPartialResultType, PluginEventResultType, ResultType } from \"./types\";\n\nabstract class BaseResult {\n    static ERROR = \"error\" as const;\n    static SUCCESS = \"success\" as const;\n    static PARTIAL = \"partial\" as const;\n\n    static resolve<T>(result: ResultType<T> | PartialResultType<T>, resolve: (data: T) => void, reject: (error?: any) => void) {\n        if (result.ok === BaseResult.SUCCESS) {\n            resolve(result.data);\n            return;\n        }\n\n        if (result.ok === BaseResult.PARTIAL) {\n            reject({\n                partial: result.data,\n                error: result.error\n            });\n            return;\n        }\n\n        reject(result.error);\n    }\n\n    static assertSuccess<T>(result: any): asserts result is { ok: \"success\"; data: T } {\n        if (result.ok !== BaseResult.SUCCESS) {\n            throw new Error(`Expected success result, but got ${result.ok}: ${result.error}`);\n        }\n    }\n}\n\nexport class Result extends BaseResult {\n    static success<T>(data: T): ResultType<T>;\n    static success(): ResultType<never>;\n    static success<T>(data?: T): ResultType<T> {\n        return {\n            ok: Result.SUCCESS,\n            data\n        }\n    }\n\n    static error<T>(error: any): ResultType<T> {\n        return {\n            ok: Result.ERROR,\n            error\n        }\n    }\n\n    static partial<T>(data: T, error: any): PartialResultType<T> {\n        return {\n            ok: Result.PARTIAL,\n            data,\n            error\n        }\n    }\n}\n\nexport class PluginEventResult extends BaseResult {\n    static success<T>(id: string, data: T): PluginEventResultType<T>;\n    static success(id: string): PluginEventResultType<never>;\n    static success<T>(id: string, data?: T): PluginEventResultType<T> {\n        return {\n            id,\n            ok: Result.SUCCESS,\n            data\n        }\n    }\n\n    static error<T>(id: string, error: any): PluginEventResultType<T> {\n        return {\n            id,\n            ok: Result.ERROR,\n            error\n        }\n    }\n\n    static partial<T>(id: string, data: T, error: any): PluginEventPartialResultType<T> {\n        return {\n            id,\n            ok: Result.PARTIAL,\n            data,\n            error\n        }\n    }\n\n    static assertSuccess<T>(result: PluginEventResultType<T>): asserts result is { ok: \"success\"; data: T; id: string } {\n        if (result.ok !== Result.SUCCESS) {\n            throw new Error(`Expected success result, but got ${result.ok}: ${result.error}`);\n        }\n    }\n}\n","import type { SchemaDefinition } from \"./SchemaDefinition\";\nimport type { SchemaBase } from \"./property/base/SchemaBase\";\nimport type { SchemaArray } from \"./property/types/SchemaArray\";\nimport type { SchemaVector } from \"./property/types/SchemaVector\";\nimport type { SchemaObject } from \"./property/types/SchemaObject\";\nimport type { PropertyInfo } from \"./PropertyInfo\";\nimport type { DeepPartial } from \"../types\";\nimport type { SchemaFunction } from \"./table\";\nimport type { SchemaOptional, SchemaTag } from \"./property/modifiers\";\nimport type { Branded } from \"../utilities/types\";\nimport type { SchemaSubscriptionOptions } from \"./communication/broadcast\";\n\nexport type DefaultValue<T, I = never> = T | ((injected: I) => T);\nexport type FunctionBody<TEntity, TResult> = (entity: TEntity, collectionName: CollectionName) => TResult;\nexport type IdType = string | number;\nexport type ForeignKey<T extends {}> = { \n    schema: CompiledSchema<T>, \n    property: PropertyInfo<T> \n};\n\nexport enum SchemaTypes {\n    Array = \"Array\",\n    Boolean = \"Boolean\",\n    Date = \"Date\",\n    Number = \"Number\",\n    Object = \"Object\",\n    String = \"String\",\n    Definition = \"Definition\",\n    Function = \"Function\",\n    Computed = \"Computed\",\n    /**\n     * Content in, reference out. The only type whose write shape differs from its stored\n     * shape, and a leaf on purpose — see `SchemaFile`.\n     */\n    File = \"File\",\n    /**\n     * A fixed-length list of numbers, carrying its dimension count — see `SchemaVector`.\n     *\n     * Value-shaped exactly like `s.array(s.number())`, which is why every array codegen\n     * handler accepts it. It is a distinct type only so a backend can recognise it and store\n     * it natively; nothing else needs to tell the two apart.\n     */\n    Vector = \"Vector\"\n}\n\nexport type ArrayShape = string | number | Date | {};\n\n\n/**\n * What a file property gives back: where the bytes are and what they are.\n *\n * Declared in core so `InferType` can name it. Core never reads or writes the bytes — it only\n * carries this shape — and `@routier/blob-plugin` is what puts one here.\n */\nexport type FileReferenceValue = {\n    /** Where the bytes live, content-addressed by the blob plugin. */\n    key: string;\n    /** Byte length. */\n    size: number;\n    /** Media type as supplied at upload. */\n    contentType: string;\n    /** SHA-256 of the bytes, lowercase hex. */\n    checksum: string;\n    /** The name to show a user. Not part of the key. */\n    fileName: string;\n};\n\n/**\n * What a file property ACCEPTS: content, or a reference you already have.\n *\n * `Blob` covers `File`, which is what an `<input type=\"file\">` yields. A reference is accepted\n * too, so re-saving an entity that was read from the database does not have to re-upload it.\n */\nexport type FileContentValue =\n    | FileReferenceValue\n    | Uint8Array\n    | ArrayBuffer\n    | Blob\n    | string;\n\n/**\n * What a vector property holds, in and out: a plain list of numbers.\n *\n * Named rather than written inline because the inference rules have to recognise it after a\n * modifier has erased which class produced it — the same problem `FileReferenceValue` solves\n * above, and for the same reason.\n */\nexport type VectorValue = number[];\n\n/**\n * What `s.string({ ... })` accepts.\n *\n * Declarations only. Core stores them and never acts on them; a backend that can use one does.\n */\nexport type StringOptions = {\n    /**\n     * The longest value the property is declared to hold.\n     *\n     * MySQL uses it for `VARCHAR(maxLength)`; without it every string column is\n     * `VARCHAR(255)`, which silently truncates longer values. Other backends ignore it. Core\n     * never validates a value against it — see `SchemaBase.maxLength`.\n     */\n    maxLength?: number;\n};\n\nexport type ExpandedProperty = ExpandedChildProperty & {\n    assignmentPath: string;\n    selectorPath: string;\n    properties: Map<string, ExpandedChildProperty>;\n    childDegree: number;\n};\n\nexport type ExpandedChildProperty = {\n    propertyName: string;\n    type: SchemaTypes;\n    isNullableOrOptional: boolean;\n    isReadonly: boolean;\n    isIdentity: boolean;\n    isUnmapped: boolean;\n}\n\nexport enum HashType {\n    Ids = \"Ids\",\n    Object = \"Object\"\n}\n\nexport type HashFunction<TEntity extends {}> = {\n    (entity: InferCreateType<TEntity>, type: HashType.Object): string;\n    (entity: InferType<TEntity>, type: HashType.Ids): string;\n}\n\nexport type GetHashTypeFunction<TEntity extends {}> = {\n    (entity: InferCreateType<TEntity>): HashType.Object;\n    (entity: InferType<TEntity>): HashType.Ids;\n}\n\nexport type ChangeTrackingType = \"proxy\" | \"diff\" | \"immutable\";\n\nexport type IndexType = \"single\" | \"compound\" | \"unique\" | \"primary-key\"\nexport type Index = {\n    properties: PropertyInfo<any>[],\n    type: IndexType;\n    name: string;\n}\n\n/**\n * Represents changes to subscriptions, categorizing them by modifications to\n * entities (additions, updates, removals) or query-driven removals.\n * @template T - The type of the entities in the subscription.\n */\nexport type SubscriptionChanges<T extends {}> = {\n    /**\n     * Entities that have been added to the subscription.\n     */\n    adds: InferType<T>[];\n    /**\n     * Entities that have been updated within the subscription.\n     */\n    updates: InferType<T>[];\n    /**\n     * Entities that have been removed from the subscription.\n     */\n    removals: InferType<T>[];\n    /**\n     * Entities that have been added/updated/removed from the subscription and it is unknown \n     * if the entities have been added/updated/removed.\n     */\n    unknown: InferType<T>[];\n}\n\nexport interface ISchemaSubscription<T extends {}> extends Disposable {\n    send(changes: SubscriptionChanges<T>): void;\n    onMessage(callback: (changes: SubscriptionChanges<T>) => void): void;\n}\n\nexport type Enrich<TEntity extends {}> = {\n    (entity: InferType<TEntity>, changeTrackingType: ChangeTrackingType): InferType<TEntity>;\n    (entity: InferCreateType<TEntity>, changeTrackingType: ChangeTrackingType): InferCreateType<TEntity>;\n}\nexport type Prepare<TEntity extends {}> = {\n    (entity: InferCreateType<TEntity>): InferCreateType<TEntity>;\n    (entity: InferType<TEntity>): InferType<TEntity>;\n}\nexport type Preprocess<TEntity extends {}> = {\n    (entity: InferCreateType<TEntity>): InferType<TEntity>;\n    (entity: InferType<TEntity>): InferType<TEntity>;\n}\n\nexport type SetProperties<TEntity extends {}> = (destination: DeepPartial<InferType<TEntity> | InferCreateType<TEntity>>, source: DeepPartial<InferType<TEntity> | InferCreateType<TEntity>>) => void;\n\nexport type CompiledSchemaCore<TEntity extends {}> = Omit<CompiledSchema<TEntity>, \"createSubscription\">;\n\nexport type CompiledSchemaWithMetadata<TEntity extends {}, TMetadata> = {\n    readonly metadata: TMetadata;\n} & CompiledSchema<TEntity>;\n\n/**\n * Represents a fully compiled schema with all utilities and metadata for an entity type.\n */\nexport type CompiledSchema<TEntity extends {}> = {\n\n    deserializePartial: (item: Record<string, unknown>, properties: PropertyInfo<TEntity>[]) => DeepPartial<InferType<TEntity>>;\n\n    createSubscription: (abortSignal?: AbortSignal, scope?: string, options?: SchemaSubscriptionOptions) => ISchemaSubscription<TEntity>;\n    /** Returns the property info for a given id (full path) */\n    getProperty: (id: string) => PropertyInfo<TEntity>;\n    /** Returns the ID of the given entity. */\n    getId: (entity: InferType<TEntity>) => IdType;\n    /** Returns a deep clone of the given entity. */\n    clone: (entity: InferType<TEntity>) => InferType<TEntity>;\n    /**\n     * Returns a deep clone of a record that is still in the STORAGE shape — renamed properties\n     * under their `from` names rather than their in-memory names.\n     *\n     * `clone` reads in-memory names, so it returns `undefined` for every renamed property of a\n     * stored record. Use this when copying rows a store holds before they have been deserialized.\n     * Generated on first call; schemas that are never cloned in storage shape never build it.\n     */\n    cloneStorage: (entity: InferType<TEntity>) => InferType<TEntity>;\n    /** Removes unmapped or extraneous properties from the entity. */\n    strip: (entity: InferType<TEntity>) => InferType<TEntity>;\n    /** Prepares a new entity for creation, applying defaults and transformations. */\n    prepare: Prepare<TEntity>;\n    /** Merges the source entity into the destination entity. */\n    merge: (destination: InferType<TEntity> | InferCreateType<TEntity>, source: InferType<TEntity>) => InferType<TEntity>;\n    /** Indicates if the schema has identity properties. */\n    hasIdentities: boolean;\n    /** List of properties that are identity keys. */\n    idProperties: PropertyInfo<TEntity>[];\n    /** All property metadata for the schema. */\n    properties: PropertyInfo<TEntity>[],\n    /** The hash type used for this schema. */\n    hashType: HashType;\n    /** Computes a hash for the given entity. */\n    hash: HashFunction<TEntity>;\n    /** Returns the hash type for the given entity. */\n    getHashType: GetHashTypeFunction<TEntity>;\n    /** Compares two entities for equality. */\n    compare: (a: InferType<TEntity>, fromDb: InferType<TEntity>) => boolean;\n    /** Deserializes an entity from storage format. */\n    deserialize: (entity: InferType<TEntity>) => InferType<TEntity>;\n    /** Sets 1 or many properties from the source object onto the destination object with change tracking. */\n    set: SetProperties<TEntity>;\n    /** Combines serializing and preparing an entity for saving. */\n    preprocess: Preprocess<TEntity>;\n    /** Combines deserializing and enriching an entity for selection. */\n    postprocess: Enrich<TEntity>;\n\n    /** Serializes an entity to storage format. */\n    serialize: (entity: InferType<TEntity>) => InferType<TEntity>;\n    /** Unique id for the schema. */\n    id: SchemaId,\n    /** The name of the collection for this schema. */\n    collectionName: CollectionName;\n    /** Returns all IDs for the given entity (usually a single-element tuple). */\n    getIds: (entity: InferType<TEntity>) => [IdType];\n    /** Enriches the entity with change tracking or other metadata. */\n    enrich: Enrich<TEntity>;\n    /** Indicates if the schema has identity keys. */\n    hasIdentityKeys: boolean;\n    /** Returns a deeply frozen (immutable) version of the entity. */\n    freeze: (entity: InferType<TEntity>) => InferType<TEntity>;\n    /** Enables change tracking on the entity. */\n    enableChangeTracking: (entity: InferType<TEntity>) => InferType<TEntity>;\n    /** The schema definition object. */\n    definition: SchemaDefinition<TEntity>;\n    /** Returns all indexes defined for this schema. */\n    getIndexes: () => Index[];\n    /** Compares two entities for Id equality. */\n    compareIds: (a: InferType<TEntity>, b: InferType<TEntity>) => boolean;\n}\n\nexport type PropertySerializer<T extends any> = (value: T) => string | number;\nexport type PropertyDeserializer<T extends any> = (value: string | number) => T;\n\n/**\n * A two-way transform between the application value and the stored value.\n *\n * Both directions may be async. Held as a live reference rather than stringified, so a\n * closure works and `injected` is a convenience rather than the only way in.\n */\nexport type PropertyTransform<T extends any> = {\n    /**\n     * Application value to stored value. Runs before the plugin sees it. May be async.\n     *\n     * `entity` is there for the one-way case: a transform with no `from` derives a value\n     * rather than converting one, which is what `computed` does.\n     */\n    to: (value: T, entity: Record<string, unknown>) => unknown | Promise<unknown>;\n\n    /**\n     * Stored value back to application value. Runs after the plugin returns it.\n     *\n     * Optional. Leave it out and the transform is one-way: the stored value is the value.\n     */\n    from?: (value: unknown) => T | Promise<T>;\n\n    /**\n     * What the column becomes, when the stored form is not the property's own type.\n     *\n     * Defaults to the property's own type, so nothing changes unless you say it does. A\n     * library that always produces text — a cipher, a compressor — sets this once, and the\n     * caller who uses that library never writes it.\n     */\n    stores?: SchemaTypes;\n\n    /**\n     * Whether a filter on this property can still run in the database.\n     *\n     * Defaults to `none`, which rejects the filter rather than returning wrong rows. Set\n     * `equality` only when `to` is deterministic.\n     */\n    comparable?: 'equality' | 'none';\n};\n\nexport type SchemaId = Branded<number, \"SchemaId\">;\nexport type CollectionName = Branded<string, \"CollectionName\">;\n\nexport type SchemaModifiers = \"default\" | \"deserialize\" |\n    \"identity\" | \"key\" |\n    \"nullable\" | \"optional\" |\n    \"readonly\" | \"serialize\" |\n    \"unmapped\" | \"computed\" |\n    \"distinct\" | \"searchable\";\n\n/**\n * What a tagged property infers to.\n *\n * `tag()` is metadata and must not change a type, but `SchemaTag<T>` carries the same `T` as\n * whatever it wrapped without carrying which class that was. For a string `T` is already\n * `string`; for an object `T` is the map of child schemas, which only the `SchemaObject`\n * branch below knows how to unwrap. Falling through to the generic `SchemaBase` branch\n * therefore handed the raw map back, so `s.object({ key: s.string() }).tag('x')` typed\n * `key` as `SchemaString` instead of `string` — everything ran, and only the types lied.\n *\n * An array is distinguishable because `SchemaArray`'s parameter is the ELEMENT schema, so a\n * tagged array arrives here as a `SchemaBase` rather than a plain map.\n */\ntype InferTagged<C> = ResolveWrapped<C>;\n\n/**\n * What a wrapping modifier's inner type resolves to.\n *\n * `SchemaOptional`, `SchemaNullable` and `SchemaTag` all carry the same `C` as whatever they\n * wrapped, without carrying which class that was, so each has to work out what it is holding.\n * Three shapes are possible:\n *\n * - an already-resolved value (`string` from `s.string()`, a file reference from `s.file()`)\n * - an ELEMENT schema, which is what `SchemaArray` parameterises on\n * - a map of child schemas, which is what `SchemaObject` parameterises on\n *\n * Getting this wrong is silent. The map branch applied to an already-resolved object walks\n * its keys and infers `never` for each, so `s.file().optional()` typed as\n * `{ key: never, size: never, ... }` — which no value can satisfy and no test would catch at\n * runtime.\n */\ntype ResolveWrapped<C> =\n    C extends string | number | boolean | Date | FileReferenceValue ? C :\n    C extends VectorValue ? C :\n    C extends SchemaBase<any, any> ? InferPrimitive<C>[] :\n    { [K in keyof C]: InferPrimitive<C[K]> };\n\ntype InferPrimitive<T> =\n    T extends SchemaOptional<infer C, infer __> ? ResolveWrapped<C> :\n    T extends SchemaTag<infer C, infer __> ? InferTagged<C> :\n    // Before the generic `SchemaBase` branch below, which would see `X = number[]` and map\n    // the element through `InferPrimitive<number>` — no branch matches a bare `number`, so a\n    // vector would type as `never[]`: assignable from nothing, and invisible at runtime.\n    T extends SchemaVector<infer __, infer ___> ? VectorValue :\n    T extends SchemaArray<infer Y, infer __> ? InferPrimitive<Y>[]\n    : T extends SchemaObject<infer Obj, infer _> ?\n    { [K in keyof Obj]: InferPrimitive<Obj[K]> } : // Process nested objects\n    T extends SchemaFunction<infer F, infer __> ? F : T extends SchemaBase<infer X, infer _> ?\n    X extends Array<infer A> ? InferPrimitive<A>[] : X : // Extract the primitive type\n    never;\n\nexport type InferType<T> = T extends CompiledSchema<infer R> ? InferCompiledSchema<R> : T extends {} ? InferCompiledSchema<T> : T;\nexport type InferCreateType<T> = T extends CompiledSchema<infer R> ? InferCompiledCreateSchema<R> : T extends {} ? InferCompiledCreateSchema<T> : unknown;\nexport type InferMappedType<T> = T extends SchemaBase<infer K, infer __> ? InferType<K> : InferCompiledSchema<T>;\nexport type InferRoot<T> = T extends CompiledSchema<infer R> ? R : never;\n\ntype HasModifier<T, K extends keyof T, M extends SchemaModifiers> =\n    T[K] extends SchemaBase<any, infer Mods> ?\n    M extends Mods ? true : false :\n    false;\n\ntype IsPlainProperty<T, K extends keyof T> =\n    [\n        HasModifier<T, K, \"readonly\">,\n        HasModifier<T, K, \"optional\">,\n        HasModifier<T, K, \"nullable\">\n    ] extends [\n        false,\n        false,\n        false\n    ] ? true : false;\n\ntype IsCreateExcluded<T, K extends keyof T> =\n    [\n        HasModifier<T, K, \"identity\">,\n        HasModifier<T, K, \"computed\">,\n        HasModifier<T, K, \"unmapped\">\n    ] extends [\n        false,\n        false,\n        false\n    ] ? false : true;\n\ntype IsCreateOptional<T, K extends keyof T> =\n    [\n        HasModifier<T, K, \"optional\">,\n        HasModifier<T, K, \"default\">\n    ] extends [\n        false,\n        false\n    ] ? false : true;\n\ntype IsCreateNullable<T, K extends keyof T> =\n    HasModifier<T, K, \"nullable\"> extends true ? true : false;\n\n/**\n * What a property ACCEPTS on the way in, which is not always what it gives back.\n *\n * Only a file differs today: you assign content and read a reference. Matching on the read\n * type rather than on `SchemaFile` itself is deliberate — it keeps working through every\n * modifier. `s.file().optional()` is a `SchemaOptional`, `s.file().tag('x')` is a\n * `SchemaTag`, and neither carries the original class, so a check against the class alone\n * would silently stop accepting content the moment anyone added a modifier.\n *\n * Assignability is required in BOTH directions, and the tuple wrappers are load-bearing.\n * One-way `extends` matches `never` — which is assignable to everything — so a generic\n * property over `Record<string, unknown>` resolved to file content and broke the Dexie\n * plugin's types. It also matched any object that merely happens to have these five fields\n * plus more. Mutual assignability admits the reference shape and nothing else, and the\n * tuples stop the conditional distributing over a union.\n */\ntype InferWritePrimitive<T> =\n    [InferPrimitive<T>] extends [FileReferenceValue]\n    ? [FileReferenceValue] extends [InferPrimitive<T>] ? FileContentValue : InferPrimitive<T>\n    : InferPrimitive<T>;\n\ntype InferCreateProperty<T, K extends keyof T> =\n    IsCreateNullable<T, K> extends true ? null | InferWritePrimitive<T[K]> : InferWritePrimitive<T[K]>;\n\ntype InferCompiledSchema<T> = CoalesceEmpty<{\n    [K in keyof T as IsPlainProperty<T, K> extends true ? K : never]: InferPrimitive<T[K]>\n}, {\n        readonly [K in keyof T as HasModifier<T, K, \"readonly\"> extends true ? K : never]: InferPrimitive<T[K]>\n    }, {\n        [K in keyof T as HasModifier<T, K, \"optional\"> extends true ? K : never]?: InferPrimitive<T[K]>\n    }, {\n        [K in keyof T as HasModifier<T, K, \"nullable\"> extends true ? K : never]: null | InferPrimitive<T[K]>\n}>;\n\ntype InferCompiledCreateSchema<T> = {\n    [K in keyof T as IsCreateExcluded<T, K> extends true ? never\n        : IsCreateOptional<T, K> extends true ? K : never]?: InferCreateProperty<T, K>\n} & {\n    [K in keyof T as IsCreateExcluded<T, K> extends true ? never\n        : IsCreateOptional<T, K> extends true ? never : K]: InferCreateProperty<T, K>\n};\n\ntype IsEmptyObject<T> = keyof T extends never ? true : false;\ntype CoalesceEmpty<T1 extends {}, T2 extends {}, T3 extends {}, T4 extends {}> = (IsEmptyObject<T1> extends true ? {} : T1) & (IsEmptyObject<T2> extends true ? {} : T2) & (IsEmptyObject<T3> extends true ? {} : T3) & (IsEmptyObject<T4> extends true ? {} : T4);\n","export const uuid = (length: number = 16): string => {\n    const chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';\n    const charLength = chars.length;\n    let result = '';\n\n    for (let i = 0; i < length; i++) {\n        result += chars[Math.random() * charLength | 0];\n    }\n    return result;\n}\n\nconst HEX_CHARS = '0123456789abcdef';\nconst UUID_TEMPLATE = 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx';\n\nconst hasCrypto =\n    typeof crypto !== 'undefined' && typeof crypto.getRandomValues === 'function';\n\nconst hasRandomUUID =\n    typeof crypto !== 'undefined' && typeof crypto.randomUUID === 'function';\n\nexport const uuidv4 = (): string => {\n    if (hasRandomUUID) {\n        return crypto.randomUUID();\n    }\n\n    return uuidv4Fallback();\n};\n\nconst uuidv4Fallback = (): string => {\n    let randomBytes: Uint8Array | null = null;\n    if (hasCrypto) {\n        randomBytes = crypto.getRandomValues(new Uint8Array(16));\n    }\n\n    let byteIndex = 0;\n    let uuid = '';\n\n    for (let i = 0; i < UUID_TEMPLATE.length; i++) {\n        const c = UUID_TEMPLATE[i];\n        if (c === '-') {\n            uuid += '-';\n            continue;\n        }\n\n        let r: number;\n        if (hasCrypto && randomBytes) {\n            // Each byte gives two hex digits (nibbles)\n            r =\n                (i % 2 === 0\n                    ? randomBytes[byteIndex] >> 4\n                    : randomBytes[byteIndex++] & 0x0f);\n        } else {\n            r = Math.floor(Math.random() * 16);\n        }\n\n        if (c === 'x') {\n            uuid += HEX_CHARS[r];\n        } else if (c === 'y') {\n            // Variant bits: 8, 9, A, or B\n            uuid += HEX_CHARS[(r & 0x3) | 0x8];\n        } else if (c === '4') {\n            uuid += '4';\n        }\n    }\n\n    return uuid;\n};\n","__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n        if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n            Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n        }\n    }\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","import { IdType } from \"../schema\";\n\nexport class IdSet {\n\n    readonly ids: readonly IdType[];\n\n    constructor(...ids: IdType[]) {\n        this.ids = Object.freeze(ids);\n    }\n\n    equals(other: IdSet): boolean {\n\n        if (this.ids.length === 1) {\n            return this.ids[0] === other.ids[0];\n        }\n\n        return this.toString() === other.toString();\n    }\n\n    toString(): string {\n\n        if (this.ids.length === 1) {\n            return String(this.ids[0]);\n        }\n\n        return this.ids.toString();\n    }\n}","import { CompiledSchema, IdType, InferType, PropertyInfo, SchemaTypes } from \"../schema\";\nimport { CallbackResult, Result } from \"../results\";\nimport { uuidv4 } from \"../utilities\";\nimport { IdSet } from \"./IdSet\";\n\nexport class MemoryDataCollection {\n\n    protected readonly nextNumericalIds: Map<string, number>;\n    protected readonly data: Map<string, Record<string, unknown>>;\n    protected readonly schema: CompiledSchema<any>;\n    protected readonly idProperties: PropertyInfo<any>[];\n\n    get size() {\n        return this.data.size;\n    }\n\n    get records() {\n        return [...this.data.values()];\n    }\n\n    /** Iterates stored records without materializing them into an array. */\n    values(): IterableIterator<Record<string, unknown>> {\n        return this.data.values();\n    }\n\n    constructor(schema: CompiledSchema<any>) {\n        this.data = new Map<string, Record<string, unknown>>();\n        this.nextNumericalIds = new Map<string, number>();\n        this.schema = schema;\n        this.idProperties = schema.idProperties;\n    }\n\n    private _getNextId(property: PropertyInfo<any>) {\n\n        let nextId = 1;\n\n        if (this.nextNumericalIds.has(property.id) === true) {\n            nextId = this.nextNumericalIds.get(property.id) + 1;\n        }\n\n        this.nextNumericalIds.set(property.id, nextId);\n\n        return nextId;\n    }\n\n    private resolveId(property: PropertyInfo<any>, value: unknown) {\n        if (typeof value !== \"number\") {\n            return;\n        }\n\n        const currentIdForProperty = this.nextNumericalIds.get(property.id);\n\n        if (value <= currentIdForProperty) {\n            return;\n        }\n\n        this.nextNumericalIds.set(property.id, value);\n    }\n\n    private getAndSetId(item: Record<string, unknown>, property: PropertyInfo<any>): IdType {\n        if (item[property.name] != null) {\n            return item[property.name] as IdType;\n        }\n\n        if (property.type === SchemaTypes.String) {\n            const uuid = uuidv4()\n            item[property.name] = uuid;\n            return uuid;\n        }\n\n        if (property.type === SchemaTypes.Number) {\n            const id = this._getNextId(property);\n            item[property.name] = id;\n            return id;\n        }\n\n        throw new Error(`Id Property '${property.name}' must be string or number, found '${property.type}'`)\n    }\n\n    seed(items: Record<string, unknown>[]) {\n        for (let i = 0, length = items.length; i < length; i++) {\n            const id = this.resolveIdSet(items[i] as InferType<unknown>);\n            this.data.set(id.toString(), items[i]);\n        }\n    }\n\n    private resolveCurrentIdSet(item: Record<string, unknown>): IdSet {\n        const idProperties = this.schema.idProperties;\n        const ids: IdType[] = [];\n        // ensure keys\n        for (let j = 0, l = idProperties.length; j < l; j++) {\n            const property = idProperties[j];\n            const value = property.getValue(item);\n\n            if (value == null) {\n                throw new Error(`Key cannot be null.  Key: ${property.name}`);\n            }\n\n            ids.push(value);\n        }\n\n        return new IdSet(...ids);\n    }\n\n    private resolveIdSet(item: Record<string, unknown>): IdSet {\n\n        if (this.schema.hasIdentityKeys) {\n            const idProperties = this.schema.idProperties;\n            const ids: IdType[] = Array.from({ length: idProperties.length });\n\n            // Need to make sure we allow for seeding the collection when we call add vs seed\n            // There will be an existing id, but the id type could still be identity\n            if (idProperties.length === 1) {\n                const value = this.getAndSetId(item, idProperties[0]);\n                this.resolveId(idProperties[0], value);\n                ids[0] = value;\n            } else {\n                for (let j = 0, l = idProperties.length; j < l; j++) {\n                    const value = this.getAndSetId(item, idProperties[j]);\n                    this.resolveId(idProperties[j], value);\n                    ids[j] = value;\n                }\n            }\n\n            return new IdSet(...ids);\n        }\n\n        return this.resolveCurrentIdSet(item);\n    }\n\n    add(item: Record<string, unknown>) {\n        const id = this.resolveIdSet(item);\n        this.data.set(id.toString(), item);\n    }\n\n    /**\n     * Adds a record only when no record with the same key is present. Durable\n     * collections use this to hydrate stored records around in-memory mutations\n     * without clobbering them.\n     */\n    addIfAbsent(item: Record<string, unknown>) {\n        const id = this.resolveIdSet(item);\n        const key = id.toString();\n\n        if (this.data.has(key) === false) {\n            this.data.set(key, item);\n        }\n    }\n\n    /**\n     * Looks up a single record by its key values without scanning the collection.\n     * @param ids Key values in schema id property order\n     * @returns The matching record or undefined when no record has the given key\n     */\n    getByIds(ids: IdType[]): Record<string, unknown> | undefined {\n        return this.data.get(new IdSet(...ids).toString());\n    }\n\n    remove(item: Record<string, unknown>) {\n        const id = this.resolveCurrentIdSet(item);\n        this.data.delete(id.toString());\n    }\n\n    update(item: Record<string, unknown>) {\n        const id = this.resolveCurrentIdSet(item);\n        this.data.set(id.toString(), item);\n    }\n\n    destroy(done: CallbackResult<never>) {\n        this.nextNumericalIds.clear();\n        this.data.clear();\n        done(Result.success());\n    }\n\n    load(done: CallbackResult<never>) {\n        done(Result.success())\n    }\n\n    save(done: CallbackResult<never>) {\n        done(Result.success())\n    }\n}","export * from './Changes';\nexport * from './TagCollection';\nexport * from './IdSet';\nexport * from './MemoryDataCollection';\nexport * from './SchemaCollection';\nexport * from './ReadonlySchemaCollection';"],"names":["TagCollection","BulkPersistResult","Map","schemaId","SchemaPersistResult","count","result","BulkPersistChanges","SchemaPersistChanges","ReadonlySchemaCollection","data","callbackfn","thisArg","Symbol","collectionName","found","x","undefined","SchemaCollection","schema","key","tag","keys","i","length","tags","value","BaseResult","resolve","reject","Error","Result","error","PluginEventResult","id","SchemaTypes","HashType","uuid","chars","charLength","Math","HEX_CHARS","UUID_TEMPLATE","hasCrypto","crypto","hasRandomUUID","uuidv4","uuidv4Fallback","randomBytes","Uint8Array","byteIndex","c","r","IdSet","ids","Object","other","String","MemoryDataCollection","property","nextId","currentIdForProperty","item","items","idProperties","j","l","Array","done"],"mappings":";;;;;;;;;AAEgD;AACzC,MAAMC,0BAA0BC;IAEnC,QAAgDC,QAAkB,EAA0B;QACxF,IAAI,IAAI,CAAC,GAAG,CAACA,WAAW;YACpB,OAAO,IAAI,CAAC,GAAG,CAACA;QACpB;QAEA,IAAI,CAAC,GAAG,CAACA,UAAU,IAAIC;QAEvB,OAAO,IAAI,CAAC,GAAG,CAACD;IACpB;IAES,IAA4CA,QAAkB,EAAE;QACrE,OAAO,KAAK,CAAC,IAAIA;IACrB;IAEA,IAAI,YAAY;QACZ,OAAO;YACH,MAAM,IAAI,CAAC,aAAa;YACxB,MAAM,IAAI,CAAC,iBAAiB;YAC5B,SAAS,IAAI,CAAC,oBAAoB;YAClC,SAAS,IAAI,CAAC,oBAAoB;QACtC;IACJ;IAEA,IAAY,gBAAgB;QACxB,IAAIE,QAAQ;QAEZ,KAAK,MAAM,GAAGC,OAAO,IAAI,IAAI,CAAE;YAC3BD,SAASC,OAAO,KAAK;QACzB;QAEA,OAAOD;IACX;IAEA,IAAY,oBAAoB;QAC5B,IAAIA,QAAQ;QAEZ,KAAK,MAAM,GAAGC,OAAO,IAAI,IAAI,CAAE;YAC3BD,SAASC,OAAO,IAAI,CAAC,MAAM;QAC/B;QAEA,OAAOD;IACX;IAEA,IAAY,uBAAuB;QAC/B,IAAIA,QAAQ;QAEZ,KAAK,MAAM,GAAGC,OAAO,IAAI,IAAI,CAAE;YAC3BD,SAASC,OAAO,OAAO,CAAC,MAAM;QAClC;QAEA,OAAOD;IACX;IAEA,IAAY,uBAAuB;QAC/B,IAAIA,QAAQ;QAEZ,KAAK,MAAM,GAAGC,OAAO,IAAI,IAAI,CAAE;YAC3BD,SAASC,OAAO,OAAO,CAAC,MAAM;QAClC;QAEA,OAAOD;IACX;AACJ;AAEO,MAAME,2BAA2BL;IAEpC,QAAgDC,QAAkB,EAA2B;QACzF,IAAI,IAAI,CAAC,GAAG,CAACA,WAAW;YACpB,OAAO,IAAI,CAAC,GAAG,CAACA;QACpB;QAEA,IAAI,CAAC,GAAG,CAACA,UAAU,IAAIK;QAEvB,OAAO,IAAI,CAAC,GAAG,CAACL;IACpB;IAES,IAA4CA,QAAkB,EAAE;QACrE,OAAO,KAAK,CAAC,IAAIA;IACrB;IAEA,IAAI,YAAY;QACZ,OAAO;YACH,MAAM,IAAI,CAAC,aAAa;YACxB,MAAM,IAAI,CAAC,iBAAiB;YAC5B,SAAS,IAAI,CAAC,oBAAoB;YAClC,SAAS,IAAI,CAAC,oBAAoB;QACtC;IACJ;IAEA,IAAY,gBAAgB;QACxB,IAAIE,QAAQ;QAEZ,KAAK,MAAM,GAAGC,OAAO,IAAI,IAAI,CAAE;YAC3BD,SAASC,OAAO,KAAK;QACzB;QAEA,OAAOD;IACX;IAEA,IAAY,oBAAoB;QAC5B,IAAIA,QAAQ;QAEZ,KAAK,MAAM,GAAGC,OAAO,IAAI,IAAI,CAAE;YAC3BD,SAASC,OAAO,IAAI,CAAC,MAAM;QAC/B;QAEA,OAAOD;IACX;IAEA,IAAY,uBAAuB;QAC/B,IAAIA,QAAQ;QAEZ,KAAK,MAAM,GAAGC,OAAO,IAAI,IAAI,CAAE;YAC3BD,SAASC,OAAO,OAAO,CAAC,MAAM;QAClC;QAEA,OAAOD;IACX;IAEA,IAAY,uBAAuB;QAC/B,IAAIA,QAAQ;QAEZ,KAAK,MAAM,GAAGC,OAAO,IAAI,IAAI,CAAE;YAC3BD,SAASC,OAAO,OAAO,CAAC,MAAM;QAClC;QAEA,OAAOD;IACX;IAEA;;;KAGC,GACD,WAAW;QACP,MAAMC,SAAS,IAAIL;QAEnB,KAAK,MAAM,CAACE,SAAS,IAAI,IAAI,CAAE;YAC3BG,OAAO,GAAG,CAACH,UAAU,IAAIC;QAC7B;QAEA,OAAOE;IACX;AACJ;AAEO,MAAME;IACT,OAA6B,EAAE,CAAC;IAChC,UAAiC,EAAE,CAAC;IACpC,UAA0B,EAAE,CAAC;IAC7B,OAAsB,IAAIR,qDAAaA,GAAG;IAE1C,IAAI,WAAW;QACX,OAAO,IAAI,CAAC,KAAK,GAAG;IACxB;IAEA,IAAI,QAAQ;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;IACvE;AACJ;AAEO,MAAMI;IACT,OAAuB,EAAE,CAAC;IAC1B,UAA0B,EAAE,CAAC;IAC7B,UAA0B,EAAE,CAAC;IAE7B,IAAI,WAAW;QACX,OAAO,IAAI,CAAC,KAAK,GAAG;IACxB;IAEA,IAAI,QAAQ;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;IACvE;AACJ;;;;;;;;AC9KA;;CAEC,GACM,MAAMK;IAEC,KAA6D;IAEvE,YAAYC,IAA4D,CAAE;QACtE,IAAI,CAAC,IAAI,GAAG,IAAIR,IAAuDQ;IAC3E;IAEA,IAAOP,QAAkB,EAAiC;QACtD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA;IACzB;IAEA,IAAIA,QAAkB,EAAW;QAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA;IACzB;IAEA,IAAI,OAAe;QACf,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI;IACzB;IAEA,OAAmC;QAC/B,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI;IACzB;IAEA,SAAoE;QAChE,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM;IAC3B;IAEA,UAAiF;QAC7E,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO;IAC5B;IAEA,QAAQQ,UAAgJ,EAAEC,OAAa,EAAQ;QAC3K,IAAI,CAAC,IAAI,CAAC,OAAO,CAACD,YAAYC;IAClC;IAEA,CAACC,OAAO,QAAQ,CAAC,GAA0E;QACvF,OAAO,IAAI,CAAC,IAAI,CAACA,OAAO,QAAQ,CAAC;IACrC;IAEA,UAAaC,cAAsB,EAAiC;QAChE,MAAMC,QAAQ;eAAI,IAAI,CAAC,IAAI;SAAC,CAAC,IAAI,CAACC,CAAAA,IAAKA,CAAC,CAAC,EAAE,CAAC,cAAc,KAAKF;QAE/D,IAAIC,SAAS,MAAM;YACf,OAAOA,KAAK,CAAC,EAAE;QACnB;QAEA,OAAOE;IACX;AACJ;;;;;;;;;ACrDsE;AAEtE;;CAEC,GACM,MAAMC,yBAAyBT,2EAAwBA;IAE1D,IAAON,QAAkB,EAAEgB,MAAyB,EAAQ;QACxD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAChB,UAAUgB;QACxB,OAAO,IAAI;IACf;IAEA,OAAOhB,QAAkB,EAAW;QAChC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAACA;IAC5B;IAEA,QAAc;QACV,IAAI,CAAC,IAAI,CAAC,KAAK;IACnB;AACJ;;;;;;;;ACpBO,MAAMH;IAED,OAA6B,IAAIE,MAAuB;IAEhE,mFAAmF;IACnF,oFAAoF;IACpF,0EAA0E;IAC1E,IAAI,OAAO;QACP,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI;IACzB;IAEA,IAAIkB,GAAW,EAAE;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA;IACzB;IAEA,IAAIA,GAAW,EAAE;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA;IACzB;IAEA,IAAIA,GAAW,EAAEC,GAAY,EAAE;QAC3B,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAACD,KAAKC;IAC9B;IAEA,OAAOD,GAAW,EAAE;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAACA;IAC5B;IAEA,QAAQE,IAAc,EAAED,GAAY,EAAE;QAClC,IAAK,IAAIE,IAAI,GAAGC,SAASF,KAAK,MAAM,EAAEC,IAAIC,QAAQD,IAAK;YACnD,MAAMH,MAAME,IAAI,CAACC,EAAE;YACnB,IAAI,CAAC,GAAG,CAACH,KAAKC;QAClB;IACJ;IAEA,QAAQI,IAAmB,EAAE;QACzB,KAAK,MAAM,CAACL,KAAKM,MAAM,IAAID,KAAM;YAC7B,IAAI,CAAC,GAAG,CAACL,KAAKM;QAClB;IACJ;IAEA,SAAS;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM;IAC3B;IAEA,OAAO;QACH,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI;IACzB;IAEA,CAACb,OAAO,OAAO,CAAC,GAAG;QACf,IAAI,CAAC,IAAI,CAAC,KAAK;IACnB;IAEA,CAACA,OAAO,QAAQ,CAAC,GAAG;QAChB,OAAO,IAAI,CAAC,IAAI,CAACA,OAAO,QAAQ,CAAC;IACrC;AACJ;;;;;;;;ACrDA,MAAec;IACX,OAAO,QAAQ,QAAiB;IAChC,OAAO,UAAU,UAAmB;IACpC,OAAO,UAAU,UAAmB;IAEpC,OAAO,QAAWrB,MAA4C,EAAEsB,OAA0B,EAAEC,MAA6B,EAAE;QACvH,IAAIvB,OAAO,EAAE,KAAKqB,WAAW,OAAO,EAAE;YAClCC,QAAQtB,OAAO,IAAI;YACnB;QACJ;QAEA,IAAIA,OAAO,EAAE,KAAKqB,WAAW,OAAO,EAAE;YAClCE,OAAO;gBACH,SAASvB,OAAO,IAAI;gBACpB,OAAOA,OAAO,KAAK;YACvB;YACA;QACJ;QAEAuB,OAAOvB,OAAO,KAAK;IACvB;IAEA,OAAO,cAAiBA,MAAW,EAAgD;QAC/E,IAAIA,OAAO,EAAE,KAAKqB,WAAW,OAAO,EAAE;YAClC,MAAM,IAAIG,MAAM,CAAC,iCAAiC,EAAExB,OAAO,EAAE,CAAC,EAAE,EAAEA,OAAO,KAAK,EAAE;QACpF;IACJ;AACJ;AAEO,MAAMyB,eAAeJ;IAGxB,OAAO,QAAWjB,IAAQ,EAAiB;QACvC,OAAO;YACH,IAAIqB,OAAO,OAAO;YAClBrB;QACJ;IACJ;IAEA,OAAO,MAASsB,KAAU,EAAiB;QACvC,OAAO;YACH,IAAID,OAAO,KAAK;YAChBC;QACJ;IACJ;IAEA,OAAO,QAAWtB,IAAO,EAAEsB,KAAU,EAAwB;QACzD,OAAO;YACH,IAAID,OAAO,OAAO;YAClBrB;YACAsB;QACJ;IACJ;AACJ;AAEO,MAAMC,0BAA0BN,gDAAAA,UAAUA,EAAAA;IAG7C,OAAO,QAAWO,EAAU,EAAExB,IAAQ,EAA4B;QAC9D,OAAO;YACHwB;YACA,IAAIH,OAAO,OAAO;YAClBrB;QACJ;IACJ;IAEA,OAAO,MAASwB,EAAU,EAAEF,KAAU,EAA4B;QAC9D,OAAO;YACHE;YACA,IAAIH,OAAO,KAAK;YAChBC;QACJ;IACJ;IAEA,OAAO,QAAWE,EAAU,EAAExB,IAAO,EAAEsB,KAAU,EAAmC;QAChF,OAAO;YACHE;YACA,IAAIH,OAAO,OAAO;YAClBrB;YACAsB;QACJ;IACJ;IAEA,OAAO,cAAiB1B,MAAgC,EAA4D;QAChH,IAAIA,OAAO,EAAE,KAAKyB,OAAO,OAAO,EAAE;YAC9B,MAAM,IAAID,MAAM,CAAC,iCAAiC,EAAExB,OAAO,EAAE,CAAC,EAAE,EAAEA,OAAO,KAAK,EAAE;QACpF;IACJ;AACJ;;;;;;;;ACtEO,IAAK6B,qCAAAA;;;;;;;;;;IAUR;;;KAGC;IAED;;;;;;KAMC;WArBOA;MAuBX;AA8EM,IAAKC,yBAAAA,gDAAAA,SAAAA;;;WAAAA;QAGX;;;;;;;;AC5HM,MAAMC,OAAO,CAACb,SAAiB,EAAE;IACpC,MAAMc,QAAQ;IACd,MAAMC,aAAaD,MAAM,MAAM;IAC/B,IAAIhC,SAAS;IAEb,IAAK,IAAIiB,IAAI,GAAGA,IAAIC,QAAQD,IAAK;QAC7BjB,UAAUgC,KAAK,CAACE,KAAK,MAAM,KAAKD,aAAa,EAAE;IACnD;IACA,OAAOjC;AACX,EAAC;AAED,MAAMmC,YAAY;AAClB,MAAMC,gBAAgB;AAEtB,MAAMC,YACF,OAAOC,WAAW,eAAe,OAAOA,OAAO,eAAe,KAAK;AAEvE,MAAMC,gBACF,OAAOD,WAAW,eAAe,OAAOA,OAAO,UAAU,KAAK;AAE3D,MAAME,SAAS;IAClB,IAAID,eAAe;QACf,OAAOD,OAAO,UAAU;IAC5B;IAEA,OAAOG;AACX,EAAE;AAEF,MAAMA,iBAAiB;IACnB,IAAIC,cAAiC;IACrC,IAAIL,WAAW;QACXK,cAAcJ,OAAO,eAAe,CAAC,IAAIK,WAAW;IACxD;IAEA,IAAIC,YAAY;IAChB,IAAIb,OAAO;IAEX,IAAK,IAAId,IAAI,GAAGA,IAAImB,cAAc,MAAM,EAAEnB,IAAK;QAC3C,MAAM4B,IAAIT,aAAa,CAACnB,EAAE;QAC1B,IAAI4B,MAAM,KAAK;YACXd,QAAQ;YACR;QACJ;QAEA,IAAIe;QACJ,IAAIT,aAAaK,aAAa;YAC1B,2CAA2C;YAC3CI,IACK7B,IAAI,MAAM,IACLyB,WAAW,CAACE,UAAU,IAAI,IAC1BF,WAAW,CAACE,YAAY,GAAG;QACzC,OAAO;YACHE,IAAIZ,KAAK,KAAK,CAACA,KAAK,MAAM,KAAK;QACnC;QAEA,IAAIW,MAAM,KAAK;YACXd,QAAQI,SAAS,CAACW,EAAE;QACxB,OAAO,IAAID,MAAM,KAAK;YAClB,8BAA8B;YAC9Bd,QAAQI,SAAS,CAAEW,IAAI,MAAO,IAAI;QACtC,OAAO,IAAID,MAAM,KAAK;YAClBd,QAAQ;QACZ;IACJ;IAEA,OAAOA;AACX;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AClEA;AACA;AACA;AACA,kDAAkD,wCAAwC;AAC1F;AACA;AACA,E;;;;ACNA,wF;;;;;;;;;;;;;;;;;;;;;;;;ACEO,MAAMgB;IAEA,IAAuB;IAEhC,YAAY,GAAGC,GAAa,CAAE;QAC1B,IAAI,CAAC,GAAG,GAAGC,OAAO,MAAM,CAACD;IAC7B;IAEA,OAAOE,KAAY,EAAW;QAE1B,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,GAAG;YACvB,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,KAAKA,MAAM,GAAG,CAAC,EAAE;QACvC;QAEA,OAAO,IAAI,CAAC,QAAQ,OAAOA,MAAM,QAAQ;IAC7C;IAEA,WAAmB;QAEf,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,GAAG;YACvB,OAAOC,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE;QAC7B;QAEA,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ;IAC5B;AACJ;;;;;;;;;AC3ByF;AACrC;AACd;AACN;AAEzB,MAAMC;IAEU,iBAAsC;IACtC,KAA2C;IAC3C,OAA4B;IAC5B,aAAkC;IAErD,IAAI,OAAO;QACP,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI;IACzB;IAEA,IAAI,UAAU;QACV,OAAO;eAAI,IAAI,CAAC,IAAI,CAAC,MAAM;SAAG;IAClC;IAEA,sEAAsE,GACtE,SAAoD;QAChD,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM;IAC3B;IAEA,YAAYvC,MAA2B,CAAE;QACrC,IAAI,CAAC,IAAI,GAAG,IAAIjB;QAChB,IAAI,CAAC,gBAAgB,GAAG,IAAIA;QAC5B,IAAI,CAAC,MAAM,GAAGiB;QACd,IAAI,CAAC,YAAY,GAAGA,OAAO,YAAY;IAC3C;IAEQ,WAAWwC,QAA2B,EAAE;QAE5C,IAAIC,SAAS;QAEb,IAAI,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAACD,SAAS,EAAE,MAAM,MAAM;YACjDC,SAAS,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAACD,SAAS,EAAE,IAAI;QACtD;QAEA,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAACA,SAAS,EAAE,EAAEC;QAEvC,OAAOA;IACX;IAEQ,UAAUD,QAA2B,EAAEjC,KAAc,EAAE;QAC3D,IAAI,OAAOA,UAAU,UAAU;YAC3B;QACJ;QAEA,MAAMmC,uBAAuB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAACF,SAAS,EAAE;QAElE,IAAIjC,SAASmC,sBAAsB;YAC/B;QACJ;QAEA,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAACF,SAAS,EAAE,EAAEjC;IAC3C;IAEQ,YAAYoC,IAA6B,EAAEH,QAA2B,EAAU;QACpF,IAAIG,IAAI,CAACH,SAAS,IAAI,CAAC,IAAI,MAAM;YAC7B,OAAOG,IAAI,CAACH,SAAS,IAAI,CAAC;QAC9B;QAEA,IAAIA,SAAS,IAAI,KAAKxB,uCAAkB,EAAE;YACtC,MAAME,OAAOS,iCAAMA;YACnBgB,IAAI,CAACH,SAAS,IAAI,CAAC,GAAGtB;YACtB,OAAOA;QACX;QAEA,IAAIsB,SAAS,IAAI,KAAKxB,uCAAkB,EAAE;YACtC,MAAMD,KAAK,IAAI,CAAC,UAAU,CAACyB;YAC3BG,IAAI,CAACH,SAAS,IAAI,CAAC,GAAGzB;YACtB,OAAOA;QACX;QAEA,MAAM,IAAIJ,MAAM,CAAC,aAAa,EAAE6B,SAAS,IAAI,CAAC,mCAAmC,EAAEA,SAAS,IAAI,CAAC,CAAC,CAAC;IACvG;IAEA,KAAKI,KAAgC,EAAE;QACnC,IAAK,IAAIxC,IAAI,GAAGC,SAASuC,MAAM,MAAM,EAAExC,IAAIC,QAAQD,IAAK;YACpD,MAAMW,KAAK,IAAI,CAAC,YAAY,CAAC6B,KAAK,CAACxC,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,GAAG,CAACW,GAAG,QAAQ,IAAI6B,KAAK,CAACxC,EAAE;QACzC;IACJ;IAEQ,oBAAoBuC,IAA6B,EAAS;QAC9D,MAAME,eAAe,IAAI,CAAC,MAAM,CAAC,YAAY;QAC7C,MAAMV,MAAgB,EAAE;QACxB,cAAc;QACd,IAAK,IAAIW,IAAI,GAAGC,IAAIF,aAAa,MAAM,EAAEC,IAAIC,GAAGD,IAAK;YACjD,MAAMN,WAAWK,YAAY,CAACC,EAAE;YAChC,MAAMvC,QAAQiC,SAAS,QAAQ,CAACG;YAEhC,IAAIpC,SAAS,MAAM;gBACf,MAAM,IAAII,MAAM,CAAC,0BAA0B,EAAE6B,SAAS,IAAI,EAAE;YAChE;YAEAL,IAAI,IAAI,CAAC5B;QACb;QAEA,OAAO,IAAI2B,KAAKA,IAAIC;IACxB;IAEQ,aAAaQ,IAA6B,EAAS;QAEvD,IAAI,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE;YAC7B,MAAME,eAAe,IAAI,CAAC,MAAM,CAAC,YAAY;YAC7C,MAAMV,MAAgBa,MAAM,IAAI,CAAC;gBAAE,QAAQH,aAAa,MAAM;YAAC;YAE/D,iFAAiF;YACjF,wEAAwE;YACxE,IAAIA,aAAa,MAAM,KAAK,GAAG;gBAC3B,MAAMtC,QAAQ,IAAI,CAAC,WAAW,CAACoC,MAAME,YAAY,CAAC,EAAE;gBACpD,IAAI,CAAC,SAAS,CAACA,YAAY,CAAC,EAAE,EAAEtC;gBAChC4B,GAAG,CAAC,EAAE,GAAG5B;YACb,OAAO;gBACH,IAAK,IAAIuC,IAAI,GAAGC,IAAIF,aAAa,MAAM,EAAEC,IAAIC,GAAGD,IAAK;oBACjD,MAAMvC,QAAQ,IAAI,CAAC,WAAW,CAACoC,MAAME,YAAY,CAACC,EAAE;oBACpD,IAAI,CAAC,SAAS,CAACD,YAAY,CAACC,EAAE,EAAEvC;oBAChC4B,GAAG,CAACW,EAAE,GAAGvC;gBACb;YACJ;YAEA,OAAO,IAAI2B,KAAKA,IAAIC;QACxB;QAEA,OAAO,IAAI,CAAC,mBAAmB,CAACQ;IACpC;IAEA,IAAIA,IAA6B,EAAE;QAC/B,MAAM5B,KAAK,IAAI,CAAC,YAAY,CAAC4B;QAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC5B,GAAG,QAAQ,IAAI4B;IACjC;IAEA;;;;KAIC,GACD,YAAYA,IAA6B,EAAE;QACvC,MAAM5B,KAAK,IAAI,CAAC,YAAY,CAAC4B;QAC7B,MAAM1C,MAAMc,GAAG,QAAQ;QAEvB,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAACd,SAAS,OAAO;YAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA,KAAK0C;QACvB;IACJ;IAEA;;;;KAIC,GACD,SAASR,GAAa,EAAuC;QACzD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAID,KAAKA,IAAIC,KAAK,QAAQ;IACnD;IAEA,OAAOQ,IAA6B,EAAE;QAClC,MAAM5B,KAAK,IAAI,CAAC,mBAAmB,CAAC4B;QACpC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC5B,GAAG,QAAQ;IAChC;IAEA,OAAO4B,IAA6B,EAAE;QAClC,MAAM5B,KAAK,IAAI,CAAC,mBAAmB,CAAC4B;QACpC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC5B,GAAG,QAAQ,IAAI4B;IACjC;IAEA,QAAQM,IAA2B,EAAE;QACjC,IAAI,CAAC,gBAAgB,CAAC,KAAK;QAC3B,IAAI,CAAC,IAAI,CAAC,KAAK;QACfA,KAAKrC,qCAAc;IACvB;IAEA,KAAKqC,IAA2B,EAAE;QAC9BA,KAAKrC,qCAAc;IACvB;IAEA,KAAKqC,IAA2B,EAAE;QAC9BA,KAAKrC,qCAAc;IACvB;AACJ;;;;;;;ACrL0B;AACM;AACR;AACe;AACJ;AACQ"}

package/dist/errors/OptimisticConcurrencyError.d.ts

@@ -0,0 +1,18 @@
+import { IdType } from "../schema";
+/**
+ * A save was rejected because another writer changed one of its rows first.
+ *
+ * Raised when a schema declares a `.concurrency()` token and an update's expected token
+ * no longer matches the stored row. The whole save is rolled back — nothing was applied.
+ * The caller's recovery is always the same: re-read the conflicted rows (the re-read
+ * merges fresh values into the canonical instances), reapply the intent, and save again.
+ */
+export declare class OptimisticConcurrencyError extends Error {
+    /** The collection whose rows conflicted. */
+    readonly collectionName: string;
+    /** Ids of the rows whose stored token no longer matched the writer's read. */
+    readonly conflicts: IdType[];
+    constructor(collectionName: string, conflicts: IdType[]);
+    /** Type guard that survives errors crossing realm/serialization boundaries. */
+    static is(error: unknown): error is OptimisticConcurrencyError;
+}

package/dist/errors/PluginDestroyedError.d.ts

@@ -0,0 +1,10 @@
+/**
+ * A write that was accepted but never reached the database, because the plugin holding it was
+ * destroyed first — or one submitted after the destroy.
+ *
+ * Distinct from a backend failure on purpose: nothing was attempted, so a caller that retries
+ * on transient errors must not retry this one. There is no database left to retry against.
+ */
+export declare class PluginDestroyedError extends Error {
+    constructor(reason: string);
+}

package/dist/errors/index.cjs

@@ -0,0 +1,132 @@
+(() => {
+"use strict";
+var __webpack_modules__ = ({
+624(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
+__webpack_require__.d(__webpack_exports__, {
+  V: () => (OptimisticConcurrencyError)
+});
+/**
+ * A save was rejected because another writer changed one of its rows first.
+ *
+ * Raised when a schema declares a `.concurrency()` token and an update's expected token
+ * no longer matches the stored row. The whole save is rolled back — nothing was applied.
+ * The caller's recovery is always the same: re-read the conflicted rows (the re-read
+ * merges fresh values into the canonical instances), reapply the intent, and save again.
+ */ class OptimisticConcurrencyError extends Error {
+    /** The collection whose rows conflicted. */ collectionName;
+    /** Ids of the rows whose stored token no longer matched the writer's read. */ conflicts;
+    constructor(collectionName, conflicts){
+        super(`Optimistic concurrency conflict on '${collectionName}': ${conflicts.length} row(s) were changed by another writer after they were read. ` + `Nothing was saved. Re-read the rows, reapply the changes, and save again. Conflicted ids: ${conflicts.map(String).join(", ")}`);
+        this.name = "OptimisticConcurrencyError";
+        this.collectionName = collectionName;
+        this.conflicts = conflicts;
+    }
+    /** Type guard that survives errors crossing realm/serialization boundaries. */ static is(error) {
+        return error instanceof OptimisticConcurrencyError || error != null && typeof error === "object" && error.name === "OptimisticConcurrencyError";
+    }
+}
+
+
+},
+850(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
+__webpack_require__.d(__webpack_exports__, {
+  f: () => (PluginDestroyedError)
+});
+/**
+ * A write that was accepted but never reached the database, because the plugin holding it was
+ * destroyed first — or one submitted after the destroy.
+ *
+ * Distinct from a backend failure on purpose: nothing was attempted, so a caller that retries
+ * on transient errors must not retry this one. There is no database left to retry against.
+ */ class PluginDestroyedError extends Error {
+    constructor(reason){
+        super(`The plugin was destroyed: ${reason}`);
+        this.name = "PluginDestroyedError";
+    }
+}
+
+
+},
+131(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
+__webpack_require__.d(__webpack_exports__, {
+  A: () => (SchemaError)
+});
+class SchemaError extends Error {
+    constructor(error, innerErrorMessage){
+        super(`Error: ${error.message}; Inner Error: ${innerErrorMessage}`);
+    }
+}
+
+
+},
+
+});
+// The module cache
+var __webpack_module_cache__ = {};
+
+// The require function
+function __webpack_require__(moduleId) {
+
+// Check if module is in cache
+var cachedModule = __webpack_module_cache__[moduleId];
+if (cachedModule !== undefined) {
+return cachedModule.exports;
+}
+// Create a new module (and put it into the cache)
+var module = (__webpack_module_cache__[moduleId] = {
+exports: {}
+});
+// Execute the module function
+__webpack_modules__[moduleId](module, module.exports, __webpack_require__);
+
+// Return the exports of the module
+return module.exports;
+
+}
+
+// webpack/runtime/define_property_getters
+(() => {
+__webpack_require__.d = (exports, definition) => {
+	for(var key in definition) {
+        if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {
+            Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });
+        }
+    }
+};
+})();
+// webpack/runtime/has_own_property
+(() => {
+__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))
+})();
+// webpack/runtime/make_namespace_object
+(() => {
+// define __esModule on exports
+__webpack_require__.r = (exports) => {
+	if(typeof Symbol !== 'undefined' && Symbol.toStringTag) {
+		Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+	}
+	Object.defineProperty(exports, '__esModule', { value: true });
+};
+})();
+var __webpack_exports__ = {};
+// This entry needs to be wrapped in an IIFE because it needs to be isolated against other modules in the chunk.
+(() => {
+__webpack_require__.r(__webpack_exports__);
+__webpack_require__.d(__webpack_exports__, {
+  OptimisticConcurrencyError: () => (/* reexport safe */ _OptimisticConcurrencyError__rspack_import_1.V),
+  PluginDestroyedError: () => (/* reexport safe */ _PluginDestroyedError__rspack_import_2.f),
+  SchemaError: () => (/* reexport safe */ _SchemaError__rspack_import_0.A)
+});
+/* import */ var _SchemaError__rspack_import_0 = __webpack_require__(131);
+/* import */ var _OptimisticConcurrencyError__rspack_import_1 = __webpack_require__(624);
+/* import */ var _PluginDestroyedError__rspack_import_2 = __webpack_require__(850);
+
+
+
+
+})();
+
+module.exports = __webpack_exports__;
+})()
+;
+//# sourceMappingURL=index.cjs.map

package/dist/errors/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors/index.cjs","sources":["webpack://@routier/core/./src/errors/OptimisticConcurrencyError.ts","webpack://@routier/core/./src/errors/PluginDestroyedError.ts","webpack://@routier/core/./src/errors/SchemaError.ts","webpack://@routier/core/webpack/runtime/define_property_getters","webpack://@routier/core/webpack/runtime/has_own_property","webpack://@routier/core/webpack/runtime/make_namespace_object","webpack://@routier/core/./src/errors/index.ts"],"sourcesContent":["import { IdType } from \"../schema\";\n\n/**\n * A save was rejected because another writer changed one of its rows first.\n *\n * Raised when a schema declares a `.concurrency()` token and an update's expected token\n * no longer matches the stored row. The whole save is rolled back — nothing was applied.\n * The caller's recovery is always the same: re-read the conflicted rows (the re-read\n * merges fresh values into the canonical instances), reapply the intent, and save again.\n */\nexport class OptimisticConcurrencyError extends Error {\n\n    /** The collection whose rows conflicted. */\n    readonly collectionName: string;\n    /** Ids of the rows whose stored token no longer matched the writer's read. */\n    readonly conflicts: IdType[];\n\n    constructor(collectionName: string, conflicts: IdType[]) {\n        super(\n            `Optimistic concurrency conflict on '${collectionName}': ${conflicts.length} row(s) were changed by another writer after they were read. ` +\n            `Nothing was saved. Re-read the rows, reapply the changes, and save again. Conflicted ids: ${conflicts.map(String).join(\", \")}`\n        );\n        this.name = \"OptimisticConcurrencyError\";\n        this.collectionName = collectionName;\n        this.conflicts = conflicts;\n    }\n\n    /** Type guard that survives errors crossing realm/serialization boundaries. */\n    static is(error: unknown): error is OptimisticConcurrencyError {\n        return error instanceof OptimisticConcurrencyError\n            || (error != null && typeof error === \"object\" && (error as Error).name === \"OptimisticConcurrencyError\");\n    }\n}\n","/**\n * A write that was accepted but never reached the database, because the plugin holding it was\n * destroyed first — or one submitted after the destroy.\n *\n * Distinct from a backend failure on purpose: nothing was attempted, so a caller that retries\n * on transient errors must not retry this one. There is no database left to retry against.\n */\nexport class PluginDestroyedError extends Error {\n\n    constructor(reason: string) {\n        super(`The plugin was destroyed: ${reason}`);\n        this.name = \"PluginDestroyedError\";\n    }\n}\n","export class SchemaError extends Error {\n\n    constructor(error: any, innerErrorMessage: string) {\n        super(`Error: ${error.message}; Inner Error: ${innerErrorMessage}`);\n    }\n}","__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n        if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n            Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n        }\n    }\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","export { SchemaError } from './SchemaError';\nexport { OptimisticConcurrencyError } from './OptimisticConcurrencyError';\nexport { PluginDestroyedError } from './PluginDestroyedError';\n"],"names":["OptimisticConcurrencyError","Error","collectionName","conflicts","String","error","PluginDestroyedError","reason","SchemaError","innerErrorMessage"],"mappings":";;;;;;;AAEA;;;;;;;CAOC,GACM,MAAMA,mCAAmCC;IAE5C,0CAA0C,GACjC,eAAuB;IAChC,4EAA4E,GACnE,UAAoB;IAE7B,YAAYC,cAAsB,EAAEC,SAAmB,CAAE;QACrD,KAAK,CACD,CAAC,oCAAoC,EAAED,eAAe,GAAG,EAAEC,UAAU,MAAM,CAAC,6DAA6D,CAAC,GAC1I,CAAC,0FAA0F,EAAEA,UAAU,GAAG,CAACC,QAAQ,IAAI,CAAC,OAAO;QAEnI,IAAI,CAAC,IAAI,GAAG;QACZ,IAAI,CAAC,cAAc,GAAGF;QACtB,IAAI,CAAC,SAAS,GAAGC;IACrB;IAEA,6EAA6E,GAC7E,OAAO,GAAGE,KAAc,EAAuC;QAC3D,OAAOA,iBAAiBL,8BAChBK,SAAS,QAAQ,OAAOA,UAAU,YAAaA,MAAgB,IAAI,KAAK;IACpF;AACJ;;;;;;;;AChCA;;;;;;CAMC,GACM,MAAMC,6BAA6BL;IAEtC,YAAYM,MAAc,CAAE;QACxB,KAAK,CAAC,CAAC,0BAA0B,EAAEA,QAAQ;QAC3C,IAAI,CAAC,IAAI,GAAG;IAChB;AACJ;;;;;;;;ACbO,MAAMC,oBAAoBP;IAE7B,YAAYI,KAAU,EAAEI,iBAAyB,CAAE;QAC/C,KAAK,CAAC,CAAC,OAAO,EAAEJ,MAAM,OAAO,CAAC,eAAe,EAAEI,mBAAmB;IACtE;AACJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACLA;AACA;AACA;AACA,kDAAkD,wCAAwC;AAC1F;AACA;AACA,E;;;;ACNA,wF;;;;ACAA;AACA;AACA;AACA,uDAAuD,iBAAiB;AACxE;AACA,gDAAgD,aAAa;AAC7D,E;;;;;;;;;;;;;;ACN4C;AAC8B;AACZ"}

package/dist/errors/index.d.ts

@@ -1 +1,3 @@
 export { SchemaError } from './SchemaError';
+export { OptimisticConcurrencyError } from './OptimisticConcurrencyError';
+export { PluginDestroyedError } from './PluginDestroyedError';

package/dist/errors/index.js

@@ -1,11 +1,56 @@
 var __webpack_modules__ = ({
-"./src/errors/SchemaError.ts"(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
-__webpack_require__.r(__webpack_exports__);
+624(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
 __webpack_require__.d(__webpack_exports__, {
-  SchemaError: () => (SchemaError)
+  V: () => (OptimisticConcurrencyError)
+});
+/**
+ * A save was rejected because another writer changed one of its rows first.
+ *
+ * Raised when a schema declares a `.concurrency()` token and an update's expected token
+ * no longer matches the stored row. The whole save is rolled back — nothing was applied.
+ * The caller's recovery is always the same: re-read the conflicted rows (the re-read
+ * merges fresh values into the canonical instances), reapply the intent, and save again.
+ */ class OptimisticConcurrencyError extends Error {
+    /** The collection whose rows conflicted. */ collectionName;
+    /** Ids of the rows whose stored token no longer matched the writer's read. */ conflicts;
+    constructor(collectionName, conflicts){
+        super(`Optimistic concurrency conflict on '${collectionName}': ${conflicts.length} row(s) were changed by another writer after they were read. ` + `Nothing was saved. Re-read the rows, reapply the changes, and save again. Conflicted ids: ${conflicts.map(String).join(", ")}`);
+        this.name = "OptimisticConcurrencyError";
+        this.collectionName = collectionName;
+        this.conflicts = conflicts;
+    }
+    /** Type guard that survives errors crossing realm/serialization boundaries. */ static is(error) {
+        return error instanceof OptimisticConcurrencyError || error != null && typeof error === "object" && error.name === "OptimisticConcurrencyError";
+    }
+}
+
+
+},
+850(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
+__webpack_require__.d(__webpack_exports__, {
+  f: () => (PluginDestroyedError)
+});
+/**
+ * A write that was accepted but never reached the database, because the plugin holding it was
+ * destroyed first — or one submitted after the destroy.
+ *
+ * Distinct from a backend failure on purpose: nothing was attempted, so a caller that retries
+ * on transient errors must not retry this one. There is no database left to retry against.
+ */ class PluginDestroyedError extends Error {
+    constructor(reason){
+        super(`The plugin was destroyed: ${reason}`);
+        this.name = "PluginDestroyedError";
+    }
+}
+
+
+},
+131(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
+__webpack_require__.d(__webpack_exports__, {
+  A: () => (SchemaError)
 });
 class SchemaError extends Error {
-    constructor(error, innerErrorMessage) {
+    constructor(error, innerErrorMessage){
         super(`Error: ${error.message}; Inner Error: ${innerErrorMessage}`);
     }
 }
@@ -51,29 +96,26 @@ __webpack_require__.d = (exports, definition) => {
 (() => {
 __webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))
 })();
-// webpack/runtime/make_namespace_object
-(() => {
-// define __esModule on exports
-__webpack_require__.r = (exports) => {
-	if(typeof Symbol !== 'undefined' && Symbol.toStringTag) {
-		Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-	}
-	Object.defineProperty(exports, '__esModule', { value: true });
-};
-})();
 var __webpack_exports__ = {};
 // This entry needs to be wrapped in an IIFE because it needs to be isolated against other modules in the chunk.
 (() => {
-__webpack_require__.r(__webpack_exports__);
 __webpack_require__.d(__webpack_exports__, {
-  SchemaError: () => (/* reexport safe */ _SchemaError__rspack_import_0.SchemaError)
+  Ar: () => (/* reexport safe */ _SchemaError__rspack_import_0.A),
+  VT: () => (/* reexport safe */ _OptimisticConcurrencyError__rspack_import_1.V),
+  fL: () => (/* reexport safe */ _PluginDestroyedError__rspack_import_2.f)
 });
-/* import */ var _SchemaError__rspack_import_0 = __webpack_require__("./src/errors/SchemaError.ts");
+/* import */ var _SchemaError__rspack_import_0 = __webpack_require__(131);
+/* import */ var _OptimisticConcurrencyError__rspack_import_1 = __webpack_require__(624);
+/* import */ var _PluginDestroyedError__rspack_import_2 = __webpack_require__(850);
+
+
 
 
 })();
 
-var __webpack_exports__SchemaError = __webpack_exports__.SchemaError;
-export { __webpack_exports__SchemaError as SchemaError };
+var __webpack_exports__OptimisticConcurrencyError = __webpack_exports__.VT;
+var __webpack_exports__PluginDestroyedError = __webpack_exports__.fL;
+var __webpack_exports__SchemaError = __webpack_exports__.Ar;
+export { __webpack_exports__OptimisticConcurrencyError as OptimisticConcurrencyError, __webpack_exports__PluginDestroyedError as PluginDestroyedError, __webpack_exports__SchemaError as SchemaError };
 
 //# sourceMappingURL=index.js.map

package/dist/errors/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"errors/index.js","sources":["webpack://@routier/core/./src/errors/SchemaError.ts","webpack://@routier/core/webpack/runtime/define_property_getters","webpack://@routier/core/webpack/runtime/has_own_property","webpack://@routier/core/webpack/runtime/make_namespace_object","webpack://@routier/core/./src/errors/index.ts"],"sourcesContent":["export class SchemaError extends Error {\n\n    constructor(error: any, innerErrorMessage: string) {\n        super(`Error: ${error.message}; Inner Error: ${innerErrorMessage}`);\n    }\n}","__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n        if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n            Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n        }\n    }\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","export { SchemaError } from './SchemaError';"],"names":[],"mappings":";;;;;;AAAO,MAAM,WAAY,SAAQ,KAAK;IAElC,YAAY,KAAU,EAAE,iBAAyB;QAC7C,KAAK,CAAC,UAAU,KAAK,CAAC,OAAO,kBAAkB,iBAAiB,EAAE,CAAC,CAAC;IACxE,CAAC;CACJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACLD;AACA;AACA;AACA,kDAAkD,wCAAwC;AAC1F;AACA;AACA,E;;;;ACNA,wF;;;;ACAA;AACA;AACA;AACA,uDAAuD,iBAAiB;AACxE;AACA,gDAAgD,aAAa;AAC7D,E;;;;;;;;;;ACN4C"}
+{"version":3,"file":"errors/index.js","sources":["webpack://@routier/core/./src/errors/OptimisticConcurrencyError.ts","webpack://@routier/core/./src/errors/PluginDestroyedError.ts","webpack://@routier/core/./src/errors/SchemaError.ts","webpack://@routier/core/webpack/runtime/define_property_getters","webpack://@routier/core/webpack/runtime/has_own_property","webpack://@routier/core/./src/errors/index.ts"],"sourcesContent":["import { IdType } from \"../schema\";\n\n/**\n * A save was rejected because another writer changed one of its rows first.\n *\n * Raised when a schema declares a `.concurrency()` token and an update's expected token\n * no longer matches the stored row. The whole save is rolled back — nothing was applied.\n * The caller's recovery is always the same: re-read the conflicted rows (the re-read\n * merges fresh values into the canonical instances), reapply the intent, and save again.\n */\nexport class OptimisticConcurrencyError extends Error {\n\n    /** The collection whose rows conflicted. */\n    readonly collectionName: string;\n    /** Ids of the rows whose stored token no longer matched the writer's read. */\n    readonly conflicts: IdType[];\n\n    constructor(collectionName: string, conflicts: IdType[]) {\n        super(\n            `Optimistic concurrency conflict on '${collectionName}': ${conflicts.length} row(s) were changed by another writer after they were read. ` +\n            `Nothing was saved. Re-read the rows, reapply the changes, and save again. Conflicted ids: ${conflicts.map(String).join(\", \")}`\n        );\n        this.name = \"OptimisticConcurrencyError\";\n        this.collectionName = collectionName;\n        this.conflicts = conflicts;\n    }\n\n    /** Type guard that survives errors crossing realm/serialization boundaries. */\n    static is(error: unknown): error is OptimisticConcurrencyError {\n        return error instanceof OptimisticConcurrencyError\n            || (error != null && typeof error === \"object\" && (error as Error).name === \"OptimisticConcurrencyError\");\n    }\n}\n","/**\n * A write that was accepted but never reached the database, because the plugin holding it was\n * destroyed first — or one submitted after the destroy.\n *\n * Distinct from a backend failure on purpose: nothing was attempted, so a caller that retries\n * on transient errors must not retry this one. There is no database left to retry against.\n */\nexport class PluginDestroyedError extends Error {\n\n    constructor(reason: string) {\n        super(`The plugin was destroyed: ${reason}`);\n        this.name = \"PluginDestroyedError\";\n    }\n}\n","export class SchemaError extends Error {\n\n    constructor(error: any, innerErrorMessage: string) {\n        super(`Error: ${error.message}; Inner Error: ${innerErrorMessage}`);\n    }\n}","__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n        if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n            Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n        }\n    }\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","export { SchemaError } from './SchemaError';\nexport { OptimisticConcurrencyError } from './OptimisticConcurrencyError';\nexport { PluginDestroyedError } from './PluginDestroyedError';\n"],"names":["OptimisticConcurrencyError","Error","collectionName","conflicts","String","error","PluginDestroyedError","reason","SchemaError","innerErrorMessage"],"mappings":";;;;;AAEA;;;;;;;CAOC,GACM,MAAMA,mCAAmCC;IAE5C,0CAA0C,GACjC,eAAuB;IAChC,4EAA4E,GACnE,UAAoB;IAE7B,YAAYC,cAAsB,EAAEC,SAAmB,CAAE;QACrD,KAAK,CACD,CAAC,oCAAoC,EAAED,eAAe,GAAG,EAAEC,UAAU,MAAM,CAAC,6DAA6D,CAAC,GAC1I,CAAC,0FAA0F,EAAEA,UAAU,GAAG,CAACC,QAAQ,IAAI,CAAC,OAAO;QAEnI,IAAI,CAAC,IAAI,GAAG;QACZ,IAAI,CAAC,cAAc,GAAGF;QACtB,IAAI,CAAC,SAAS,GAAGC;IACrB;IAEA,6EAA6E,GAC7E,OAAO,GAAGE,KAAc,EAAuC;QAC3D,OAAOA,iBAAiBL,8BAChBK,SAAS,QAAQ,OAAOA,UAAU,YAAaA,MAAgB,IAAI,KAAK;IACpF;AACJ;;;;;;;;AChCA;;;;;;CAMC,GACM,MAAMC,6BAA6BL;IAEtC,YAAYM,MAAc,CAAE;QACxB,KAAK,CAAC,CAAC,0BAA0B,EAAEA,QAAQ;QAC3C,IAAI,CAAC,IAAI,GAAG;IAChB;AACJ;;;;;;;;ACbO,MAAMC,oBAAoBP;IAE7B,YAAYI,KAAU,EAAEI,iBAAyB,CAAE;QAC/C,KAAK,CAAC,CAAC,OAAO,EAAEJ,MAAM,OAAO,CAAC,eAAe,EAAEI,mBAAmB;IACtE;AACJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACLA;AACA;AACA;AACA,kDAAkD,wCAAwC;AAC1F;AACA;AACA,E;;;;ACNA,wF;;;;;;;;;;;;;ACA4C;AAC8B;AACZ"}

package/dist/expressions/constants.d.ts

@@ -0,0 +1,2 @@
+import { ExpressionType } from "./types";
+export declare const EXPRESSION_TYPES: ExpressionType[];

package/dist/expressions/evaluate.d.ts

@@ -0,0 +1,53 @@
+import { UnknownRecord } from "../utilities";
+import { Expression } from "./types";
+/**
+ * Runs a parsed expression against a row.
+ *
+ * The counterpart to `toSql` and `toMql`: those turn a tree into a backend's language, and this
+ * turns it into an answer. Needed wherever a tree exists but the closure that produced it does
+ * not — a filter split out of a larger predicate, an option rebuilt from a serialized query.
+ *
+ * ## It fails OPEN, and that is the whole safety argument
+ *
+ * `undefined` means "this tree cannot be evaluated here" — an unknown node, a transformer with no
+ * implementation, a comparison between shapes that do not compare. Callers must read that as KEEP
+ * THE ROW, never as exclude it.
+ *
+ * The reason is asymmetric cost. Every caller today uses this to NARROW something that a
+ * subsequent, authoritative predicate will check again: a semi-join prefilter, a split conjunct.
+ * Keeping a row this cannot judge costs one wasted comparison downstream. Dropping one loses data
+ * from a query result and nothing anywhere reports it. So every uncertain path returns `undefined`,
+ * and no path guesses `false`.
+ *
+ * ## Why not just reuse the caller's closure
+ *
+ * Because there often isn't one. A conjunct pulled out of `([p, m]) => p.a === 1 && m.b === 2` is
+ * source TEXT; turning it back into a callable needs `new Function`, which a
+ * Content-Security-Policy blocks — the same constraint that makes `softDeleteScope` build its tree
+ * by hand. The tree is the only representation that survives.
+ */
+export type EvaluationResult = boolean | undefined;
+/**
+ * Evaluates `expression` against `row`, or returns `undefined` when it cannot.
+ *
+ * See the note at the top of this file: `undefined` means KEEP the row.
+ */
+export declare const evaluate: (expression: Expression, row: UnknownRecord) => EvaluationResult;
+/**
+ * `evaluate`, as a predicate that keeps whatever it cannot judge.
+ *
+ * The form every narrowing caller wants, with the fail-open rule applied once here rather than
+ * remembered at each call site.
+ */
+export declare const toPredicate: (expression: Expression) => (row: UnknownRecord) => boolean;
+/**
+ * `evaluate`, as a predicate that THROWS on anything it cannot judge.
+ *
+ * The opposite default to `toPredicate`, and the right one when the predicate is the only thing
+ * standing between a caller and rows they asked to exclude — a filter that arrived over a wire and
+ * is being applied by the receiver. Failing open there does not cost a wasted comparison; it returns
+ * data the requester filtered out, and reports nothing.
+ *
+ * Use `toPredicate` when something authoritative re-checks the result, and this when nothing does.
+ */
+export declare const toStrictPredicate: (expression: Expression) => (row: UnknownRecord) => boolean;