@powersync/service-sync-rules 0.29.10 → 0.31.0

package/dist/compiler/querier_graph.js

@@ -0,0 +1,365 @@
+import { EvaluateTableValuedFunction, IntersectionParameterValue, LookupResultParameterValue, ParameterLookup, RequestParameterValue, ResolveBucket, StreamResolver } from './bucket_resolver.js';
+import { equalsIgnoringResultSet } from './compatibility.js';
+import { EqualsClause, RequestExpression, RowExpression, SingleDependencyExpression } from './filter.js';
+import { PartitionKey, PointLookup, RowEvaluator } from './rows.js';
+import { PhysicalSourceResultSet } from './table.js';
+import { HashMap, HashSet, StableHasher } from './equality.js';
+/**
+ * Builds stream resolvers for a single stream, potentially consisting of multiple queries.
+ */
+export class QuerierGraphBuilder {
+    compiler;
+    options;
+    resolvers = [];
+    counter;
+    constructor(compiler, options) {
+        this.compiler = compiler;
+        this.options = options;
+        this.counter = new UniqueCounter();
+    }
+    /**
+     * Adds a given query to the stream compiled by this builder.
+     */
+    process(query, errors) {
+        for (const variant of query.where.terms) {
+            const resolved = new PendingQuerierPath(this, query, errors, variant).resolvePrimaryInput();
+            this.resolvers.push(resolved);
+        }
+    }
+    /**
+     * Merges created stream resolvers and adds them to the compiler.
+     */
+    finish() {
+        this.compiler.output.resolvers.push(...this.mergeBuckets());
+    }
+    /**
+     * Merges bucket definitions from multiple queries if they're compatible.
+     *
+     * As an example, consider a stream defined with two queries:
+     *
+     *  - `SELECT * FROM settings WHERE user_id = auth.user_id()`
+     *  - `SELECT * FROM notes WHERE user_id = auth.user_id()`
+     *
+     * While the two queries select from different source rows (meaning that their {@link RowEvaluator}s are distinct),
+     * they also don't really need independent buckets.
+     *
+     * This method merges two stream resolvers if they have {@link ResolveBucket} steps with the same instantiation (as
+     * in, the same stream subscription + connection is guaranteed to evaluate to the same parameters).
+     */
+    mergeBuckets() {
+        const resolvers = new HashSet({
+            equals: (a, b) => a.hasIdenticalInstantiation(b),
+            hash: (hasher, value) => value.buildInstantiationHash(hasher)
+        });
+        for (const sourceResolver of this.resolvers) {
+            const [existing, didInsert] = resolvers.getOrInsert(sourceResolver);
+            if (!didInsert) {
+                for (const newEvaluator of sourceResolver.resolvedBucket.evaluators) {
+                    existing.resolvedBucket.evaluators.add(newEvaluator);
+                }
+            }
+        }
+        return [...resolvers];
+    }
+}
+/**
+ * Splits a logical conjunction ({@link And}) to create source row processors and parameter lookups.
+ *
+ * This works by first processing subterms related to the source set selected from. If the subterm is a row expression,
+ * we add it as a filter to the row processor or parameter lookup. If it is a match expression, we create a partition
+ * key and obtain the value by recursively applying this algorithm to resolve the other side.
+ *
+ * To visualize this algorithm, consider the following example query:
+ *
+ * ```SQL
+ * SELECT * FROM comments c, issues i, users u
+ *  WHERE u.user_id = auth.user_id() AND c.issue_id = i.id AND u.id = i.owner_id AND u.is_admin
+ * ```
+ *
+ * First, {@link resolvePrimaryInput} is called, which calls {@link resolveResultSet} on `comments c`. While resolving a
+ * result set, we extract conditions mentioning that result set. In this case, the only such expression is
+ * `c.issue_id = i.id`. Because this is an {@link EqualsClause}, we know we need to introduce a parameter (in this case,
+ * `c.issue_id` because that's the half depending on the current result set). We then look at the other half and
+ * recursively resolve `issues i` (via {@link resolvePointLookup}). When we're done resolving that, we add `i.id` as to
+ * {@link PendingExpandingLookup.usedOutputs}.
+ *
+ * To resolve `issues i`, we extract the only remaining expression mentioning it, `u.id = i.owner_id`. We once again
+ * recursve to resolve `users u` and will add `u.id` as a used output.
+ *
+ * Finally, we find `u.user_id = auth.user_id()` and `u.is_admin`. The first expression creates a parameter, but doesn't
+ * need to resolve any further result sets since the input depends on connection data. The second expression only
+ * depends on the row itself, so we add it as a static condition to only create parameter lookups for rows matching that
+ * condition.
+ *
+ * This algorithm gives us the bucket creator as well as parameter lookups with their partition keys and values, which
+ * is the sync plan.
+ */
+class PendingQuerierPath {
+    builder;
+    query;
+    errors;
+    // Terms in the And that have not yet been handled.
+    pendingFactors = [];
+    pendingLookups = new Map();
+    /**
+     * A stack of result sets currently being analyzed.
+     *
+     * This is used to guard against circular references, although those should never happen.
+     */
+    resolveStack = [];
+    pendingStage = { lookups: [] };
+    constructor(builder, query, errors, condition) {
+        this.builder = builder;
+        this.query = query;
+        this.errors = errors;
+        this.pendingFactors.push(...condition.terms);
+    }
+    resolvePrimaryInput() {
+        const state = this.resolveResultSet(this.query.sourceTable);
+        const [partitions, partitionValues] = state.resolvePartitions();
+        const evaluator = this.builder.compiler.output.canonicalizeEvaluator(new RowEvaluator({
+            columns: this.query.resultColumns,
+            syntacticSource: this.query.sourceTable,
+            filters: state.filters,
+            partitionBy: partitions
+        }));
+        this.processExistsOperators();
+        // Resolving a result set removes its conditions from pendingFactors, so remaining conditions must be related to the
+        // request (e.g. where `auth.parameter('is_admin')`).
+        const requestConditions = [];
+        for (const remaining of this.pendingFactors) {
+            if (remaining instanceof SingleDependencyExpression) {
+                if (remaining.resultSet != null) {
+                    this.errors.report('This filter is unrelated to the request or the table being synced, and not supported.', remaining.expression.location);
+                }
+                else {
+                    requestConditions.push(new RequestExpression(remaining));
+                }
+            }
+            else {
+                this.errors.report('Unable to associate this filter with added tables', remaining.location);
+            }
+        }
+        return new StreamResolver(this.builder.options, requestConditions, this.materializeLookupStages(), new ResolveBucket(evaluator, partitionValues), this.builder.counter.use(this.builder.options.name));
+    }
+    pushStage() {
+        const childStage = this.pendingStage;
+        this.pendingStage = childStage.parent ??= { lookups: [] };
+        return childStage;
+    }
+    popStage(stage) {
+        this.pendingStage = stage;
+    }
+    resolvePointLookup(resultSet) {
+        const resolved = this.resolveResultSet(resultSet);
+        const [partitionKeys, partitionInputs] = resolved.resolvePartitions();
+        return new PendingExpandingLookup({
+            type: 'point',
+            pattern: resultSet,
+            filters: resolved.filters,
+            partitionKeys: partitionKeys,
+            inputs: partitionInputs
+        });
+    }
+    resolveTableValuedLookup(resultSet) {
+        const resolved = this.resolveResultSet(resultSet);
+        if (!resolved.partition.isEmpty) {
+            // At the moment, inputs to a table-valued functions must be static or only depend on the request. We may lift
+            // this restriction in the future.
+            this.errors.report('Table-valued result sets cannot be partitioned', resultSet.source.origin);
+        }
+        return new PendingExpandingLookup({ type: 'table_valued', resultSet, filters: resolved.filters });
+    }
+    resolveExpandingLookup(resultSet) {
+        const existing = this.pendingLookups.get(resultSet);
+        if (existing != null) {
+            return existing;
+        }
+        // Something depends on this lookup when resolveExpandingLookup is called, so we have to push this into a new stage
+        // to ensure we have results before the current stage.
+        const childStage = this.pushStage();
+        const resolved = resultSet instanceof PhysicalSourceResultSet
+            ? this.resolvePointLookup(resultSet)
+            : this.resolveTableValuedLookup(resultSet);
+        this.pendingLookups.set(resultSet, resolved);
+        this.pendingStage.lookups.push(resolved);
+        this.popStage(childStage);
+        return resolved;
+    }
+    /**
+     * Extracts filters, partition keys and partition instantiations for a given source result set.
+     */
+    resolveResultSet(source) {
+        if (this.resolveStack.indexOf(source) != -1) {
+            throw new Error('internal error: circular reference when resolving result set');
+        }
+        this.resolveStack.push(source);
+        const state = new ResolvedResultSet();
+        for (const expression of [...this.pendingFactors]) {
+            if (expression instanceof SingleDependencyExpression) {
+                if (expression.resultSet === source) {
+                    // This expression only depends on the table, so we add it as a filter for the row or parameter evaluator.
+                    state.filters.push(new RowExpression(expression));
+                    this.removePendingExpression(expression);
+                }
+            }
+            else {
+                // Must be a match term.
+                const partitionBy = (thisRow, otherRow) => {
+                    this.removePendingExpression(expression);
+                    const key = new PartitionKey(new RowExpression(thisRow));
+                    const values = state.partition.putIfAbsent(key, () => []);
+                    if (otherRow.resultSet != null) {
+                        const lookup = this.resolveExpandingLookup(otherRow.resultSet);
+                        const index = lookup.addOutput(new RowExpression(otherRow));
+                        const value = new LookupResultParameterValue(index);
+                        lookup.dependents.push(value);
+                        values.push(value);
+                    }
+                    else {
+                        // Other row doesn't depend on a source row, so we can read the value out of the connection.
+                        values.push(new RequestParameterValue(otherRow));
+                    }
+                };
+                if (expression.left.resultSet === source) {
+                    partitionBy(expression.left, expression.right);
+                }
+                else if (expression.right.resultSet === source) {
+                    partitionBy(expression.right, expression.left);
+                }
+                else {
+                    // Unrelated match clause.
+                    continue;
+                }
+            }
+        }
+        const popped = this.resolveStack.pop();
+        if (popped !== source) {
+            throw new Error('internal error: resolve stack broken');
+        }
+        return state;
+    }
+    /**
+     * Handles `EXIST`-like subquery operators.
+     *
+     * Consider a filter like `WHERE auth.user_id() IN (SELECT id FROM users WHERE is_admin)`. This gets represented as an
+     * {@link EqualsClause}, but it doesn't introduce any bucket parameters.
+     *
+     * We handle these in a special way: The `auth.user_id()` equality is pushed into the subquery, effectively resulting
+     * in `WHERE EXISTS (SELECT id FROM users WHERE is_admin AND id = auth.user_id())`. This is implemented by pushing a
+     * parameter lookup that is never used, but still evaluated to skip connections where it doesn't match.
+     */
+    processExistsOperators() {
+        for (const expression of [...this.pendingFactors]) {
+            if (expression instanceof EqualsClause) {
+                const process = (connection, other) => {
+                    if (other.resultSet != null) {
+                        // We just need to add the lookup to implement EXISTS semantics, it will never be used anywhere.
+                        this.resolveExpandingLookup(other.resultSet);
+                    }
+                };
+                if (expression.left.dependsOnConnection) {
+                    process(expression.left, expression.right);
+                }
+                else if (expression.right.dependsOnConnection) {
+                    process(expression.right, expression.left);
+                }
+            }
+        }
+    }
+    removePendingExpression(removed) {
+        const index = this.pendingFactors.indexOf(removed);
+        this.pendingFactors.splice(index, 1);
+    }
+    materializeLookupStages() {
+        const targets = [];
+        this.materializeLookupStage(this.pendingStage, targets);
+        return targets;
+    }
+    materializeLookupStage(stage, target) {
+        if (stage.parent != null) {
+            this.materializeLookupStage(stage.parent, target);
+        }
+        if (stage.lookups.length != 0) {
+            const lookups = [];
+            target.push(lookups);
+            for (const lookup of stage.lookups) {
+                const data = lookup.data;
+                let lookupWithInputs;
+                if (data.type == 'point') {
+                    const canonicalized = this.builder.compiler.output.canonicalizePointLookup(new PointLookup({
+                        syntacticSource: data.pattern,
+                        filters: data.filters,
+                        partitionBy: data.partitionKeys,
+                        result: lookup.usedOutputs
+                    }));
+                    lookupWithInputs = new ParameterLookup(canonicalized, data.inputs);
+                }
+                else {
+                    lookupWithInputs = new EvaluateTableValuedFunction(data.resultSet, lookup.usedOutputs, data.filters);
+                }
+                lookups.push(lookupWithInputs);
+                for (const usage of lookup.dependents) {
+                    usage.lookup = lookupWithInputs;
+                }
+            }
+        }
+    }
+}
+class ResolvedResultSet {
+    filters = [];
+    partition = new HashMap(equalsIgnoringResultSet);
+    resolvePartitions() {
+        const entries = [];
+        for (const [key, values] of this.partition.entries) {
+            if (values.length == 1) {
+                entries.push([key, values[0]]);
+            }
+            else {
+                entries.push([key, new IntersectionParameterValue(values)]);
+            }
+        }
+        // The order of partition keys is arbitrary (and typically depends on their order in syntax). Semantically though,
+        // partition keys should be unordered: Instantiating a bucket is a `Map<Parameter, Value>` that just happens to be
+        // encoded as `Value[]` since parameters are known from context.
+        // To make it easier to merge buckets, we sort parameters by some stable hash.
+        entries.sort((a, b) => StableHasher.hashWith(equalsIgnoringResultSet, a[0]) - StableHasher.hashWith(equalsIgnoringResultSet, b[0]));
+        const keys = [];
+        const values = [];
+        for (const [key, value] of entries) {
+            keys.push(key);
+            values.push(value);
+        }
+        return [keys, values];
+    }
+}
+class PendingExpandingLookup {
+    data;
+    usedOutputs = [];
+    dependents = [];
+    constructor(data) {
+        this.data = data;
+    }
+    addOutput(param) {
+        for (let i = 0; i < this.usedOutputs.length; i++) {
+            const existing = this.usedOutputs[i];
+            if (existing.equalsAssumingSameResultSet(param)) {
+                return i;
+            }
+        }
+        const index = this.usedOutputs.length;
+        this.usedOutputs.push(param);
+        return index;
+    }
+}
+class UniqueCounter {
+    current;
+    constructor() {
+        this.current = 0;
+    }
+    use(prefix) {
+        const value = this.current++;
+        return `${prefix}|${value}`;
+    }
+}
+//# sourceMappingURL=querier_graph.js.map

package/dist/compiler/querier_graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"querier_graph.js","sourceRoot":"","sources":["../../src/compiler/querier_graph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,2BAA2B,EAE3B,0BAA0B,EAC1B,0BAA0B,EAC1B,eAAe,EAEf,qBAAqB,EACrB,aAAa,EACb,cAAc,EACf,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,uBAAuB,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EAAiB,YAAY,EAAE,iBAAiB,EAAE,aAAa,EAAE,0BAA0B,EAAE,MAAM,aAAa,CAAC;AACxH,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AACpE,OAAO,EAAE,uBAAuB,EAAgD,MAAM,YAAY,CAAC;AAEnG,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAI/D;;GAEG;AACH,MAAM,OAAO,mBAAmB;IAKnB;IACA;IALM,SAAS,GAAqB,EAAE,CAAC;IACzC,OAAO,CAAgB;IAEhC,YACW,QAA6B,EAC7B,OAAsB;QADtB,aAAQ,GAAR,QAAQ,CAAqB;QAC7B,YAAO,GAAP,OAAO,CAAe;QAE/B,IAAI,CAAC,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,KAAwB,EAAE,MAA4B;QAC5D,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,IAAI,kBAAkB,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,mBAAmB,EAAE,CAAC;YAC5F,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED;;;;;;;;;;;;;OAaG;IACK,YAAY;QAClB,MAAM,SAAS,GAAG,IAAI,OAAO,CAAiB;YAC5C,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC;YAChD,IAAI,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,sBAAsB,CAAC,MAAM,CAAC;SAC9D,CAAC,CAAC;QAEH,KAAK,MAAM,cAAc,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC5C,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;YACpE,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,KAAK,MAAM,YAAY,IAAI,cAAc,CAAC,cAAc,CAAC,UAAU,EAAE,CAAC;oBACpE,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;gBACvD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,SAAS,CAAC,CAAC;IACxB,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,kBAAkB;IAcH;IACA;IACA;IAfnB,mDAAmD;IAClC,cAAc,GAAe,EAAE,CAAC;IAChC,cAAc,GAAG,IAAI,GAAG,EAA2C,CAAC;IAErF;;;;OAIG;IACc,YAAY,GAAsB,EAAE,CAAC;IAC9C,YAAY,GAAiB,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAErD,YACmB,OAA4B,EAC5B,KAAwB,EACxB,MAA4B,EAC7C,SAAc;QAHG,YAAO,GAAP,OAAO,CAAqB;QAC5B,UAAK,GAAL,KAAK,CAAmB;QACxB,WAAM,GAAN,MAAM,CAAsB;QAG7C,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,mBAAmB;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC5D,MAAM,CAAC,UAAU,EAAE,eAAe,CAAC,GAAG,KAAK,CAAC,iBAAiB,EAAE,CAAC;QAChE,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,qBAAqB,CAClE,IAAI,YAAY,CAAC;YACf,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa;YACjC,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW;YACvC,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,WAAW,EAAE,UAAU;SACxB,CAAC,CACH,CAAC;QACF,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAE9B,oHAAoH;QACpH,qDAAqD;QACrD,MAAM,iBAAiB,GAAwB,EAAE,CAAC;QAClD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YAC5C,IAAI,SAAS,YAAY,0BAA0B,EAAE,CAAC;gBACpD,IAAI,SAAS,CAAC,SAAS,IAAI,IAAI,EAAE,CAAC;oBAChC,IAAI,CAAC,MAAM,CAAC,MAAM,CAChB,uFAAuF,EACvF,SAAS,CAAC,UAAU,CAAC,QAAQ,CAC9B,CAAC;gBACJ,CAAC;qBAAM,CAAC;oBACN,iBAAiB,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC3D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,mDAAmD,EAAE,SAAS,CAAC,QAAS,CAAC,CAAC;YAC/F,CAAC;QACH,CAAC;QAED,OAAO,IAAI,cAAc,CACvB,IAAI,CAAC,OAAO,CAAC,OAAO,EACpB,iBAAiB,EACjB,IAAI,CAAC,uBAAuB,EAAE,EAC9B,IAAI,aAAa,CAAC,SAAS,EAAE,eAAe,CAAC,EAC7C,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CACpD,CAAC;IACJ,CAAC;IAEO,SAAS;QACf,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC;QACrC,IAAI,CAAC,YAAY,GAAG,UAAU,CAAC,MAAM,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QAC1D,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,QAAQ,CAAC,KAAmB;QAClC,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;IAC5B,CAAC;IAEO,kBAAkB,CAAC,SAAkC;QAC3D,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QAClD,MAAM,CAAC,aAAa,EAAE,eAAe,CAAC,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;QAEtE,OAAO,IAAI,sBAAsB,CAAC;YAChC,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,SAAS;YAClB,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,aAAa,EAAE,aAAa;YAC5B,MAAM,EAAE,eAAe;SACxB,CAAC,CAAC;IACL,CAAC;IAEO,wBAAwB,CAAC,SAAsC;QACrE,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QAClD,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;YAChC,8GAA8G;YAC9G,kCAAkC;YAClC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,gDAAgD,EAAE,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAChG,CAAC;QAED,OAAO,IAAI,sBAAsB,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;IACpG,CAAC;IAEO,sBAAsB,CAAC,SAA0B;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACpD,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;YACrB,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,mHAAmH;QACnH,sDAAsD;QACtD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAEpC,MAAM,QAAQ,GACZ,SAAS,YAAY,uBAAuB;YAC1C,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC;YACpC,CAAC,CAAC,IAAI,CAAC,wBAAwB,CAAC,SAAS,CAAC,CAAC;QAE/C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC1B,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,MAAuB;QAC9C,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YAC5C,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;QAClF,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,iBAAiB,EAAE,CAAC;QAEtC,KAAK,MAAM,UAAU,IAAI,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC;YAClD,IAAI,UAAU,YAAY,0BAA0B,EAAE,CAAC;gBACrD,IAAI,UAAU,CAAC,SAAS,KAAK,MAAM,EAAE,CAAC;oBACpC,0GAA0G;oBAC1G,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC;oBAClD,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,wBAAwB;gBACxB,MAAM,WAAW,GAAG,CAAC,OAAmC,EAAE,QAAoC,EAAE,EAAE;oBAChG,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;oBACzC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,IAAI,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;oBACzD,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;oBAE1D,IAAI,QAAQ,CAAC,SAAS,IAAI,IAAI,EAAE,CAAC;wBAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;wBAC/D,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,IAAI,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC;wBAC5D,MAAM,KAAK,GAAG,IAAI,0BAA0B,CAAC,KAAK,CAAC,CAAC;wBACpD,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBAC9B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACrB,CAAC;yBAAM,CAAC;wBACN,4FAA4F;wBAC5F,MAAM,CAAC,IAAI,CAAC,IAAI,qBAAqB,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACnD,CAAC;gBACH,CAAC,CAAC;gBAEF,IAAI,UAAU,CAAC,IAAI,CAAC,SAAS,KAAK,MAAM,EAAE,CAAC;oBACzC,WAAW,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;gBACjD,CAAC;qBAAM,IAAI,UAAU,CAAC,KAAK,CAAC,SAAS,KAAK,MAAM,EAAE,CAAC;oBACjD,WAAW,CAAC,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;gBACjD,CAAC;qBAAM,CAAC;oBACN,0BAA0B;oBAC1B,SAAS;gBACX,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC;QACvC,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAC1D,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;;OASG;IACK,sBAAsB;QAC5B,KAAK,MAAM,UAAU,IAAI,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC;YAClD,IAAI,UAAU,YAAY,YAAY,EAAE,CAAC;gBACvC,MAAM,OAAO,GAAG,CAAC,UAAsC,EAAE,KAAiC,EAAE,EAAE;oBAC5F,IAAI,KAAK,CAAC,SAAS,IAAI,IAAI,EAAE,CAAC;wBAC5B,gGAAgG;wBAChG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;oBAC/C,CAAC;gBACH,CAAC,CAAC;gBAEF,IAAI,UAAU,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBACxC,OAAO,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;gBAC7C,CAAC;qBAAM,IAAI,UAAU,CAAC,KAAK,CAAC,mBAAmB,EAAE,CAAC;oBAChD,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;gBAC7C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAEO,uBAAuB,CAAC,OAAiB;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACnD,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC;IAEO,uBAAuB;QAC7B,MAAM,OAAO,GAAwB,EAAE,CAAC;QACxC,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QACxD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,sBAAsB,CAAC,KAAmB,EAAE,MAA2B;QAC7E,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;YACzB,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACpD,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC9B,MAAM,OAAO,GAAsB,EAAE,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAErB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBACnC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;gBACzB,IAAI,gBAAiC,CAAC;gBAEtC,IAAI,IAAI,CAAC,IAAI,IAAI,OAAO,EAAE,CAAC;oBACzB,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,uBAAuB,CACxE,IAAI,WAAW,CAAC;wBACd,eAAe,EAAE,IAAI,CAAC,OAAO;wBAC7B,OAAO,EAAE,IAAI,CAAC,OAAO;wBACrB,WAAW,EAAE,IAAI,CAAC,aAAa;wBAC/B,MAAM,EAAE,MAAM,CAAC,WAAW;qBAC3B,CAAC,CACH,CAAC;oBACF,gBAAgB,GAAG,IAAI,eAAe,CAAC,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC;oBACN,gBAAgB,GAAG,IAAI,2BAA2B,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;gBACvG,CAAC;gBAED,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;gBAC/B,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;oBACtC,KAAK,CAAC,MAAM,GAAG,gBAAgB,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED,MAAM,iBAAiB;IACZ,OAAO,GAAoB,EAAE,CAAC;IAC9B,SAAS,GAAG,IAAI,OAAO,CAAiC,uBAAuB,CAAC,CAAC;IAE1F,iBAAiB;QACf,MAAM,OAAO,GAAqC,EAAE,CAAC;QACrD,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;YACnD,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,0BAA0B,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;QAED,kHAAkH;QAClH,kHAAkH;QAClH,gEAAgE;QAChE,8EAA8E;QAC9E,OAAO,CAAC,IAAI,CACV,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,YAAY,CAAC,QAAQ,CAAC,uBAAuB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,QAAQ,CAAC,uBAAuB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAC9G,CAAC;QAEF,MAAM,IAAI,GAAmB,EAAE,CAAC;QAChC,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACxB,CAAC;CACF;AAED,MAAM,sBAAsB;IAIL;IAHZ,WAAW,GAAoB,EAAE,CAAC;IAClC,UAAU,GAAiC,EAAE,CAAC;IAEvD,YAAqB,IAA2D;QAA3D,SAAI,GAAJ,IAAI,CAAuD;IAAG,CAAC;IAEpF,SAAS,CAAC,KAAoB;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,QAAQ,CAAC,2BAA2B,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChD,OAAO,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QACtC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAoBD,MAAM,aAAa;IACjB,OAAO,CAAS;IAEhB;QACE,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,GAAG,CAAC,MAAc;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC7B,OAAO,GAAG,MAAM,IAAI,KAAK,EAAE,CAAC;IAC9B,CAAC;CACF"}

package/dist/compiler/rows.d.ts

@@ -0,0 +1,113 @@
+import { StableHasher } from './equality.js';
+import { EqualsIgnoringResultSet } from './compatibility.js';
+import { RowExpression } from './filter.js';
+import { PhysicalSourceResultSet } from './table.js';
+import { ImplicitSchemaTablePattern } from '../TablePattern.js';
+/**
+ * A key describing how buckets or parameter lookups are parameterized.
+ *
+ * When constructing buckets, a value needs to be passed for each such key.
+ * WHen invoking parameter lookups, values need to be passed as inputs.
+ */
+export declare class PartitionKey implements EqualsIgnoringResultSet {
+    readonly expression: RowExpression;
+    constructor(expression: RowExpression);
+    equalsAssumingSameResultSet(other: EqualsIgnoringResultSet): boolean;
+    assumingSameResultSetEqualityHashCode(hasher: StableHasher): void;
+}
+/**
+ * Something that processes source rows during replication.
+ *
+ * This includes {@link RowEvaluator}s, which assigns rows into buckets, and {@link PointLookup}, which creates
+ * parameter lookups used to resolve bucket ids when a user connects.
+ */
+export type SourceRowProcessor = RowEvaluator | PointLookup;
+interface SourceProcessorOptions {
+    readonly syntacticSource: PhysicalSourceResultSet;
+    readonly filters: RowExpression[];
+    readonly partitionBy: PartitionKey[];
+}
+declare abstract class BaseSourceRowProcessor {
+    /**
+     * The table names being matched, along with an AST reference describing its syntactic source.
+     */
+    readonly syntacticSource: PhysicalSourceResultSet;
+    /**
+     * Filters which all depend on {@link syntacticSource} exclusively.
+     *
+     * This processor is only active on rows matching these filters.
+     */
+    readonly filters: RowExpression[];
+    readonly partitionBy: PartitionKey[];
+    constructor(options: SourceProcessorOptions);
+    /**
+     * A hash code for the equivalence relation formed by {@link behavesIdenticalTo}.
+     */
+    abstract buildBehaviorHashCode(hasher: StableHasher): void;
+    get behaviorHashCode(): number;
+    /**
+     * Whether two source row processors behave identically.
+     *
+     * If this is the case, they can be re-used across different stream definitions or even different sync rule instances
+     * (for incremental reprocessing).
+     */
+    abstract behavesIdenticalTo(other: this): boolean;
+    /**
+     * The table pattern matched by this bucket or parameter lookup creator.
+     */
+    get tablePattern(): ImplicitSchemaTablePattern;
+    protected addBaseHashCode(hasher: StableHasher): void;
+    protected baseMatchesOther(other: BaseSourceRowProcessor): boolean;
+}
+/**
+ * A row evaluator, evaluating rows to sync from a row in the source database.
+ *
+ * During replication, instances of these are implemented as {@link BucketDataSource}.
+ */
+export declare class RowEvaluator extends BaseSourceRowProcessor {
+    /**
+     * Expressions and names for columns to sync.
+     */
+    readonly columns: ColumnSource[];
+    constructor(options: SourceProcessorOptions & {
+        columns: ColumnSource[];
+    });
+    get outputName(): string | undefined;
+    buildBehaviorHashCode(hasher: StableHasher): void;
+    behavesIdenticalTo(other: RowEvaluator): boolean;
+}
+/**
+ * A point lookup, creating a materialized index.
+ *
+ * These are used to implement subqueries. E.g for `SELECT * FROM users WHERE org IN (SELECT id FROM orgs WHERE name =
+ * auth.param('org'))`, we would create a point lookup on `orgs` with a partition key of `name` and a result including
+ * `id`.
+ *
+ * During replication, instances of these are implemented as {@link ParameterIndexLookupCreator}s.
+ */
+export declare class PointLookup extends BaseSourceRowProcessor {
+    /**
+     * Outputs of the point lookup, which can be used when querying for buckets.
+     */
+    readonly result: RowExpression[];
+    constructor(options: SourceProcessorOptions & {
+        result: RowExpression[];
+    });
+    buildBehaviorHashCode(hasher: StableHasher): void;
+    behavesIdenticalTo(other: PointLookup): boolean;
+}
+export type ColumnSource = StarColumnSource | ExpressionColumnSource;
+export declare class StarColumnSource implements EqualsIgnoringResultSet {
+    private constructor();
+    equalsAssumingSameResultSet(other: EqualsIgnoringResultSet): boolean;
+    assumingSameResultSetEqualityHashCode(): void;
+    static readonly instance: StarColumnSource;
+}
+export declare class ExpressionColumnSource implements EqualsIgnoringResultSet {
+    readonly expression: RowExpression;
+    readonly alias: string;
+    constructor(expression: RowExpression, alias: string);
+    equalsAssumingSameResultSet(other: EqualsIgnoringResultSet): boolean;
+    assumingSameResultSetEqualityHashCode(hasher: StableHasher): void;
+}
+export {};

package/dist/compiler/rows.js

@@ -0,0 +1,156 @@
+import { StableHasher } from './equality.js';
+import { equalsIgnoringResultSetList, equalsIgnoringResultSetUnordered } from './compatibility.js';
+/**
+ * A key describing how buckets or parameter lookups are parameterized.
+ *
+ * When constructing buckets, a value needs to be passed for each such key.
+ * WHen invoking parameter lookups, values need to be passed as inputs.
+ */
+export class PartitionKey {
+    expression;
+    constructor(expression) {
+        this.expression = expression;
+    }
+    equalsAssumingSameResultSet(other) {
+        return (other instanceof PartitionKey &&
+            other.expression.expression.equalsAssumingSameResultSet(this.expression.expression));
+    }
+    assumingSameResultSetEqualityHashCode(hasher) {
+        this.expression.expression.assumingSameResultSetEqualityHashCode(hasher);
+    }
+}
+class BaseSourceRowProcessor {
+    /**
+     * The table names being matched, along with an AST reference describing its syntactic source.
+     */
+    syntacticSource;
+    /**
+     * Filters which all depend on {@link syntacticSource} exclusively.
+     *
+     * This processor is only active on rows matching these filters.
+     */
+    filters;
+    partitionBy;
+    constructor(options) {
+        this.syntacticSource = options.syntacticSource;
+        this.filters = options.filters;
+        this.partitionBy = options.partitionBy;
+    }
+    get behaviorHashCode() {
+        const hasher = new StableHasher();
+        this.buildBehaviorHashCode(hasher);
+        return hasher.buildHashCode();
+    }
+    /**
+     * The table pattern matched by this bucket or parameter lookup creator.
+     */
+    get tablePattern() {
+        return this.syntacticSource.tablePattern;
+    }
+    addBaseHashCode(hasher) {
+        hasher.add(this.tablePattern);
+        equalsIgnoringResultSetUnordered.hash(hasher, this.filters.map((f) => f.expression));
+        equalsIgnoringResultSetList.hash(hasher, this.partitionBy);
+    }
+    baseMatchesOther(other) {
+        if (!other.tablePattern.equals(this.tablePattern)) {
+            return false;
+        }
+        if (!equalsIgnoringResultSetList.equals(other.partitionBy, this.partitionBy)) {
+            return false;
+        }
+        if (!equalsIgnoringResultSetUnordered.equals(other.filters, this.filters)) {
+            return false;
+        }
+        return true;
+    }
+}
+/**
+ * A row evaluator, evaluating rows to sync from a row in the source database.
+ *
+ * During replication, instances of these are implemented as {@link BucketDataSource}.
+ */
+export class RowEvaluator extends BaseSourceRowProcessor {
+    /**
+     * Expressions and names for columns to sync.
+     */
+    columns;
+    constructor(options) {
+        super(options);
+        this.columns = options.columns;
+    }
+    get outputName() {
+        const alias = this.syntacticSource.source.explicitName;
+        if (this.syntacticSource.tablePattern.isWildcard) {
+            if (alias == null) {
+                // Unaliased wildcard, use source table name.
+                return undefined;
+            }
+        }
+        return alias ?? this.syntacticSource.tablePattern.tablePattern;
+    }
+    buildBehaviorHashCode(hasher) {
+        this.addBaseHashCode(hasher);
+        equalsIgnoringResultSetList.hash(hasher, this.columns);
+        if (this.outputName) {
+            hasher.addString(this.outputName);
+        }
+    }
+    behavesIdenticalTo(other) {
+        return (this.baseMatchesOther(other) &&
+            equalsIgnoringResultSetList.equals(other.columns, this.columns) &&
+            other.outputName == this.outputName);
+    }
+}
+/**
+ * A point lookup, creating a materialized index.
+ *
+ * These are used to implement subqueries. E.g for `SELECT * FROM users WHERE org IN (SELECT id FROM orgs WHERE name =
+ * auth.param('org'))`, we would create a point lookup on `orgs` with a partition key of `name` and a result including
+ * `id`.
+ *
+ * During replication, instances of these are implemented as {@link ParameterIndexLookupCreator}s.
+ */
+export class PointLookup extends BaseSourceRowProcessor {
+    /**
+     * Outputs of the point lookup, which can be used when querying for buckets.
+     */
+    result;
+    constructor(options) {
+        super(options);
+        this.result = options.result;
+    }
+    buildBehaviorHashCode(hasher) {
+        this.addBaseHashCode(hasher);
+        equalsIgnoringResultSetList.hash(hasher, this.result);
+    }
+    behavesIdenticalTo(other) {
+        return this.baseMatchesOther(other) && equalsIgnoringResultSetList.equals(other.result, this.result);
+    }
+}
+export class StarColumnSource {
+    constructor() { }
+    equalsAssumingSameResultSet(other) {
+        return other instanceof StarColumnSource;
+    }
+    assumingSameResultSetEqualityHashCode() { }
+    static instance = new StarColumnSource();
+}
+export class ExpressionColumnSource {
+    expression;
+    alias;
+    constructor(expression, alias) {
+        this.expression = expression;
+        this.alias = alias;
+    }
+    equalsAssumingSameResultSet(other) {
+        return (other instanceof ExpressionColumnSource &&
+            other.alias == this.alias &&
+            other.expression.equalsAssumingSameResultSet(this.expression));
+    }
+    assumingSameResultSetEqualityHashCode(hasher) {
+        this.expression.assumingSameResultSetEqualityHashCode(hasher);
+        hasher.addString(this.alias);
+    }
+}
+//# sourceMappingURL=rows.js.map

package/dist/compiler/rows.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rows.js","sourceRoot":"","sources":["../../src/compiler/rows.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAC7C,OAAO,EAEL,2BAA2B,EAC3B,gCAAgC,EACjC,MAAM,oBAAoB,CAAC;AAK5B;;;;;GAKG;AACH,MAAM,OAAO,YAAY;IACF;IAArB,YAAqB,UAAyB;QAAzB,eAAU,GAAV,UAAU,CAAe;IAAG,CAAC;IAElD,2BAA2B,CAAC,KAA8B;QACxD,OAAO,CACL,KAAK,YAAY,YAAY;YAC7B,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,2BAA2B,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CACpF,CAAC;IACJ,CAAC;IAED,qCAAqC,CAAC,MAAoB;QACxD,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,qCAAqC,CAAC,MAAM,CAAC,CAAC;IAC3E,CAAC;CACF;AAgBD,MAAe,sBAAsB;IACnC;;OAEG;IACM,eAAe,CAA0B;IAElD;;;;OAIG;IACM,OAAO,CAAkB;IACzB,WAAW,CAAiB;IAErC,YAAY,OAA+B;QACzC,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,eAAe,CAAC;QAC/C,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;QAC/B,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;IACzC,CAAC;IAOD,IAAI,gBAAgB;QAClB,MAAM,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAClC,IAAI,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC,aAAa,EAAE,CAAC;IAChC,CAAC;IAUD;;OAEG;IACH,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC;IAC3C,CAAC;IAES,eAAe,CAAC,MAAoB;QAC5C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC9B,gCAAgC,CAAC,IAAI,CACnC,MAAM,EACN,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CACtC,CAAC;QACF,2BAA2B,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7D,CAAC;IAES,gBAAgB,CAAC,KAA6B;QACtD,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;YAClD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,2BAA2B,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YAC7E,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,gCAAgC,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YAC1E,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,YAAa,SAAQ,sBAAsB;IACtD;;OAEG;IACM,OAAO,CAAiB;IAEjC,YAAY,OAA6D;QACvE,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;IACjC,CAAC;IAED,IAAI,UAAU;QACZ,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC;QAEvD,IAAI,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC;YACjD,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;gBAClB,6CAA6C;gBAC7C,OAAO,SAAS,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,IAAI,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,YAAY,CAAC;IACjE,CAAC;IAED,qBAAqB,CAAC,MAAoB;QACxC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC7B,2BAA2B,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,kBAAkB,CAAC,KAAmB;QACpC,OAAO,CACL,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;YAC5B,2BAA2B,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC;YAC/D,KAAK,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,CACpC,CAAC;IACJ,CAAC;CACF;AAED;;;;;;;;GAQG;AACH,MAAM,OAAO,WAAY,SAAQ,sBAAsB;IACrD;;OAEG;IACM,MAAM,CAAkB;IAEjC,YAAY,OAA6D;QACvE,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAC/B,CAAC;IAED,qBAAqB,CAAC,MAAoB;QACxC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC7B,2BAA2B,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACxD,CAAC;IAED,kBAAkB,CAAC,KAAkB;QACnC,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,IAAI,2BAA2B,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACvG,CAAC;CACF;AAID,MAAM,OAAO,gBAAgB;IAC3B,gBAAuB,CAAC;IAExB,2BAA2B,CAAC,KAA8B;QACxD,OAAO,KAAK,YAAY,gBAAgB,CAAC;IAC3C,CAAC;IAED,qCAAqC,KAAU,CAAC;IAEhD,MAAM,CAAU,QAAQ,GAAG,IAAI,gBAAgB,EAAE,CAAC;;AAGpD,MAAM,OAAO,sBAAsB;IAEtB;IACA;IAFX,YACW,UAAyB,EACzB,KAAa;QADb,eAAU,GAAV,UAAU,CAAe;QACzB,UAAK,GAAL,KAAK,CAAQ;IACrB,CAAC;IAEJ,2BAA2B,CAAC,KAA8B;QACxD,OAAO,CACL,KAAK,YAAY,sBAAsB;YACvC,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK;YACzB,KAAK,CAAC,UAAU,CAAC,2BAA2B,CAAC,IAAI,CAAC,UAAU,CAAC,CAC9D,CAAC;IACJ,CAAC;IAED,qCAAqC,CAAC,MAAoB;QACxD,IAAI,CAAC,UAAU,CAAC,qCAAqC,CAAC,MAAM,CAAC,CAAC;QAC9D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;CACF"}