@hebbianvault/mcp 0.5.0 → 0.6.0

package/dist/tools/traverse.d.ts

@@ -1,13 +1,7 @@
 /**
- * src/tools/traverse.ts
- *
  * Tool: hebbian_traverse
- * Walk the workspace graph outward from a starting node up to N hops.
  *
- * Built over the scoped workspace graph (GET /vault/graph), where each node
- * carries its inline edges. We do a breadth-first walk from the start node;
- * only nodes the caller's token may see are present in the graph, so traversal
- * never crosses an access boundary.
+ * Return a bounded, weight-ranked neighbourhood from the scoped workspace graph.
  */
 import type { Tool } from "@modelcontextprotocol/sdk/types.js";
 import type { HebbianClient } from "../client.js";

package/dist/tools/traverse.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"traverse.d.ts","sourceRoot":"","sources":["../../src/tools/traverse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,oCAAoC,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAQlD,eAAO,MAAM,gBAAgB,EAAE,IA+B9B,CAAC;AAEF,UAAU,YAAY;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AASD,wBAAsB,cAAc,CAClC,MAAM,EAAE,aAAa,EACrB,IAAI,EAAE,YAAY,GACjB,OAAO,CAAC,MAAM,CAAC,CAwFjB"}
+{"version":3,"file":"traverse.d.ts","sourceRoot":"","sources":["../../src/tools/traverse.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,oCAAoC,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAgBlD,eAAO,MAAM,gBAAgB,EAAE,IAgC9B,CAAC;AAEF,UAAU,YAAY;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAyFD,wBAAsB,cAAc,CAClC,MAAM,EAAE,aAAa,EACrB,IAAI,EAAE,YAAY,GACjB,OAAO,CAAC,MAAM,CAAC,CA8LjB"}

package/dist/tools/traverse.js

@@ -1,19 +1,21 @@
 /**
- * src/tools/traverse.ts
- *
  * Tool: hebbian_traverse
- * Walk the workspace graph outward from a starting node up to N hops.
  *
- * Built over the scoped workspace graph (GET /vault/graph), where each node
- * carries its inline edges. We do a breadth-first walk from the start node;
- * only nodes the caller's token may see are present in the graph, so traversal
- * never crosses an access boundary.
+ * Return a bounded, weight-ranked neighbourhood from the scoped workspace graph.
  */
 import { HebbianApiError } from "../client.js";
 import { fetchGraph, normaliseEdge, summarise } from "./graph_helpers.js";
-import { stringifyUntrustedResult } from "./untrusted_content.js";
+import { frameUntrustedText, stringifyUntrustedResult } from "./untrusted_content.js";
 const MAX_HOPS = 3;
 const DEFAULT_HOPS = 2;
+// neighbourhood_v0 response budgets. PROVISIONAL — not ratified by any lane, including
+// graph. Ported from the Python reference (py/src/hebbianvault_mcp/tools.py:39-41), but the
+// two runtimes do NOT measure the same byte stream: Python frames untrusted text per field,
+// TypeScript frames the whole response once at the MCP boundary (src/index.ts:185). Retune
+// here, in one place, and only against measurements taken on THIS runtime.
+const NEIGHBOURHOOD_MAX_NODES = 50;
+const NEIGHBOURHOOD_MAX_CHARS = 15_000;
+const NEIGHBOURHOOD_MAX_DEPTH = 3;
 export const HEBBIAN_TRAVERSE = {
     name: "hebbian_traverse",
     description: "Walk your Hebbian workspace graph from a starting node, returning connected " +
@@ -32,9 +34,10 @@ export const HEBBIAN_TRAVERSE = {
             max_hops: {
                 type: "number",
                 description: `Maximum number of hops to traverse. Default: ${DEFAULT_HOPS}. Max: ${MAX_HOPS}. ` +
-                    "Each extra hop multiplies the size of the response, not its relevance. On a " +
-                    "dense workspace a 3-hop walk already returns hundreds of thousands of " +
-                    "characters. Start at 1 or 2 and widen only if the answer is genuinely missing.",
+                    "Each extra hop multiplies the size of the response, not its relevance. The " +
+                    "response is bounded to about 50 nodes and 15,000 characters; inspect " +
+                    "truncated_at_hop, bound_hit, and nodes_dropped to detect truncation. Start " +
+                    "at 1 or 2 and widen only if the answer is genuinely missing.",
                 minimum: 1,
                 maximum: MAX_HOPS,
             },
@@ -43,76 +46,219 @@ export const HEBBIAN_TRAVERSE = {
         additionalProperties: false,
     },
 };
+function isUuidV5(uuid) {
+    const groups = uuid.split("-");
+    return groups.length >= 3 && groups[2].length > 0 && groups[2].startsWith("5");
+}
+function deduplicateNeighbourhoodNodes(nodes) {
+    const twinsByTitle = new Map();
+    for (const [index, node] of nodes.entries()) {
+        if (typeof node.uuid !== "string" || node.uuid.length === 0)
+            continue;
+        const title = typeof node.title === "string" && node.title.length > 0
+            ? node.title
+            : `__uuid__:${node.uuid}`;
+        const twins = twinsByTitle.get(title) ?? [];
+        twins.push({ node, index });
+        twinsByTitle.set(title, twins);
+    }
+    const winners = [];
+    const aliases = new Map();
+    let duplicatesDropped = 0;
+    for (const twins of twinsByTitle.values()) {
+        const winner = twins.reduce((best, candidate) => {
+            const bestHasTags = Array.isArray(best.node.tags) && best.node.tags.length > 0;
+            const candidateHasTags = Array.isArray(candidate.node.tags) && candidate.node.tags.length > 0;
+            if (isUuidV5(candidate.node.uuid) !== isUuidV5(best.node.uuid)) {
+                return isUuidV5(candidate.node.uuid) ? candidate : best;
+            }
+            if (candidateHasTags !== bestHasTags)
+                return candidateHasTags ? candidate : best;
+            return candidate.index < best.index ? candidate : best;
+        });
+        winners.push(winner);
+        for (const twin of twins)
+            aliases.set(twin.node.uuid, winner.node.uuid);
+        duplicatesDropped += twins.length - 1;
+    }
+    winners.sort((left, right) => left.index - right.index);
+    return { nodes: winners.map(({ node }) => node), aliases, duplicatesDropped };
+}
+function neighbourhoodWeight(value) {
+    if (typeof value !== "number" && typeof value !== "string")
+        return 0;
+    const weight = Number(value);
+    return Number.isFinite(weight) ? weight : 0;
+}
+function neighbourhoodSummary(node, depth) {
+    const result = summarise(node);
+    for (const key of ["domain", "archetype", "tags"]) {
+        const value = result[key];
+        if (Array.isArray(value) ? value.length === 0 : !value)
+            delete result[key];
+    }
+    if (depth > 1) {
+        const snippet = result.snippet;
+        delete result.snippet;
+        if (snippet)
+            result.snippet_withheld = "depth_policy";
+    }
+    return result;
+}
 export async function handleTraverse(client, args) {
     const { start_uuid, max_hops = DEFAULT_HOPS } = args;
     if (!start_uuid || typeof start_uuid !== "string" || start_uuid.trim().length === 0) {
         throw new Error("start_uuid is required and must be a non-empty string");
     }
-    const hops = Math.min(Math.max(1, max_hops), MAX_HOPS);
+    const requestedHops = Math.max(1, typeof max_hops === "number" && Number.isFinite(max_hops) ? Math.trunc(max_hops) : DEFAULT_HOPS);
+    const hops = Math.min(requestedHops, MAX_HOPS);
     const start = start_uuid.trim();
     try {
         const graph = await fetchGraph(client);
-        const { nodes } = graph;
+        const deduplicated = deduplicateNeighbourhoodNodes(graph.nodes);
         const byUuid = new Map();
-        for (const n of nodes)
-            byUuid.set(n.uuid, n);
-        if (!byUuid.has(start)) {
+        for (const node of deduplicated.nodes)
+            byUuid.set(node.uuid, node);
+        const canonicalStart = deduplicated.aliases.get(start) ?? start;
+        const emptyDiagnostics = {
+            truncated_at_hop: null,
+            nodes_dropped: 0,
+            duplicates_dropped: deduplicated.duplicatesDropped,
+            bound_hit: null,
+            weight_spread: null,
+            distinct_weights: 0,
+            edges_considered: 0,
+        };
+        if (!byUuid.has(canonicalStart)) {
             return JSON.stringify({
                 start_uuid: start,
                 message: "Start node not found in the visible workspace graph. It may not exist " +
                     "or may be outside your token's scope.",
                 nodes: [],
                 edges: [],
+                ...emptyDiagnostics,
                 ...(graph.truncated ? { truncated: true } : {}),
             }, null, 2);
         }
-        // BFS over inline edges.
-        const visited = new Set([start]);
+        // The start is hop 0 and, like every accepted node, consumes response budget.
+        const visited = new Set([canonicalStart]);
+        const resultNodes = [neighbourhoodSummary(byUuid.get(canonicalStart), 0)];
         const collectedEdges = [];
-        const edgeSeen = new Set();
-        let frontier = [start];
-        for (let hop = 0; hop < hops; hop++) {
-            const next = [];
-            for (const uuid of frontier) {
+        let frontier = [{ uuid: canonicalStart, score: 0 }];
+        const weights = [];
+        let edgesConsidered = 0;
+        let truncatedAtHop = null;
+        let nodesDropped = 0;
+        let boundHit = null;
+        const payload = (nodes, edges, markerHop, dropped, hit) => {
+            const minWeight = weights.length > 0 ? Math.min(...weights) : null;
+            const weightSpread = minWeight !== null && minWeight > 0
+                ? Number(((Math.max(...weights) - minWeight) / minWeight).toFixed(5))
+                : null;
+            return {
+                start_uuid: start,
+                max_hops: hops,
+                node_count: nodes.length,
+                edge_count: edges.length,
+                nodes,
+                edges,
+                truncated_at_hop: markerHop,
+                nodes_dropped: dropped,
+                duplicates_dropped: deduplicated.duplicatesDropped,
+                bound_hit: hit,
+                weight_spread: weightSpread,
+                distinct_weights: new Set(weights).size,
+                edges_considered: edgesConsidered,
+                ...(graph.truncated ? { truncated: true } : {}),
+            };
+        };
+        const expandFrontier = (activeFrontier) => {
+            const candidates = new Map();
+            let discoveryIndex = 0;
+            for (const { uuid, score: accumulatedWeight } of activeFrontier) {
                 const node = byUuid.get(uuid);
                 if (!node || !Array.isArray(node.edges))
                     continue;
-                for (const e of node.edges) {
-                    const { source: src, target: tgt, relation, weight } = normaliseEdge(e, uuid);
-                    const neighbour = src === uuid ? tgt : src;
-                    const key = `${src}->${tgt}:${relation ?? ""}`;
-                    if (!edgeSeen.has(key)) {
-                        edgeSeen.add(key);
-                        collectedEdges.push({
-                            source_uuid: src,
-                            target_uuid: tgt,
-                            relation_type: relation,
-                            weight,
-                        });
-                    }
-                    if (neighbour && !visited.has(neighbour) && byUuid.has(neighbour)) {
-                        visited.add(neighbour);
-                        next.push(neighbour);
-                    }
+                for (const rawEdge of node.edges) {
+                    if (rawEdge === null || typeof rawEdge !== "object" || Array.isArray(rawEdge))
+                        continue;
+                    edgesConsidered += 1;
+                    const normalised = normaliseEdge(rawEdge, uuid);
+                    const source = deduplicated.aliases.get(normalised.source) ?? normalised.source;
+                    const target = deduplicated.aliases.get(normalised.target) ?? normalised.target;
+                    const rawWeight = normalised.weight;
+                    const weight = neighbourhoodWeight(rawWeight);
+                    weights.push(weight);
+                    const neighbour = source === uuid ? target : source;
+                    if (visited.has(neighbour) || !byUuid.has(neighbour))
+                        continue;
+                    const candidate = {
+                        uuid: neighbour,
+                        score: accumulatedWeight + weight,
+                        edge: { source, target, relation: normalised.relation, weight: rawWeight },
+                        discoveryIndex,
+                    };
+                    const existing = candidates.get(neighbour);
+                    if (!existing || candidate.score > existing.score)
+                        candidates.set(neighbour, candidate);
+                    discoveryIndex += 1;
+                }
+            }
+            return [...candidates.values()].sort((left, right) => right.score - left.score || left.discoveryIndex - right.discoveryIndex);
+        };
+        for (let depth = 1; depth <= requestedHops; depth += 1) {
+            const candidates = expandFrontier(frontier);
+            if (depth > NEIGHBOURHOOD_MAX_DEPTH) {
+                if (candidates.length > 0) {
+                    truncatedAtHop = NEIGHBOURHOOD_MAX_DEPTH;
+                    nodesDropped = candidates.length;
+                    boundHit = "depth";
                 }
+                break;
             }
-            frontier = next;
+            if (candidates.length === 0)
+                break;
+            const nextFrontier = [];
+            for (let position = 0; position < candidates.length; position += 1) {
+                const candidate = candidates[position];
+                if (resultNodes.length >= NEIGHBOURHOOD_MAX_NODES) {
+                    truncatedAtHop = depth;
+                    nodesDropped = candidates.length - position;
+                    boundHit = "nodes";
+                    break;
+                }
+                const nodeSummary = neighbourhoodSummary(byUuid.get(candidate.uuid), depth);
+                const edgeSummary = {
+                    source_uuid: candidate.edge.source,
+                    target_uuid: candidate.edge.target,
+                    relation_type: candidate.edge.relation,
+                    weight: candidate.edge.weight,
+                };
+                const candidatePayload = payload([...resultNodes, nodeSummary], [...collectedEdges, edgeSummary], depth, candidates.length - position, "chars");
+                if (frameUntrustedText(stringifyUntrustedResult(candidatePayload)).length > NEIGHBOURHOOD_MAX_CHARS) {
+                    truncatedAtHop = depth;
+                    nodesDropped = candidates.length - position;
+                    boundHit = "chars";
+                    break;
+                }
+                visited.add(candidate.uuid);
+                resultNodes.push(nodeSummary);
+                collectedEdges.push(edgeSummary);
+                nextFrontier.push({ uuid: candidate.uuid, score: candidate.score });
+            }
+            if (boundHit)
+                break;
+            frontier = nextFrontier;
             if (frontier.length === 0)
                 break;
         }
-        const resultNodes = [...visited]
-            .map((u) => byUuid.get(u))
-            .filter((n) => Boolean(n))
-            .map(summarise);
-        return stringifyUntrustedResult({
-            start_uuid: start,
-            max_hops: hops,
-            node_count: resultNodes.length,
-            edge_count: collectedEdges.length,
-            nodes: resultNodes,
-            edges: collectedEdges,
-            ...(graph.truncated ? { truncated: true } : {}),
-        });
+        if (boundHit === null &&
+            frameUntrustedText(stringifyUntrustedResult(payload(resultNodes, collectedEdges, 0, 0, "chars"))).length >
+                NEIGHBOURHOOD_MAX_CHARS) {
+            truncatedAtHop = 0;
+            boundHit = "chars";
+        }
+        return stringifyUntrustedResult(payload(resultNodes, collectedEdges, truncatedAtHop, nodesDropped, boundHit));
     }
     catch (err) {
         if (err instanceof HebbianApiError) {

package/dist/tools/traverse.js.map

@@ -1 +1 @@
-{"version":3,"file":"traverse.js","sourceRoot":"","sources":["../../src/tools/traverse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,EAAkB,MAAM,oBAAoB,CAAC;AAC1F,OAAO,EAAE,wBAAwB,EAAE,MAAM,wBAAwB,CAAC;AAElE,MAAM,QAAQ,GAAG,CAAC,CAAC;AACnB,MAAM,YAAY,GAAG,CAAC,CAAC;AAEvB,MAAM,CAAC,MAAM,gBAAgB,GAAS;IACpC,IAAI,EAAE,kBAAkB;IACxB,WAAW,EACT,8EAA8E;QAC9E,+EAA+E;QAC/E,gFAAgF;QAChF,6EAA6E;QAC7E,8DAA8D;IAChE,WAAW,EAAE;QACX,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,UAAU,EAAE;gBACV,IAAI,EAAE,QAAQ;gBACd,WAAW,EACT,2DAA2D;oBAC3D,0BAA0B;aAC7B;YACD,QAAQ,EAAE;gBACR,IAAI,EAAE,QAAQ;gBACd,WAAW,EACT,gDAAgD,YAAY,UAAU,QAAQ,IAAI;oBAClF,8EAA8E;oBAC9E,wEAAwE;oBACxE,gFAAgF;gBAClF,OAAO,EAAE,CAAC;gBACV,OAAO,EAAE,QAAQ;aAClB;SACF;QACD,QAAQ,EAAE,CAAC,YAAY,CAAC;QACxB,oBAAoB,EAAE,KAAK;KAC5B;CACF,CAAC;AAcF,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,MAAqB,EACrB,IAAkB;IAElB,MAAM,EAAE,UAAU,EAAE,QAAQ,GAAG,YAAY,EAAE,GAAG,IAAI,CAAC;IAErD,IAAI,CAAC,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpF,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;IAC3E,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;IACvD,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC;IAEhC,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;QACxB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAE7C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,SAAS,CACnB;gBACE,UAAU,EAAE,KAAK;gBACjB,OAAO,EACL,wEAAwE;oBACxE,uCAAuC;gBACzC,KAAK,EAAE,EAAE;gBACT,KAAK,EAAE,EAAE;gBACT,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAChD,EACD,IAAI,EACJ,CAAC,CACF,CAAC;QACJ,CAAC;QAED,yBAAyB;QACzB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,CAAC,CAAC;QACzC,MAAM,cAAc,GAAoB,EAAE,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,IAAI,QAAQ,GAAa,CAAC,KAAK,CAAC,CAAC;QAEjC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAa,EAAE,CAAC;YAC1B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC9B,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAClD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC3B,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;oBAC9E,MAAM,SAAS,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;oBAC3C,MAAM,GAAG,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,QAAQ,IAAI,EAAE,EAAE,CAAC;oBAC/C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACvB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBAClB,cAAc,CAAC,IAAI,CAAC;4BAClB,WAAW,EAAE,GAAG;4BAChB,WAAW,EAAE,GAAG;4BAChB,aAAa,EAAE,QAAQ;4BACvB,MAAM;yBACP,CAAC,CAAC;oBACL,CAAC;oBACD,IAAI,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;wBAClE,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;wBACvB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,QAAQ,GAAG,IAAI,CAAC;YAChB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;QACnC,CAAC;QAED,MAAM,WAAW,GAAG,CAAC,GAAG,OAAO,CAAC;aAC7B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aACzB,MAAM,CAAC,CAAC,CAAC,EAAkB,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aACzC,GAAG,CAAC,SAAS,CAAC,CAAC;QAElB,OAAO,wBAAwB,CAC7B;YACE,UAAU,EAAE,KAAK;YACjB,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,WAAW,CAAC,MAAM;YAC9B,UAAU,EAAE,cAAc,CAAC,MAAM;YACjC,KAAK,EAAE,WAAW;YAClB,KAAK,EAAE,cAAc;YACrB,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAChD,CACF,CAAC;IACJ,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,GAAG,YAAY,eAAe,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC;QACrC,CAAC;QACD,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC"}
+{"version":3,"file":"traverse.js","sourceRoot":"","sources":["../../src/tools/traverse.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,EAAkB,MAAM,oBAAoB,CAAC;AAC1F,OAAO,EAAE,kBAAkB,EAAE,wBAAwB,EAAE,MAAM,wBAAwB,CAAC;AAEtF,MAAM,QAAQ,GAAG,CAAC,CAAC;AACnB,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,uFAAuF;AACvF,4FAA4F;AAC5F,4FAA4F;AAC5F,2FAA2F;AAC3F,2EAA2E;AAC3E,MAAM,uBAAuB,GAAG,EAAE,CAAC;AACnC,MAAM,uBAAuB,GAAG,MAAM,CAAC;AACvC,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAElC,MAAM,CAAC,MAAM,gBAAgB,GAAS;IACpC,IAAI,EAAE,kBAAkB;IACxB,WAAW,EACT,8EAA8E;QAC9E,+EAA+E;QAC/E,gFAAgF;QAChF,6EAA6E;QAC7E,8DAA8D;IAChE,WAAW,EAAE;QACX,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,UAAU,EAAE;gBACV,IAAI,EAAE,QAAQ;gBACd,WAAW,EACT,2DAA2D;oBAC3D,0BAA0B;aAC7B;YACD,QAAQ,EAAE;gBACR,IAAI,EAAE,QAAQ;gBACd,WAAW,EACT,gDAAgD,YAAY,UAAU,QAAQ,IAAI;oBAClF,6EAA6E;oBAC7E,uEAAuE;oBACvE,6EAA6E;oBAC7E,8DAA8D;gBAChE,OAAO,EAAE,CAAC;gBACV,OAAO,EAAE,QAAQ;aAClB;SACF;QACD,QAAQ,EAAE,CAAC,YAAY,CAAC;QACxB,oBAAoB,EAAE,KAAK;KAC5B;CACF,CAAC;AA6BF,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/B,OAAO,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;AACjF,CAAC;AAED,SAAS,6BAA6B,CAAC,KAAkB;IAKvD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAqD,CAAC;IAElF,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACtE,MAAM,KAAK,GAAG,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;YACnE,CAAC,CAAC,IAAI,CAAC,KAAK;YACZ,CAAC,CAAC,YAAY,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QAC5C,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAC5B,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,OAAO,GAA8C,EAAE,CAAC;IAC9D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAE1B,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;QAC1C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE;YAC9C,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAC/E,MAAM,gBAAgB,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAC9F,IAAI,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/D,OAAO,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;YAC1D,CAAC;YACD,IAAI,gBAAgB,KAAK,WAAW;gBAAE,OAAO,gBAAgB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;YACjF,OAAO,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;QACzD,CAAC,CAAC,CAAC;QACH,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxE,iBAAiB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACxC,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IACxD,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC;AAChF,CAAC;AAED,SAAS,mBAAmB,CAAC,KAAc;IACzC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAC7B,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAe,EAAE,KAAa;IAC1D,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,EAAE,MAAM,CAAC,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;YAAE,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;IAC7E,CAAC;IACD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;QAC/B,OAAO,MAAM,CAAC,OAAO,CAAC;QACtB,IAAI,OAAO;YAAE,MAAM,CAAC,gBAAgB,GAAG,cAAc,CAAC;IACxD,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,MAAqB,EACrB,IAAkB;IAElB,MAAM,EAAE,UAAU,EAAE,QAAQ,GAAG,YAAY,EAAE,GAAG,IAAI,CAAC;IAErD,IAAI,CAAC,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpF,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;IAC3E,CAAC;IAED,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAC5B,CAAC,EACD,OAAO,QAAQ,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAChG,CAAC;IACF,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC;IAEhC,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,YAAY,GAAG,6BAA6B,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,KAAK;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACnE,MAAM,cAAc,GAAG,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;QAChE,MAAM,gBAAgB,GAAG;YACvB,gBAAgB,EAAE,IAAI;YACtB,aAAa,EAAE,CAAC;YAChB,kBAAkB,EAAE,YAAY,CAAC,iBAAiB;YAClD,SAAS,EAAE,IAAI;YACf,aAAa,EAAE,IAAI;YACnB,gBAAgB,EAAE,CAAC;YACnB,gBAAgB,EAAE,CAAC;SACpB,CAAC;QAEF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC,SAAS,CACnB;gBACE,UAAU,EAAE,KAAK;gBACjB,OAAO,EACL,wEAAwE;oBACxE,uCAAuC;gBACzC,KAAK,EAAE,EAAE;gBACT,KAAK,EAAE,EAAE;gBACT,GAAG,gBAAgB;gBACnB,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAChD,EACD,IAAI,EACJ,CAAC,CACF,CAAC;QACJ,CAAC;QAED,8EAA8E;QAC9E,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,cAAc,CAAC,CAAC,CAAC;QAClD,MAAM,WAAW,GAAG,CAAC,oBAAoB,CAAC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3E,MAAM,cAAc,GAAoB,EAAE,CAAC;QAC3C,IAAI,QAAQ,GAAoB,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACrE,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,cAAc,GAAkB,IAAI,CAAC;QACzC,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,QAAQ,GAAuC,IAAI,CAAC;QAExD,MAAM,OAAO,GAAG,CACd,KAAgC,EAChC,KAAsB,EACtB,SAAwB,EACxB,OAAe,EACf,GAAuC,EACd,EAAE;YAC3B,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACnE,MAAM,YAAY,GAAG,SAAS,KAAK,IAAI,IAAI,SAAS,GAAG,CAAC;gBACtD,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC,CAAC,IAAI,CAAC;YACT,OAAO;gBACL,UAAU,EAAE,KAAK;gBACjB,QAAQ,EAAE,IAAI;gBACd,UAAU,EAAE,KAAK,CAAC,MAAM;gBACxB,UAAU,EAAE,KAAK,CAAC,MAAM;gBACxB,KAAK;gBACL,KAAK;gBACL,gBAAgB,EAAE,SAAS;gBAC3B,aAAa,EAAE,OAAO;gBACtB,kBAAkB,EAAE,YAAY,CAAC,iBAAiB;gBAClD,SAAS,EAAE,GAAG;gBACd,aAAa,EAAE,YAAY;gBAC3B,gBAAgB,EAAE,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI;gBACvC,gBAAgB,EAAE,eAAe;gBACjC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAChD,CAAC;QACJ,CAAC,CAAC;QAEF,MAAM,cAAc,GAAG,CAAC,cAA+B,EAAe,EAAE;YACtE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAqB,CAAC;YAChD,IAAI,cAAc,GAAG,CAAC,CAAC;YACvB,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,iBAAiB,EAAE,IAAI,cAAc,EAAE,CAAC;gBAChE,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC9B,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAClD,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBACjC,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;wBAAE,SAAS;oBACxF,eAAe,IAAI,CAAC,CAAC;oBACrB,MAAM,UAAU,GAAG,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;oBAChD,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC;oBAChF,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC;oBAChF,MAAM,SAAS,GAAG,UAAU,CAAC,MAAiB,CAAC;oBAC/C,MAAM,MAAM,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC;oBAC9C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACrB,MAAM,SAAS,GAAG,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;oBACpD,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC;wBAAE,SAAS;oBAE/D,MAAM,SAAS,GAAc;wBAC3B,IAAI,EAAE,SAAS;wBACf,KAAK,EAAE,iBAAiB,GAAG,MAAM;wBACjC,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE;wBAC1E,cAAc;qBACf,CAAC;oBACF,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;oBAC3C,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK;wBAAE,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBACxF,cAAc,IAAI,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;YACD,OAAO,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAClC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC,cAAc,CACxF,CAAC;QACJ,CAAC,CAAC;QAEF,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,aAAa,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YACvD,MAAM,UAAU,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;YAC5C,IAAI,KAAK,GAAG,uBAAuB,EAAE,CAAC;gBACpC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC1B,cAAc,GAAG,uBAAuB,CAAC;oBACzC,YAAY,GAAG,UAAU,CAAC,MAAM,CAAC;oBACjC,QAAQ,GAAG,OAAO,CAAC;gBACrB,CAAC;gBACD,MAAM;YACR,CAAC;YACD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;YAEnC,MAAM,YAAY,GAAoB,EAAE,CAAC;YACzC,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,UAAU,CAAC,MAAM,EAAE,QAAQ,IAAI,CAAC,EAAE,CAAC;gBACnE,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;gBACvC,IAAI,WAAW,CAAC,MAAM,IAAI,uBAAuB,EAAE,CAAC;oBAClD,cAAc,GAAG,KAAK,CAAC;oBACvB,YAAY,GAAG,UAAU,CAAC,MAAM,GAAG,QAAQ,CAAC;oBAC5C,QAAQ,GAAG,OAAO,CAAC;oBACnB,MAAM;gBACR,CAAC;gBACD,MAAM,WAAW,GAAG,oBAAoB,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAE,EAAE,KAAK,CAAC,CAAC;gBAC7E,MAAM,WAAW,GAAkB;oBACjC,WAAW,EAAE,SAAS,CAAC,IAAI,CAAC,MAAM;oBAClC,WAAW,EAAE,SAAS,CAAC,IAAI,CAAC,MAAM;oBAClC,aAAa,EAAE,SAAS,CAAC,IAAI,CAAC,QAAQ;oBACtC,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,MAAM;iBAC9B,CAAC;gBACF,MAAM,gBAAgB,GAAG,OAAO,CAC9B,CAAC,GAAG,WAAW,EAAE,WAAW,CAAC,EAC7B,CAAC,GAAG,cAAc,EAAE,WAAW,CAAC,EAChC,KAAK,EACL,UAAU,CAAC,MAAM,GAAG,QAAQ,EAC5B,OAAO,CACR,CAAC;gBACF,IAAI,kBAAkB,CAAC,wBAAwB,CAAC,gBAAgB,CAAC,CAAC,CAAC,MAAM,GAAG,uBAAuB,EAAE,CAAC;oBACpG,cAAc,GAAG,KAAK,CAAC;oBACvB,YAAY,GAAG,UAAU,CAAC,MAAM,GAAG,QAAQ,CAAC;oBAC5C,QAAQ,GAAG,OAAO,CAAC;oBACnB,MAAM;gBACR,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBAC5B,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC9B,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBACjC,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC;YACtE,CAAC;YACD,IAAI,QAAQ;gBAAE,MAAM;YACpB,QAAQ,GAAG,YAAY,CAAC;YACxB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;QACnC,CAAC;QAED,IACE,QAAQ,KAAK,IAAI;YACjB,kBAAkB,CAAC,wBAAwB,CAAC,OAAO,CAAC,WAAW,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM;gBACtG,uBAAuB,EACzB,CAAC;YACD,cAAc,GAAG,CAAC,CAAC;YACnB,QAAQ,GAAG,OAAO,CAAC;QACrB,CAAC;QAED,OAAO,wBAAwB,CAC7B,OAAO,CAAC,WAAW,EAAE,cAAc,EAAE,cAAc,EAAE,YAAY,EAAE,QAAQ,CAAC,CAC7E,CAAC;IACJ,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,GAAG,YAAY,eAAe,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC;QACrC,CAAC;QACD,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@hebbianvault/mcp",
-  "version": "0.5.0",
+  "version": "0.6.0",
   "description": "Customer-installable MCP server for the Hebbian tenant brain. One package, scope-by-token (Employee or Company). Install in Claude Code, Claude Desktop, Cursor, Cowork, or any MCP-compatible agent.",
   "type": "module",
   "main": "dist/index.js",