Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx skills add armanzeroeight/fastagent-plugins --skill complexity-analyzergit clone --depth 1 https://github.com/armanzeroeight/fastagent-pluginsWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/skills/armanzeroeight/fastagent-plugins/complexity-analyzer)<a href="https://agentmods.dev/skills/armanzeroeight/fastagent-plugins/complexity-analyzer"><img src="https://agentmods.dev/badge/skills/armanzeroeight/fastagent-plugins/complexity-analyzer/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/skills/armanzeroeight/fastagent-plugins/complexity-analyzer"><img src="https://agentmods.dev/badge/skills/armanzeroeight/fastagent-plugins/complexity-analyzer.svg" alt="Reviewed on agentmods" width="80" height="20"></a>What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.00031 | $0.00992 |
| Opus 5.5 | $0.00012 | $0.00397 |
| Sonnet 5.5 | $0.00006 | $0.00198 |
| Haiku 4.5 | $0.00003 | $0.00099 |
Grade A, and why
complexity-analyzer scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 2mo ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 173 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Complexity Analyzer
Quick Start
Analyze complexity with tools:
# JavaScript
npx eslint --plugin complexity --rule 'complexity: [error, 10]' src/
# Python
pip install radon
radon cc src/ -a -nb
# General
npx complexity-report src/
Instructions
Step 1: Calculate Cyclomatic Complexity
Count decision points + 1:
- if, else, elif
- for, while loops
- case statements
- && and || operators
- ternary operators
- catch blocks
Example:
function example(x) { // +1 (base)
if (x > 0) { // +1
return x;
} else if (x < 0) { // +1
return -x;
}
return 0;
}
// Complexity: 3
Step 2: Identify Complex Functions
| Complexity | Rating | Action |
|---|---|---|
| 1-10 | Simple | No action needed |
| 11-20 | Moderate | Consider refactoring |
| 21-50 | Complex | Should refactor |
| 50+ | Very Complex | Must refactor |
Step 3: Analyze Cognitive Complexity
Cognitive complexity considers:
- Nesting depth (each level adds to complexity)
- Breaks in linear flow (if, loops, catch)
- Recursion
// Cyclomatic: 4, Cognitive: 7
function sumOfPrimes(max) { // +0
let total = 0;
for (let i = 2; i <= max; i++) { // +1 (loop)
let isPrime = true;
for (let j = 2; j < i; j++) { // +2 (nested loop)
if (i % j === 0) { // +3 (nested if)
isPrime = false;
break; // +1 (break)
}
}
if (isPrime) { // +1 (if)
total += i;
}
}
return total;
}
Step 4: Generate Report
## Complexity Report
### High Complexity (>20)
**processOrder()** - src/orders.js:45
- Cyclomatic: 28
- Cognitive: 35
- Lines: 127
- Recommendation: Extract validation, calculation, and persistence logic
**validateUser()** - src/auth.js:12
- Cyclomatic: 22
- Cognitive: 28
- Lines: 89
- Recommendation: Extract individual validation rules
### Moderate Complexity (11-20)
[List functions with complexity 11-20]
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 2mo ago First seen · 173 lines · 31 tokens per session scan A 0631963b624d
complexity-analyzer is a skill published in the GitHub repository armanzeroeight/fastagent-plugins (29 stars, last pushed 3mo ago), licensed MIT. It adds 31 tokens to every session and 992 once invoked, about $0.0001 per session on Opus 5.5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-30.
complexity-analyzer compared with skills from other repositories
| Mod | Type | Stars | Last push | Licence | Scan | Tokens | Works with |
|---|---|---|---|---|---|---|---|
| complexity-analyzerarmanzeroeight/fastagent-plugins | Skill | 29 | 3mo ago | MIT | A | 31 | Claude Code |
| adk-debuggoogle/adk-python | Skill | 22k | today | Apache-2.0 | A | 191 | Claude Code, Codex |
| rubber-duckkirodotdev/KiroCrew | Skill | 4.9k | today | Apache-2.0 | A | 161 | Claude Code, Codex |
| ha-logsshiwenwen/hope-agent | Skill | 1.9k | today | MIT | A | 183 | Claude Code, Codex |
| debug-gatewaykirodotdev/KiroCrew | Skill | 4.9k | today | Apache-2.0 | A | 63 | Claude Code, Codex |
| ha-self-diagnosisshiwenwen/hope-agent | Skill | 1.9k | today | MIT | A | 114 | Claude Code |
| ai-discoverkirodotdev/KiroCrew | Skill | 4.9k | today | Apache-2.0 | A | 83 | Claude Code, Codex |