Add a rule for NPath Complexity
Open
Nobody has claimed this yet.
rule-request
- Dominant language
- Swift
- Stars
- 19.7k
- Forks
- 2.3k
- Avg merge
- 1d 1h
- Merged PRs (30d)
- 11
Description
Currently Swiftlint has a rule for Cyclomatic complexity, but no rule for NPath Complexity. A rule should be added for NPath Complexity configurable in the same sorts of ways that Cyclomatic Complexity is configured.
For reference: https://modess.io/npath-complexity-cyclomatic-complexity-explained/
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Use SwiftLint’s existing Cyclomatic Complexity rule as the starting point, since the issue asks for matching configuration behavior. Read that rule and its surrounding tests, then define the NPath Complexity rule and verify that its configuration works in the same ways.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- swift
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 45/100