jevgrep
这是 MathBullied 公开的项目资料。本站按原始来源展示项目信息，用中文说明适用场景和阅读边界；项目名、源帖与代码保持原样，便于逐项核对。
这条案例记录了什么
搜索与检索、MCP 与 Skills、编码 Agent
给文本片段或候选文档提供相关性判断。
本站直接测试
原始来源：MathBullied via Reddit。作者自述，本站未独立复现。
MathBullied
记录日期：2026-09-20。日期与身份应以原始资料为准。
原始演示视频
视频来自此案例记录的原始媒体；播放内容和作者声明不等于本站复现。
怎样核对这个项目
- 先打开原始来源，确认作者、日期与 Jev 在项目中的具体用途。
- 如果提供仓库，再检查代码、运行要求和许可证；仓库存在不代表本站已经运行成功。
- 对速度、成本、准确率和规模数字，查看原文的任务、环境和计算口径。
- 原文是否可追溯。
- 召回与误排表现。
- 大规模成本是否实测。
- 真实调用入口和参数。
原始文字与技术细节
以下内容保留原语言，供核对事实。中文页的场景说明是阅读提示，不是逐句翻译或实测结论。
展开英文项目摘要与原帖
项目摘要
JevGrep is an MCP server and CLI that lets a coding agent ask a natural-language question about a codebase, ranks relevant code fragments, and returns the original source with file paths and line numbers. The author reports lower context usage and search time in repository exploration tests, without publishing benchmark values.
来源原文
Claude Code can spend a surprising amount of context on repeated text searches and full-file reads. So i thought a good use of Jev could be a "JevGrep", an MCP tool that lets Claude ask a natural-language question about a codebase, ranks code fragments by relevance, and returns the original source with file paths and line numbers. Instead of doing multiple grep / rg searches and opening large files, Claude can directly ask things like: "Where is symlink access controlled, and what prevents path escapes?" and get back only the most relevant code. In my tests, this noticeably reduced both context usage and search time on repository exploration tasks. It works as a CLI, or as an MCP server connected directly to Claude Code. GitHub: https://github.com/nassim-arifette/jevgrep
原记录的限制
- The source post publishes no retrieval precision, recall or latency numbers.
- A Reddit comment points to Graphify as an alternative code-indexing approach.