Skip to main content
Glama
268,016 tools. Last updated 2026-07-07 07:50

"Full-Stack MEAN CRUD Development" matching MCP tools:

  • Create a full-stack decentralized application on Aptos blockchain with resources for Move smart contracts, project management, and frontend development.
    Apache 2.0
  • Execute full-stack development tasks using AI agents for rapid prototyping, code generation, and multi-framework project work with file-based collaboration.
    MIT
  • Manage Todoist labels by creating, reading, updating, and deleting them with full CRUD operations for organized task categorization.
    GPL 3.0
  • Retrieve Laravel CRUD implementation templates to generate controllers, models, migrations, and other components for rapid development.
  • Delete pending screenshots from the stack. Pass specific capture numbers to remove, or omit to clear all screenshots and reset numbering.
    MIT

Matching MCP Servers

Matching MCP Connectors

  • Generate a full CRUD module including controller, service, repository, Zod schemas, routes, OpenAPI docs, and tests for a resource defined by name and fields.
    MIT
  • Obtain a company's full profile with headcount, industry, revenue, tech stack, funding, social links, and phone. Provide a company website, LinkedIn URL, name, or Prospeo ID to enrich.
    MIT
  • Create MDK projects or add entity metadata using CRUD, List Detail, or Base templates. Initialize new projects or enhance existing ones with structured metadata.
    Apache 2.0
  • Calculate the average (mean) of a list of numbers. Input an array of numbers to get their arithmetic mean.
    MIT
  • Retrieve detailed configuration and component information for a specific ZenML stack using its name, ID, or prefix.
    MIT
  • Retrieve failed execution details: returns the failing node, error message, short stack trace, and per-node errors. Use to debug without flooding context with full execution data.
    MIT
  • Retrieves stack outputs and cross-stack exports from local Terraform and CloudFormation files to resolve cross-stack references.
    MIT