flowquery 1.0.70 → 1.0.71

package/dist/compute/provenance.d.ts

@@ -0,0 +1,201 @@
+import Node from "../graph/node";
+import Relationship from "../graph/relationship";
+/**
+ * One observation that a particular alias was bound to a particular node id
+ * while a result row was being projected.  For non-aggregate rows there is
+ * exactly one `NodeBinding` per registered node slot; aggregate rows may
+ * carry multiple observations under the same alias when distinct ids fed the
+ * group.
+ *
+ * `id` preserves the original scalar type from the underlying record (string,
+ * number, etc.).  `id === null` indicates an OPTIONAL MATCH miss.
+ */
+export interface NodeBinding {
+    /** The node identifier from the query (e.g. `a`), or `null` if anonymous. */
+    alias: string | null;
+    /** The matched label from the query (the first declared label), or `null`. */
+    label: string | null;
+    /** The concrete `id` value of the matched node, preserving scalar type. */
+    id: any;
+    /**
+     * Shallow snapshot of the matched record's property values (excluding
+     * `id` and internal `_label`).  Present whenever the runner was
+     * constructed with `{ provenance: true }`.
+     */
+    properties?: Record<string, any>;
+    /**
+     * When the matched node came from a virtual
+     * `CREATE VIRTUAL (:X) AS { ... }` sub-query, this is the inner
+     * runner's `RowProvenance` row that produced the record.  Omitted
+     * when the source is not a virtual.
+     */
+    source?: RowProvenance;
+}
+/**
+ * One traversed edge in a relationship binding.  Variable-length matches
+ * (`[:T*m..n]`) contribute multiple hops; single-hop matches contribute one.
+ */
+export interface RelationshipHop {
+    left_id: any;
+    right_id: any;
+    /** Resolved relationship type (may differ from the declared type when a
+     *  virtual relationship spans multiple underlying types). */
+    type: string;
+    /**
+     * Shallow snapshot of the relationship record's property values.
+     * Present whenever the runner was constructed with
+     * `{ provenance: true }`.
+     */
+    properties?: Record<string, any>;
+    /**
+     * When the traversed edge came from a virtual
+     * relationship's inner sub-query, this is the inner runner's row
+     * provenance for the contributing record.  Omitted otherwise.
+     */
+    source?: RowProvenance;
+}
+/**
+ * One observation that a particular relationship alias was bound to a
+ * concrete path of one or more hops while a result row was being projected.
+ */
+export interface RelationshipBinding {
+    /** The relationship identifier from the query (e.g. `r`), or `null`. */
+    alias: string | null;
+    /** The declared relationship type from the query, or `null` when omitted. */
+    type: string | null;
+    /** The traversed edges in path order. */
+    hops: RelationshipHop[];
+    /**
+     * The ordered chain of node ids visited along the relationship match:
+     * `[hops[0].left_id, ...hops.map(h => h.right_id)]`.  Always present.
+     * Empty for OPTIONAL-MATCH misses and zero-hop variable-length matches.
+     */
+    path: any[];
+}
+/**
+ * One observation that a particular `LOAD` operation contributed a row
+ * to the projected result.  Records the resolved source name and,
+ * recursively, the inner provenance that backed the row when the
+ * source was a `LET`-bound dataset.
+ */
+export interface DataSourceBinding {
+    /**
+     * The resolved source identifier: a URL, file URI, async-function
+     * name, or `let://<name>` reference for a `LET`-bound dataset.
+     */
+    source: string;
+    /**
+     * When the row came from a `LET`-backed array whose inner runner
+     * was executed with provenance, this is the inner runner's
+     * `RowProvenance` row for the loaded record.  Provides recursive
+     * traceability back through the `LET`'s own sub-query (which may
+     * itself include `LOAD` operations).  Omitted otherwise.
+     */
+    source_provenance?: RowProvenance;
+}
+/**
+ * One flat slice of bindings - either a single non-aggregate row's
+ * contribution, or one input row's contribution to an aggregate group.
+ * Sources (`ProvenanceSource.snapshot`) and the entries in
+ * `RowProvenance.rows` are all `RowSegment`s.
+ */
+export interface RowSegment {
+    nodes: NodeBinding[];
+    relationships: RelationshipBinding[];
+    /**
+     * Data sources consumed while projecting this row.  Populated when
+     * the pipeline includes a `LOAD` operation: one entry per emitted
+     * `Load` record.  Each entry's `source` is the URL / file URI /
+     * async-function name / `let://name` reference; `source_provenance`
+     * is the inner `RowProvenance` row when the source was a
+     * `LET`-bound dataset.  Omitted when the segment has no Load
+     * contributions.
+     */
+    data_sources?: DataSourceBinding[];
+}
+/**
+ * Row-level lineage aligned by index with `Runner.results`.  Extends a
+ * single segment (the union of contributing bindings) with `rows`, the
+ * ordered per-input-row segments.  For non-aggregate rows `rows.length`
+ * is 1; for aggregates it equals the number of input rows that fed the
+ * group, so `result.collectField[k]` aligns positionally with
+ * `provenance.rows[k]`.
+ */
+export interface RowProvenance extends RowSegment {
+    rows: RowSegment[];
+}
+/**
+ * Anything that can produce a `RowSegment` for the row currently being
+ * emitted.  Two implementations exist today:
+ *
+ *  - {@link ProvenanceSites} — snapshots the live bindings of a MATCH's
+ *    `Node` / `Relationship` slots at the moment of the emit.
+ *  - `AggregatedWith` (in `aggregated_with.ts`) — replays the pre-computed
+ *    segment of the group it is currently flushing downstream.
+ *
+ * The terminal `Return` (and intermediate `AggregatedWith` /
+ * `AggregatedReturn` operations) iterate their registered sources per row
+ * and concatenate the segments into a single `RowSegment`.
+ */
+export interface ProvenanceSource {
+    snapshot(): RowSegment;
+}
+/**
+ * Concatenate one segment into a destination segment.  Lives here so the
+ * merge order stays consistent across consumers (`Return`, `GroupBy`,
+ * `AggregatedWith`).
+ */
+export declare function mergeProvenanceSegment(into: RowSegment, segment: RowSegment): void;
+/**
+ * Holds the set of `Node` and `Relationship` slots discovered in a query's
+ * MATCH operations.  These are stable references; their live state is read
+ * synchronously on each `snapshot()` call to capture the bindings active at
+ * that moment.
+ *
+ * The collector is opt-in via the `provenance` Runner option and zero-cost
+ * when disabled.
+ */
+export declare class ProvenanceSites {
+    readonly nodes: Node[];
+    readonly relationships: Relationship[];
+    private readonly _seenNodeIdentifiers;
+    private readonly _seenRelationshipIdentifiers;
+    private _captureProperties;
+    /**
+     * Enable property-level capture for snapshots produced by this collector.
+     * Set by the Runner when constructed with `{ provenance: true }`.
+     */
+    set captureProperties(value: boolean);
+    /**
+     * Register a node slot.  `NodeReference`s (re-bindings of a previously
+     * matched identifier) and duplicate named identifiers are skipped so the
+     * same alias does not produce multiple bindings.
+     */
+    addNode(node: Node): void;
+    /**
+     * Register a relationship slot.  `RelationshipReference`s and duplicate
+     * named identifiers are skipped.  Anonymous relationships are always
+     * added since each represents an independent traversal slot.
+     */
+    addRelationship(rel: Relationship): void;
+    get isEmpty(): boolean;
+    /**
+     * Capture the currently-bound id / hop values for every registered slot.
+     * Returns `null` for ids of slots that are not currently matched (e.g.
+     * OPTIONAL MATCH misses).
+     */
+    snapshot(): RowSegment;
+}
+/**
+ * Stable canonical key for deduplicating a `NodeBinding` within an aggregate
+ * group.  Uses `JSON.stringify` to preserve scalar type distinctions
+ * (`1` vs `"1"`).
+ */
+export declare function nodeBindingKey(b: NodeBinding): string;
+/**
+ * Stable canonical key for deduplicating a `RelationshipBinding` within an
+ * aggregate group.  Includes every hop so variable-length paths with the
+ * same alias but different traversals are treated as distinct.
+ */
+export declare function relationshipBindingKey(b: RelationshipBinding): string;
+//# sourceMappingURL=provenance.d.ts.map

package/dist/compute/provenance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"provenance.d.ts","sourceRoot":"","sources":["../../src/compute/provenance.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,eAAe,CAAC;AAEjC,OAAO,YAAY,MAAM,uBAAuB,CAAC;AAIjD;;;;;;;;;GASG;AACH,MAAM,WAAW,WAAW;IACxB,6EAA6E;IAC7E,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,8EAA8E;IAC9E,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,2EAA2E;IAC3E,EAAE,EAAE,GAAG,CAAC;IACR;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACjC;;;;;OAKG;IACH,MAAM,CAAC,EAAE,aAAa,CAAC;CAC1B;AAED;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC5B,OAAO,EAAE,GAAG,CAAC;IACb,QAAQ,EAAE,GAAG,CAAC;IACd;iEAC6D;IAC7D,IAAI,EAAE,MAAM,CAAC;IACb;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACjC;;;;OAIG;IACH,MAAM,CAAC,EAAE,aAAa,CAAC;CAC1B;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAChC,wEAAwE;IACxE,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,6EAA6E;IAC7E,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,yCAAyC;IACzC,IAAI,EAAE,eAAe,EAAE,CAAC;IACxB;;;;OAIG;IACH,IAAI,EAAE,GAAG,EAAE,CAAC;CACf;AAED;;;;;GAKG;AACH,MAAM,WAAW,iBAAiB;IAC9B;;;OAGG;IACH,MAAM,EAAE,MAAM,CAAC;IACf;;;;;;OAMG;IACH,iBAAiB,CAAC,EAAE,aAAa,CAAC;CACrC;AAED;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACvB,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,aAAa,EAAE,mBAAmB,EAAE,CAAC;IACrC;;;;;;;;OAQG;IACH,YAAY,CAAC,EAAE,iBAAiB,EAAE,CAAC;CACtC;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,aAAc,SAAQ,UAAU;IAC7C,IAAI,EAAE,UAAU,EAAE,CAAC;CACtB;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,gBAAgB;IAC7B,QAAQ,IAAI,UAAU,CAAC;CAC1B;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,GAAG,IAAI,CAOlF;AAED;;;;;;;;GAQG;AACH,qBAAa,eAAe;IACxB,SAAgB,KAAK,EAAE,IAAI,EAAE,CAAM;IACnC,SAAgB,aAAa,EAAE,YAAY,EAAE,CAAM;IACnD,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAA0B;IAC/D,OAAO,CAAC,QAAQ,CAAC,4BAA4B,CAA0B;IACvE,OAAO,CAAC,kBAAkB,CAAkB;IAE5C;;;OAGG;IACH,IAAW,iBAAiB,CAAC,KAAK,EAAE,OAAO,EAE1C;IAED;;;;OAIG;IACI,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAUhC;;;;OAIG;IACI,eAAe,CAAC,GAAG,EAAE,YAAY,GAAG,IAAI;IAU/C,IAAW,OAAO,IAAI,OAAO,CAE5B;IAED;;;;OAIG;IACI,QAAQ,IAAI,UAAU;CAqDhC;AA8CD;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,WAAW,GAAG,MAAM,CAErD;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,mBAAmB,GAAG,MAAM,CAOrE"}

package/dist/compute/provenance.js

@@ -0,0 +1,216 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ProvenanceSites = void 0;
+exports.mergeProvenanceSegment = mergeProvenanceSegment;
+exports.nodeBindingKey = nodeBindingKey;
+exports.relationshipBindingKey = relationshipBindingKey;
+const node_reference_1 = __importDefault(require("../graph/node_reference"));
+const relationship_reference_1 = __importDefault(require("../graph/relationship_reference"));
+const virtual_sources_1 = require("../graph/virtual_sources");
+/**
+ * Concatenate one segment into a destination segment.  Lives here so the
+ * merge order stays consistent across consumers (`Return`, `GroupBy`,
+ * `AggregatedWith`).
+ */
+function mergeProvenanceSegment(into, segment) {
+    for (const n of segment.nodes)
+        into.nodes.push(n);
+    for (const r of segment.relationships)
+        into.relationships.push(r);
+    if (segment.data_sources !== undefined && segment.data_sources.length > 0) {
+        if (into.data_sources === undefined)
+            into.data_sources = [];
+        for (const d of segment.data_sources)
+            into.data_sources.push(d);
+    }
+}
+/**
+ * Holds the set of `Node` and `Relationship` slots discovered in a query's
+ * MATCH operations.  These are stable references; their live state is read
+ * synchronously on each `snapshot()` call to capture the bindings active at
+ * that moment.
+ *
+ * The collector is opt-in via the `provenance` Runner option and zero-cost
+ * when disabled.
+ */
+class ProvenanceSites {
+    constructor() {
+        this.nodes = [];
+        this.relationships = [];
+        this._seenNodeIdentifiers = new Set();
+        this._seenRelationshipIdentifiers = new Set();
+        this._captureProperties = false;
+    }
+    /**
+     * Enable property-level capture for snapshots produced by this collector.
+     * Set by the Runner when constructed with `{ provenance: true }`.
+     */
+    set captureProperties(value) {
+        this._captureProperties = value;
+    }
+    /**
+     * Register a node slot.  `NodeReference`s (re-bindings of a previously
+     * matched identifier) and duplicate named identifiers are skipped so the
+     * same alias does not produce multiple bindings.
+     */
+    addNode(node) {
+        if (node instanceof node_reference_1.default)
+            return;
+        const id = node.identifier;
+        if (id !== null) {
+            if (this._seenNodeIdentifiers.has(id))
+                return;
+            this._seenNodeIdentifiers.add(id);
+        }
+        this.nodes.push(node);
+    }
+    /**
+     * Register a relationship slot.  `RelationshipReference`s and duplicate
+     * named identifiers are skipped.  Anonymous relationships are always
+     * added since each represents an independent traversal slot.
+     */
+    addRelationship(rel) {
+        if (rel instanceof relationship_reference_1.default)
+            return;
+        const id = rel.identifier;
+        if (id !== null) {
+            if (this._seenRelationshipIdentifiers.has(id))
+                return;
+            this._seenRelationshipIdentifiers.add(id);
+        }
+        this.relationships.push(rel);
+    }
+    get isEmpty() {
+        return this.nodes.length === 0 && this.relationships.length === 0;
+    }
+    /**
+     * Capture the currently-bound id / hop values for every registered slot.
+     * Returns `null` for ids of slots that are not currently matched (e.g.
+     * OPTIONAL MATCH misses).
+     */
+    snapshot() {
+        var _a, _b, _c;
+        const captureProps = this._captureProperties;
+        const nodes = new Array(this.nodes.length);
+        for (let i = 0; i < this.nodes.length; i++) {
+            const node = this.nodes[i];
+            const v = node.value();
+            const binding = {
+                alias: node.identifier,
+                label: node.label,
+                id: v === null || v === undefined ? null : ((_a = v.id) !== null && _a !== void 0 ? _a : null),
+            };
+            if (captureProps && v !== null && v !== undefined) {
+                binding.properties = extractNodeProperties(v);
+            }
+            const src = v == null ? undefined : (0, virtual_sources_1.getVirtualSource)(v);
+            if (src !== undefined)
+                binding.source = src;
+            nodes[i] = binding;
+        }
+        const relationships = new Array(this.relationships.length);
+        for (let i = 0; i < this.relationships.length; i++) {
+            const rel = this.relationships[i];
+            const matches = rel.matches;
+            const hops = new Array(matches.length);
+            for (let j = 0; j < matches.length; j++) {
+                const m = matches[j];
+                const hop = {
+                    left_id: m.startNode == null ? null : ((_b = m.startNode.id) !== null && _b !== void 0 ? _b : null),
+                    right_id: m.endNode == null ? null : ((_c = m.endNode.id) !== null && _c !== void 0 ? _c : null),
+                    type: m.type,
+                };
+                if (captureProps) {
+                    hop.properties = extractRelationshipProperties(m);
+                }
+                const src = (0, virtual_sources_1.getVirtualSource)(m);
+                if (src !== undefined)
+                    hop.source = src;
+                hops[j] = hop;
+            }
+            const path = hops.length === 0 ? [] : new Array(hops.length + 1);
+            if (hops.length > 0) {
+                path[0] = hops[0].left_id;
+                for (let k = 0; k < hops.length; k++) {
+                    path[k + 1] = hops[k].right_id;
+                }
+            }
+            relationships[i] = {
+                alias: rel.identifier,
+                type: rel.type,
+                hops,
+                path,
+            };
+        }
+        return { nodes, relationships };
+    }
+}
+exports.ProvenanceSites = ProvenanceSites;
+/**
+ * Shallow-copy a node record's user-visible property values, stripping
+ * `id` and the internal `_label` injected by `DataResolver`.
+ */
+function extractNodeProperties(record) {
+    const out = {};
+    for (const key of Object.keys(record)) {
+        if (key === "id" || key === "_label")
+            continue;
+        out[key] = record[key];
+    }
+    return out;
+}
+/**
+ * Shallow-copy a relationship match record's property values, stripping
+ * the structural fields (`type`, `startNode`, `endNode`, `properties`,
+ * `left_id`, `right_id`, `_type`) so what remains are the user-declared
+ * edge properties.
+ */
+function extractRelationshipProperties(match) {
+    // The match's nested `properties` field already holds the user-declared
+    // edge properties (set in `RelationshipMatchCollector.push`).  Prefer
+    // that source when present; otherwise filter the structural fields.
+    if (match.properties && typeof match.properties === "object") {
+        return Object.assign({}, match.properties);
+    }
+    const out = {};
+    for (const key of Object.keys(match)) {
+        if (key === "type" ||
+            key === "startNode" ||
+            key === "endNode" ||
+            key === "properties" ||
+            key === "left_id" ||
+            key === "right_id" ||
+            key === "_type") {
+            continue;
+        }
+        out[key] = match[key];
+    }
+    return out;
+}
+/**
+ * Stable canonical key for deduplicating a `NodeBinding` within an aggregate
+ * group.  Uses `JSON.stringify` to preserve scalar type distinctions
+ * (`1` vs `"1"`).
+ */
+function nodeBindingKey(b) {
+    var _a;
+    return `${(_a = b.alias) !== null && _a !== void 0 ? _a : ""}\x00${JSON.stringify(b.id)}`;
+}
+/**
+ * Stable canonical key for deduplicating a `RelationshipBinding` within an
+ * aggregate group.  Includes every hop so variable-length paths with the
+ * same alias but different traversals are treated as distinct.
+ */
+function relationshipBindingKey(b) {
+    var _a;
+    let s = `${(_a = b.alias) !== null && _a !== void 0 ? _a : ""}\x00`;
+    for (let i = 0; i < b.hops.length; i++) {
+        const h = b.hops[i];
+        s += `${JSON.stringify(h.left_id)}|${JSON.stringify(h.right_id)}|${h.type};`;
+    }
+    return s;
+}
+//# sourceMappingURL=provenance.js.map

package/dist/compute/provenance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"provenance.js","sourceRoot":"","sources":["../../src/compute/provenance.ts"],"names":[],"mappings":";;;;;;AA8JA,wDAOC;AAyKD,wCAEC;AAOD,wDAOC;AA7VD,6EAAoD;AAEpD,6FAAoE;AACpE,8DAA4D;AAqJ5D;;;;GAIG;AACH,SAAgB,sBAAsB,CAAC,IAAgB,EAAE,OAAmB;IACxE,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK;QAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,aAAa;QAAE,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClE,IAAI,OAAO,CAAC,YAAY,KAAK,SAAS,IAAI,OAAO,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxE,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS;YAAE,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QAC5D,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,YAAY;YAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC;AACL,CAAC;AAED;;;;;;;;GAQG;AACH,MAAa,eAAe;IAA5B;QACoB,UAAK,GAAW,EAAE,CAAC;QACnB,kBAAa,GAAmB,EAAE,CAAC;QAClC,yBAAoB,GAAgB,IAAI,GAAG,EAAE,CAAC;QAC9C,iCAA4B,GAAgB,IAAI,GAAG,EAAE,CAAC;QAC/D,uBAAkB,GAAY,KAAK,CAAC;IAsGhD,CAAC;IApGG;;;OAGG;IACH,IAAW,iBAAiB,CAAC,KAAc;QACvC,IAAI,CAAC,kBAAkB,GAAG,KAAK,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,IAAU;QACrB,IAAI,IAAI,YAAY,wBAAa;YAAE,OAAO;QAC1C,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC;QAC3B,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,OAAO;YAC9C,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,GAAiB;QACpC,IAAI,GAAG,YAAY,gCAAqB;YAAE,OAAO;QACjD,MAAM,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC;QAC1B,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,4BAA4B,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,OAAO;YACtD,IAAI,CAAC,4BAA4B,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9C,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,IAAW,OAAO;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,CAAC;IACtE,CAAC;IAED;;;;OAIG;IACI,QAAQ;;QACX,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC;QAC7C,MAAM,KAAK,GAAkB,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACvB,MAAM,OAAO,GAAgB;gBACzB,KAAK,EAAE,IAAI,CAAC,UAAU;gBACtB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,EAAE,EAAE,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAA,CAAC,CAAC,EAAE,mCAAI,IAAI,CAAC;aAC5D,CAAC;YACF,IAAI,YAAY,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBAChD,OAAO,CAAC,UAAU,GAAG,qBAAqB,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;YACD,MAAM,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,IAAA,kCAAgB,EAAC,CAAC,CAA+B,CAAC;YACvF,IAAI,GAAG,KAAK,SAAS;gBAAE,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC;YAC5C,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QACvB,CAAC;QACD,MAAM,aAAa,GAA0B,IAAI,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC;YAC5B,MAAM,IAAI,GAAsB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrB,MAAM,GAAG,GAAoB;oBACzB,OAAO,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAA,CAAC,CAAC,SAAS,CAAC,EAAE,mCAAI,IAAI,CAAC;oBAC9D,QAAQ,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAA,CAAC,CAAC,OAAO,CAAC,EAAE,mCAAI,IAAI,CAAC;oBAC3D,IAAI,EAAE,CAAC,CAAC,IAAI;iBACf,CAAC;gBACF,IAAI,YAAY,EAAE,CAAC;oBACf,GAAG,CAAC,UAAU,GAAG,6BAA6B,CAAC,CAAC,CAAC,CAAC;gBACtD,CAAC;gBACD,MAAM,GAAG,GAAG,IAAA,kCAAgB,EAAC,CAAC,CAA8B,CAAC;gBAC7D,IAAI,GAAG,KAAK,SAAS;oBAAE,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC;gBACxC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YAClB,CAAC;YACD,MAAM,IAAI,GAAU,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACxE,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAClB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;gBAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;gBACnC,CAAC;YACL,CAAC;YACD,aAAa,CAAC,CAAC,CAAC,GAAG;gBACf,KAAK,EAAE,GAAG,CAAC,UAAU;gBACrB,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,IAAI;gBACJ,IAAI;aACP,CAAC;QACN,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC;IACpC,CAAC;CACJ;AA3GD,0CA2GC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAAC,MAA2B;IACtD,MAAM,GAAG,GAAwB,EAAE,CAAC;IACpC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACpC,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,QAAQ;YAAE,SAAS;QAC/C,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAS,6BAA6B,CAAC,KAA0B;IAC7D,wEAAwE;IACxE,sEAAsE;IACtE,oEAAoE;IACpE,IAAI,KAAK,CAAC,UAAU,IAAI,OAAO,KAAK,CAAC,UAAU,KAAK,QAAQ,EAAE,CAAC;QAC3D,yBAAY,KAAK,CAAC,UAAU,EAAG;IACnC,CAAC;IACD,MAAM,GAAG,GAAwB,EAAE,CAAC;IACpC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACnC,IACI,GAAG,KAAK,MAAM;YACd,GAAG,KAAK,WAAW;YACnB,GAAG,KAAK,SAAS;YACjB,GAAG,KAAK,YAAY;YACpB,GAAG,KAAK,SAAS;YACjB,GAAG,KAAK,UAAU;YAClB,GAAG,KAAK,OAAO,EACjB,CAAC;YACC,SAAS;QACb,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAgB,cAAc,CAAC,CAAc;;IACzC,OAAO,GAAG,MAAA,CAAC,CAAC,KAAK,mCAAI,EAAE,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AACzD,CAAC;AAED;;;;GAIG;AACH,SAAgB,sBAAsB,CAAC,CAAsB;;IACzD,IAAI,CAAC,GAAG,GAAG,MAAA,CAAC,CAAC,KAAK,mCAAI,EAAE,MAAM,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC;IACjF,CAAC;IACD,OAAO,CAAC,CAAC;AACb,CAAC"}

package/dist/compute/runner.d.ts

@@ -1,6 +1,110 @@
 import ASTNode from "../parsing/ast_node";
-import { StatementInfo } from "../parsing/statement_info_crawler";
-export type { StatementInfo } from "../parsing/statement_info_crawler";
+import Operation from "../parsing/operations/operation";
+import { ColumnLineage, ColumnReference, StatementInfo } from "../parsing/statement_info_crawler";
+import { NodeBinding, RelationshipBinding, RowProvenance } from "./provenance";
+export type { ColumnLineage, ColumnReference, StatementInfo, } from "../parsing/statement_info_crawler";
+export type { DataSourceBinding, NodeBinding, RelationshipBinding, RelationshipHop, RowProvenance, } from "./provenance";
+/**
+ * One slice of runtime provenance that contributed to a result cell.
+ * Pairs the column's `ColumnReference` (i.e. `alias.property`) with the
+ * matching node or relationship binding from the row provenance.
+ */
+export interface CellBindingTrace {
+    /** The `alias.property` reference from `ColumnLineage.references` that this binding satisfies. */
+    reference: ColumnReference;
+    /**
+     * The observed value of `reference.property` on the matched
+     * record.
+     *
+     * - For nodes: `node.id` when `reference.property === 'id'`,
+     *   otherwise `node.properties?.[reference.property]`.
+     * - For relationships: built-ins (`left_id`, `right_id`, `type`)
+     *   come from `hops[0]` directly; everything else comes from
+     *   `hops[0].properties`.  For variable-length matches over
+     *   heterogeneous edges, inspect `relationship.hops` to see
+     *   per-hop values.
+     *
+     * `undefined` when the binding doesn't carry that property (e.g.
+     * an OPTIONAL MATCH miss).
+     */
+    value: any;
+    /** Present when `reference.kind === 'node'`. */
+    node?: NodeBinding;
+    /** Present when `reference.kind === 'relationship'`. */
+    relationship?: RelationshipBinding;
+}
+/**
+ * Combined lineage and provenance for a single result cell.  Bundles
+ * the structural lineage from `metadata.info.returns[column]` with the
+ * runtime bindings from `provenance[rowIndex]` that contributed to the
+ * cell.  Produced by {@link Runner.traceRow} and {@link Runner.lineage}.
+ */
+export interface CellTrace {
+    /** The output column name. */
+    column: string;
+    /** The cell value (`results[rowIndex][column]`). */
+    value: any;
+    /**
+     * Structural lineage for the column, copied from
+     * `metadata.info.returns[column]`.  `null` when the column has no
+     * recorded structural info (e.g. unusual statement shapes that
+     * don't surface a `RETURN` to the crawler).
+     */
+    lineage: ColumnLineage | null;
+    /**
+     * One entry per matching `(reference, binding)` pair for this row.
+     * Aggregate columns may have many entries (one per input row that
+     * fed the group); non-aggregate columns typically have one per
+     * distinct reference.
+     *
+     * Empty when the column is a literal, when the runner was not
+     * constructed with `{ provenance: true }`, or when no row binding
+     * matches the column's references.
+     */
+    bindings: CellBindingTrace[];
+}
+/**
+ * Combined structural lineage and per-row provenance for an entire
+ * Runner execution.  Produced by {@link Runner.lineage}.
+ */
+export interface LineageReport {
+    /**
+     * Structural per-column lineage; deep copy of
+     * `metadata.info?.returns ?? {}`.
+     */
+    columns: Record<string, ColumnLineage>;
+    /**
+     * One `{column → CellTrace}` map per result row, aligned by index
+     * with `results`.  Each `CellTrace` already pairs the structural
+     * lineage with any matching row bindings.
+     */
+    rows: Record<string, CellTrace>[];
+}
+/**
+ * Optional configuration for a {@link Runner} or {@link FlowQuery}
+ * invocation.
+ */
+export interface RunnerOptions {
+    /**
+     * When `true`, the runner records row-level data lineage alongside the
+     * results: for each emitted row, which concrete node ids and
+     * relationship `(left_id, right_id, type)` hops were bound while the
+     * row was being projected.  Access via {@link Runner.provenance}.
+     *
+     * Each {@link NodeBinding} and {@link RelationshipHop} also carries:
+     *
+     * - `properties`: a shallow copy of the matched record's user-visible
+     *   property values.
+     * - `source`: when the record came from a `CREATE VIRTUAL (:X) AS
+     *   { ... }` sub-query, the inner runner's `RowProvenance` row that
+     *   produced it.  Recursive — a virtual that matches another virtual
+     *   carries nested `source` chains.
+     *
+     * Defaults to `false`; when disabled the runner has zero provenance
+     * overhead.
+     */
+    provenance?: boolean;
+}
 /**
  * Metadata about the operations performed by a Runner execution.
  *
@@ -43,15 +147,18 @@ declare class Runner {
     private _args;
     private _isTopLevel;
     private _metadata;
+    private _options;
+    private _provenance;
     /**
      * Creates a new Runner instance and parses the FlowQuery statement.
      *
      * @param statement - The FlowQuery statement to execute (may contain semicolon-separated statements)
      * @param ast - An optional pre-parsed AST to use instead of parsing the statement
      * @param args - Optional parameters to inject into $-prefixed parameter references
+     * @param options - Optional configuration (e.g. `{ provenance: true }`)
      * @throws {Error} If the statement is null, empty, or contains syntax errors
      */
-    constructor(statement?: string | null, ast?: ASTNode | null, args?: Record<string, any> | null);
+    constructor(statement?: string | null, ast?: ASTNode | null, args?: Record<string, any> | null, options?: RunnerOptions);
     private static toStatement;
     /**
      * Walks all statement ASTs to count CREATE/DELETE operations and to
@@ -66,6 +173,34 @@ declare class Runner {
      * @throws {Error} If an error occurs during execution
      */
     run(): Promise<void>;
+    /**
+     * Walks the terminal statement's operation chain and wires every
+     * MATCH-bound `Node` / `Relationship` slot to the operation that
+     * will project it.  Aggregation boundaries (`AggregatedWith`,
+     * `AggregatedReturn`) absorb upstream sites into their group-level
+     * accumulation; aggregations downstream of one another chain via
+     * each `AggregatedWith` re-exposing itself as a provenance source
+     * for the next consumer.
+     *
+     * Only the last statement may produce rows; preceding statements
+     * are limited to CREATE / DELETE / REFRESH / DROP and never need
+     * row-level provenance.
+     */
+    private enableProvenance;
+    /**
+     * Walk `first..terminal`, accumulating live MATCH sites into the
+     * "active" source list and handing it off at every aggregation
+     * boundary.  Each `AggregatedWith` consumes the active list and then
+     * re-publishes itself as the single active source going forward.
+     * `Load` operations contribute per-row data-source bindings.
+     *
+     * Exposed as a public static so other components (e.g. `Let` when
+     * running a sub-query right-hand side) can wire provenance for an
+     * operation chain they drive directly, without going through the
+     * full `Runner.run` lifecycle.
+     */
+    static wireProvenance(first: Operation, sink: RowProvenance[]): void;
+    private static collectSitesFromPattern;
     /**
      * Recursively walks the AST to bind ParameterReference nodes
      * to the args provided to this Runner.
@@ -92,6 +227,64 @@ declare class Runner {
      * subsequent reads.
      */
     get metadata(): RunnerMetadata;
+    /**
+     * Row-level data lineage aligned by index with {@link results}.
+     *
+     * Each {@link RowProvenance} entry lists the concrete `id` values of the
+     * node slots and the `(left_id, right_id, type)` hops of the
+     * relationship slots that were bound while the corresponding result row
+     * was being projected.
+     *
+     * Returns an empty array unless the runner was constructed with
+     * `{ provenance: true }` or the query produced no rows.
+     */
+    get provenance(): RowProvenance[];
+    /**
+     * Convenience method that bundles structural lineage with row-level
+     * provenance for a single result row.  Returns one {@link CellTrace}
+     * per output column, pairing the column's
+     * {@link ColumnLineage | structural lineage} (from
+     * {@link metadata}`.info.returns`) with the node / relationship
+     * bindings (from {@link provenance}) whose alias matches one of the
+     * column's references.
+     *
+     * Equivalent to manually correlating `metadata.info.returns[col]`
+     * with `provenance[rowIndex].nodes` / `.relationships`, but with
+     * the `(alias, property) -> binding` join and the per-property
+     * value extraction done for you.
+     *
+     * @param rowIndex - Zero-based index into {@link results}.
+     * @returns A `{column -> CellTrace}` map aligned with the row.
+     * @throws {RangeError} If `rowIndex` is out of bounds for `results`.
+     */
+    traceRow(rowIndex: number): Record<string, CellTrace>;
+    /**
+     * One-shot combined lineage and provenance report for the entire
+     * Runner execution.  Returns the structural per-column lineage
+     * (deep copy of `metadata.info?.returns`) alongside one
+     * {@link traceRow} map per result row.
+     *
+     * Useful as a single object to hand to a UI, dump to a log, or
+     * snapshot for debugging.  For per-cell lookups during normal flow,
+     * {@link traceRow} is cheaper.
+     */
+    lineage(): LineageReport;
+    private static cloneColumnLineage;
+    /**
+     * Resolve `binding.property` against a captured `NodeBinding`.
+     * The built-in `id` lives at the top of the binding (it's excluded
+     * from `properties`); everything else comes from `properties`.
+     */
+    private static readNodeProperty;
+    /**
+     * Resolve `binding.property` against a captured `RelationshipBinding`.
+     * Returns the value from `hops[0]`: the built-ins `left_id`,
+     * `right_id`, and `type` come from the hop itself, while everything
+     * else comes from `hops[0].properties`.  For variable-length matches
+     * with heterogeneous hops, inspect `relationship.hops` directly to
+     * see per-hop values.
+     */
+    private static readRelationshipProperty;
 }
 export default Runner;
 //# sourceMappingURL=runner.d.ts.map

package/dist/compute/runner.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"runner.d.ts","sourceRoot":"","sources":["../../src/compute/runner.ts"],"names":[],"mappings":"AAGA,OAAO,OAAO,MAAM,qBAAqB,CAAC;AAS1C,OAA6B,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAExF,YAAY,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAEvE;;;;;;;GAOG;AACH,MAAM,WAAW,cAAc;IAC3B,qBAAqB,EAAE,MAAM,CAAC;IAC9B,6BAA6B,EAAE,MAAM,CAAC;IACtC,qBAAqB,EAAE,MAAM,CAAC;IAC9B,6BAA6B,EAAE,MAAM,CAAC;IACtC;;;OAGG;IACH,IAAI,CAAC,EAAE,aAAa,CAAC;CACxB;AAQD;;;;;;;;;;;;;;;;;GAiBG;AACH,cAAM,MAAM;IACR,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,KAAK,CAAoC;IACjD,OAAO,CAAC,WAAW,CAAU;IAC7B,OAAO,CAAC,SAAS,CAAiB;IAElC;;;;;;;OAOG;gBAEC,SAAS,GAAE,MAAM,GAAG,IAAW,EAC/B,GAAG,GAAE,OAAO,GAAG,IAAW,EAC1B,IAAI,GAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAW;IAqB3C,OAAO,CAAC,MAAM,CAAC,WAAW;IAQ1B;;;;OAIG;IACH,OAAO,CAAC,eAAe;IAqBvB;;;;;OAKG;IACU,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;IA8BjC;;;;;OAKG;IACH,OAAO,CAAC,cAAc;IAetB;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IAS3B;;;;OAIG;IACH,IAAW,OAAO,IAAI,GAAG,CAExB;IAED;;;;;OAKG;IACH,IAAW,QAAQ,IAAI,cAAc,CASpC;CACJ;AAED,eAAe,MAAM,CAAC"}
+{"version":3,"file":"runner.d.ts","sourceRoot":"","sources":["../../src/compute/runner.ts"],"names":[],"mappings":"AAMA,OAAO,OAAO,MAAM,qBAAqB,CAAC;AAW1C,OAAO,SAAS,MAAM,iCAAiC,CAAC;AAIxD,OAA6B,EACzB,aAAa,EACb,eAAe,EACf,aAAa,EAChB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAEH,WAAW,EAGX,mBAAmB,EACnB,aAAa,EAChB,MAAM,cAAc,CAAC;AAEtB,YAAY,EACR,aAAa,EACb,eAAe,EACf,aAAa,GAChB,MAAM,mCAAmC,CAAC;AAC3C,YAAY,EACR,iBAAiB,EACjB,WAAW,EACX,mBAAmB,EACnB,eAAe,EACf,aAAa,GAChB,MAAM,cAAc,CAAC;AAEtB;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC7B,kGAAkG;IAClG,SAAS,EAAE,eAAe,CAAC;IAC3B;;;;;;;;;;;;;;OAcG;IACH,KAAK,EAAE,GAAG,CAAC;IACX,gDAAgD;IAChD,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,wDAAwD;IACxD,YAAY,CAAC,EAAE,mBAAmB,CAAC;CACtC;AAED;;;;;GAKG;AACH,MAAM,WAAW,SAAS;IACtB,8BAA8B;IAC9B,MAAM,EAAE,MAAM,CAAC;IACf,oDAAoD;IACpD,KAAK,EAAE,GAAG,CAAC;IACX;;;;;OAKG;IACH,OAAO,EAAE,aAAa,GAAG,IAAI,CAAC;IAC9B;;;;;;;;;OASG;IACH,QAAQ,EAAE,gBAAgB,EAAE,CAAC;CAChC;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC1B;;;OAGG;IACH,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACvC;;;;OAIG;IACH,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC;CACrC;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC1B;;;;;;;;;;;;;;;;;OAiBG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;CACxB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,cAAc;IAC3B,qBAAqB,EAAE,MAAM,CAAC;IAC9B,6BAA6B,EAAE,MAAM,CAAC;IACtC,qBAAqB,EAAE,MAAM,CAAC;IAC9B,6BAA6B,EAAE,MAAM,CAAC;IACtC;;;OAGG;IACH,IAAI,CAAC,EAAE,aAAa,CAAC;CACxB;AAQD;;;;;;;;;;;;;;;;;GAiBG;AACH,cAAM,MAAM;IACR,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,KAAK,CAAoC;IACjD,OAAO,CAAC,WAAW,CAAU;IAC7B,OAAO,CAAC,SAAS,CAAiB;IAClC,OAAO,CAAC,QAAQ,CAAgB;IAChC,OAAO,CAAC,WAAW,CAAgC;IAEnD;;;;;;;;OAQG;gBAEC,SAAS,GAAE,MAAM,GAAG,IAAW,EAC/B,GAAG,GAAE,OAAO,GAAG,IAAW,EAC1B,IAAI,GAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAW,EACvC,OAAO,GAAE,aAAkB;IAsB/B,OAAO,CAAC,MAAM,CAAC,WAAW;IAQ1B;;;;OAIG;IACH,OAAO,CAAC,eAAe;IAqBvB;;;;;OAKG;IACU,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;IAoCjC;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,gBAAgB;IAMxB;;;;;;;;;;;OAWG;WACW,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,aAAa,EAAE,GAAG,IAAI;IAwE3E,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAUtC;;;;;OAKG;IACH,OAAO,CAAC,cAAc;IAetB;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IAS3B;;;;OAIG;IACH,IAAW,OAAO,IAAI,GAAG,CAExB;IAED;;;;;OAKG;IACH,IAAW,QAAQ,IAAI,cAAc,CASpC;IAED;;;;;;;;;;OAUG;IACH,IAAW,UAAU,IAAI,aAAa,EAAE,CAEvC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACI,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC;IAgD5D;;;;;;;;;OASG;IACI,OAAO,IAAI,aAAa;IAe/B,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAcjC;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,gBAAgB;IAK/B;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;CAQ1C;AAED,eAAe,MAAM,CAAC"}