@routier/core 0.7.0 → 0.8.0

package/dist/collections/index.cjs

@@ -379,6 +379,128 @@ var HashType = /*#__PURE__*/ (/* unused pure expression or super */ null && (fun
 }({})));
 
 
+},
+575(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
+__webpack_require__.d(__webpack_exports__, {
+  l: () => (isArrayValued)
+});
+/* import */ var _types__rspack_import_0 = __webpack_require__(537);
+
+/**
+ * Types whose runtime value is a JS array.
+ *
+ * `Array` and `Vector` are the same thing to every layer that copies, compares, hashes or
+ * freezes a value — a vector is a list of numbers and nothing more. They differ only where a
+ * backend chooses storage, which is the one place that should ask for `SchemaTypes.Vector` by
+ * name.
+ *
+ * This exists so adding a third array-shaped type is one edit rather than a hunt through
+ * twelve handlers. Missing one of those is silent in the worst way: a vector that clones by
+ * reference is shared with the change tracker's copy, so overwriting an embedding produces no
+ * diff and the save reports nothing to do.
+ */ const ARRAY_VALUED_TYPES = new Set([
+    _types__rspack_import_0/* .SchemaTypes.Array */.L.Array,
+    _types__rspack_import_0/* .SchemaTypes.Vector */.L.Vector
+]);
+/** True when the property's value is a JS array and needs value rather than reference semantics. */ const isArrayValued = (type)=>ARRAY_VALUED_TYPES.has(type);
+/**
+ * True when the property's elements are primitives, so a spread is a sufficient copy.
+ *
+ * A vector is always numbers, so it never needs the per-element deep copy an array of objects
+ * or dates does.
+ */ const PRIMITIVE_ELEMENT_TYPES = new Set([
+    _types__rspack_import_0/* .SchemaTypes.String */.L.String,
+    _types__rspack_import_0/* .SchemaTypes.Number */.L.Number,
+    _types__rspack_import_0/* .SchemaTypes.Boolean */.L.Boolean
+]);
+const hasPrimitiveElements = (type, elementType)=>type === SchemaTypes.Vector || PRIMITIVE_ELEMENT_TYPES.has(elementType);
+
+
+},
+894(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
+__webpack_require__.d(__webpack_exports__, {
+  T: () => (getStorageDateReviver)
+});
+/* import */ var _types__rspack_import_0 = __webpack_require__(537);
+/* import */ var _propertyKind__rspack_import_1 = __webpack_require__(575);
+
+
+const collectDatePaths = (properties, paths)=>{
+    for (const property of properties){
+        // The stored value belongs to whoever wrote it: a custom serializer, deserializer or
+        // transform reads it back, and would be handed a Date it did not expect. Unmapped
+        // properties are never stored.
+        if (property.valueSerializer != null || property.valueDeserializer != null || property.transform != null || property.isUnmapped) {
+            continue;
+        }
+        if (property.type === _types__rspack_import_0/* .SchemaTypes.Object */.L.Object) {
+            collectDatePaths(property.children, paths);
+            continue;
+        }
+        const isArray = (0,_propertyKind__rspack_import_1/* .isArrayValued */.l)(property.type) && property.innerSchema?.type === _types__rspack_import_0/* .SchemaTypes.Date */.L.Date;
+        if (property.type !== _types__rspack_import_0/* .SchemaTypes.Date */.L.Date && isArray === false) {
+            continue;
+        }
+        paths.push({
+            segments: [
+                ...property.getParentPathArray({
+                    useFromPropertyName: true
+                }),
+                property.getResolvedName()
+            ],
+            isArray
+        });
+    }
+};
+const reviveAt = (record, path)=>{
+    const { segments } = path;
+    let parent = record;
+    for(let i = 0, length = segments.length - 1; i < length; i++){
+        parent = parent[segments[i]];
+        // An absent or null parent holds no date
+        if (parent == null || typeof parent !== "object") {
+            return;
+        }
+    }
+    const key = segments[segments.length - 1];
+    const value = parent[key];
+    if (path.isArray === false) {
+        if (typeof value === "string") {
+            parent[key] = new Date(value);
+        }
+        return;
+    }
+    if (Array.isArray(value)) {
+        for(let i = 0, length = value.length; i < length; i++){
+            if (typeof value[i] === "string") {
+                value[i] = new Date(value[i]);
+            }
+        }
+    }
+};
+/** Per schema: `null` for a schema with no dates, so a caller can skip the pass. */ const revivers = new WeakMap();
+/**
+ * The reviver for `schema`'s records, or `null` when it declares no dates.
+ *
+ * Built once per compiled schema. A read revives every row it returns, so the paths are resolved
+ * here rather than per row.
+ */ const getStorageDateReviver = (schema)=>{
+    const cached = revivers.get(schema);
+    if (cached !== undefined) {
+        return cached;
+    }
+    const paths = [];
+    collectDatePaths(schema.properties, paths);
+    const reviver = paths.length === 0 ? null : (record)=>{
+        for(let i = 0, length = paths.length; i < length; i++){
+            reviveAt(record, paths[i]);
+        }
+    };
+    revivers.set(schema, reviver);
+    return reviver;
+};
+
+
 },
 618(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
 __webpack_require__.d(__webpack_exports__, {
@@ -531,6 +653,8 @@ class IdSet {
 
 // EXTERNAL MODULE: ./src/schema/types.ts
 var types = __webpack_require__(537);
+// EXTERNAL MODULE: ./src/schema/utils/storageDates.ts
+var storageDates = __webpack_require__(894);
 // EXTERNAL MODULE: ./src/results/Result.ts
 var Result = __webpack_require__(718);
 // EXTERNAL MODULE: ./src/utilities/uuid.ts
@@ -596,29 +720,17 @@ class MemoryDataCollection {
         }
         throw new Error(`Id Property '${property.name}' must be string or number, found '${property.type}'`);
     }
-    _dateColumns;
-    /** Date columns, by the name a stored record uses. Nested dates live inside a JSON column. */ get dateColumns() {
-        if (this._dateColumns == null) {
-            this._dateColumns = this.schema.properties.filter((property)=>property.type === types/* .SchemaTypes.Date */.L.Date && property.getAssignmentPath().includes(".") === false).map((property)=>property.getResolvedName());
-        }
-        return this._dateColumns;
-    }
     /**
      * The record this collection keeps.
      *
      * A copy, so a caller holding the entity cannot write into the store afterwards. Dates are held
-     * as Dates: a predicate compares a Date, and a stored ISO string never matches one.
+     * as Dates, at the root, in objects and in arrays: a predicate compares a Date, and a stored ISO
+     * string never matches one. A durable subclass hydrates parsed JSON through here too.
      */ toStored(item) {
-        const columns = this.dateColumns;
         const stored = {
             ...item
         };
-        for(let i = 0, length = columns.length; i < length; i++){
-            const value = stored[columns[i]];
-            if (typeof value === "string") {
-                stored[columns[i]] = new Date(value);
-            }
-        }
+        (0,storageDates/* .getStorageDateReviver */.T)(this.schema)?.(stored);
         return stored;
     }
     seed(items) {

package/dist/collections/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"collections/index.cjs","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/webpack/runtime/make_namespace_object","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))","// 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};","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    private _dateColumns?: string[];\n\n    /** Date columns, by the name a stored record uses. Nested dates live inside a JSON column. */\n    private get dateColumns(): string[] {\n        if (this._dateColumns == null) {\n            this._dateColumns = this.schema.properties\n                .filter(property => property.type === SchemaTypes.Date\n                    && property.getAssignmentPath().includes(\".\") === false)\n                .map(property => property.getResolvedName());\n        }\n\n        return this._dateColumns;\n    }\n\n    /**\n     * The record this collection keeps.\n     *\n     * A copy, so a caller holding the entity cannot write into the store afterwards. Dates are held\n     * as Dates: a predicate compares a Date, and a stored ISO string never matches one.\n     */\n    private toStored(item: Record<string, unknown>): Record<string, unknown> {\n        const columns = this.dateColumns;\n        const stored = { ...item };\n\n        for (let i = 0, length = columns.length; i < length; i++) {\n            const value = stored[columns[i]];\n\n            if (typeof value === \"string\") {\n                stored[columns[i]] = new Date(value);\n            }\n        }\n\n        return stored;\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(), this.toStored(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(), this.toStored(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, this.toStored(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(), this.toStored(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","columns","stored","Date","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;;;;ACAA;AACA;AACA;AACA,uDAAuD,iBAAiB;AACxE;AACA,gDAAgD,aAAa;AAC7D,E;;;;;;;;;;;;;;;;;;;;;;;;;;ACJO,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;IAEQ,aAAwB;IAEhC,4FAA4F,GAC5F,IAAY,cAAwB;QAChC,IAAI,IAAI,CAAC,YAAY,IAAI,MAAM;YAC3B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CACrC,MAAM,CAACA,CAAAA,WAAYA,SAAS,IAAI,KAAKxB,mCAAgB,IAC/CwB,SAAS,iBAAiB,GAAG,QAAQ,CAAC,SAAS,OACrD,GAAG,CAACA,CAAAA,WAAYA,SAAS,eAAe;QACjD;QAEA,OAAO,IAAI,CAAC,YAAY;IAC5B;IAEA;;;;;KAKC,GACO,SAASG,IAA6B,EAA2B;QACrE,MAAMC,UAAU,IAAI,CAAC,WAAW;QAChC,MAAMC,SAAS;YAAE,GAAGF,IAAI;QAAC;QAEzB,IAAK,IAAIvC,IAAI,GAAGC,SAASuC,QAAQ,MAAM,EAAExC,IAAIC,QAAQD,IAAK;YACtD,MAAMG,QAAQsC,MAAM,CAACD,OAAO,CAACxC,EAAE,CAAC;YAEhC,IAAI,OAAOG,UAAU,UAAU;gBAC3BsC,MAAM,CAACD,OAAO,CAACxC,EAAE,CAAC,GAAG,IAAI0C,KAAKvC;YAClC;QACJ;QAEA,OAAOsC;IACX;IAEA,KAAKE,KAAgC,EAAE;QACnC,IAAK,IAAI3C,IAAI,GAAGC,SAAS0C,MAAM,MAAM,EAAE3C,IAAIC,QAAQD,IAAK;YACpD,MAAMW,KAAK,IAAI,CAAC,YAAY,CAACgC,KAAK,CAAC3C,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,GAAG,CAACW,GAAG,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAACgC,KAAK,CAAC3C,EAAE;QACvD;IACJ;IAEQ,oBAAoBuC,IAA6B,EAAS;QAC9D,MAAMK,eAAe,IAAI,CAAC,MAAM,CAAC,YAAY;QAC7C,MAAMb,MAAgB,EAAE;QACxB,cAAc;QACd,IAAK,IAAIc,IAAI,GAAGC,IAAIF,aAAa,MAAM,EAAEC,IAAIC,GAAGD,IAAK;YACjD,MAAMT,WAAWQ,YAAY,CAACC,EAAE;YAChC,MAAM1C,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,MAAMK,eAAe,IAAI,CAAC,MAAM,CAAC,YAAY;YAC7C,MAAMb,MAAgBgB,MAAM,IAAI,CAAC;gBAAE,QAAQH,aAAa,MAAM;YAAC;YAE/D,iFAAiF;YACjF,wEAAwE;YACxE,IAAIA,aAAa,MAAM,KAAK,GAAG;gBAC3B,MAAMzC,QAAQ,IAAI,CAAC,WAAW,CAACoC,MAAMK,YAAY,CAAC,EAAE;gBACpD,IAAI,CAAC,SAAS,CAACA,YAAY,CAAC,EAAE,EAAEzC;gBAChC4B,GAAG,CAAC,EAAE,GAAG5B;YACb,OAAO;gBACH,IAAK,IAAI0C,IAAI,GAAGC,IAAIF,aAAa,MAAM,EAAEC,IAAIC,GAAGD,IAAK;oBACjD,MAAM1C,QAAQ,IAAI,CAAC,WAAW,CAACoC,MAAMK,YAAY,CAACC,EAAE;oBACpD,IAAI,CAAC,SAAS,CAACD,YAAY,CAACC,EAAE,EAAE1C;oBAChC4B,GAAG,CAACc,EAAE,GAAG1C;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,IAAI,IAAI,CAAC,QAAQ,CAAC4B;IAC/C;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,KAAK,IAAI,CAAC,QAAQ,CAAC0C;QACrC;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,IAAI,IAAI,CAAC,QAAQ,CAAC4B;IAC/C;IAEA,QAAQS,IAA2B,EAAE;QACjC,IAAI,CAAC,gBAAgB,CAAC,KAAK;QAC3B,IAAI,CAAC,IAAI,CAAC,KAAK;QACfA,KAAKxC,qCAAc;IACvB;IAEA,KAAKwC,IAA2B,EAAE;QAC9BA,KAAKxC,qCAAc;IACvB;IAEA,KAAKwC,IAA2B,EAAE;QAC9BA,KAAKxC,qCAAc;IACvB;AACJ;;;;;;;ACxN0B;AACM;AACR;AACe;AACJ;AACQ"}
+{"version":3,"file":"collections/index.cjs","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/schema/utils/propertyKind.ts","webpack://@routier/core/./src/schema/utils/storageDates.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/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, SchemaNullable } 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 *\n * A map of child schemas goes through `InferCompiledSchema`, not a plain key map, so the\n * children's own `.nullable()`, `.optional()` and `.readonly()` survive the way they do at the\n * top level (#42). That branch cannot take an array — `SchemaObject.array().nullable()` wraps\n * `C = SchemaObject[]` — so an array is resolved element by element before it.\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    C extends Array<infer E> ? InferPrimitive<E>[] :\n    InferCompiledSchema<C>;\n\ntype InferPrimitive<T> =\n    T extends SchemaOptional<infer C, infer __> ? ResolveWrapped<C> :\n    // `null` itself comes from the parent's `nullable` key partition; this resolves what is\n    // underneath. Without it a nullable object fell to the generic `SchemaBase` branch below\n    // and typed its children as the raw builder classes.\n    T extends SchemaNullable<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    InferCompiledSchema<Obj> : // Nested objects keep their children's modifiers\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","import { SchemaTypes } from \"../types\";\n\n/**\n * Types whose runtime value is a JS array.\n *\n * `Array` and `Vector` are the same thing to every layer that copies, compares, hashes or\n * freezes a value — a vector is a list of numbers and nothing more. They differ only where a\n * backend chooses storage, which is the one place that should ask for `SchemaTypes.Vector` by\n * name.\n *\n * This exists so adding a third array-shaped type is one edit rather than a hunt through\n * twelve handlers. Missing one of those is silent in the worst way: a vector that clones by\n * reference is shared with the change tracker's copy, so overwriting an embedding produces no\n * diff and the save reports nothing to do.\n */\nconst ARRAY_VALUED_TYPES = new Set<SchemaTypes>([\n    SchemaTypes.Array,\n    SchemaTypes.Vector,\n]);\n\n/** True when the property's value is a JS array and needs value rather than reference semantics. */\nexport const isArrayValued = (type: SchemaTypes) => ARRAY_VALUED_TYPES.has(type);\n\n/**\n * True when the property's elements are primitives, so a spread is a sufficient copy.\n *\n * A vector is always numbers, so it never needs the per-element deep copy an array of objects\n * or dates does.\n */\nconst PRIMITIVE_ELEMENT_TYPES = new Set<SchemaTypes | undefined>([\n    SchemaTypes.String,\n    SchemaTypes.Number,\n    SchemaTypes.Boolean,\n]);\n\nexport const hasPrimitiveElements = (type: SchemaTypes, elementType: SchemaTypes | undefined) =>\n    type === SchemaTypes.Vector || PRIMITIVE_ELEMENT_TYPES.has(elementType);\n","import { PropertyInfo } from \"../PropertyInfo\";\nimport { CompiledSchema, SchemaTypes } from \"../types\";\nimport { isArrayValued } from \"./propertyKind\";\n\n/**\n * Turns the dates on a STORAGE-shape record back into Dates, in place.\n *\n * The datastore serializes a Date to an ISO string, and a store that persists JSON hands the\n * string back. A plugin that runs the caller's lambdas over its own records has to undo that\n * first: a string is never greater than a Date and has no `getTime()`. It is the one thing JSON\n * changed, so it is the one thing undone. Keys stay under their `from` names, because the\n * datastore deserializes the rows the plugin returns, by those names.\n *\n * Not the full `schema.deserialize`, which also moves every key to its in-memory name: rows\n * deserialized twice lose every renamed property.\n *\n * Only a string is converted, so a Date the store kept as a Date is left alone, and so is a\n * record that was already revived. The datastore's own deserialize does the same, so a revived\n * record deserializes to the same entity.\n */\nexport type StorageDateReviver = (record: Record<string, unknown>) => void;\n\ntype DatePath = {\n    /** Storage names from the root, the date itself last. */\n    readonly segments: readonly string[];\n    /** An array of dates rather than one. */\n    readonly isArray: boolean;\n};\n\nconst collectDatePaths = (properties: readonly PropertyInfo<any>[], paths: DatePath[]) => {\n    for (const property of properties) {\n\n        // The stored value belongs to whoever wrote it: a custom serializer, deserializer or\n        // transform reads it back, and would be handed a Date it did not expect. Unmapped\n        // properties are never stored.\n        if (property.valueSerializer != null || property.valueDeserializer != null || property.transform != null || property.isUnmapped) {\n            continue;\n        }\n\n        if (property.type === SchemaTypes.Object) {\n            collectDatePaths(property.children, paths);\n            continue;\n        }\n\n        const isArray = isArrayValued(property.type) && property.innerSchema?.type === SchemaTypes.Date;\n\n        if (property.type !== SchemaTypes.Date && isArray === false) {\n            continue;\n        }\n\n        paths.push({\n            segments: [...property.getParentPathArray({ useFromPropertyName: true }), property.getResolvedName()],\n            isArray\n        });\n    }\n};\n\nconst reviveAt = (record: Record<string, unknown>, path: DatePath) => {\n    const { segments } = path;\n    let parent: any = record;\n\n    for (let i = 0, length = segments.length - 1; i < length; i++) {\n        parent = parent[segments[i]];\n\n        // An absent or null parent holds no date\n        if (parent == null || typeof parent !== \"object\") {\n            return;\n        }\n    }\n\n    const key = segments[segments.length - 1];\n    const value = parent[key];\n\n    if (path.isArray === false) {\n        if (typeof value === \"string\") {\n            parent[key] = new Date(value);\n        }\n\n        return;\n    }\n\n    if (Array.isArray(value)) {\n        for (let i = 0, length = value.length; i < length; i++) {\n            if (typeof value[i] === \"string\") {\n                value[i] = new Date(value[i]);\n            }\n        }\n    }\n};\n\n/** Per schema: `null` for a schema with no dates, so a caller can skip the pass. */\nconst revivers = new WeakMap<object, StorageDateReviver | null>();\n\n/**\n * The reviver for `schema`'s records, or `null` when it declares no dates.\n *\n * Built once per compiled schema. A read revives every row it returns, so the paths are resolved\n * here rather than per row.\n */\nexport const getStorageDateReviver = (schema: CompiledSchema<any>): StorageDateReviver | null => {\n    const cached = revivers.get(schema);\n\n    if (cached !== undefined) {\n        return cached;\n    }\n\n    const paths: DatePath[] = [];\n\n    collectDatePaths(schema.properties, paths);\n\n    const reviver: StorageDateReviver | null = paths.length === 0\n        ? null\n        : record => {\n            for (let i = 0, length = paths.length; i < length; i++) {\n                reviveAt(record, paths[i]);\n            }\n        };\n\n    revivers.set(schema, reviver);\n\n    return reviver;\n};\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))","// 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};","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, getStorageDateReviver, 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    /**\n     * The record this collection keeps.\n     *\n     * A copy, so a caller holding the entity cannot write into the store afterwards. Dates are held\n     * as Dates, at the root, in objects and in arrays: a predicate compares a Date, and a stored ISO\n     * string never matches one. A durable subclass hydrates parsed JSON through here too.\n     */\n    private toStored(item: Record<string, unknown>): Record<string, unknown> {\n        const stored = { ...item };\n\n        getStorageDateReviver(this.schema)?.(stored);\n\n        return stored;\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(), this.toStored(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(), this.toStored(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, this.toStored(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(), this.toStored(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","ARRAY_VALUED_TYPES","Set","isArrayValued","type","PRIMITIVE_ELEMENT_TYPES","hasPrimitiveElements","elementType","collectDatePaths","properties","paths","property","isArray","reviveAt","record","path","segments","parent","Date","Array","revivers","WeakMap","getStorageDateReviver","cached","reviver","uuid","chars","charLength","Math","HEX_CHARS","UUID_TEMPLATE","hasCrypto","crypto","hasRandomUUID","uuidv4","uuidv4Fallback","randomBytes","Uint8Array","byteIndex","c","r","IdSet","ids","Object","other","String","MemoryDataCollection","nextId","currentIdForProperty","item","stored","items","idProperties","j","l","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;;;;;;;;;AC5HsC;AAEvC;;;;;;;;;;;;CAYC,GACD,MAAMC,qBAAqB,IAAIC,IAAiB;IAC5CH,uDAAiB;IACjBA,yDAAkB;CACrB;AAED,kGAAkG,GAC3F,MAAMI,gBAAgB,CAACC,OAAsBH,mBAAmB,GAAG,CAACG,MAAM;AAEjF;;;;;CAKC,GACD,MAAMC,0BAA0B,IAAIH,IAA6B;IAC7DH,yDAAkB;IAClBA,yDAAkB;IAClBA,2DAAmB;CACtB;AAEM,MAAMO,uBAAuB,CAACF,MAAmBG,cACpDH,SAASL,YAAY,MAAM,IAAIM,wBAAwB,GAAG,CAACE,aAAa;;;;;;;;;;ACnCrB;AACR;AA2B/C,MAAMC,mBAAmB,CAACC,YAA0CC;IAChE,KAAK,MAAMC,YAAYF,WAAY;QAE/B,qFAAqF;QACrF,kFAAkF;QAClF,+BAA+B;QAC/B,IAAIE,SAAS,eAAe,IAAI,QAAQA,SAAS,iBAAiB,IAAI,QAAQA,SAAS,SAAS,IAAI,QAAQA,SAAS,UAAU,EAAE;YAC7H;QACJ;QAEA,IAAIA,SAAS,IAAI,KAAKZ,yDAAkB,EAAE;YACtCS,iBAAiBG,SAAS,QAAQ,EAAED;YACpC;QACJ;QAEA,MAAME,UAAUT,wDAAaA,CAACQ,SAAS,IAAI,KAAKA,SAAS,WAAW,EAAE,SAASZ,qDAAgB;QAE/F,IAAIY,SAAS,IAAI,KAAKZ,qDAAgB,IAAIa,YAAY,OAAO;YACzD;QACJ;QAEAF,MAAM,IAAI,CAAC;YACP,UAAU;mBAAIC,SAAS,kBAAkB,CAAC;oBAAE,qBAAqB;gBAAK;gBAAIA,SAAS,eAAe;aAAG;YACrGC;QACJ;IACJ;AACJ;AAEA,MAAMC,WAAW,CAACC,QAAiCC;IAC/C,MAAM,EAAEC,QAAQ,EAAE,GAAGD;IACrB,IAAIE,SAAcH;IAElB,IAAK,IAAI3B,IAAI,GAAGC,SAAS4B,SAAS,MAAM,GAAG,GAAG7B,IAAIC,QAAQD,IAAK;QAC3D8B,SAASA,MAAM,CAACD,QAAQ,CAAC7B,EAAE,CAAC;QAE5B,yCAAyC;QACzC,IAAI8B,UAAU,QAAQ,OAAOA,WAAW,UAAU;YAC9C;QACJ;IACJ;IAEA,MAAMjC,MAAMgC,QAAQ,CAACA,SAAS,MAAM,GAAG,EAAE;IACzC,MAAM1B,QAAQ2B,MAAM,CAACjC,IAAI;IAEzB,IAAI+B,KAAK,OAAO,KAAK,OAAO;QACxB,IAAI,OAAOzB,UAAU,UAAU;YAC3B2B,MAAM,CAACjC,IAAI,GAAG,IAAIkC,KAAK5B;QAC3B;QAEA;IACJ;IAEA,IAAI6B,MAAM,OAAO,CAAC7B,QAAQ;QACtB,IAAK,IAAIH,IAAI,GAAGC,SAASE,MAAM,MAAM,EAAEH,IAAIC,QAAQD,IAAK;YACpD,IAAI,OAAOG,KAAK,CAACH,EAAE,KAAK,UAAU;gBAC9BG,KAAK,CAACH,EAAE,GAAG,IAAI+B,KAAK5B,KAAK,CAACH,EAAE;YAChC;QACJ;IACJ;AACJ;AAEA,kFAAkF,GAClF,MAAMiC,WAAW,IAAIC;AAErB;;;;;CAKC,GACM,MAAMC,wBAAwB,CAACvC;IAClC,MAAMwC,SAASH,SAAS,GAAG,CAACrC;IAE5B,IAAIwC,WAAW1C,WAAW;QACtB,OAAO0C;IACX;IAEA,MAAMb,QAAoB,EAAE;IAE5BF,iBAAiBzB,OAAO,UAAU,EAAE2B;IAEpC,MAAMc,UAAqCd,MAAM,MAAM,KAAK,IACtD,OACAI,CAAAA;QACE,IAAK,IAAI3B,IAAI,GAAGC,SAASsB,MAAM,MAAM,EAAEvB,IAAIC,QAAQD,IAAK;YACpD0B,SAASC,QAAQJ,KAAK,CAACvB,EAAE;QAC7B;IACJ;IAEJiC,SAAS,GAAG,CAACrC,QAAQyC;IAErB,OAAOA;AACX,EAAE;;;;;;;;ACzHK,MAAMC,OAAO,CAACrC,SAAiB,EAAE;IACpC,MAAMsC,QAAQ;IACd,MAAMC,aAAaD,MAAM,MAAM;IAC/B,IAAIxD,SAAS;IAEb,IAAK,IAAIiB,IAAI,GAAGA,IAAIC,QAAQD,IAAK;QAC7BjB,UAAUwD,KAAK,CAACE,KAAK,MAAM,KAAKD,aAAa,EAAE;IACnD;IACA,OAAOzD;AACX,EAAC;AAED,MAAM2D,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,IAAItC,IAAI,GAAGA,IAAI2C,cAAc,MAAM,EAAE3C,IAAK;QAC3C,MAAMoD,IAAIT,aAAa,CAAC3C,EAAE;QAC1B,IAAIoD,MAAM,KAAK;YACXd,QAAQ;YACR;QACJ;QAEA,IAAIe;QACJ,IAAIT,aAAaK,aAAa;YAC1B,2CAA2C;YAC3CI,IACKrD,IAAI,MAAM,IACLiD,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;;;;ACAA;AACA;AACA;AACA,uDAAuD,iBAAiB;AACxE;AACA,gDAAgD,aAAa;AAC7D,E;;;;;;;;;;;;;;;;;;;;;;;;;;ACJO,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;;;;;;;;;;;AC3BgH;AAC5D;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,YAAY/D,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,WAAW4B,QAA2B,EAAE;QAE5C,IAAIoC,SAAS;QAEb,IAAI,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAACpC,SAAS,EAAE,MAAM,MAAM;YACjDoC,SAAS,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAACpC,SAAS,EAAE,IAAI;QACtD;QAEA,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAACA,SAAS,EAAE,EAAEoC;QAEvC,OAAOA;IACX;IAEQ,UAAUpC,QAA2B,EAAErB,KAAc,EAAE;QAC3D,IAAI,OAAOA,UAAU,UAAU;YAC3B;QACJ;QAEA,MAAM0D,uBAAuB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAACrC,SAAS,EAAE;QAElE,IAAIrB,SAAS0D,sBAAsB;YAC/B;QACJ;QAEA,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAACrC,SAAS,EAAE,EAAErB;IAC3C;IAEQ,YAAY2D,IAA6B,EAAEtC,QAA2B,EAAU;QACpF,IAAIsC,IAAI,CAACtC,SAAS,IAAI,CAAC,IAAI,MAAM;YAC7B,OAAOsC,IAAI,CAACtC,SAAS,IAAI,CAAC;QAC9B;QAEA,IAAIA,SAAS,IAAI,KAAKZ,uCAAkB,EAAE;YACtC,MAAM0B,OAAOS,iCAAMA;YACnBe,IAAI,CAACtC,SAAS,IAAI,CAAC,GAAGc;YACtB,OAAOA;QACX;QAEA,IAAId,SAAS,IAAI,KAAKZ,uCAAkB,EAAE;YACtC,MAAMD,KAAK,IAAI,CAAC,UAAU,CAACa;YAC3BsC,IAAI,CAACtC,SAAS,IAAI,CAAC,GAAGb;YACtB,OAAOA;QACX;QAEA,MAAM,IAAIJ,MAAM,CAAC,aAAa,EAAEiB,SAAS,IAAI,CAAC,mCAAmC,EAAEA,SAAS,IAAI,CAAC,CAAC,CAAC;IACvG;IAEA;;;;;;KAMC,GACO,SAASsC,IAA6B,EAA2B;QACrE,MAAMC,SAAS;YAAE,GAAGD,IAAI;QAAC;QAEzB3B,8CAAqBA,CAAC,IAAI,CAAC,MAAM,IAAI4B;QAErC,OAAOA;IACX;IAEA,KAAKC,KAAgC,EAAE;QACnC,IAAK,IAAIhE,IAAI,GAAGC,SAAS+D,MAAM,MAAM,EAAEhE,IAAIC,QAAQD,IAAK;YACpD,MAAMW,KAAK,IAAI,CAAC,YAAY,CAACqD,KAAK,CAAChE,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,GAAG,CAACW,GAAG,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAACqD,KAAK,CAAChE,EAAE;QACvD;IACJ;IAEQ,oBAAoB8D,IAA6B,EAAS;QAC9D,MAAMG,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,MAAM1C,WAAWyC,YAAY,CAACC,EAAE;YAChC,MAAM/D,QAAQqB,SAAS,QAAQ,CAACsC;YAEhC,IAAI3D,SAAS,MAAM;gBACf,MAAM,IAAII,MAAM,CAAC,0BAA0B,EAAEiB,SAAS,IAAI,EAAE;YAChE;YAEA+B,IAAI,IAAI,CAACpD;QACb;QAEA,OAAO,IAAImD,KAAKA,IAAIC;IACxB;IAEQ,aAAaO,IAA6B,EAAS;QAEvD,IAAI,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE;YAC7B,MAAMG,eAAe,IAAI,CAAC,MAAM,CAAC,YAAY;YAC7C,MAAMV,MAAgBvB,MAAM,IAAI,CAAC;gBAAE,QAAQiC,aAAa,MAAM;YAAC;YAE/D,iFAAiF;YACjF,wEAAwE;YACxE,IAAIA,aAAa,MAAM,KAAK,GAAG;gBAC3B,MAAM9D,QAAQ,IAAI,CAAC,WAAW,CAAC2D,MAAMG,YAAY,CAAC,EAAE;gBACpD,IAAI,CAAC,SAAS,CAACA,YAAY,CAAC,EAAE,EAAE9D;gBAChCoD,GAAG,CAAC,EAAE,GAAGpD;YACb,OAAO;gBACH,IAAK,IAAI+D,IAAI,GAAGC,IAAIF,aAAa,MAAM,EAAEC,IAAIC,GAAGD,IAAK;oBACjD,MAAM/D,QAAQ,IAAI,CAAC,WAAW,CAAC2D,MAAMG,YAAY,CAACC,EAAE;oBACpD,IAAI,CAAC,SAAS,CAACD,YAAY,CAACC,EAAE,EAAE/D;oBAChCoD,GAAG,CAACW,EAAE,GAAG/D;gBACb;YACJ;YAEA,OAAO,IAAImD,KAAKA,IAAIC;QACxB;QAEA,OAAO,IAAI,CAAC,mBAAmB,CAACO;IACpC;IAEA,IAAIA,IAA6B,EAAE;QAC/B,MAAMnD,KAAK,IAAI,CAAC,YAAY,CAACmD;QAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAACnD,GAAG,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAACmD;IAC/C;IAEA;;;;KAIC,GACD,YAAYA,IAA6B,EAAE;QACvC,MAAMnD,KAAK,IAAI,CAAC,YAAY,CAACmD;QAC7B,MAAMjE,MAAMc,GAAG,QAAQ;QAEvB,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAACd,SAAS,OAAO;YAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA,KAAK,IAAI,CAAC,QAAQ,CAACiE;QACrC;IACJ;IAEA;;;;KAIC,GACD,SAASP,GAAa,EAAuC;QACzD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAID,KAAKA,IAAIC,KAAK,QAAQ;IACnD;IAEA,OAAOO,IAA6B,EAAE;QAClC,MAAMnD,KAAK,IAAI,CAAC,mBAAmB,CAACmD;QACpC,IAAI,CAAC,IAAI,CAAC,MAAM,CAACnD,GAAG,QAAQ;IAChC;IAEA,OAAOmD,IAA6B,EAAE;QAClC,MAAMnD,KAAK,IAAI,CAAC,mBAAmB,CAACmD;QACpC,IAAI,CAAC,IAAI,CAAC,GAAG,CAACnD,GAAG,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAACmD;IAC/C;IAEA,QAAQM,IAA2B,EAAE;QACjC,IAAI,CAAC,gBAAgB,CAAC,KAAK;QAC3B,IAAI,CAAC,IAAI,CAAC,KAAK;QACfA,KAAK5D,qCAAc;IACvB;IAEA,KAAK4D,IAA2B,EAAE;QAC9BA,KAAK5D,qCAAc;IACvB;IAEA,KAAK4D,IAA2B,EAAE;QAC9BA,KAAK5D,qCAAc;IACvB;AACJ;;;;;;;ACpM0B;AACM;AACR;AACe;AACJ;AACQ"}

package/dist/collections/index.js

@@ -377,6 +377,128 @@ var HashType = /*#__PURE__*/ (/* unused pure expression or super */ null && (fun
 }({})));
 
 
+},
+575(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
+__webpack_require__.d(__webpack_exports__, {
+  l: () => (isArrayValued)
+});
+/* import */ var _types__rspack_import_0 = __webpack_require__(537);
+
+/**
+ * Types whose runtime value is a JS array.
+ *
+ * `Array` and `Vector` are the same thing to every layer that copies, compares, hashes or
+ * freezes a value — a vector is a list of numbers and nothing more. They differ only where a
+ * backend chooses storage, which is the one place that should ask for `SchemaTypes.Vector` by
+ * name.
+ *
+ * This exists so adding a third array-shaped type is one edit rather than a hunt through
+ * twelve handlers. Missing one of those is silent in the worst way: a vector that clones by
+ * reference is shared with the change tracker's copy, so overwriting an embedding produces no
+ * diff and the save reports nothing to do.
+ */ const ARRAY_VALUED_TYPES = new Set([
+    _types__rspack_import_0/* .SchemaTypes.Array */.L.Array,
+    _types__rspack_import_0/* .SchemaTypes.Vector */.L.Vector
+]);
+/** True when the property's value is a JS array and needs value rather than reference semantics. */ const isArrayValued = (type)=>ARRAY_VALUED_TYPES.has(type);
+/**
+ * True when the property's elements are primitives, so a spread is a sufficient copy.
+ *
+ * A vector is always numbers, so it never needs the per-element deep copy an array of objects
+ * or dates does.
+ */ const PRIMITIVE_ELEMENT_TYPES = new Set([
+    _types__rspack_import_0/* .SchemaTypes.String */.L.String,
+    _types__rspack_import_0/* .SchemaTypes.Number */.L.Number,
+    _types__rspack_import_0/* .SchemaTypes.Boolean */.L.Boolean
+]);
+const hasPrimitiveElements = (type, elementType)=>type === SchemaTypes.Vector || PRIMITIVE_ELEMENT_TYPES.has(elementType);
+
+
+},
+894(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
+__webpack_require__.d(__webpack_exports__, {
+  T: () => (getStorageDateReviver)
+});
+/* import */ var _types__rspack_import_0 = __webpack_require__(537);
+/* import */ var _propertyKind__rspack_import_1 = __webpack_require__(575);
+
+
+const collectDatePaths = (properties, paths)=>{
+    for (const property of properties){
+        // The stored value belongs to whoever wrote it: a custom serializer, deserializer or
+        // transform reads it back, and would be handed a Date it did not expect. Unmapped
+        // properties are never stored.
+        if (property.valueSerializer != null || property.valueDeserializer != null || property.transform != null || property.isUnmapped) {
+            continue;
+        }
+        if (property.type === _types__rspack_import_0/* .SchemaTypes.Object */.L.Object) {
+            collectDatePaths(property.children, paths);
+            continue;
+        }
+        const isArray = (0,_propertyKind__rspack_import_1/* .isArrayValued */.l)(property.type) && property.innerSchema?.type === _types__rspack_import_0/* .SchemaTypes.Date */.L.Date;
+        if (property.type !== _types__rspack_import_0/* .SchemaTypes.Date */.L.Date && isArray === false) {
+            continue;
+        }
+        paths.push({
+            segments: [
+                ...property.getParentPathArray({
+                    useFromPropertyName: true
+                }),
+                property.getResolvedName()
+            ],
+            isArray
+        });
+    }
+};
+const reviveAt = (record, path)=>{
+    const { segments } = path;
+    let parent = record;
+    for(let i = 0, length = segments.length - 1; i < length; i++){
+        parent = parent[segments[i]];
+        // An absent or null parent holds no date
+        if (parent == null || typeof parent !== "object") {
+            return;
+        }
+    }
+    const key = segments[segments.length - 1];
+    const value = parent[key];
+    if (path.isArray === false) {
+        if (typeof value === "string") {
+            parent[key] = new Date(value);
+        }
+        return;
+    }
+    if (Array.isArray(value)) {
+        for(let i = 0, length = value.length; i < length; i++){
+            if (typeof value[i] === "string") {
+                value[i] = new Date(value[i]);
+            }
+        }
+    }
+};
+/** Per schema: `null` for a schema with no dates, so a caller can skip the pass. */ const revivers = new WeakMap();
+/**
+ * The reviver for `schema`'s records, or `null` when it declares no dates.
+ *
+ * Built once per compiled schema. A read revives every row it returns, so the paths are resolved
+ * here rather than per row.
+ */ const getStorageDateReviver = (schema)=>{
+    const cached = revivers.get(schema);
+    if (cached !== undefined) {
+        return cached;
+    }
+    const paths = [];
+    collectDatePaths(schema.properties, paths);
+    const reviver = paths.length === 0 ? null : (record)=>{
+        for(let i = 0, length = paths.length; i < length; i++){
+            reviveAt(record, paths[i]);
+        }
+    };
+    revivers.set(schema, reviver);
+    return reviver;
+};
+
+
 },
 618(__unused_rspack_module, __webpack_exports__, __webpack_require__) {
 __webpack_require__.d(__webpack_exports__, {
@@ -517,6 +639,8 @@ class IdSet {
 
 // EXTERNAL MODULE: ./src/schema/types.ts
 var types = __webpack_require__(537);
+// EXTERNAL MODULE: ./src/schema/utils/storageDates.ts
+var storageDates = __webpack_require__(894);
 // EXTERNAL MODULE: ./src/results/Result.ts
 var Result = __webpack_require__(718);
 // EXTERNAL MODULE: ./src/utilities/uuid.ts
@@ -582,29 +706,17 @@ class MemoryDataCollection {
         }
         throw new Error(`Id Property '${property.name}' must be string or number, found '${property.type}'`);
     }
-    _dateColumns;
-    /** Date columns, by the name a stored record uses. Nested dates live inside a JSON column. */ get dateColumns() {
-        if (this._dateColumns == null) {
-            this._dateColumns = this.schema.properties.filter((property)=>property.type === types/* .SchemaTypes.Date */.L.Date && property.getAssignmentPath().includes(".") === false).map((property)=>property.getResolvedName());
-        }
-        return this._dateColumns;
-    }
     /**
      * The record this collection keeps.
      *
      * A copy, so a caller holding the entity cannot write into the store afterwards. Dates are held
-     * as Dates: a predicate compares a Date, and a stored ISO string never matches one.
+     * as Dates, at the root, in objects and in arrays: a predicate compares a Date, and a stored ISO
+     * string never matches one. A durable subclass hydrates parsed JSON through here too.
      */ toStored(item) {
-        const columns = this.dateColumns;
         const stored = {
             ...item
         };
-        for(let i = 0, length = columns.length; i < length; i++){
-            const value = stored[columns[i]];
-            if (typeof value === "string") {
-                stored[columns[i]] = new Date(value);
-            }
-        }
+        (0,storageDates/* .getStorageDateReviver */.T)(this.schema)?.(stored);
         return stored;
     }
     seed(items) {