Skip to main content
Glama
306,652 tools. Last updated 2026-07-25 18:37

"Building a Sequencer with Arduino in C++ and Enhancing Performance" matching MCP tools:

  • Start here when building an application. Returns an overview of what the AdCritter platform offers and a catalog of feature guides you can query with the adcritter_guidance tool to learn how to build each part of the app. Call adcritter_guidance(key) for any feature area to get detailed building instructions with API endpoints and response shapes.
    Connector
  • Solve for any side of a right triangle using the Pythagorean theorem (a² + b² = c²). Provide any two of the three sides (a, b, c) and the missing side is computed. Also returns the triangle area (0.5 * a * b), perimeter, and confirms it is a right triangle. Side c is always the hypotenuse. Fundamental to surveying, construction (squaring corners), navigation (distance calculations), physics (vector decomposition), and 3D graphics. Chain with slope_calc for coordinate geometry or square_root for simplified radical answers.
    Connector
  • Given a list of themes, report which are well-evidenced in the archive and which are under-evidenced or missing. Returns a coverage matrix: for each theme, entries found, coverage grade (strong/moderate/weak/missing), best match with claim strength, and what source type would be needed to improve coverage. Use this BEFORE building an archive_report_brief or brief_forensic to know where the evidence is strong and where gaps will appear. Prevents building beautiful reports that quietly ignore half the brief.
    Connector
  • Given a list of themes, report which are well-evidenced in the archive and which are under-evidenced or missing. Returns a coverage matrix: for each theme, entries found, coverage grade (strong/moderate/weak/missing), best match with claim strength, and what source type would be needed to improve coverage. Use this BEFORE building an archive_report_brief or brief_forensic to know where the evidence is strong and where gaps will appear. Prevents building beautiful reports that quietly ignore half the brief.
    Connector
  • Get the building-by-building breakdown for one transaction: footprint area, number of storeys, and estimated total floor area (footprint × storeys) for each building on the property. search_transactions / search_by_area / search_by_polygon return per-transaction building SUMS inline; this tool splits them into individual buildings. Use it after a search when a result has building data and you need the detail (e.g. a developed-land deed covering several buildings). The transaction_id is the id shown on a search result that has building data. Cost: 4 tokens. Returns nothing for a transaction with no buildings.
    Connector
  • List all unique crystal colors available in the database. Use these values with the color filter on GET /crystals to find crystals by color. Essential reference endpoint for building color-based crystal browsing, visual crystal pickers, and filtering UI.
    Connector

Matching MCP Servers

  • F
    license
    -
    quality
    B
    maintenance
    Enables any MCP-compatible AI assistant to search, filter, and retrieve information from a local document collection using a hybrid search pipeline with vector, BM25, reranking, and LLM enrichment.
    Last updated
    4

Matching MCP Connectors

  • performance-review MCP — wraps StupidAPIs (requires X-API-Key)

  • ifsc-in MCP — Indian bank branch IFSC code lookup via Razorpay's open

  • Align raw Sanger or NGS reads (FASTA or FASTQ) back onto a claimed reference sequence using minimap2, and report per-read mapping identity plus exact variant positions (substitutions/insertions/deletions), with a consensus view across reads and a corrected consensus sequence (the reference with every consensus-supported edit applied). Complements verify_construct/verify_assembly: those re-derive what a design SHOULD produce from its own stated inputs; this checks what a real sequencer actually read back.
    Connector
  • Find proven viral templates in a niche with example videos. Returns templates ranked by performance, including hook patterns, format structures, average views, and example URLs. Use when the user asks what's working in a niche or wants concrete copyable structures. Supports 17 niches with optional angle narrowing via query parameter for more specific results (e.g., "postpartum strength" within Fitness).
    Connector
  • Deep parcel and building analysis for Slovenia using GURS WFS data. Returns zoning, actual use, heritage protection, road access, buildings on parcel, and utilities. USE FOR: - "Analyze parcel 3086 in Ljubljana center" - "Find buildable parcels ~500m² in Ljubljana" - "What buildings are on this parcel?" - "Find parcels near these coordinates" - "Get full details on building 1234" NOT FOR: simple parcel lookup → use slovenia-cadastre instead (faster, lighter). NOT FOR: spatial/zoning map queries → use slovenia-wfs-expert instead. SEARCH MODES — pick ONE per call: 1. PARCEL BY NUMBER (requires --parcel AND --ko) → --parcel 3086 --ko 1725 2. LOCATION SEARCH (requires --lat AND --lon, or --location) → --lat 46.058 --lon 14.501 --radius 100 → --location "Tivoli Park Ljubljana" --radius 200 3. BUILDING BY NUMBER (requires --building, optionally --ko) → --building 1234 --ko 1728 4. COMMUNITY SEARCH (requires at least --community or --size) → --community LJUBLJANA --size 500 --buildable COMMON KO IDs: 1725 = Ljubljana center 1728 = Ljubljana Šiška 1740 = Ljubljana Bežigrad 2131 = Maribor NOTE: This tool makes multiple WFS calls per result and can be slow (10-30s). Use --limit to keep response times reasonable.
    Connector
  • Discover and filter a daily list of attractive tokens using Nansen Score Indicators weighted by coefficients (= Performance Score). Use this tool when you don't know which tokens to buy and need recommendations based on backtested indicators. For specific token analysis (e.g., "should I buy AAVE?"), use token_quant_scores instead. **When to use this tool vs token_discovery_screener**: - Use **this tool** when you want **pre-scored buying recommendations** without specifying criteria. It answers "what should I buy?" by returning tokens that already meet a quantitative buying threshold (Performance Score ≥15) based on alpha indicators like price momentum, chain fees, and protocol fees. Data is updated in batches. - Use **token_discovery_screener** when you want **live data** or to **explore tokens by specific criteria** like sectors (e.g., "AI memecoins"), token age (e.g., "new launches"), smart money activity, or custom volume/liquidity thresholds. It's a filtering tool with real-time metrics where you define what you're looking for. Returns tokens pre-filtered by: performance_score >= 15 (buying threshold). **Example queries**: "what tokens should I buy?", "which tokens look good?", "best tokens to buy today" **Scoring:** - **Performance Score** (range -60 to +75): Higher = better alpha opportunity. **Buy threshold: ≥15** - **Risk Score** (range -60 to +80): Higher = safer token. >0 indicates low to medium risk. Every time you give the Performance Score to the user, explain the scoring thresholds above. Same for the Risk Score. Every time quote the underlying indicators that contributed the most to the Performance/ Risk score and recall their definition to the user. Returns: A list of tokens with the highest Performance Score as markdown. Core fields: Token Address, Token Symbol, Chain, Performance Score, Risk Score. Indicator columns are included dynamically based on data availability (columns with all zeros are excluded).
    Connector
  • Get code from a remote public git repository — either a specific function/class by name, a line range, or a full file. PREFERRED WORKFLOW: When search results or findings have already identified a specific function, method, or class, use symbol_name to extract just that declaration. This avoids fetching entire files and keeps context focused. Only fetch full files when you need a broad understanding of a file you haven't seen before. For supported languages (Go, Python, TypeScript, JavaScript, Java, C, C++, C#, Kotlin, Swift, Rust) the response includes a symbols list of declarations with line ranges. This is not a first-call tool — use code_analyze or code_search first to identify targets, then extract precisely what you need.
    Connector
  • Fast pre-flight filter for a batch of (ecosystem, package) pairs. DB-only, <100ms for 100 items. USE WHEN: about to emit `npm install a b c …` or `pip install a b c …` — catches hallucinated names, stdlib, typos, and known-bad in ONE call. NOT a dep-tree audit (use scan_project for that). RETURNS: per-item {status: exists|stdlib|malicious|typosquat_suspect|historical_incident|unknown}.
    Connector
  • [cost: free (pure CPU, no network) | read-only] Static explainer for STIR/SHAKEN: maps attestation levels (A / B / C per RFC 8588) to plain-English requirements + common scenarios, and SIP codes commonly emitted by signing/verification (428 / 436 / 437 / 438 / 608) to their RFC anchors and operator causes. Provide either `attestation` (A/B/C) or `code` (e.g. 438). Pair with: `validate_stir_shaken_identity` when the user has the JWS segments and wants the cryptographic verdict; `search_sip_docs({ sourceType: 'stir-shaken', ... })` for ATIS / CTIA / RFC depth.
    Connector
  • Search the Hong Kong C&SD table catalogue by keyword (e.g. 'exchange rates', 'unemployment', 'merchandise trade') and get back matching table ids + titles to use with censtatd_get_table. Backed by the data.gov.hk open-data index of C&SD tablechart datasets. Note: not every C&SD table is indexed there; ids can also be read off the table URL on data.censtatd.gov.hk (the '310-31001' part of web_table.html?id=310-31001).
    Connector
  • Plain-English guide to the 8 stages of a VA disability claim, from Intent to File through the C&P exam, the rating decision, the three AMA review lanes, the Board of Veterans’ Appeals, and the 120-day CAVC court deadline. Call with no arguments for an overview of all stages with typical durations; call with a stage number (1-8) for a deep dive on that stage: what to expect, how long it takes, the key tip, and do/don’t guidance. Use this whenever a veteran asks what happens after filing, where they are in the process, what a C&P exam is, or what to do at their current stage. Educational only, not legal advice.
    Connector
  • Compute speed of sound in air at a given temperature. Use for physics or audio engineering. Formula: c=331.3+0.606·T_C. Inputs: temperature °C. Returns speed in m/s. See list_bundles for related 'science' calculators.
    Connector
  • Calculates timing parameters for the ubiquitous NE555 / LM555 timer IC in astable (free-running oscillator) and monostable (one-shot pulse) modes. In astable mode, computes frequency, period, duty cycle, and HIGH/LOW durations from R1, R2, and C using f = 1.44 / ((R1 + 2·R2) · C). In monostable mode, computes pulse width from R and C using t = 1.1 · R · C. Standard 555 astable duty cycle is always >50%; for 50% duty cycle use a diode across R2. Useful for generating clock signals, PWM, delays, and debounce circuits. Chain from ohms_law for power calculations or resistor_color_code for component selection.
    Connector
  • Run the same M/M/c configuration through BOTH the closed-form Erlang-C formula AND the discrete-event simulator, returning a side-by-side comparison with deltas. Use this when the user is validating QueueSim's engine against textbook values, learning queueing theory by watching simulation converge on the formula, or auditing a result that 'feels off' — agreement within ~5%% is the canonical sanity check for an M/M/c run. Pure-Exponential M/M/c only; the closed-form Erlang-C is undefined for other service distributions. Large deltas usually mean the simulation run was too short for steady-state — raise simulationDays. ANTI-FABRICATION: both sides come from real computation — closed-form is deterministic, simulation is stochastic but engine-backed. Quote both verbatim. Do not synthesize an 'average of the two' or recompute the formula from training-data recall.
    Connector
  • Decomposes an Argentine amount into neto (base imponible) and IVA using any of the 6 ARCA/WSFE alícuotas. Use before building an AFIP invoice to compute ImpNeto and ImpIVA. Alícuotas disponibles (WSFE AlicuotaId): id=3 → 0% (exento) id=4 → 10.5% id=5 → 21% (alícuota general — use this for most products) id=6 → 27% (servicios públicos) id=8 → 5% id=9 → 2.5% Uses integer-cent arithmetic to guarantee neto + iva === total exactly (AFIP rejects invoices where ImpNeto + ImpIVA ≠ ImpTotal — error 10016). For Monotributistas (Factura C) pass the full amount as neto with alicuotaId=3 — Monotributo does not charge IVA.
    Connector
  • Cost: ~2s. Artist career trajectory analysis: milestones, career stage, pattern detection (A–E), and comparable historical artists who followed the same path. Career stages: PRE_MARKET → REGIONAL → CRITICAL_PHASE → MARKET_ENTRY → ESTABLISHED. Patterns: A=institutional escalation, B=curator championing, C=movement anchor, D=late market discovery, E=diaspora rediscovery. Use for: emerging artist discovery, gallery acquisition decisions, curator narrative building. Do NOT use for purely biographical queries — use get_artist instead.
    Connector