@bevorai/sdk 0.0.0-stage → 0.1.0

package/dist/graph/cursor.js

@@ -0,0 +1,149 @@
+/**
+ * A movable position in the graph that remembers its path.
+ *
+ * Full execution-path DFS:
+ * ```ts
+ * const cursor = graph.cursor(nodeId);
+ * while (true) {
+ *   if (cursor.gotoFirstChild()) continue;
+ *   if (cursor.gotoNextSibling()) continue;
+ *   if (!cursor.back()) break;
+ * }
+ * ```
+ *
+ * Adding `if (cursor.gotoFirstParent()) continue;` before `back()` also walks out of the execution
+ * path into cross pathways ("what else writes this", "where else is this called"). Use `peekUp()`,
+ * or pass an `edgeType` to only allow that for certain edges.
+ */
+export class GraphCursor {
+    graph;
+    nodeId;
+    /** Edges taken from the current position, on this path. */
+    used = new Set();
+    stack = [];
+    constructor(graph, nodeId) {
+        this.graph = graph;
+        this.nodeId = nodeId;
+    }
+    get node() {
+        return this.graph.getNode(this.nodeId);
+    }
+    get depth() {
+        return this.stack.length;
+    }
+    get path() {
+        return this.stack.map(([nodeId]) => nodeId);
+    }
+    get isCycle() {
+        return this.path.includes(this.nodeId);
+    }
+    /**
+     * Takes the first unused outgoing edge. Moves onto its destination when it has one; an edge
+     * without a destination isn't a real node, so the cursor stays put but the edge is consumed.
+     */
+    gotoFirstChild() {
+        if (this.isCycle)
+            return null;
+        for (const edge of this.graph.getEdgesForNode(this.nodeId, {
+            direction: "out",
+        })) {
+            if (this.used.has(edge.id))
+                continue;
+            this.used = new Set([...this.used, edge.id]);
+            if (edge.dst_id) {
+                this.stack = [...this.stack, [this.nodeId, this.used]];
+                this.nodeId = edge.dst_id;
+                this.used = new Set();
+            }
+            return edge;
+        }
+        return null;
+    }
+    gotoFirstParent(edgeType = null) {
+        if (this.stack.length === 0 || this.isCycle)
+            return null;
+        for (const edge of this.graph.getEdgesForNode(this.nodeId, {
+            direction: "in",
+            edgeType,
+        })) {
+            if (this.used.has(edge.id))
+                continue;
+            this.used = new Set([...this.used, edge.id]);
+            this.stack = [...this.stack, [this.nodeId, this.used]];
+            this.nodeId = edge.src_id;
+            this.used = new Set();
+            return edge;
+        }
+        return null;
+    }
+    gotoNextSibling() {
+        const [nodeId, used, stack] = [this.nodeId, this.used, this.stack];
+        if (!this.back())
+            return null;
+        const edge = this.gotoFirstChild();
+        if (edge?.dst_id)
+            return edge;
+        const parentUsed = this.used;
+        [this.nodeId, this.used, this.stack] = [nodeId, used, stack];
+        if (edge !== null) {
+            // a sibling without a destination: stay put, but keep it consumed on the parent
+            const [parentId] = this.stack[this.stack.length - 1];
+            this.stack = [...this.stack.slice(0, -1), [parentId, parentUsed]];
+        }
+        return edge;
+    }
+    back() {
+        const top = this.stack[this.stack.length - 1];
+        if (!top)
+            return false;
+        [this.nodeId, this.used] = top;
+        this.stack = this.stack.slice(0, -1);
+        return true;
+    }
+    peekUp() {
+        if (this.stack.length === 0 || this.isCycle)
+            return [];
+        return this.graph
+            .getEdgesForNode(this.nodeId, { direction: "in" })
+            .filter((edge) => !this.used.has(edge.id))
+            .map((edge) => [edge, this.graph.getNode(edge.src_id)]);
+    }
+    peekDown() {
+        if (this.isCycle)
+            return [];
+        const out = [];
+        for (const edge of this.graph.getEdgesForNode(this.nodeId, {
+            direction: "out",
+        })) {
+            if (edge.dst_id && !this.used.has(edge.id))
+                out.push([edge, this.graph.getNode(edge.dst_id)]);
+        }
+        return out;
+    }
+    render(source = null) {
+        const node = this.node;
+        const path = this.stack.map(([nodeId]) => this.graph.getNode(nodeId));
+        const lines = [
+            `Path: ${[...path, node].map((n) => n.name).join(" > ")}`,
+            `At: ${node.name} (${node.node_type})`,
+        ];
+        if (node.signature)
+            lines.push(node.signature);
+        if (source !== null)
+            lines.push("", source);
+        const down = this.peekDown();
+        const up = this.peekUp();
+        const external = this.graph
+            .getEdgesForNode(this.nodeId, { direction: "out" })
+            .filter((edge) => !edge.dst_id);
+        if (down.length)
+            lines.push("", "Children:", ...down.map(([e, n]) => `→ ${e.edge_type} ${n.name}`));
+        if (up.length)
+            lines.push("", "Parents:", ...up.map(([e, n]) => `← ${e.edge_type} ${n.name}`));
+        if (external.length) {
+            lines.push("", "External:", ...external.map((e) => `⇢ ${e.edge_type} ${e.low_level_name || "unknown"}`));
+        }
+        return lines.join("\n");
+    }
+}
+//# sourceMappingURL=cursor.js.map

package/dist/graph/cursor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cursor.js","sourceRoot":"","sources":["../../src/graph/cursor.ts"],"names":[],"mappings":"AASA;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,OAAO,WAAW;IACd,KAAK,CAAQ;IACtB,MAAM,CAAK;IACX,2DAA2D;IAC3D,IAAI,GAAoB,IAAI,GAAG,EAAE,CAAC;IAClC,KAAK,GAAqB,EAAE,CAAC;IAE7B,YAAY,KAAY,EAAE,MAAU;QACnC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,CAAC;IAED,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAED,IAAI,KAAK;QACR,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC;IAED,IAAI,OAAO;QACV,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAED;;;OAGG;IACH,cAAc;QACb,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE;YAC1D,SAAS,EAAE,KAAK;SAChB,CAAC,EAAE,CAAC;YACJ,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YACrC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBACjB,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBACvD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;gBAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACvB,CAAC;YACD,OAAO,IAAI,CAAC;QACb,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,eAAe,CAAC,QAAQ,GAAoB,IAAI;QAC/C,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QACzD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE;YAC1D,SAAS,EAAE,IAAI;YACf,QAAQ;SACR,CAAC,EAAE,CAAC;YACJ,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YACrC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACvD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC;QACb,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,eAAe;QACd,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACnE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YAAE,OAAO,IAAI,CAAC;QAE9B,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACnC,IAAI,IAAI,EAAE,MAAM;YAAE,OAAO,IAAI,CAAC;QAE9B,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC;QAC7B,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC7D,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YACnB,gFAAgF;YAChF,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAU,CAAC;YAC9D,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,IAAI;QACH,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC,GAAG;YAAE,OAAO,KAAK,CAAC;QACvB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM;QACL,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QACvD,OAAO,IAAI,CAAC,KAAK;aACf,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;aACjD,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACzC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,QAAQ;QACP,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QAC5B,MAAM,GAAG,GAA6C,EAAE,CAAC;QACzD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE;YAC1D,SAAS,EAAE,KAAK;SAChB,CAAC,EAAE,CAAC;YACJ,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAED,MAAM,CAAC,MAAM,GAAkB,IAAI;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QAEtE,MAAM,KAAK,GAAG;YACb,SAAS,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;YACzD,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,SAAS,GAAG;SACtC,CAAC;QACF,IAAI,IAAI,CAAC,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,MAAM,KAAK,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAE5C,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK;aACzB,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;aAClD,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEjC,IAAI,IAAI,CAAC,MAAM;YACd,KAAK,CAAC,IAAI,CACT,EAAE,EACF,WAAW,EACX,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CACrD,CAAC;QACH,IAAI,EAAE,CAAC,MAAM;YACZ,KAAK,CAAC,IAAI,CACT,EAAE,EACF,UAAU,EACV,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CACnD,CAAC;QACH,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CACT,EAAE,EACF,WAAW,EACX,GAAG,QAAQ,CAAC,GAAG,CACd,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,cAAc,IAAI,SAAS,EAAE,CAC1D,CACD,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;CACD"}

package/dist/graph/field-metadata.d.ts

@@ -0,0 +1,24 @@
+import type { ConstraintItem, FieldMetadataItem } from "../types/graph-data.js";
+/** Accessors for the constraints on a node field (e.g. Anchor account constraints). */
+export declare class FieldMetadata {
+    readonly item: FieldMetadataItem;
+    constructor(item: FieldMetadataItem);
+    get constraints(): ConstraintItem[];
+    getConstraint(name: string): ConstraintItem | null;
+    hasConstraint(name: string): boolean;
+    isMutable(): boolean;
+    isInit(): boolean;
+    isInitIfNeeded(): boolean;
+    isSigner(): boolean;
+    payer(): ConstraintItem["value"];
+    space(): ConstraintItem["value"];
+    close(): ConstraintItem["value"];
+    address(): ConstraintItem["value"];
+    /** Values of every `has_one` constraint that carries a single string. */
+    hasOne(): string[];
+    seeds(): string[] | null;
+    constraint(): ConstraintItem["value"];
+    /** Serializes like the Python SDK's `FieldMetadataItem.to_dict` (omits `value` and empty fields). */
+    toDict(): FieldMetadataItem;
+}
+//# sourceMappingURL=field-metadata.d.ts.map

package/dist/graph/field-metadata.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"field-metadata.d.ts","sourceRoot":"","sources":["../../src/graph/field-metadata.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAEhF,uFAAuF;AACvF,qBAAa,aAAa;IACzB,QAAQ,CAAC,IAAI,EAAE,iBAAiB,CAAC;IAEjC,YAAY,IAAI,EAAE,iBAAiB,EAElC;IAED,IAAI,WAAW,IAAI,cAAc,EAAE,CAElC;IAED,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,GAAG,IAAI,CAEjD;IAED,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAEnC;IAED,SAAS,IAAI,OAAO,CAEnB;IAED,MAAM,IAAI,OAAO,CAEhB;IAED,cAAc,IAAI,OAAO,CAExB;IAED,QAAQ,IAAI,OAAO,CAElB;IAED,KAAK,IAAI,cAAc,CAAC,OAAO,CAAC,CAE/B;IAED,KAAK,IAAI,cAAc,CAAC,OAAO,CAAC,CAE/B;IAED,KAAK,IAAI,cAAc,CAAC,OAAO,CAAC,CAE/B;IAED,OAAO,IAAI,cAAc,CAAC,OAAO,CAAC,CAEjC;IAED,yEAAyE;IACzE,MAAM,IAAI,MAAM,EAAE,CAIjB;IAED,KAAK,IAAI,MAAM,EAAE,GAAG,IAAI,CAGvB;IAED,UAAU,IAAI,cAAc,CAAC,OAAO,CAAC,CAEpC;IAED,qGAAqG;IACrG,MAAM,IAAI,iBAAiB,CAkB1B;CACD"}

package/dist/graph/field-metadata.js

@@ -0,0 +1,72 @@
+/** Accessors for the constraints on a node field (e.g. Anchor account constraints). */
+export class FieldMetadata {
+    item;
+    constructor(item) {
+        this.item = item;
+    }
+    get constraints() {
+        return this.item.constraints ?? [];
+    }
+    getConstraint(name) {
+        return this.constraints.find((c) => c.name === name) ?? null;
+    }
+    hasConstraint(name) {
+        return this.constraints.some((c) => c.name === name);
+    }
+    isMutable() {
+        return this.hasConstraint("mut");
+    }
+    isInit() {
+        return this.hasConstraint("init");
+    }
+    isInitIfNeeded() {
+        return this.hasConstraint("init_if_needed");
+    }
+    isSigner() {
+        return this.hasConstraint("signer");
+    }
+    payer() {
+        return this.getConstraint("payer")?.value ?? null;
+    }
+    space() {
+        return this.getConstraint("space")?.value ?? null;
+    }
+    close() {
+        return this.getConstraint("close")?.value ?? null;
+    }
+    address() {
+        return this.getConstraint("address")?.value ?? null;
+    }
+    /** Values of every `has_one` constraint that carries a single string. */
+    hasOne() {
+        return this.constraints
+            .filter((c) => c.name === "has_one" && typeof c.value === "string")
+            .map((c) => c.value);
+    }
+    seeds() {
+        const value = this.getConstraint("seeds")?.value;
+        return Array.isArray(value) ? value : null;
+    }
+    constraint() {
+        return this.getConstraint("constraint")?.value ?? null;
+    }
+    /** Serializes like the Python SDK's `FieldMetadataItem.to_dict` (omits `value` and empty fields). */
+    toDict() {
+        const out = { name: this.item.name };
+        if (this.item.type)
+            out.type = this.item.type;
+        if (this.item.mutability)
+            out.mutability = this.item.mutability;
+        if (this.item.discriminant !== null &&
+            this.item.discriminant !== undefined) {
+            out.discriminant = this.item.discriminant;
+        }
+        if (this.constraints.length) {
+            out.constraints = this.constraints.map((c) => c.value === null || c.value === undefined
+                ? { name: c.name }
+                : { name: c.name, value: c.value });
+        }
+        return out;
+    }
+}
+//# sourceMappingURL=field-metadata.js.map

package/dist/graph/field-metadata.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"field-metadata.js","sourceRoot":"","sources":["../../src/graph/field-metadata.ts"],"names":[],"mappings":"AAEA,uFAAuF;AACvF,MAAM,OAAO,aAAa;IAChB,IAAI,CAAoB;IAEjC,YAAY,IAAuB;QAClC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IAClB,CAAC;IAED,IAAI,WAAW;QACd,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC;IACpC,CAAC;IAED,aAAa,CAAC,IAAY;QACzB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC;IAC9D,CAAC;IAED,aAAa,CAAC,IAAY;QACzB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IACtD,CAAC;IAED,SAAS;QACR,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,MAAM;QACL,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;IAED,cAAc;QACb,OAAO,IAAI,CAAC,aAAa,CAAC,gBAAgB,CAAC,CAAC;IAC7C,CAAC;IAED,QAAQ;QACP,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;IACrC,CAAC;IAED,KAAK;QACJ,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC;IACnD,CAAC;IAED,KAAK;QACJ,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC;IACnD,CAAC;IAED,KAAK;QACJ,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC;IACnD,CAAC;IAED,OAAO;QACN,OAAO,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC;IACrD,CAAC;IAED,yEAAyE;IACzE,MAAM;QACL,OAAO,IAAI,CAAC,WAAW;aACrB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,OAAO,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC;aAClE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAe,CAAC,CAAC;IACjC,CAAC;IAED,KAAK;QACJ,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC;QACjD,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IAC5C,CAAC;IAED,UAAU;QACT,OAAO,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC;IACxD,CAAC;IAED,qGAAqG;IACrG,MAAM;QACL,MAAM,GAAG,GAAsB,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACxD,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAC9C,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;QAChE,IACC,IAAI,CAAC,IAAI,CAAC,YAAY,KAAK,IAAI;YAC/B,IAAI,CAAC,IAAI,CAAC,YAAY,KAAK,SAAS,EACnC,CAAC;YACF,GAAG,CAAC,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC;QAC3C,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;YAC7B,GAAG,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAC5C,CAAC,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS;gBACxC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE;gBAClB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CACnC,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;CACD"}

package/dist/graph/graph.d.ts

@@ -0,0 +1,87 @@
+import type { BevorClient } from "../client.js";
+import type { EdgeDirection, EdgeType, ID, Language } from "../types/literals.js";
+import type { GraphSnapshotEdge, GraphSnapshotFile, GraphSnapshotNode } from "../types/responses.js";
+import { CallNode } from "./call-node.js";
+import { GraphCursor } from "./cursor.js";
+export interface GraphSnapshot {
+    nodes: GraphSnapshotNode[];
+    edges: GraphSnapshotEdge[];
+    files: GraphSnapshotFile[];
+}
+export interface EdgeFilter {
+    direction?: EdgeDirection | null;
+    edgeType?: EdgeType | null;
+}
+/**
+ * Language-agnostic graph view for one code version, backed by HTTP only.
+ *
+ * Call `build()` after construction, or use `Graph.fromSnapshot` for an already-fetched snapshot.
+ */
+export declare class Graph {
+    #private;
+    readonly codeId: ID;
+    edges: GraphSnapshotEdge[];
+    fileMap: Map<string, GraphSnapshotFile>;
+    /** file id -> ids of the nodes in that file */
+    sourceMap: Map<string, string[]>;
+    nodeMap: Map<string, GraphSnapshotNode>;
+    /** short id -> id */
+    idMap: Map<string, string>;
+    /** id -> short id */
+    reverseIdMap: Map<string, string>;
+    constructor(client: BevorClient, codeId: ID);
+    static fromSnapshot(client: BevorClient, codeId: ID, snapshot: GraphSnapshot): Graph;
+    get isBuilt(): boolean;
+    /** Fetches the snapshot (nodes, edges and files). No-op once built. */
+    build(): Promise<void>;
+    /** Fetches a file's text once and caches it. */
+    getFileContent(fileId: ID): Promise<string>;
+    /**
+     * The node's source, with oversized hex/string literals elided.
+     * With `withDocstring`, prefixes the docstring, following `@inheritdoc` to the referenced natspec.
+     */
+    reconstructChunk(nodeId: ID, { withDocstring }?: {
+        withDocstring?: boolean;
+    }): Promise<string>;
+    static reconstruct(node: GraphSnapshotNode, source: Uint8Array, docstring?: string | null): string;
+    getShortFromId(nodeId: ID): string;
+    getIdFromShort(shortId: string): ID;
+    getAllNodes(): GraphSnapshotNode[];
+    /** Nodes with no incoming edges. */
+    getRootNodes(): GraphSnapshotNode[];
+    getAllFiles(): GraphSnapshotFile[];
+    exists(nodeId: ID): boolean;
+    existsShortId(shortId: string): boolean;
+    getNode(nodeId: ID): GraphSnapshotNode;
+    getFile(fileId: ID): GraphSnapshotFile;
+    /** Distinct languages in this snapshot (e.g. Solidity + Rust in a monorepo). */
+    get languages(): ReadonlySet<Language>;
+    getNodeLanguage(nodeId: ID): Language;
+    /**
+     * Edges touching a node: outgoing first (by source position), then incoming.
+     * Each returned edge is a copy with `direction` set relative to `nodeId`.
+     */
+    getEdgesForNode(nodeId: ID, { direction, edgeType }?: EdgeFilter): GraphSnapshotEdge[];
+    /** All edges, optionally of one type. Edges have no direction unless queried against a node. */
+    getEdges({ edgeType, }?: {
+        edgeType?: EdgeType | null;
+    }): GraphSnapshotEdge[];
+    /** Resolves a snapshot edge by its row id. */
+    getEdgeById(edgeId: ID): GraphSnapshotEdge | null;
+    /** Walks incoming edges until it reaches a node of `nodeType`. */
+    traverseUpToNodeType(nodeId: ID, nodeType: string): GraphSnapshotNode | null;
+    getNodesInFile(fileId: ID): ID[];
+    /** Shortest path length treating the graph as undirected (-1 if disconnected). */
+    getDistance(fromNodeId: ID, toNodeId: ID): number;
+    /** True if `parentId` is reachable from `childId` following incoming `calls` edges. */
+    isDescendant(childId: ID, parentId: ID): boolean;
+    getCallChain(nodeId: ID): CallNode;
+    cursor(nodeId: ID): GraphCursor;
+    /** Depth-first search along outgoing edges for a node with `merkleHash`. */
+    getDescendantByMerkle(nodeId: ID, merkleHash: string): ID | null;
+    getCallableTypes(language: Language): Set<string>;
+    getDeclarationTypes(language: Language): Set<string>;
+    getExcludeTypes(language: Language): Set<string>;
+    getContainerTypes(language: Language): Set<string>;
+}
+//# sourceMappingURL=graph.d.ts.map

package/dist/graph/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/graph/graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,KAAK,EACX,aAAa,EACb,QAAQ,EACR,EAAE,EACF,QAAQ,EACR,MAAM,sBAAsB,CAAC;AAC9B,OAAO,KAAK,EACX,iBAAiB,EACjB,iBAAiB,EACjB,iBAAiB,EACjB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE1C,MAAM,WAAW,aAAa;IAC7B,KAAK,EAAE,iBAAiB,EAAE,CAAC;IAC3B,KAAK,EAAE,iBAAiB,EAAE,CAAC;IAC3B,KAAK,EAAE,iBAAiB,EAAE,CAAC;CAC3B;AAED,MAAM,WAAW,UAAU;IAC1B,SAAS,CAAC,EAAE,aAAa,GAAG,IAAI,CAAC;IACjC,QAAQ,CAAC,EAAE,QAAQ,GAAG,IAAI,CAAC;CAC3B;AAqBD;;;;GAIG;AACH,qBAAa,KAAK;;IACjB,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;IAIpB,KAAK,EAAE,iBAAiB,EAAE,CAAM;IAChC,OAAO,iCAAoC;IAC3C,+CAA+C;IAC/C,SAAS,wBAAuB;IAChC,OAAO,iCAAoC;IAC3C,qBAAqB;IACrB,KAAK,sBAAyB;IAC9B,qBAAqB;IACrB,YAAY,sBAAyB;IAOrC,YAAY,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE,EAG1C;IAED,MAAM,CAAC,YAAY,CAClB,MAAM,EAAE,WAAW,EACnB,MAAM,EAAE,EAAE,EACV,QAAQ,EAAE,aAAa,GACrB,KAAK,CAIP;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,uEAAuE;IACjE,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAY3B;IAED,gDAAgD;IAC1C,cAAc,CAAC,MAAM,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAMhD;IAED;;;OAGG;IACG,gBAAgB,CACrB,MAAM,EAAE,EAAE,EACV,EAAE,aAAqB,EAAE,GAAE;QAAE,aAAa,CAAC,EAAE,OAAO,CAAA;KAAO,GACzD,OAAO,CAAC,MAAM,CAAC,CA0BjB;IAED,MAAM,CAAC,WAAW,CACjB,IAAI,EAAE,iBAAiB,EACvB,MAAM,EAAE,UAAU,EAClB,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,GACvB,MAAM,CAKR;IAoDD,cAAc,CAAC,MAAM,EAAE,EAAE,GAAG,MAAM,CAEjC;IAED,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,EAAE,CAElC;IAED,WAAW,IAAI,iBAAiB,EAAE,CAGjC;IAED,oCAAoC;IACpC,YAAY,IAAI,iBAAiB,EAAE,CAIlC;IAED,WAAW,IAAI,iBAAiB,EAAE,CAGjC;IAED,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,OAAO,CAE1B;IAED,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAEtC;IAED,OAAO,CAAC,MAAM,EAAE,EAAE,GAAG,iBAAiB,CAGrC;IAED,OAAO,CAAC,MAAM,EAAE,EAAE,GAAG,iBAAiB,CAGrC;IAED,gFAAgF;IAChF,IAAI,SAAS,IAAI,WAAW,CAAC,QAAQ,CAAC,CAGrC;IAED,eAAe,CAAC,MAAM,EAAE,EAAE,GAAG,QAAQ,CAEpC;IAED;;;OAGG;IACH,eAAe,CACd,MAAM,EAAE,EAAE,EACV,EAAE,SAAgB,EAAE,QAAe,EAAE,GAAE,UAAe,GACpD,iBAAiB,EAAE,CAmBrB;IAED,gGAAgG;IAChG,QAAQ,CAAC,EACR,QAAe,GACf,GAAE;QACF,QAAQ,CAAC,EAAE,QAAQ,GAAG,IAAI,CAAC;KACtB,GAAG,iBAAiB,EAAE,CAK3B;IAED,8CAA8C;IAC9C,WAAW,CAAC,MAAM,EAAE,EAAE,GAAG,iBAAiB,GAAG,IAAI,CAGhD;IAED,kEAAkE;IAClE,oBAAoB,CAAC,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,GAAG,iBAAiB,GAAG,IAAI,CAa3E;IAED,cAAc,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,EAAE,CAG/B;IAED,kFAAkF;IAClF,WAAW,CAAC,UAAU,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,GAAG,MAAM,CAqBhD;IAED,uFAAuF;IACvF,YAAY,CAAC,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,GAAG,OAAO,CAgB/C;IAED,YAAY,CAAC,MAAM,EAAE,EAAE,GAAG,QAAQ,CAEjC;IAED,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,WAAW,CAE9B;IAED,4EAA4E;IAC5E,qBAAqB,CAAC,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,MAAM,GAAG,EAAE,GAAG,IAAI,CAa/D;IAED,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAShD;IAED,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAWnD;IAED,eAAe,CAAC,QAAQ,EAAE,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAI/C;IAED,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAQjD;CACD"}