ingenious: Command for Claude Code

.claude/commands/quality/js-quality/complexity.md

complexity is a command for Claude Code from Insight-Services-APAC/ingenious. It costs 0 tokens per session (475 once invoked), scanned A, original, MIT.

A procedure for using ESLint rules to find functions with too many branches or too much nesting, then refactor them safely.

In plain words
What is it for?
Use it to locate high-complexity JavaScript, TypeScript, or Vue functions and split them into simpler units.
Why use it?
It identifies code that is difficult to understand or maintain and pairs changes with tests and lint checks.

Command for Claude Code

Written for Claude Code: installed under .claude/.

This is Insight-Services-APAC/ingenious's own configuration. It tells Claude Code how to work on ingenious itself, so it is not a mod to install elsewhere. Copy it as a starting point and replace the rules that are about this project. Everything ingenious configures →

Reuse

Borrowing it

Nothing to install: this file belongs to Insight-Services-APAC/ingenious. Take a copy, put it at the same path in your own repository, and replace the rules that are about this project with yours.

Copy the file
curl -O https://raw.githubusercontent.com/Insight-Services-APAC/ingenious/main/.claude/commands/quality/js-quality/complexity.md
Clone the repo
git clone --depth 1 https://github.com/Insight-Services-APAC/ingenious

Made for: Claude Code.

Wrote 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.

agentmods badge for complexity

README.md
[![agentmods](https://agentmods.dev/badge/commands/insight-services-apac/ingenious/complexity.svg)](https://agentmods.dev/commands/insight-services-apac/ingenious/complexity)
Your own site
<a href="https://agentmods.dev/commands/insight-services-apac/ingenious/complexity"><img src="https://agentmods.dev/badge/commands/insight-services-apac/ingenious/complexity.svg" alt="Measured on agentmods" height="20"></a>
Per session 0 Only the description is in the session, so the agent can decide to use it. The body loads when it is invoked.
When invoked 475 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. Scan, not verified.
Origin original No closer match found in the catalogue.
Token cost

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.

ModelPer sessionOnce invoked
Fable 5.1 $0.00000 $0.00475
Opus 5 $0.00000 $0.00237
Sonnet 5 $0.00000 $0.00095
Haiku 4.5 $0.00000 $0.00047

Measured yesterday against content hash fa31816c9a4a, method: parsed. Prices are Anthropic first-party input rates as of 2026-09-06, from the pricing page.

Security

Grade A, and why

complexity 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 yesterday.

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.

.claude/commands/quality/js-quality/complexity.md · 83 lines

What it actually says

Refactor Using Complexity Analysis (ESLint Complexity Rules)

Use ESLint complexity rules to identify high-complexity functions and refactor them safely.

1. Run Complexity Analysis

# Check cyclomatic complexity with ESLint
npx eslint . --ext .js,.ts,.vue --rule 'complexity: ["warn", 10]'

2. Identify Hotspots

Target functions with:

  • Cyclomatic complexity > 10
  • Many branches (if/else, switch)
  • Deep nesting levels
  • High cognitive complexity

3. Configure ESLint Rules

Add to .eslintrc.js:

{
  rules: {
    'complexity': ['warn', { max: 10 }],
    'max-depth': ['warn', 4],
    'max-nested-callbacks': ['warn', 3],
    'max-lines-per-function': ['warn', { max: 50 }]
  }
}

4. Refactor Tactics (Apply One At A Time)

  • Extract function for cohesive logic blocks
  • Replace conditionals with early returns (guard clauses)
  • Use object lookup maps instead of switch statements
  • Replace nested callbacks with async/await
  • Decompose large functions by responsibility
  • Extract complex conditions into named functions
  • Use strategy pattern for variant behavior
  • Split components with multiple concerns

After each change:

npm test
npx eslint <target_file> --rule 'complexity: ["error", 10]'

Commit if passing:

git add <files>
git commit -m "refactor(complexity): reduce complexity in <function>"

5. Validate No Regression

When a file is improved:

npx eslint . --ext .js,.ts,.vue
npm test
npm run build:check

6. Avoid Over-Refactoring

Stop when:

  • Complexity <= 10
  • Max nesting <= 3
  • Function length reasonable
  • Further splitting reduces readability

7. Final Quality Gate

npx eslint . --ext .js,.ts,.vue
npm run build:check
npm test

Goal: No functions with cyclomatic complexity above 10.

Changes

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.

  1. yesterday First seen · 83 lines · 0 tokens per session scan A fa31816c9a4a

Subscribe to this mod's changes

complexity is a command published in the GitHub repository Insight-Services-APAC/ingenious (24 stars, last pushed 7mo ago), licensed MIT. It costs nothing until one of its globs matches a file; then it loads 475 tokens. 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-09-04.