@rocicorp/zero 0.5.2024110200 → 0.6.2024111700

package/out/zero-schema/src/normalize-table-schema.js

@@ -1,116 +0,0 @@
-import { assert } from '../../shared/src/asserts.js';
-import { sortedEntries } from '../../shared/src/sorted-entries.js';
-import { isFieldRelationship, } from './table-schema.js';
-export class NormalizedTableSchema {
-    tableName;
-    primaryKey;
-    columns;
-    relationships;
-    constructor(tableSchema, tableSchemaCache) {
-        this.tableName = tableSchema.tableName;
-        const primaryKey = normalizePrimaryKey(tableSchema.primaryKey);
-        this.primaryKey = primaryKey;
-        this.columns = normalizeColumns(tableSchema.columns, primaryKey);
-        tableSchemaCache.set(tableSchema, this);
-        this.relationships = normalizeRelationships(tableSchema.relationships, tableSchemaCache);
-    }
-}
-export function normalizeTableSchema(tableSchema) {
-    return normalizeTableSchemaWithCache(tableSchema, tableSchema.tableName, new Map());
-}
-export function normalizeTableSchemaWithCache(tableSchema, expectedName, tableSchemaCache) {
-    if (tableSchema instanceof NormalizedTableSchema) {
-        return tableSchema;
-    }
-    assert(tableSchema.tableName === expectedName, `Table name mismatch: "${tableSchema.tableName}" !== "${expectedName}"`);
-    let normalizedTableSchema = tableSchemaCache.get(tableSchema);
-    if (normalizedTableSchema) {
-        return normalizedTableSchema;
-    }
-    normalizedTableSchema = new NormalizedTableSchema(tableSchema, tableSchemaCache);
-    return normalizedTableSchema;
-}
-function isSorted(arr) {
-    for (let i = 1; i < arr.length; i++) {
-        if (arr[i - 1] >= arr[i]) {
-            return false;
-        }
-    }
-    return true;
-}
-function assertNoDuplicates(arr) {
-    // arr is already sorted.
-    for (let i = 1; i < arr.length; i++) {
-        assert(arr[i - 1] !== arr[i], 'Primary key must not contain duplicates');
-    }
-}
-export function normalizePrimaryKey(arr) {
-    if (isSorted(arr)) {
-        return arr;
-    }
-    arr = [...arr].sort();
-    assertNoDuplicates(arr);
-    return arr;
-}
-function normalizeColumns(columns, primaryKey) {
-    const rv = {};
-    for (const pk of primaryKey) {
-        const schemaValue = columns[pk];
-        assert(schemaValue, `Primary key column "${pk}" not found`);
-        const { type, optional } = schemaValue;
-        assert(!optional, `Primary key column "${pk}" cannot be optional`);
-        assert(type === 'string' || type === 'number' || type === 'boolean', `Primary key column "${pk}" must be a string, number, or boolean. Got ${type}`);
-    }
-    for (const [name, column] of sortedEntries(columns)) {
-        rv[name] = normalizeSchemaValue(column);
-    }
-    return rv;
-}
-function normalizeSchemaValue(value) {
-    return {
-        type: value.type,
-        optional: value.optional ?? false,
-    };
-}
-function normalizeRelationships(relationships, tableSchemaCache) {
-    const rv = {};
-    for (const [name, relationship] of sortedEntries(relationships)) {
-        rv[name] = normalizeRelationship(relationship, tableSchemaCache);
-    }
-    return rv;
-}
-function normalizeRelationship(relationship, tableSchemaCache) {
-    if (isFieldRelationship(relationship)) {
-        return normalizeFieldRelationship(relationship, tableSchemaCache);
-    }
-    return normalizeJunctionRelationship(relationship, tableSchemaCache);
-}
-function normalizeFieldRelationship(relationship, tableSchemaCache) {
-    return {
-        source: relationship.source,
-        dest: {
-            field: relationship.dest.field,
-            schema: normalizeLazyTableSchema(relationship.dest.schema, tableSchemaCache),
-        },
-    };
-}
-function normalizeJunctionRelationship(relationship, tableSchemaCache) {
-    return {
-        source: relationship.source,
-        junction: {
-            sourceField: relationship.junction.sourceField,
-            destField: relationship.junction.destField,
-            schema: normalizeLazyTableSchema(relationship.junction.schema, tableSchemaCache),
-        },
-        dest: {
-            field: relationship.dest.field,
-            schema: normalizeLazyTableSchema(relationship.dest.schema, tableSchemaCache),
-        },
-    };
-}
-function normalizeLazyTableSchema(tableSchema, buildCache) {
-    const tableSchemaInstance = typeof tableSchema === 'function' ? tableSchema() : tableSchema;
-    return normalizeTableSchemaWithCache(tableSchemaInstance, tableSchemaInstance.tableName, // Don't care about name here.
-    buildCache);
-}
-//# sourceMappingURL=normalize-table-schema.js.map

package/out/zero-schema/src/normalize-table-schema.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"normalize-table-schema.js","sourceRoot":"","sources":["../../../../zero-schema/src/normalize-table-schema.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,6BAA6B,CAAC;AACnD,OAAO,EAAC,aAAa,EAAC,MAAM,oCAAoC,CAAC;AAGjE,OAAO,EAEL,mBAAmB,GAIpB,MAAM,mBAAmB,CAAC;AAY3B,MAAM,OAAO,qBAAqB;IAEvB,SAAS,CAAS;IAClB,UAAU,CAAuB;IACjC,OAAO,CAA8B;IACrC,aAAa,CAAoD;IAE1E,YAAY,WAAwB,EAAE,gBAAkC;QACtE,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,SAAS,CAAC;QACvC,MAAM,UAAU,GAAG,mBAAmB,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAC/D,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,OAAO,GAAG,gBAAgB,CAAC,WAAW,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACjE,gBAAgB,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;QACxC,IAAI,CAAC,aAAa,GAAG,sBAAsB,CACzC,WAAW,CAAC,aAAa,EACzB,gBAAgB,CACjB,CAAC;IACJ,CAAC;CACF;AAED,MAAM,UAAU,oBAAoB,CAClC,WAAgD;IAEhD,OAAO,6BAA6B,CAClC,WAAW,EACX,WAAW,CAAC,SAAS,EACrB,IAAI,GAAG,EAAE,CACV,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,6BAA6B,CAC3C,WAAgD,EAChD,YAAoB,EACpB,gBAAkC;IAElC,IAAI,WAAW,YAAY,qBAAqB,EAAE,CAAC;QACjD,OAAO,WAAW,CAAC;IACrB,CAAC;IACD,MAAM,CACJ,WAAW,CAAC,SAAS,KAAK,YAAY,EACtC,yBAAyB,WAAW,CAAC,SAAS,UAAU,YAAY,GAAG,CACxE,CAAC;IAEF,IAAI,qBAAqB,GAAG,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAC9D,IAAI,qBAAqB,EAAE,CAAC;QAC1B,OAAO,qBAA8C,CAAC;IACxD,CAAC;IAED,qBAAqB,GAAG,IAAI,qBAAqB,CAC/C,WAAW,EACX,gBAAgB,CACjB,CAAC;IACF,OAAO,qBAA8C,CAAC;AACxD,CAAC;AAID,SAAS,QAAQ,CAAC,GAAsB;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,kBAAkB,CAAC,GAAsB;IAChD,yBAAyB;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,yCAAyC,CAAC,CAAC;IAC3E,CAAC;AACH,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,GAAe;IACjD,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAClB,OAAO,GAA2B,CAAC;IACrC,CAAC;IAED,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAA2B,CAAC;IAC/C,kBAAkB,CAAC,GAAG,CAAC,CAAC;IACxB,OAAO,GAA2B,CAAC;AACrC,CAAC;AAED,SAAS,gBAAgB,CACvB,OAAoC,EACpC,UAAsB;IAEtB,MAAM,EAAE,GAA0C,EAAE,CAAC;IACrD,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5B,MAAM,WAAW,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QAChC,MAAM,CAAC,WAAW,EAAE,uBAAuB,EAAE,aAAa,CAAC,CAAC;QAC5D,MAAM,EAAC,IAAI,EAAE,QAAQ,EAAC,GAAG,WAAW,CAAC;QACrC,MAAM,CAAC,CAAC,QAAQ,EAAE,uBAAuB,EAAE,sBAAsB,CAAC,CAAC;QACnE,MAAM,CACJ,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,SAAS,EAC5D,uBAAuB,EAAE,+CAA+C,IAAI,EAAE,CAC/E,CAAC;IACJ,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;QACpD,EAAE,CAAC,IAAI,CAAC,GAAG,oBAAoB,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAkB;IAC9C,OAAO;QACL,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,KAAK;KAClC,CAAC;AACJ,CAAC;AAQD,SAAS,sBAAsB,CAC7B,aAA4B,EAC5B,gBAAkC;IAElC,MAAM,EAAE,GAAsC,EAAE,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,aAAa,CAAC,aAAa,CAAC,EAAE,CAAC;QAChE,EAAE,CAAC,IAAI,CAAC,GAAG,qBAAqB,CAAC,YAAY,EAAE,gBAAgB,CAAC,CAAC;IACnE,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAQD,SAAS,qBAAqB,CAC5B,YAA0B,EAC1B,gBAAkC;IAElC,IAAI,mBAAmB,CAAC,YAAY,CAAC,EAAE,CAAC;QACtC,OAAO,0BAA0B,CAAC,YAAY,EAAE,gBAAgB,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,6BAA6B,CAAC,YAAY,EAAE,gBAAgB,CAAC,CAAC;AACvE,CAAC;AAUD,SAAS,0BAA0B,CACjC,YAAyD,EACzD,gBAAkC;IAElC,OAAO;QACL,MAAM,EAAE,YAAY,CAAC,MAAM;QAC3B,IAAI,EAAE;YACJ,KAAK,EAAE,YAAY,CAAC,IAAI,CAAC,KAAK;YAC9B,MAAM,EAAE,wBAAwB,CAC9B,YAAY,CAAC,IAAI,CAAC,MAAM,EACxB,gBAAgB,CACjB;SACF;KACF,CAAC;AACJ,CAAC;AAeD,SAAS,6BAA6B,CACpC,YAAyE,EACzE,gBAAkC;IAElC,OAAO;QACL,MAAM,EAAE,YAAY,CAAC,MAAM;QAC3B,QAAQ,EAAE;YACR,WAAW,EAAE,YAAY,CAAC,QAAQ,CAAC,WAAW;YAC9C,SAAS,EAAE,YAAY,CAAC,QAAQ,CAAC,SAAS;YAC1C,MAAM,EAAE,wBAAwB,CAC9B,YAAY,CAAC,QAAQ,CAAC,MAAM,EAC5B,gBAAgB,CACjB;SACF;QACD,IAAI,EAAE;YACJ,KAAK,EAAE,YAAY,CAAC,IAAI,CAAC,KAAK;YAC9B,MAAM,EAAE,wBAAwB,CAC9B,YAAY,CAAC,IAAI,CAAC,MAAM,EACxB,gBAAgB,CACjB;SACF;KACF,CAAC;AACJ,CAAC;AAED,SAAS,wBAAwB,CAC/B,WAA4B,EAC5B,UAA4B;IAE5B,MAAM,mBAAmB,GACvB,OAAO,WAAW,KAAK,UAAU,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC;IAClE,OAAO,6BAA6B,CAClC,mBAAmB,EACnB,mBAAmB,CAAC,SAAS,EAAE,8BAA8B;IAC7D,UAAU,CACX,CAAC;AACJ,CAAC"}

package/out/zero-schema/src/schema.js

@@ -1,4 +0,0 @@
-export function createSchema(schema) {
-    return schema;
-}
-//# sourceMappingURL=schema.js.map

package/out/zero-schema/src/schema.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"schema.js","sourceRoot":"","sources":["../../../../zero-schema/src/schema.ts"],"names":[],"mappings":"AAOA,MAAM,UAAU,YAAY,CAAyB,MAAS;IAC5D,OAAO,MAAW,CAAC;AACrB,CAAC"}

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

@@ -1,70 +0,0 @@
-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;
-    constructor(input, format = { singular: false, relationships: {} }) {
-        this.#input = input;
-        this.#schema = input.getSchema();
-        this.#format = format;
-        this.#input.setOutput(this);
-        this.#root = { '': format.singular ? undefined : [] };
-        this.#hydrate();
-    }
-    get data() {
-        return this.#root[''];
-    }
-    addListener(listener) {
-        assert(!this.#listeners.has(listener), 'Listener already registered');
-        this.#listeners.add(listener);
-        listener(this.data);
-        return () => {
-            this.#listeners.delete(listener);
-        };
-    }
-    #fireListeners() {
-        for (const listener of this.#listeners) {
-            listener(this.data);
-        }
-    }
-    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();
-    }
-    push(change) {
-        this.#dirty = true;
-        applyChange(this.#root, change, this.#schema, '', this.#format);
-    }
-    flush() {
-        if (!this.#dirty) {
-            return;
-        }
-        this.#dirty = false;
-        this.#fireListeners();
-    }
-}
-//# sourceMappingURL=array-view.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"array-view.js","sourceRoot":"","sources":["../../../../../zql/src/ivm/array-view.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AAMtD,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;IAEf,YACE,KAAY,EACZ,SAAiB,EAAC,QAAQ,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,EAAC;QAErD,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,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,KAAK,GAAG,EAAC,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAC,CAAC;QAEpD,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,QAAQ,CAAC,IAAI,CAAC,IAAoB,CAAC,CAAC;QAEpC,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,QAAQ,CAAC,IAAI,CAAC,IAAoB,CAAC,CAAC;QACtC,CAAC;IACH,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;CACF"}

package/out/zql/src/ivm/view-apply-change.js

@@ -1,156 +0,0 @@
-import { assert, assertArray, assertObject, assertUndefined, unreachable, } from '../../../shared/src/asserts.js';
-import { must } from '../../../shared/src/must.js';
-export function applyChange(parentEntry, change, schema, relationship, format) {
-    if (schema.isHidden) {
-        switch (change.type) {
-            case 'add':
-            case 'remove':
-                for (const [relationship, children] of Object.entries(change.node.relationships)) {
-                    const childSchema = must(schema.relationships[relationship]);
-                    for (const node of children) {
-                        applyChange(parentEntry, { type: change.type, node }, childSchema, relationship, format);
-                    }
-                }
-                return;
-            case 'edit':
-                // If hidden at this level it means that the hidden row was changed. If
-                // the row was changed in such a way that it would change the
-                // relationships then the edit would have been split into remove and
-                // add.
-                return;
-            case 'child': {
-                const childSchema = must(schema.relationships[change.child.relationshipName]);
-                applyChange(parentEntry, change.child.change, childSchema, relationship, format);
-                return;
-            }
-            default:
-                unreachable(change);
-        }
-    }
-    const { singular, relationships: childFormats } = format;
-    switch (change.type) {
-        case 'add': {
-            // TODO: Only create a new entry if we need to mutate the existing one.
-            const newEntry = {
-                ...change.node.row,
-            };
-            if (singular) {
-                assertUndefined(parentEntry[relationship], 'single output already exists');
-                parentEntry[relationship] = newEntry;
-            }
-            else {
-                const view = parentEntry[relationship];
-                assertArray(view);
-                const { pos, found } = binarySearch(view, newEntry, schema.compareRows);
-                assert(!found, 'node already exists');
-                view.splice(pos, 0, newEntry);
-            }
-            for (const [relationship, children] of Object.entries(change.node.relationships)) {
-                // TODO: Is there a flag to make TypeScript complain that dictionary access might be undefined?
-                const childSchema = must(schema.relationships[relationship]);
-                const childFormat = must(childFormats[relationship]);
-                const newView = childFormat.singular ? undefined : [];
-                newEntry[relationship] = newView;
-                for (const node of children) {
-                    applyChange(newEntry, { type: 'add', node }, childSchema, relationship, childFormat);
-                }
-            }
-            break;
-        }
-        case 'remove': {
-            if (singular) {
-                assertObject(parentEntry[relationship]);
-                parentEntry[relationship] = undefined;
-            }
-            else {
-                assertArray(parentEntry[relationship]);
-                const view = parentEntry[relationship];
-                const { pos, found } = binarySearch(view, change.node.row, schema.compareRows);
-                assert(found, 'node does not exist');
-                view.splice(pos, 1);
-            }
-            break;
-        }
-        case 'child': {
-            let existing;
-            if (singular) {
-                assertObject(parentEntry[relationship]);
-                existing = parentEntry[relationship];
-            }
-            else {
-                assertArray(parentEntry[relationship]);
-                const list = parentEntry[relationship];
-                const { pos, found } = binarySearch(list, change.row, schema.compareRows);
-                assert(found, 'node does not exist');
-                existing = list[pos];
-            }
-            const childSchema = must(schema.relationships[change.child.relationshipName]);
-            const childFormat = must(format.relationships[change.child.relationshipName]);
-            applyChange(existing, change.child.change, childSchema, change.child.relationshipName, childFormat);
-            break;
-        }
-        case 'edit': {
-            if (singular) {
-                assertObject(parentEntry[relationship]);
-                parentEntry[relationship] = {
-                    ...parentEntry[relationship],
-                    ...change.row,
-                };
-            }
-            else {
-                assertArray(parentEntry[relationship]);
-                const view = parentEntry[relationship];
-                // If the order changed due to the edit, we need to remove and reinsert.
-                if (schema.compareRows(change.oldRow, change.row) === 0) {
-                    const { pos, found } = binarySearch(view, change.oldRow, schema.compareRows);
-                    assert(found, 'node does not exists');
-                    view[pos] = makeEntryPreserveRelationships(change.row, view[pos], schema.relationships);
-                }
-                else {
-                    // Remove
-                    const { pos, found } = binarySearch(view, change.oldRow, schema.compareRows);
-                    assert(found, 'node does not exists');
-                    const oldEntry = view[pos];
-                    view.splice(pos, 1);
-                    // Insert
-                    {
-                        const { pos, found } = binarySearch(view, change.row, schema.compareRows);
-                        assert(!found, 'node already exists');
-                        view.splice(pos, 0, makeEntryPreserveRelationships(change.row, oldEntry, schema.relationships));
-                    }
-                }
-            }
-            break;
-        }
-        default:
-            unreachable(change);
-    }
-}
-// TODO: Do not return an object. It puts unnecessary pressure on the GC.
-function binarySearch(view, target, comparator) {
-    let low = 0;
-    let high = view.length - 1;
-    while (low <= high) {
-        const mid = (low + high) >>> 1;
-        const comparison = comparator(view[mid], target);
-        if (comparison < 0) {
-            low = mid + 1;
-        }
-        else if (comparison > 0) {
-            high = mid - 1;
-        }
-        else {
-            return { pos: mid, found: true };
-        }
-    }
-    return { pos: low, found: false };
-}
-function makeEntryPreserveRelationships(row, entry, relationships) {
-    const result = { ...row };
-    for (const relationship in relationships) {
-        assert(!(relationship in row), 'Relationship already exists');
-        result[relationship] = entry[relationship];
-    }
-    return result;
-}
-//# sourceMappingURL=view-apply-change.js.map

package/out/zql/src/ivm/view-apply-change.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"view-apply-change.js","sourceRoot":"","sources":["../../../../../zql/src/ivm/view-apply-change.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,MAAM,EACN,WAAW,EACX,YAAY,EACZ,eAAe,EACf,WAAW,GACZ,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAC,IAAI,EAAC,MAAM,6BAA6B,CAAC;AAOjD,MAAM,UAAU,WAAW,CACzB,WAAkB,EAClB,MAAc,EACd,MAAoB,EACpB,YAAoB,EACpB,MAAc;IAEd,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACpB,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,KAAK,CAAC;YACX,KAAK,QAAQ;gBACX,KAAK,MAAM,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CACnD,MAAM,CAAC,IAAI,CAAC,aAAa,CAC1B,EAAE,CAAC;oBACF,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC;oBAC7D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;wBAC5B,WAAW,CACT,WAAW,EACX,EAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,EAAC,EACzB,WAAW,EACX,YAAY,EACZ,MAAM,CACP,CAAC;oBACJ,CAAC;gBACH,CAAC;gBACD,OAAO;YACT,KAAK,MAAM;gBACT,uEAAuE;gBACvE,6DAA6D;gBAC7D,oEAAoE;gBACpE,OAAO;gBACP,OAAO;YACT,KAAK,OAAO,CAAC,CAAC,CAAC;gBACb,MAAM,WAAW,GAAG,IAAI,CACtB,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CACpD,CAAC;gBACF,WAAW,CACT,WAAW,EACX,MAAM,CAAC,KAAK,CAAC,MAAM,EACnB,WAAW,EACX,YAAY,EACZ,MAAM,CACP,CAAC;gBACF,OAAO;YACT,CAAC;YACD;gBACE,WAAW,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,MAAM,EAAC,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAC,GAAG,MAAM,CAAC;IACvD,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,uEAAuE;YACvE,MAAM,QAAQ,GAAU;gBACtB,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG;aACnB,CAAC;YACF,IAAI,QAAQ,EAAE,CAAC;gBACb,eAAe,CACb,WAAW,CAAC,YAAY,CAAC,EACzB,8BAA8B,CAC/B,CAAC;gBACF,WAAW,CAAC,YAAY,CAAC,GAAG,QAAQ,CAAC;YACvC,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;gBACvC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAClB,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;gBACtE,MAAM,CAAC,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;gBACtC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YAChC,CAAC;YACD,KAAK,MAAM,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CACnD,MAAM,CAAC,IAAI,CAAC,aAAa,CAC1B,EAAE,CAAC;gBACF,+FAA+F;gBAC/F,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC;gBAC7D,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC;gBACrD,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,EAAgB,CAAC;gBACrE,QAAQ,CAAC,YAAY,CAAC,GAAG,OAAO,CAAC;gBACjC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,WAAW,CACT,QAAQ,EACR,EAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAC,EACnB,WAAW,EACX,YAAY,EACZ,WAAW,CACZ,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,QAAQ,EAAE,CAAC;gBACb,YAAY,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC;gBACxC,WAAW,CAAC,YAAY,CAAC,GAAG,SAAS,CAAC;YACxC,CAAC;iBAAM,CAAC;gBACN,WAAW,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC;gBACvC,MAAM,IAAI,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;gBACvC,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAC/B,IAAI,EACJ,MAAM,CAAC,IAAI,CAAC,GAAG,EACf,MAAM,CAAC,WAAW,CACnB,CAAC;gBACF,MAAM,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;gBACrC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACtB,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,IAAI,QAAe,CAAC;YACpB,IAAI,QAAQ,EAAE,CAAC;gBACb,YAAY,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC;gBACxC,QAAQ,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;YACvC,CAAC;iBAAM,CAAC;gBACN,WAAW,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC;gBACvC,MAAM,IAAI,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;gBACvC,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;gBACxE,MAAM,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;gBACrC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACvB,CAAC;YAED,MAAM,WAAW,GAAG,IAAI,CACtB,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CACpD,CAAC;YACF,MAAM,WAAW,GAAG,IAAI,CACtB,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CACpD,CAAC;YACF,WAAW,CACT,QAAQ,EACR,MAAM,CAAC,KAAK,CAAC,MAAM,EACnB,WAAW,EACX,MAAM,CAAC,KAAK,CAAC,gBAAgB,EAC7B,WAAW,CACZ,CAAC;YACF,MAAM;QACR,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,QAAQ,EAAE,CAAC;gBACb,YAAY,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC;gBACxC,WAAW,CAAC,YAAY,CAAC,GAAG;oBAC1B,GAAG,WAAW,CAAC,YAAY,CAAC;oBAC5B,GAAG,MAAM,CAAC,GAAG;iBACd,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,WAAW,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC;gBACvC,MAAM,IAAI,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;gBACvC,wEAAwE;gBACxE,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxD,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAC/B,IAAI,EACJ,MAAM,CAAC,MAAM,EACb,MAAM,CAAC,WAAW,CACnB,CAAC;oBACF,MAAM,CAAC,KAAK,EAAE,sBAAsB,CAAC,CAAC;oBACtC,IAAI,CAAC,GAAG,CAAC,GAAG,8BAA8B,CACxC,MAAM,CAAC,GAAG,EACV,IAAI,CAAC,GAAG,CAAC,EACT,MAAM,CAAC,aAAa,CACrB,CAAC;gBACJ,CAAC;qBAAM,CAAC;oBACN,SAAS;oBACT,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAC/B,IAAI,EACJ,MAAM,CAAC,MAAM,EACb,MAAM,CAAC,WAAW,CACnB,CAAC;oBACF,MAAM,CAAC,KAAK,EAAE,sBAAsB,CAAC,CAAC;oBACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC3B,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;oBAEpB,SAAS;oBACT,CAAC;wBACC,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAC/B,IAAI,EACJ,MAAM,CAAC,GAAG,EACV,MAAM,CAAC,WAAW,CACnB,CAAC;wBACF,MAAM,CAAC,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;wBACtC,IAAI,CAAC,MAAM,CACT,GAAG,EACH,CAAC,EACD,8BAA8B,CAC5B,MAAM,CAAC,GAAG,EACV,QAAQ,EACR,MAAM,CAAC,aAAa,CACrB,CACF,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM;QACR,CAAC;QACD;YACE,WAAW,CAAC,MAAM,CAAC,CAAC;IACxB,CAAC;AACH,CAAC;AAED,yEAAyE;AACzE,SAAS,YAAY,CAAC,IAAe,EAAE,MAAa,EAAE,UAAsB;IAC1E,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,OAAO,GAAG,IAAI,IAAI,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAQ,EAAE,MAAa,CAAC,CAAC;QAC/D,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAChB,CAAC;aAAM,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,OAAO,EAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,OAAO,EAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAC,CAAC;AAClC,CAAC;AAED,SAAS,8BAA8B,CACrC,GAAQ,EACR,KAAY,EACZ,aAA4C;IAE5C,MAAM,MAAM,GAAU,EAAC,GAAG,GAAG,EAAC,CAAC;IAC/B,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;QACzC,MAAM,CAAC,CAAC,CAAC,YAAY,IAAI,GAAG,CAAC,EAAE,6BAA6B,CAAC,CAAC;QAC9D,MAAM,CAAC,YAAY,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=view.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"view.js","sourceRoot":"","sources":["../../../../../zql/src/ivm/view.ts"],"names":[],"mappings":""}

package/out/zql/src/query/auth-query.js

@@ -1,26 +0,0 @@
-import { normalizeTableSchema, } from '../../../zero-schema/src/normalize-table-schema.js';
-import { AbstractQuery } from './query-impl.js';
-export function authQuery(schema) {
-    return new AuthQuery(normalizeTableSchema(schema));
-}
-export class AuthQuery extends AbstractQuery {
-    constructor(schema, ast = { table: schema.tableName }, format) {
-        super(schema, ast, format);
-    }
-    get ast() {
-        return this._completeAst();
-    }
-    _newQuery(schema, ast, format) {
-        return new AuthQuery(schema, ast, format);
-    }
-    materialize() {
-        throw new Error('AuthQuery cannot be materialized');
-    }
-    run() {
-        throw new Error('AuthQuery cannot be run');
-    }
-    preload() {
-        throw new Error('AuthQuery cannot be preloaded');
-    }
-}
-//# sourceMappingURL=auth-query.js.map

package/out/zql/src/query/auth-query.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"auth-query.js","sourceRoot":"","sources":["../../../../../zql/src/query/auth-query.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,oBAAoB,GAErB,MAAM,oDAAoD,CAAC;AAC5D,OAAO,EAAC,aAAa,EAAC,MAAM,iBAAiB,CAAC;AAK9C,MAAM,UAAU,SAAS,CAA8B,MAAe;IACpE,OAAO,IAAI,SAAS,CAAU,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED,MAAM,OAAO,SAGX,SAAQ,aAAoC;IAC5C,YACE,MAA6B,EAC7B,MAAW,EAAC,KAAK,EAAE,MAAM,CAAC,SAAS,EAAC,EACpC,MAA2B;QAE3B,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,YAAY,EAAE,CAAC;IAC7B,CAAC;IAES,SAAS,CACjB,MAA6B,EAC7B,GAAQ,EACR,MAA0B;QAE1B,OAAO,IAAI,SAAS,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IAC5C,CAAC;IAED,WAAW;QACT,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACtD,CAAC;IAED,GAAG;QACD,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO;QAIL,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACnD,CAAC;CACF"}

package/out/zql/src/query/expression.js

@@ -1,121 +0,0 @@
-export function cmp(field, opOrValue, value) {
-    let op;
-    if (value === undefined) {
-        value = opOrValue;
-        op = '=';
-    }
-    else {
-        op = opOrValue;
-    }
-    return {
-        type: 'simple',
-        field,
-        op,
-        value: value,
-    };
-}
-export function and(...conditions) {
-    if (conditions.length === 1) {
-        return conditions[0];
-    }
-    // If any internal conditions are `or` then we distribute `or` over the `and`.
-    // This allows the graph and pipeline builder to remain simple and not have to deal with
-    // nested conditions.
-    // In other words, conditions are in [DNF](https://en.wikipedia.org/wiki/Disjunctive_normal_form).
-    const ands = conditions.flatMap(c => {
-        if (c.type === 'and') {
-            return c.conditions;
-        }
-        else if (c.type === 'simple') {
-            return [c];
-        }
-        return [];
-    });
-    const ors = conditions.filter(c => c.type === 'or');
-    if (ors.length === 0) {
-        return { type: 'and', conditions: ands };
-    }
-    const flatOrs = flatten('or', ors);
-    const flatAnds = flatten('and', ands);
-    return {
-        type: 'or',
-        conditions: flatOrs.conditions.map(part => ({
-            type: 'and',
-            conditions: [
-                ...(part.type === 'and' ? part.conditions : [part]),
-                ...flatAnds.conditions,
-            ],
-        })),
-    };
-}
-export function or(...conditions) {
-    if (conditions.length === 1) {
-        return conditions[0];
-    }
-    return flatten('or', conditions);
-}
-export function not(expr) {
-    switch (expr.type) {
-        case 'and':
-            return {
-                type: 'or',
-                conditions: expr.conditions.map(not),
-            };
-        case 'or':
-            return {
-                type: 'and',
-                conditions: expr.conditions.map(not),
-            };
-        default:
-            return {
-                type: 'simple',
-                op: negateOperator(expr.op),
-                field: expr.field,
-                value: expr.value,
-            };
-    }
-}
-function flatten(type, conditions) {
-    const flattened = [];
-    for (const c of conditions) {
-        if (c.type === type) {
-            flattened.push(...c.conditions);
-        }
-        else {
-            flattened.push(c);
-        }
-    }
-    return {
-        type,
-        conditions: flattened,
-    };
-}
-function negateOperator(op) {
-    switch (op) {
-        case '=':
-            return '!=';
-        case '!=':
-            return '=';
-        case '<':
-            return '>=';
-        case '>':
-            return '<=';
-        case '>=':
-            return '<';
-        case '<=':
-            return '>';
-        case 'IN':
-            return 'NOT IN';
-        case 'NOT IN':
-            return 'IN';
-        case 'LIKE':
-            return 'NOT LIKE';
-        case 'NOT LIKE':
-            return 'LIKE';
-        case 'ILIKE':
-            return 'NOT ILIKE';
-        case 'NOT ILIKE':
-            return 'ILIKE';
-    }
-}
-//# sourceMappingURL=expression.js.map

package/out/zql/src/query/expression.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"expression.js","sourceRoot":"","sources":["../../../../../zql/src/query/expression.ts"],"names":[],"mappings":"AAoEA,MAAM,UAAU,GAAG,CACjB,KAAa,EACb,SAG4B,EAC5B,KAE4B;IAE5B,IAAI,EAAY,CAAC;IACjB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,KAAK,GAAG,SAAS,CAAC;QAClB,EAAE,GAAG,GAAG,CAAC;IACX,CAAC;SAAM,CAAC;QACN,EAAE,GAAG,SAAqB,CAAC;IAC7B,CAAC;IAED,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,KAAK;QACL,EAAE;QACF,KAAK,EAAE,KAAsB;KAC9B,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,GAAG,CACjB,GAAG,UAAuC;IAE1C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,8EAA8E;IAC9E,wFAAwF;IACxF,qBAAqB;IACrB,kGAAkG;IAClG,MAAM,IAAI,GAAgC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QAC/D,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,OAAO,CAAC,CAAC,UAAU,CAAC;QACtB,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC/B,OAAO,CAAC,CAAC,CAAC,CAAC;QACb,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC,CAAC;IACH,MAAM,GAAG,GAAgC,UAAU,CAAC,MAAM,CACxD,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CACrB,CAAC;IAEF,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,EAAC,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAC,CAAC;IACzC,CAAC;IAED,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACnC,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAEtC,OAAO;QACL,IAAI,EAAE,IAAI;QACV,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC1C,IAAI,EAAE,KAAK;YACX,UAAU,EAAE;gBACV,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACnD,GAAG,QAAQ,CAAC,UAAU;aACvB;SACF,CAAC,CAAC;KACJ,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,EAAE,CAChB,GAAG,UAAuC;IAE1C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,OAAO,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;AACnC,CAAC;AAED,MAAM,UAAU,GAAG,CACjB,IAA+B;IAE/B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK;YACR,OAAO;gBACL,IAAI,EAAE,IAAI;gBACV,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;aACrC,CAAC;QACJ,KAAK,IAAI;YACP,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;aACrC,CAAC;QACJ;YACE,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3B,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,KAAK,EAAE,IAAI,CAAC,KAAK;aAClB,CAAC;IACN,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CACd,IAAgB,EAChB,UAAuC;IAIvC,MAAM,SAAS,GAAgC,EAAE,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACpB,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAClC,CAAC;aAAM,CAAC;YACN,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO;QACL,IAAI;QACJ,UAAU,EAAE,SAAS;KACqB,CAAC;AAC/C,CAAC;AAED,SAAS,cAAc,CAAC,EAAkB;IACxC,QAAQ,EAAE,EAAE,CAAC;QACX,KAAK,GAAG;YACN,OAAO,IAAI,CAAC;QACd,KAAK,IAAI;YACP,OAAO,GAAG,CAAC;QACb,KAAK,GAAG;YACN,OAAO,IAAI,CAAC;QACd,KAAK,GAAG;YACN,OAAO,IAAI,CAAC;QACd,KAAK,IAAI;YACP,OAAO,GAAG,CAAC;QACb,KAAK,IAAI;YACP,OAAO,GAAG,CAAC;QACb,KAAK,IAAI;YACP,OAAO,QAAQ,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,IAAI,CAAC;QACd,KAAK,MAAM;YACT,OAAO,UAAU,CAAC;QACpB,KAAK,UAAU;YACb,OAAO,MAAM,CAAC;QAChB,KAAK,OAAO;YACV,OAAO,WAAW,CAAC;QACrB,KAAK,WAAW;YACd,OAAO,OAAO,CAAC;IACnB,CAAC;AACH,CAAC"}