complexity-grill
/complexity-grill
Use when a user wants to identify the true sources of complexity qualitatively before counting metrics. Not for source or remote mutation.
- Author
- OutlineDriven ↗
- Repository
- outline-driven-development ↗
- Licence
- Apache-2.0
- Last repository change
- 28.09.2026
Assessment and security
- Files in this package
- 2
- Scripts
- 0
- HTML comments
- 0
- URLs in SKILL.md
- 0
No signals detected. Repository changed on 28.09.2026, without references to retired models or APIs.
Apache-2.0, otwarta: można używać i zmieniać, z zachowaniem licencji i informacji o zmianach.
What it does and when to use it
Use when a user wants to identify the true sources of complexity qualitatively before counting metrics. Not for source or remote mutation.
Original author description
Use when a user wants to identify the true sources of complexity qualitatively before counting metrics. Not for source or remote mutation.
How it works
- Contract
- Inputs
- Procedure
- Failure and recovery
- Output
SKILL.md preview
--- name: complexity-grill description: 'Use when a user wants to identify the true sources of complexity qualitatively before counting metrics. Not for source or remote mutation.' disable-model-invocation: true --- # Complexity grill ## Contract | Field | Bound contract | |---|---| | Trigger | User wants to identify the true sources of complexity qualitatively before counting metrics. | | Authority | Read-only. No file, VCS, credential, paid, published, deployed, or remote mutation. | | Side effect | Chat output only: a qualitative complexity-source report with ranked root causes. | | Done | True complexity sources are identified qualitatively and ranked before any metric is counted. | ## Inputs The code region, module, or design surface to analyze must be supplied. Optional: a named concern to weight (coupling, hidden state, leaky abstraction, special-case proliferation, accidental concurrency, premature generality, indirection exceeding what it hides). No metric input is accepted before the qualitative ranking is settled. ## Procedure 1. Bound scope to the named region and read it. Do not mutate anything. Done when: the region is read and scope is bounded. 2. Enumerate candidate complexity sources qualitatively. For each, state where it lives and what effort it forces: coupling that blocks independent change, hidden state that must be tracked by hand, leaky abstractions, special-case proliferation, accidental concurrency, premature generality, or indirection that exceeds the complexity it hides. Done when: every candidate source is named with its location and forced effort. 3. Rank candidates by the real cognitive or maintenance effort they force, not by any numeric metric. Break ties by root cause: a source that produces other sources ranks above a symptom it creates. Done when: candidates are ranked by effort with root-cause tie-breaking. 4. Only after the qualitative ranking is settled, optionally attach a metric to confirm a ranked source. Metrics confirm; they never discover, reorder, or lead the ranking. If no metric is available, the ranking stands on its qualitative evidence. Done when: a metric is attached as confirmation or the ranking stands on qualitative evidence alone. 5. Return the ranked report. Done when: the ranked report is returned. ## Failure and recovery - Metrics-first: if a numeric metric is introduced before the ranking is settled, discard it, return to step 2, and re-rank qualitatively. - Symptom-as-root: if a ranked source is itself produced by a deeper source, demote it, promote the deeper source, and re-rank. - Unbounded scope: if the region cannot be read in one pass, narrow to a named sub-region and state the narrowing. Never widen scope to force a result. - Boundary breach: if any edit or mutation is attempted, stop and report the read-only breach. No partial mutation is retained. ## Output Ranked complexity-source report: ordered root causes, each naming its location, the effort it forces, and whether a deeper source produces it. Any metric appears only as a confirmation footnote after the ranking.
Files in this package (2)
- SKILL.md 3 KB
- agents/openai.yaml 1 KB
Versions
| Repository | Score | Licence |
|---|---|---|
| This page · OutlineDriven/outline-driven-development | 90 | Apache-2.0 |
| gosuda/dalcom-skills | 90 | Apache-2.0 |
Database snapshot: 13.11.2026 · package version e25ea5ddb6f1 (SHA-256 digest of the entire package)
Downloads in the last 30 days: 0 · ranking
Report a problem with this skill: harmful content, incorrect descriptions or an author’s removal request.
Similar skills
- 96complexity-management
Use when the complexity gate fails or a function approaches a limit. - 100code-complexity
Analyze code complexity metrics (cyclomatic, cognitive, function length, coupling). Use when identifying refactoring targets, tracking codebase health, or reviewing large changes. - 100find-complexity
Find functions and methods with high cyclomatic complexity, excessive length, or too many parameters. Use when the user asks to find complex code, complexity hotspots, refactoring candidates, or wants to improve code maintainability. - 95quality-common
Universal code quality principles applicable to all languages. Covers Clean Code, SOLID, complexity metrics, and quality standards. USE WHEN: user mentions "clean code", "SOLID", "code smells", "refactoring", "complexity", asks about "cyclomatic complexity", "cognitive… - 100complexity
Use free built-in .NET maintainability analyzers and code metrics configuration to find overly complex methods and coupled code. USE FOR: the team wants to find overly complex methods; cyclomatic complexity thresholds are needed in CI; maintainability metrics or coupling… - 100code-complexity-scanner
Measures cyclomatic complexity, cognitive complexity, and function length across codebases to identify maintenance hotspots. Use when someone asks about code complexity, function length analysis, maintainability metrics, or needs to find the most complex parts of their codebase.…