Skip to main content
Glama
97,619 servers. Updated

Matching MCP tools:

Matching MCP Connectors:

"A service or tool for purchasing tickets quickly" matching MCP servers:

GET /v1/servers – MCP directory API reference
  • F
    license
    D
    quality
    D
    maintenance
    A simple MCP server implementation in TypeScript that communicates over stdio, allowing users to ask questions that end with 'yes or no' to trigger the MCP tool in Cursor.
    1
    7 npm
    -
  • A
    license
    A
    quality
    A
    maintenance
    Gives LLM agents spatial awareness inside Autodesk Maya, enabling scene inspection and measurement, aesthetic and engineering audits, camera planning, checkpoint/rollback safety, asset import, and viewport or render previews. Agents can also execute arbitrary Python in Maya to build and verify 3D scenes against engineering rules instead of writing blind.
    25
    433 PyPI
    2
    MIT
  • A
    license
    B
    quality
    B
    maintenance
    MCP server connecting Claude/Cursor to Codex CLI, enabling code analysis via @ file references, multi-turn conversations, sandboxed edits, and structured change mode.
    13
    325 npm
    24
    MIT
  • A
    license
    B
    quality
    D
    maintenance
    Enables AI assistants to leverage Qwen's code analysis capabilities with large context windows, supporting file/directory analysis, sandbox execution, and multiple approval modes for safe code operations.
    3
    23 npm
    3
    MIT
  • A
    license
    C
    quality
    B
    maintenance
    A Model Context Protocol server that enables AI assistants to interact with Google Gemini CLI, allowing them to leverage Gemini's large token window for analyzing files and codebases using natural language commands.
    5
    3,334 npm
    2,285
    MIT
  • F
    license
    Not graded
    quality
    C
    maintenance
    Enables AI assistants to interact with multiple AI models through the OpenCode CLI with a unified interface. Supports plan mode for structured analysis, flexible model selection, and natural language queries with file references.
    11
    -
  • F
    license
    Not graded
    quality
    D
    maintenance
    This is a Model Context Protocol (MCP) server that allows AI assistants to interact with the OpenCode CLI. It enables AI assistants to leverage multiple AI models through a unified interface, with features like plan mode for structured thinking and extensive model selection.
    1
    -
  • A
    license
    A
    quality
    B
    maintenance
    Enables AI agents to invoke a local Stata installation, including a Windows Stata build under Wine on Linux and macOS, for regression analysis, econometrics, paper replication, and empirical research with command guards, resource monitoring, and automatic log capture.
    4
    2
    AGPL 3.0
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables agents to synthesize typed MCP tool schemas at runtime, validate Python ASTs for unsafe imports, compile sandboxed callable handlers, and hot-plug them into an active MCP runtime. It provides a zero-dependency, standard-library-only MCP server for safe just-in-time tool creation and execution.
    7
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Enable Claude (or any other LLM) to interactively debug your code (set breakpoints and evaluate expressions in stack frame). It's language-agnostic, assuming debugger console support and valid launch.json for debugging in VSCode.
    11 npm
    516
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    A service that processes natural language requests to perform mathematical calculations by integrating Claude AI with a calculator API through the Model-Context-Protocol architecture.
    29 npm
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    MCP-ORTools integrates Google's OR-Tools constraint programming solver with Large Language Models through the MCP, enabling AI models to: Submit and validate constraint models Set model parameters Solve constraint satisfaction and optimization problems Retrieve and analyze solution
    21
    MIT