@assemora/database 0.1.0

package/dist/memory.js

@@ -0,0 +1,398 @@
+/**
+ * In-memory adapter.
+ *
+ * SPEC.md §109 asks for a memory adapter so the data layer can be built and tested
+ * before PostgreSQL exists. It implements the same contract as any other adapter, so
+ * a query proven here runs unchanged against `@assemora/database-postgres`.
+ *
+ * Development and tests only — nothing here is durable.
+ */
+import { AssemoraError } from '@assemora/core';
+import { pivotAddress } from './join-table.js';
+const compare = (left, right) => {
+    if (left === right)
+        return 0;
+    if (left === null || left === undefined)
+        return -1;
+    if (right === null || right === undefined)
+        return 1;
+    if (left instanceof Date && right instanceof Date)
+        return left.getTime() - right.getTime();
+    if (typeof left === 'number' && typeof right === 'number')
+        return left - right;
+    return String(left).localeCompare(String(right));
+};
+const likeToRegExp = (pattern) => new RegExp(`^${pattern
+    .replace(/[.*+?^${}()|[\]\\]/g, '\\$&')
+    .replace(/%/g, '.*')
+    .replace(/_/g, '.')}$`, 'i');
+const evaluateComparison = (row, condition) => {
+    const actual = row[condition.field];
+    const expected = condition.value;
+    switch (condition.operator) {
+        case '=':
+            return compare(actual, expected) === 0;
+        case '!=':
+            return compare(actual, expected) !== 0;
+        case '>':
+            return compare(actual, expected) > 0;
+        case '>=':
+            return compare(actual, expected) >= 0;
+        case '<':
+            return compare(actual, expected) < 0;
+        case '<=':
+            return compare(actual, expected) <= 0;
+        case 'in':
+            return Array.isArray(expected) && expected.some((item) => compare(actual, item) === 0);
+        case 'not in':
+            return Array.isArray(expected) && !expected.some((item) => compare(actual, item) === 0);
+        case 'like':
+            return typeof actual === 'string' && likeToRegExp(String(expected)).test(actual);
+        case 'between':
+            return (Array.isArray(expected) &&
+                compare(actual, expected[0]) >= 0 &&
+                compare(actual, expected[1]) <= 0);
+        case 'is null':
+            return actual === null || actual === undefined;
+        case 'is not null':
+            return actual !== null && actual !== undefined;
+    }
+};
+const readPath = (value, path) => path.reduce((current, key) => typeof current === 'object' && current !== null
+    ? current[key]
+    : undefined, value);
+/** A fragment is contained when every leaf it names matches the document. */
+const contains = (document, fragment) => {
+    if (fragment === null || typeof fragment !== 'object')
+        return compare(document, fragment) === 0;
+    if (Array.isArray(fragment)) {
+        return (Array.isArray(document) &&
+            fragment.every((item) => document.some((candidate) => contains(candidate, item))));
+    }
+    if (typeof document !== 'object' || document === null)
+        return false;
+    return Object.entries(fragment).every(([key, value]) => contains(document[key], value));
+};
+/**
+ * Structural equality, so a document compares the same way it would in SQL.
+ *
+ * Comparing through `String()` made `['a','b']` equal to the text `a,b` here and to
+ * nothing at all in PostgreSQL — the same Query AST meaning two different things,
+ * which is exactly what SPEC.md §30 exists to prevent.
+ */
+const deepEquals = (left, right) => {
+    if (left === right)
+        return true;
+    if (left === null || right === null || left === undefined || right === undefined)
+        return false;
+    if (typeof left !== 'object' || typeof right !== 'object')
+        return false;
+    if (Array.isArray(left) || Array.isArray(right)) {
+        return (Array.isArray(left) &&
+            Array.isArray(right) &&
+            left.length === right.length &&
+            left.every((item, index) => deepEquals(item, right[index])));
+    }
+    const a = left;
+    const b = right;
+    const keys = Object.keys(a);
+    return keys.length === Object.keys(b).length && keys.every((key) => deepEquals(a[key], b[key]));
+};
+const evaluateJson = (row, condition) => {
+    const document = row[condition.field];
+    if (condition.operator === 'contains')
+        return contains(document, condition.value);
+    const value = readPath(document, condition.path);
+    if (condition.operator === 'like') {
+        return typeof value === 'string' && likeToRegExp(String(condition.value)).test(value);
+    }
+    return deepEquals(value, condition.value);
+};
+const evaluate = (row, condition) => {
+    if (condition.kind === 'group')
+        return matches(row, condition.conditions);
+    if (condition.kind === 'json')
+        return evaluateJson(row, condition);
+    return evaluateComparison(row, condition);
+};
+const matches = (row, conditions) => {
+    let result = true;
+    for (const [index, condition] of conditions.entries()) {
+        const value = evaluate(row, condition);
+        if (index === 0) {
+            result = value;
+        }
+        else {
+            result = condition.combinator === 'or' ? result || value : result && value;
+        }
+    }
+    return result;
+};
+/**
+ * Whether a value can identify a row at all.
+ *
+ * A null key joins to nothing in SQL — `null = null` is unknown — so a row holding one
+ * has no related rows, rather than every row that also holds none.
+ */
+const isKey = (value) => value !== null && value !== undefined;
+/**
+ * The bucket a key falls in.
+ *
+ * Two keys share a bucket exactly when `compare` calls them equal, so relations
+ * matched in one pass through an index match the same rows a comparison per row did.
+ */
+const bucketOf = (value) => value instanceof Date ? String(value.getTime()) : String(value);
+/**
+ * Whether a key value falls in one of the buckets already indexed.
+ *
+ * A `Map` and a `Set` are both asked this, and a value that is no key at all answers
+ * no — otherwise a stored `null` would land in the bucket the text `"null"` occupies.
+ */
+const isOneOf = (buckets, value) => isKey(value) && buckets.has(bucketOf(value));
+const groupByKey = (rows, key) => {
+    const grouped = new Map();
+    for (const row of rows) {
+        const value = row[key];
+        if (!isKey(value))
+            continue;
+        const bucket = bucketOf(value);
+        const existing = grouped.get(bucket);
+        if (existing === undefined)
+            grouped.set(bucket, [row]);
+        else
+            existing.push(row);
+    }
+    return grouped;
+};
+/**
+ * The column on the far table that a join column copies, as the join table declares it.
+ *
+ * Read back off the derived descriptor rather than worked out again here: which column
+ * a pivot points at is decided in one place (`joinTableDescriptor`), and a second
+ * opinion is how a load comes to look where no write ever put a row.
+ */
+const linkedKey = (join, column) => {
+    const link = join.relations.find((relation) => relation.foreignKey === column);
+    if (link === undefined) {
+        throw new AssemoraError('INVALID_JOIN_TABLE', `The join table "${join.name}" declares no foreign key on "${column}"`, { status: 500 });
+    }
+    return link.ownerKey;
+};
+const sort = (rows, order) => order.length === 0
+    ? rows
+    : [...rows].sort((left, right) => {
+        for (const step of order) {
+            const difference = compare(left[step.field], right[step.field]);
+            if (difference !== 0)
+                return step.direction === 'desc' ? -difference : difference;
+        }
+        return 0;
+    });
+export const createMemoryAdapter = (seed = {}) => {
+    const tables = new Map();
+    let scans = 0;
+    for (const [table, rows] of Object.entries(seed)) {
+        tables.set(table, rows.map((row) => ({ ...row })));
+    }
+    const store = (table) => {
+        const existing = tables.get(table);
+        if (existing !== undefined)
+            return existing;
+        const created = [];
+        tables.set(table, created);
+        return created;
+    };
+    /**
+     * One pass over one table, and the only way rows are ever selected.
+     *
+     * Everything that reads goes through here, so `scanCount()` measures what a query
+     * costs: a batched relation load adds a fixed number of passes, and one loaded row
+     * by row adds a pass per row (SPEC.md §89).
+     */
+    const scan = (table, keep) => {
+        scans += 1;
+        return store(table).filter(keep);
+    };
+    const relationOf = (table, name) => {
+        const relation = table.relations.find((candidate) => candidate.name === name);
+        if (relation === undefined) {
+            throw new AssemoraError('UNKNOWN_RELATION', `Table "${table.name}" has no relation "${name}"`, { status: 500 });
+        }
+        return relation;
+    };
+    /**
+     * The rows a `belongsToMany` links, in two passes: one over the join table, one over
+     * the target (SPEC.md §23).
+     *
+     * The join table is derived rather than looked up in `related`: no model declares it,
+     * so nothing registers a descriptor for it, and deriving it from the same function
+     * the DDL and the schema diff use is what makes a load look where a write put the
+     * rows (SPEC.md §24).
+     */
+    const loadThroughJoinTable = (rows, table, relation, load, related) => {
+        const target = related[relation.target];
+        // Which column of the target the join table copies is the target's own business, so
+        // its descriptor has to be to hand. PostgreSQL refuses the same load for the same
+        // reason, and assuming `id` here would make the two adapters disagree quietly.
+        if (target === undefined) {
+            throw new AssemoraError('UNKNOWN_RELATION', `The descriptor for "${relation.target}" was not provided`, { status: 500 });
+        }
+        for (const row of rows)
+            row[relation.name] = [];
+        const owners = groupByKey(rows, relation.ownerKey);
+        const anchor = rows.find((row) => isKey(row[relation.ownerKey]));
+        if (anchor === undefined)
+            return;
+        // One row is enough to learn where the links live: the address is the same for
+        // every row of the table, and only `ownerValue` differs.
+        const pivot = pivotAddress(table, relation, anchor, target);
+        const links = scan(pivot.table.name, (link) => isOneOf(owners, link[pivot.ownerColumn]) && isKey(link[pivot.relatedColumn]));
+        /** Which owners hold each target, which is all a join table has to say. */
+        const heldBy = new Map();
+        for (const link of links) {
+            const ownerBucket = bucketOf(link[pivot.ownerColumn]);
+            const targetBucket = bucketOf(link[pivot.relatedColumn]);
+            const existing = heldBy.get(targetBucket);
+            if (existing === undefined)
+                heldBy.set(targetBucket, [ownerBucket]);
+            // The pair is unique in the table `joinTableDescriptor` describes, and nothing
+            // enforces that here. Counting a duplicate link twice would load the same role
+            // twice where PostgreSQL, holding the constraint, could not have stored it.
+            else if (!existing.includes(ownerBucket))
+                existing.push(ownerBucket);
+        }
+        if (heldBy.size === 0)
+            return;
+        const targetKey = linkedKey(pivot.table, pivot.relatedColumn);
+        const children = scan(relation.target, (candidate) => isOneOf(heldBy, candidate[targetKey]));
+        // A join table has no order of its own, so one has to be chosen or the two
+        // adapters answer with the same rows in different orders and every unit test that
+        // reads `user.roles[0]` proves nothing about production (ADR-0013). The far key is
+        // the column both ends of the link already agree on, and it is what PostgreSQL
+        // orders the join by. Sorted through the same comparator every other order in this
+        // adapter uses, so a pivot load is ordered the way `order` in the AST is.
+        const loaded = sort(loadRelations(children, target, load.nested, related), [
+            { field: targetKey, direction: 'asc' },
+        ]);
+        const collected = new Map();
+        for (const child of loaded) {
+            for (const ownerBucket of heldBy.get(bucketOf(child[targetKey])) ?? []) {
+                const existing = collected.get(ownerBucket);
+                if (existing === undefined)
+                    collected.set(ownerBucket, [child]);
+                else
+                    existing.push(child);
+            }
+        }
+        for (const [ownerBucket, matched] of owners) {
+            const linked = collected.get(ownerBucket) ?? [];
+            for (const row of matched)
+                row[relation.name] = linked;
+        }
+    };
+    /**
+     * Loads relations in batches: one pass per relation, never one per row.
+     *
+     * SPEC.md §89 asks for N+1 to be caught by tests rather than by review, and
+     * `diagnostics.scanCount()` is what those tests read.
+     */
+    const loadRelations = (rows, table, loads, related) => {
+        const enriched = rows.map((row) => ({ ...row }));
+        for (const load of loads) {
+            const relation = relationOf(table, load.relation);
+            if (relation.kind === 'belongsToMany') {
+                loadThroughJoinTable(enriched, table, relation, load, related);
+                continue;
+            }
+            const owned = relation.kind === 'belongsTo';
+            const localKey = owned ? relation.foreignKey : relation.ownerKey;
+            const remoteKey = owned ? relation.ownerKey : relation.foreignKey;
+            const keys = new Set(enriched.filter((row) => isKey(row[localKey])).map((row) => bucketOf(row[localKey])));
+            const target = related[relation.target];
+            const candidates = keys.size === 0
+                ? []
+                : scan(relation.target, (candidate) => isOneOf(keys, candidate[remoteKey]));
+            const loaded = target === undefined
+                ? candidates.map((candidate) => ({ ...candidate }))
+                : loadRelations(candidates, target, load.nested, related);
+            const grouped = groupByKey(loaded, remoteKey);
+            for (const row of enriched) {
+                const value = row[localKey];
+                const matched = (isKey(value) ? grouped.get(bucketOf(value)) : undefined) ?? [];
+                row[relation.name] = relation.kind === 'hasMany' ? matched : (matched[0] ?? null);
+            }
+        }
+        return enriched;
+    };
+    const adapter = {
+        async execute(query, context) {
+            const rows = store(query.model);
+            const related = context.related ?? {};
+            if (query.operation === 'insert') {
+                const inserted = { ...(query.data ?? {}) };
+                rows.push(inserted);
+                return { ...inserted };
+            }
+            const selected = scan(query.model, (row) => matches(row, query.where));
+            if (query.operation === 'count')
+                return selected.length;
+            if (query.operation === 'delete') {
+                for (const row of selected) {
+                    const index = rows.indexOf(row);
+                    if (index >= 0)
+                        rows.splice(index, 1);
+                }
+                return selected.length;
+            }
+            if (query.operation === 'update') {
+                for (const row of selected)
+                    Object.assign(row, query.data ?? {});
+                return selected.length;
+            }
+            const ordered = sort(selected, query.order);
+            const offset = query.offset ?? 0;
+            const limited = query.limit === undefined
+                ? ordered.slice(offset)
+                : ordered.slice(offset, offset + query.limit);
+            const materialised = limited.map((row) => ({ ...row }));
+            return (query.with.length > 0
+                ? loadRelations(materialised, context.table, query.with, related)
+                : materialised);
+        },
+        async transaction(callback) {
+            const snapshot = new Map();
+            for (const [table, rows] of tables)
+                snapshot.set(table, rows.map((row) => ({ ...row })));
+            try {
+                return await callback();
+            }
+            catch (error) {
+                // A failed transaction leaves nothing behind, exactly as a real one would.
+                tables.clear();
+                for (const [table, rows] of snapshot)
+                    tables.set(table, rows);
+                throw error;
+            }
+        },
+        introspect() {
+            return Promise.resolve({ tables: [] });
+        },
+        rows(table) {
+            return store(table).map((row) => ({ ...row }));
+        },
+        seed(table, rows) {
+            tables.set(table, rows.map((row) => ({ ...row })));
+        },
+        reset() {
+            tables.clear();
+        },
+        diagnostics: {
+            scanCount: () => scans,
+            reset: () => {
+                scans = 0;
+            },
+        },
+    };
+    return adapter;
+};
+//# sourceMappingURL=memory.js.map

package/dist/memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.js","sourceRoot":"","sources":["../src/memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AAS9C,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAA;AA+B9C,MAAM,OAAO,GAAG,CAAC,IAAa,EAAE,KAAc,EAAU,EAAE;IACxD,IAAI,IAAI,KAAK,KAAK;QAAE,OAAO,CAAC,CAAA;IAC5B,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC,CAAA;IAClD,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,CAAC,CAAA;IACnD,IAAI,IAAI,YAAY,IAAI,IAAI,KAAK,YAAY,IAAI;QAAE,OAAO,IAAI,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAA;IAC1F,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,GAAG,KAAK,CAAA;IAC9E,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAA;AAClD,CAAC,CAAA;AAED,MAAM,YAAY,GAAG,CAAC,OAAe,EAAU,EAAE,CAC/C,IAAI,MAAM,CACR,IAAI,OAAO;KACR,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC;KACtC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC;KACnB,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,EACxB,GAAG,CACJ,CAAA;AAEH,MAAM,kBAAkB,GAAG,CAAC,GAAQ,EAAE,SAAqB,EAAW,EAAE;IACtE,MAAM,MAAM,GAAG,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;IACnC,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAA;IAEhC,QAAQ,SAAS,CAAC,QAAQ,EAAE,CAAC;QAC3B,KAAK,GAAG;YACN,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;QACxC,KAAK,IAAI;YACP,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;QACxC,KAAK,GAAG;YACN,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAA;QACtC,KAAK,IAAI;YACP,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAA;QACvC,KAAK,GAAG;YACN,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAA;QACtC,KAAK,IAAI;YACP,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAA;QACvC,KAAK,IAAI;YACP,OAAO,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;QACxF,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;QACzF,KAAK,MAAM;YACT,OAAO,OAAO,MAAM,KAAK,QAAQ,IAAI,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAClF,KAAK,SAAS;YACZ,OAAO,CACL,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;gBACvB,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBACjC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAClC,CAAA;QACH,KAAK,SAAS;YACZ,OAAO,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,SAAS,CAAA;QAChD,KAAK,aAAa;YAChB,OAAO,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,SAAS,CAAA;IAClD,CAAC;AACH,CAAC,CAAA;AAED,MAAM,QAAQ,GAAG,CAAC,KAAc,EAAE,IAAuB,EAAW,EAAE,CACpE,IAAI,CAAC,MAAM,CACT,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,CACf,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,IAAI;IAC7C,CAAC,CAAE,OAAmC,CAAC,GAAG,CAAC;IAC3C,CAAC,CAAC,SAAS,EACf,KAAK,CACN,CAAA;AAEH,6EAA6E;AAC7E,MAAM,QAAQ,GAAG,CAAC,QAAiB,EAAE,QAAiB,EAAW,EAAE;IACjE,IAAI,QAAQ,KAAK,IAAI,IAAI,OAAO,QAAQ,KAAK,QAAQ;QAAE,OAAO,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;IAE/F,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC5B,OAAO,CACL,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;YACvB,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAClF,CAAA;IACH,CAAC;IAED,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,KAAK,CAAA;IAEnE,OAAO,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CACrD,QAAQ,CAAE,QAAoC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAC5D,CAAA;AACH,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,UAAU,GAAG,CAAC,IAAa,EAAE,KAAc,EAAW,EAAE;IAC5D,IAAI,IAAI,KAAK,KAAK;QAAE,OAAO,IAAI,CAAA;IAC/B,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAA;IAC9F,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAA;IAEvE,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAChD,OAAO,CACL,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YACnB,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACpB,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;YAC5B,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAC5D,CAAA;IACH,CAAC;IAED,MAAM,CAAC,GAAG,IAA+B,CAAA;IACzC,MAAM,CAAC,GAAG,KAAgC,CAAA;IAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAE3B,OAAO,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;AACjG,CAAC,CAAA;AAED,MAAM,YAAY,GAAG,CAAC,GAAQ,EAAE,SAAyB,EAAW,EAAE;IACpE,MAAM,QAAQ,GAAG,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;IAErC,IAAI,SAAS,CAAC,QAAQ,KAAK,UAAU;QAAE,OAAO,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,KAAK,CAAC,CAAA;IAEjF,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,CAAA;IAEhD,IAAI,SAAS,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;QAClC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,YAAY,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACvF,CAAC;IAED,OAAO,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC,CAAA;AAC3C,CAAC,CAAA;AAED,MAAM,QAAQ,GAAG,CAAC,GAAQ,EAAE,SAAoB,EAAW,EAAE;IAC3D,IAAI,SAAS,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,OAAO,CAAC,GAAG,EAAE,SAAS,CAAC,UAAU,CAAC,CAAA;IACzE,IAAI,SAAS,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,YAAY,CAAC,GAAG,EAAE,SAAS,CAAC,CAAA;IAElE,OAAO,kBAAkB,CAAC,GAAG,EAAE,SAAS,CAAC,CAAA;AAC3C,CAAC,CAAA;AAED,MAAM,OAAO,GAAG,CAAC,GAAQ,EAAE,UAAgC,EAAW,EAAE;IACtE,IAAI,MAAM,GAAG,IAAI,CAAA;IAEjB,KAAK,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;QACtD,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC,CAAA;QACtC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAChB,MAAM,GAAG,KAAK,CAAA;QAChB,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,SAAS,CAAC,UAAU,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,MAAM,IAAI,KAAK,CAAA;QAC5E,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,KAAK,GAAG,CAAC,KAAc,EAAW,EAAE,CAAC,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,CAAA;AAEhF;;;;;GAKG;AACH,MAAM,QAAQ,GAAG,CAAC,KAAc,EAAU,EAAE,CAC1C,KAAK,YAAY,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;AAEjE;;;;;GAKG;AACH,MAAM,OAAO,GAAG,CAAC,OAAyC,EAAE,KAAc,EAAW,EAAE,CACrF,KAAK,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAA;AAE9C,MAAM,UAAU,GAAG,CAAC,IAAoB,EAAE,GAAW,EAAsB,EAAE;IAC3E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiB,CAAA;IAExC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;QACtB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;YAAE,SAAQ;QAE3B,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;QAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAEpC,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;;YACjD,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACzB,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,SAAS,GAAG,CAAC,IAAqB,EAAE,MAAc,EAAU,EAAE;IAClE,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,UAAU,KAAK,MAAM,CAAC,CAAA;IAE9E,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,MAAM,IAAI,aAAa,CACrB,oBAAoB,EACpB,mBAAmB,IAAI,CAAC,IAAI,iCAAiC,MAAM,GAAG,EACtE,EAAE,MAAM,EAAE,GAAG,EAAE,CAChB,CAAA;IACH,CAAC;IAED,OAAO,IAAI,CAAC,QAAQ,CAAA;AACtB,CAAC,CAAA;AAED,MAAM,IAAI,GAAG,CAAC,IAAW,EAAE,KAAuB,EAAS,EAAE,CAC3D,KAAK,CAAC,MAAM,KAAK,CAAC;IAChB,CAAC,CAAC,IAAI;IACN,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;YAC/D,IAAI,UAAU,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAA;QACnF,CAAC;QACD,OAAO,CAAC,CAAA;IACV,CAAC,CAAC,CAAA;AAER,MAAM,CAAC,MAAM,mBAAmB,GAAG,CACjC,IAAI,GAA6C,EAAE,EACpC,EAAE;IACjB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiB,CAAA;IACvC,IAAI,KAAK,GAAG,CAAC,CAAA;IAEb,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACjD,MAAM,CAAC,GAAG,CACR,KAAK,EACL,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAChC,CAAA;IACH,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,KAAa,EAAS,EAAE;QACrC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QAClC,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAA;QAE3C,MAAM,OAAO,GAAU,EAAE,CAAA;QACzB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;QAC1B,OAAO,OAAO,CAAA;IAChB,CAAC,CAAA;IAED;;;;;;OAMG;IACH,MAAM,IAAI,GAAG,CAAC,KAAa,EAAE,IAA2B,EAAS,EAAE;QACjE,KAAK,IAAI,CAAC,CAAA;QAEV,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAClC,CAAC,CAAA;IAED,MAAM,UAAU,GAAG,CAAC,KAAsB,EAAE,IAAY,EAAsB,EAAE;QAC9E,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA;QAE7E,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,IAAI,aAAa,CACrB,kBAAkB,EAClB,UAAU,KAAK,CAAC,IAAI,sBAAsB,IAAI,GAAG,EACjD,EAAE,MAAM,EAAE,GAAG,EAAE,CAChB,CAAA;QACH,CAAC;QAED,OAAO,QAAQ,CAAA;IACjB,CAAC,CAAA;IAED;;;;;;;;OAQG;IACH,MAAM,oBAAoB,GAAG,CAC3B,IAAoB,EACpB,KAAsB,EACtB,QAA4B,EAC5B,IAAkB,EAClB,OAAkD,EAC5C,EAAE;QACR,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;QAEvC,oFAAoF;QACpF,kFAAkF;QAClF,+EAA+E;QAC/E,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,aAAa,CACrB,kBAAkB,EAClB,uBAAuB,QAAQ,CAAC,MAAM,oBAAoB,EAC1D,EAAE,MAAM,EAAE,GAAG,EAAE,CAChB,CAAA;QACH,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,IAAI;YAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;QAE/C,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAA;QAClD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;QAEhE,IAAI,MAAM,KAAK,SAAS;YAAE,OAAM;QAEhC,+EAA+E;QAC/E,yDAAyD;QACzD,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;QAE3D,MAAM,KAAK,GAAG,IAAI,CAChB,KAAK,CAAC,KAAK,CAAC,IAAI,EAChB,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CACvF,CAAA;QAED,2EAA2E;QAC3E,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAA;QAE1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAA;YACrD,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAA;YACxD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAA;YAEzC,IAAI,QAAQ,KAAK,SAAS;gBAAE,MAAM,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,WAAW,CAAC,CAAC,CAAA;YACnE,+EAA+E;YAC/E,+EAA+E;YAC/E,4EAA4E;iBACvE,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC;gBAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;QACtE,CAAC;QAED,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;YAAE,OAAM;QAE7B,MAAM,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,aAAa,CAAC,CAAA;QAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QAC5F,2EAA2E;QAC3E,kFAAkF;QAClF,mFAAmF;QACnF,+EAA+E;QAC/E,mFAAmF;QACnF,0EAA0E;QAC1E,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE;YACzE,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE;SACvC,CAAC,CAAA;QACF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAiB,CAAA;QAE1C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;gBACvE,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;gBAE3C,IAAI,QAAQ,KAAK,SAAS;oBAAE,SAAS,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;;oBAC1D,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC3B,CAAC;QACH,CAAC;QAED,KAAK,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,IAAI,MAAM,EAAE,CAAC;YAC5C,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAA;YAC/C,KAAK,MAAM,GAAG,IAAI,OAAO;gBAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,MAAM,CAAA;QACxD,CAAC;IACH,CAAC,CAAA;IAED;;;;;OAKG;IACH,MAAM,aAAa,GAAG,CACpB,IAAoB,EACpB,KAAsB,EACtB,KAA8B,EAC9B,OAAkD,EAC3C,EAAE;QACT,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAA;QAEhD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;YAEjD,IAAI,QAAQ,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;gBACtC,oBAAoB,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;gBAC9D,SAAQ;YACV,CAAC;YAED,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,KAAK,WAAW,CAAA;YAC3C,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAA;YAChE,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAA;YAEjE,MAAM,IAAI,GAAG,IAAI,GAAG,CAClB,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CACrF,CAAA;YACD,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;YAEvC,MAAM,UAAU,GACd,IAAI,CAAC,IAAI,KAAK,CAAC;gBACb,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;YAE/E,MAAM,MAAM,GACV,MAAM,KAAK,SAAS;gBAClB,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,SAAS,EAAE,CAAC,CAAC;gBACnD,CAAC,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;YAE7D,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;YAE7C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAA;gBAC3B,MAAM,OAAO,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,CAAA;gBAE/E,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAA;YACnF,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAA;IACjB,CAAC,CAAA;IAED,MAAM,OAAO,GAAkB;QAC7B,KAAK,CAAC,OAAO,CAAI,KAAe,EAAE,OAAwB;YACxD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;YAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,EAAE,CAAA;YAErC,IAAI,KAAK,CAAC,SAAS,KAAK,QAAQ,EAAE,CAAC;gBACjC,MAAM,QAAQ,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,CAAA;gBAC1C,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;gBACnB,OAAO,EAAE,GAAG,QAAQ,EAAO,CAAA;YAC7B,CAAC;YAED,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAA;YAEtE,IAAI,KAAK,CAAC,SAAS,KAAK,OAAO;gBAAE,OAAO,QAAQ,CAAC,MAAW,CAAA;YAE5D,IAAI,KAAK,CAAC,SAAS,KAAK,QAAQ,EAAE,CAAC;gBACjC,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;oBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;oBAC/B,IAAI,KAAK,IAAI,CAAC;wBAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;gBACvC,CAAC;gBACD,OAAO,QAAQ,CAAC,MAAW,CAAA;YAC7B,CAAC;YAED,IAAI,KAAK,CAAC,SAAS,KAAK,QAAQ,EAAE,CAAC;gBACjC,KAAK,MAAM,GAAG,IAAI,QAAQ;oBAAE,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAA;gBAChE,OAAO,QAAQ,CAAC,MAAW,CAAA;YAC7B,CAAC;YAED,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;YAC3C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,CAAA;YAChC,MAAM,OAAO,GACX,KAAK,CAAC,KAAK,KAAK,SAAS;gBACvB,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC;gBACvB,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;YAEjD,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAA;YAEvD,OAAO,CACL,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;gBACnB,CAAC,CAAC,aAAa,CAAC,YAAY,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC;gBACjE,CAAC,CAAC,YAAY,CACZ,CAAA;QACR,CAAC;QAED,KAAK,CAAC,WAAW,CAAI,QAA0B;YAC7C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiB,CAAA;YACzC,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,MAAM;gBAChC,QAAQ,CAAC,GAAG,CACV,KAAK,EACL,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAChC,CAAA;YAEH,IAAI,CAAC;gBACH,OAAO,MAAM,QAAQ,EAAE,CAAA;YACzB,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,2EAA2E;gBAC3E,MAAM,CAAC,KAAK,EAAE,CAAA;gBACd,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,QAAQ;oBAAE,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;gBAC7D,MAAM,KAAK,CAAA;YACb,CAAC;QACH,CAAC;QAED,UAAU;YACR,OAAO,OAAO,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAA;QACxC,CAAC;QAED,IAAI,CAAC,KAAK;YACR,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAA;QAChD,CAAC;QAED,IAAI,CAAC,KAAK,EAAE,IAAI;YACd,MAAM,CAAC,GAAG,CACR,KAAK,EACL,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAChC,CAAA;QACH,CAAC;QAED,KAAK;YACH,MAAM,CAAC,KAAK,EAAE,CAAA;QAChB,CAAC;QAED,WAAW,EAAE;YACX,SAAS,EAAE,GAAG,EAAE,CAAC,KAAK;YACtB,KAAK,EAAE,GAAG,EAAE;gBACV,KAAK,GAAG,CAAC,CAAA;YACX,CAAC;SACF;KACF,CAAA;IAED,OAAO,OAAO,CAAA;AAChB,CAAC,CAAA"}

package/dist/query-ast.d.ts

@@ -0,0 +1,79 @@
+/**
+ * Query AST (SPEC.md §30).
+ *
+ * The query builder never constructs adapter queries directly; it produces this
+ * neutral description instead. That keeps one stable contract between Assemora Data,
+ * database adapters, the policy layer and the AI query layer — and it is why an
+ * agent expresses a selection as structure rather than as SQL (SPEC.md §85).
+ */
+export type ComparisonOperator = '=' | '!=' | '>' | '>=' | '<' | '<=' | 'in' | 'not in'
+/** Case-insensitive, in every adapter: it exists to serve search. */
+ | 'like' | 'between' | 'is null' | 'is not null';
+export type Combinator = 'and' | 'or';
+export type Comparison = {
+    readonly kind: 'comparison';
+    readonly combinator: Combinator;
+    readonly field: string;
+    readonly operator: ComparisonOperator;
+    readonly value?: unknown;
+};
+/** A parenthesised set of conditions, produced by `where(q => ...)`. */
+export type ConditionGroup = {
+    readonly kind: 'group';
+    readonly combinator: Combinator;
+    readonly conditions: readonly Condition[];
+};
+/**
+ * A condition on a JSON document (SPEC.md §38).
+ *
+ * `path` addresses a key inside the document; an empty path means the document
+ * itself. `contains` asks whether the document includes the given fragment.
+ */
+export type JsonComparison = {
+    readonly kind: 'json';
+    readonly combinator: Combinator;
+    readonly field: string;
+    readonly path: readonly string[];
+    readonly operator: 'equals' | 'contains' | 'like';
+    readonly value: unknown;
+};
+export type Condition = Comparison | ConditionGroup | JsonComparison;
+export type SortDirection = 'asc' | 'desc';
+export type Order = {
+    readonly field: string;
+    readonly direction: SortDirection;
+};
+/**
+ * A relation to load alongside the row, addressed by its declared name.
+ *
+ * A load carries no order of its own — `order` above sorts the rows the query
+ * selects, not the rows hanging off them. One exception is stated rather than left to
+ * the adapter: a `belongsToMany` arrives ordered by the *target's* key, ascending.
+ * A join table has no natural order, so without a rule the two adapters answer with
+ * the same rows in different orders and a unit test that reads `user.roles[0]` passes
+ * against the memory adapter and is wrong against PostgreSQL (ADR-0013).
+ */
+export type RelationLoad = {
+    readonly relation: string;
+    readonly nested: readonly RelationLoad[];
+};
+export type QueryOperation = 'select' | 'insert' | 'update' | 'delete' | 'count';
+export type QueryAst = {
+    readonly model: string;
+    readonly operation: QueryOperation;
+    readonly where: readonly Condition[];
+    readonly order: readonly Order[];
+    readonly with: readonly RelationLoad[];
+    readonly limit?: number;
+    readonly offset?: number;
+    /** Values for an insert or an update. */
+    readonly data?: Readonly<Record<string, unknown>>;
+};
+export declare const emptyQuery: (model: string, operation?: QueryOperation) => QueryAst;
+export declare const comparison: (field: string, operator: ComparisonOperator, value?: unknown) => Comparison;
+export declare const orComparison: (field: string, operator: ComparisonOperator, value?: unknown) => Comparison;
+export declare const jsonEquals: (field: string, path: readonly string[], value: unknown, combinator?: Combinator) => JsonComparison;
+export declare const jsonLike: (field: string, path: readonly string[], pattern: string, combinator?: Combinator) => JsonComparison;
+export declare const jsonContains: (field: string, value: unknown, combinator?: Combinator) => JsonComparison;
+export declare const group: (conditions: readonly Condition[], combinator?: Combinator) => ConditionGroup;
+//# sourceMappingURL=query-ast.d.ts.map

package/dist/query-ast.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-ast.d.ts","sourceRoot":"","sources":["../src/query-ast.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,MAAM,MAAM,kBAAkB,GAC1B,GAAG,GACH,IAAI,GACJ,GAAG,GACH,IAAI,GACJ,GAAG,GACH,IAAI,GACJ,IAAI,GACJ,QAAQ;AACV,qEAAqE;GACnE,MAAM,GACN,SAAS,GACT,SAAS,GACT,aAAa,CAAA;AAEjB,MAAM,MAAM,UAAU,GAAG,KAAK,GAAG,IAAI,CAAA;AAErC,MAAM,MAAM,UAAU,GAAG;IACvB,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAA;IAC3B,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAA;IAC/B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,QAAQ,EAAE,kBAAkB,CAAA;IACrC,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAA;CACzB,CAAA;AAED,wEAAwE;AACxE,MAAM,MAAM,cAAc,GAAG;IAC3B,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAA;IAC/B,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAA;CAC1C,CAAA;AAED;;;;;GAKG;AACH,MAAM,MAAM,cAAc,GAAG;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAA;IAC/B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAA;IAChC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,UAAU,GAAG,MAAM,CAAA;IACjD,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CACxB,CAAA;AAED,MAAM,MAAM,SAAS,GAAG,UAAU,GAAG,cAAc,GAAG,cAAc,CAAA;AAEpE,MAAM,MAAM,aAAa,GAAG,KAAK,GAAG,MAAM,CAAA;AAE1C,MAAM,MAAM,KAAK,GAAG;IAClB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAA;CAClC,CAAA;AAED;;;;;;;;;GASG;AACH,MAAM,MAAM,YAAY,GAAG;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,MAAM,EAAE,SAAS,YAAY,EAAE,CAAA;CACzC,CAAA;AAED,MAAM,MAAM,cAAc,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,CAAA;AAEhF,MAAM,MAAM,QAAQ,GAAG;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,SAAS,EAAE,cAAc,CAAA;IAClC,QAAQ,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,CAAA;IACpC,QAAQ,CAAC,KAAK,EAAE,SAAS,KAAK,EAAE,CAAA;IAChC,QAAQ,CAAC,IAAI,EAAE,SAAS,YAAY,EAAE,CAAA;IACtC,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAA;IACxB,yCAAyC;IACzC,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;CAClD,CAAA;AAED,eAAO,MAAM,UAAU,UAAW,MAAM,cAAa,cAAc,KAAc,QAM/E,CAAA;AAeF,eAAO,MAAM,UAAU,UACd,MAAM,YACH,kBAAkB,UACpB,OAAO,KACd,UAAoD,CAAA;AAEvD,eAAO,MAAM,YAAY,UAChB,MAAM,YACH,kBAAkB,UACpB,OAAO,KACd,UAAmD,CAAA;AAEtD,eAAO,MAAM,UAAU,UACd,MAAM,QACP,SAAS,MAAM,EAAE,SAChB,OAAO,eACF,UAAU,KACrB,cAAwF,CAAA;AAE3F,eAAO,MAAM,QAAQ,UACZ,MAAM,QACP,SAAS,MAAM,EAAE,WACd,MAAM,eACH,UAAU,KACrB,cAA+F,CAAA;AAElG,eAAO,MAAM,YAAY,UAChB,MAAM,SACN,OAAO,eACF,UAAU,KACrB,cAA8F,CAAA;AAEjG,eAAO,MAAM,KAAK,eACJ,SAAS,SAAS,EAAE,eACpB,UAAU,KACrB,cAA6D,CAAA"}

package/dist/query-ast.js

@@ -0,0 +1,29 @@
+/**
+ * Query AST (SPEC.md §30).
+ *
+ * The query builder never constructs adapter queries directly; it produces this
+ * neutral description instead. That keeps one stable contract between Assemora Data,
+ * database adapters, the policy layer and the AI query layer — and it is why an
+ * agent expresses a selection as structure rather than as SQL (SPEC.md §85).
+ */
+export const emptyQuery = (model, operation = 'select') => ({
+    model,
+    operation,
+    where: [],
+    order: [],
+    with: [],
+});
+const compare = (combinator, field, operator, value) => ({
+    kind: 'comparison',
+    combinator,
+    field,
+    operator,
+    ...(value === undefined ? {} : { value }),
+});
+export const comparison = (field, operator, value) => compare('and', field, operator, value);
+export const orComparison = (field, operator, value) => compare('or', field, operator, value);
+export const jsonEquals = (field, path, value, combinator = 'and') => ({ kind: 'json', combinator, field, path, operator: 'equals', value });
+export const jsonLike = (field, path, pattern, combinator = 'and') => ({ kind: 'json', combinator, field, path, operator: 'like', value: pattern });
+export const jsonContains = (field, value, combinator = 'and') => ({ kind: 'json', combinator, field, path: [], operator: 'contains', value });
+export const group = (conditions, combinator = 'and') => ({ kind: 'group', combinator, conditions });
+//# sourceMappingURL=query-ast.js.map

package/dist/query-ast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-ast.js","sourceRoot":"","sources":["../src/query-ast.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAuFH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAa,EAAE,SAAS,GAAmB,QAAQ,EAAY,EAAE,CAAC,CAAC;IAC5F,KAAK;IACL,SAAS;IACT,KAAK,EAAE,EAAE;IACT,KAAK,EAAE,EAAE;IACT,IAAI,EAAE,EAAE;CACT,CAAC,CAAA;AAEF,MAAM,OAAO,GAAG,CACd,UAAsB,EACtB,KAAa,EACb,QAA4B,EAC5B,KAAe,EACH,EAAE,CAAC,CAAC;IAChB,IAAI,EAAE,YAAY;IAClB,UAAU;IACV,KAAK;IACL,QAAQ;IACR,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC;CAC1C,CAAC,CAAA;AAEF,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,KAAa,EACb,QAA4B,EAC5B,KAAe,EACH,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;AAEvD,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,KAAa,EACb,QAA4B,EAC5B,KAAe,EACH,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;AAEtD,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,KAAa,EACb,IAAuB,EACvB,KAAc,EACd,UAAU,GAAe,KAAK,EACd,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAA;AAE3F,MAAM,CAAC,MAAM,QAAQ,GAAG,CACtB,KAAa,EACb,IAAuB,EACvB,OAAe,EACf,UAAU,GAAe,KAAK,EACd,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAA;AAElG,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,KAAa,EACb,KAAc,EACd,UAAU,GAAe,KAAK,EACd,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAA;AAEjG,MAAM,CAAC,MAAM,KAAK,GAAG,CACnB,UAAgC,EAChC,UAAU,GAAe,KAAK,EACd,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC,CAAA"}