Trending repositories

Ranked by Attention Score: stars gained over the last 7 complete days

Period

Sort order

Tag

Filters (1)

Apply

Filters

Primary language

License

Total stars

Last push

Created

Archived

Clear all filters

6 repositories by Attention Score · Oct 28, 2026 – Nov 3, 2026 (UTC)

License: MIT
Tag: Code search
Clear all

1.colbymchenry / codegraph

Pre-indexed code knowledge graph, auto syncs on code changes, for Claude Code, Codex, Gemini, Cursor, OpenCode, AntiGravity, Kiro, CoPilot, and Hermes Agent — fewer tokens, fewer tool calls, 100% local

TypeScript MIT76K total5.1K forks

+797 stars

from 75,612 · score 6.68

2.DeusData / codebase-memory-mcp

Local code intelligence for developers and AI agents. Connect code, docs and infrastructure in a persistent graph, with CBM Lens, MCP tools, agent integrations and change-aware test selection.

claude-code
code-analysis
code-intelligence
developer-tools
knowledge-graph
mcp
+14 more

C MIT48K total4K forks

+412 stars

from 47,656 · score 6.02

3.dzhng / jevgrep

Find code by asking what it does. A CLI for coding agents that uses Jev to discover relevant files and source context.

ai-sdk
claude-code
cli
code-search
codex
coding-agents
+6 more

TypeScript MIT3.2K total241 forks

+208 stars

from 2,958 · score 5.34

4.ast-grep / ast-grep

⚡A CLI tool for code structural search, lint and rewriting. Written in Rust

codemod
linter
ast
babel
command-line
command-line-tool
+9 more

Rust MIT16K total490 forks

+56 stars

from 16,375 · score 4.04

5.dmtrKovalenko / fff

The fastest and the most accurate file search SDK for AI agents, Neovim, Rust, C, Python, Bun and NodeJS

filesearch
lua
neovim
neovim-plugin
rust
bun
+5 more

Rust MIT11K total477 forks

+40 stars

from 11,179 · score 3.71

6.zilliztech / claude-context

Code search MCP for Claude Code. Make entire codebase the context for any coding agent.

agent
agentic-rag
ai-coding
code-search
cursor
embedding
+14 more

TypeScript MIT13K total939 forks

+19 stars

from 12,649 · score 3.00

Order: Attention Score

Most net stars gained in the window first. The score only puts this gain on a log scale, so the order is the order of the gain.

How the ranking works

Ranked by stars gained in the window. The score is the natural log of one plus that gain, so a repository's rank is exactly its star gain's rank.

score = log1p(net stars gained in the trailing T complete UTC days)

A repository is ranked only when its Star History covers every day of the window and its latest Observation is not missing.

The longest window is 180 days. Star History from the Repository Host goes back at most 180 days before the first daily record that AwesomeRepos made for the repository. A longer window needs more of these daily records first. A repository younger than the window does not rank in it.

The filters select from the same eligible repositories. A repository matches the topics when it has any of them. Total stars is the count now. Last push and creation on the Repository Host count back from the start of today (UTC). The counts beside the languages, licenses, and topics include all ranked repositories in the window. A Tag holds the repositories that have it. See Tags.

Repositories enter the index from the starting dataset of the index, or by gaining stars faster than the published admission threshold, whatever their size. A repository stays in the index after it enters. Thus an archived repository can still rank.

Browse the Repository Index