原型 · 预览版:收录官方注册中心里的全部服务器,每 30 分钟同步一次。使用 Google 登录即可撰写评价。原型 · 每 30 分钟更新
PopNx MCP为使用 AI 的人准备的 MCP 服务器 · 用大白话讲清楚

ctx — queryable code graph

作者:Eagle-Logic版本 0.28.1i★ 3i在你的电脑上运行代码仓库 ↗
注册名称io.github.Eagle-Logic/ctx

安装方法

What it does

Call graphs, blast radius and API-breakage gates. Every answer reports its own completeness.

  • Connects 在你的电脑上运行
  • Account or key No key needed
  • Category 开发者工具

可搭配使用

教 AI 做这类工作的 Skill,可与本项一起使用

rea

Reverse engineer anything with agents, from app behavior down to native binaries.

作者:morluto★ 468,7331 个 skill

Skill · 操作手册

andrej-karpathy-skills

A single CLAUDE.md file to improve Claude Code behavior, derived from Andrej Karpathy's observations on LLM coding pitfalls.

作者:multica-ai★ 234,3321 个 skill

Skill · 操作手册未注明许可证

graphify

Turn any codebase, with its docs, SQL schemas, configs, and PDFs, into a queryable knowledge graph. A /graphify skill for Claude Code, Cursor, Codex, and Gemini CLI: local deterministic AST parsing, every edge explained, no vector store.

作者:Graphify-Labs★ 150,2871 个 skill

Skill · 操作手册

为什么排在这里

列表按使用分(满分 100)排序,由以下部分组成

热度7/80GitHub 星标或每周下载量:较大的计 60,较小的计 20
新鲜度12/1230 天内有发布或代码更新得满分
仍在响应0/8上次检查时云端端点有响应
使用分19/100

质量: 基础检查通过 3/3 项(仅展示,不用于排序) · 上升势头: 暂无数据 (只用于“上升中”标签)

安装

选择你使用的 AI 应用,然后复制设置。

通过 3/3 项检查 · 在你的电脑上运行

第一步:你用哪个 AI?

选择你用的应用,步骤会显示在下方。

Claude 暂时无法连接 ctx — queryable code graph

开发者尚未在 MCP 注册表中填写安装方式

ChatGPT 暂时无法连接 ctx — queryable code graph

开发者尚未在 MCP 注册表中填写安装方式

你可以改用这些方式

B · 开发者工具 类中能连接 ChatGPT 的其他服务器

从同类中使用较多的里挑选,仅限用地址即可连接、无需密钥的

Claude Code 暂时无法连接 ctx — queryable code graph

开发者尚未在 MCP 注册表中填写安装方式

Cursor 暂时无法连接 ctx — queryable code graph

开发者尚未在 MCP 注册表中填写安装方式

VS Code 暂时无法连接 ctx — queryable code graph

开发者尚未在 MCP 注册表中填写安装方式

其他支持 MCP 的应用(如 Windsurf、Zed、Gemini CLI)添加方式各不相同,请在应用列表中查看

查看所有支持 MCP 的应用 →

JSON 设置在下方“开发者专用”中

卡住了?问问正在用 ctx — queryable code graph 的人💬 讨论 →

一览

每周下载量i
不在 npm/PyPI 上
连接方式
在你的电脑上运行
最新版本i
0.28.1
发布到注册中心i
2026年11月16日
代码最后更新i
2026年11月18日
作者
Eagle-Logic
软件包
cargo: code-context
注册状态
活跃

哪些应用可以使用它

依据这个服务器的连接方式和各应用自己的文档,检查于 2026年11月10日。

在你的电脑上运行,适用于

GooseLM StudioMsty StudioCherry StudioVisual StudioWindsurf (Devin Desktop)ZedKiroClineContinueJetBrains AI AssistantCodex CLIGemini CLIOpenCodenodecodeWarpLibreChatRaycast

全部应用及其优缺点 →

它能做什么

它在你的电脑上运行;安装后,工具列表会显示在你的 AI 应用中。

基础检查i

我们检查的是任何人都能看到的信息;我们没有阅读代码。不适用的检查项不计入总数。 · 检查于 2026年11月19日

  • ✓ 通过

    作者与仓库一致

    注册名称已通过 GitHub 账户 Eagle-Logic 验证,该账户拥有此仓库

  • ✓ 通过

    仍在维护

    代码最后更新于昨天

  • ✓ 通过

    有许可证

    使用 MIT

  • – 不适用

    端点有响应

    它在你的电脑上运行,没有互联网端点

  • – 不适用

    使用 OAuth 登录

    在你的电脑上运行,改用本地设置

  • … 尚未检查

    工具描述中没有隐藏指令

    它在你的电脑上运行;我们只能读取互联网端点的工具列表

已公开的漏洞(OSV.dev)

未检查:只能检查标明版本的 npm 和 PyPI 包

我们检查什么 → · JSON

作者:申请重新检查或报告信息错误
给作者:在 README 中加徽章

如果你是作者,可把这段代码贴到 README。徽章会链接回本页。

[![Featured on PopNx MCP](https://mcp.popnx.com/badge/eagle-logic-ctx.svg)](https://mcp.popnx.com/en/servers/eagle-logic-ctx)

讨论

提问、分享技巧或报告无法使用。按“有帮助”数量排序。

还没有帖子,欢迎第一个提问或分享。

此处内容由用户撰写,不代表 PopNx 团队。

登录后发帖

用户评价

还没有评价

登录后写评价

与“开发者工具”中的其他服务器比较i

  • 星标数多于此分类中其他 6182 个服务器的 81%
  • 发布到注册中心的时间比此分类中其他 6182 个服务器的 89% 更新
  • 基础检查结果等于或优于此分类中其他 6182 个服务器的 99%

与注册中心里这个分类中所有活跃的服务器比较。只有当发布者拥有该仓库时,星标数才计入。

常见问题

ctx — queryable code graph 安全吗?

它在 3 项适用的基础检查中通过了 3 项。我们没有阅读代码。在添加密钥或令牌之前,请先看看这个服务器要求哪些权限,并使用只具备所需权限的密钥。

它需要哪些密钥或代码?

注册中心没有列出必需的密钥,不过有些服务器会在首次使用时要求你登录。

它在我的电脑上运行还是在云端?

它在你的电脑上运行。你的 AI 应用会在需要时启动它,数据不会经过作者的服务器(除非它自己调用在线服务)。

它还在维护吗?

GitHub 仓库最后更新于昨天,最新版本(0.28.1)于3天前进入注册中心。

哪些应用可以使用它?

支持 MCP 的应用,例如 Claude Desktop、Claude Code、Cursor 和 VS Code。你的电脑上还需要有 Rust。

有什么可以替代它?

同一分类中有:GitDiagram, Appllama, Cloudflare MCP, Omnara, Repowise

功能相近的其他选择

同一分类、其他作者、命令已通过检查。官方的排在前面,再按星标排序。

如何看卡片:↓ 每周下载量i★ GitHub 星标i三大支柱:评价 · 检查 · 使用情况i更新 = 最新版本发布到注册中心的时间i

GitDiagram

Architecture diagrams, explanations and Mermaid source for public GitHub repositories.

作者:ahmedkhaleel2004广泛使用★ 1.9万2个月前更新

在云端运行✓ 服务方 · gitdiagram.comPopNx 团队已实际试用

Appllama

Study screens, flows and paywalls from top-earning iOS apps, then build from what wins.

作者:Appllama广泛使用★ 52303个月前更新

在云端运行✓ 服务方 · appllama.io

Omnara

Deploy durable AI agents with Omnara, an open-source managed-agent platform.

作者:omnara-ai广泛使用★ 34172个月前更新

在云端运行✓ 服务方 · omnara.com

Repowise

Codebase intelligence for AI coding agents: graph, git history, docs, decisions, code health.

作者:repowise-dev广泛使用↓ 6506/周★ 8180 整个仓库的星标6天前更新

电脑或云端✓ 服务方 · repowise.dev
与相似项目对比
本项
ctx — queryable code graph
GitDiagramAppllamaCloudflare MCPOmnaraRepowise
运行位置需要安装在电脑上在云端运行,无需安装在云端运行,无需安装在云端运行,无需安装在云端运行,无需安装云端或安装在电脑上都可以
需要密钥否否否否否否
可在 Claude 中按 + 添加否否否是否否
基础检查3/34/44/44/44/45/5
许可证MITMITMITApache-2.0Apache-2.0AGPL-3.0
价格登记中未列出费用登记中未列出费用登记中未列出费用登记中未列出费用登记中未列出费用登记中未列出费用

作者的 README

打开 README

按原文从作者的仓库复制。PopNx MCP 没有审查或背书其内容。HTML、图片和脚本已被移除。链接会离开本站。

ctx

*The binary is ctx. The crate is code-context (ctx was taken on crates.io in 2017).*

A queryable code graph for coding agents. Not a map you paste at boot — a set of queries an agent runs mid-task: *who calls this, how does execution get here, what breaks if I change it, what must a move touch, does my port still match the original.*

One Rust binary. Tree-sitter for Rust, Python, TypeScript/TSX, JavaScript/JSX, Go, Java, and Markdown. No language servers, no embeddings, no index to warm. The graph is a pure function of the source tree — same code in, same answer out — and it builds in ~100 ms, so every query runs against current source.

$ ctx callers resolve_call

1 caller(s) of 'resolve_call':

extract::Walk::rec (src/extract/mod.rs:2368-2462 #ab0418a77d9f) → resolve_call

completeness: no call site named resolve_call went unresolved anywhere in this tree — this blast radius is complete to the limit of what ctx parses. At least 1005 undescended region(s) in this tree were not read; see ctx doctor.

That last line is the whole idea, and it does two jobs. It claims completeness for what ctx read, and it bounds that claim by counting what it never read — macro bodies and static/const initializers, whose contents are not parsed as code. A call hiding in one is absent rather than unresolved, so nothing else would have revealed it. Every other code graph tells you what it found. `ctx` tells you what it missed — per edge, in aggregate, and with the grep list to check it yourself.

It matters because the failure mode of a code graph is silent. A blast radius that comes back short reads exactly like a blast radius that is complete, and an agent cannot tell the difference — so it changes the signature and ships the break. Every tool in this space has gaps; this one is built so you can enumerate them.

→ [EXAMPLES.md](EXAMPLES.md) — ten commands run against this repo, verbatim output, including the parts where ctx reports its own limits.

→ [BENCHMARK.md](BENCHMARK.md) — the same claims re-run on six public repositories pinned to exact commits, reproducible with ./bench/run.sh. Including the row where it finds a limitation in ctx.

→ [What the integration itself costs](#measuring-what-it-costs) — ctx's own MCP tool definitions sit in every turn whether a tool is ever called or not, which makes them 3.0× the standing cost of the CLI instructions block. That is the shape this project objects to, measured on itself.

Four things you won't find elsewhere

1. Every edge tells you how much to trust it

Every static analyzer guesses. ctx is the one that says where.

An edge backed by a resolved import, a path, a self receiver, or a declared type is unmarked — rely on it. An edge inferred from an *opaque* receiver (expr.method(), where nothing in the source states the type) is marked ~. A branch of a dynamic-dispatch fan-out is marked *. And ctx doctor names every callee it could not pin at all, with counts:

## Internal recall — the number to trust

1521/1606 = 94.7% of call sites that could be internal, ctx pinned this many.

What ctx missed (callee names that exist here but went unpinned)

grep these; every other edge in the map is one ctx could prove. 50 walk 11 context 8 group 4 est_tokens

Low-confidence zones (edges to distrust — grep to confirm)

parity 18% heuristic (11/61 edges) main 7% heuristic (9/127 edges) refactor 5% heuristic (1/20 edges) extract 2% heuristic (4/235 edges)

The recall number comes with the exact grep list for everything it doesn't cover. The denominator is honest too: a call into std or a third-party crate is excluded, because no internal edge could exist for it however good the resolver gets — and that classification is by evidence (is this name defined anywhere under the root?), not a hardcoded list.

Heuristic method attribution is also language-scoped. A unique method name is evidence only within one language; across languages it is coincidence, so tok.apply_chat_template(...) in Python is never attributed to a Rust method of the same name. Before that guard, 45 of 50 reported callers of that name were artifacts and ~18% of module dep edges were impossible Python→Rust edges — which then distorted core's ranking.

The honest bit isn't that coverage is high. It's that the gaps are enumerable.

That property is not decoration — it is how this tool gets built. Go support went from 36.8% to 89.6% internal recall on go-chi/chi in six steps, and every step was a class of call site the census had already named by count: package scope spanning files, constructor return types, calls leaving through an external import, a func literal shadowing its enclosing scope, the /vN in a module path binding the wrong package name, and method chains. Not one of those was visible in the aggregate number. Each was one line in *What ctx missed*, with the grep to confirm it.

A tool that reported only "36.8%" would have told you it was bad without telling you why, which is the position every other code graph leaves you in.

2. changed --api — a breaking-change gate that names who breaks

Builds the public API surface at a base ref (in a throwaway detached worktree) and in the working tree, then reports what was removed or whose signature changed — each with the callers it breaks.

$ ctx changed --api --since HEAD~1

API changes vs HEAD~1

0 removed, 4 changed, 7 added.

Changed signature — potentially breaking

  • query::coverage_report [fn] (src/query.rs:1420) was: pub fn coverage_report(g: &Graph, unsupported: &[(String, usize)], json_out: bool) -> String now: pub fn coverage_report(g: &Graph, unsupported: &[(String, usize)], explain: bool, json_out: bool) -> String callers (5): mcp::dispatch, query::tests::coverage_separates_internal_external_and_blind_spots, …

--strict turns it into a CI gate, and fails only on removals. That asymmetry is deliberate. A removal is unambiguous: nothing can call what is gone. A signature change might be an added optional parameter or a new struct field — routine, compatible work — and ctx is structural, with no type resolution, so it cannot tell that from a changed parameter type. Failing on both was tried and would have blocked ordinary additive commits on the first real repo it met; a gate that cries wolf gets switched off, which is worse than no gate. So signature changes are reported, and under --strict say explicitly that they were reported and not failed.

Treat it as a tripwire that surfaces an unintended removal in review, not as a semver authority — a language-specific tool with a type system (cargo-semver-checks, apidiff, japicmp) is stricter within its language. The trade ctx makes is breadth: one gate across Rust, Python, TypeScript, JavaScript and Go in a polyglot repo.

# .github/workflows/ci.yml — PR-only; fetch-depth 0, the default shallow clone

has no merge base.

  • uses: actions/checkout@v7 with: { fetch-depth: 0 }
  • run: cargo install code-context --locked
  • run: ctx changed --api --strict --since "origin/${{ github.base_ref }}"

This isn't a context tool. It's CI.

3. move-plan — a refactor oracle, not an actuator

move-plan emits every site a module relocation must touch; move-verify checks the result. ctx never writes source files.

ctx move-plan native::gate native::routing::gate   # file move + every import rewrite

... agent applies the edits ...

ctx move-verify native::gate native::routing::gate # exits non-zero if anything is orphaned

The reasoning: an agent can already make edits cheaply and precisely. What it cannot do is know it found *every* site, or prove nothing was orphaned. The scarce thing is ground truth, not typing — and staying read-only keeps ctx free of partial application and undo semantics.

Scope is bounded by what ctx can prove. Moves ride on import and link resolution — path arithmetic, deterministic, non-heuristic — which is ctx's strongest signal, so the site list is exact for the languages it parses. Dependents reached only by receiver inference have no literal string to rewrite and are listed separately as *unverified*, never mixed in with real sites. Rust mod declarations are not imports, so the plan names them as a required manual step rather than omitting them silently. Renaming a *method* is deliberately not offered: it would ride on receiver inference, which resolves a minority of call sites, and a plan built on that would silently miss some.

4. parity — cross-language port fidelity

Porting Python to Rust, or TypeScript to Python? parity answers "is this port a faithful structural copy?" Because the item model is language-neutral, a source module and its port are two renderings of one skeleton.

$ ctx parity research/gate.py src/gate.rs --aliases py-rust

ctx parity — source → port

source 6 members · target 5 · aligned 5 (83% of source) · 1 via alias

Missing in port (1) — in source, no counterpart in target

fn Gate.record gate.py:18

Arity drift (1)

fn Gate.score source=2 → port=1 gate.py:7

Aligned via alias (1) — matched through a rename rule, not exactly

fn Gate.init → Gate.new (via init → new)

parity: 5/6 source aligned · 1 missing · 1 arity · 0 call · 0 moved

A dropped method, a dropped parameter, and the __init__→new rename, in one command. --strict exits non-zero on any missing member. I'm not aware of another tool that does this. It might be more or less useful depending on your specific languages and abstractions.

"How is this different from aider's repo map?"

Aider's repo map — and the MCP servers that repackage it, like RepoMapper — compresses a repository into a ranked blob that gets injected at the start of a session, sized to a token budget. It's a good answer to "what is this codebase" for a model that has seen none of it.

ctx answers a different question. Once the agent is *in* a task, it doesn't need the repo ranked — it needs specific facts: trace, path, callers, context, changed --api, move-plan, parity. Those are queries mid-task, not a blob at boot. Ranking is one small command here (ctx core), not the product.

The nearer comparison is Serena, which does LSP-backed symbol navigation. Against it, ctx trades semantic precision for two things:

ctxLSP-based (Serena)
setupone binary, grammars compiled ina language server per language, configured and running
startup~100 ms graph build, per queryserver warm-up, project indexing
determinismpure function of the source treedepends on server state, versions, build artifacts
uncertaintymarked per edge (~, *) + a miss censusresolved or absent, silently
coverage7 languages (today), one graph across all of themas many as you install servers for

If you need type-perfect resolution inside one language, use an LSP. If you want the same graph across a polyglot repo with nothing to install and answers that state their own confidence, that's this.

ctx does ship the boot map too (ctx map), so you can have it if you want it. But we'll say plainly what dogfooding taught us: it's the least useful thing here. More on why.

"Why not just grep?"

Often you should. Here is the measurement, including where grep wins.

Counting tokens. Every figure in this README is ctx's own estimate —

len/3, the same one `--max-tokens

只显示了开头部分;其余内容请在仓库中阅读