codemogger
A local code indexing and search library that enables AI agents to perform semantic and keyword searches across codebases using tree-sitter and SQLite. It provides tools for indexing projects and finding precise code definitions without requiring external APIs, Docker, or server infrastructure.
README
<p align="center"> <img src="codemogger.png" alt="codemogger" width="200"> </p>
codemogger
Code indexing library for AI coding agents. Parses source code with tree-sitter, chunks it into semantic units (functions, structs, classes, impl blocks), embeds them locally, and stores everything in a single SQLite file with vector + full-text search.
No Docker, no server, no API keys. One .db file per codebase.
Why
Coding agents need to understand codebases. They need to find where things are defined, discover how concepts are implemented across files, and navigate unfamiliar code quickly. This requires both keyword search (precise identifier lookup) and semantic search (natural language queries when you don't know the exact names).
As AI coding tools become more composable - agents calling agents, MCP servers plugging into different hosts - this capability needs to exist as a library that runs locally. No external servers, no API keys, no Docker containers. Just a function call that returns results.
codemogger is that library. Embedded SQLite (via Turso) with FTS + vector search in a single .db file.
Install
npm install -g codemogger
Or use npx to run without installing.
Quick start
# Index a project
codemogger index ./my-project
# Search
codemogger search "authentication middleware"
Add to your coding agent's MCP config (Claude Code, OpenCode, etc.):
{
"mcpServers": {
"codemogger": {
"command": "npx",
"args": ["-y", "codemogger", "mcp"]
}
}
}
The MCP server exposes three tools:
codemogger_search- semantic and keyword search over indexed codecodemogger_index- index a codebase for the first timecodemogger_reindex- update the index after modifying files
SDK
codemogger is also usable as a library. The SDK has no model dependency - you provide your own embedding function:
import { CodeIndex } from "codemogger"
import { pipeline } from "@huggingface/transformers"
// Load embedding model (runs locally, no API keys)
const extractor = await pipeline("feature-extraction", "Xenova/all-MiniLM-L6-v2", { dtype: "q8" })
const embedder = async (texts: string[]): Promise<number[][]> => {
const output = await extractor(texts, { pooling: "mean", normalize: true })
return output.tolist() as number[][]
}
const db = new CodeIndex({
dbPath: "./my-project.db",
embedder,
embeddingModel: "all-MiniLM-L6-v2",
})
await db.index("/path/to/project")
// Semantic: "what does this codebase do?"
const results = await db.search("authentication middleware", { mode: "semantic" })
// Keyword: precise identifier lookup
const results = await db.search("BTreeCursor", { mode: "keyword" })
await db.close()
The MCP server and CLI ship with all-MiniLM-L6-v2 by default.
CLI
# Install globally
npm install -g codemogger
# Index a directory
codemogger index ./my-project
# Search
codemogger search "authentication middleware"
# List indexed codebases
codemogger list
How it works
- Scan - walk directory, respect
.gitignore, detect language from extension - Chunk - parse each file with tree-sitter (WASM), extract top-level definitions (functions, structs, classes, impl blocks). Items >150 lines are split into sub-items.
- Embed - encode each chunk with the provided embedding model (runs locally, no API)
- Store - write chunks + embeddings to SQLite with FTS index
- Search - vector cosine similarity (semantic) or FTS with weighted fields (keyword)
Incremental: only changed files (by SHA-256 hash) are re-processed on subsequent runs.
Languages
Rust, C, C++, Go, Python, Zig, Java, Scala, JavaScript, TypeScript, TSX, PHP, Ruby.
Benchmarks
Benchmarked on 4 real-world codebases on an Apple M2 (8GB). Each project uses its own isolated database. Embeddings use vector8 (int8 quantized, 395 bytes/chunk vs 1,536 for float32). Embedding model: all-MiniLM-L6-v2 (q8 quantized, local CPU). Search times are p50 over 3 runs.
Performance
| Project | Language | Files | Semantic | Keyword | ripgrep |
|---|---|---|---|---|---|
| Turso | Rust | 748 | 35 ms | 1 ms | 25 ms |
| Bun | Zig | 9,255 | 137 ms | 2 ms | 166 ms |
| TypeScript | TypeScript | 39,298 | 242 ms | 4 ms | 1,500 ms |
| Kubernetes | Go | 16,668 | 617 ms | 12 ms | 731 ms |
Keyword search is 25x-370x faster than ripgrep and returns precise definitions instead of thousands of file matches.
Indexing is a one-time cost dominated by embedding (~97% of time). Subsequent runs only re-embed changed files.
Search quality: semantic search vs ripgrep
The real advantage isn't speed - it's finding the right code when you don't know the exact keywords.
"write-ahead log replication and synchronization" (Turso)
| codemogger (top 5) | ripgrep |
|---|---|
impl LogicalLog - core/mvcc/persistent_storage/logical_log.rs |
3 files matched |
enum CommitState - core/mvcc/database/mod.rs |
(keyword: "write-ahead") |
function new - core/mvcc/database/checkpoint_state_machine.rs |
|
struct LogicalLog - core/mvcc/persistent_storage/logical_log.rs |
|
function checkpoint_shutdown - core/storage/pager.rs |
"SQL statement parsing and compilation" (Turso)
| codemogger (top 5) | ripgrep |
|---|---|
function parse_and_build - core/translate/logical.rs |
139 files matched |
macro compile_sql - core/incremental/compiler.rs |
(keyword: "statement") |
function parse_from_clause_opt - parser/src/parser.rs |
|
function parse_from_clause_table - core/translate/planner.rs |
|
function parse_table - core/translate/planner.rs |
"HTTP request parsing and response writing" (Bun)
| codemogger (top 5) | ripgrep |
|---|---|
function consumeRequestLine - packages/bun-uws/src/HttpParser.h |
0 files matched |
declaration ConsumeRequestLineResult - packages/bun-uws/src/HttpParser.h |
(keyword: "HTTP") |
function llhttp__after_headers_complete - src/bun.js/bindings/node/http/llhttp/http.c |
|
function llhttp_message_needs_eof - src/bun.js/bindings/node/http/llhttp/http.c |
|
function shortRead - packages/bun-uws/src/HttpParser.h |
"scheduling pods to nodes based on resource requirements" (Kubernetes)
| codemogger (top 5) | ripgrep |
|---|---|
type Scheduling - staging/src/k8s.io/api/node/v1beta1/types.go |
429 files matched |
type Scheduling - staging/src/k8s.io/api/node/v1/types.go |
(keyword: "scheduling") |
type SchedulingApplyConfiguration - staging/.../node/v1/scheduling.go |
|
function runPodAndGetNodeName - test/e2e/scheduling/predicates.go |
|
type createPodsOp - test/integration/scheduler_perf/scheduler_perf.go |
"container health check probes and restart policy" (Kubernetes)
| codemogger (top 5) | ripgrep |
|---|---|
type ContainerFailures - test/utils/conditions.go |
1,652 files matched |
variable _ - test/e2e/common/node/container_probe.go |
(keyword: "container") |
function checkContainerStateTransition - pkg/kubelet/status/status_manager.go |
|
function TestDoProbe_TerminatedContainerWithRestartPolicyNever - pkg/kubelet/prober/worker_test.go |
|
function proveHealthCheckNodePortDeallocated - pkg/registry/core/service/storage/storage_test.go |
ripgrep matches thousands of files on common keywords. codemogger returns the 5 most relevant definitions.
Architecture
- Bun/TypeScript runtime
- tree-sitter (WASM) for AST-aware chunking - 13 language grammars
- all-MiniLM-L6-v2 for local embeddings (384 dimensions, q8 quantized)
- Turso for storage - embedded SQLite with FTS + vector search extensions
- Single DB file stores multiple codebases with per-codebase FTS tables and global vector search
License
MIT
推荐服务器
Baidu Map
百度地图核心API现已全面兼容MCP协议,是国内首家兼容MCP协议的地图服务商。
Playwright MCP Server
一个模型上下文协议服务器,它使大型语言模型能够通过结构化的可访问性快照与网页进行交互,而无需视觉模型或屏幕截图。
Magic Component Platform (MCP)
一个由人工智能驱动的工具,可以从自然语言描述生成现代化的用户界面组件,并与流行的集成开发环境(IDE)集成,从而简化用户界面开发流程。
Audiense Insights MCP Server
通过模型上下文协议启用与 Audiense Insights 账户的交互,从而促进营销洞察和受众数据的提取和分析,包括人口统计信息、行为和影响者互动。
VeyraX
一个单一的 MCP 工具,连接你所有喜爱的工具:Gmail、日历以及其他 40 多个工具。
graphlit-mcp-server
模型上下文协议 (MCP) 服务器实现了 MCP 客户端与 Graphlit 服务之间的集成。 除了网络爬取之外,还可以将任何内容(从 Slack 到 Gmail 再到播客订阅源)导入到 Graphlit 项目中,然后从 MCP 客户端检索相关内容。
Kagi MCP Server
一个 MCP 服务器,集成了 Kagi 搜索功能和 Claude AI,使 Claude 能够在回答需要最新信息的问题时执行实时网络搜索。
e2b-mcp-server
使用 MCP 通过 e2b 运行代码。
Neon MCP Server
用于与 Neon 管理 API 和数据库交互的 MCP 服务器
Exa MCP Server
模型上下文协议(MCP)服务器允许像 Claude 这样的 AI 助手使用 Exa AI 搜索 API 进行网络搜索。这种设置允许 AI 模型以安全和受控的方式获取实时的网络信息。