@rocicorp/zero 0.25.0-canary.6 → 0.25.0-canary.8

package/out/zql/src/builder/like.js

@@ -1,60 +1,53 @@
 import { assertString } from "../../../shared/src/asserts.js";
-export function getLikePredicate(pattern, flags) {
-    const op = getLikeOp(String(pattern), flags);
-    return (lhs) => {
-        assertString(lhs);
-        return op(String(lhs));
-    };
+function getLikePredicate(pattern, flags) {
+  const op = getLikeOp(String(pattern), flags);
+  return (lhs) => {
+    assertString(lhs);
+    return op(String(lhs));
+  };
 }
 function getLikeOp(pattern, flags) {
-    // if lhs does not contain '%' or '_' then it is a simple string comparison.
-    // if it does contain '%' or '_' then it is a regex comparison.
-    // '%' is a wildcard for any number of characters
-    // '_' is a wildcard for a single character
-    // Postgres SQL allows escaping using `\`.
-    if (!/_|%|\\/.test(pattern)) {
-        if (flags === 'i') {
-            const rhsLower = pattern.toLowerCase();
-            return (lhs) => lhs.toLowerCase() === rhsLower;
-        }
-        return (lhs) => lhs === pattern;
+  if (!/_|%|\\/.test(pattern)) {
+    if (flags === "i") {
+      const rhsLower = pattern.toLowerCase();
+      return (lhs) => lhs.toLowerCase() === rhsLower;
     }
-    const re = patternToRegExp(pattern, flags);
-    return (lhs) => re.test(lhs);
+    return (lhs) => lhs === pattern;
+  }
+  const re = patternToRegExp(pattern, flags);
+  return (lhs) => re.test(lhs);
 }
 const specialCharsRe = /[$()*+.?[\]\\^{|}]/;
-function patternToRegExp(source, flags = '') {
-    // There are a few cases:
-    // % => .*
-    // _ => .
-    // \x => \x for any x except special regexp chars
-    // special regexp chars => \special regexp chars
-    let pattern = '^';
-    for (let i = 0; i < source.length; i++) {
-        let c = source[i];
-        switch (c) {
-            case '%':
-                pattern += '.*';
-                break;
-            case '_':
-                pattern += '.';
-                break;
-            // @ts-expect-error fallthrough
-            case '\\':
-                if (i === source.length - 1) {
-                    throw new Error('LIKE pattern must not end with escape character');
-                }
-                i++;
-                c = source[i];
-            // fall through
-            default:
-                if (specialCharsRe.test(c)) {
-                    pattern += '\\';
-                }
-                pattern += c;
-                break;
+function patternToRegExp(source, flags = "") {
+  let pattern = "^";
+  for (let i = 0; i < source.length; i++) {
+    let c = source[i];
+    switch (c) {
+      case "%":
+        pattern += ".*";
+        break;
+      case "_":
+        pattern += ".";
+        break;
+      // @ts-expect-error fallthrough
+      case "\\":
+        if (i === source.length - 1) {
+          throw new Error("LIKE pattern must not end with escape character");
+        }
+        i++;
+        c = source[i];
+      // fall through
+      default:
+        if (specialCharsRe.test(c)) {
+          pattern += "\\";
         }
+        pattern += c;
+        break;
     }
-    return new RegExp(pattern + '$', flags + 'm');
+  }
+  return new RegExp(pattern + "$", flags + "m");
 }
-//# sourceMappingURL=like.js.map
+export {
+  getLikePredicate
+};
+//# sourceMappingURL=like.js.map

package/out/zql/src/builder/like.js.map

@@ -1 +1 @@
-{"version":3,"file":"like.js","sourceRoot":"","sources":["../../../../../zql/src/builder/like.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,YAAY,EAAC,MAAM,gCAAgC,CAAC;AAG5D,MAAM,UAAU,gBAAgB,CAC9B,OAAqB,EACrB,KAAe;IAEf,MAAM,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC;IAC7C,OAAO,CAAC,GAAiB,EAAE,EAAE;QAC3B,YAAY,CAAC,GAAG,CAAC,CAAC;QAClB,OAAO,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IACzB,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,OAAe,EAAE,KAAe;IACjD,4EAA4E;IAC5E,+DAA+D;IAC/D,iDAAiD;IACjD,2CAA2C;IAC3C,0CAA0C;IAE1C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5B,IAAI,KAAK,KAAK,GAAG,EAAE,CAAC;YAClB,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;YACvC,OAAO,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,QAAQ,CAAC;QACzD,CAAC;QACD,OAAO,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,KAAK,OAAO,CAAC;IAC1C,CAAC;IACD,MAAM,EAAE,GAAG,eAAe,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IAC3C,OAAO,CAAC,GAAW,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACvC,CAAC;AAED,MAAM,cAAc,GAAG,oBAAoB,CAAC;AAE5C,SAAS,eAAe,CAAC,MAAc,EAAE,QAAkB,EAAE;IAC3D,yBAAyB;IACzB,UAAU;IACV,SAAS;IACT,iDAAiD;IACjD,gDAAgD;IAChD,IAAI,OAAO,GAAG,GAAG,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAClB,QAAQ,CAAC,EAAE,CAAC;YACV,KAAK,GAAG;gBACN,OAAO,IAAI,IAAI,CAAC;gBAChB,MAAM;YACR,KAAK,GAAG;gBACN,OAAO,IAAI,GAAG,CAAC;gBACf,MAAM;YAER,+BAA+B;YAC/B,KAAK,IAAI;gBACP,IAAI,CAAC,KAAK,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC5B,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;gBACrE,CAAC;gBACD,CAAC,EAAE,CAAC;gBACJ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAEhB,eAAe;YACf;gBACE,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC3B,OAAO,IAAI,IAAI,CAAC;gBAClB,CAAC;gBACD,OAAO,IAAI,CAAC,CAAC;gBAEb,MAAM;QACV,CAAC;IACH,CAAC;IACD,OAAO,IAAI,MAAM,CAAC,OAAO,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,CAAC,CAAC;AAChD,CAAC"}
+{"version":3,"file":"like.js","sources":["../../../../../zql/src/builder/like.ts"],"sourcesContent":["import {assertString} from '../../../shared/src/asserts.ts';\nimport type {NonNullValue, SimplePredicateNoNull} from './filter.ts';\n\nexport function getLikePredicate(\n  pattern: NonNullValue,\n  flags: 'i' | '',\n): SimplePredicateNoNull {\n  const op = getLikeOp(String(pattern), flags);\n  return (lhs: NonNullValue) => {\n    assertString(lhs);\n    return op(String(lhs));\n  };\n}\n\nfunction getLikeOp(pattern: string, flags: 'i' | ''): (lhs: string) => boolean {\n  // if lhs does not contain '%' or '_' then it is a simple string comparison.\n  // if it does contain '%' or '_' then it is a regex comparison.\n  // '%' is a wildcard for any number of characters\n  // '_' is a wildcard for a single character\n  // Postgres SQL allows escaping using `\\`.\n\n  if (!/_|%|\\\\/.test(pattern)) {\n    if (flags === 'i') {\n      const rhsLower = pattern.toLowerCase();\n      return (lhs: string) => lhs.toLowerCase() === rhsLower;\n    }\n    return (lhs: string) => lhs === pattern;\n  }\n  const re = patternToRegExp(pattern, flags);\n  return (lhs: string) => re.test(lhs);\n}\n\nconst specialCharsRe = /[$()*+.?[\\]\\\\^{|}]/;\n\nfunction patternToRegExp(source: string, flags: '' | 'i' = ''): RegExp {\n  // There are a few cases:\n  // % => .*\n  // _ => .\n  // \\x => \\x for any x except special regexp chars\n  // special regexp chars => \\special regexp chars\n  let pattern = '^';\n  for (let i = 0; i < source.length; i++) {\n    let c = source[i];\n    switch (c) {\n      case '%':\n        pattern += '.*';\n        break;\n      case '_':\n        pattern += '.';\n        break;\n\n      // @ts-expect-error fallthrough\n      case '\\\\':\n        if (i === source.length - 1) {\n          throw new Error('LIKE pattern must not end with escape character');\n        }\n        i++;\n        c = source[i];\n\n      // fall through\n      default:\n        if (specialCharsRe.test(c)) {\n          pattern += '\\\\';\n        }\n        pattern += c;\n\n        break;\n    }\n  }\n  return new RegExp(pattern + '$', flags + 'm');\n}\n"],"names":[],"mappings":";AAGO,SAAS,iBACd,SACA,OACuB;AACvB,QAAM,KAAK,UAAU,OAAO,OAAO,GAAG,KAAK;AAC3C,SAAO,CAAC,QAAsB;AAC5B,iBAAa,GAAG;AAChB,WAAO,GAAG,OAAO,GAAG,CAAC;AAAA,EACvB;AACF;AAEA,SAAS,UAAU,SAAiB,OAA2C;AAO7E,MAAI,CAAC,SAAS,KAAK,OAAO,GAAG;AAC3B,QAAI,UAAU,KAAK;AACjB,YAAM,WAAW,QAAQ,YAAA;AACzB,aAAO,CAAC,QAAgB,IAAI,YAAA,MAAkB;AAAA,IAChD;AACA,WAAO,CAAC,QAAgB,QAAQ;AAAA,EAClC;AACA,QAAM,KAAK,gBAAgB,SAAS,KAAK;AACzC,SAAO,CAAC,QAAgB,GAAG,KAAK,GAAG;AACrC;AAEA,MAAM,iBAAiB;AAEvB,SAAS,gBAAgB,QAAgB,QAAkB,IAAY;AAMrE,MAAI,UAAU;AACd,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAI,IAAI,OAAO,CAAC;AAChB,YAAQ,GAAA;AAAA,MACN,KAAK;AACH,mBAAW;AACX;AAAA,MACF,KAAK;AACH,mBAAW;AACX;AAAA;AAAA,MAGF,KAAK;AACH,YAAI,MAAM,OAAO,SAAS,GAAG;AAC3B,gBAAM,IAAI,MAAM,iDAAiD;AAAA,QACnE;AACA;AACA,YAAI,OAAO,CAAC;AAAA;AAAA,MAGd;AACE,YAAI,eAAe,KAAK,CAAC,GAAG;AAC1B,qBAAW;AAAA,QACb;AACA,mBAAW;AAEX;AAAA,IAAA;AAAA,EAEN;AACA,SAAO,IAAI,OAAO,UAAU,KAAK,QAAQ,GAAG;AAC9C;"}

package/out/zql/src/error.d.ts

@@ -1,4 +1,9 @@
 export declare class NotImplementedError extends Error {
     constructor(message: string);
 }
+export type PlannerExceptionKind = 'max_flippable_joins';
+export declare class PlannerException extends Error {
+    readonly kind: PlannerExceptionKind;
+    constructor(kind: PlannerExceptionKind, message: string);
+}
 //# sourceMappingURL=error.d.ts.map

package/out/zql/src/error.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"error.d.ts","sourceRoot":"","sources":["../../../../zql/src/error.ts"],"names":[],"mappings":"AAAA,qBAAa,mBAAoB,SAAQ,KAAK;gBAChC,OAAO,EAAE,MAAM;CAI5B"}
+{"version":3,"file":"error.d.ts","sourceRoot":"","sources":["../../../../zql/src/error.ts"],"names":[],"mappings":"AAAA,qBAAa,mBAAoB,SAAQ,KAAK;gBAChC,OAAO,EAAE,MAAM;CAI5B;AAED,MAAM,MAAM,oBAAoB,GAAG,qBAAqB,CAAC;AAEzD,qBAAa,gBAAiB,SAAQ,KAAK;IACzC,QAAQ,CAAC,IAAI,EAAE,oBAAoB,CAAC;gBAExB,IAAI,EAAE,oBAAoB,EAAE,OAAO,EAAE,MAAM;CAKxD"}

package/out/zql/src/error.js

@@ -1,7 +1,19 @@
-export class NotImplementedError extends Error {
-    constructor(message) {
-        super(message);
-        this.name = 'NotImplementedError';
-    }
+class NotImplementedError extends Error {
+  constructor(message) {
+    super(message);
+    this.name = "NotImplementedError";
+  }
 }
-//# sourceMappingURL=error.js.map
+class PlannerException extends Error {
+  kind;
+  constructor(kind, message) {
+    super(message);
+    this.name = "PlannerException";
+    this.kind = kind;
+  }
+}
+export {
+  NotImplementedError,
+  PlannerException
+};
+//# sourceMappingURL=error.js.map

package/out/zql/src/error.js.map

@@ -1 +1 @@
-{"version":3,"file":"error.js","sourceRoot":"","sources":["../../../../zql/src/error.ts"],"names":[],"mappings":"AAAA,MAAM,OAAO,mBAAoB,SAAQ,KAAK;IAC5C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,qBAAqB,CAAC;IACpC,CAAC;CACF"}
+{"version":3,"file":"error.js","sources":["../../../../zql/src/error.ts"],"sourcesContent":["export class NotImplementedError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'NotImplementedError';\n  }\n}\n\nexport type PlannerExceptionKind = 'max_flippable_joins';\n\nexport class PlannerException extends Error {\n  readonly kind: PlannerExceptionKind;\n\n  constructor(kind: PlannerExceptionKind, message: string) {\n    super(message);\n    this.name = 'PlannerException';\n    this.kind = kind;\n  }\n}\n"],"names":[],"mappings":"AAAO,MAAM,4BAA4B,MAAM;AAAA,EAC7C,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAIO,MAAM,yBAAyB,MAAM;AAAA,EACjC;AAAA,EAET,YAAY,MAA4B,SAAiB;AACvD,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,SAAK,OAAO;AAAA,EACd;AACF;"}

package/out/zql/src/ivm/array-view.js

@@ -1,99 +1,93 @@
 import { assert } from "../../../shared/src/asserts.js";
 import { applyChange } from "./view-apply-change.js";
-/**
- * Implements a materialized view of the output of an operator.
- *
- * It might seem more efficient to use an immutable b-tree for the
- * materialization, but it's not so clear. Inserts in the middle are
- * asymptotically slower in an array, but can often be done with zero
- * allocations, where changes to the b-tree will often require several allocs.
- *
- * Also the plain array view is more convenient for consumers since you can dump
- * it into console to see what it is, rather than having to iterate it.
- */
-export class ArrayView {
-    #input;
-    #listeners = new Set();
-    #schema;
-    #format;
-    // Synthetic "root" entry that has a single "" relationship, so that we can
-    // treat all changes, including the root change, generically.
-    #root;
-    onDestroy;
-    #dirty = false;
-    #resultType = 'unknown';
-    #error;
-    #updateTTL;
-    constructor(input, format, queryComplete, updateTTL) {
-        this.#input = input;
-        this.#schema = input.getSchema();
-        this.#format = format;
-        this.#updateTTL = updateTTL;
-        this.#root = { '': format.singular ? undefined : [] };
-        input.setOutput(this);
-        if (queryComplete === true) {
-            this.#resultType = 'complete';
-        }
-        else if ('error' in queryComplete) {
-            this.#resultType = 'error';
-            this.#error = queryComplete;
-        }
-        else {
-            void queryComplete
-                .then(() => {
-                this.#resultType = 'complete';
-                this.#fireListeners();
-            })
-                .catch(e => {
-                this.#resultType = 'error';
-                this.#error = e;
-                this.#fireListeners();
-            });
-        }
-        this.#hydrate();
-    }
-    get data() {
-        return this.#root[''];
-    }
-    addListener(listener) {
-        assert(!this.#listeners.has(listener), 'Listener already registered');
-        this.#listeners.add(listener);
-        this.#fireListener(listener);
-        return () => {
-            this.#listeners.delete(listener);
-        };
-    }
-    #fireListeners() {
-        for (const listener of this.#listeners) {
-            this.#fireListener(listener);
-        }
-    }
-    #fireListener(listener) {
-        listener(this.data, this.#resultType, this.#error);
-    }
-    destroy() {
-        this.onDestroy?.();
-    }
-    #hydrate() {
-        this.#dirty = true;
-        for (const node of this.#input.fetch({})) {
-            applyChange(this.#root, { type: 'add', node }, this.#schema, '', this.#format);
-        }
-        this.flush();
+class ArrayView {
+  #input;
+  #listeners = /* @__PURE__ */ new Set();
+  #schema;
+  #format;
+  // Synthetic "root" entry that has a single "" relationship, so that we can
+  // treat all changes, including the root change, generically.
+  #root;
+  onDestroy;
+  #dirty = false;
+  #resultType = "unknown";
+  #error;
+  #updateTTL;
+  constructor(input, format, queryComplete, updateTTL) {
+    this.#input = input;
+    this.#schema = input.getSchema();
+    this.#format = format;
+    this.#updateTTL = updateTTL;
+    this.#root = { "": format.singular ? void 0 : [] };
+    input.setOutput(this);
+    if (queryComplete === true) {
+      this.#resultType = "complete";
+    } else if ("error" in queryComplete) {
+      this.#resultType = "error";
+      this.#error = queryComplete;
+    } else {
+      void queryComplete.then(() => {
+        this.#resultType = "complete";
+        this.#fireListeners();
+      }).catch((e) => {
+        this.#resultType = "error";
+        this.#error = e;
+        this.#fireListeners();
+      });
     }
-    push(change) {
-        this.#dirty = true;
-        applyChange(this.#root, change, this.#schema, '', this.#format);
+    this.#hydrate();
+  }
+  get data() {
+    return this.#root[""];
+  }
+  addListener(listener) {
+    assert(!this.#listeners.has(listener), "Listener already registered");
+    this.#listeners.add(listener);
+    this.#fireListener(listener);
+    return () => {
+      this.#listeners.delete(listener);
+    };
+  }
+  #fireListeners() {
+    for (const listener of this.#listeners) {
+      this.#fireListener(listener);
     }
-    flush() {
-        if (!this.#dirty) {
-            return;
-        }
-        this.#dirty = false;
-        this.#fireListeners();
+  }
+  #fireListener(listener) {
+    listener(this.data, this.#resultType, this.#error);
+  }
+  destroy() {
+    this.onDestroy?.();
+  }
+  #hydrate() {
+    this.#dirty = true;
+    for (const node of this.#input.fetch({})) {
+      applyChange(
+        this.#root,
+        { type: "add", node },
+        this.#schema,
+        "",
+        this.#format
+      );
     }
-    updateTTL(ttl) {
-        this.#updateTTL(ttl);
+    this.flush();
+  }
+  push(change) {
+    this.#dirty = true;
+    applyChange(this.#root, change, this.#schema, "", this.#format);
+  }
+  flush() {
+    if (!this.#dirty) {
+      return;
     }
+    this.#dirty = false;
+    this.#fireListeners();
+  }
+  updateTTL(ttl) {
+    this.#updateTTL(ttl);
+  }
 }
-//# sourceMappingURL=array-view.js.map
+export {
+  ArrayView
+};
+//# sourceMappingURL=array-view.js.map

package/out/zql/src/ivm/array-view.js.map

@@ -1 +1 @@
-{"version":3,"file":"array-view.js","sourceRoot":"","sources":["../../../../../zql/src/ivm/array-view.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AAQtD,OAAO,EAAC,WAAW,EAAC,MAAM,wBAAwB,CAAC;AAGnD;;;;;;;;;;GAUG;AACH,MAAM,OAAO,SAAS;IACX,MAAM,CAAQ;IACd,UAAU,GAAG,IAAI,GAAG,EAAe,CAAC;IACpC,OAAO,CAAe;IACtB,OAAO,CAAS;IAEzB,2EAA2E;IAC3E,6DAA6D;IACpD,KAAK,CAAQ;IAEtB,SAAS,CAA2B;IAEpC,MAAM,GAAG,KAAK,CAAC;IACf,WAAW,GAAe,SAAS,CAAC;IACpC,MAAM,CAA2B;IACxB,UAAU,CAAqB;IAExC,YACE,KAAY,EACZ,MAAc,EACd,aAAkD,EAClD,SAA6B;QAE7B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,KAAK,GAAG,EAAC,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAC,CAAC;QACpD,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAEtB,IAAI,aAAa,KAAK,IAAI,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAChC,CAAC;aAAM,IAAI,OAAO,IAAI,aAAa,EAAE,CAAC;YACpC,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC;YAC3B,IAAI,CAAC,MAAM,GAAG,aAAa,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,KAAK,aAAa;iBACf,IAAI,CAAC,GAAG,EAAE;gBACT,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;gBAC9B,IAAI,CAAC,cAAc,EAAE,CAAC;YACxB,CAAC,CAAC;iBACD,KAAK,CAAC,CAAC,CAAC,EAAE;gBACT,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC;gBAC3B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBAChB,IAAI,CAAC,cAAc,EAAE,CAAC;YACxB,CAAC,CAAC,CAAC;QACP,CAAC;QACD,IAAI,CAAC,QAAQ,EAAE,CAAC;IAClB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,CAAM,CAAC;IAC7B,CAAC;IAED,WAAW,CAAC,QAAqB;QAC/B,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,6BAA6B,CAAC,CAAC;QACtE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAE9B,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAE7B,OAAO,GAAG,EAAE;YACV,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACnC,CAAC,CAAC;IACJ,CAAC;IAED,cAAc;QACZ,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACvC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,aAAa,CAAC,QAAqB;QACjC,QAAQ,CAAC,IAAI,CAAC,IAAoB,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACrE,CAAC;IAED,OAAO;QACL,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;IACrB,CAAC;IAED,QAAQ;QACN,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YACzC,WAAW,CACT,IAAI,CAAC,KAAK,EACV,EAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAC,EACnB,IAAI,CAAC,OAAO,EACZ,EAAE,EACF,IAAI,CAAC,OAAO,CACb,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,IAAI,CAAC,MAAc;QACjB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAClE,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,cAAc,EAAE,CAAC;IACxB,CAAC;IAED,SAAS,CAAC,GAAQ;QAChB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;CACF"}
+{"version":3,"file":"array-view.js","sources":["../../../../../zql/src/ivm/array-view.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport type {Immutable} from '../../../shared/src/immutable.ts';\nimport type {ErroredQuery} from '../../../zero-protocol/src/custom-queries.ts';\nimport type {TTL} from '../query/ttl.ts';\nimport type {Listener, ResultType, TypedView} from '../query/typed-view.ts';\nimport type {Change} from './change.ts';\nimport type {Input, Output} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {applyChange} from './view-apply-change.ts';\nimport type {Entry, Format, View} from './view.ts';\n\n/**\n * Implements a materialized view of the output of an operator.\n *\n * It might seem more efficient to use an immutable b-tree for the\n * materialization, but it's not so clear. Inserts in the middle are\n * asymptotically slower in an array, but can often be done with zero\n * allocations, where changes to the b-tree will often require several allocs.\n *\n * Also the plain array view is more convenient for consumers since you can dump\n * it into console to see what it is, rather than having to iterate it.\n */\nexport class ArrayView<V extends View> implements Output, TypedView<V> {\n  readonly #input: Input;\n  readonly #listeners = new Set<Listener<V>>();\n  readonly #schema: SourceSchema;\n  readonly #format: Format;\n\n  // Synthetic \"root\" entry that has a single \"\" relationship, so that we can\n  // treat all changes, including the root change, generically.\n  readonly #root: Entry;\n\n  onDestroy: (() => void) | undefined;\n\n  #dirty = false;\n  #resultType: ResultType = 'unknown';\n  #error: ErroredQuery | undefined;\n  readonly #updateTTL: (ttl: TTL) => void;\n\n  constructor(\n    input: Input,\n    format: Format,\n    queryComplete: true | ErroredQuery | Promise<true>,\n    updateTTL: (ttl: TTL) => void,\n  ) {\n    this.#input = input;\n    this.#schema = input.getSchema();\n    this.#format = format;\n    this.#updateTTL = updateTTL;\n    this.#root = {'': format.singular ? undefined : []};\n    input.setOutput(this);\n\n    if (queryComplete === true) {\n      this.#resultType = 'complete';\n    } else if ('error' in queryComplete) {\n      this.#resultType = 'error';\n      this.#error = queryComplete;\n    } else {\n      void queryComplete\n        .then(() => {\n          this.#resultType = 'complete';\n          this.#fireListeners();\n        })\n        .catch(e => {\n          this.#resultType = 'error';\n          this.#error = e;\n          this.#fireListeners();\n        });\n    }\n    this.#hydrate();\n  }\n\n  get data() {\n    return this.#root[''] as V;\n  }\n\n  addListener(listener: Listener<V>) {\n    assert(!this.#listeners.has(listener), 'Listener already registered');\n    this.#listeners.add(listener);\n\n    this.#fireListener(listener);\n\n    return () => {\n      this.#listeners.delete(listener);\n    };\n  }\n\n  #fireListeners() {\n    for (const listener of this.#listeners) {\n      this.#fireListener(listener);\n    }\n  }\n\n  #fireListener(listener: Listener<V>) {\n    listener(this.data as Immutable<V>, this.#resultType, this.#error);\n  }\n\n  destroy() {\n    this.onDestroy?.();\n  }\n\n  #hydrate() {\n    this.#dirty = true;\n    for (const node of this.#input.fetch({})) {\n      applyChange(\n        this.#root,\n        {type: 'add', node},\n        this.#schema,\n        '',\n        this.#format,\n      );\n    }\n    this.flush();\n  }\n\n  push(change: Change): void {\n    this.#dirty = true;\n    applyChange(this.#root, change, this.#schema, '', this.#format);\n  }\n\n  flush() {\n    if (!this.#dirty) {\n      return;\n    }\n    this.#dirty = false;\n    this.#fireListeners();\n  }\n\n  updateTTL(ttl: TTL) {\n    this.#updateTTL(ttl);\n  }\n}\n"],"names":[],"mappings":";;AAsBO,MAAM,UAA0D;AAAA,EAC5D;AAAA,EACA,iCAAiB,IAAA;AAAA,EACjB;AAAA,EACA;AAAA;AAAA;AAAA,EAIA;AAAA,EAET;AAAA,EAEA,SAAS;AAAA,EACT,cAA0B;AAAA,EAC1B;AAAA,EACS;AAAA,EAET,YACE,OACA,QACA,eACA,WACA;AACA,SAAK,SAAS;AACd,SAAK,UAAU,MAAM,UAAA;AACrB,SAAK,UAAU;AACf,SAAK,aAAa;AAClB,SAAK,QAAQ,EAAC,IAAI,OAAO,WAAW,SAAY,GAAC;AACjD,UAAM,UAAU,IAAI;AAEpB,QAAI,kBAAkB,MAAM;AAC1B,WAAK,cAAc;AAAA,IACrB,WAAW,WAAW,eAAe;AACnC,WAAK,cAAc;AACnB,WAAK,SAAS;AAAA,IAChB,OAAO;AACL,WAAK,cACF,KAAK,MAAM;AACV,aAAK,cAAc;AACnB,aAAK,eAAA;AAAA,MACP,CAAC,EACA,MAAM,CAAA,MAAK;AACV,aAAK,cAAc;AACnB,aAAK,SAAS;AACd,aAAK,eAAA;AAAA,MACP,CAAC;AAAA,IACL;AACA,SAAK,SAAA;AAAA,EACP;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,KAAK,MAAM,EAAE;AAAA,EACtB;AAAA,EAEA,YAAY,UAAuB;AACjC,WAAO,CAAC,KAAK,WAAW,IAAI,QAAQ,GAAG,6BAA6B;AACpE,SAAK,WAAW,IAAI,QAAQ;AAE5B,SAAK,cAAc,QAAQ;AAE3B,WAAO,MAAM;AACX,WAAK,WAAW,OAAO,QAAQ;AAAA,IACjC;AAAA,EACF;AAAA,EAEA,iBAAiB;AACf,eAAW,YAAY,KAAK,YAAY;AACtC,WAAK,cAAc,QAAQ;AAAA,IAC7B;AAAA,EACF;AAAA,EAEA,cAAc,UAAuB;AACnC,aAAS,KAAK,MAAsB,KAAK,aAAa,KAAK,MAAM;AAAA,EACnE;AAAA,EAEA,UAAU;AACR,SAAK,YAAA;AAAA,EACP;AAAA,EAEA,WAAW;AACT,SAAK,SAAS;AACd,eAAW,QAAQ,KAAK,OAAO,MAAM,CAAA,CAAE,GAAG;AACxC;AAAA,QACE,KAAK;AAAA,QACL,EAAC,MAAM,OAAO,KAAA;AAAA,QACd,KAAK;AAAA,QACL;AAAA,QACA,KAAK;AAAA,MAAA;AAAA,IAET;AACA,SAAK,MAAA;AAAA,EACP;AAAA,EAEA,KAAK,QAAsB;AACzB,SAAK,SAAS;AACd,gBAAY,KAAK,OAAO,QAAQ,KAAK,SAAS,IAAI,KAAK,OAAO;AAAA,EAChE;AAAA,EAEA,QAAQ;AACN,QAAI,CAAC,KAAK,QAAQ;AAChB;AAAA,IACF;AACA,SAAK,SAAS;AACd,SAAK,eAAA;AAAA,EACP;AAAA,EAEA,UAAU,KAAU;AAClB,SAAK,WAAW,GAAG;AAAA,EACrB;AACF;"}

package/out/zql/src/ivm/constraint.js

@@ -1,141 +1,88 @@
 import { assert } from "../../../shared/src/asserts.js";
 import { stringCompare } from "../../../shared/src/string-compare.js";
 import { valuesEqual } from "./data.js";
-export function constraintMatchesRow(constraint, row) {
-    for (const key in constraint) {
-        if (!valuesEqual(row[key], constraint[key])) {
-            return false;
-        }
+function constraintMatchesRow(constraint, row) {
+  for (const key in constraint) {
+    if (!valuesEqual(row[key], constraint[key])) {
+      return false;
     }
-    return true;
+  }
+  return true;
 }
-/**
- * Constraints are compatible if:
- * 1. They do not have any keys in common
- * 2. They have keys in common, but the values for those keys are equal
- */
-export function constraintsAreCompatible(left, right) {
-    for (const key in left) {
-        if (key in right && !valuesEqual(left[key], right[key])) {
-            return false;
-        }
+function constraintsAreCompatible(left, right) {
+  for (const key in left) {
+    if (key in right && !valuesEqual(left[key], right[key])) {
+      return false;
     }
-    return true;
+  }
+  return true;
 }
-export function constraintMatchesPrimaryKey(constraint, primary) {
-    return keyMatchesPrimaryKey(Object.keys(constraint), primary);
+function constraintMatchesPrimaryKey(constraint, primary) {
+  return keyMatchesPrimaryKey(Object.keys(constraint), primary);
 }
-export function keyMatchesPrimaryKey(key, primary) {
-    const constraintKeys = [...key];
-    if (constraintKeys.length !== primary.length) {
-        return false;
-    }
-    // Primary key is always sorted
-    // Constraint does not have to be sorted
-    constraintKeys.sort(stringCompare);
-    for (let i = 0; i < constraintKeys.length; i++) {
-        if (constraintKeys[i] !== primary[i]) {
-            return false;
-        }
-    }
-    return true;
+function keyMatchesPrimaryKey(key, primary) {
+  const constraintKeys = [...key];
+  if (constraintKeys.length !== primary.length) {
+    return false;
+  }
+  constraintKeys.sort(stringCompare);
+  for (let i = 0; i < constraintKeys.length; i++) {
+    if (constraintKeys[i] !== primary[i]) {
+      return false;
+    }
+  }
+  return true;
 }
-/**
- * Pulls top level `and` components out of a condition tree.
- * The resulting array of simple conditions would match a superset of
- * values that the original condition would match.
- *
- * Examples:
- * a AND b OR c
- *
- * In this case we cannot pull anything because the `or` is at the top level.
- *
- * a AND b AND c
- * We can pull all three.
- *
- * a AND (b OR c)
- * We can only pull `a`.
- */
-export function pullSimpleAndComponents(condition) {
-    if (condition.type === 'and') {
-        return condition.conditions.flatMap(pullSimpleAndComponents);
-    }
-    if (condition.type === 'simple') {
-        return [condition];
-    }
-    if (condition.type === 'or' && condition.conditions.length === 1) {
-        return pullSimpleAndComponents(condition.conditions[0]);
-    }
-    return [];
+function pullSimpleAndComponents(condition) {
+  if (condition.type === "and") {
+    return condition.conditions.flatMap(pullSimpleAndComponents);
+  }
+  if (condition.type === "simple") {
+    return [condition];
+  }
+  if (condition.type === "or" && condition.conditions.length === 1) {
+    return pullSimpleAndComponents(condition.conditions[0]);
+  }
+  return [];
 }
-/**
- * Checks if the supplied filters constitute a primary key lookup.
- * If so, returns the constraint that would be used to look up the primary key.
- * If not, returns undefined.
- */
-export function primaryKeyConstraintFromFilters(condition, primary) {
-    if (condition === undefined) {
-        return undefined;
-    }
-    const conditions = pullSimpleAndComponents(condition);
-    if (conditions.length === 0) {
-        return undefined;
-    }
-    const ret = {};
-    for (const subCondition of conditions) {
-        if (subCondition.op === '=') {
-            const column = extractColumn(subCondition);
-            if (column !== undefined) {
-                if (!primary.includes(column.name)) {
-                    continue;
-                }
-                ret[column.name] = column.value;
-            }
+function primaryKeyConstraintFromFilters(condition, primary) {
+  if (condition === void 0) {
+    return void 0;
+  }
+  const conditions = pullSimpleAndComponents(condition);
+  if (conditions.length === 0) {
+    return void 0;
+  }
+  const ret = {};
+  for (const subCondition of conditions) {
+    if (subCondition.op === "=") {
+      const column = extractColumn(subCondition);
+      if (column !== void 0) {
+        if (!primary.includes(column.name)) {
+          continue;
         }
-    }
-    if (Object.keys(ret).length !== primary.length) {
-        return undefined;
-    }
-    return ret;
+        ret[column.name] = column.value;
+      }
+    }
+  }
+  if (Object.keys(ret).length !== primary.length) {
+    return void 0;
+  }
+  return ret;
 }
 function extractColumn(condition) {
-    if (condition.left.type === 'column') {
-        assert(condition.right.type === 'literal');
-        return { name: condition.left.name, value: condition.right.value };
-    }
-    return undefined;
-}
-export class SetOfConstraint {
-    #data = [];
-    constructor() {
-        // Only used in testing
-        assert(TESTING);
-    }
-    #indexOf(value) {
-        return this.#data.findIndex(v => constraintEquals(v, value));
-    }
-    has(value) {
-        return this.#indexOf(value) !== -1;
-    }
-    add(value) {
-        if (!this.has(value)) {
-            this.#data.push(value);
-        }
-        return this;
-    }
-}
-function constraintEquals(a, b) {
-    const aEntries = Object.entries(a);
-    const bEntries = Object.entries(b);
-    if (aEntries.length !== bEntries.length) {
-        return false;
-    }
-    for (let i = 0; i < aEntries.length; i++) {
-        if (aEntries[i][0] !== bEntries[i][0] ||
-            !valuesEqual(aEntries[i][1], bEntries[i][1])) {
-            return false;
-        }
-    }
-    return true;
+  if (condition.left.type === "column") {
+    assert(condition.right.type === "literal");
+    return { name: condition.left.name, value: condition.right.value };
+  }
+  return void 0;
 }
-//# sourceMappingURL=constraint.js.map
+export {
+  constraintMatchesPrimaryKey,
+  constraintMatchesRow,
+  constraintsAreCompatible,
+  keyMatchesPrimaryKey,
+  primaryKeyConstraintFromFilters,
+  pullSimpleAndComponents
+};
+//# sourceMappingURL=constraint.js.map