[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_146":147,"_148":149},"routes/_app.x.$handle.$name",{"_16":17,"_20":21,"_86":69,"_87":88,"_67":-7,"_89":-5,"_13":90,"_91":92,"_11":93,"_94":95,"_96":97,"_98":-5,"_99":-5,"_100":-5,"_101":26,"_102":103,"_104":37,"_105":-5,"_106":-5,"_107":108},"routes/_app.x.$handle.$name.search.$(branch)",{"_11":12,"_13":14,"_15":-5,"_16":17},"files",[],"project",{"_18":19,"_20":21,"_22":23,"_24":-5,"_25":26,"_27":28,"_29":28,"_30":-5,"_31":-5,"_32":33,"_34":35,"_36":37,"_38":-5,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":49,"_50":-5,"_51":52,"_53":52,"_54":55,"_56":55,"_57":55,"_58":52,"_59":52,"_60":61,"_62":63,"_64":65,"_66":26},"query","handle","vlduy123","id","b3339a44-56a5-11f1-9776-ee650bb23af1","name","ruflographifymcp","createdAt",["D",1779540510128],"deletedAt","legacyEnvVars",false,"privacy","public","httpPrivacy","description","imageUrl","userId","e8c17657-6210-4c45-bd2b-dbcf2e020293","pinnedFileId","38aec3a6-56a6-11f1-b8bf-ee650bb23af1","pinPreview",true,"pinMigrated","screenshotVersion","likeCount",0,"orgId","019e4de5-f6b1-7488-a017-a3a028bc2ba8","tursoName","b3339a4456a511f19776ee650bb23af1","tursoHostname","b3339a4456a511f19776ee650bb23af1-val-town.aws-us-east-2.turso.io","tursoMeasuredAt",["D",1789578655349],"pinned","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm","user",{"_16":17,"_85":81},"org",{"_16":17,"_79":17,"_80":81,"_32":33,"_82":83,"_84":26},"branch",{"_67":68,"_20":69,"_18":70,"_71":19,"_72":-5,"_73":-5,"_74":-5,"_75":-5,"_76":-5,"_77":21,"_78":17},"isOwned","version",2,"main","b3345e0c-56a5-11f1-9776-ee650bb23af1","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","displayName","avatar","https://avatars.githubusercontent.com/u/208025931?v=4","tier","free","canRestrictVals","profileImageUrl","branchName","path","","adoptOrgId",{"_18":19,"_20":21,"_22":141,"_24":-5,"_25":26,"_27":28,"_29":28,"_30":-5,"_31":-5,"_32":33,"_34":35,"_36":37,"_38":-5,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":142,"_50":-5,"_51":52,"_53":52,"_54":55,"_56":55,"_57":55,"_58":52,"_59":52,"_60":143,"_62":144,"_64":145,"_66":26},"tree",[136],[136],"counts",{"_126":41,"_127":118,"_128":41,"_129":130,"_131":132},"contents",[109],"file","upstreamProject","upstreamBranch","emptyEnvVars","flags",[],"hasHttpFiles","grants","orgs","customDomains",{},{"_18":110,"_20":111,"_112":35,"_113":-5,"_114":70,"_115":68,"_116":37,"_22":117,"_67":118,"_119":120,"_121":122,"_123":26,"_124":-5,"_87":125},"5ab71582-56ad-11f1-9ec2-ee650bb23af1","main.tsx","fileId","parentId","branchId","branchVersion","latest",["D",1779543797630],1,"fileType","http","content","/**\n * Ruflo + Graphify — val.town HTTP MCP Server\n *\n * Tools exposed:\n * graphify_upload_graph – upload a graph.json produced by `graphify extract`\n * graphify_list_graphs – list all uploaded graphs\n * graphify_query – BFS/DFS natural-language query against a graph\n * graphify_path – shortest path between two concepts\n * graphify_explain – explain a node and its connections\n * graphify_stats – node/edge counts and top nodes\n * memory_store – persist a key-value entry (SQLite)\n * memory_retrieve – fetch a single entry by key\n * memory_search – full-text search across keys + values\n * memory_list – list all stored keys\n */\n\nimport { blob } from \"https://esm.town/v/std/blob\";\nimport { sqlite } from \"https://esm.town/v/std/sqlite/main.ts\";\n\n// ─── Types ───────────────────────────────────────────────────────────────────\n\ninterface GraphNode {\n id: string;\n label?: string;\n type?: string;\n description?: string;\n file?: string;\n line?: number;\n}\n\ninterface GraphEdge {\n source: string;\n target: string;\n type?: string;\n weight?: number;\n}\n\ninterface Graph {\n nodes: GraphNode[];\n links?: GraphEdge[];\n edges?: GraphEdge[];\n metadata?: Record;\n}\n\n// ─── Memory helpers ──────────────────────────────────────────────────────────\n\nasync function ensureMemoryTable() {\n await sqlite.execute(`\n CREATE TABLE IF NOT EXISTS mcp_memory (\n id TEXT PRIMARY KEY,\n key TEXT NOT NULL,\n value TEXT NOT NULL,\n tags TEXT DEFAULT '[]',\n created_at INTEGER DEFAULT (unixepoch()),\n updated_at INTEGER DEFAULT (unixepoch())\n )`);\n await sqlite.execute(\n `CREATE INDEX IF NOT EXISTS idx_mcp_memory_key ON mcp_memory(key)`,\n );\n}\n\n// ─── Blob helpers ─────────────────────────────────────────────────────────────\n\nasync function loadGraph(name: string): Promise {\n try {\n const data = await blob.getJSON(`ruflo_graph_${name}`);\n return data as Graph;\n } catch {\n return null;\n }\n}\n\nasync function listGraphs(): Promise {\n try {\n const idx = (await blob.getJSON(`ruflo_graph_index`)) as string[];\n return idx || [];\n } catch {\n return [];\n }\n}\n\nasync function saveGraphIndex(names: string[]) {\n await blob.setJSON(`ruflo_graph_index`, names);\n}\n\n// ─── Graph algorithms ─────────────────────────────────────────────────────────\n\nfunction buildAdj(graph: Graph): Map {\n const adj = new Map();\n for (const e of graph.links || graph.edges || []) {\n if (!adj.has(e.source)) adj.set(e.source, []);\n if (!adj.has(e.target)) adj.set(e.target, []);\n adj.get(e.source)!.push(e.target);\n adj.get(e.target)!.push(e.source);\n }\n return adj;\n}\n\nfunction fuzzyFind(graph: Graph, name: string): GraphNode | undefined {\n const lower = name.toLowerCase();\n return (\n graph.nodes.find((n) => n.id === name) ||\n graph.nodes.find(\n (n) =>\n n.id?.toLowerCase().includes(lower) ||\n n.label?.toLowerCase().includes(lower),\n )\n );\n}\n\nfunction bfs(\n graph: Graph,\n startId: string,\n maxDepth = 3,\n maxNodes = 50,\n): GraphNode[] {\n const adj = buildAdj(graph);\n const nodeMap = new Map(graph.nodes.map((n) => [n.id, n]));\n const visited = new Set();\n const result: GraphNode[] = [];\n const queue: [string, number][] = [[startId, 0]];\n while (queue.length && result.length < maxNodes) {\n const [id, depth] = queue.shift()!;\n if (visited.has(id) || depth > maxDepth) continue;\n visited.add(id);\n const node = nodeMap.get(id);\n if (node) result.push(node);\n if (depth < maxDepth)\n for (const nb of adj.get(id) || [])\n if (!visited.has(nb)) queue.push([nb, depth + 1]);\n }\n return result;\n}\n\nfunction dfs(\n graph: Graph,\n startId: string,\n maxDepth = 3,\n maxNodes = 50,\n): GraphNode[] {\n const adj = buildAdj(graph);\n const nodeMap = new Map(graph.nodes.map((n) => [n.id, n]));\n const visited = new Set();\n const result: GraphNode[] = [];\n function rec(id: string, depth: number) {\n if (visited.has(id) || depth > maxDepth || result.length >= maxNodes)\n return;\n visited.add(id);\n const node = nodeMap.get(id);\n if (node) result.push(node);\n for (const nb of adj.get(id) || []) rec(nb, depth + 1);\n }\n rec(startId, 0);\n return result;\n}\n\nfunction shortestPath(\n graph: Graph,\n fromName: string,\n toName: string,\n): GraphNode[] {\n const from = fuzzyFind(graph, fromName);\n const to = fuzzyFind(graph, toName);\n if (!from || !to) return [];\n const adj = buildAdj(graph);\n const nodeMap = new Map(graph.nodes.map((n) => [n.id, n]));\n const prev = new Map();\n const visited = new Set([from.id]);\n const queue = [from.id];\n while (queue.length) {\n const cur = queue.shift()!;\n if (cur === to.id) break;\n for (const nb of adj.get(cur) || []) {\n if (!visited.has(nb)) {\n visited.add(nb);\n prev.set(nb, cur);\n queue.push(nb);\n }\n }\n }\n if (!prev.has(to.id) && from.id !== to.id) return [];\n const path: string[] = [];\n let cur: string | undefined = to.id;\n while (cur) {\n path.unshift(cur);\n cur = prev.get(cur);\n }\n return path.map((id) => nodeMap.get(id)!).filter(Boolean);\n}\n\nfunction nlQuery(\n graph: Graph,\n question: string,\n useDfs = false,\n): { nodes: GraphNode[]; answer: string } {\n const words = question\n .toLowerCase()\n .split(/\\s+/)\n .filter((w) => w.length > 3);\n const matches = graph.nodes\n .filter((n) =>\n words.some(\n (w) =>\n n.id?.toLowerCase().includes(w) ||\n n.label?.toLowerCase().includes(w) ||\n n.description?.toLowerCase().includes(w) ||\n n.type?.toLowerCase().includes(w),\n ),\n )\n .slice(0, 5);\n if (!matches.length)\n return {\n nodes: [],\n answer: `No nodes matching \"${question}\". Try graphify_stats to see available concepts.`,\n };\n const seen = new Set();\n const traversed: GraphNode[] = [];\n for (const m of matches) {\n const nodes = useDfs ? dfs(graph, m.id, 2, 20) : bfs(graph, m.id, 2, 20);\n for (const n of nodes)\n if (!seen.has(n.id)) {\n seen.add(n.id);\n traversed.push(n);\n }\n }\n const answer =\n `Found ${traversed.length} related nodes for \"${question}\":\\n` +\n traversed\n .slice(0, 20)\n .map(\n (n) =>\n `• ${n.label || n.id} [${n.type || \"node\"}]${n.description ? \": \" + n.description.slice(0, 80) : \"\"}`,\n )\n .join(\"\\n\");\n return { nodes: traversed, answer };\n}\n\n// ─── MCP tool definitions ─────────────────────────────────────────────────────\n\nconst TOOLS = [\n {\n name: \"graphify_upload_graph\",\n description:\n \"Upload a graph.json file to cloud storage. Run 'graphify extract ' locally, then paste the graph.json contents here to make the graph queryable from any machine.\",\n inputSchema: {\n type: \"object\",\n properties: {\n name: {\n type: \"string\",\n description: \"Name for this graph (e.g. 'my-project')\",\n },\n graph_json: {\n type: \"string\",\n description: \"Full contents of graph.json as a string\",\n },\n },\n required: [\"name\", \"graph_json\"],\n },\n },\n {\n name: \"graphify_list_graphs\",\n description: \"List all knowledge graphs available in cloud storage.\",\n inputSchema: { type: \"object\", properties: {} },\n },\n {\n name: \"graphify_query\",\n description:\n \"Query a knowledge graph with a natural-language question. BFS by default; pass dfs:true for depth-first.\",\n inputSchema: {\n type: \"object\",\n properties: {\n graph: {\n type: \"string\",\n description: \"Graph name (from graphify_list_graphs)\",\n },\n question: {\n type: \"string\",\n description: \"Natural-language question about the codebase\",\n },\n dfs: {\n type: \"boolean\",\n description: \"Use DFS instead of BFS\",\n default: false,\n },\n },\n required: [\"graph\", \"question\"],\n },\n },\n {\n name: \"graphify_path\",\n description:\n \"Find the shortest path between two concepts in a knowledge graph.\",\n inputSchema: {\n type: \"object\",\n properties: {\n graph: { type: \"string\", description: \"Graph name\" },\n from: { type: \"string\", description: \"Source concept\" },\n to: { type: \"string\", description: \"Target concept\" },\n },\n required: [\"graph\", \"from\", \"to\"],\n },\n },\n {\n name: \"graphify_explain\",\n description:\n \"Get a plain-language explanation of a concept node and its direct connections.\",\n inputSchema: {\n type: \"object\",\n properties: {\n graph: { type: \"string\", description: \"Graph name\" },\n node: { type: \"string\", description: \"Concept or symbol to explain\" },\n },\n required: [\"graph\", \"node\"],\n },\n },\n {\n name: \"graphify_stats\",\n description:\n \"Return statistics for a knowledge graph: node count, edge count, type breakdown, and highest-degree nodes.\",\n inputSchema: {\n type: \"object\",\n properties: {\n graph: { type: \"string\", description: \"Graph name\" },\n },\n required: [\"graph\"],\n },\n },\n {\n name: \"memory_store\",\n description:\n \"Persist a key-value entry to cloud SQLite memory with optional tags.\",\n inputSchema: {\n type: \"object\",\n properties: {\n key: { type: \"string\", description: \"Memory key\" },\n value: {\n type: \"string\",\n description: \"Value to store (plain text or JSON string)\",\n },\n tags: {\n type: \"array\",\n items: { type: \"string\" },\n description: \"Optional tags for filtering\",\n },\n },\n required: [\"key\", \"value\"],\n },\n },\n {\n name: \"memory_retrieve\",\n description: \"Retrieve a memory entry by its exact key.\",\n inputSchema: {\n type: \"object\",\n properties: {\n key: { type: \"string\", description: \"Memory key\" },\n },\n required: [\"key\"],\n },\n },\n {\n name: \"memory_search\",\n description: \"Full-text search across memory keys and values.\",\n inputSchema: {\n type: \"object\",\n properties: {\n query: {\n type: \"string\",\n description: \"Search term matched against keys and values\",\n },\n tag: { type: \"string\", description: \"Filter by tag\" },\n },\n },\n },\n {\n name: \"memory_list\",\n description: \"List all stored memory keys.\",\n inputSchema: { type: \"object\", properties: {} },\n },\n];\n\n// ─── Tool execution ───────────────────────────────────────────────────────────\n\nasync function executeTool(\n name: string,\n args: Record,\n): Promise {\n switch (name) {\n case \"graphify_upload_graph\": {\n let parsed: Graph;\n try {\n parsed = JSON.parse(args.graph_json as string);\n } catch {\n return { ok: false, error: \"Invalid JSON in graph_json\" };\n }\n const graphName = args.name as string;\n await blob.setJSON(`ruflo_graph_${graphName}`, parsed);\n const existing = await listGraphs();\n if (!existing.includes(graphName))\n await saveGraphIndex([...existing, graphName]);\n const nodeCount = parsed.nodes?.length ?? 0;\n const edgeCount = (parsed.links || parsed.edges || []).length;\n return {\n ok: true,\n name: graphName,\n nodes: nodeCount,\n edges: edgeCount,\n message: `Graph \"${graphName}\" uploaded: ${nodeCount} nodes, ${edgeCount} edges.`,\n };\n }\n\n case \"graphify_list_graphs\": {\n const names = await listGraphs();\n return { ok: true, graphs: names, count: names.length };\n }\n\n case \"graphify_query\": {\n const graph = await loadGraph(args.graph as string);\n if (!graph)\n return {\n ok: false,\n error: `Graph \"${args.graph}\" not found. Use graphify_upload_graph first.`,\n };\n const { nodes, answer } = nlQuery(\n graph,\n args.question as string,\n args.dfs as boolean,\n );\n return { ok: true, answer, nodeCount: nodes.length, nodes: nodes.slice(0, 30) };\n }\n\n case \"graphify_path\": {\n const graph = await loadGraph(args.graph as string);\n if (!graph)\n return { ok: false, error: `Graph \"${args.graph}\" not found.` };\n const path = shortestPath(\n graph,\n args.from as string,\n args.to as string,\n );\n if (!path.length)\n return {\n ok: false,\n error: `No path between \"${args.from}\" and \"${args.to}\"`,\n };\n return {\n ok: true,\n path,\n summary: path.map((n) => n.label || n.id).join(\" → \"),\n length: path.length,\n };\n }\n\n case \"graphify_explain\": {\n const graph = await loadGraph(args.graph as string);\n if (!graph)\n return { ok: false, error: `Graph \"${args.graph}\" not found.` };\n const node = fuzzyFind(graph, args.node as string);\n if (!node)\n return { ok: false, error: `Node \"${args.node}\" not found.` };\n const edges = graph.links || graph.edges || [];\n const connections = edges.filter(\n (e) => e.source === node.id || e.target === node.id,\n );\n const connIds = connections.map((e) =>\n e.source === node.id ? e.target : e.source,\n );\n const nodeMap = new Map(graph.nodes.map((n) => [n.id, n]));\n const connNodes = connIds\n .map((id) => nodeMap.get(id))\n .filter(Boolean) as GraphNode[];\n const explanation =\n `**${node.label || node.id}** (${node.type || \"node\"})\\n` +\n (node.description ? `${node.description}\\n` : \"\") +\n (node.file\n ? `File: ${node.file}${node.line ? \":\" + node.line : \"\"}\\n`\n : \"\") +\n `\\nConnections (${connections.length}):\\n` +\n connNodes\n .slice(0, 20)\n .map((n) => `• ${n.label || n.id} [${n.type || \"node\"}]`)\n .join(\"\\n\");\n return {\n ok: true,\n node,\n explanation,\n connectionCount: connections.length,\n connections: connNodes.slice(0, 20),\n };\n }\n\n case \"graphify_stats\": {\n const graph = await loadGraph(args.graph as string);\n if (!graph)\n return { ok: false, error: `Graph \"${args.graph}\" not found.` };\n const edges = graph.links || graph.edges || [];\n const typeCounts: Record = {};\n for (const n of graph.nodes) {\n const t = n.type || \"unknown\";\n typeCounts[t] = (typeCounts[t] || 0) + 1;\n }\n const degree = new Map();\n for (const e of edges) {\n degree.set(e.source, (degree.get(e.source) || 0) + 1);\n degree.set(e.target, (degree.get(e.target) || 0) + 1);\n }\n const nodeMap = new Map(graph.nodes.map((n) => [n.id, n]));\n const topNodes = [...degree.entries()]\n .sort((a, b) => b[1] - a[1])\n .slice(0, 10)\n .map(([id, deg]) => ({\n id,\n label: nodeMap.get(id)?.label || id,\n degree: deg,\n }));\n return {\n ok: true,\n nodes: graph.nodes.length,\n edges: edges.length,\n nodeTypes: typeCounts,\n topNodes,\n summary: `${graph.nodes.length} nodes, ${edges.length} edges, ${Object.keys(typeCounts).length} types`,\n };\n }\n\n case \"memory_store\": {\n await ensureMemoryTable();\n const id = `mem_${Date.now()}_${Math.random().toString(36).slice(2)}`;\n const tags = JSON.stringify(args.tags || []);\n const now = Date.now();\n await sqlite.execute({\n sql: `INSERT INTO mcp_memory (id, key, value, tags, created_at, updated_at)\n VALUES (?, ?, ?, ?, ?, ?)\n ON CONFLICT(id) DO UPDATE\n SET value=excluded.value, tags=excluded.tags, updated_at=excluded.updated_at`,\n args: [id, args.key as string, args.value as string, tags, now, now],\n });\n return {\n ok: true,\n id,\n key: args.key,\n message: `Stored \"${args.key}\"`,\n };\n }\n\n case \"memory_retrieve\": {\n await ensureMemoryTable();\n const rows = await sqlite.execute({\n sql: `SELECT key, value, tags FROM mcp_memory WHERE key = ? ORDER BY updated_at DESC LIMIT 1`,\n args: [args.key as string],\n });\n if (!rows.rows.length)\n return {\n ok: false,\n error: `No memory for key \"${args.key}\"`,\n };\n const r = rows.rows[0];\n return {\n ok: true,\n key: r[0],\n value: r[1],\n tags: JSON.parse((r[2] as string) || \"[]\"),\n };\n }\n\n case \"memory_search\": {\n await ensureMemoryTable();\n const query = (args.query as string) || \"\";\n const tag = args.tag as string | undefined;\n let sql =\n `SELECT key, value, tags FROM mcp_memory WHERE 1=1`;\n const sqlArgs: unknown[] = [];\n if (query) {\n sql += ` AND (key LIKE ? OR value LIKE ?)`;\n sqlArgs.push(`%${query}%`, `%${query}%`);\n }\n if (tag) {\n sql += ` AND tags LIKE ?`;\n sqlArgs.push(`%\"${tag}\"%`);\n }\n sql += ` ORDER BY updated_at DESC LIMIT 50`;\n const rows = await sqlite.execute({ sql, args: sqlArgs });\n const results = rows.rows.map((r) => ({\n key: r[0],\n value: (r[1] as string).slice(0, 200),\n tags: JSON.parse((r[2] as string) || \"[]\"),\n }));\n return { ok: true, results, count: results.length };\n }\n\n case \"memory_list\": {\n await ensureMemoryTable();\n const rows = await sqlite.execute(\n `SELECT key, updated_at FROM mcp_memory ORDER BY updated_at DESC`,\n );\n return {\n ok: true,\n keys: rows.rows.map((r) => r[0]),\n count: rows.rows.length,\n };\n }\n\n default:\n throw new Error(`Unknown tool: ${name}`);\n }\n}\n\n// ─── HTTP MCP handler ─────────────────────────────────────────────────────────\n\nconst CORS = {\n \"Access-Control-Allow-Origin\": \"*\",\n \"Access-Control-Allow-Methods\": \"POST, GET, OPTIONS\",\n \"Access-Control-Allow-Headers\": \"Content-Type, Authorization, Accept\",\n};\n\nexport default async function handler(req: Request): Promise {\n if (req.method === \"OPTIONS\") {\n return new Response(null, { status: 204, headers: CORS });\n }\n\n if (req.method === \"GET\") {\n return new Response(\n JSON.stringify({\n status: \"ok\",\n server: \"ruflo-graphify-mcp\",\n version: \"1.0.0\",\n tools: TOOLS.length,\n toolNames: TOOLS.map((t) => t.name),\n }),\n { headers: { ...CORS, \"Content-Type\": \"application/json\" } },\n );\n }\n\n if (req.method !== \"POST\") {\n return new Response(\"Method not allowed\", { status: 405, headers: CORS });\n }\n\n // Detect whether the client wants SSE (Claude Code desktop/app sends this)\n const acceptHeader = req.headers.get(\"accept\") ?? \"\";\n const wantsSSE = acceptHeader.includes(\"text/event-stream\");\n\n let body: {\n jsonrpc: string;\n method: string;\n params: unknown;\n id: unknown;\n };\n try {\n body = await req.json();\n } catch {\n const msg = JSON.stringify({\n jsonrpc: \"2.0\",\n error: { code: -32700, message: \"Parse error\" },\n id: null,\n });\n return new Response(\n wantsSSE ? `event: message\\ndata: ${msg}\\n\\n` : msg,\n {\n status: 400,\n headers: {\n ...CORS,\n \"Content-Type\": wantsSSE ? \"text/event-stream\" : \"application/json\",\n },\n },\n );\n }\n\n const { method, params, id } = body;\n\n // Respond as SSE or plain JSON depending on what the client accepts\n const respond = (result: unknown) => {\n const json = JSON.stringify({ jsonrpc: \"2.0\", id, result });\n if (wantsSSE) {\n return new Response(`event: message\\ndata: ${json}\\n\\n`, {\n headers: {\n ...CORS,\n \"Content-Type\": \"text/event-stream\",\n \"Cache-Control\": \"no-cache\",\n },\n });\n }\n return new Response(json, {\n headers: { ...CORS, \"Content-Type\": \"application/json\" },\n });\n };\n\n const respondErr = (code: number, message: string) => {\n const json = JSON.stringify({\n jsonrpc: \"2.0\",\n id,\n error: { code, message },\n });\n if (wantsSSE) {\n return new Response(`event: message\\ndata: ${json}\\n\\n`, {\n headers: {\n ...CORS,\n \"Content-Type\": \"text/event-stream\",\n \"Cache-Control\": \"no-cache\",\n },\n });\n }\n return new Response(json, {\n headers: { ...CORS, \"Content-Type\": \"application/json\" },\n });\n };\n\n if (method === \"initialize\") {\n return respond({\n protocolVersion: \"2024-11-05\",\n capabilities: { tools: { listChanged: false } },\n serverInfo: { name: \"ruflo-graphify-mcp\", version: \"1.0.0\" },\n });\n }\n\n if (method === \"notifications/initialized\") {\n return new Response(null, { status: 204, headers: CORS });\n }\n\n if (method === \"ping\") {\n return respond({});\n }\n\n if (method === \"tools/list\") {\n return respond({ tools: TOOLS });\n }\n\n if (method === \"tools/call\") {\n const { name, arguments: args } = params as {\n name: string;\n arguments: Record;\n };\n try {\n const result = await executeTool(name, args || {});\n return respond({\n content: [\n {\n type: \"text\",\n text:\n typeof result === \"string\"\n ? result\n : JSON.stringify(result, null, 2),\n },\n ],\n });\n } catch (e) {\n return respondErr(-32000, (e as Error).message);\n }\n }\n\n return respondErr(-32601, `Method not found: ${method}`);\n}\n","deleted","label",[111],"pulls","branches","forks","envVars",{"_133":41,"_135":41},"connections",{"_133":41,"_134":41},"count","unfilledCount","emptyCount",{"_18":110,"_20":111,"_112":35,"_113":-5,"_114":70,"_115":68,"_116":37,"_22":137,"_67":118,"_119":120,"_121":122,"_123":26,"_124":-5,"_138":139,"_87":140},["D",1779543797630],"children",[],[111],["D",1779540510128],["D",1789578655349],{"_16":17,"_85":81},{"_16":17,"_79":17,"_80":81,"_32":33,"_82":83,"_84":26},{"_67":68,"_20":69,"_18":70,"_71":19,"_72":-5,"_73":-5,"_74":-5,"_75":-5,"_76":-5,"_77":21,"_78":17},"ctx",{"_60":-5,"_106":179,"_180":181,"_182":183,"_184":26,"_185":26,"_186":26,"_187":37,"_188":-5,"_189":-7,"_190":-7,"_191":41,"_192":26,"_193":26,"_194":-5,"_195":26,"_196":26,"_197":26,"_198":-5},"ENV",{"_150":151,"_152":153,"_154":69,"_155":156,"_157":158,"_159":160,"_161":162,"_163":164,"_165":166,"_167":168,"_169":170,"_171":172,"_173":174,"_175":176,"_177":178},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","RENDER_GIT_COMMIT","811aa22498c9b0b5a47e8d778de579cdb990f332","RENDER_GIT_BRANCH","POSTHOG_API_TOKEN","phc_nmoyuAkStEZuUp69rYlg1DZgrIt19Gx0Y4Hwf8tGgJP","POSTHOG_API_HOST","https://wart.val.town","WEB_API_TEMPLATE","https://{val}.web.val.run","APP_URL","https://www.val.town","MODULE_URL","https://esm.town","VANITY_WEB_API_TEMPLATE","https://{label}.val.run/","DENOLS_URL","https://lsp.val.town","NODE_ENV","production","CLOUDFLARE_TURNSTILE_SITE_KEY","0x4AAAAAACtaIZJH7s9rBMZ6","GOOGLE_CLIENT_ID","875989696899-jtsqkhlbdv5jrlsk8631p7ipjg3c6o62.apps.googleusercontent.com","STRIPE_PUBLISHABLE_KEY","pk_live_51N2zvWEpZTTLipIkVEwXrUG9AT0yeOOEYxszarZT1jpsZV58Ly6wlg3SltZpHN26CUalOBmUSY7adQRQiSkCZz2500qSXNkf8Y","API_URL","https://api.val.town",[],"preferencesKeybindings","default","preferencesTheme","light","preferencesFixers","preferencesCopilot","preferencesSelectionAi","preferencesCloseBrackets","preferencesChatPanelState","preferencesDprint","preferencesDenofmt","notificationCount","flagDenols","isBusinessOrgMember","businessOrgHandle","isBusinessOrgAdmin","isHigherTownieTier","navCollapsed","currentOrgId"]