Skip to main content
Glama
82,759 servers. Updated

Matching MCP tools:

Matching MCP Connectors:

"A general search for code or coding resources" matching MCP servers:

GET /v1/servers — MCP directory API reference
  • A
    license
    Not graded
    quality
    B
    maintenance
    MCP server exposing four task-shaped tools (resolve, pay, verify, disclose) for General Liquidity, enabling agents to normalize counterparties, submit intents, verify disclosures, and produce signed disclosures.
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    Enables semantic code search across indexed code folders using vector embeddings, with support for multiple embedding providers and automatic file watching. Provides an admin UI and integrates with MCP clients for natural language code queries.
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Semantic + lexical code search as an MCP server. Agents query in natural language and get back ranked file:line ranges to read precisely.
    15
    1
    MIT
  • A
    license
    A
    quality
    B
    maintenance
    Enables AI coding assistants to semantically search codebases by meaning rather than exact text, with zero external daemons and fully local embeddings. Works out-of-the-box with Claude Code, Gemini CLI, Antigravity, and Cursor.
    4
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables AI agents to query OpenRouter model information including prices, ELO rankings, context, and perform comparisons.
    33
    1
    MIT
  • F
    license
    Not graded
    quality
    D
    maintenance
    Enables LLMs to perform high-performance code search and analysis across multiple languages using symbol indexing, regex text search, and structural AST pattern matching. It also provides tools for technology stack detection and dependency analysis with persistent caching for optimized performance.
    7
    -
  • F
    license
    Not graded
    quality
    B
    maintenance
    MCP server that provides OpenRouter model pricing data, enabling price lookups, trending/cheapest lists, and model searches without an API key.
    -
  • A
    license
    A
    quality
    A
    maintenance
    Voice interface for Claude Code: you talk, the agent listens, codes, and talks back while it works. Live speech-to-text with turn-taking, Grok/xAI voices with per-subagent personas, and a real-time HUD dashboard.
    6
    4
    9
    MIT
  • A
    license
    A
    quality
    B
    maintenance
    Enables fast, low-token code search for AI coding agents via a local BM25 engine built on SQLite FTS5, with support for camelCase, snake_case, and Japanese text. Provides a stateless MCP stdio server and a Hermes adapter for multi-agent environments.
    1
    MIT
  • A
    license
    B
    quality
    A
    maintenance
    MCP server for coding-os, a cognitive operating system that gives AI agents memory, structure, and discipline. It exposes tools for project management, task tracking, knowledge graphs, and cognition traces to Claude Code and Codex.
    87
    6
    Apache 2.0
  • A
    license
    Not graded
    quality
    C
    maintenance
    MCP server that demonstrates the Resources feature by exposing static and dynamic resources, including contact data and personalized greetings, through MCP.
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Provides live wait times and office details for all 60 Oregon DMV field offices by scraping the ODOT website, with no authentication required.
    8
    MIT
  • A
    license
    Not graded
    quality
    F
    maintenance
    LLM routing proxy that cuts API costs 60-90% by auto-selecting the cheapest capable model across OpenAI, Anthropic, and Google. Provides stats, config, and model comparison tools via MCP.
    21
    1
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Provides AI coding assistants with code search, impact analysis, task chaining, and persistent memory to turn AI demos into deliverable code.
    17
    MIT