GitHub - dmmulroy/anti-slop: Opinionated Oxlint rules for rejecting low-evidence TypeScript and JavaScript patterns
Opinionated Oxlint rules for rejecting low-evidence TypeScript and JavaScript patterns - dmmulroy/anti-slop
Software Documentation
Summary
This documentation explains the 'complexity' rule within the Oxlint linter, which manages cyclomatic complexity to improve code readability. It details how to configure complexity limits and provides examples of both compliant and non-compliant code.
Highlights
- Enforces a maximum cyclomatic complexity to prevent code from becoming too difficult to follow.
- Offers two calculation variants: 'classic' (McCabe) and 'modified' (where switch statements count as a single unit of complexity).
- Provides flexible configuration options including a 'max' threshold and complexity variants.
- Supports implementation through JSON configuration, TypeScript configuration, or direct CLI usage.
auto-generated
Context
Audience
Software Developers and JavaScript Engineers
DomainJavaScript Tooling
FormatTechnical Documentation
AccessOpen source
Source Overview
Enforces a maximum cyclomatic complexity threshold (default 20) to limit linearly independent paths per code block.
Supports "classic" and "modified" variants; the modified variant counts a switch statement as complexity 1 regardless of case count. Configurable via .oxlintrc.json, oxlint.config.ts, or CLI; added in Oxlint v1.37.0.
Topics
Related
JavaScriptESLintRustStatic AnalysisCyclomatic Complexity
