Plugins

1 plugin

Builds multi-language source code graphs for security analysis: call graphs, attack surface mapping, blast radius, taint propagation, complexity hotspots, and entry point enumeration. Generates Mermaid diagrams (call graphs, class hierarchies, dependency maps, heatmaps). Compares code graph snapshots for structural diff and evolution analysis. Runs graph-informed mutation testing triage (genotoxic

10 skills · plugin

Results for “code-complexity”

11 skills

Algorithms And Data Structures

Enforces complexity analysis, correct data structure selection, vectorization, and algorithm implementation discipline at principal-engineer level.

Automates code review for pull requests across 14+ languages, analyzing complexity, risk, code quality, and generating structured review reports.

20.4k · bundle

Measures code quality, identifies code smells, and implements quality gates using static analysis and technical debt tracking.

More results

Applies four disciplined mindsets—audit, debt, help, review—to cut complexity, track deferrals, surface reference, and catch over-engineering in codebases.

Codebase Onboarding

Analyze an unfamiliar codebase and generate a structured onboarding guide with architecture map, key entry points, conventions, and a starter CLAUDE.md.

Enforces dense, correct, and idiomatic code on all coding tasks, minimizing code bloat and agent operation overhead.

Provides a structured code review checklist covering security, performance, correctness, maintainability, testing, accessibility, and documentation, with a three-pass review process and guidance on severity levels and anti-patterns.

Scans recently changed code for tech debt: duplicated logic, dead code, magic numbers, deep nesting, and TODOs, then proposes fixes.

Trailmark Structural

Runs full Trailmark structural analysis by building a graph and computing pre-analysis passes for hotspots, taint, blast radius, privilege boundaries, and attack surface.

Enforces an algorithm-first discipline: state Big-O, data structure, and algorithm family before writing loops, queries, or recursion to catch O(n²), N+1, and brute-force defaults.

Enforces an algorithm-first discipline: state Big-O, data structure, and algorithm family before writing loops, queries, or recursion, catching O(n^2), N+1, and brute-force defaults.