@powersync/service-sync-rules 0.29.10 → 0.31.0

package/dist/compiler/filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter.js","sourceRoot":"","sources":["../../src/compiler/filter.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAmB,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAE/E,OAAO,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAqBnD,MAAM,UAAU,UAAU,CAAC,KAAc;IACvC,OAAO,KAAK,YAAY,0BAA0B,IAAI,KAAK,YAAY,YAAY,CAAC;AACtF,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,0BAA0B;IAC5B,UAAU,CAAiB;IACpC;;;;OAIG;IACM,SAAS,CAAyB;IAE3C;;OAEG;IACM,mBAAmB,CAAU;IAEtC,YAAY,UAAuD;QACjE,IAAI,UAAU,YAAY,cAAc,EAAE,CAAC;YACzC,MAAM,OAAO,GAAG,0BAA0B,CAAC,uBAAuB,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC;YAC7F,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;gBACpB,MAAM,IAAI,sBAAsB,CAAC,4EAA4E,CAAC,CAAC;YACjH,CAAC;YAED,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;YAC7B,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,mBAAmB,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,UAAU,CAAC;YACxC,IAAI,CAAC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC;YACtC,IAAI,CAAC,mBAAmB,GAAG,UAAU,CAAC,mBAAmB,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,2BAA2B,CAAC,KAA8B;QACxD,OAAO,KAAK,YAAY,0BAA0B,IAAI,KAAK,CAAC,UAAU,CAAC,2BAA2B,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACtH,CAAC;IAED,qCAAqC,CAAC,MAAoB;QACxD,IAAI,CAAC,UAAU,CAAC,qCAAqC,CAAC,MAAM,CAAC,CAAC;IAChE,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,uBAAuB,CAAC,MAAiC;QAC9D,IAAI,SAAS,GAA2B,IAAI,CAAC;QAC7C,IAAI,yBAAyB,GAAG,KAAK,CAAC;QAEtC,KAAK,MAAM,UAAU,IAAI,MAAM,EAAE,CAAC;YAChC,IAAI,UAAU,YAAY,WAAW,EAAE,CAAC;gBACtC,IAAI,CAAC,SAAS,IAAI,IAAI,IAAI,SAAS,KAAK,UAAU,CAAC,SAAS,CAAC,IAAI,yBAAyB,EAAE,CAAC;oBAC3F,OAAO,IAAI,CAAC;gBACd,CAAC;gBACD,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC;YACnC,CAAC;iBAAM,CAAC;gBACN,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;oBACtB,OAAO,IAAI,CAAC;gBACd,CAAC;gBAED,yBAAyB,GAAG,IAAI,CAAC;YACnC,CAAC;QACH,CAAC;QAED,OAAO,CAAC,SAAS,EAAE,yBAAyB,CAAC,CAAC;IAChD,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,aAAc,SAAQ,0BAA0B;IAG3D,YAAY,UAAuD;QACjE,KAAK,CAAC,UAAU,CAAC,CAAC;QAClB,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,MAAM,IAAI,sBAAsB,CAAC,wCAAwC,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,iBAAkB,SAAQ,0BAA0B;IAC/D,YAAY,UAAuD;QACjE,KAAK,CAAC,UAAU,CAAC,CAAC;QAClB,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,EAAE,CAAC;YAC3B,MAAM,IAAI,sBAAsB,CAAC,oCAAoC,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,YAAY;IAEZ;IACA;IAFX,YACW,IAAgC,EAChC,KAAiC;QADjC,SAAI,GAAJ,IAAI,CAA4B;QAChC,UAAK,GAAL,KAAK,CAA4B;IACzC,CAAC;IAEJ,IAAI,QAAQ;QACV,OAAO,mBAAmB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC9F,CAAC;CACF;AAED,MAAM,OAAO,sBAAuB,SAAQ,KAAK;IAC/C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;IACjB,CAAC;CACF"}

package/dist/compiler/filter_simplifier.d.ts

@@ -0,0 +1,26 @@
+import { Or } from './filter.js';
+import { NodeLocations } from './expression.js';
+import { BinaryOperator, SqlExpression } from '../sync_plan/expression.js';
+export declare class FilterConditionSimplifier {
+    simplifyOr(or: Or): Or;
+    private simplifyAnd;
+    /**
+     * Re-orders terms based on their dependencies, and then uses the given operator to merge expressions with the same
+     * dependency set.
+     *
+     * This is used to push boolean expressions down if they can be evaluated on the same table. For instance, the and
+     * terms `[row.foo, row.bar]` can be represented as a single base term `row.foo AND row.bar`. Pushing operators down
+     * into the expression generally reduces the complexity of the sync plan. In particular for `OR` terms, it can also
+     * reduce the amount of buckets since each term in an `OR` is implemented as another bucket.
+     */
+    private mergeByCommonDependencies;
+    private simplifyBase;
+    /**
+     * Reduces expressions through a chain of binary operators.
+     *
+     * For instance, `composeExpressions('AND', a, b, c)` returns `a AND b AND c` as a single expression. All expressions
+     * must have compatible dependencies.
+     */
+    private composeExpressions;
+}
+export declare function composeExpressionNodes<T>(locations: NodeLocations, operator: BinaryOperator, terms: SqlExpression<T>[]): SqlExpression<T>;

package/dist/compiler/filter_simplifier.js

@@ -0,0 +1,119 @@
+import { EqualsClause, isBaseTerm, SingleDependencyExpression } from './filter.js';
+import { SyncExpression } from './expression.js';
+import { expandNodeLocations } from '../errors.js';
+export class FilterConditionSimplifier {
+    simplifyOr(or) {
+        const andTerms = [];
+        let baseTerms = [];
+        for (const term of or.terms) {
+            const simplified = this.simplifyAnd(term);
+            if (isBaseTerm(simplified)) {
+                baseTerms.push(simplified);
+            }
+            else {
+                andTerms.push(simplified);
+            }
+        }
+        baseTerms = this.mergeByCommonDependencies('or', baseTerms);
+        for (const term of baseTerms) {
+            andTerms.push({ terms: [term] });
+        }
+        return { terms: andTerms };
+    }
+    simplifyAnd(and) {
+        const merged = this.mergeByCommonDependencies('and', and.terms);
+        if (merged.length == 1) {
+            return merged[0];
+        }
+        return { terms: merged };
+    }
+    /**
+     * Re-orders terms based on their dependencies, and then uses the given operator to merge expressions with the same
+     * dependency set.
+     *
+     * This is used to push boolean expressions down if they can be evaluated on the same table. For instance, the and
+     * terms `[row.foo, row.bar]` can be represented as a single base term `row.foo AND row.bar`. Pushing operators down
+     * into the expression generally reduces the complexity of the sync plan. In particular for `OR` terms, it can also
+     * reduce the amount of buckets since each term in an `OR` is implemented as another bucket.
+     */
+    mergeByCommonDependencies(operator, baseTerms) {
+        const byResultSet = new Map();
+        const noResultSet = [];
+        const rest = [];
+        for (const term of baseTerms) {
+            const simplified = this.simplifyBase(term);
+            if (simplified instanceof SingleDependencyExpression) {
+                if (simplified.resultSet != null) {
+                    if (byResultSet.has(simplified.resultSet)) {
+                        byResultSet.get(simplified.resultSet).push(simplified);
+                    }
+                    else {
+                        byResultSet.set(simplified.resultSet, [simplified]);
+                    }
+                }
+                else {
+                    noResultSet.push(simplified);
+                }
+            }
+            else {
+                rest.push(term);
+            }
+        }
+        const addMerged = (elements) => {
+            if (elements.length == 0) {
+                return;
+            }
+            rest.push(this.composeExpressions(operator, ...elements));
+        };
+        addMerged(noResultSet);
+        for (const terms of byResultSet.values()) {
+            addMerged(terms);
+        }
+        return rest;
+    }
+    simplifyBase(base) {
+        if (base instanceof EqualsClause) {
+            // If the left and right terms have shared dependencies, we shouldn't represent this as an equals clause. For
+            // instance, terms like `notes.state = 'public'` are generated as an equals clause initially but they can just be
+            // a row condition that is much cheaper to compute than a static bucket parameter. Similarly, `row.foo = row.bar`
+            // must be a row condition since it can't be represented as parameters that could be instantiated.
+            if (SingleDependencyExpression.extractSingleDependency([
+                ...base.left.expression.instantiation,
+                ...base.right.expression.instantiation
+            ])) {
+                return this.composeExpressions('=', base.left, base.right);
+            }
+        }
+        return base;
+    }
+    /**
+     * Reduces expressions through a chain of binary operators.
+     *
+     * For instance, `composeExpressions('AND', a, b, c)` returns `a AND b AND c` as a single expression. All expressions
+     * must have compatible dependencies.
+     */
+    composeExpressions(operator, ...terms) {
+        if (terms.length == 0) {
+            throw new Error("Can't compose zero expressions");
+        }
+        const locations = terms[0].expression.locations;
+        const inner = composeExpressionNodes(locations, operator, terms.map((t) => t.expression.node));
+        return new SingleDependencyExpression(new SyncExpression(inner, locations));
+    }
+}
+export function composeExpressionNodes(locations, operator, terms) {
+    if (terms.length == 0) {
+        throw new Error("Can't compose zero expressions");
+    }
+    const [first, ...rest] = terms;
+    let inner = first;
+    for (const additional of rest) {
+        inner = { type: 'binary', operator, left: inner, right: additional };
+    }
+    const location = expandNodeLocations(terms.map((e) => locations.locationFor(e)));
+    if (location) {
+        locations.sourceForNode.set(inner, location);
+    }
+    return inner;
+}
+//# sourceMappingURL=filter_simplifier.js.map

package/dist/compiler/filter_simplifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter_simplifier.js","sourceRoot":"","sources":["../../src/compiler/filter_simplifier.ts"],"names":[],"mappings":"AAAA,OAAO,EAAiB,YAAY,EAAE,UAAU,EAAM,0BAA0B,EAAE,MAAM,aAAa,CAAC;AACtG,OAAO,EAAiB,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAGhE,OAAO,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAEnD,MAAM,OAAO,yBAAyB;IACpC,UAAU,CAAC,EAAM;QACf,MAAM,QAAQ,GAAU,EAAE,CAAC;QAC3B,IAAI,SAAS,GAAe,EAAE,CAAC;QAE/B,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;YAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YAC1C,IAAI,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC3B,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAC5D,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnC,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;IAC7B,CAAC;IAEO,WAAW,CAAC,GAAQ;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QAEhE,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACvB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAC3B,CAAC;IAED;;;;;;;;OAQG;IACK,yBAAyB,CAAC,QAAwB,EAAE,SAAqB;QAC/E,MAAM,WAAW,GAAG,IAAI,GAAG,EAAiD,CAAC;QAC7E,MAAM,WAAW,GAAiC,EAAE,CAAC;QACrD,MAAM,IAAI,GAAe,EAAE,CAAC;QAE5B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YAC3C,IAAI,UAAU,YAAY,0BAA0B,EAAE,CAAC;gBACrD,IAAI,UAAU,CAAC,SAAS,IAAI,IAAI,EAAE,CAAC;oBACjC,IAAI,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC1C,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAC1D,CAAC;yBAAM,CAAC;wBACN,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;oBACtD,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QAED,MAAM,SAAS,GAAG,CAAC,QAAsC,EAAE,EAAE;YAC3D,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACzB,OAAO;YACT,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC;QACF,SAAS,CAAC,WAAW,CAAC,CAAC;QACvB,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,SAAS,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,YAAY,CAAC,IAAc;QACjC,IAAI,IAAI,YAAY,YAAY,EAAE,CAAC;YACjC,6GAA6G;YAC7G,iHAAiH;YACjH,iHAAiH;YACjH,kGAAkG;YAClG,IACE,0BAA0B,CAAC,uBAAuB,CAAC;gBACjD,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,aAAa;gBACrC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,aAAa;aACvC,CAAC,EACF,CAAC;gBACD,OAAO,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACK,kBAAkB,CACxB,QAAwB,EACxB,GAAG,KAAmC;QAEtC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACpD,CAAC;QAED,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC;QAChD,MAAM,KAAK,GAAG,sBAAsB,CAClC,SAAS,EACT,QAAQ,EACR,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CACpC,CAAC;QAEF,OAAO,IAAI,0BAA0B,CAAC,IAAI,cAAc,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;IAC9E,CAAC;CACF;AAED,MAAM,UAAU,sBAAsB,CACpC,SAAwB,EACxB,QAAwB,EACxB,KAAyB;IAEzB,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC;IAC/B,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,KAAK,MAAM,UAAU,IAAI,IAAI,EAAE,CAAC;QAC9B,KAAK,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IACvE,CAAC;IAED,MAAM,QAAQ,GAAG,mBAAmB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,IAAI,QAAQ,EAAE,CAAC;QACb,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/compiler/ir_to_sync_plan.d.ts

@@ -0,0 +1,37 @@
+import * as plan from '../sync_plan/plan.js';
+import { CompiledStreamQueries } from './compiler.js';
+export declare class CompilerModelToSyncPlan {
+    private static readonly evaluatorHash;
+    private mappedObjects;
+    private buckets;
+    /**
+     * Mapping of row evaluators to buckets.
+     *
+     * One might expect one stream to result in one bucket, but that is not generally the case. First, a stream might
+     * define multiple buckets. For instance, `SELECT * FROM notes WHERE notes.is_public OR auth.parameter('admin')`
+     * requires two buckets since there are different ways a row in `notes` might be synced (we have one bucket with
+     * public notes and one bucket of all notes, and then decide which ones a given user has access to by inspecting the
+     * token).
+     *
+     * Further, a stream might have multiple evaluators but only a single bucket. A stream with queries
+     * `SELECT * FROM foo` and `SELECT * FROM bar` is an example for that, we want to merge `foo` and `bar` into the same
+     * bucket in this case. This is represented by a {@link resolver.StreamResolver} having multiple evaluators attached
+     * to it.
+     *
+     * Finally, we may even be able to re-use buckets between streams. This is not possible in many cases, but can be done
+     * if e.g. one stream is `SELECT * FROM profiles WHERE user = auth.user_id()` and another one is
+     * `SELECT * FROM profiles WHERE user IN (SELECT member FROM orgs WHERE id = auth.parameter('org'))`. Because the
+     * partitioning on `profiles` is the same in both cases, it doesn't matter how the buckets are instantiated.
+     */
+    private evaluatorsToBuckets;
+    private translateStatefulObject;
+    translate(source: CompiledStreamQueries): plan.SyncPlan;
+    private createBucketSource;
+    private translatePartitionKey;
+    private translateRowEvaluator;
+    private translatePointLookup;
+    private translateExpression;
+    private translateStreamResolver;
+    private translateExpandingLookup;
+    private translateParameterValue;
+}

package/dist/compiler/ir_to_sync_plan.js

@@ -0,0 +1,163 @@
+import * as resolver from './bucket_resolver.js';
+import { HashMap, StableHasher, unorderedEquality } from './equality.js';
+import { ColumnInRow } from './expression.js';
+import * as rows from './rows.js';
+import { MapSourceVisitor, visitExpr } from '../sync_plan/expression_visitor.js';
+export class CompilerModelToSyncPlan {
+    static evaluatorHash = unorderedEquality({
+        hash: (hasher, value) => value.buildBehaviorHashCode(hasher),
+        equals: (a, b) => a.behavesIdenticalTo(b)
+    });
+    mappedObjects = new Map();
+    buckets = [];
+    /**
+     * Mapping of row evaluators to buckets.
+     *
+     * One might expect one stream to result in one bucket, but that is not generally the case. First, a stream might
+     * define multiple buckets. For instance, `SELECT * FROM notes WHERE notes.is_public OR auth.parameter('admin')`
+     * requires two buckets since there are different ways a row in `notes` might be synced (we have one bucket with
+     * public notes and one bucket of all notes, and then decide which ones a given user has access to by inspecting the
+     * token).
+     *
+     * Further, a stream might have multiple evaluators but only a single bucket. A stream with queries
+     * `SELECT * FROM foo` and `SELECT * FROM bar` is an example for that, we want to merge `foo` and `bar` into the same
+     * bucket in this case. This is represented by a {@link resolver.StreamResolver} having multiple evaluators attached
+     * to it.
+     *
+     * Finally, we may even be able to re-use buckets between streams. This is not possible in many cases, but can be done
+     * if e.g. one stream is `SELECT * FROM profiles WHERE user = auth.user_id()` and another one is
+     * `SELECT * FROM profiles WHERE user IN (SELECT member FROM orgs WHERE id = auth.parameter('org'))`. Because the
+     * partitioning on `profiles` is the same in both cases, it doesn't matter how the buckets are instantiated.
+     */
+    evaluatorsToBuckets = new HashMap(CompilerModelToSyncPlan.evaluatorHash);
+    translateStatefulObject(source, map) {
+        const mapped = map();
+        this.mappedObjects.set(source, mapped);
+        return mapped;
+    }
+    translate(source) {
+        const queriersByStream = Object.groupBy(source.resolvers, (r) => r.options.name);
+        return {
+            dataSources: source.evaluators.map((e) => this.translateRowEvaluator(e)),
+            parameterIndexes: source.pointLookups.map((p, i) => this.translatePointLookup(p, i)),
+            // Note: data sources and parameter indexes must be translated first because we reference them in stream
+            // resolvers.
+            streams: Object.values(queriersByStream).map((resolvers) => {
+                return {
+                    stream: resolvers[0].options,
+                    queriers: resolvers.map((e) => this.translateStreamResolver(e))
+                };
+            }),
+            buckets: this.buckets
+        };
+    }
+    createBucketSource(evaluators, uniqueName) {
+        return this.evaluatorsToBuckets.putIfAbsent(evaluators, () => {
+            const hash = StableHasher.hashWith(CompilerModelToSyncPlan.evaluatorHash, evaluators);
+            const source = {
+                hashCode: hash,
+                sources: evaluators.map((e) => this.mappedObjects.get(e)),
+                uniqueName
+            };
+            this.buckets.push(source);
+            return source;
+        });
+    }
+    translatePartitionKey(value) {
+        return { expr: this.translateExpression(value.expression.expression) };
+    }
+    translateRowEvaluator(value) {
+        return this.translateStatefulObject(value, () => {
+            const hasher = new StableHasher();
+            value.buildBehaviorHashCode(hasher);
+            const mapped = {
+                sourceTable: value.tablePattern,
+                hashCode: hasher.buildHashCode(),
+                columns: value.columns.map((e) => {
+                    if (e instanceof rows.StarColumnSource) {
+                        return 'star';
+                    }
+                    else {
+                        return { expr: this.translateExpression(e.expression.expression), alias: e.alias ?? null };
+                    }
+                }),
+                outputTableName: value.outputName,
+                filters: value.filters.map((e) => this.translateExpression(e.expression)),
+                parameters: value.partitionBy.map((e) => this.translatePartitionKey(e))
+            };
+            return mapped;
+        });
+    }
+    translatePointLookup(value, index) {
+        return this.translateStatefulObject(value, () => {
+            const hasher = new StableHasher();
+            value.buildBehaviorHashCode(hasher);
+            return {
+                sourceTable: value.tablePattern,
+                defaultLookupScope: {
+                    // This just needs to be unique, and isn't visible to users (unlike bucket names). We might want to use a
+                    // more stable naming scheme in the future.
+                    lookupName: 'lookup',
+                    queryId: index.toString()
+                },
+                hashCode: hasher.buildHashCode(),
+                outputs: value.result.map((e) => this.translateExpression(e.expression)),
+                filters: value.filters.map((e) => this.translateExpression(e.expression)),
+                parameters: value.partitionBy.map((e) => this.translatePartitionKey(e))
+            };
+        });
+    }
+    translateExpression(expression) {
+        const mapper = new MapSourceVisitor((value) => {
+            if (value instanceof ColumnInRow) {
+                return { column: value.column };
+            }
+            else {
+                return { request: value.source };
+            }
+        });
+        return visitExpr(mapper, expression.node, null);
+    }
+    translateStreamResolver(value) {
+        return {
+            requestFilters: value.requestFilters.map((e) => this.translateExpression(e.expression)),
+            lookupStages: value.lookupStages.map((stage) => {
+                return stage.map((e) => this.translateExpandingLookup(e));
+            }),
+            bucket: this.createBucketSource([...value.resolvedBucket.evaluators], value.uniqueName),
+            sourceInstantiation: value.resolvedBucket.instantiation.map((e) => this.translateParameterValue(e))
+        };
+    }
+    translateExpandingLookup(value) {
+        return this.translateStatefulObject(value, () => {
+            if (value instanceof resolver.ParameterLookup) {
+                return {
+                    type: 'parameter',
+                    lookup: this.mappedObjects.get(value.lookup),
+                    instantiation: value.instantiation.map((e) => this.translateParameterValue(e))
+                };
+            }
+            else {
+                return {
+                    type: 'table_valued',
+                    functionName: value.tableValuedFunction.tableValuedFunctionName,
+                    functionInputs: value.tableValuedFunction.parameters.map((e) => this.translateExpression(e.expression)),
+                    outputs: value.outputs.map((e) => this.translateExpression(e.expression)),
+                    filters: value.filters.map((e) => this.translateExpression(e.expression))
+                };
+            }
+        });
+    }
+    translateParameterValue(value) {
+        if (value instanceof resolver.RequestParameterValue) {
+            return { type: 'request', expr: this.translateExpression(value.expression.expression) };
+        }
+        else if (value instanceof resolver.LookupResultParameterValue) {
+            return { type: 'lookup', resultIndex: value.resultIndex, lookup: this.mappedObjects.get(value.lookup) };
+        }
+        else {
+            return { type: 'intersection', values: value.inner.map((e) => this.translateParameterValue(e)) };
+        }
+    }
+}
+//# sourceMappingURL=ir_to_sync_plan.js.map

package/dist/compiler/ir_to_sync_plan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ir_to_sync_plan.js","sourceRoot":"","sources":["../../src/compiler/ir_to_sync_plan.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,QAAQ,MAAM,sBAAsB,CAAC;AAEjD,OAAO,EAAY,OAAO,EAAE,YAAY,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AACnF,OAAO,EAAE,WAAW,EAAmC,MAAM,iBAAiB,CAAC;AAC/E,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,oCAAoC,CAAC;AAEjF,MAAM,OAAO,uBAAuB;IAC1B,MAAM,CAAU,aAAa,GAAkC,iBAAiB,CAAC;QACvF,IAAI,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,qBAAqB,CAAC,MAAM,CAAC;QAC5D,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC;KAC1C,CAAC,CAAC;IAEK,aAAa,GAAG,IAAI,GAAG,EAAe,CAAC;IACvC,OAAO,GAAkC,EAAE,CAAC;IAEpD;;;;;;;;;;;;;;;;;;OAkBG;IACK,mBAAmB,GAAG,IAAI,OAAO,CACvC,uBAAuB,CAAC,aAAa,CACtC,CAAC;IAEM,uBAAuB,CAAsB,MAAS,EAAE,GAAY;QAC1E,MAAM,MAAM,GAAG,GAAG,EAAE,CAAC;QACrB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACvC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,SAAS,CAAC,MAA6B;QACrC,MAAM,gBAAgB,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAEjF,OAAO;YACL,WAAW,EAAE,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;YACxE,gBAAgB,EAAE,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpF,wGAAwG;YACxG,aAAa;YACb,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE;gBACzD,OAAO;oBACL,MAAM,EAAE,SAAU,CAAC,CAAC,CAAC,CAAC,OAAO;oBAC7B,QAAQ,EAAE,SAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;iBACjE,CAAC;YACJ,CAAC,CAAC;YACF,OAAO,EAAE,IAAI,CAAC,OAAO;SACtB,CAAC;IACJ,CAAC;IAEO,kBAAkB,CAAC,UAA+B,EAAE,UAAkB;QAC5E,OAAO,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,UAAU,EAAE,GAAG,EAAE;YAC3D,MAAM,IAAI,GAAG,YAAY,CAAC,QAAQ,CAAC,uBAAuB,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;YAEtF,MAAM,MAAM,GAAG;gBACb,QAAQ,EAAE,IAAI;gBACd,OAAO,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;gBAC1D,UAAU;aACX,CAAC;YACF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1B,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,qBAAqB,CAAC,KAAwB;QACpD,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;IACzE,CAAC;IAEO,qBAAqB,CAAC,KAAwB;QACpD,OAAO,IAAI,CAAC,uBAAuB,CAAC,KAAK,EAAE,GAAG,EAAE;YAC9C,MAAM,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAClC,KAAK,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG;gBACb,WAAW,EAAE,KAAK,CAAC,YAAY;gBAC/B,QAAQ,EAAE,MAAM,CAAC,aAAa,EAAE;gBAChC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;oBAC/B,IAAI,CAAC,YAAY,IAAI,CAAC,gBAAgB,EAAE,CAAC;wBACvC,OAAO,MAAM,CAAC;oBAChB,CAAC;yBAAM,CAAC;wBACN,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,EAAE,CAAC;oBAC7F,CAAC;gBACH,CAAC,CAAC;gBACF,eAAe,EAAE,KAAK,CAAC,UAAU;gBACjC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBACzE,UAAU,EAAE,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;aACxC,CAAC;YAClC,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,oBAAoB,CAAC,KAAuB,EAAE,KAAa;QACjE,OAAO,IAAI,CAAC,uBAAuB,CAAC,KAAK,EAAE,GAAG,EAAE;YAC9C,MAAM,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAClC,KAAK,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;YACpC,OAAO;gBACL,WAAW,EAAE,KAAK,CAAC,YAAY;gBAC/B,kBAAkB,EAAE;oBAClB,yGAAyG;oBACzG,2CAA2C;oBAC3C,UAAU,EAAE,QAAQ;oBACpB,OAAO,EAAE,KAAK,CAAC,QAAQ,EAAE;iBAC1B;gBACD,QAAQ,EAAE,MAAM,CAAC,aAAa,EAAE;gBAChC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBACxE,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBACzE,UAAU,EAAE,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;aACvB,CAAC;QACrD,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,mBAAmB,CAAmC,UAA0B;QACtF,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAqB,CAAC,KAAK,EAAE,EAAE;YAChE,IAAI,KAAK,YAAY,WAAW,EAAE,CAAC;gBACjC,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAyD,CAAC;YACzF,CAAC;iBAAM,CAAC;gBACN,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,MAAM,EAA0D,CAAC;YAC3F,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAClD,CAAC;IAEO,uBAAuB,CAAC,KAA8B;QAC5D,OAAO;YACL,cAAc,EAAE,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YACvF,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;gBAC7C,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5D,CAAC,CAAC;YACF,MAAM,EAAE,IAAI,CAAC,kBAAkB,CAAC,CAAC,GAAG,KAAK,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC;YACvF,mBAAmB,EAAE,KAAK,CAAC,cAAc,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;SACpG,CAAC;IACJ,CAAC;IAEO,wBAAwB,CAAC,KAA+B;QAC9D,OAAO,IAAI,CAAC,uBAAuB,CAAC,KAAK,EAAE,GAAG,EAAE;YAC9C,IAAI,KAAK,YAAY,QAAQ,CAAC,eAAe,EAAE,CAAC;gBAC9C,OAAO;oBACL,IAAI,EAAE,WAAW;oBACjB,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAE;oBAC7C,aAAa,EAAE,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;iBAC/E,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,OAAO;oBACL,IAAI,EAAE,cAAc;oBACpB,YAAY,EAAE,KAAK,CAAC,mBAAmB,CAAC,uBAAuB;oBAC/D,cAAc,EAAE,KAAK,CAAC,mBAAmB,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;oBACvG,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;oBACzE,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;iBAC1E,CAAC;YACJ,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,uBAAuB,CAAC,KAA8B;QAC5D,IAAI,KAAK,YAAY,QAAQ,CAAC,qBAAqB,EAAE,CAAC;YACpD,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QAC1F,CAAC;aAAM,IAAI,KAAK,YAAY,QAAQ,CAAC,0BAA0B,EAAE,CAAC;YAChE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,MAAO,CAAE,EAAE,CAAC;QAC5G,CAAC;aAAM,CAAC;YACN,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACnG,CAAC;IACH,CAAC"}

package/dist/compiler/parser.d.ts

@@ -0,0 +1,99 @@
+import { Statement } from 'pgsql-ast-parser';
+import { PhysicalSourceResultSet, SourceResultSet } from './table.js';
+import { ColumnSource } from './rows.js';
+import { NodeLocations } from './expression.js';
+import { Or } from './filter.js';
+import { PreparedSubquery } from './sqlite.js';
+import { SqlScope } from './scope.js';
+import { ParsingErrorListener, SyncStreamsCompiler } from './compiler.js';
+/**
+ * A parsed stream query in its canonical form.
+ *
+ * The canonical form of stream queries is as follows:
+ *
+ * ```SQL
+ * SELECT <expr>* FROM sourceTable a
+ *   JOIN table2 b
+ *   -- ... additional joins
+ * WHERE <expr>
+ * ```
+ *
+ * Expressions in the result set must all refer to columns in the {@link sourceTable}.
+ *
+ * Additionally, the where clause is in disjunctive normal form. Inner terms are either scalar expressions only
+ * depending on data from a single source result set, or match clauses.
+ *
+ * Subqueries are not allowed in the canonical form. Instead, they are lowered into joins. So e.g. the query:
+ *
+ * ```SQL
+ * SELECT * FROM users WHERE id IN (SELECT user FROM org WHERE id = auth.user_id())
+ * ```
+ *
+ * would get lowered to:
+ * ```SQL
+ * SELECT tmp0.* FROM users tmp0
+ *   JOIN org tmp1
+ * WHERE tmp0.id = tmp1.user AND tmp1.id = (:auth_token) ->> '$.sub';
+ * ```
+ *
+ * Unlike shown here, this lowering doesn't generate aliases that would have to be applied to expressions though.
+ * References in expressions would get resolved earlier, and they continue being valid after the transformation.
+ */
+export interface ParsedStreamQuery {
+    resultColumns: ColumnSource[];
+    sourceTable: PhysicalSourceResultSet;
+    joined: SourceResultSet[];
+    /**
+     * All filters, in disjunctive normal form (an OR of ANDs).
+     */
+    where: Or;
+}
+export interface StreamQueryParserOptions {
+    compiler: SyncStreamsCompiler;
+    originalText: string;
+    errors: ParsingErrorListener;
+    parentScope: SqlScope;
+    locations: NodeLocations;
+}
+export declare class StreamQueryParser {
+    readonly errors: ParsingErrorListener;
+    private readonly compiler;
+    readonly originalText: string;
+    private readonly statementScope;
+    private readonly resultSets;
+    private readonly subqueryResultSets;
+    private readonly resultColumns;
+    private where;
+    /** The result set for which rows are synced. Set when analyzing result columns. */
+    private primaryResultSet?;
+    private syntheticSubqueryCounter;
+    private nodeLocations;
+    private exprParser;
+    constructor(options: StreamQueryParserOptions);
+    parse(stmt: Statement): ParsedStreamQuery | null;
+    parseAsSubquery(stmt: Statement, columnNames?: string[]): PreparedSubquery | null;
+    private nestedParser;
+    /**
+     * Process the AST of a statement, returning whether it's close enough to a valid select statement to be supported for
+     * sync streams (allowing us to process an invalid statement further to perhaps collect more errors).
+     */
+    private processAst;
+    private addAndTermToWhereClause;
+    private addSubquery;
+    private processFrom;
+    private resolveTableValued;
+    private inferColumnName;
+    private processResultColumns;
+    private parseExpression;
+    private resolveTableName;
+    private resolveSoure;
+    private warnUnsupported;
+    private compileFilterClause;
+    private mapBaseExpression;
+    /**
+     * Emit diagnostics if the expression references data from more than one table, otherwise returns it as a
+     * single-dependency expression.
+     */
+    private mustBeSingleDependency;
+    private extractBooleanOperators;
+}