@spinajs/orm 2.0.481 → 2.0.482

package/lib/mjs/subject-executor.js

@@ -0,0 +1,312 @@
+/* eslint-disable prettier/prettier */
+import { DateTime } from 'luxon';
+import _ from 'lodash';
+import { createQuery, DeleteQueryBuilder, InsertQueryBuilder, UpdateQueryBuilder } from './builders.js';
+import { OrmException } from './exceptions.js';
+import { OrphanPolicy, ServerResponseMapper } from './interfaces.js';
+import { assertAssignedKeys, generateClientSideKeys, pkColumns, pkGeneration, pkValueOf, setPkValue, whereAnyPk, wherePk } from './primary-keys.js';
+/** Rows per batched statement when the caller does not say. */
+export const DEFAULT_SAVE_CHUNK = 100;
+/**
+ * Runs a sorted plan.
+ *
+ * Every statement is built through `createQuery`, so table naming, schema qualification and
+ * identifier escaping are the same as on the ActiveRecord paths. No connection is threaded by
+ * hand: `OrmDriver.transaction()` carries it in `AsyncLocalStorage` and the builders resolved
+ * from that driver pick it up automatically.
+ *
+ * The executor does **not** open the transaction — `UnitOfWork` does — so that a caller can
+ * drive it directly in a test and so that nested saves inside one transaction fold into
+ * savepoints rather than each opening their own.
+ */
+export class SubjectExecutor {
+    constructor(options) {
+        this.options = options;
+    }
+    async execute(plan) {
+        const result = {
+            Inserted: 0,
+            Updated: 0,
+            Deleted: 0,
+            SoftDeleted: 0,
+            JunctionInserted: 0,
+            JunctionDeleted: 0,
+        };
+        await this.runInserts(plan, result);
+        await this.runUpdates(plan, result);
+        await this.runJunctions(plan, result);
+        await this.runOrphans(plan, result);
+        return result;
+    }
+    /**
+     * Inserts every insert subject in the order the sorter produced, reading each generated key
+     * back before moving on so the next subject's foreign keys can be resolved.
+     *
+     * One statement per row, deliberately, and NOT subject to `options.chunk`: a batched
+     * multi-row INSERT can only return keys where the dialect supports RETURNING or where
+     * `insertIdIsFirstOfBatch` holds, and a subject's key is needed by the very next subject in
+     * the order. Batching here is a real feature — it has to carry the per-dialect key-backfill
+     * rules with it — not something to fold into the chunking used for junction and orphan rows.
+     */
+    async runInserts(plan, result) {
+        for (const subject of plan.Inserts) {
+            await this.insertOne(subject);
+            result.Inserted += 1;
+        }
+    }
+    /**
+     * One INSERT, with the key read back.
+     *
+     * Mirrors `ModelBase.insert()`'s key handling rather than inventing a second one: client-side
+     * keys are generated first, `assigned` keys are asserted before anything touches the database,
+     * and RETURNING is requested when an `auto` key needs to come back and the dialect supports it.
+     */
+    async insertOne(subject) {
+        const descriptor = subject.Descriptor;
+        const model = subject.Model;
+        // Both run BEFORE the query is built, so an `assigned` key that was never supplied fails
+        // without touching the database.
+        generateClientSideKeys(model, descriptor);
+        assertAssignedKeys(model, descriptor);
+        const { query, container } = createQuery(model.constructor, InsertQueryBuilder);
+        const mapper = container.resolve(ServerResponseMapper);
+        const needsKeyBack = pkColumns(descriptor).some((c) => pkGeneration(descriptor, c) === 'auto');
+        if (needsKeyBack && query.Driver.supportedFeatures().insertReturning) {
+            query.returning(pkColumns(descriptor));
+        }
+        const response = mapper.read((await query.values(this.insertPayload(subject))), pkColumns(descriptor));
+        this.backfillKey(subject, response.Returning, response.LastInsertId, needsKeyBack);
+        model.IsDirty = false;
+        subject.Model.takeSnapshot();
+    }
+    /**
+     * Runs every update, including the follow-up updates that carry deferred self-referencing
+     * foreign keys.
+     *
+     * A subject whose payload comes out empty emits nothing. This is the single place that
+     * decides whether a row actually changed: pending foreign keys are written onto the model
+     * first and `changedColumns()` is read afterwards, so a re-parented child that was clean
+     * when the subjects were built is caught here and nowhere else.
+     */
+    async runUpdates(plan, result) {
+        for (const subject of plan.Updates) {
+            const payload = this.updatePayload(subject);
+            if (payload === null) {
+                continue;
+            }
+            const { query } = createQuery(subject.Model.constructor, UpdateQueryBuilder);
+            const update = query.update(payload);
+            wherePk(update, subject.Descriptor, subject.Model.PrimaryKeyValue);
+            await update;
+            subject.Model.IsDirty = false;
+            subject.Model.takeSnapshot();
+            result.Updated += 1;
+        }
+    }
+    /**
+     * The column payload for one UPDATE, or `null` when there is nothing to write.
+     *
+     * The primary key columns are excluded: writing them is a no-op at best and, for a model
+     * whose key column differs from its snapshot for any other reason, a silent identity change.
+     *
+     * @param subject - an update subject, or an insert subject with deferred foreign keys
+     */
+    updatePayload(subject) {
+        // Resolve every foreign key onto the model first, so the diff below sees them.
+        for (const fk of subject.PendingForeignKeys.concat(subject.DeferredForeignKeys)) {
+            subject.Model[fk.Column] = fk.Target.PrimaryKeyValue;
+        }
+        const keyColumns = pkColumns(subject.Descriptor);
+        const changed = subject.Model.changedColumns().filter((c) => !keyColumns.includes(c));
+        if (changed.length === 0) {
+            return null;
+        }
+        const updatedAt = subject.Descriptor.Timestamps?.UpdatedAt;
+        if (updatedAt) {
+            subject.Model[updatedAt] = DateTime.now();
+            if (!changed.includes(updatedAt)) {
+                changed.push(updatedAt);
+            }
+        }
+        subject.ChangedColumns = changed;
+        return _.pick(subject.Model.toSql(), changed);
+    }
+    /**
+     * The column payload for one INSERT.
+     *
+     * Starts from the model's own serialization, drops every column whose foreign key is
+     * deferred to a follow-up UPDATE, then writes every pending foreign key from its target's
+     * now-known primary key. The overwrite matters: `StandardModelToSqlConverter` already wrote
+     * that column from the relation object, and for a target inserted moments ago that value was
+     * `undefined` when the model was serialized.
+     */
+    insertPayload(subject) {
+        const payload = subject.Model.toSql();
+        for (const fk of subject.DeferredForeignKeys) {
+            // eslint-disable-next-line security/detect-object-injection
+            delete payload[fk.Column];
+        }
+        for (const fk of subject.PendingForeignKeys) {
+            const value = fk.Target.PrimaryKeyValue;
+            // eslint-disable-next-line security/detect-object-injection
+            payload[fk.Column] = value;
+            subject.Model[fk.Column] = value;
+        }
+        return payload;
+    }
+    /**
+     * Writes a generated key onto the model.
+     *
+     * Uses `setPkValue` — the primary-keys helper that assigns the key columns and nothing else —
+     * rather than the `PrimaryKeyValue` setter, whose `RelationType.One` branch also writes the
+     * new key onto the owner's `SingleRelation` wrapper, which persists nothing. The executor
+     * resolves foreign keys itself and does not want that side effect.
+     *
+     * A key the caller already supplied ( uuid / assigned strategies ) is never overwritten.
+     */
+    backfillKey(subject, returning, lastInsertId, needsKeyBack) {
+        const descriptor = subject.Descriptor;
+        if (pkColumns(descriptor).length === 0) {
+            return;
+        }
+        if ((returning ?? []).length !== 0) {
+            setPkValue(subject.Model, descriptor, pkValueOf(returning[0], descriptor));
+            return;
+        }
+        if (!needsKeyBack) {
+            return;
+        }
+        // A composite key is a tuple, and a tuple is ALWAYS truthy — check every part.
+        const current = subject.Model.PrimaryKeyValue;
+        const missing = Array.isArray(current) ? current.some((v) => v === null || v === undefined) : current === null || current === undefined;
+        if (!missing) {
+            return;
+        }
+        if (lastInsertId === null || lastInsertId === undefined) {
+            throw new OrmException(`insert of ${subject.Identity} returned no generated key and the model set none itself`);
+        }
+        setPkValue(subject.Model, descriptor, lastInsertId);
+    }
+    /**
+     * Creates and destroys junction rows.
+     *
+     * Rows are written column-first rather than through the junction model, so a junction model
+     * is not required to declare `@BelongsTo` on both sides — `ManyToManyRelationList.update()`
+     * does require that, and none of the existing junction fixtures satisfy it.
+     *
+     * Inserts run before deletes so that re-linking the same pair inside one save cannot
+     * momentarily violate a unique constraint on the junction table in the other order.
+     */
+    async runJunctions(plan, result) {
+        for (const delta of plan.Junctions) {
+            await this.insertJunctionRows(delta, result);
+            await this.deleteJunctionRows(delta, result);
+        }
+    }
+    async insertJunctionRows(delta, result) {
+        if (delta.Added.length === 0) {
+            return;
+        }
+        const sourceColumn = delta.Descriptor.JunctionModelSourceModelFKey_Name;
+        const targetColumn = delta.Descriptor.JunctionModelTargetModelFKey_Name;
+        if (!sourceColumn || !targetColumn) {
+            throw new OrmException(`manyToMany relation ${delta.Descriptor.Name} has no junction foreign-key column names`);
+        }
+        const ownerKey = delta.Owner.PrimaryKeyValue;
+        for (const batch of this.chunked(delta.Added)) {
+            const values = batch.map((target) => ({
+                [sourceColumn]: ownerKey,
+                [targetColumn]: target.PrimaryKeyValue,
+            }));
+            const { query } = createQuery(delta.Descriptor.JunctionModel, InsertQueryBuilder);
+            await query.values(values);
+            result.JunctionInserted += values.length;
+        }
+    }
+    async deleteJunctionRows(delta, result) {
+        if (delta.RemovedKeys.length === 0) {
+            return;
+        }
+        const sourceColumn = delta.Descriptor.JunctionModelSourceModelFKey_Name;
+        const targetColumn = delta.Descriptor.JunctionModelTargetModelFKey_Name;
+        const ownerKey = delta.Owner.PrimaryKeyValue;
+        for (const batch of this.chunked(delta.RemovedKeys)) {
+            const { query } = createQuery(delta.Descriptor.JunctionModel, DeleteQueryBuilder);
+            await query.where(sourceColumn, ownerKey).whereIn(targetColumn, batch);
+            result.JunctionDeleted += batch.length;
+        }
+    }
+    /**
+     * Applies the orphan policy to every detached row.
+     *
+     * `nullify` and `soft-delete` run first as UPDATEs, then `delete` runs as DELETEs, and the
+     * deltas arrive from the sorter already ordered children-before-parents so a delete cannot
+     * strand a foreign key.
+     *
+     * `createQuery` only adds the default `DeletedAt IS NULL` filter to a SelectQueryBuilder, so
+     * these builders are unfiltered — which is what stamping an already-soft-deleted row needs.
+     */
+    async runOrphans(plan, result) {
+        const updates = plan.Orphans.filter((o) => this.effectivePolicy(o) !== OrphanPolicy.Delete);
+        const deletes = plan.Orphans.filter((o) => this.effectivePolicy(o) === OrphanPolicy.Delete);
+        for (const delta of updates) {
+            await this.updateOrphans(delta, result);
+        }
+        for (const delta of deletes) {
+            await this.deleteOrphans(delta, result);
+        }
+    }
+    /**
+     * The policy actually applied to `delta`.
+     *
+     * `delete` on a model that declares `@SoftDelete` degrades to `soft-delete`, so orphaning a
+     * row and calling `destroy()` on it mean the same thing. `ModelBase.destroy()` has always
+     * stamped `DeletedAt` rather than issuing a DELETE for such a model; an orphan taking the
+     * other branch made "delete this row" depend on which code path reached it, and hard-erased
+     * rows the model had declared should never be hard-erased.
+     */
+    effectivePolicy(delta) {
+        if (delta.Policy === OrphanPolicy.Delete && delta.TargetDescriptor.SoftDelete?.DeletedAt) {
+            return OrphanPolicy.SoftDelete;
+        }
+        return delta.Policy;
+    }
+    async updateOrphans(delta, result) {
+        const policy = this.effectivePolicy(delta);
+        const payload = policy === OrphanPolicy.Nullify ? { [delta.Descriptor.ForeignKey]: null } : { [delta.TargetDescriptor.SoftDelete.DeletedAt]: DateTime.now() };
+        for (const batch of this.chunked(delta.PrimaryKeys)) {
+            const { query } = createQuery(delta.Descriptor.TargetModel, UpdateQueryBuilder);
+            const update = query.update(payload);
+            whereAnyPk(update, delta.TargetDescriptor, batch);
+            await update;
+            if (policy === OrphanPolicy.Nullify) {
+                result.Updated += batch.length;
+            }
+            else {
+                result.SoftDeleted += batch.length;
+            }
+        }
+    }
+    async deleteOrphans(delta, result) {
+        for (const batch of this.chunked(delta.PrimaryKeys)) {
+            const { query } = createQuery(delta.Descriptor.TargetModel, DeleteQueryBuilder);
+            whereAnyPk(query, delta.TargetDescriptor, batch);
+            await query;
+            result.Deleted += batch.length;
+        }
+    }
+    /** Rows per batched statement. */
+    get chunkSize() {
+        const chunk = this.options.chunk ?? DEFAULT_SAVE_CHUNK;
+        return chunk > 0 ? chunk : DEFAULT_SAVE_CHUNK;
+    }
+    /** Splits `items` into runs of at most `chunkSize`. */
+    chunked(items) {
+        const out = [];
+        for (let i = 0; i < items.length; i += this.chunkSize) {
+            out.push(items.slice(i, i + this.chunkSize));
+        }
+        return out;
+    }
+}
+//# sourceMappingURL=subject-executor.js.map

package/lib/mjs/subject-executor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subject-executor.js","sourceRoot":"","sources":["../../src/subject-executor.ts"],"names":[],"mappings":"AAAA,sCAAsC;AACtC,OAAO,EAAE,QAAQ,EAAE,MAAM,OAAO,CAAC;AACjC,OAAO,CAAC,MAAM,QAAQ,CAAC;AACvB,OAAO,EAAE,WAAW,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACxG,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAA4C,YAAY,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AAC/G,OAAO,EAAE,kBAAkB,EAAE,sBAAsB,EAAE,SAAS,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAIpJ,+DAA+D;AAC/D,MAAM,CAAC,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAEtC;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,eAAe;IAC1B,YAAsB,OAAqB;QAArB,YAAO,GAAP,OAAO,CAAc;IAAG,CAAC;IAExC,KAAK,CAAC,OAAO,CAAC,IAAiB;QACpC,MAAM,MAAM,GAAgB;YAC1B,QAAQ,EAAE,CAAC;YACX,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,CAAC;YACV,WAAW,EAAE,CAAC;YACd,gBAAgB,EAAE,CAAC;YACnB,eAAe,EAAE,CAAC;SACnB,CAAC;QAEF,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACpC,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACpC,MAAM,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACtC,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAEpC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;OASG;IACO,KAAK,CAAC,UAAU,CAAC,IAAiB,EAAE,MAAmB;QAC/D,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACnC,MAAM,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAC9B,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACO,KAAK,CAAC,SAAS,CAAC,OAAgB;QACxC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;QACtC,MAAM,KAAK,GAAQ,OAAO,CAAC,KAAK,CAAC;QAEjC,yFAAyF;QACzF,iCAAiC;QACjC,sBAAsB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAC1C,kBAAkB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAEtC,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,WAAW,EAAE,kBAAkB,CAAC,CAAC;QAChF,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAC;QAEvD,MAAM,YAAY,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC;QAC/F,IAAI,YAAY,IAAI,KAAK,CAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC,eAAe,EAAE,CAAC;YACrE,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;QACzC,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAkB,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;QAExH,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;QAEnF,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC;QACtB,OAAO,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;IAC/B,CAAC;IAED;;;;;;;;OAQG;IACO,KAAK,CAAC,UAAU,CAAC,IAAiB,EAAE,MAAmB;QAC/D,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACnC,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YAC5C,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACrB,SAAS;YACX,CAAC;YAED,MAAM,EAAE,KAAK,EAAE,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,kBAAkB,CAAC,CAAC;YAC7E,MAAM,MAAM,GAAI,KAAqC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACtE,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YACnE,MAAM,MAAM,CAAC;YAEb,OAAO,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC;YAC9B,OAAO,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;YAE7B,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACO,aAAa,CAAC,OAAgB;QACtC,+EAA+E;QAC/E,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,kBAAkB,CAAC,MAAM,CAAC,OAAO,CAAC,mBAAmB,CAAC,EAAE,CAAC;YAC/E,OAAO,CAAC,KAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,eAAe,CAAC;QAChE,CAAC;QAED,MAAM,UAAU,GAAG,SAAS,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,UAAU,EAAE,SAAS,CAAC;QAC3D,IAAI,SAAS,EAAE,CAAC;YACb,OAAO,CAAC,KAAa,CAAC,SAAS,CAAC,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC;YACnD,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;gBACjC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,OAAO,CAAC,cAAc,GAAG,OAAO,CAAC;QAEjC,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAA6B,EAAE,OAAO,CAAC,CAAC;IAC3E,CAAC;IAED;;;;;;;;OAQG;IACO,aAAa,CAAC,OAAgB;QACtC,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,EAA6B,CAAC;QAEjE,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,mBAAmB,EAAE,CAAC;YAC7C,4DAA4D;YAC5D,OAAO,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;QAED,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,EAAE,CAAC,MAAM,CAAC,eAAe,CAAC;YACxC,4DAA4D;YAC5D,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;YAC1B,OAAO,CAAC,KAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;QAC5C,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;;OASG;IACO,WAAW,CAAC,OAAgB,EAAE,SAAgB,EAAE,YAAoB,EAAE,YAAqB;QACnG,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;QAEtC,IAAI,SAAS,CAAC,UAAU,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvC,OAAO;QACT,CAAC;QAED,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,UAAU,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;YAC3E,OAAO;QACT,CAAC;QAED,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,OAAO;QACT,CAAC;QAED,+EAA+E;QAC/E,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC;QAC9C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,SAAS,CAAC;QAExI,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO;QACT,CAAC;QAED,IAAI,YAAY,KAAK,IAAI,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YACxD,MAAM,IAAI,YAAY,CAAC,aAAa,OAAO,CAAC,QAAQ,0DAA0D,CAAC,CAAC;QAClH,CAAC;QAED,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;IACtD,CAAC;IAED;;;;;;;;;OASG;IACO,KAAK,CAAC,YAAY,CAAC,IAAiB,EAAE,MAAmB;QACjE,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,MAAM,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAC7C,MAAM,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAES,KAAK,CAAC,kBAAkB,CAAC,KAAqB,EAAE,MAAmB;QAC3E,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO;QACT,CAAC;QAED,MAAM,YAAY,GAAG,KAAK,CAAC,UAAU,CAAC,iCAAiC,CAAC;QACxE,MAAM,YAAY,GAAG,KAAK,CAAC,UAAU,CAAC,iCAAiC,CAAC;QAExE,IAAI,CAAC,YAAY,IAAI,CAAC,YAAY,EAAE,CAAC;YACnC,MAAM,IAAI,YAAY,CAAC,uBAAuB,KAAK,CAAC,UAAU,CAAC,IAAI,2CAA2C,CAAC,CAAC;QAClH,CAAC;QAED,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,eAAe,CAAC;QAE7C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9C,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;gBACpC,CAAC,YAAY,CAAC,EAAE,QAAQ;gBACxB,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC,eAAe;aACvC,CAAC,CAAC,CAAC;YAEJ,MAAM,EAAE,KAAK,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,aAAc,EAAE,kBAAkB,CAAC,CAAC;YACnF,MAAM,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAE3B,MAAM,CAAC,gBAAgB,IAAI,MAAM,CAAC,MAAM,CAAC;QAC3C,CAAC;IACH,CAAC;IAES,KAAK,CAAC,kBAAkB,CAAC,KAAqB,EAAE,MAAmB;QAC3E,IAAI,KAAK,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,OAAO;QACT,CAAC;QAED,MAAM,YAAY,GAAG,KAAK,CAAC,UAAU,CAAC,iCAAkC,CAAC;QACzE,MAAM,YAAY,GAAG,KAAK,CAAC,UAAU,CAAC,iCAAkC,CAAC;QACzE,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,eAAe,CAAC;QAE7C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC;YACpD,MAAM,EAAE,KAAK,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,aAAc,EAAE,kBAAkB,CAAC,CAAC;YACnF,MAAO,KAAqC,CAAC,KAAK,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;YAExG,MAAM,CAAC,eAAe,IAAI,KAAK,CAAC,MAAM,CAAC;QACzC,CAAC;IACH,CAAC;IAED;;;;;;;;;OASG;IACO,KAAK,CAAC,UAAU,CAAC,IAAiB,EAAE,MAAmB;QAC/D,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC;QAC5F,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC;QAE5F,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC1C,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACO,eAAe,CAAC,KAAmB;QAC3C,IAAI,KAAK,CAAC,MAAM,KAAK,YAAY,CAAC,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,UAAU,EAAE,SAAS,EAAE,CAAC;YACzF,OAAO,YAAY,CAAC,UAAU,CAAC;QACjC,CAAC;QAED,OAAO,KAAK,CAAC,MAAM,CAAC;IACtB,CAAC;IAES,KAAK,CAAC,aAAa,CAAC,KAAmB,EAAE,MAAmB;QACpE,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,OAAO,GAAG,MAAM,KAAK,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,gBAAgB,CAAC,UAAW,CAAC,SAAS,CAAC,EAAE,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;QAE/J,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC;YACpD,MAAM,EAAE,KAAK,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,kBAAkB,CAAC,CAAC;YAChF,MAAM,MAAM,GAAI,KAAqC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACtE,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;YAClD,MAAM,MAAM,CAAC;YAEb,IAAI,MAAM,KAAK,YAAY,CAAC,OAAO,EAAE,CAAC;gBACpC,MAAM,CAAC,OAAO,IAAI,KAAK,CAAC,MAAM,CAAC;YACjC,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,WAAW,IAAI,KAAK,CAAC,MAAM,CAAC;YACrC,CAAC;QACH,CAAC;IACH,CAAC;IAES,KAAK,CAAC,aAAa,CAAC,KAAmB,EAAE,MAAmB;QACpE,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC;YACpD,MAAM,EAAE,KAAK,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,kBAAkB,CAAC,CAAC;YAChF,UAAU,CAAC,KAAoC,EAAE,KAAK,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;YAChF,MAAM,KAAK,CAAC;YAEZ,MAAM,CAAC,OAAO,IAAI,KAAK,CAAC,MAAM,CAAC;QACjC,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,IAAc,SAAS;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI,kBAAkB,CAAC;QACvD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,kBAAkB,CAAC;IAChD,CAAC;IAED,uDAAuD;IAC7C,OAAO,CAAI,KAAU;QAC7B,MAAM,GAAG,GAAU,EAAE,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACtD,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF"}

package/lib/mjs/subject-sorter.d.ts

@@ -0,0 +1,70 @@
+import { OrmException } from './exceptions.js';
+import type { ModelBase } from './model.js';
+import { IJunctionDelta, IOrphanDelta, Subject, SubjectSet } from './subject.js';
+/**
+ * Raised when the insert order cannot be satisfied because two or more rows reference each
+ * other through non-deferrable foreign keys.
+ */
+export declare class OrmCycleException extends OrmException {
+}
+/**
+ * A `SubjectSet` in execution order.
+ */
+export interface ISortedPlan {
+    /** Insert subjects, every parent before every child that references it. */
+    Inserts: Subject[];
+    /** Update subjects, followed by insert subjects carrying deferred foreign keys. */
+    Updates: Subject[];
+    Junctions: IJunctionDelta[];
+    /** Orphan actions, children before parents. */
+    Orphans: IOrphanDelta[];
+}
+export declare class SubjectSorter {
+    /**
+     * Orders a subject set for execution.
+     *
+     * @param set - output of `SubjectBuilder.build()`
+     * @throws OrmCycleException when a non-self-referencing foreign-key cycle makes the order
+     *         unsatisfiable
+     */
+    sort(set: SubjectSet): ISortedPlan;
+    /**
+     * Kahn's algorithm over the insert subjects, in O(V + E).
+     *
+     * Each subject carries a count of how many not-yet-emitted subjects it must follow, plus the
+     * list of subjects waiting on IT. Emitting a subject decrements its dependents' counters and
+     * moves any that reach zero onto the ready queue, so no pass ever rescans the whole graph.
+     * The previous shape rebuilt the entire dependency map and re-filtered every insert on every
+     * pass — O(V² · E) on a deep chain, which is exactly the shape `deferSelfReferences` exists
+     * to serve ( a self-referencing tree inserted parent-by-parent ).
+     *
+     * Stable: the queue is seeded and refilled in the subjects' own order, so a dependency-free
+     * graph comes out exactly as it went in.
+     */
+    protected order(inserts: Subject[]): Subject[];
+    /**
+     * In-degree per remaining subject, and the reverse edges needed to decrement them.
+     *
+     * `pending` counts DISTINCT targets: two foreign keys on one subject pointing at the same
+     * target are one dependency, and counting them twice would leave a counter that never
+     * reaches zero and a spurious cycle report.
+     */
+    protected buildDegrees(inserts: Subject[], byModel: Map<ModelBase, Subject>, remaining: Set<Subject>): {
+        pending: Map<Subject, number>;
+        dependents: Map<Subject, Subject[]>;
+    };
+    /**
+     * Breaks a cycle by deferring the foreign keys that point at the *same model* — a
+     * self-referencing hierarchy, which is a cycle between models but not between rows.
+     * The row is inserted without the column and a follow-up UPDATE sets it.
+     *
+     * @returns true when at least one foreign key was deferred, i.e. progress is possible
+     */
+    protected deferSelfReferences(remaining: Set<Subject>, byModel: Map<ModelBase, Subject>): boolean;
+    /**
+     * Children before parents, so a DELETE never strands a foreign key. A model that does not
+     * appear in the insert order at all keeps its relative position at the front.
+     */
+    protected orderOrphans(orphans: IOrphanDelta[], inserts: Subject[]): IOrphanDelta[];
+}
+//# sourceMappingURL=subject-sorter.d.ts.map

package/lib/mjs/subject-sorter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"subject-sorter.d.ts","sourceRoot":"","sources":["../../src/subject-sorter.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,cAAc,EAAE,YAAY,EAAsB,OAAO,EAAoB,UAAU,EAAE,MAAM,cAAc,CAAC;AAEvH;;;GAGG;AACH,qBAAa,iBAAkB,SAAQ,YAAY;CAAG;AAEtD;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,2EAA2E;IAC3E,OAAO,EAAE,OAAO,EAAE,CAAC;IACnB,mFAAmF;IACnF,OAAO,EAAE,OAAO,EAAE,CAAC;IACnB,SAAS,EAAE,cAAc,EAAE,CAAC;IAC5B,+CAA+C;IAC/C,OAAO,EAAE,YAAY,EAAE,CAAC;CACzB;AAED,qBAAa,aAAa;IACxB;;;;;;OAMG;IACI,IAAI,CAAC,GAAG,EAAE,UAAU,GAAG,WAAW;IAuBzC;;;;;;;;;;;;OAYG;IACH,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE;IAqD9C;;;;;;OAMG;IACH,SAAS,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,OAAO,CAAC;;;;IAqCpG;;;;;;OAMG;IACH,SAAS,CAAC,mBAAmB,CAAC,SAAS,EAAE,GAAG,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,OAAO;IA0BjG;;;OAGG;IACH,SAAS,CAAC,YAAY,CAAC,OAAO,EAAE,YAAY,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,YAAY,EAAE;CAUpF"}

package/lib/mjs/subject-sorter.js

@@ -0,0 +1,168 @@
+/* eslint-disable prettier/prettier */
+import { OrmException } from './exceptions.js';
+import { SubjectOperation } from './subject.js';
+/**
+ * Raised when the insert order cannot be satisfied because two or more rows reference each
+ * other through non-deferrable foreign keys.
+ */
+export class OrmCycleException extends OrmException {
+}
+export class SubjectSorter {
+    /**
+     * Orders a subject set for execution.
+     *
+     * @param set - output of `SubjectBuilder.build()`
+     * @throws OrmCycleException when a non-self-referencing foreign-key cycle makes the order
+     *         unsatisfiable
+     */
+    sort(set) {
+        const inserts = set.Subjects.filter((s) => s.Operation === SubjectOperation.Insert);
+        const ordered = this.order(inserts);
+        const deferred = ordered.filter((s) => s.DeferredForeignKeys.length > 0);
+        // `None` subjects that carry a pending foreign key are candidates for promotion: a clean
+        // child re-parented to another owner in this graph classifies as `None` ( its columns match
+        // its snapshot ) and only becomes an UPDATE once the executor writes the new owner key onto
+        // it and re-reads the diff. Excluding them here would lose the move entirely.
+        //
+        // Including them is safe and cheap: `SubjectExecutor.updatePayload` returns null — and the
+        // executor emits nothing — for any subject whose diff is still empty afterwards.
+        const updates = set.Subjects.filter((s) => s.Operation === SubjectOperation.Update || (s.Operation === SubjectOperation.None && s.PendingForeignKeys.length > 0)).concat(deferred);
+        return {
+            Inserts: ordered,
+            Updates: updates,
+            Junctions: set.Junctions,
+            Orphans: this.orderOrphans(set.Orphans, ordered),
+        };
+    }
+    /**
+     * Kahn's algorithm over the insert subjects, in O(V + E).
+     *
+     * Each subject carries a count of how many not-yet-emitted subjects it must follow, plus the
+     * list of subjects waiting on IT. Emitting a subject decrements its dependents' counters and
+     * moves any that reach zero onto the ready queue, so no pass ever rescans the whole graph.
+     * The previous shape rebuilt the entire dependency map and re-filtered every insert on every
+     * pass — O(V² · E) on a deep chain, which is exactly the shape `deferSelfReferences` exists
+     * to serve ( a self-referencing tree inserted parent-by-parent ).
+     *
+     * Stable: the queue is seeded and refilled in the subjects' own order, so a dependency-free
+     * graph comes out exactly as it went in.
+     */
+    order(inserts) {
+        const byModel = new Map();
+        for (const s of inserts) {
+            byModel.set(s.Model, s);
+        }
+        const remaining = new Set(inserts);
+        const output = [];
+        let { pending, dependents } = this.buildDegrees(inserts, byModel, remaining);
+        let ready = inserts.filter((s) => pending.get(s) === 0);
+        while (output.length < inserts.length) {
+            if (ready.length === 0) {
+                // Nothing can proceed. Either a genuine cycle, or a self-referencing one that can be
+                // broken by deferring the offending column to a follow-up UPDATE. Deferring mutates
+                // PendingForeignKeys, so the degrees are recomputed once — at most once per cycle
+                // broken, not once per emitted subject.
+                if (!this.deferSelfReferences(remaining, byModel)) {
+                    const names = [...remaining].map((s) => s.Descriptor.Name);
+                    throw new OrmCycleException(`cannot order INSERTs: foreign-key cycle between models ${[...new Set(names)].join(' -> ')}. Break the cycle by saving one side first, or make one of the foreign keys deferrable by pointing it at the same model.`);
+                }
+                ({ pending, dependents } = this.buildDegrees(inserts, byModel, remaining));
+                ready = inserts.filter((s) => remaining.has(s) && pending.get(s) === 0);
+                continue;
+            }
+            const next = ready;
+            ready = [];
+            for (const s of next) {
+                output.push(s);
+                remaining.delete(s);
+                for (const dependent of dependents.get(s) ?? []) {
+                    if (!remaining.has(dependent)) {
+                        continue;
+                    }
+                    const left = pending.get(dependent) - 1;
+                    pending.set(dependent, left);
+                    if (left === 0) {
+                        ready.push(dependent);
+                    }
+                }
+            }
+        }
+        return output;
+    }
+    /**
+     * In-degree per remaining subject, and the reverse edges needed to decrement them.
+     *
+     * `pending` counts DISTINCT targets: two foreign keys on one subject pointing at the same
+     * target are one dependency, and counting them twice would leave a counter that never
+     * reaches zero and a spurious cycle report.
+     */
+    buildDegrees(inserts, byModel, remaining) {
+        const pending = new Map();
+        const dependents = new Map();
+        for (const s of inserts) {
+            pending.set(s, 0);
+        }
+        for (const s of inserts) {
+            if (!remaining.has(s)) {
+                continue;
+            }
+            const seen = new Set();
+            for (const fk of s.PendingForeignKeys) {
+                const target = byModel.get(fk.Target);
+                if (!target || target === s || !remaining.has(target) || seen.has(target)) {
+                    continue;
+                }
+                seen.add(target);
+                pending.set(s, pending.get(s) + 1);
+                const list = dependents.get(target);
+                if (list) {
+                    list.push(s);
+                }
+                else {
+                    dependents.set(target, [s]);
+                }
+            }
+        }
+        return { pending, dependents };
+    }
+    /**
+     * Breaks a cycle by deferring the foreign keys that point at the *same model* — a
+     * self-referencing hierarchy, which is a cycle between models but not between rows.
+     * The row is inserted without the column and a follow-up UPDATE sets it.
+     *
+     * @returns true when at least one foreign key was deferred, i.e. progress is possible
+     */
+    deferSelfReferences(remaining, byModel) {
+        let progress = false;
+        for (const s of remaining) {
+            const keep = [];
+            for (const fk of s.PendingForeignKeys) {
+                const target = byModel.get(fk.Target);
+                const cyclic = target !== undefined && remaining.has(target);
+                const selfReferencing = target !== undefined && target.Descriptor.TableName === s.Descriptor.TableName;
+                if (cyclic && selfReferencing) {
+                    s.DeferredForeignKeys.push(fk);
+                    progress = true;
+                    continue;
+                }
+                keep.push(fk);
+            }
+            s.PendingForeignKeys = keep;
+        }
+        return progress;
+    }
+    /**
+     * Children before parents, so a DELETE never strands a foreign key. A model that does not
+     * appear in the insert order at all keeps its relative position at the front.
+     */
+    orderOrphans(orphans, inserts) {
+        const rank = new Map();
+        inserts.forEach((s, i) => {
+            if (!rank.has(s.Descriptor.TableName)) {
+                rank.set(s.Descriptor.TableName, i);
+            }
+        });
+        return [...orphans].sort((a, b) => (rank.get(b.TargetDescriptor.TableName) ?? -1) - (rank.get(a.TargetDescriptor.TableName) ?? -1));
+    }
+}
+//# sourceMappingURL=subject-sorter.js.map

package/lib/mjs/subject-sorter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subject-sorter.js","sourceRoot":"","sources":["../../src/subject-sorter.ts"],"names":[],"mappings":"AAAA,sCAAsC;AACtC,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,OAAO,EAA6D,gBAAgB,EAAc,MAAM,cAAc,CAAC;AAEvH;;;GAGG;AACH,MAAM,OAAO,iBAAkB,SAAQ,YAAY;CAAG;AAetD,MAAM,OAAO,aAAa;IACxB;;;;;;OAMG;IACI,IAAI,CAAC,GAAe;QACzB,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACpF,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAEpC,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEzE,yFAAyF;QACzF,4FAA4F;QAC5F,4FAA4F;QAC5F,8EAA8E;QAC9E,EAAE;QACF,2FAA2F;QAC3F,iFAAiF;QACjF,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,gBAAgB,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,SAAS,KAAK,gBAAgB,CAAC,IAAI,IAAI,CAAC,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAEnL,OAAO;YACL,OAAO,EAAE,OAAO;YAChB,OAAO,EAAE,OAAO;YAChB,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,OAAO,EAAE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC;SACjD,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;OAYG;IACO,KAAK,CAAC,OAAkB;QAChC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1B,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,GAAG,CAAU,OAAO,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAc,EAAE,CAAC;QAE7B,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC7E,IAAI,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAExD,OAAO,MAAM,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;YACtC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,qFAAqF;gBACrF,oFAAoF;gBACpF,kFAAkF;gBAClF,wCAAwC;gBACxC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC;oBAClD,MAAM,KAAK,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBAC3D,MAAM,IAAI,iBAAiB,CAAC,0DAA0D,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,0HAA0H,CAAC,CAAC;gBACpP,CAAC;gBAED,CAAC,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;gBAC3E,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACxE,SAAS;YACX,CAAC;YAED,MAAM,IAAI,GAAG,KAAK,CAAC;YACnB,KAAK,GAAG,EAAE,CAAC;YAEX,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACf,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAEpB,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;oBAChD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC9B,SAAS;oBACX,CAAC;oBAED,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAE,GAAG,CAAC,CAAC;oBACzC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;oBAE7B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;wBACf,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACxB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACO,YAAY,CAAC,OAAkB,EAAE,OAAgC,EAAE,SAAuB;QAClG,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAsB,CAAC;QAEjD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,CAAC;QAED,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtB,SAAS;YACX,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAW,CAAC;YAEhC,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,kBAAkB,EAAE,CAAC;gBACtC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;gBAEtC,IAAI,CAAC,MAAM,IAAI,MAAM,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC1E,SAAS;gBACX,CAAC;gBAED,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACjB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC;gBAEpC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpC,IAAI,IAAI,EAAE,CAAC;oBACT,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACf,CAAC;qBAAM,CAAC;oBACN,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACO,mBAAmB,CAAC,SAAuB,EAAE,OAAgC;QACrF,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAyB,EAAE,CAAC;YAEtC,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,kBAAkB,EAAE,CAAC;gBACtC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;gBACtC,MAAM,MAAM,GAAG,MAAM,KAAK,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC7D,MAAM,eAAe,GAAG,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,CAAC,SAAS,KAAK,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC;gBAEvG,IAAI,MAAM,IAAI,eAAe,EAAE,CAAC;oBAC9B,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC/B,QAAQ,GAAG,IAAI,CAAC;oBAChB,SAAS;gBACX,CAAC;gBAED,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChB,CAAC;YAED,CAAC,CAAC,kBAAkB,GAAG,IAAI,CAAC;QAC9B,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACO,YAAY,CAAC,OAAuB,EAAE,OAAkB;QAChE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACtI,CAAC;CACF"}