Public report of JetBrains/ideavim, published 24 October 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey → Signed and filed in the standard's public register, 24 October 2026, 20:55 UTC · Survey ID cd_b84fe0de891946a5b05aea59f495a185

JetBrains/ideavim

Measured 24 October 2026, 20:45 UTC, at code version 27befce

No regression since the last survey Code coverage: not measured

A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.

Code coverage is not measured: JavaScript/TypeScript suite (CouldNotMeasureNoCollector).

CAI score 59out of 100 At risk Up 8 since the last survey

The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.

Code Health 79 Strong Architecture 78 Adequate Accessibility 66 Adequate Production Readiness 65 Adequate Maturity 62 Adequate Performance 61 Adequate Security and Compliance 53 Adequate

A large codebase: 119,405 lines of product code in 24 projects, tests not counted · Estimated rebuild effort: about 2.1 person-years · Weakest lens: Security and Compliance, 53

Findings by how serious they are

188 critical 684 serious 69 minor

10 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.

This survey was produced by

Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
24 October 2026, 20:45 UTC

A measurement, not a certificate. The Code Assurance Index records a number together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that implements it, and today Watchdog is the only one that does.

A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.

The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

73of 76 dimensions measured by tools. The other 3 are advisory notes from an AI model, which explain the code but don't count towards the score.
919of 941 findings point to an exact file and line, so you can open each one in the code. The other 22 concern the repository as a whole, such as missing documentation.
76dimensions across 7 lenses, read from 119,405 lines of product code in 24 projects.
Chapters

Executive summary

JetBrains/ideavim scores 59 out of 100, but it is rated At risk while a critical security finding is open; the score itself is unchanged.

The weakest lens counts most in the score, and here that is Security and Compliance, which scores 53 and is rated Adequate. Its Static Analysis (SAST) dimension scores 0 out of 10, and until that reaches 4, Security and Compliance can't be rated higher than Adequate. The first actions are to resolve the 4 REDACTED finding(s) in Supply-chain Provenance & Signing and to resolve the 4 REDACTED finding(s) in Secrets (history), and if Security and Compliance rose to 70, the score would rise from 59 to about 63.

188 findings are critical: 165 in Static Analysis (SAST), seven in Change Coupling, five in Dependency Vulnerabilities, four in Page structure, four in Secrets (history), one in Coupling, one in Dependency direction and one in Project dependency cycles.

Watchdog couldn't measure 9 dimensions in this code, among them Test Reliability, Dependency Hygiene and License Compliance, so they are left out of the score. The product code is 119,405 lines, which would take an estimated 2.1 person-years, around €310,000, to rebuild.

Code Health 79 Strong Architecture 78 Adequate, capped by Coupling Maturity 62 Adequate, capped by Architecture documentation Production Readiness 65 Adequate, capped by Test Coverage Security and Compliance 53 Adequate, capped by Static Analysis (SAST) and Supply-chain Provenance & Signing Accessibility 66 Adequate Performance 61 Adequate

A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.

How the score is built: what each lens counts for The lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Security and Compliance 53 · counts for 46%Performance 61 · counts for 25%Maturity 62 · counts for 14%Production Readiness 65 · counts for 8%Accessibility 66 · counts for 4%Architecture 78 · counts for 2%Code Health 79 · counts for 1%

If Security and Compliance rose from 53 to 70, the lowest score rated Strong, the score would rise from 59 to about 63.

Code composition: what the lines of code are
Product code 41%Tests 59%
New since the last survey: 13 findings

These 13 critical or serious findings weren't in the previous survey, on 10 October 2026.

Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.

Fixed since the last survey: 43 findings

These 43 critical or serious findings were in the previous survey, on 10 October 2026, and are gone from this one.

  • Cognitive Complexity · ScrollViewHelper.scrollCaretIntoViewHorizontally (cognitive 18) src/main/java/com/maddyhome/idea/vim/helper/ScrollViewHelper.kt
  • God Classes · TooManyMethods: EditorHelper src/main/java/com/maddyhome/idea/vim/helper/EditorHelper.java
  • Code Duplication · Duplicated block (7 lines × 2) src/main/java/com/maddyhome/idea/vim/action/change/delete/DeleteJoinVisualLinesAction.kt
  • Code Duplication · Duplicated block (7 lines × 2) src/main/java/com/maddyhome/idea/vim/helper/EditorHelper.java
  • Churn × Complexity Hotspots · Hotspot: vim-engine/src/main/kotlin/com/maddyhome/idea/vim/handler/MotionActionHandler.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/handler/MotionActionHandler.kt
  • Explicit Debt · TodoComment src/main/java/com/maddyhome/idea/vim/helper/ScrollViewHelper.kt
  • Explicit Debt · TodoComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/command/MappingProcessor.kt
  • Explicit Debt · TodoComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/VimVisualGroup.kt
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTests.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTests.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTests.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTests.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTests.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTests.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTests.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTests.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTestsLinux.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTestsLinux.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTestsLinux.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTestsLinux.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTestsLinux.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTestsLinux.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTestsLinux.yml
  • Static Analysis (SAST) · High: REDACTED .github/workflows/runUiRdTestsLinux.yml
  • Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
  • Supply-chain Provenance & Signing REDACTED
  • Supply-chain Provenance & Signing REDACTED
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.40.0.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.41.0.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.42.0.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.43.0.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.44.0.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.44.1.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.45.0.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.45.1.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.45.2.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.46.0.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.46.1.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.46.2.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.47.0.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.47.1.html
  • Visual & motion safety · Animation without a prefers-reduced-motion guard src/main/resources/whatsnew-2.47.2.html
  • Async & latency hygiene · Sync-over-async blocking scripts-ts/src/updateAuthors.ts
Rebuild cost: about €310,000 · Estimate
Cost to rebuild€100,000 to €520,000, for 1,709 to 5,422 hours of work, about 2.1 person-years for 1 to 5 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.8 at a score of 59. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeLarge: 119,405 lines of product code

How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.

1
Resolve the 4 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED.
Raises the score by about 3 points · Low effort · Supply-chain Provenance & Signing
2
Resolve the 4 REDACTED finding(s) in Secrets (history) — start with REDACTED (2), REDACTED, REDACTED.
Raises the score by about 2 points · Low effort · Secrets (history)
3
Resolve the 50 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (21), REDACTED (3), REDACTED (2).
Raises the score by about 4 points · Medium effort · Static Analysis (SAST)

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €310,000 to build again, about 2.1 person-years of work. Its weakest lens is Security and Compliance, at 53 (Adequate). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
Resolve the 4 REDACTED finding(s) in Supply-chain Provenance & Signing. Of all the actions in this report, it raises the score most for the work it takes: about 3 points for low effort, because it clears the 4 Supply-chain Provenance & Signing findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort

Architecture — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.

arch :annotation-processors :annotation-processors :api :api :annotation-processors->:api :ideavim-acejump :ideavim-acejump :ideavim-common :ideavim-common :ideavim-acejump->:ideavim-common IdeaVIM IdeaVIM :ideavim-backend :ideavim-backend :ideavim-backend->:api :ideavim-backend->:ideavim-common :vim-engine :vim-engine :ideavim-backend->:vim-engine :ideavim-backend->IdeaVIM :ideavim-backend-bookmarks :ideavim-backend-bookmarks :ideavim-backend-bookmarks->:api :ideavim-backend-bookmarks->:ideavim-common :ideavim-backend-bookmarks->:vim-engine :ideavim-backend-bookmarks-core :ideavim-backend-bookmarks-core :ideavim-backend-bookmarks-core->:api :ideavim-backend-bookmarks-core->:ideavim-common :ideavim-backend-bookmarks-core->:vim-engine :ideavim-clion-nova :ideavim-clion-nova :ideavim-clion-nova->:ideavim-common :ideavim-common->:annotation-processors :ideavim-common->:api :ideavim-common->:vim-engine :ideavim-frontend :ideavim-frontend :ideavim-frontend->:api :ideavim-frontend->:ideavim-common :ideavim-frontend->:vim-engine :ideavim-rider :ideavim-rider :ideavim-rider->:ideavim-common :ideavim-rpc :ideavim-rpc :ideavim-rpc->:ideavim-common :ideavim-terminal :ideavim-terminal :ideavim-terminal->:ideavim-common :scripts :scripts :tests:java-tests :tests:java-tests :tests:large-file-tests :tests:large-file-tests :tests:long-running-tests :tests:long-running-tests :tests:property-tests :tests:property-tests :tests:split-mode-tests :tests:split-mode-tests :vim-engine->:annotation-processors :vim-engine->:api IdeaVIM->:annotation-processors IdeaVIM->:api IdeaVIM->:ideavim-acejump IdeaVIM->:ideavim-backend-bookmarks IdeaVIM->:ideavim-backend-bookmarks-core IdeaVIM->:ideavim-clion-nova IdeaVIM->:ideavim-common IdeaVIM->:ideavim-frontend IdeaVIM->:ideavim-rider IdeaVIM->:ideavim-rpc IdeaVIM->:ideavim-terminal IdeaVIM->:vim-engine __more__ +4 more projects

Architecture: which parts of the code depend on which

The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.

617 modules, with 1284 dependencies between them. 9 loops run through 87 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 577 more are left out to keep it readable.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 intellij.vim.api.models2 maddyhome.idea.vim.command.Command3 maddyhome.idea.vim.diagnostic4 maddyhome.idea.vim.state.mode5 intellij.vim.api6 maddyhome.idea.vim.ex.ranges7 maddyhome.idea.vim.group.visual8 maddyhome.idea.vim.handler.MotionActionHandler9 maddyhome.idea.vim.handler.VimActionHandler10 maddyhome.idea.vim.regexp11 maddyhome.idea.vim.state12 maddyhome.idea.vim.handler13 maddyhome.idea.vim.vimscript.model.expressions14 maddyhome.idea.vim.command.Argument15 maddyhome.idea.vim.vimscript.model.statements16 maddyhome.idea.vim.vimscript.model17 maddyhome.idea.vim.vimscript.model.functions.FunctionHandlerBase18 maddyhome.idea.vim.vimscript.model.functions19 maddyhome.idea.vim.vimscript.model.datatypes20 maddyhome.idea.vim.options21 maddyhome.idea.vim.helper22 maddyhome.idea.vim.extension23 maddyhome.idea.vim.key24 maddyhome.idea.vim.command25 maddyhome.idea.vim.common26 maddyhome.idea.vim.vimscript.model.commands.Command27 maddyhome.idea.vim.api.VimSearchGroupBase28 maddyhome.idea.vim.thinapi29 maddyhome.idea.vim.vimscript.model.commands30 maddyhome.idea.vim.newapi31 maddyhome.idea.vim.group32 maddyhome.idea.vim.api33 maddyhome.idea.vim.extension.abolish34 maddyhome.idea.vim.extension.textobjuser35 maddyhome.idea.vim.handler.VisualOperatorActionHandler36 maddyhome.idea.vim.vimscript.model.commands.mapping37 maddyhome.idea.vim.action.change38 maddyhome.idea.vim.action.change.change39 maddyhome.idea.vim.action40 maddyhome.idea.vim
1 intellij.vim.api.models
2 maddyhome.idea.vim.command.Command
3 maddyhome.idea.vim.diagnostic
4 maddyhome.idea.vim.state.mode
5 intellij.vim.api1
6 maddyhome.idea.vim.ex.ranges215
7 maddyhome.idea.vim.group.visual101513
8 maddyhome.idea.vim.handler.MotionActionHandler1579
9 maddyhome.idea.vim.handler.VimActionHandler368
10 maddyhome.idea.vim.regexp1
11 maddyhome.idea.vim.state341
12 maddyhome.idea.vim.handler41131126235
13 maddyhome.idea.vim.vimscript.model.expressions22225142
14 maddyhome.idea.vim.command.Argument144
15 maddyhome.idea.vim.vimscript.model.statements73211022
16 maddyhome.idea.vim.vimscript.model1124
17 maddyhome.idea.vim.vimscript.model.functions.FunctionHandlerBase132
18 maddyhome.idea.vim.vimscript.model.functions155163310
19 maddyhome.idea.vim.vimscript.model.datatypes11112
20 maddyhome.idea.vim.options121
21 maddyhome.idea.vim.helper151111111027
22 maddyhome.idea.vim.extension122111143111
23 maddyhome.idea.vim.key15228217
24 maddyhome.idea.vim.command1122225121
25 maddyhome.idea.vim.common151113
26 maddyhome.idea.vim.vimscript.model.commands.Command22245
27 maddyhome.idea.vim.api.VimSearchGroupBase3114
28 maddyhome.idea.vim.thinapi162291171031123
29 maddyhome.idea.vim.vimscript.model.commands198919237912185203
30 maddyhome.idea.vim.newapi341215124129
31 maddyhome.idea.vim.group1114323531091
32 maddyhome.idea.vim.api4165452563210310443416213752722
33 maddyhome.idea.vim.extension.abolish13413318
34 maddyhome.idea.vim.extension.textobjuser31214224335212
35 maddyhome.idea.vim.handler.VisualOperatorActionHandler13258
36 maddyhome.idea.vim.vimscript.model.commands.mapping18181316819
37 maddyhome.idea.vim.action.change71216212192181
38 maddyhome.idea.vim.action.change.change2851122107618811
39 maddyhome.idea.vim.action6161212131
40 maddyhome.idea.vim112131531
Uses a module listed above itPart of a loopThe module itself
1 intellij.vim.api.models2 maddyhome.idea.vim.command.Command3 maddyhome.idea.vim.diagnostic4 maddyhome.idea.vim.state.mode5 intellij.vim.api6 maddyhome.idea.vim.ex.ranges7 maddyhome.idea.vim.group.visual8 maddyhome.idea.vim.handler.MotionActionHandler9 maddyhome.idea.vim.handler.VimActionHandler10 maddyhome.idea.vim.regexp11 maddyhome.idea.vim.state12 maddyhome.idea.vim.handler13 maddyhome.idea.vim.vimscript.model.expressions14 maddyhome.idea.vim.command.Argument15 maddyhome.idea.vim.vimscript.model.statements16 maddyhome.idea.vim.vimscript.model17 maddyhome.idea.vim.vimscript.model.functions.FunctionHandlerBase18 maddyhome.idea.vim.vimscript.model.functions19 maddyhome.idea.vim.vimscript.model.datatypes20 maddyhome.idea.vim.options21 maddyhome.idea.vim.helper22 maddyhome.idea.vim.extension23 maddyhome.idea.vim.key24 maddyhome.idea.vim.command25 maddyhome.idea.vim.common26 maddyhome.idea.vim.vimscript.model.commands.Command27 maddyhome.idea.vim.api.VimSearchGroupBase28 maddyhome.idea.vim.thinapi29 maddyhome.idea.vim.vimscript.model.commands30 maddyhome.idea.vim.newapi31 maddyhome.idea.vim.group32 maddyhome.idea.vim.api33 maddyhome.idea.vim.extension.abolish34 maddyhome.idea.vim.extension.textobjuser35 maddyhome.idea.vim.handler.VisualOperatorActionHandler36 maddyhome.idea.vim.vimscript.model.commands.mapping37 maddyhome.idea.vim.action.change38 maddyhome.idea.vim.action.change.change39 maddyhome.idea.vim.action40 maddyhome.idea.vimintellij.vim.api.models1maddyhome.idea.vim.command.Command2maddyhome.idea.vim.diagnostic3maddyhome.idea.vim.state.mode4intellij.vim.api5maddyhome.idea.vim.ex.ranges6maddyhome.idea.vim.group.visual7maddyhome.idea.vim.handler.MotionActionHandler8maddyhome.idea.vim.handler.VimActionHandler9maddyhome.idea.vim.regexp10maddyhome.idea.vim.state11maddyhome.idea.vim.handler12maddyhome.idea.vim.vimscript.model.expressions13maddyhome.idea.vim.command.Argument14maddyhome.idea.vim.vimscript.model.statements15maddyhome.idea.vim.vimscript.model16maddyhome.idea.vim.vimscript.model.functions.FunctionHandlerBase17maddyhome.idea.vim.vimscript.model.functions18maddyhome.idea.vim.vimscript.model.datatypes19maddyhome.idea.vim.options20maddyhome.idea.vim.helper21maddyhome.idea.vim.extension22maddyhome.idea.vim.key23maddyhome.idea.vim.command24maddyhome.idea.vim.common25maddyhome.idea.vim.vimscript.model.commands.Command26maddyhome.idea.vim.api.VimSearchGroupBase27maddyhome.idea.vim.thinapi28maddyhome.idea.vim.vimscript.model.commands29maddyhome.idea.vim.newapi30maddyhome.idea.vim.group31maddyhome.idea.vim.api32maddyhome.idea.vim.extension.abolish33maddyhome.idea.vim.extension.textobjuser34maddyhome.idea.vim.handler.VisualOperatorActionHandler35maddyhome.idea.vim.vimscript.model.commands.mapping36maddyhome.idea.vim.action.change37maddyhome.idea.vim.action.change.change38maddyhome.idea.vim.action39maddyhome.idea.vim4012151015131579368134141131126235222251421447321102211241321551633101111212115111111102712211114311115228217112222512115111322245311416229117103112319891923791218520334121512412911143235310914165452563210310443416213752722134133183121422433521213258181813168197121621219218128511221076188116161212131112131531+577 more modules (most-connected shown)

At a glance — Code Health · 79% · Strong ·

The Good
D3 · Kotlin God Classes 8.9 D4 · Kotlin Code Duplication 9.8 D17 · Kotlin Explicit Debt 9.5 R1 · React / TS Type Safety 10.0 R10 · React / TS Code Duplication 7.7 R2 · React / TS Cyclomatic Complexity 9.0 R3 · React / TS Large Files 8.7 R7 · React / TS Dead Code 10.0 X1 · Repo Async correctness 10.0 X12 · Repo Unreachable branch 10.0 X13 · Repo Undrained process stream 10.0 X16 · Repo Unfloored truncation loop 10.0 X18 · Repo Disposal-pattern correctness 10.0 X19 · Repo Unrestored process-global state 10.0 X2 · Repo Cancellation propagation 8.3 X20 · Repo Mistyped argument guard 10.0 X21 · Repo Side-effecting pattern guard 10.0 X22 · Repo Contradicted release guard 10.0 X23 · Repo Unguarded diagnostic materialisation 7.8 X25 · Repo Inert configuration knob 10.0 X26 · Repo Unsynchronised callback handoff 10.0 X27 · Repo Collection changed while being enumerated 10.0 X28 · Repo Index access outside its own emptiness guard 10.0 X29 · Repo Per-element action decided by a fixed element 10.0 X30 · Repo Support guard that admits what it rejects 10.0 X5 · Repo Nullable reference types 9.8
The Bad
D1 · Kotlin Cyclomatic Complexity 6.1 D2 · Kotlin Cognitive Complexity 5.9 X3 · Repo Exception handling 6.4

At a glance — Architecture · 78% · Adequate · gated by D5 ·

The Good
D6 · Kotlin Cohesion (LCOM4) 9.9 D26 · Kotlin Project Cohesion 7.1 D35 · Kotlin Change Coupling 9.7 AX10 · Repo Code composition 8.1 AX6 · Repo Interface segregation 10.0 R9 · React / TS Circular Imports 10.0
The Bad
D27 · Kotlin Navigability 6.5 AX3 · Repo Project dependency cycles 6.5 AX4 · Repo Dependency direction 6.5
The Ugly
D5 · Kotlin Coupling 2.5

At a glance — Maturity · 62% · Adequate · gated by M2 ·

The Good
D15 · Kotlin Churn × Complexity Hotspots 9.9 D16 · Kotlin Bus Factor 7.9 D19 · Kotlin Documentation Quality 8.0 D21 · Kotlin Naming Consistency 10.0 D34 · Kotlin Knowledge Freshness 9.7 M3 · Repo Folder & project structure 10.0 M4 · Repo Documentation accuracy 9.9
The Bad
M1 · Repo Documentation (README) 6.0
The Ugly
M2 · Repo Architecture documentation 2.0

At a glance — Readiness · 65% · Adequate · gated by R4 ·

The Good
D9 · Kotlin Test Distribution 10.0 D10 · Kotlin Test Quality 10.0 D13 · Kotlin REDACTED Scanning 10.0 P1 · Repo CI/CD gates 10.0 P3 · Repo Security & performance tooling 7.0 P4 · Repo Deployment & Rollback 7.0 P6 · Repo Release Hygiene 10.0 R5 · React / TS Dependency Freshness 9.6 R8 · React / TS Dependency Hygiene 10.0
The Bad
P10 · Repo Library API & versioning 6.0 R6 · React / TS Tooling 6.7
The Ugly
R4 · React / TS Test Coverage 3.7

At a glance — Security · 53% · Adequate · gated by D29, D36 ·

The Good
D43 · Kotlin Malicious Dependencies 10.0 D44 · Kotlin Platform End-of-Life 10.0 X14 · Repo Bypassable address classification 10.0 X15 · Repo Unvalidated length from an untrusted reader 10.0 X17 · Repo Uncapped recursion over a caller-supplied document 10.0 X24 · Repo Document value interpolated into markup unescaped 10.0
The Bad
D28 · Kotlin Secrets (history) 6.0 D30 · Kotlin Dependency Vulnerabilities 6.1
The Ugly
D29 · Kotlin Static Analysis (SAST) 0.0 D36 · Kotlin Supply-chain Provenance & Signing 0.0

At a glance — Accessibility · 66% · Adequate ·

The Good
AC2 · Repo Forms & labels 10.0 AC6 · Repo Visual & motion safety 10.0
The Bad
AC3 · Repo Page structure 5.5
The Ugly
AC7 · Repo A11y enforcement 4.0

At a glance — Performance · 61% · Adequate ·

The Bad
PF2 · Repo Allocation hygiene 6.2 PF3 · Repo Async & latency hygiene 6.0

Security & Compliance — OWASP Top-10 mapping

Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).

OWASP categoryFindingsSeverity
A05:2025 — Injection180High / Critical
A03:2025 — Software Supply Chain Failures18High / Critical
A07:2025 — Authentication Failures5High / Critical

Roadmap

Begin by addressing the 50 static analysis findings related to unscoped secrets in workflow files, prioritizing REDACTED. Next, secure the supply chain by resolving four workflow secrets that lack proper scoping, starting with REDACTED. Then, remove four historical secrets from configuration files such as REDACTED, and patch four high-severity dependency vulnerabilities in REDACTED. Finally, fix three static analysis issues concerning unverified downloads in maintenance and analysis workflows.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do thisHelpsEffortDimension
Resolve the 4 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED.+2.5 ptsLowSupply-chain Provenance & Signing
Resolve the 4 REDACTED finding(s) in Secrets (history) — start with REDACTED (2), REDACTED, REDACTED.+2.4 ptsLowSecrets (history)
Resolve the 50 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (21), REDACTED (3), REDACTED (2).+4.1 ptsMediumStatic Analysis (SAST)
Resolve the 4 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (4).+2.0 ptsLowDependency Vulnerabilities
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED, REDACTED.+1.5 ptsLowStatic Analysis (SAST)
Resolve the 1 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED.+1.5 ptsLowDependency Vulnerabilities
Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED.+1.3 ptsLowSupply-chain Provenance & Signing
Resolve the 4 Documentation finding(s) in Documentation Quality — start with README.md (4).+0.7 ptsLowDocumentation Quality

File quality

Per-file score 0–10 — a quality signature. Of 284 files carrying findings, judged against the Production bar: 6% slop · 41% mixed · 53% near-clean.

FileScoreBandWorst signal
REDACTED1.1SlopStatic Analysis (SAST): High: REDACTED
REDACTED1.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED1.4SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.5SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.5SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.5SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED2.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.6MixedStatic Analysis (SAST): High: REDACTED

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 188

A definite problem that already costs you something and drags the score down: a missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here tends to cause failures elsewhere.

Serious — 684

Likely wrong, but not failing yet. It degrades the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to carry for two years either.

Minor — 69

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 10

Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.

Methodology & how to trust this report

Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 73 of 76 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 3 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.8 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.

What we checked — 76 dimensions across the health lenses
D1D2D3D4D5D6D9D10D13D15D16D17D19D21D26D27D28D29D30D34D35D36D43D44AC2AC3AC6AC7AX10AX3AX4AX6M1M2M3M4P1P10P3P4P6PF2PF3R1R10R2R3R4R5R6R7R8R9X1X12X13X14X15X16X17X18X19X2X20X21X22X23X24X25X26X27X28X29X3X30X5

Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.

How to trust any code-health report — three questions
  1. Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 919 of 941 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

This report answers yes to all three. That's the bar to hold any assessment to.

Tools & methods

The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Watchdog duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3✓ deterministic
LLM (sampled · advisory)Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurementLocal LLM◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a16fa9-b1c3-7171-85bf-63dff9fbe170.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

  • D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 101 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 850 test source file(s) (.kt) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
  • D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability NOT SCORED: this repository's production source includes .kt, and the jvm executor ran against the .kt half and never executed — so reliability was not measured for the repository as a whole. The JavaScript/TypeScript (vitest via `npm ci --ignore-scripts` in scripts-ts/ (91 tests)): measured (0 flaky) suite(s) did re-run, and came back with 0 flaky across 1 measured tier(s) — but that is a figure for one half of the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — test reliability is excluded from the score rather than counted. The half was driven by a runner we ship, so this is not a missing-runner gap.
  • D12 Dependency Hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — 25 Maven/Gradle manifest(s) were read, stating a version for 82 dependency(ies) and leaving 3 to a parent or an imported BOM, but no build resolved the dependency graph, so the outdated signal was not established. NOT a finding that these dependencies are current or healthy.
  • D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: it declares a published package (build.gradle.kts), but no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict. For npm the surface is what a published package.json's entry points (exports, main, module, types) export, followed through the source; an entry that names build output the tree does not commit (dist/, build/) is not followed back to source, because only a tsconfig outDir/rootDir pair states that mapping and a bundler's input lives in executable configuration this engine does not evaluate.
  • D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `.idea/fileTemplates/code/I18nized Concatenation.java`, `.idea/fileTemplates/code/I18nized Expression.java`, `api/src/main/kotlin/com/intellij/vim/api/models/ApiModels.kt`, `src/main/java/com/maddyhome/idea/vim/autocmd/AutoCmdPattern.kt`, `src/main/java/com/maddyhome/idea/vim/extension/VimExtensionFacade.kt`, … (+21 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
  • AXB1 Runtime evidence locked — no reproducible boot — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Subject: 17 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. Watchdog then boots it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
  • C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
  • GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Java, Kotlin is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and this repository's Kotlin is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.

Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

Limitations & what we did not check

Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
  • D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
  • AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
  • AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
  • AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

The LLM boundary

LLM-set scores this run (3): D19, D21, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.

Dimensions

D1 · Cyclomatic Complexity6.1 / 10Adequate✓ Tool-verified

What it measures: How tangled the control flow is — methods with many branches are hard to test and change.

Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.

Maturity: Documented → Verified → Prevented · effective 6.1 / 10 · rule-coverage 100% · ceiling Prevented

54 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was GraphemesKt.classify at 92. A further 5 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being VimStringParserBase.getVimKeyName at 63 — they are counted neither in the figure above nor in this dimension's score. 1 file carries no cyclomatic complexity row at all for this reason — every one of its over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: src/main/java/com/maddyhome/idea/vim/extension/surround/VimSurroundExtension.kt (CSurroundHandler.getCurrentSurrounding at 19). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

GraphemesKt.classify (cyclomatic 92)vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/Graphemes.kt:220
VimSearchHelperBase.findSentenceRangeEnd (cyclomatic 63)vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1249
VimSearchGroupBase.parseSubstituteCommand (cyclomatic 58)vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:1186
VimSearchHelperBase.findSentenceEnd (cyclomatic 43)vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1117
VimStringParserBase.parseVimScriptString (cyclomatic 43)vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimStringParserBase.kt:317

+ 49 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 2 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with GraphemesKt.classify (cyclomatic 92), VimSearchHelperBase.findSentenceRangeEnd (cyclomatic 63). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 2 together lifts Cyclomatic Complexity from 6.1 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
  2. Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.

D2 · Cognitive Complexity5.9 / 10Adequate✓ Tool-verified

What it measures: How hard the code is for a person to follow, beyond raw branching.

Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.

Maturity: Documented → Verified → Prevented · effective 5.9 / 10 · rule-coverage 100% · ceiling Prevented

124 method(s) exceeded the cognitive complexity threshold of 15; the worst was VimStringParserBase.parseVimScriptString at 110.

VimStringParserBase.parseVimScriptString (cognitive 110)vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimStringParserBase.kt:317
VimSearchHelperBase.findSentenceEnd (cognitive 102)vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1117
VimSearchHelperBase.findSentenceRangeEnd (cognitive 102)vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1249
VimSearchGroupBase.parseSubstituteCommand (cognitive 92)vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:1186
IndentObjectHandler.getRange (cognitive 68)src/main/java/com/maddyhome/idea/vim/extension/textobjindent/VimIndentObject.kt:99

+ 119 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 6 bodies over 60 down to 60 or less in Cognitive Complexity — start with VimStringParserBase.parseVimScriptString (cognitive 110), VimSearchHelperBase.findSentenceEnd (cognitive 102), VimSearchHelperBase.findSentenceRangeEnd (cognitive 102). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 6 together lifts Cognitive Complexity from 5.9 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
  2. Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.

D3 · God Classes8.9 / 10Strong✓ Tool-verified

What it measures: Over-large classes that try to do too much ("god classes").

Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.

Maturity: Documented → Verified → Prevented · effective 8.9 / 10 · rule-coverage 100% · ceiling Prevented

40 god class(es) detected.

TooManyMethods: VimChangeGroupBase · ×17vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:63
ClassTooLong: VimChangeGroupBase · ×11vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:63
FileTooLong: api/VimChangeGroupBase.kt · ×7vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt
MethodTooLong: VimStringParserBase.parseVimScriptString · ×4vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimStringParserBase.kt:317
FunctionTooLong: selectTicketForAnalysis.mainscripts-ts/src/selectTicketForAnalysis.ts:25

What to do

  1. Resolve the 17 TooManyMethods finding(s) in God Classes — start with VimChangeGroupBase.kt, IjVimEditor.kt, PatternVisitor.kt. — One of this dimension's main actionable groups (17 warning-level).
  2. Resolve the 11 ClassTooLong finding(s) in God Classes — start with VimChangeGroupBase.kt, VimSearchHelperBase.kt, VimSearchGroupBase.kt. — One of this dimension's main actionable groups (11 warning-level).
  3. Resolve the 7 FileTooLong finding(s) in God Classes — start with VimChangeGroupBase.kt, VimSearchHelperBase.kt, VimSearchGroupBase.kt. — One of this dimension's main actionable groups (7 warning-level).
  4. Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.

D4 · Code Duplication9.8 / 10Stronggated by 43 serious findings✓ Tool-verified

What it measures: Copy-pasted code that should be shared instead.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 100% · ceiling Verified

43 duplicated block group(s) detected.

Duplicated block (5 lines × 2) · ×6vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/PatternVisitor.kt:194
Duplicated block (9 lines × 2) · ×5vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/updown/MotionGotoLineLastEndAction.kt:48
Duplicated block (10 lines × 2) · ×4src/main/java/com/maddyhome/idea/vim/action/editor/VimEditorActions.kt:53
Duplicated block (8 lines × 2) · ×4scripts/src/main/kotlin/scripts/youtrack.kt:84
Duplicated block (12 lines × 2) · ×3vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/StringUtil.kt:45

+ 14 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 6 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with PatternVisitor.kt, CommandVisitor.kt, VimExtensionRegistrar.kt. — One of this dimension's main actionable groups (6 warning-level).
  2. Resolve the 5 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with MotionGotoLineLastEndAction.kt, PatternVisitor.kt, ClassTextObjectHandler.kt. — One of this dimension's main actionable groups (5 warning-level).
  3. Resolve the 4 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with VimEditorActions.kt, ClassTextObjectHandler.kt, SelectMotionArrowLeftAction.kt. — One of this dimension's main actionable groups (4 warning-level).
  4. Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.

D5 · Coupling2.5 / 10Weak✓ Tool-verified

What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.

Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.

Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 2.5 / 10 · rule-coverage 100% · ceiling Prevented

24 production modules (Gradle), 1 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; edges a convention plugin adds from buildSrc or build-logic are not visible there; 0 module(s) off the main sequence, with abstractness counted on 13 of the 24 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).

Circular dependency

What to do

  1. Resolve the 1 Circular dependency finding(s) in Coupling. — One of this dimension's main actionable groups (1 issue-level).
  2. Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.

D6 · Cohesion (LCOM4)9.9 / 10Stronggated by 3 serious findings✓ Tool-verified

What it measures: Whether a class's methods are focused on a single responsibility.

Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.

Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 9.9 / 10 · rule-coverage 100% · ceiling Verified

3 of 252 classes have LCOM4 above 3.

Low cohesion: VimMotionGroupBase (LCOM4 14) · ×3vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMotionGroupBase.kt:37

What to do

  1. Resolve the 3 Low cohesion finding(s) in Cohesion (LCOM4) — start with VimMotionGroupBase.kt, VimEmulationConfigurable.kt, VimChangeGroupBase.kt. — One of this dimension's main actionable groups (3 warning-level).
  2. Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.

D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.

Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

101 test methods: 101 unit, 0 integration, 0 BDD, 0 e2e. The JavaScript/TypeScript suite contributes 101 `it`/`test` case(s) across 9 test file(s) declaring at least one; its tier split is read from package names and paths only.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the tests truly assert behaviour rather than just running the code.

Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

10 skipped (10 with a documented reason), 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 101 tests. Measured on the JavaScript/TypeScript suite only — at least 850 test source file(s) (.kt) went unread, so its test quality is unmeasured and is not in these counts.

Skipped (documented): (unnamed test) · ×10scripts-ts/src/propertyTestFailures.test.ts:202

✓ On the Gold path — maintain.

Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.

D13 · REDACTED Scanning10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.

Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

REDACTED scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D15 · Churn × Complexity Hotspots9.9 / 10Stronggated by 6 serious findings✓ Tool-verified

What it measures: Files that change often and are also complex — the riskiest hotspots.

Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.

Maturity: Documented → Verified → Prevented · effective 9.9 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt (4×58=232); vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMotionGroupBase.kt (6×28=168); vim-engine/src/main/kotlin/com/maddyhome/idea/vim/register/VimRegisterGroupBase.kt (5×28=140)

Hotspot: vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt · ×6vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:1186

What to do

  1. Resolve the 6 Hotspot finding(s) in Churn × Complexity Hotspots — start with VimSearchGroupBase.kt, VimMotionGroupBase.kt, VimRegisterGroupBase.kt. — One of this dimension's main actionable groups (6 warning-level).

Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.

D16 · Bus Factor7.9 / 10Strong✓ Tool-verified

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

Maturity: Documented → Verified → Prevented · effective 7.9 / 10 · rule-coverage 100% · ceiling Documented

108 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/main/java/com/maddyhome/idea/vim/extension/targets/TargetsExtension.kt. Counted over 521 of the 1359 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1 · ×4
Further sole-owners (lower concentration)

What to do

  1. Resolve the 4 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (4 recommendation-level).
  2. Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.

D17 · Explicit Debt9.5 / 10Stronggated by 300 serious findings✓ Tool-verified

What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.

Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.

Maturity: Documented → Verified → Prevented · effective 9.5 / 10 · rule-coverage 100% · ceiling Prevented

312 deducted task-comment markers across 119405 LoC (0.3/KLoC) → score 9.5. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.

TodoComment · ×275annotation-processors/src/main/kotlin/com/intellij/vim/annotations/CommandOrMotion.kt:11
FixmeComment · ×14src/main/java/com/maddyhome/idea/vim/extension/nerdtree/NerdTree.kt:219
XxxComment · ×9src/main/java/com/maddyhome/idea/vim/extension/surround/VimSurroundExtension.kt:351
HackCommentsrc/main/java/com/maddyhome/idea/vim/helper/PsiHelper.java:92
TodoComment repeated across 11 filessrc/test/java/org/jetbrains/plugins/ideavim/ex/implementation/functions/mappingFunctions/MapSetFunctionTest.kt:129

What to do

  1. Resolve the 275 TodoComment finding(s) in Explicit Debt — start with VimSearchGroupBase.kt (8), VimExchangeExtension.kt (7), VimListenerManager.kt (7). — One of this dimension's main actionable groups (275 warning-level).
  2. Resolve the 14 FixmeComment finding(s) in Explicit Debt — start with NerdTree.kt (2), Mappings.kt (2), VimRegisterGroupBase.kt (2). — One of this dimension's main actionable groups (14 warning-level).
  3. Resolve the 9 XxxComment finding(s) in Explicit Debt — start with ReloadVimRc.kt (2), VimSurroundExtension.kt, Helper.kt. — One of this dimension's main actionable groups (9 warning-level).
  4. Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.

D19 · Documentation QualityStrong◐ Sampled · advisory

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.

Maturity: Documented → Verified → Prevented · effective Strong / 10 · rule-coverage 100% · ceiling Documented

The repository's root README (README.md) is a well-written overview that states IdeaVim is a Vim engine for JetBrains IDEs with contact info, resources, compatibility, setup, and Get Early Access. It also links to the architecture/Docs markdown suite, which covers plugin development, NERDTree support, select mode, autocmds, set-commands, marketplace-plugin-example, and an API guide (experimental). The README is complete for its role as a deploy tier but lacks the root-level installation/build guidance that would appear in the root README. The architecture/Docs suite is well written and covers all four outlined categories. The repository's documentation is strong and well-organized. The README for the plugin API (api/doc/Plugin-API-reference.md) provides a clear overview of what the project does (experimental Plugin API with Vim integration), an EXPERIMENTAL API warning, and two detailed guides: one covering the quick start (project setup, creating an init function, adding mappings) and another walking through implementing a 'Replace with Register' plugin step by step. A companion post on environment-variable expansion in file commands and a standalone How Many Modes Does Vim Have? document add depth. The posts are well written and cover the most interesting Vim internals.

Documentation: no project overview · ×4README.md

What to do

  1. Resolve the 4 Documentation finding(s) in Documentation Quality — start with README.md (4). — One of this dimension's main actionable groups (4 recommendation-level).

Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.

D21 · Naming ConsistencyExemplary◐ Sampled · advisory

What it measures: Whether names — types, methods, variables — are clear and consistent.

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.

Maturity: Documented → Verified → Prevented · effective Exemplary / 10 · rule-coverage 100% · ceiling Verified

0 naming inconsistencies across 0 sampled symbols.

✓ On the Gold path — maintain.

Detailed fixes: d21_recommendation.md.

D26 · Project Cohesion7.1 / 10Strong✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic, LLM-independent.

Maturity: Documented → Verified → Prevented · effective 7.1 / 10 · rule-coverage 100% · ceiling Documented

2 of 14 build units (Gradle, npm) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.

D27 · Navigability6.5 / 10Adequate✓ Tool-verified

What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.

Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.

Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.

Maturity: Documented → Verified → Prevented · effective 6.5 / 10 · rule-coverage 100% · ceiling Documented

86 % of calls cross a namespace and 71 % go through an interface, but 100 % of collaborators are co-located — so following a call takes several hops. Baseline: small — navigation cost is tolerated.

High interface indirection

What to do

  1. Resolve the 1 High interface indirection finding(s) in Navigability. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d27_recommendation.md · top locations in Appendix A, every location in findings.md.

D28 · Secrets (history)6.0 / 10Adequate✓ Tool-verified

What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.

Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.

Maturity: Documented → Verified → Prevented · effective 6.0 / 10 · rule-coverage 100% · ceiling Documented

4 finding(s): 0 critical, 4 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.

REDACTED
REDACTED

What to do

  1. Resolve the 4 REDACTED finding(s) in Secrets (history) — start with REDACTED (2), REDACTED, REDACTED. — One of this dimension's main actionable groups (4 issue-level).
  2. Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.

D29 · Static Analysis (SAST)0.0 / 10Critical✓ Tool-verified

What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.

Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.

Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

180 finding(s): 0 critical, 165 high, 15 medium, 0 low. 110 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 12 file(s) — `.idea/fileTemplates/code/I18nized Concatenation.java`, `.idea/fileTemplates/code/I18nized Expression.java`, `gradlew` (line 74, line 178), `src/main/java/com/maddyhome/idea/vim/extension/VimExtensionFacade.kt` (line 295), `src/main/java/com/maddyhome/idea/vim/extension/argtextobj/VimArgTextObjExtension.kt` (line 205), … (+7 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 4 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

+ 3 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 50 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (21), REDACTED (3), REDACTED (2). — One of this dimension's main actionable groups (50 issue-level).
  2. Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (3 issue-level).
  3. No action in Static Analysis (SAST) — all 110 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (110 issue-level, 0 of them charged here).

Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.

D30 · Dependency Vulnerabilities6.1 / 10Adequate✓ Tool-verified

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.

Maturity: Documented → Verified → Prevented · effective 6.1 / 10 · rule-coverage 100% · ceiling Documented

6 finding(s): 1 critical, 4 high, 1 medium, 0 low.

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 4 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (4). — One of this dimension's main actionable groups (4 issue-level).
  2. Resolve the 1 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. Resolve the 1 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.

D34 · Knowledge Freshness9.7 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.

Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.

Maturity: Documented → Verified → Prevented · effective 9.7 / 10 · rule-coverage 100% · ceiling Documented

19 of 521 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/Graphemes.kt. Counted over 521 of the 1359 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned file · ×19vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/Graphemes.kt:1
Orphaned files with no living knowledge

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.

D35 · Change Coupling9.7 / 10Adequategated by 7 critical findings✓ Tool-verified

What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.

Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.

Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

Maturity: Documented → Verified → Prevented · effective 9.7 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: IjVimApplication.kt↔VimApplication.kt 94%; LetCommand.kt↔OptionExpression.kt 91%; IjVimMessages.kt↔VimMessages.kt 91%

Boundary-crossing change coupling: IjVimApplication.kt ↔ VimApplication.kt · ×7src/main/java/com/maddyhome/idea/vim/newapi/IjVimApplication.kt:1
Change coupling: LetCommand.kt ↔ OptionExpression.kt · ×10vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/LetCommand.kt:1
Change-coupling hub: ThinApi.kt → VimApiImpl.kt, EditorAccessorImpl.kt, TransactionImpl.kt · ×2vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/ThinApi.kt
Change coupling clique: MiniAI.kt, ParagraphMotion.kt, VimIndentObject.ktsrc/main/java/com/maddyhome/idea/vim/extension/miniai/MiniAI.kt

What to do

  1. Resolve the 7 Boundary-crossing change coupling finding(s) in Change Coupling — start with ExEditorKit.kt (2), MacroGroup.kt (2), IjVimApplication.kt. — One of this dimension's main actionable groups (7 issue-level).
  2. Resolve the 10 Change coupling finding(s) in Change Coupling — start with LetCommand.kt, ExCommandProcessor.kt, IdeaSelectionControl.kt. — One of this dimension's main actionable groups (10 warning-level).
  3. Resolve the 2 Change-coupling hub finding(s) in Change Coupling — start with ThinApi.kt, PropertyBased.kt. — One of this dimension's main actionable groups (2 warning-level).

Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.

D36 · Supply-chain Provenance & Signing0.0 / 10Critical✓ Tool-verified

What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.

Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

0/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

+ 3 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 4 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (4 warning-level).
  2. Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

D44 · Platform End-of-Life10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.

Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 20 platform declaration(s) and 86 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AC2 · Forms & labels10.0 / 10Exemplary○ Nothing flagged

Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.

Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

AC3 · Page structure5.5 / 10Adequate✓ Tool-verified

Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.

Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). (×2) — ideavim-common/src/main/resources/inspectionDescriptions/UsePlug.html:9, ideavim-common/src/main/resources/inspectionDescriptions/UsePlugSyntax.html:9
  • A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>. (×2) — ideavim-common/src/main/resources/inspectionDescriptions/UsePlug.html:9, ideavim-common/src/main/resources/inspectionDescriptions/UsePlugSyntax.html:9
  • No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×17) — ideavim-common/src/main/resources/inspectionDescriptions/UsePlug.html:9, ideavim-common/src/main/resources/inspectionDescriptions/UsePlugSyntax.html:9, src/main/resources/whatsnew-2.40.0.html:10, …

What to do

  • Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
AC6 · Visual & motion safety10.0 / 10Exemplary○ Nothing flagged

Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.

Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.

Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified

Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.

Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.

Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.

  • No accessibility enforcement found — no accessibility linting at author time and no automated accessibility check in tests or CI. Add your UI toolkit's own accessibility assertion to the test suite (Flutter `meetsGuideline`, Espresso `AccessibilityChecks`, XCTest `performAccessibilityAudit`), then gate that test in the pipeline. What was searched, so you can tell an absence from a miss: the 17 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.

What to do

  • Enforce accessibility in the toolchain your project already uses: assert accessibility in your UI test suite with your toolkit's own matcher (Flutter `meetsGuideline`, Espresso `AccessibilityChecks`, XCTest `performAccessibilityAudit`), then gate that test in CI so a regression blocks the merge.
AX10 · Code composition8.1 / 10Strong✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

What to do

  • The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
AX3 · Project dependency cycles6.5 / 10Adequate✓ Tool-verified

Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).

Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.

  • The projects :ideavim-acejump → IdeaVIM → :ideavim-acejump (one cycle inside a mutually-dependent group of 9 projects) form a reference cycle. Cyclic dependencies prevent independent build/test/deploy, blur ownership, and tend to grow into a big ball of mud. Break the cycle by extracting the shared types into a separate project both can reference.

What to do

  • Break project reference cycles by extracting shared abstractions into a separate project; keep the graph a DAG.
AX4 · Dependency direction6.5 / 10Adequate✓ Tool-verified

Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.

Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.

  • `:ideavim-backend-bookmarks-core` is a Domain project but references `:api`, a Web project. The clean-architecture rule is that dependencies point INWARD — the domain/application core must not depend on outer layers (infrastructure/web). Invert it: define the abstraction in the inner layer and implement it in the outer one.

What to do

  • Keep dependencies pointing inward: domain/application define interfaces, infrastructure/web implement them (Dependency Inversion).
AX6 · Interface segregation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').

Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.

M1 · Documentation (README)6.0 / 10Adequate✓ Tool-verified

Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

What to do

  • Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
  • Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
  • Add a README to the 16 of 16 project(s) that lack one — worth up to 2 pts.
M2 · Architecture documentation2.0 / 10Critical✓ Tool-verified

Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

  • No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

M4 · Documentation accuracy9.9 / 10Exemplary◐ Sampled · advisory

Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).

Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.

  • CONTRIBUTING.md links to `src/main/resources/ksp-generated/intellij_commands.json`, but `src/main/resources/ksp-generated/intellij_commands.json` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — CONTRIBUTING.md:72
  • CONTRIBUTING.md links to `src/main/resources/ksp-generated/intellij_ex_commands.json`, but `src/main/resources/ksp-generated/intellij_ex_commands.json` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — CONTRIBUTING.md:79
  • api/doc/Plugin-API-introduction.md links to `IdeaVim%20Plugins.md`, but `api/doc/IdeaVim Plugins.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — api/doc/Plugin-API-introduction.md:15

What to do

  • Reconcile the README with reality: CONTRIBUTING.md links to `src/main/resources/ksp-generated/intellij_commands.json`, but `src/main/resources/ksp-generated/intellij_commands.json` does not exist; CONTRIBUTING.md links to `src/main/resources/ksp-generated/intellij_ex_commands.json`, but `src/main/resources/ksp-generated/intellij_ex_commands.json` does not exist; api/doc/Plugin-API-introduction.md links to `IdeaVim%20Plugins.md`, but `api/doc/IdeaVim Plugins.md` does not exist.
P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — Whether an automated pipeline builds and tests every change.

Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.

P10 · Library API & versioning6.0 / 10Adequate✓ Tool-verified

Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.

Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.

  • 1566/1885 types (83%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.

What to do

  • Keep implementation types off the public surface (Kotlin: `internal`) so internals can change without breaking consumers.
P3 · Security & performance tooling7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).

Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.

What to do

  • Dependabot is configured but does not watch `github-actions`, `npm` — add those `package-ecosystem` entries to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.

Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.

P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

PF2 · Allocation hygiene6.2 / 10Adequate✓ Tool-verified

Readiness · Performance — Whether the code is written to minimise allocations so it doesn't pressure its host's memory manager — buffer/slice views over copies, object pooling, stack or value-type allocation, and buffer writers. Reward-only: credited where present, never penalised where a simpler style is fine.

Method: Production-source scan: density (per 1k LoC) of allocation-aware APIs — in .NET Span/Memory, ArrayPool/ObjectPool, stackalloc, ValueTask, value-type structs, IBufferWriter, string.Create, SkipLocalsInit; off .NET, with comments and strings blanked, Go's sync.Pool, preallocated slices/maps, Grow, strconv.Append* and buf[:0] reuse; the JVM's NIO buffer views, MemorySegment, primitive collections, pools and literal presizes (plus Kotlin primitive arrays and value classes, Scala AnyVal and @specialized); Swift's reserveCapacity, ContiguousArray, withUnsafe* access and ~Copyable. Activated off .NET on the same floor (400 lines, and benchmarks or 8 uses); Rust and garbage-collected scripting languages are not applicable. Reward-only. Deterministic, syntax/text detection.

What to do

  • Raise allocation-aware density on the hot paths — currently 48 use(s) across 131,867 production line(s) (~0.4/1k). More of the idioms below on the allocation-heavy paths climbs this toward 10.
  • Java: on hot paths, work through buffer views (ByteBuffer/LongBuffer slices, MemorySegment) instead of copies, avoid boxing with primitive collections (fastutil, Eclipse Collections, HPPC, Trove), presize collections and StringBuilders, and pool expensive buffers (Netty's pooled allocator, commons-pool).
  • Kotlin: on hot paths, use primitive arrays (IntArray, LongArray …) and @JvmInline value classes instead of boxed values, primitive collections (androidx.collection, fastutil) instead of boxed ones, and presize collections and StringBuilders.
PF3 · Async & latency hygiene6.0 / 10Adequate✓ Tool-verified

Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.

  • `writeFileSync` in `downloadAttachment` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — scripts-ts/src/tools/youtrack.ts:251
  • `readFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — scripts-ts/src/updateAuthors.ts:289
  • `writeFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — scripts-ts/src/updateAuthors.ts:297

What to do

  • TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
R1 · Type Safety10.0 / 10Exemplary✓ Tool-verified

React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.

Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.

R10 · Code Duplication7.7 / 10Strong✓ Tool-verified

React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.

Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Deterministic.

  • scripts-ts/src/selectIssueWithoutArea.ts:22 · scripts-ts/src/selectTicketForAnalysis.ts:16 — the two spans are one implementation copied and then locally edited — 220 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts-ts/src/selectIssueWithoutArea.ts:22
  • scripts-ts/src/tools/youtrack.ts:161 · scripts-ts/src/tools/youtrack.ts:314 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts-ts/src/tools/youtrack.ts:161
  • scripts-ts/src/youtrack-cli/set-fix-version.ts:17 · scripts-ts/src/youtrack-cli/set-status.ts:18 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — scripts-ts/src/youtrack-cli/set-fix-version.ts:17
  • scripts-ts/src/youtrack-cli/add-tag.ts:26 · scripts-ts/src/youtrack-cli/remove-tag.ts:22 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts-ts/src/youtrack-cli/add-tag.ts:26
  • scripts-ts/src/youtrack-cli/remove-tag.ts:31 · scripts-ts/src/youtrack-cli/set-fix-version.ts:21 · scripts-ts/src/youtrack-cli/set-status.ts:22 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts-ts/src/youtrack-cli/remove-tag.ts:31
  • scripts-ts/src/prepareReleaseChangelog.ts:57 · scripts-ts/src/syncChangelogToMaster.ts:60 — the two spans are one implementation copied and then locally edited — 68 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts-ts/src/prepareReleaseChangelog.ts:57
  • scripts-ts/src/tools/youtrack.ts:110 · scripts-ts/src/tools/youtrack.ts:127 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts-ts/src/tools/youtrack.ts:110
  • scripts-ts/src/updateAuthors.ts:40 · scripts-ts/src/updateYoutrackOnCommit.ts:22 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts-ts/src/updateAuthors.ts:40
  • scripts-ts/src/promoteChangelog.ts:52 · scripts-ts/src/releaseActions.ts:52 — the two spans are one implementation copied and then locally edited — 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts-ts/src/promoteChangelog.ts:52
  • scripts-ts/src/youtrack-cli/create-version.ts:17 · scripts-ts/src/youtrack-cli/delete-version.ts:19 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts-ts/src/youtrack-cli/create-version.ts:17
  • scripts-ts/src/syncChangelogToMaster.ts:103 · scripts-ts/src/syncChangelogToMaster.ts:119 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts-ts/src/syncChangelogToMaster.ts:103
  • scripts-ts/src/tools/youtrack.ts:92 · scripts-ts/src/tools/youtrack.ts:499 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — scripts-ts/src/tools/youtrack.ts:92
  • scripts-ts/src/updateAuthors.ts:115 · scripts-ts/src/updateAuthors.ts:125 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — scripts-ts/src/updateAuthors.ts:115
  • scripts-ts/src/collectPropertyTestFailures.ts:82 · scripts-ts/src/updateAuthors.ts:230 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — scripts-ts/src/collectPropertyTestFailures.ts:82
  • scripts-ts/src/selectTicketForAnalysis.ts:16 · scripts-ts/src/updateAuthors.ts:230 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — scripts-ts/src/selectTicketForAnalysis.ts:16
  • scripts-ts/src/youtrack-cli/add-comment.ts:18 · scripts-ts/src/youtrack-cli/get-ticket.ts:18 · scripts-ts/src/youtrack-cli/set-area.ts:21 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts-ts/src/youtrack-cli/add-comment.ts:18
  • scripts-ts/src/updateAuthors.ts:237 · scripts-ts/src/updateYoutrackOnCommit.ts:58 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts-ts/src/updateAuthors.ts:237

What to do

  • Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
R2 · Cyclomatic Complexity9.0 / 10Exemplary✓ Tool-verified

React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.

Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.

  • main has cyclomatic complexity 14 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts-ts/src/selectTicketForAnalysis.ts:25
  • unreleasedEntries has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts-ts/src/syncChangelogToMaster.ts:101
  • parseFailureDetails has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts-ts/src/propertyTestFailures.ts:129
  • main has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts-ts/src/completeTicketAnalysis.ts:76

What to do

  • Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
R3 · Large Files8.7 / 10Strong✓ Tool-verified

React / JS · Code Health — How many source files exceed the large-file threshold.

Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.

  • scripts-ts/src/tools/youtrack.ts has 465 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — scripts-ts/src/tools/youtrack.ts:1

What to do

  • Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
R4 · Test Coverage3.7 / 10Weak✓ Tool-verified

React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.

Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.

  • No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×19) — scripts-ts/src/collectPropertyTestFailures.ts:1, scripts-ts/src/selectTicketForAnalysis.ts:1, scripts-ts/src/completeTicketAnalysis.ts:1, …

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
R5 · Dependency Freshness9.6 / 10Exemplary✓ Tool-verified

React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).

Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.

What to do

  • Bump outdated dependencies to current versions to limit upgrade debt.
R6 · Tooling6.7 / 10Adequate✓ Tool-verified

React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.

Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.

  • test ✓ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.

What to do

  • Add eslint as package.json scripts and run them in CI.
R7 · Dead Code10.0 / 10Exemplary✓ Tool-verified

React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).

Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.

R8 · Dependency Hygiene10.0 / 10Exemplary✓ Tool-verified

React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.

Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.

R9 · Circular Imports10.0 / 10Exemplary✓ Tool-verified

React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.

Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.

X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.

Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.

X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.

Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.

X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.

Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.

X14 · Bypassable address classification10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.

Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.

X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.

Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.

X16 · Unfloored truncation loop10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.

Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.

X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.

Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.

X18 · Disposal-pattern correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.

Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.

X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.

Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.

X2 · Cancellation propagation8.3 / 10Strong✓ Tool-verified

Other · Code Health — Whether functions that make a cancellable request accept or pass on an AbortSignal or the coroutine's cancellation (adoption curve).

Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.

  • Only 10/14 functions that make a cancellable request (fetch, axios, ky, ofetch; Ktor, OkHttp newCall, URL streams) accept an AbortSignal or the coroutine's cancellation or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, a cancelled request, a shutdown, an expired deadline. Take a `signal` () and hand it to the request; in a Kotlin suspend function, make the request with a call that suspends — Ktor, OkHttp's `executeAsync()`, or a `suspendCancellableCoroutine` that cancels the `Call` — not a blocking `execute()`: `withContext(Dispatchers.IO)` moves the call off the caller's thread but does not make it cancellable; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
  • `getGitHubAuthorInfo` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — scripts-ts/src/updateAuthors.ts:74
  • `getPluginLinkByXmlId` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — scripts-ts/src/checkNewPluginDependencies.ts:51
  • `downloadAttachment` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — scripts-ts/src/tools/youtrack.ts:231
  • `tcGet` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — scripts-ts/src/tools/teamcity.ts:37

What to do

  • Thread an AbortSignal or the coroutine's cancellation through functions that make requests, so the work stops when its caller gives up.
X20 · Mistyped argument guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `NullPointerException` (Java, Kotlin, Scala), `ArgumentError.notNull` (Dart) or `ArgumentNullException` (F#'s `nullArg`) tells the caller a parameter was null when it provably was not.

Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.

X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.

Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.

X22 · Contradicted release guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.

Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.

X23 · Unguarded diagnostic materialisation7.8 / 10Strong✓ Tool-verified

Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.

Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.

  • `debug` at line 42 is called with an argument built by `extensionBeans.joinToString("…")` (line 43), whose cost grows with the collection it walks. Kotlin evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isDebugEnabled` test, no `BuildConfig.DEBUG` flag, no trailing lambda (`logger.debug { … }`) the logger calls only when the level is on. — src/main/java/com/maddyhome/idea/vim/thinapi/IjPluginExtensionsScanner.kt:42

What to do

  • In Kotlin, hand the logger a lambda it calls only when the level is on (`logger.debug { "rows: ${rows.joinToString()}" }` — kotlin-logging and Log4j 2's Kotlin API take one), or put the line behind `if (log.isDebugEnabled)` (`if (BuildConfig.DEBUG)` for a line only a debug build needs). A string template is not the fix on SLF4J or Timber: their message is a `String`, so every `joinToString` or `toJson` inside the `${…}` runs before the call is entered.
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.

Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.

X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.

Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.

X26 · Unsynchronised callback handoff10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.

Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether an enhanced `for` leaves the collection it is walking alone — a body that adds to or removes from the very collection the loop is iterating invalidates the fail-fast iterator it is holding, so the next `next()` throws `ConcurrentModificationException` and the remaining elements are never seen. Whether a `for (x in c)` or `c.forEach { … }` leaves the collection it is walking alone — a `mutableListOf`/`ArrayList`, `mutableMapOf`/`HashMap` or `mutableSetOf`/`HashSet` is a `java.util` collection on the JVM and is walked by its own fail-fast iterator, so a body that adds to or removes from the very collection the loop is walking makes the next step throw `ConcurrentModificationException` and the remaining elements are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.

Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.

X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.

Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.

X3 · Exception handling6.4 / 10Adequate✓ Tool-verified

Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.

Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.

  • `catch (_: Throwable)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×2) — ideavim-backend-bookmarks/src/main/java/com/maddyhome/idea/vim/group/bookmark/BookmarkRemoteApiProvider.kt:43, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/Command.kt:370
  • `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×2) — ideavim-backend/src/main/java/com/maddyhome/idea/vim/group/process/ProcessGroup.kt:49, src/main/java/com/maddyhome/idea/vim/group/IjFileGroup.kt:182
  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×2) — scripts-ts/src/buildWhatsNewSite.ts:297, src/main/java/com/maddyhome/idea/vim/helper/HandlerInjector.kt:43
  • `catch (e: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×2) — src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:93, src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:156

What to do

  • Swallowed exception (caught, then discarded)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.

Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.

X5 · Nullable reference types9.8 / 10Exemplary✓ Tool-verified

Other · Code Health — Whether Kotlin's null safety is not undermined by not-null assertions — `String` cannot hold null and `String?` must be checked before use in every Kotlin module, and each `!!` is a run-time `NullPointerException` the author has told the compiler cannot happen.

Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.

WCAG coverage — what static analysis assessed

Statically assessed 10 of 55 WCAG 2.2 Level A/AA success criteria (18%; ≈20% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 45 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).

DimensionWCAG 2.2 A/AA criteriaCoverage
AC2 · Forms & labels1.3.1, 3.3.2, 4.1.2Partial signal
AC3 · Page structure1.4.4, 2.2.1, 2.4.1, 2.4.2, 3.1.1, 4.1.2Partial signal
AC6 · Visual & motion safety1.4.3, 2.4.7Partial — literal CSS only
AC7 · A11y enforcementenforcement — no page criterionEnforcement posture (process)

Not statically assessed — these 45 Level A/AA criteria need runtime or manual evaluation (WCAG-EM): 1.1.1, 1.2.1, 1.2.2, 1.2.3, 1.2.4, 1.2.5, 1.3.2, 1.3.3, 1.3.4, 1.3.5, 1.4.1, 1.4.2, 1.4.5, 1.4.10, 1.4.11, 1.4.12, 1.4.13, 2.1.1, 2.1.2, 2.1.4, 2.2.2, 2.3.1, 2.4.3, 2.4.4, 2.4.5, 2.4.6, 2.4.11, 2.5.1, 2.5.2, 2.5.3, 2.5.4, 2.5.7, 2.5.8, 3.1.2, 3.2.1, 3.2.2, 3.2.3, 3.2.4, 3.2.6, 3.3.1, 3.3.3, 3.3.4, 3.3.7, 3.3.8, 4.1.3.

Reference — by lens

The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.

LensScoreRatingImpact
Code Health79%StrongStrongest area.
Architecture78%Adequate — gated by D5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity62%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness65%Adequate — gated by R4Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security53%Adequate — gated by D29, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Accessibility66%AdequateAcceptable, with room to improve.
Performance61%AdequateAcceptable, with room to improve.
Unscored — 1 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

  • X10 Duplicated predicate — 17 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for

These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 54 check(s) not relevant to this codebase

These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.

  • AC1 Text alternatives — No image/media element found in the parsed markup — AC1 not applicable here.
  • AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
  • AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
  • AX1 Captive dependencies — Not applicable: this repository's Java imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Kotlin imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's TypeScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No class in this Java code is a Spring, JSR-330 or CDI singleton bean. No class in this Kotlin code is a Spring, JSR-330 or CDI singleton bean. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Room, JPA or MongoDB entity, an Exposed or Ktorm table, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (Room, Exposed, SQLDelight, Realm, JPA, JDBC, MongoDB, Firebase, …) imported either, so this repository keeps no data at rest for these controls to protect.
  • C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named column (email, first_name, date_of_birth, phone_number, …) or stored credential on a Room, JPA or MongoDB entity, an Exposed or Ktorm table, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (Room, Exposed, SQLDelight, Realm, JPA, JDBC, MongoDB, Firebase, …) imported either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Room, JPA or MongoDB entity, an Exposed or Ktorm table, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (Room, Exposed, SQLDelight, Realm, JPA, JDBC, MongoDB, Firebase, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Room, JPA or MongoDB entity, an Exposed or Ktorm table, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (Room, Exposed, SQLDelight, Realm, JPA, JDBC, MongoDB, Firebase, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D11 Test Reliability — Test reliability not scored — polyglot repository, one half's runner produced no measurement
  • D12 Dependency Hygiene — Not scored — 25 Maven/Gradle manifest(s) were read, stating a version for 82 dependency(ies) and leaving 3 to a parent or an imported BOM, but no build resolved the dependency graph, so the outdated signal was not established. NOT a finding that these dependencies are current or healthy.
  • D14 License Compliance — Not scored — this repository's 82 declared JVM dependency coordinate(s) were read from its 25 Maven/Gradle manifest(s), but Maven Central could not be asked for the licence of 31 of them (HTTP 429 Too Many Requests from https://repo1.maven.org/maven2/org/jetbrains/kotlin/kotlin-stdlib/2.3.20/kotlin-stdlib-2.3.20.pom), and a licence verdict over part of a dependency graph is not a licence verdict. Nothing is asserted about this repository's licensing in either direction.
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — No inline comments to assess — comment value is not applicable here.
  • D25 ADR Conformance — no ADRs to check
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — 26 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — scripts-ts/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
  • DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 184 value object(s); 3 domain event(s); its domain events are published by services or handlers — no domain entity raises one
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P2 Observability — This repository's JVM, JavaScript/TypeScript source (13 module(s), 1336 file(s) read) declares no entry point and bootstraps no server, and nothing here deploys a service — it is a library, run inside whatever hosts it, so production observability (structured logging, tracing/metrics, health checks) is N/A. If it grows a binary or a service, the dimension reactivates.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JVM, JavaScript/TypeScript source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (JaCoCo XML — the Gradle `jacocoTestReport` task) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `@Benchmark` in a Java, Kotlin or Scala file importing JMH or kotlinx-benchmark, Jetpack Benchmark's `measureRepeated` in a file importing androidx.benchmark, or JMH/kotlinx-benchmark/androidx.benchmark in a pom.xml, Gradle or sbt build, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
  • S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Kotlin was read, and it logs through none that an assembled message defeats: Android's `Log` and Timber, java.util.logging and log4j-api-kotlin take one finished message (as log4net does in C#), or it makes no call through a named logger at all. Calls made through SLF4J, log4j 2 or kotlin-logging (`LoggerFactory.getLogger`, `KotlinLogging.logger {}`) would be judged.
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical — 188 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 85 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 25 more in this group — see findings.md.
D35 · Change Coupling · Boundary-crossing change coupling · ×7
  • Boundary-crossing change coupling: IjVimApplication.kt ↔ VimApplication.kt src/main/java/com/maddyhome/idea/vim/newapi/IjVimApplication.kt:1 — `src/main/java/com/maddyhome/idea/vim/newapi/IjVimApplication.kt` (context main) and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimApplication.kt` (context vim-engine) sit in DIFFERENT parts of the tree yet change together 94% of the time (17 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are `852ea2fe` Fix(VIM-2974): Delete isOctopusEnabled() and octopus-support files; `f9f4c6b1` add modes test; `437fa9a1` Remove the root write and read actions — run `git show` on any of them.
  • Boundary-crossing change coupling: IjVimMessages.kt ↔ VimMessages.kt src/main/java/com/maddyhome/idea/vim/newapi/IjVimMessages.kt:1 — `src/main/java/com/maddyhome/idea/vim/newapi/IjVimMessages.kt` (context main) and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMessages.kt` (context vim-engine) sit in DIFFERENT parts of the tree yet change together 91% of the time (10 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `c9234b82` VIM-4175 Clear output panel before showing error; `5e20bbf1` VIM-4120 display multiple lines in OutputPanel with different styles; `76087fea` Split host and engine bundles — run `git show` on any of them.
  • Boundary-crossing change coupling: ExEditorKit.kt ↔ InsertCompletedLiteralAction.kt src/main/java/com/maddyhome/idea/vim/ui/ex/ExEditorKit.kt:1 — `src/main/java/com/maddyhome/idea/vim/ui/ex/ExEditorKit.kt` (context main) and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/insert/InsertCompletedLiteralAction.kt` (context vim-engine) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `15ae069f` Make keyHandlerState argument not null; `43b9ecdf` Get rid of Editor in KeyHandler.kt (at that commit the file was still `src/main/java/com/maddyhome/idea/vim/action/change/insert/InsertCompletedLiteralAction.kt`); `ce99c26c` Introduce ExecutionContext - abstract context holder (at that commit the file was still `src/main/java/com/maddyhome/idea/vim/action/change/insert/InsertCompletedLiteralAction.kt`) — run `git show` on any of them.
  • Boundary-crossing change coupling: ExEditorKit.kt ↔ InsertCompletedDigraphAction.kt src/main/java/com/maddyhome/idea/vim/ui/ex/ExEditorKit.kt:1 — `src/main/java/com/maddyhome/idea/vim/ui/ex/ExEditorKit.kt` (context main) and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/insert/InsertCompletedDigraphAction.kt` (context vim-engine) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `15ae069f` Make keyHandlerState argument not null; `43b9ecdf` Get rid of Editor in KeyHandler.kt (at that commit the file was still `src/main/java/com/maddyhome/idea/vim/action/change/insert/InsertCompletedDigraphAction.kt`); `ce99c26c` Introduce ExecutionContext - abstract context holder (at that commit the file was still `src/main/java/com/maddyhome/idea/vim/action/change/insert/InsertCompletedDigraphAction.kt`) — run `git show` on any of them.
  • Boundary-crossing change coupling: IjEditorExecutionContext.kt ↔ MappingInfo.kt src/main/java/com/maddyhome/idea/vim/newapi/IjEditorExecutionContext.kt:1 — `src/main/java/com/maddyhome/idea/vim/newapi/IjEditorExecutionContext.kt` (context main) and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/key/MappingInfo.kt` (context vim-engine) sit in DIFFERENT parts of the tree yet change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `b66da768` VIM-3376: Remove usages of the EditorDataContext; `47273290` VIM-3376: Get rid of IjCaretAndEditorExecutionContext; `0e96819e` Update creation of execution context — run `git show` on any of them.
  • Boundary-crossing change coupling: MacroGroup.kt ↔ InsertCompletedLiteralAction.kt src/main/java/com/maddyhome/idea/vim/group/MacroGroup.kt:1 — `src/main/java/com/maddyhome/idea/vim/group/MacroGroup.kt` (context main) and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/insert/InsertCompletedLiteralAction.kt` (context vim-engine) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `15ae069f` Make keyHandlerState argument not null; `43b9ecdf` Get rid of Editor in KeyHandler.kt (at that commit the files were still `src/main/java/com/maddyhome/idea/vim/group/MacroGroup.java` and `src/main/java/com/maddyhome/idea/vim/action/change/insert/InsertCompletedLiteralAction.kt`); `ce99c26c` Introduce ExecutionContext - abstract context holder (at that commit the files were still `src/main/java/com/maddyhome/idea/vim/group/MacroGroup.java` and `src/main/java/com/maddyhome/idea/vim/action/change/insert/InsertCompletedLiteralAction.kt`) — run `git show` on any of them.
  • Boundary-crossing change coupling: MacroGroup.kt ↔ InsertCompletedDigraphAction.kt src/main/java/com/maddyhome/idea/vim/group/MacroGroup.kt:1 — `src/main/java/com/maddyhome/idea/vim/group/MacroGroup.kt` (context main) and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/insert/InsertCompletedDigraphAction.kt` (context vim-engine) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `15ae069f` Make keyHandlerState argument not null; `43b9ecdf` Get rid of Editor in KeyHandler.kt (at that commit the files were still `src/main/java/com/maddyhome/idea/vim/group/MacroGroup.java` and `src/main/java/com/maddyhome/idea/vim/action/change/insert/InsertCompletedDigraphAction.kt`); `ce99c26c` Introduce ExecutionContext - abstract context holder (at that commit the files were still `src/main/java/com/maddyhome/idea/vim/group/MacroGroup.java` and `src/main/java/com/maddyhome/idea/vim/action/change/insert/InsertCompletedDigraphAction.kt`) — run `git show` on any of them.
D28 · Secrets (history) · REDACTED · ×4
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · High CVE · ×4
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC3 · Page structure · <html> without a lang · ×2
  • <html> without a lang ideavim-common/src/main/resources/inspectionDescriptions/UsePlug.html:9 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang ideavim-common/src/main/resources/inspectionDescriptions/UsePlugSyntax.html:9 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
AC3 · Page structure · Document without a <title> · ×2
  • Document without a <title> ideavim-common/src/main/resources/inspectionDescriptions/UsePlug.html:9 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
  • Document without a <title> ideavim-common/src/main/resources/inspectionDescriptions/UsePlugSyntax.html:9 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
AX3 · Project dependency cycles · Project dependency cycle · ×1
  • Project dependency cycle — The projects :ideavim-acejump → IdeaVIM → :ideavim-acejump (one cycle inside a mutually-dependent group of 9 projects) form a reference cycle. Cyclic dependencies prevent independent build/test/deploy, blur ownership, and tend to grow into a big ball of mud. Break the cycle by extracting the shared types into a separate project both can reference.
AX4 · Dependency direction · Dependency-rule violation · ×1
  • Dependency-rule violation: :ideavim-backend-bookmarks-core (Domain) → :api (Web) — `:ideavim-backend-bookmarks-core` is a Domain project but references `:api`, a Web project. The clean-architecture rule is that dependencies point INWARD — the domain/application core must not depend on outer layers (infrastructure/web). Invert it: define the abstraction in the inner layer and implement it in the outer one.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · Critical CVE · ×1
  • REDACTED
D5 · Coupling · Circular dependency · ×1
  • Circular dependency — :ideavim-acejump → IdeaVIM → :ideavim-acejump (one cycle inside a mutually-dependent group of 9 modules)
Serious — 684 finding(s)
D17 · Explicit Debt · TodoComment · ×275
  • TodoComment annotation-processors/src/main/kotlin/com/intellij/vim/annotations/CommandOrMotion.kt:11 — // TODO support numpad keys parsing, see :keycodes — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment annotation-processors/src/main/kotlin/com/intellij/vim/processors/VimscriptFunctionProcessor.kt:38 — // todo inspection that annotation is properly used on proper classes — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment ideavim-backend/src/main/java/com/maddyhome/idea/vim/group/process/ProcessGroup.kt:148 — // TODO: Vim will use whatever text has already been written to stdout — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/PyNotebooksCloseWorkaround.kt:24 — // TODO: Confirm context in CWM scenario — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/PluginStartup.kt:31 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/IjVimPluginActivator.kt:97 — // TODO: Consider moving this before evaluating ideavimrc, so we can react to users changing settings — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/action/VimShortcutKeyAction.kt:246 — // TODO: Should this also ignore Tab in Normal mode? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/action/change/OperatorAction.kt:37 — // todo make it multicaret — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/commentary/CommentaryExtension.kt:130 — // todo make it multicaret — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/exchange/VimExchangeExtension.kt:232 — // todo make it multicaret — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/exchange/VimExchangeExtension.kt:358 — // todo make it multicaret — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/insert/InsertAtPreviousInsertAction.kt:46 — // todo make it multicaret — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/SortCommand.kt:27 — // todo make it multicaret — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/MarkCommand.kt:32 — // todo make it multicaret — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/cursorFunctions/ColLineFunctionHandler.kt:116 — // todo make it multicaret — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/argtextobj/VimArgTextObjExtension.kt:388 — // TODO this method should use IdeaVim methods to determine if the current position is in the string — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/exchange/VimExchangeExtension.kt:179 — // TODO: handle other modes — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/exchange/VimExchangeExtension.kt:275 — // TODO handle: — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/exchange/VimExchangeExtension.kt:282 — // TODO: handle: if ident — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/exchange/VimExchangeExtension.kt:347 — // TODO: improve KeyStroke list to sting conversion — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/exchange/VimExchangeExtension.kt:372 — // TODO: handle — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/highlightedyank/VimHighlightedYank.kt:108 — // TODO: IdeaVim should help with lifecycle management here - VIM-3419
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/nerdtree/NerdTree.kt:123 — // TODO remove ex-commands — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/nerdtree/NerdTree.kt:237 — // TODO: 21.01.2021 Should open in left split — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/main/java/com/maddyhome/idea/vim/extension/nerdtree/NerdTree.kt:247 — // TODO: 21.01.2021 Should open in above split — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • + 250 more in this group — see findings.md.
R4 · Test Coverage · No test reaches this file · ×19
  • No test reaches this file scripts-ts/src/collectPropertyTestFailures.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/selectTicketForAnalysis.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/completeTicketAnalysis.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/checkNewPluginDependencies.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/updateYoutrackOnCommit.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/selectIssueWithoutArea.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/youtrack-cli/add-tag.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/youtrack-cli/get-ticket.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/youtrack-cli/search-tickets.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/youtrack-cli/remove-tag.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/youtrack-cli/add-comment.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/youtrack-cli/delete-version.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/youtrack-cli/set-area.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/youtrack-cli/get-area-values.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/setTeamCityBuildNumber.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/youtrack-cli/create-version.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/youtrack-cli/set-status.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/youtrack-cli/set-fix-version.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file scripts-ts/src/eapReleaseActions.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
AC3 · Page structure · Page without a main landmark · ×17
  • Page without a main landmark ideavim-common/src/main/resources/inspectionDescriptions/UsePlug.html:9 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark ideavim-common/src/main/resources/inspectionDescriptions/UsePlugSyntax.html:9 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.40.0.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.41.0.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.42.0.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.43.0.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.44.0.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.44.1.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.45.0.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.45.1.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.45.2.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.46.0.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.46.1.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.46.2.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.47.0.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.47.1.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark src/main/resources/whatsnew-2.47.2.html:10 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
D3 · God Classes · TooManyMethods · ×17
  • TooManyMethods: VimChangeGroupBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:63 — TooManyMethods — 97 methods. The bar is 30 methods; this is 67 over it, 3.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: IjVimEditor src/main/java/com/maddyhome/idea/vim/newapi/IjVimEditor.kt:72 — TooManyMethods — 79 methods. The bar is 30 methods; this is 49 over it, 2.63× the bar. Most of these members implement api.VimEditor (61 of 79 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member.
  • TooManyMethods: PatternVisitor vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/PatternVisitor.kt:52 — TooManyMethods — 78 methods. The bar is 30 methods; this is 48 over it, 2.60× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: VimSearchHelperBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:35 — TooManyMethods — 68 methods. The bar is 30 methods; this is 38 over it, 2.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: VimEditorWrapper vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/VimRegex.kt:611 — TooManyMethods — 59 methods. The bar is 30 methods; this is 29 over it, 1.97× the bar. Most of these members implement api.VimEditor (56 of 59 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member.
  • TooManyMethods: EditorHelper src/main/java/com/maddyhome/idea/vim/helper/EditorHelper.kt:51 — TooManyMethods — 57 methods. The bar is 30 methods; this is 27 over it, 1.90× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: MappingScopeImpl vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/MappingScopeImpl.kt:24 — TooManyMethods — 52 methods. The bar is 30 methods; this is 22 over it, 1.73× the bar. Most of these members implement scopes.MappingScope (32 of 35 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member.
  • TooManyMethods: VimMarkServiceBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMarkServiceBase.kt:38 — TooManyMethods — 48 methods. The bar is 30 methods; this is 18 over it, 1.60× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: ExEntryPanel src/main/java/com/maddyhome/idea/vim/ui/ex/ExEntryPanel.kt:74 — TooManyMethods — 46 methods. The bar is 30 methods; this is 16 over it, 1.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: VimPlugin src/main/java/com/maddyhome/idea/vim/VimPlugin.java:50 — TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: VimSearchGroupBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:56 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: VimRegisterGroupBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/register/VimRegisterGroupBase.kt:44 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: OutputPanel src/main/java/com/maddyhome/idea/vim/ui/OutputPanel.kt:90 — TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: VimMotionGroupBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMotionGroupBase.kt:37 — TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: CaretReadImpl vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/editor/caret/CaretReadImpl.kt:29 — TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. Most of these members implement caret.CaretRead (30 of 32 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member.
  • TooManyMethods: VimVariableServiceBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/services/VimVariableServiceBase.kt:42 — TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: EditorGroup src/main/java/com/maddyhome/idea/vim/group/EditorGroup.java:59 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D17 · Explicit Debt · FixmeComment · ×14
  • FixmeComment src/main/java/com/maddyhome/idea/vim/extension/nerdtree/NerdTree.kt:219 — // FIXME: 22.01.2021 Doesn't work correct — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment src/main/java/com/maddyhome/idea/vim/extension/nerdtree/NerdTree.kt:229 — // FIXME: 22.01.2021 Doesn't work correct — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment src/main/java/com/maddyhome/idea/vim/extension/nerdtree/Mappings.kt:86 — // FIXME lazy loaded tree nodes are not expanded — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment src/main/java/com/maddyhome/idea/vim/extension/nerdtree/Mappings.kt:104 — // FIXME We should avoid relying on `ide.tree.collapse.recursively` since it closes visible paths only — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment src/main/java/com/maddyhome/idea/vim/vimscript/model/options/helpers/IdeaRefactorModeHelper.kt:74 — // FIXME: 01.11.2019 Nasty workaround because of problems in IJ platform — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/KeyHandler.kt:580 — // FIXME I'm a dirty hack to support recursion counter — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/scroll/CtrlUpDownAction.kt:23 — // FIXME: 2019-07-05 Workaround to make jump through methods work — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/updown/MotionDownFirstNonSpaceAction.kt:43 — // FIXME I should not exist (see class above) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/visual/VisualSwapSelectionsAction.kt:33 — // FIXME: 2019-03-05 Make it multicaret — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimCommandLine.kt:176 — // FIXME I don't want it to conflict with Swings `requestFocus` and can suggest a better name — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/key/MappingInfo.kt:283 — // FIXME: what is the comment below about?... — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/register/VimRegisterGroupBase.kt:201 — // FIXME: so, we had invalid ranges all the time?.. I've never handled such cases — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/register/VimRegisterGroupBase.kt:380 — // FIXME why don't we collect transferable data? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/GlobalCommand.kt:30 — // FIXME: I'm such a mess, please refactor me, responsible developer — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D3 · God Classes · ClassTooLong · ×11
  • ClassTooLong: VimChangeGroupBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:63 — ClassTooLong — 1477 significant lines (blank, comment-only and punctuation-only lines excluded), 97 methods. The bar is 400 significant lines; this is 1077 over it, 3.69× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: VimSearchHelperBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:35 — ClassTooLong — 1255 significant lines (blank, comment-only and punctuation-only lines excluded), 68 methods. The bar is 400 significant lines; this is 855 over it, 3.14× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: VimSearchGroupBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:56 — ClassTooLong — 1015 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 615 over it, 2.54× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: VimStringParserBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimStringParserBase.kt:19 — ClassTooLong — 484 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 84 over it, 1.21× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: OutputPanel src/main/java/com/maddyhome/idea/vim/ui/OutputPanel.kt:90 — ClassTooLong — 476 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 76 over it, 1.19× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: TargetsExtension src/main/java/com/maddyhome/idea/vim/extension/targets/TargetsExtension.kt:38 — ClassTooLong — 447 significant lines (blank, comment-only and punctuation-only lines excluded), 4 methods. The bar is 400 significant lines; this is 47 over it, 1.12× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: VimMarkServiceBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMarkServiceBase.kt:38 — ClassTooLong — 444 significant lines (blank, comment-only and punctuation-only lines excluded), 48 methods. The bar is 400 significant lines; this is 44 over it, 1.11× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ExEntryPanel src/main/java/com/maddyhome/idea/vim/ui/ex/ExEntryPanel.kt:74 — ClassTooLong — 435 significant lines (blank, comment-only and punctuation-only lines excluded), 46 methods. The bar is 400 significant lines; this is 35 over it, 1.09× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: VimRegex vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/VimRegex.kt:50 — ClassTooLong — 420 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 20 over it, 1.05× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: VimPutBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/put/VimPutBase.kt:43 — ClassTooLong — 408 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 8 over it, 1.02× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: VimMotionGroupBase vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMotionGroupBase.kt:37 — ClassTooLong — 406 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 6 over it, 1.02× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D35 · Change Coupling · Change coupling · ×10
  • Change coupling: LetCommand.kt ↔ OptionExpression.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/LetCommand.kt:1 — `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/LetCommand.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/expressions/OptionExpression.kt` change together 91% of the time (10 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `fd1fe516` Extract indexed expression assignment; `dc5b45a5` Update OptionExpression to match Vim behaviour; `063317b0` Introduce LValueExpression, update OptionExpression — run `git show` on any of them.
  • Change coupling: ExCommandProcessor.kt ↔ VimscriptFunctionProcessor.kt annotation-processors/src/main/kotlin/com/intellij/vim/processors/ExCommandProcessor.kt:1 — `annotation-processors/src/main/kotlin/com/intellij/vim/processors/ExCommandProcessor.kt` and `annotation-processors/src/main/kotlin/com/intellij/vim/processors/VimscriptFunctionProcessor.kt` change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `b005328b` Exclude generated files from .gitignore; `93c83f77` Add generated JSON files to gitignore; `91191526` Inline the writeFile function — run `git show` on any of them.
  • Change coupling: IdeaSelectionControl.kt ↔ IdeaRefactorModeHelper.kt src/main/java/com/maddyhome/idea/vim/group/visual/IdeaSelectionControl.kt:1 — `src/main/java/com/maddyhome/idea/vim/group/visual/IdeaSelectionControl.kt` and `src/main/java/com/maddyhome/idea/vim/vimscript/model/options/helpers/IdeaRefactorModeHelper.kt` change together 69% of the time (11 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `6b7b18d9` Switch to Normal when accepting an inline rename; `aa539e76` Rename RWLockLabel to VimLockLabel and other annotations; `f88a1cbe` Add more wrappings for read actions — run `git show` on any of them.
  • Change coupling: MappingInfo.kt ↔ EditFileCommand.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/key/MappingInfo.kt:1 — `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/key/MappingInfo.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/EditFileCommand.kt` change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `560700c9` Pass editor to the execution of the action; `b66da768` VIM-3376: Remove usages of the EditorDataContext; `0e96819e` Update creation of execution context — run `git show` on any of them.
  • Change coupling: VimPutBase.kt ↔ PutLinesCommand.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/put/VimPutBase.kt:1 — `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/put/VimPutBase.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/PutLinesCommand.kt` change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `c74e7671` VIM-1025 Add control chars editor; `ad85aca8` VIM-1595 Add support for handling address 0 in `:put` command; `25e3988d` Introduce VimCopiedText class — run `git show` on any of them.
  • Change coupling: BacktrackingStrategy.kt ↔ MultiVisitor.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/engine/strategies/BacktrackingStrategy.kt:1 — `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/engine/strategies/BacktrackingStrategy.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/MultiVisitor.kt` change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `4ac98710` implement limit lookbehinds (at that commit the file was still `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/nfa/NFA.kt`); `ca94d55b` implementing negative lookbehind (at that commit the file was still `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/nfa/NFA.kt`); `4bba791c` adding comments and small cleanups (at that commit the file was still `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/nfa/NFA.kt`) — run `git show` on any of them.
  • Change coupling: EditorAccessorImpl.kt ↔ CaretReadImpl.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/editor/EditorAccessorImpl.kt:1 — `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/editor/EditorAccessorImpl.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/editor/caret/CaretReadImpl.kt` change together 52% of the time (13 of the 25 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are `c5f6b2e3` Add insert big word at cursor command line action (at that commit the file was still `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/editor/ReadImpl.kt`); `9d92ae94` Remove the suspend from functions under the read or write actions (at that commit the file was still `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/editor/ReadImpl.kt`); `02a9d284` repackage files (at that commit the file was still `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/editor/ReadImpl.kt`) — run `git show` on any of them.
  • Change coupling: CaretRead.kt ↔ EditorAccessorImpl.kt api/src/main/kotlin/com/intellij/vim/api/scopes/editor/caret/CaretRead.kt:1 — `api/src/main/kotlin/com/intellij/vim/api/scopes/editor/caret/CaretRead.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/editor/EditorAccessorImpl.kt` change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `c5f6b2e3` Add insert big word at cursor command line action (at that commit the file was still `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/editor/ReadImpl.kt`); `9d92ae94` Remove the suspend from functions under the read or write actions (at that commit the file was still `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/editor/ReadImpl.kt`); `9a79cdc3` add functions from vim search helper (at that commit the files were still `api/src/main/kotlin/com/intellij/vim/api/scopes/caret/CaretRead.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/ReadImpl.kt`) — run `git show` on any of them.
  • Change coupling: VimPluginToggleAction.kt ↔ StatusBar.kt src/main/java/com/maddyhome/idea/vim/action/VimPluginToggleAction.kt:1 — `src/main/java/com/maddyhome/idea/vim/action/VimPluginToggleAction.kt` and `src/main/java/com/maddyhome/idea/vim/ui/StatusBar.kt` change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `58a8b96c` Revert "Stop IdeaVim actions flowing into JB Client"; `bd192561` Stop IdeaVim actions flowing into JB Client; `6711f1db` Specify update thread for actions — run `git show` on any of them.
  • Change coupling: LongRunning.kt ↔ TestingBuildType.kt .teamcity/_Self/buildTypes/LongRunning.kt:1 — `.teamcity/_Self/buildTypes/LongRunning.kt` and `.teamcity/_Self/buildTypes/TestingBuildType.kt` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `2cb5e5b6` VIM-4234 Rollback to java 21; `4225b32f` Update java to version 25; `19354440` Remove clean task from TeamCity builds to enable Gradle caching — run `git show` on any of them.
D17 · Explicit Debt · XxxComment · ×9
  • XxxComment src/main/java/com/maddyhome/idea/vim/extension/surround/VimSurroundExtension.kt:351 — // XXX: Will it work with line-wise or block-wise selections? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • XxxComment src/main/java/com/maddyhome/idea/vim/helper/Helper.kt:41 — // XXX: I've disabled this check to find the stack trace where the project is disposed — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • XxxComment src/main/java/com/maddyhome/idea/vim/ui/ReloadVimRc.kt:154 — // XXX: I believe the proper solution would be to get rid of this if branch and update the action when — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • XxxComment src/main/java/com/maddyhome/idea/vim/ui/ReloadVimRc.kt:161 — // XXX: Actually, it worth to add e.presentation.description, but it doesn't work because of some reason — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • XxxComment src/main/java/com/maddyhome/idea/vim/ui/ex/ExEntryPanelService.kt:62 — // XXX: The Ex entry panel is used only for UI here, its logic might be inappropriate for input() — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • XxxComment src/test/java/org/jetbrains/plugins/ideavim/action/CopyActionTest.kt:228 — // XXX: — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • XxxComment src/test/java/org/jetbrains/plugins/ideavim/ex/implementation/functions/cursorFunctions/ColFunctionTest.kt:15 — // XXX virtualedit is not tested — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • XxxComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/MappingScopeImpl.kt:279 — // XXX: It's not OK to call runBlocking, but let's keep it to have an API. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • XxxComment vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/cursorFunctions/ColLineFunctionHandler.kt:57 — // XXX Should we also check the current mode? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D29 · Static Analysis (SAST) · REDACTED · ×9
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D3 · God Classes · FileTooLong · ×7
  • FileTooLong: api/VimChangeGroupBase.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt — FileTooLong — 1529 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: VimChangeGroupBase (63-2593). The bar is 500 significant lines; this is 1029 over it, 3.06× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: api/VimSearchHelperBase.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt — FileTooLong — 1277 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: VimSearchHelperBase (35-2050). The bar is 500 significant lines; this is 777 over it, 2.55× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: api/VimSearchGroupBase.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt — FileTooLong — 1052 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: VimSearchGroupBase (56-1632). The bar is 500 significant lines; this is 552 over it, 2.10× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: listener/VimListenerManager.kt src/main/java/com/maddyhome/idea/vim/listener/VimListenerManager.kt — FileTooLong — 731 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 231 over it, 1.46× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: api/VimOptionGroupBase.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimOptionGroupBase.kt — FileTooLong — 657 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 157 over it, 1.31× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: group/OptionGroup.kt src/main/java/com/maddyhome/idea/vim/group/OptionGroup.kt — FileTooLong — 616 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 116 over it, 1.23× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: ui/OutputPanel.kt src/main/java/com/maddyhome/idea/vim/ui/OutputPanel.kt — FileTooLong — 576 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: OutputPanel (90-930). The bar is 500 significant lines; this is 76 over it, 1.15× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
D15 · Churn × Complexity Hotspots · Hotspot · ×6
  • Hotspot: vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:1186 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in VimSearchGroupBase.parseSubstituteCommand at line 1186. 2 of those changes were fix/bug commits, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 11:11:46 +02:00' --until='2026-10-23 11:11:46 +02:00' --full-history --no-merges -- vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMotionGroupBase.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMotionGroupBase.kt:432 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMotionGroupBase.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in VimMotionGroupBase.getMotionRange at line 432. 3 of those changes were fix/bug commits, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 11:11:46 +02:00' --until='2026-10-23 11:11:46 +02:00' --full-history --no-merges -- vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMotionGroupBase.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: vim-engine/src/main/kotlin/com/maddyhome/idea/vim/register/VimRegisterGroupBase.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/register/VimRegisterGroupBase.kt:174 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/register/VimRegisterGroupBase.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in VimRegisterGroupBase.storeTextInternal at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 11:11:46 +02:00' --until='2026-10-23 11:11:46 +02:00' --full-history --no-merges -- vim-engine/src/main/kotlin/com/maddyhome/idea/vim/register/VimRegisterGroupBase.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/main/java/com/maddyhome/idea/vim/helper/SearchHighlightsHelper.kt src/main/java/com/maddyhome/idea/vim/helper/SearchHighlightsHelper.kt:123 — src/main/java/com/maddyhome/idea/vim/helper/SearchHighlightsHelper.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in SearchHighlightsHelperKt.updateSearchHighlights at line 123. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 11:11:46 +02:00' --until='2026-10-23 11:11:46 +02:00' --full-history --no-merges -- src/main/java/com/maddyhome/idea/vim/helper/SearchHighlightsHelper.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/FunctionCommand.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/FunctionCommand.kt:106 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/FunctionCommand.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in FunctionCommand.processCommand at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 11:11:46 +02:00' --until='2026-10-23 11:11:46 +02:00' --full-history --no-merges -- vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/FunctionCommand.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/main/java/com/maddyhome/idea/vim/listener/IdeaSpecifics.kt src/main/java/com/maddyhome/idea/vim/listener/IdeaSpecifics.kt:101 — src/main/java/com/maddyhome/idea/vim/listener/IdeaSpecifics.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in VimActionListener.beforeActionPerformed at line 101. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-25 11:11:46 +02:00' --until='2026-10-23 11:11:46 +02:00' --full-history --no-merges -- src/main/java/com/maddyhome/idea/vim/listener/IdeaSpecifics.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×6
  • Duplicated block (5 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/PatternVisitor.kt:194 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/PatternVisitor.kt:194-198 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/PatternVisitor.kt:202-206 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/PatternVisitor.kt:194` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/parser/visitors/CommandVisitor.kt:236 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/parser/visitors/CommandVisitor.kt:236-240 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/parser/visitors/CommandVisitor.kt:244-248 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/parser/visitors/CommandVisitor.kt:236` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (5 lines × 2) src/main/java/com/maddyhome/idea/vim/extension/VimExtensionRegistrar.kt:94 — src/main/java/com/maddyhome/idea/vim/extension/VimExtensionRegistrar.kt:94-98 | src/main/java/com/maddyhome/idea/vim/thinapi/IjExtensionLoader.kt:49-53 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/insert/InsertFilePathCompletionAction.kt:53 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/insert/InsertFilePathCompletionAction.kt:53-57 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/insert/InsertLineCompletionAction.kt:54-58 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/datatypes/VimDictionary.kt:118 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/datatypes/VimDictionary.kt:118-122 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/datatypes/VimList.kt:152-156 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (5 lines × 2) src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:20 — src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:20-24 | src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:104-108 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:20` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×6
  • Swallowed exception (caught, then discarded) ideavim-backend-bookmarks/src/main/java/com/maddyhome/idea/vim/group/bookmark/BookmarkRemoteApiProvider.kt:43 — `catch (_: Throwable)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) ideavim-backend/src/main/java/com/maddyhome/idea/vim/group/process/ProcessGroup.kt:49 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) src/main/java/com/maddyhome/idea/vim/group/IjFileGroup.kt:182 — `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:93 — `catch (e: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:156 — `catch (e: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/Command.kt:370 — `catch (_: Throwable)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×5
  • Duplicated block (9 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/updown/MotionGotoLineLastEndAction.kt:48 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/updown/MotionGotoLineLastEndAction.kt:48-56 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/updown/MotionGotoLineLastEndAction.kt:76-84 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (9 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/PatternVisitor.kt:210 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/PatternVisitor.kt:210-218 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/PatternVisitor.kt:222-230 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/PatternVisitor.kt:210` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) src/main/java/com/maddyhome/idea/vim/extension/classtextobj/ClassTextObjectHandler.kt:46 — src/main/java/com/maddyhome/idea/vim/extension/classtextobj/ClassTextObjectHandler.kt:46-54 | src/main/java/com/maddyhome/idea/vim/extension/functextobj/FuncTextObjectHandler.kt:48-56 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (9 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/SearchGroup.kt:567 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/SearchGroup.kt:567-575 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/StringUtil.kt:94-102 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (9 lines × 2) src/main/java/com/maddyhome/idea/vim/extension/nerdtree/NerdTree.kt:208 — src/main/java/com/maddyhome/idea/vim/extension/nerdtree/NerdTree.kt:208-216 | src/main/java/com/maddyhome/idea/vim/extension/nerdtree/NerdTree.kt:228-239 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/java/com/maddyhome/idea/vim/extension/nerdtree/NerdTree.kt:208` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D3 · God Classes · MethodTooLong · ×4
  • MethodTooLong: VimStringParserBase.parseVimScriptString vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimStringParserBase.kt:317 — MethodTooLong — parseVimScriptString runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: VimSearchGroupBase.parseSubstituteCommand vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:1186 — MethodTooLong — parseSubstituteCommand runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: Companion.createPanel src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/ModeWidgetPopup.kt:144 — MethodTooLong — createPanel runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: DigraphSequence.processKey vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/DigraphSequence.kt:51 — MethodTooLong — processKey runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D36 · Supply-chain Provenance & Signing REDACTED · ×4
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×4
  • Duplicated block (10 lines × 2) src/main/java/com/maddyhome/idea/vim/action/editor/VimEditorActions.kt:53 — src/main/java/com/maddyhome/idea/vim/action/editor/VimEditorActions.kt:53-62 | src/main/java/com/maddyhome/idea/vim/action/editor/VimEditorActions.kt:111-120 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (10 lines × 2) src/main/java/com/maddyhome/idea/vim/extension/classtextobj/ClassTextObjectHandler.kt:35 — src/main/java/com/maddyhome/idea/vim/extension/classtextobj/ClassTextObjectHandler.kt:35-44 | src/main/java/com/maddyhome/idea/vim/extension/functextobj/FuncTextObjectHandler.kt:37-46 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/java/com/maddyhome/idea/vim/extension/classtextobj/ClassTextObjectHandler.kt:35` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/select/motion/SelectMotionArrowLeftAction.kt:47 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/select/motion/SelectMotionArrowLeftAction.kt:47-56 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/select/motion/SelectMotionArrowRightAction.kt:47-56 — before extracting anything, compare `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/select/motion/SelectMotionArrowLeftAction.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/select/motion/SelectMotionArrowRightAction.kt` as WHOLE FILES: 83% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/select/motion/SelectMotionArrowLeftAction.kt:47` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/parser/visitors/ExpressionVisitor.kt:439 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/parser/visitors/ExpressionVisitor.kt:439-448 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/parser/visitors/ExpressionVisitor.kt:455-464 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/parser/visitors/ExpressionVisitor.kt:439` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×4
  • Duplicated block (8 lines × 2) scripts/src/main/kotlin/scripts/youtrack.kt:84 — scripts/src/main/kotlin/scripts/youtrack.kt:84-91 | scripts/src/main/kotlin/scripts/youtrack.kt:211-218 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `scripts/src/main/kotlin/scripts/youtrack.kt:84` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (8 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/change/ChangeVisualLinesEndAction.kt:52 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/change/ChangeVisualLinesEndAction.kt:52-59 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/delete/DeleteVisualLinesEndAction.kt:51-58 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (8 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:949 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:949-956 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:995-1002 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/mapping/MapCommand.kt:226 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/mapping/MapCommand.kt:226-233 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/mapping/ParseMapCommandArguments.kt:87-94 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/mapping/MapCommand.kt:226` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
X2 · Cancellation propagation · Async function without AbortSignal · ×4
  • Async function without AbortSignal: getGitHubAuthorInfo scripts-ts/src/updateAuthors.ts:74 — `getGitHubAuthorInfo` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: getPluginLinkByXmlId scripts-ts/src/checkNewPluginDependencies.ts:51 — `getPluginLinkByXmlId` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: downloadAttachment scripts-ts/src/tools/youtrack.ts:231 — `downloadAttachment` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: tcGet scripts-ts/src/tools/teamcity.ts:37 — `tcGet` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
D29 · Static Analysis (SAST) · REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×3
  • Duplicated block (12 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/StringUtil.kt:45 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/StringUtil.kt:45-56 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/StringUtil.kt:74-85 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/StringUtil.kt:45` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (12 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/mapping/MapCommand.kt:204 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/mapping/MapCommand.kt:204-215 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/mapping/ParseMapCommandArguments.kt:73-84 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/mapping/MapCommand.kt:204` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (12 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/collectionFunctions/MaxFunctionHandler.kt:31 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/collectionFunctions/MaxFunctionHandler.kt:31-42 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/collectionFunctions/MinFunctionHandler.kt:31-42 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/collectionFunctions/MaxFunctionHandler.kt:31` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×3
  • Duplicated block (11 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/copy/YankVisualAction.kt:36 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/copy/YankVisualAction.kt:36-46 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/copy/YankVisualLinesAction.kt:46-56 — before extracting anything, compare `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/copy/YankVisualAction.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/copy/YankVisualLinesAction.kt` as WHOLE FILES: 90% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/updown/MotionShiftDownAction.kt:36 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/updown/MotionShiftDownAction.kt:36-46 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/updown/MotionShiftUpAction.kt:36-46 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/updown/MotionShiftDownAction.kt:36` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) scripts/src/main/kotlin/scripts/youtrack.kt:64 — scripts/src/main/kotlin/scripts/youtrack.kt:64-75 | scripts/src/main/kotlin/scripts/youtrack.kt:192-202 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `scripts/src/main/kotlin/scripts/youtrack.kt:64` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D6 · Cohesion (LCOM4) · Low cohesion · ×3
  • Low cohesion: VimMotionGroupBase (LCOM4 14) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMotionGroupBase.kt:37 — VimMotionGroupBase's methods fall into 14 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 14 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: VimSettingsPanel (LCOM4 6) src/main/java/com/maddyhome/idea/vim/ui/VimEmulationConfigurable.kt:145 — VimSettingsPanel's methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: VimChangeGroupBase (LCOM4 5) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:63 — VimChangeGroupBase's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×3
  • Sync-over-async blocking scripts-ts/src/tools/youtrack.ts:251 — `writeFileSync` in `downloadAttachment` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking scripts-ts/src/updateAuthors.ts:289 — `readFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking scripts-ts/src/updateAuthors.ts:297 — `writeFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
R10 · Code Duplication · Duplicated block (9 lines × 2 locations) · ×3
  • Duplicated block (9 lines × 2 locations) scripts-ts/src/syncChangelogToMaster.ts:103 — scripts-ts/src/syncChangelogToMaster.ts:103 · scripts-ts/src/syncChangelogToMaster.ts:119 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (9 lines × 2 locations) scripts-ts/src/tools/youtrack.ts:92 — scripts-ts/src/tools/youtrack.ts:92 · scripts-ts/src/tools/youtrack.ts:499 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2 locations) scripts-ts/src/updateAuthors.ts:115 — scripts-ts/src/updateAuthors.ts:115 · scripts-ts/src/updateAuthors.ts:125 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D35 · Change Coupling · Change-coupling hub · ×2
  • Change-coupling hub: ThinApi.kt → VimApiImpl.kt, EditorAccessorImpl.kt, TransactionImpl.kt vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/ThinApi.kt — `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/ThinApi.kt` changes together with 3 other files — `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/VimApiImpl.kt`, `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/editor/EditorAccessorImpl.kt`, `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/editor/TransactionImpl.kt` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
  • Change-coupling hub: PropertyBased.kt → LongRunning.kt, Nvim.kt, TestingBuildType.kt .teamcity/_Self/buildTypes/PropertyBased.kt — `.teamcity/_Self/buildTypes/PropertyBased.kt` changes together with 3 other files — `.teamcity/_Self/buildTypes/LongRunning.kt`, `.teamcity/_Self/buildTypes/Nvim.kt`, `.teamcity/_Self/buildTypes/TestingBuildType.kt` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
D36 · Supply-chain Provenance & Signing REDACTED · ×2
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×2
  • Duplicated block (18 lines × 2) src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:84 — src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:84-101 | src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:147-164 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:84` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (18 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:63 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:63-80 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:110-127 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:63` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:82` calls `TODO` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:128` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×2
  • Duplicated block (17 lines × 2) scripts/src/main/kotlin/scripts/help/generateHelp.kt:213 — scripts/src/main/kotlin/scripts/help/generateHelp.kt:213-229 | src/main/java/com/maddyhome/idea/vim/vimscript/model/commands/HelpCommand.kt:118-134 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `scripts/src/main/kotlin/scripts/help/generateHelp.kt:213` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (17 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimKeyGroupBase.kt:94 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimKeyGroupBase.kt:94-110 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimKeyGroupBase.kt:121-137 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimKeyGroupBase.kt:94` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×2
  • Duplicated block (10–11 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/insert/InsertCompletedDigraphAction.kt:85 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/insert/InsertCompletedDigraphAction.kt:85-94 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/insert/InsertCompletedLiteralAction.kt:89-99 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (10–11 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1099 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1099-1108 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1234-1244 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1099` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×2
  • Duplicated block (7 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/handler/MotionActionHandler.kt:174 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/handler/MotionActionHandler.kt:174-180 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/handler/MotionActionHandler.kt:229-235 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/handler/MotionActionHandler.kt:174` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) src/main/java/com/maddyhome/idea/vim/ui/OutputPanel.kt:735 — src/main/java/com/maddyhome/idea/vim/ui/OutputPanel.kt:735-741 | src/main/java/com/maddyhome/idea/vim/ui/OutputPanel.kt:767-773 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×2
  • Duplicated block (6 lines × 2) src/main/java/com/maddyhome/idea/vim/extension/miniai/MiniAI.kt:62 — src/main/java/com/maddyhome/idea/vim/extension/miniai/MiniAI.kt:62-67 | src/main/java/com/maddyhome/idea/vim/extension/miniai/MiniAI.kt:119-124 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) src/main/java/com/maddyhome/idea/vim/group/WindowGroup.java:57 — src/main/java/com/maddyhome/idea/vim/group/WindowGroup.java:57-62 | src/main/java/com/maddyhome/idea/vim/group/WindowGroup.java:198-203 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/main/java/com/maddyhome/idea/vim/group/WindowGroup.java:57` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
R10 · Code Duplication · Duplicated block (11 lines × 2 locations) · ×2
  • Duplicated block (11 lines × 2 locations) scripts-ts/src/tools/youtrack.ts:110 — scripts-ts/src/tools/youtrack.ts:110 · scripts-ts/src/tools/youtrack.ts:127 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (11 lines × 2 locations) scripts-ts/src/updateAuthors.ts:40 — scripts-ts/src/updateAuthors.ts:40 · scripts-ts/src/updateYoutrackOnCommit.ts:22 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (8 lines × 2 locations) · ×2
  • Duplicated block (8 lines × 2 locations) scripts-ts/src/collectPropertyTestFailures.ts:82 — scripts-ts/src/collectPropertyTestFailures.ts:82 · scripts-ts/src/updateAuthors.ts:230 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
  • Duplicated block (8 lines × 2 locations) scripts-ts/src/selectTicketForAnalysis.ts:16 — scripts-ts/src/selectTicketForAnalysis.ts:16 · scripts-ts/src/updateAuthors.ts:230 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
X3 · Exception handling · Swallowed exception (empty catch) · ×2
  • Swallowed exception (empty catch) scripts-ts/src/buildWhatsNewSite.ts:297 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) src/main/java/com/maddyhome/idea/vim/helper/HandlerInjector.kt:43 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
AC7 · A11y enforcement · Accessibility enforcement below the top rung · ×1
  • Accessibility enforcement below the top rung — No accessibility enforcement found — no accessibility linting at author time and no automated accessibility check in tests or CI. Add your UI toolkit's own accessibility assertion to the test suite (Flutter `meetsGuideline`, Espresso `AccessibilityChecks`, XCTest `performAccessibilityAudit`), then gate that test in the pipeline. What was searched, so you can tell an absence from a miss: the 17 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
D1 · Cyclomatic Complexity · GraphemesKt.classify (cyclomatic 92) · ×1
  • GraphemesKt.classify (cyclomatic 92) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/Graphemes.kt:220 — GraphemesKt.classify has cyclomatic complexity 92 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · VimSearchHelperBase.findSentenceRangeEnd (cyclomatic 63) · ×1
  • VimSearchHelperBase.findSentenceRangeEnd (cyclomatic 63) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1249 — VimSearchHelperBase.findSentenceRangeEnd has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimSearchGroupBase.parseSubstituteCommand (cyclomatic 58) · ×1
  • VimSearchGroupBase.parseSubstituteCommand (cyclomatic 58) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:1186 — VimSearchGroupBase.parseSubstituteCommand has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimSearchHelperBase.findSentenceEnd (cyclomatic 43) · ×1
  • VimSearchHelperBase.findSentenceEnd (cyclomatic 43) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1117 — VimSearchHelperBase.findSentenceEnd has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimStringParserBase.parseVimScriptString (cyclomatic 43) · ×1
  • VimStringParserBase.parseVimScriptString (cyclomatic 43) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimStringParserBase.kt:317 — VimStringParserBase.parseVimScriptString has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: VimStringParserBase.getVimKeyName (cyclomatic 63) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · DigraphSequence.processKey (cyclomatic 43) · ×1
  • DigraphSequence.processKey (cyclomatic 43) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/DigraphSequence.kt:51 — DigraphSequence.processKey has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimSearchHelperBase.findWordObject (cyclomatic 40) · ×1
  • VimSearchHelperBase.findWordObject (cyclomatic 40) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1663 — VimSearchHelperBase.findWordObject has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · UtilKt.getModeBackground (cyclomatic 40) · ×1
  • UtilKt.getModeBackground (cyclomatic 40) src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:19 — UtilKt.getModeBackground has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · IndentObjectHandler.getRange (cyclomatic 38) · ×1
  • IndentObjectHandler.getRange (cyclomatic 38) src/main/java/com/maddyhome/idea/vim/extension/textobjindent/VimIndentObject.kt:99 — IndentObjectHandler.getRange has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimSearchGroupBase.findItOffset (cyclomatic 35) · ×1
  • VimSearchGroupBase.findItOffset (cyclomatic 35) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:1477 — VimSearchGroupBase.findItOffset has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimSearchHelperBase.findSentenceStart (cyclomatic 34) · ×1
  • VimSearchHelperBase.findSentenceStart (cyclomatic 34) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1034 — VimSearchHelperBase.findSentenceStart has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GraphemesKt.nextBoundary (cyclomatic 30) · ×1
  • GraphemesKt.nextBoundary (cyclomatic 30) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/Graphemes.kt:82 — GraphemesKt.nextBoundary has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimRegex.buildSubstituteString (cyclomatic 30) · ×1
  • VimRegex.buildSubstituteString (cyclomatic 30) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/VimRegex.kt:391 — VimRegex.buildSubstituteString has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · SetCommandKt.parseOptionLine (cyclomatic 30) · ×1
  • SetCommandKt.parseOptionLine (cyclomatic 30) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/SetCommand.kt:109 — SetCommandKt.parseOptionLine has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · OutputPanel.handleHitEnterPrompt (cyclomatic 30) · ×1
  • OutputPanel.handleHitEnterPrompt (cyclomatic 30) src/main/java/com/maddyhome/idea/vim/ui/OutputPanel.kt:702 — OutputPanel.handleHitEnterPrompt has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · VimChangeGroupBase.findNumberInText (cyclomatic 28) · ×1
  • VimChangeGroupBase.findNumberInText (cyclomatic 28) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:2163 — VimChangeGroupBase.findNumberInText has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimMotionGroupBase.getMotionRange (cyclomatic 28) · ×1
  • VimMotionGroupBase.getMotionRange (cyclomatic 28) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMotionGroupBase.kt:432 — VimMotionGroupBase.getMotionRange has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimRegisterGroupBase.storeTextInternal (cyclomatic 28) · ×1
  • VimRegisterGroupBase.storeTextInternal (cyclomatic 28) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/register/VimRegisterGroupBase.kt:174 — VimRegisterGroupBase.storeTextInternal has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimShortcutKeyAction.isEnabled (cyclomatic 28) · ×1
  • VimShortcutKeyAction.isEnabled (cyclomatic 28) src/main/java/com/maddyhome/idea/vim/action/VimShortcutKeyAction.kt:183 — VimShortcutKeyAction.isEnabled has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · VimChangeGroupBase.changeNumberInRange (cyclomatic 27) · ×1
  • VimChangeGroupBase.changeNumberInRange (cyclomatic 27) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:1977 — VimChangeGroupBase.changeNumberInRange has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FunctionCommand.processCommand (cyclomatic 26) · ×1
  • FunctionCommand.processCommand (cyclomatic 26) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/FunctionCommand.kt:106 — FunctionCommand.processCommand has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimPutBase.prepareDocumentAndGetStartOffsets (cyclomatic 25) · ×1
  • VimPutBase.prepareDocumentAndGetStartOffsets (cyclomatic 25) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/put/VimPutBase.kt:409 — VimPutBase.prepareDocumentAndGetStartOffsets has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · UtilKt.getModeForeground (cyclomatic 25) · ×1
  • UtilKt.getModeForeground (cyclomatic 25) src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:103 — UtilKt.getModeForeground has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · MapFilterFunctionHandlerBase.doFunction (cyclomatic 24) · ×1
  • MapFilterFunctionHandlerBase.doFunction (cyclomatic 24) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/collectionFunctions/MapFunctionHandlers.kt:120 — MapFilterFunctionHandlerBase.doFunction has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CollectionElementVisitor.cleanLiteralChar (cyclomatic 23) · ×1
  • CollectionElementVisitor.cleanLiteralChar (cyclomatic 23) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/CollectionElementVisitor.kt:118 — CollectionElementVisitor.cleanLiteralChar has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · ColLineFunctionHandlerKt.variableToPosition (cyclomatic 22) · ×1
  • ColLineFunctionHandlerKt.variableToPosition (cyclomatic 22) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/cursorFunctions/ColLineFunctionHandler.kt:67 — ColLineFunctionHandlerKt.variableToPosition has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimTemplateManagerListener.templateStarted (cyclomatic 22) · ×1
  • VimTemplateManagerListener.templateStarted (cyclomatic 22) src/main/java/com/maddyhome/idea/vim/listener/IdeaSpecifics.kt:406 — VimTemplateManagerListener.templateStarted has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SearchGroupKt.findBlockRange (cyclomatic 21) · ×1
  • SearchGroupKt.findBlockRange (cyclomatic 21) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/SearchGroup.kt:353 — SearchGroupKt.findBlockRange has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimSearchHelperBase.findPattern (cyclomatic 20) · ×1
  • VimSearchHelperBase.findPattern (cyclomatic 20) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:271 — VimSearchHelperBase.findPattern has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · MotionGroup.getMotionRange2 (cyclomatic 20) · ×1
  • MotionGroup.getMotionRange2 (cyclomatic 20) src/main/java/com/maddyhome/idea/vim/group/MotionGroup.kt:218 — MotionGroup.getMotionRange2 has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimSearchHelperBase.findBlockTagRange (cyclomatic 19) · ×1
  • VimSearchHelperBase.findBlockTagRange (cyclomatic 19) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1851 — VimSearchHelperBase.findBlockTagRange has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimStringParserBase.parseKeys (cyclomatic 19) · ×1
  • VimStringParserBase.parseKeys (cyclomatic 19) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimStringParserBase.kt:108 — VimStringParserBase.parseKeys has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: VimStringParserBase.getVimKeyName (cyclomatic 63) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · ModesKt.toMode (cyclomatic 19) · ×1
  • ModesKt.toMode (cyclomatic 19) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/Modes.kt:14 — ModesKt.toMode has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: ModesKt.toEngineMode (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · VimVariableServiceBase.convertToKotlinType (cyclomatic 19) · ×1
  • VimVariableServiceBase.convertToKotlinType (cyclomatic 19) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/services/VimVariableServiceBase.kt:301 — VimVariableServiceBase.convertToKotlinType has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimActionListener.beforeActionPerformed (cyclomatic 19) · ×1
  • VimActionListener.beforeActionPerformed (cyclomatic 19) src/main/java/com/maddyhome/idea/vim/listener/IdeaSpecifics.kt:101 — VimActionListener.beforeActionPerformed has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · BracketNormalizer.normalize (cyclomatic 18) · ×1
  • BracketNormalizer.normalize (cyclomatic 18) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/BracketNormalizer.kt:42 — BracketNormalizer.normalize has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · HistoryCommand.processCommand (cyclomatic 18) · ×1
  • HistoryCommand.processCommand (cyclomatic 18) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/HistoryCommand.kt:35 — HistoryCommand.processCommand has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · TabCloseCommand.getTabIndexToClose (cyclomatic 18) · ×1
  • TabCloseCommand.getTabIndexToClose (cyclomatic 18) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/TabCloseCommand.kt:64 — TabCloseCommand.getTabIndexToClose has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CamelCaseMotionKt.isSubWordStart (cyclomatic 18) · ×1
  • CamelCaseMotionKt.isSubWordStart (cyclomatic 18) src/main/java/com/maddyhome/idea/vim/extension/camelcasemotion/CamelCaseMotion.kt:194 — CamelCaseMotionKt.isSubWordStart has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · VimChangeGroupBase.indentRange (cyclomatic 17) · ×1
  • VimChangeGroupBase.indentRange (cyclomatic 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:2407 — VimChangeGroupBase.indentRange has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimSearchGroupBase.runSubstitute (cyclomatic 17) · ×1
  • VimSearchGroupBase.runSubstitute (cyclomatic 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:642 — VimSearchGroupBase.runSubstitute has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SearchGroupKt.findBlock (cyclomatic 17) · ×1
  • SearchGroupKt.findBlock (cyclomatic 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/SearchGroup.kt:450 — SearchGroupKt.findBlock has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimPutBase.moveCaretToEndPosition (cyclomatic 17) · ×1
  • VimPutBase.moveCaretToEndPosition (cyclomatic 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/put/VimPutBase.kt:171 — VimPutBase.moveCaretToEndPosition has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · BracketNormalizer.findCollectionEnd (cyclomatic 17) · ×1
  • BracketNormalizer.findCollectionEnd (cyclomatic 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/BracketNormalizer.kt:127 — BracketNormalizer.findCollectionEnd has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · DefinedFunctionHandler.executeFunctionBody (cyclomatic 17) · ×1
  • DefinedFunctionHandler.executeFunctionBody (cyclomatic 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/DefinedFunctionHandler.kt:73 — DefinedFunctionHandler.executeFunctionBody has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · SortUniqFunctionHandlerBase.doFunction (cyclomatic 17) · ×1
  • SortUniqFunctionHandlerBase.doFunction (cyclomatic 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/listFunctions/SortUniqFunctionHandlers.kt:53 — SortUniqFunctionHandlerBase.doFunction has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · IjVimPluginActivator.updateState (cyclomatic 17) · ×1
  • IjVimPluginActivator.updateState (cyclomatic 17) src/main/java/com/maddyhome/idea/vim/IjVimPluginActivator.kt:141 — IjVimPluginActivator.updateState has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Operator.compareExchanges (cyclomatic 17) · ×1
  • Operator.compareExchanges (cyclomatic 17) src/main/java/com/maddyhome/idea/vim/extension/exchange/VimExchangeExtension.kt:292 — Operator.compareExchanges has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · VimScriptExecutorBase.execute (cyclomatic 16) · ×1
  • VimScriptExecutorBase.execute (cyclomatic 16) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimScriptExecutorBase.kt:34 — VimScriptExecutorBase.execute has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VimSearchHelperBase.findNextSentenceEnd (cyclomatic 16) · ×1
  • VimSearchHelperBase.findNextSentenceEnd (cyclomatic 16) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:988 — VimSearchHelperBase.findNextSentenceEnd has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · SetCommandKt.showOptions (cyclomatic 16) · ×1
  • SetCommandKt.showOptions (cyclomatic 16) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/SetCommand.kt:230 — SetCommandKt.showOptions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · AssignmentOperator.validateValues (cyclomatic 16) · ×1
  • AssignmentOperator.validateValues (cyclomatic 16) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/expressions/operators/AssignmentOperator.kt:81 — AssignmentOperator.validateValues has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · ForLoop.execute (cyclomatic 16) · ×1
  • ForLoop.execute (cyclomatic 16) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:32 — ForLoop.execute has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FileTypePatterns.getMatchitPatterns (cyclomatic 16) · ×1
  • FileTypePatterns.getMatchitPatterns (cyclomatic 16) src/main/java/com/maddyhome/idea/vim/extension/matchit/Matchit.kt:264 — FileTypePatterns.getMatchitPatterns has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D17 · Explicit Debt · HackComment · ×1
  • HackComment src/main/java/com/maddyhome/idea/vim/helper/PsiHelper.java:92 — // HACK: for Java classes and methods, we want to jump to the opening brace — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
D17 · Explicit Debt · TodoComment repeated across 11 files · ×1
  • TodoComment repeated across 11 files src/test/java/org/jetbrains/plugins/ideavim/ex/implementation/functions/mappingFunctions/MapSetFunctionTest.kt:129 — The identical TodoComment appears in 11 files (13 occurrences) — almost certainly one boilerplate line from a single migration or decision, not 13 independent debts. Fix the systemic cause once rather than file-by-file. Text: "// TODO: IdeaVim should support abbreviations". Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)
D2 · Cognitive Complexity · VimStringParserBase.parseVimScriptString (cognitive 110) · ×1
  • VimStringParserBase.parseVimScriptString (cognitive 110) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimStringParserBase.kt:317 — VimStringParserBase.parseVimScriptString has cognitive complexity 110 (threshold 15). Drivers by points: if/else 47 (105 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 59). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · VimSearchHelperBase.findSentenceEnd (cognitive 102) · ×1
  • VimSearchHelperBase.findSentenceEnd (cognitive 102) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1117 — VimSearchHelperBase.findSentenceEnd has cognitive complexity 102 (threshold 15). Drivers by points: if/else 27 (73 pts), boolean chains 16, loops 4 (13 pts) (nesting depth added 55). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · VimSearchHelperBase.findSentenceRangeEnd (cognitive 102) · ×1
  • VimSearchHelperBase.findSentenceRangeEnd (cognitive 102) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1249 — VimSearchHelperBase.findSentenceRangeEnd has cognitive complexity 102 (threshold 15). Drivers by points: if/else 44 (73 pts), boolean chains 28, loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchGroupBase.parseSubstituteCommand (cognitive 92) · ×1
  • VimSearchGroupBase.parseSubstituteCommand (cognitive 92) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:1186 — VimSearchGroupBase.parseSubstituteCommand has cognitive complexity 92 (threshold 15). Drivers by points: if/else 41 (71 pts), boolean chains 12, loops 4 (6 pts), match/switch 2 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IndentObjectHandler.getRange (cognitive 68) · ×1
  • IndentObjectHandler.getRange (cognitive 68) src/main/java/com/maddyhome/idea/vim/extension/textobjindent/VimIndentObject.kt:99 — IndentObjectHandler.getRange has cognitive complexity 68 (threshold 15). Drivers by points: if/else 22 (43 pts), loops 11 (17 pts), boolean chains 8 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchGroupBase.findItOffset (cognitive 67) · ×1
  • VimSearchGroupBase.findItOffset (cognitive 67) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:1477 — VimSearchGroupBase.findItOffset has cognitive complexity 67 (threshold 15). Drivers by points: if/else 35 (61 pts), boolean chains 5, match/switch 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchHelperBase.findWordObject (cognitive 59) · ×1
  • VimSearchHelperBase.findWordObject (cognitive 59) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1663 — VimSearchHelperBase.findWordObject has cognitive complexity 59 (threshold 15). Drivers by points: if/else 22 (35 pts), boolean chains 18, loops 2 (5 pts), match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimPutBase.prepareDocumentAndGetStartOffsets (cognitive 57) · ×1
  • VimPutBase.prepareDocumentAndGetStartOffsets (cognitive 57) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/put/VimPutBase.kt:409 — VimPutBase.prepareDocumentAndGetStartOffsets has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (39 pts), match/switch 5 (14 pts), boolean chains 4 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchHelperBase.findSentenceStart (cognitive 54) · ×1
  • VimSearchHelperBase.findSentenceStart (cognitive 54) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1034 — VimSearchHelperBase.findSentenceStart has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 13, loops 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimMotionGroupBase.getMotionRange (cognitive 50) · ×1
  • VimMotionGroupBase.getMotionRange (cognitive 50) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMotionGroupBase.kt:432 — VimMotionGroupBase.getMotionRange has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (45 pts), boolean chains 4, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GraphemesKt.nextBoundary (cognitive 50) · ×1
  • GraphemesKt.nextBoundary (cognitive 50) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/Graphemes.kt:82 — GraphemesKt.nextBoundary has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (37 pts), boolean chains 12, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimChangeGroupBase.indentRange (cognitive 48) · ×1
  • VimChangeGroupBase.indentRange (cognitive 48) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:2407 — VimChangeGroupBase.indentRange has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 4 (13 pts), boolean chains 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · VimChangeGroupBase.findNumberInText (cognitive 45) · ×1
  • VimChangeGroupBase.findNumberInText (cognitive 45) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:2163 — VimChangeGroupBase.findNumberInText has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 9, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FunctionCommand.processCommand (cognitive 45) · ×1
  • FunctionCommand.processCommand (cognitive 45) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/FunctionCommand.kt:106 — FunctionCommand.processCommand has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 6 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MapFilterFunctionHandlerBase.doFunction (cognitive 45) · ×1
  • MapFilterFunctionHandlerBase.doFunction (cognitive 45) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/collectionFunctions/MapFunctionHandlers.kt:120 — MapFilterFunctionHandlerBase.doFunction has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (35 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimChangeGroupBase.changeNumberInRange (cognitive 43) · ×1
  • VimChangeGroupBase.changeNumberInRange (cognitive 43) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:1977 — VimChangeGroupBase.changeNumberInRange has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DigraphSequence.processKey (cognitive 43) · ×1
  • DigraphSequence.processKey (cognitive 43) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/DigraphSequence.kt:51 — DigraphSequence.processKey has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (36 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 21). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · VimRegisterGroupBase.storeTextInternal (cognitive 43) · ×1
  • VimRegisterGroupBase.storeTextInternal (cognitive 43) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/register/VimRegisterGroupBase.kt:174 — VimRegisterGroupBase.storeTextInternal has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 9, loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SetCommandKt.parseOptionLine (cognitive 41) · ×1
  • SetCommandKt.parseOptionLine (cognitive 41) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/SetCommand.kt:109 — SetCommandKt.parseOptionLine has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 4 (11 pts), boolean chains 7, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimStringParserBase.parseKeys (cognitive 40) · ×1
  • VimStringParserBase.parseKeys (cognitive 40) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimStringParserBase.kt:108 — VimStringParserBase.parseKeys has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SearchGroupKt.findBlockRange (cognitive 38) · ×1
  • SearchGroupKt.findBlockRange (cognitive 38) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/SearchGroup.kt:353 — SearchGroupKt.findBlockRange has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimTemplateManagerListener.templateStarted (cognitive 37) · ×1
  • VimTemplateManagerListener.templateStarted (cognitive 37) src/main/java/com/maddyhome/idea/vim/listener/IdeaSpecifics.kt:406 — VimTemplateManagerListener.templateStarted has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 6, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RegisterGroup.readData (cognitive 36) · ×1
  • RegisterGroup.readData (cognitive 36) src/main/java/com/maddyhome/idea/vim/group/RegisterGroup.java:90 — RegisterGroup.readData has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (6 pts), ternaries 1 (5 pts), error handling 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimShortcutKeyAction.isEnabled (cognitive 35) · ×1
  • VimShortcutKeyAction.isEnabled (cognitive 35) src/main/java/com/maddyhome/idea/vim/action/VimShortcutKeyAction.kt:183 — VimShortcutKeyAction.isEnabled has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 8, match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · VimSearchHelperBase.findPattern (cognitive 34) · ×1
  • VimSearchHelperBase.findPattern (cognitive 34) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:271 — VimSearchHelperBase.findPattern has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ForLoop.execute (cognitive 34) · ×1
  • ForLoop.execute (cognitive 34) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:32 — ForLoop.execute has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 4 (10 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimChangeGroupBase.repeatInsert (cognitive 33) · ×1
  • VimChangeGroupBase.repeatInsert (cognitive 33) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:352 — VimChangeGroupBase.repeatInsert has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IjVimPluginActivator.updateState (cognitive 33) · ×1
  • IjVimPluginActivator.updateState (cognitive 33) src/main/java/com/maddyhome/idea/vim/IjVimPluginActivator.kt:141 — IjVimPluginActivator.updateState has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 6 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · MotionGroup.getMotionRange2 (cognitive 32) · ×1
  • MotionGroup.getMotionRange2 (cognitive 32) src/main/java/com/maddyhome/idea/vim/group/MotionGroup.kt:218 — MotionGroup.getMotionRange2 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 4, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimScriptExecutorBase.execute (cognitive 31) · ×1
  • VimScriptExecutorBase.execute (cognitive 31) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimScriptExecutorBase.kt:34 — VimScriptExecutorBase.execute has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), error handling 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimVariableServiceBase.convertToKotlinType (cognitive 31) · ×1
  • VimVariableServiceBase.convertToKotlinType (cognitive 31) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/services/VimVariableServiceBase.kt:301 — VimVariableServiceBase.convertToKotlinType has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (23 pts), loops 2 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · UtilKt.getModeBackground (cognitive 31) · ×1
  • UtilKt.getModeBackground (cognitive 31) src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:19 — UtilKt.getModeBackground has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 7 (18 pts), if/else 7 (9 pts), error handling 1 (4 pts) (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · VimPutBase.moveCaretToEndPosition (cognitive 30) · ×1
  • VimPutBase.moveCaretToEndPosition (cognitive 30) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/put/VimPutBase.kt:171 — VimPutBase.moveCaretToEndPosition has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 4 (6 pts) (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ColLineFunctionHandlerKt.variableToPosition (cognitive 30) · ×1
  • ColLineFunctionHandlerKt.variableToPosition (cognitive 30) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/cursorFunctions/ColLineFunctionHandler.kt:67 — ColLineFunctionHandlerKt.variableToPosition has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SearchGroupKt.findBlock (cognitive 29) · ×1
  • SearchGroupKt.findBlock (cognitive 29) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/SearchGroup.kt:450 — SearchGroupKt.findBlock has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · UtilKt.getModeForeground (cognitive 29) · ×1
  • UtilKt.getModeForeground (cognitive 29) src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/Util.kt:103 — UtilKt.getModeForeground has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 5 (12 pts), error handling 1 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchHelperBase.findBlockTagRange (cognitive 28) · ×1
  • VimSearchHelperBase.findBlockTagRange (cognitive 28) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1851 — VimSearchHelperBase.findBlockTagRange has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 4 (7 pts), boolean chains 6 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimActionListener.beforeActionPerformed (cognitive 28) · ×1
  • VimActionListener.beforeActionPerformed (cognitive 28) src/main/java/com/maddyhome/idea/vim/listener/IdeaSpecifics.kt:101 — VimActionListener.beforeActionPerformed has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 6 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BufferCommand.processCommand (cognitive 28) · ×1
  • BufferCommand.processCommand (cognitive 28) src/main/java/com/maddyhome/idea/vim/vimscript/model/commands/BufferCommand.kt:37 — BufferCommand.processCommand has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimChangeGroupBase.changeRange (cognitive 27) · ×1
  • VimChangeGroupBase.changeRange (cognitive 27) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:1712 — VimChangeGroupBase.changeRange has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SearchGroupKt.findBlockLocation (cognitive 27) · ×1
  • SearchGroupKt.findBlockLocation (cognitive 27) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/SearchGroup.kt:281 — SearchGroupKt.findBlockLocation has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GraphemesKt.classify (cognitive 26) · ×1
  • GraphemesKt.classify (cognitive 26) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/Graphemes.kt:220 — GraphemesKt.classify has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 8 (14 pts), if/else 10 (12 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · VimRegex.buildSubstituteString (cognitive 26) · ×1
  • VimRegex.buildSubstituteString (cognitive 26) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/VimRegex.kt:391 — VimRegex.buildSubstituteString has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BracketNormalizer.normalize (cognitive 26) · ×1
  • BracketNormalizer.normalize (cognitive 26) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/BracketNormalizer.kt:42 — BracketNormalizer.normalize has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArgBoundsFinder.skipSexp (cognitive 26) · ×1
  • ArgBoundsFinder.skipSexp (cognitive 26) src/main/java/com/maddyhome/idea/vim/extension/argtextobj/VimArgTextObjExtension.kt:571 — ArgBoundsFinder.skipSexp has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · CountFunctionHandler.doFunction (cognitive 25) · ×1
  • CountFunctionHandler.doFunction (cognitive 25) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/collectionFunctions/CountFunctionHandler.kt:25 — CountFunctionHandler.doFunction has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ExtendFunctionHandlerBase.doFunction (cognitive 25) · ×1
  • ExtendFunctionHandlerBase.doFunction (cognitive 25) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/collectionFunctions/ExtendFunctionHandlers.kt:29 — ExtendFunctionHandlerBase.doFunction has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · selectTicketForAnalysis.main (cognitive 25) · ×1
  • selectTicketForAnalysis.main (cognitive 25) scripts-ts/src/selectTicketForAnalysis.ts:25 — selectTicketForAnalysis.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimMarkServiceBase.updateMarksFromDelete (cognitive 24) · ×1
  • VimMarkServiceBase.updateMarksFromDelete (cognitive 24) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMarkServiceBase.kt:397 — VimMarkServiceBase.updateMarksFromDelete has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchHelperBase.findInnerParagraphRange (cognitive 24) · ×1
  • VimSearchHelperBase.findInnerParagraphRange (cognitive 24) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1522 — VimSearchHelperBase.findInnerParagraphRange has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GlobalCommand.processGlobalCommand (cognitive 24) · ×1
  • GlobalCommand.processGlobalCommand (cognitive 24) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/GlobalCommand.kt:62 — GlobalCommand.processGlobalCommand has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 3, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BacktrackingStrategy.simulate (cognitive 23) · ×1
  • BacktrackingStrategy.simulate (cognitive 23) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/engine/strategies/BacktrackingStrategy.kt:82 — BacktrackingStrategy.simulate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CollectionElementVisitor.cleanLiteralChar (cognitive 23) · ×1
  • CollectionElementVisitor.cleanLiteralChar (cognitive 23) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/CollectionElementVisitor.kt:118 — CollectionElementVisitor.cleanLiteralChar has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12, boolean chains 11. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · WindowGroup.findWindowsInRow (cognitive 23) · ×1
  • WindowGroup.findWindowsInRow (cognitive 23) src/main/java/com/maddyhome/idea/vim/group/WindowGroup.java:48 — WindowGroup.findWindowsInRow has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (14 pts), if/else 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimChangeGroupBase.changeMotion (cognitive 22) · ×1
  • VimChangeGroupBase.changeMotion (cognitive 22) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:1576 — VimChangeGroupBase.changeMotion has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · VimSearchGroupBase.runSubstitute (cognitive 22) · ×1
  • VimSearchGroupBase.runSubstitute (cognitive 22) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:642 — VimSearchGroupBase.runSubstitute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EngineStringHelper.scanPrintable (cognitive 22) · ×1
  • EngineStringHelper.scanPrintable (cognitive 22) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/helper/EngineStringHelper.kt:116 — EngineStringHelper.scanPrintable has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BracketNormalizer.findCollectionEnd (cognitive 22) · ×1
  • BracketNormalizer.findCollectionEnd (cognitive 22) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/BracketNormalizer.kt:127 — BracketNormalizer.findCollectionEnd has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SetCommandKt.showOptions (cognitive 22) · ×1
  • SetCommandKt.showOptions (cognitive 22) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/SetCommand.kt:230 — SetCommandKt.showOptions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 5 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchHelperBase.findWordAtOrFollowingCursor (cognitive 21) · ×1
  • VimSearchHelperBase.findWordAtOrFollowingCursor (cognitive 21) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:112 — VimSearchHelperBase.findWordAtOrFollowingCursor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchHelperBase.findBlockQuoteInLineRange (cognitive 21) · ×1
  • VimSearchHelperBase.findBlockQuoteInLineRange (cognitive 21) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:777 — VimSearchHelperBase.findBlockQuoteInLineRange has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchHelperBase.findNextSentenceEnd (cognitive 21) · ×1
  • VimSearchHelperBase.findNextSentenceEnd (cognitive 21) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:988 — VimSearchHelperBase.findNextSentenceEnd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ModesKt.toMode (cognitive 21) · ×1
  • ModesKt.toMode (cognitive 21) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/thinapi/Modes.kt:14 — ModesKt.toMode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (5 pts) (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · NormalCommand.processCommand (cognitive 21) · ×1
  • NormalCommand.processCommand (cognitive 21) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/NormalCommand.kt:37 — NormalCommand.processCommand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SublistExpression.assign (cognitive 21) · ×1
  • SublistExpression.assign (cognitive 21) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/expressions/SublistExpression.kt:42 — SublistExpression.assign has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · DefinedFunctionHandler.executeFunctionBody (cognitive 21) · ×1
  • DefinedFunctionHandler.executeFunctionBody (cognitive 21) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/DefinedFunctionHandler.kt:73 — DefinedFunctionHandler.executeFunctionBody has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (5 pts), loops 2 (4 pts), error handling 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · KeyGroup.getLocalActions (cognitive 21) · ×1
  • KeyGroup.getLocalActions (cognitive 21) src/main/java/com/maddyhome/idea/vim/group/KeyGroup.java:68 — KeyGroup.getLocalActions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimDigraphGroupBase.showDigraphs (cognitive 20) · ×1
  • VimDigraphGroupBase.showDigraphs (cognitive 20) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimDigraphGroupBase.kt:130 — VimDigraphGroupBase.showDigraphs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimScriptFunctionServiceBase.deleteFunction (cognitive 20) · ×1
  • VimScriptFunctionServiceBase.deleteFunction (cognitive 20) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimScriptFunctionServiceBase.kt:34 — VimScriptFunctionServiceBase.deleteFunction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchHelperBase.findCamelEnd (cognitive 20) · ×1
  • VimSearchHelperBase.findCamelEnd (cognitive 20) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:748 — VimSearchHelperBase.findCamelEnd has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchHelperBase.findNextSentenceStart (cognitive 20) · ×1
  • VimSearchHelperBase.findNextSentenceStart (cognitive 20) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:942 — VimSearchHelperBase.findNextSentenceStart has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · DigraphConsumer.consumeKey (cognitive 20) · ×1
  • DigraphConsumer.consumeKey (cognitive 20) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/key/consumers/DigraphConsumer.kt:54 — DigraphConsumer.consumeKey has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RemoveFunctionHandler.doFunction (cognitive 20) · ×1
  • RemoveFunctionHandler.doFunction (cognitive 20) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/collectionFunctions/RemoveFunctionHandler.kt:24 — RemoveFunctionHandler.doFunction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · TryStatement.execute (cognitive 20) · ×1
  • TryStatement.execute (cognitive 20) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/TryStatement.kt:27 — TryStatement.execute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimVariableServiceBase.convertToVimDataType (cognitive 20) · ×1
  • VimVariableServiceBase.convertToVimDataType (cognitive 20) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/services/VimVariableServiceBase.kt:399 — VimVariableServiceBase.convertToVimDataType has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Operator.compareExchanges (cognitive 20) · ×1
  • Operator.compareExchanges (cognitive 20) src/main/java/com/maddyhome/idea/vim/extension/exchange/VimExchangeExtension.kt:292 — Operator.compareExchanges has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, boolean chains 7, match/switch 2 (4 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · VimMarkServiceImpl.readData (cognitive 20) · ×1
  • VimMarkServiceImpl.readData (cognitive 20) src/main/java/com/maddyhome/idea/vim/group/VimMarkServiceImpl.kt:163 — VimMarkServiceImpl.readData has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (7 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · OutputPanel.handleHitEnterPrompt (cognitive 20) · ×1
  • OutputPanel.handleHitEnterPrompt (cognitive 20) src/main/java/com/maddyhome/idea/vim/ui/OutputPanel.kt:702 — OutputPanel.handleHitEnterPrompt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · VimSearchGroupBase.processSearchCommand (cognitive 19) · ×1
  • VimSearchGroupBase.processSearchCommand (cognitive 19) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:377 — VimSearchGroupBase.processSearchCommand has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (19 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchHelperBase.findCamelStart (cognitive 19) · ×1
  • VimSearchHelperBase.findCamelStart (cognitive 19) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:716 — VimSearchHelperBase.findCamelStart has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EngineVisualGroupKt.setVisualSelection (cognitive 19) · ×1
  • EngineVisualGroupKt.setVisualSelection (cognitive 19) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/visual/EngineVisualGroup.kt:29 — EngineVisualGroupKt.setVisualSelection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EditorResetConsumer.handleEditorReset (cognitive 19) · ×1
  • EditorResetConsumer.handleEditorReset (cognitive 19) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/key/consumers/EditorResetConsumer.kt:75 — EditorResetConsumer.handleEditorReset has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · VimRegex.findNext (cognitive 19) · ×1
  • VimRegex.findNext (cognitive 19) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/VimRegex.kt:134 — VimRegex.findNext has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CmdCommand.addAlias (cognitive 19) · ×1
  • CmdCommand.addAlias (cognitive 19) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/CmdCommand.kt:84 — CmdCommand.addAlias has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · HistoryCommand.processCommand (cognitive 19) · ×1
  • HistoryCommand.processCommand (cognitive 19) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/HistoryCommand.kt:35 — HistoryCommand.processCommand has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · ArgBoundsFinder.findOuterBrackets (cognitive 19) · ×1
  • ArgBoundsFinder.findOuterBrackets (cognitive 19) src/main/java/com/maddyhome/idea/vim/extension/argtextobj/VimArgTextObjExtension.kt:618 — ArgBoundsFinder.findOuterBrackets has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ExEntryPanelService.inputString (cognitive 19) · ×1
  • ExEntryPanelService.inputString (cognitive 19) src/main/java/com/maddyhome/idea/vim/ui/ex/ExEntryPanelService.kt:34 — ExEntryPanelService.inputString has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchGroupBase.findEndOfPattern (cognitive 18) · ×1
  • VimSearchGroupBase.findEndOfPattern (cognitive 18) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:478 — VimSearchGroupBase.findEndOfPattern has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchHelperBase.findOuterParagraphRange (cognitive 18) · ×1
  • VimSearchHelperBase.findOuterParagraphRange (cognitive 18) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1481 — VimSearchHelperBase.findOuterParagraphRange has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · TabCloseCommand.getTabIndexToClose (cognitive 18) · ×1
  • TabCloseCommand.getTabIndexToClose (cognitive 18) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/TabCloseCommand.kt:64 — TabCloseCommand.getTabIndexToClose has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 6, boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RangeFunctionHandler.doFunction (cognitive 18) · ×1
  • RangeFunctionHandler.doFunction (cognitive 18) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/listFunctions/RangeFunctionHandler.kt:23 — RangeFunctionHandler.doFunction has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · OutputPanel.updatePrompt (cognitive 18) · ×1
  • OutputPanel.updatePrompt (cognitive 18) src/main/java/com/maddyhome/idea/vim/ui/OutputPanel.kt:640 — OutputPanel.updatePrompt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (18 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · KeyGroup.readData (cognitive 18) · ×1
  • KeyGroup.readData (cognitive 18) src/main/java/com/maddyhome/idea/vim/group/KeyGroup.java:186 — KeyGroup.readData has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (13 pts), error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · VimChangeGroupBase.findRange (cognitive 17) · ×1
  • VimChangeGroupBase.findRange (cognitive 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimChangeGroupBase.kt:2258 — VimChangeGroupBase.findRange has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 3 (5 pts), loops 3 (4 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · VimSearchHelperBase.isInHTMLTag (cognitive 17) · ×1
  • VimSearchHelperBase.isInHTMLTag (cognitive 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1946 — VimSearchHelperBase.isInHTMLTag has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimSearchHelperBase.findUnmatchedClosingTag (cognitive 17) · ×1
  • VimSearchHelperBase.findUnmatchedClosingTag (cognitive 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:2012 — VimSearchHelperBase.findUnmatchedClosingTag has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimStringParserBase.toKeyNotation (cognitive 17) · ×1
  • VimStringParserBase.toKeyNotation (cognitive 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimStringParserBase.kt:67 — VimStringParserBase.toKeyNotation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ChangeEditorActionHandler.baseExecute (cognitive 17) · ×1
  • ChangeEditorActionHandler.baseExecute (cognitive 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/handler/ChangeEditorActionHandler.kt:85 — ChangeEditorActionHandler.baseExecute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, error handling 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimPutBase.putTextBlockwise (cognitive 17) · ×1
  • VimPutBase.putTextBlockwise (cognitive 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/put/VimPutBase.kt:295 — VimPutBase.putTextBlockwise has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TabMoveCommand.processCommand (cognitive 17) · ×1
  • TabMoveCommand.processCommand (cognitive 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/TabMoveCommand.kt:34 — TabMoveCommand.processCommand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · UnknownCommand.processPossiblyAliasCommand (cognitive 17) · ×1
  • UnknownCommand.processPossiblyAliasCommand (cognitive 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/UnknownCommand.kt:43 — UnknownCommand.processPossiblyAliasCommand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IndexedExpression.evaluate (cognitive 17) · ×1
  • IndexedExpression.evaluate (cognitive 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/expressions/IndexedExpression.kt:27 — IndexedExpression.evaluate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ForLoopWithList.execute (cognitive 17) · ×1
  • ForLoopWithList.execute (cognitive 17) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:100 — ForLoopWithList.execute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MacroGroup.playbackKeys (cognitive 17) · ×1
  • MacroGroup.playbackKeys (cognitive 17) src/main/java/com/maddyhome/idea/vim/group/MacroGroup.kt:38 — MacroGroup.playbackKeys has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ScrollGroup.scrollHalfPage (cognitive 17) · ×1
  • ScrollGroup.scrollHalfPage (cognitive 17) src/main/java/com/maddyhome/idea/vim/group/ScrollGroup.kt:88 — ScrollGroup.scrollHalfPage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimMarkServiceImpl.saveData (cognitive 17) · ×1
  • VimMarkServiceImpl.saveData (cognitive 17) src/main/java/com/maddyhome/idea/vim/group/VimMarkServiceImpl.kt:113 — VimMarkServiceImpl.saveData has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimActionsPromoter.promote (cognitive 17) · ×1
  • VimActionsPromoter.promote (cognitive 17) src/main/java/com/maddyhome/idea/vim/key/VimActionsPromoter.kt:57 — VimActionsPromoter.promote has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EditorMouseHandler.mouseClicked (cognitive 17) · ×1
  • EditorMouseHandler.mouseClicked (cognitive 17) src/main/java/com/maddyhome/idea/vim/listener/VimListenerManager.kt:1013 — EditorMouseHandler.mouseClicked has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PsiHelper.addNavigationElements (cognitive 17) · ×1
  • PsiHelper.addNavigationElements (cognitive 17) src/main/java/com/maddyhome/idea/vim/helper/PsiHelper.java:82 — PsiHelper.addNavigationElements has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · VimSearchGroupBase.prepareRegex (cognitive 16) · ×1
  • VimSearchGroupBase.prepareRegex (cognitive 16) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchGroupBase.kt:206 — VimSearchGroupBase.prepareRegex has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ToHandlerMappingInfo.myFun (cognitive 16) · ×1
  • ToHandlerMappingInfo.myFun (cognitive 16) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/key/MappingInfo.kt:258 — ToHandlerMappingInfo.myFun has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AssignmentOperator.validateValues (cognitive 16) · ×1
  • AssignmentOperator.validateValues (cognitive 16) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/expressions/operators/AssignmentOperator.kt:81 — AssignmentOperator.validateValues has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · IndexOfFunctionHandler.doFunction (cognitive 16) · ×1
  • IndexOfFunctionHandler.doFunction (cognitive 16) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/listFunctions/IndexOfFunctionHandler.kt:30 — IndexOfFunctionHandler.doFunction has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · IfStatement.execute (cognitive 16) · ×1
  • IfStatement.execute (cognitive 16) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/IfStatement.kt:25 — IfStatement.execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 1 (4 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VimShortcutKeyAction.actionPerformed (cognitive 16) · ×1
  • VimShortcutKeyAction.actionPerformed (cognitive 16) src/main/java/com/maddyhome/idea/vim/action/VimShortcutKeyAction.kt:81 — VimShortcutKeyAction.actionPerformed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArgBoundsFinder.findBoundsAt (cognitive 16) · ×1
  • ArgBoundsFinder.findBoundsAt (cognitive 16) src/main/java/com/maddyhome/idea/vim/extension/argtextobj/VimArgTextObjExtension.kt:282 — ArgBoundsFinder.findBoundsAt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FileTypePatterns.getMatchitPatterns (cognitive 16) · ×1
  • FileTypePatterns.getMatchitPatterns (cognitive 16) src/main/java/com/maddyhome/idea/vim/extension/matchit/Matchit.kt:264 — FileTypePatterns.getMatchitPatterns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · ReplaceWithRegisterNewApiKt.replaceTextAndUpdateCaret (cognitive 16) · ×1
  • ReplaceWithRegisterNewApiKt.replaceTextAndUpdateCaret (cognitive 16) src/main/java/com/maddyhome/idea/vim/extension/replacewithregister/ReplaceWithRegisterNewApi.kt:112 — ReplaceWithRegisterNewApiKt.replaceTextAndUpdateCaret has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IdeaSelectionControl.controlNonVimSelectionChange (cognitive 16) · ×1
  • IdeaSelectionControl.controlNonVimSelectionChange (cognitive 16) src/main/java/com/maddyhome/idea/vim/group/visual/IdeaSelectionControl.kt:59 — IdeaSelectionControl.controlNonVimSelectionChange has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SearchHighlightsHelperKt.updateSearchHighlights (cognitive 16) · ×1
  • SearchHighlightsHelperKt.updateSearchHighlights (cognitive 16) src/main/java/com/maddyhome/idea/vim/helper/SearchHighlightsHelper.kt:123 — SearchHighlightsHelperKt.updateSearchHighlights has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · UndoRedoHelper.performUndo (cognitive 16) · ×1
  • UndoRedoHelper.performUndo (cognitive 16) src/main/java/com/maddyhome/idea/vim/helper/UndoRedoHelper.kt:79 — UndoRedoHelper.performUndo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (UndoRedoHelper.performRedo) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · UndoRedoHelper.performRedo (cognitive 16) · ×1
  • UndoRedoHelper.performRedo (cognitive 16) src/main/java/com/maddyhome/idea/vim/helper/UndoRedoHelper.kt:156 — UndoRedoHelper.performRedo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (UndoRedoHelper.performUndo) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · ExDocumentFilter.replace (cognitive 16) · ×1
  • ExDocumentFilter.replace (cognitive 16) src/main/java/com/maddyhome/idea/vim/ui/ex/ExDocument.kt:181 — ExDocumentFilter.replace has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · syncChangelogToMaster.unreleasedEntries (cognitive 16) · ×1
  • syncChangelogToMaster.unreleasedEntries (cognitive 16) scripts-ts/src/syncChangelogToMaster.ts:101 — syncChangelogToMaster.unreleasedEntries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D3 · God Classes · FunctionTooLong · ×1
  • FunctionTooLong: selectTicketForAnalysis.main scripts-ts/src/selectTicketForAnalysis.ts:25 — FunctionTooLong — main runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D30 · Dependency Vulnerabilities · Medium CVE · ×1
  • REDACTED
D35 · Change Coupling · Change coupling clique · ×1
  • Change coupling clique: MiniAI.kt, ParagraphMotion.kt, VimIndentObject.kt src/main/java/com/maddyhome/idea/vim/extension/miniai/MiniAI.kt — 3 files — `src/main/java/com/maddyhome/idea/vim/extension/miniai/MiniAI.kt`, `src/main/java/com/maddyhome/idea/vim/extension/paragraphmotion/ParagraphMotion.kt`, `src/main/java/com/maddyhome/idea/vim/extension/textobjindent/VimIndentObject.kt` — all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×1
  • Duplicated block (16 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:42 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:42-57 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/WhileLoop.kt:32-47 — before extracting anything, compare `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/WhileLoop.kt` as WHOLE FILES: 90% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:42` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×1
  • Duplicated block (15 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:959 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:959-973 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:1005-1019 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimSearchHelperBase.kt:959` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (12–13 lines × 4) · ×1
  • Duplicated block (12–13 lines × 4) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:41 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:41-52 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:62-74 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:109-121 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/WhileLoop.kt:31-42 — before extracting anything, compare `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/WhileLoop.kt` as WHOLE FILES: 90% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/loops/ForLoop.kt:41` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (11–13 lines × 2) · ×1
  • Duplicated block (11–13 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/EditFileCommand.kt:45 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/EditFileCommand.kt:45-55 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/FindFileCommand.kt:38-50 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/EditFileCommand.kt:45` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (6–7 lines × 2) · ×1
  • Duplicated block (6–7 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/options/Option.kt:316 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/options/Option.kt:316-321 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/options/Option.kt:329-335 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/options/Option.kt:316` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (30 lines × 2) · ×1
  • Duplicated block (30 lines × 2) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/mark/MotionGotoFileMarkAction.kt:41 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/mark/MotionGotoFileMarkAction.kt:41-70 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/mark/MotionGotoMarkAction.kt:41-99 — before extracting anything, compare `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/mark/MotionGotoFileMarkAction.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/mark/MotionGotoMarkAction.kt` as WHOLE FILES: 85% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/mark/MotionGotoFileMarkAction.kt:41` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×1
  • Duplicated block (6 lines × 3) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/mark/MotionGotoFileMarkLineAction.kt:65 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/mark/MotionGotoFileMarkLineAction.kt:65-70 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/mark/MotionGotoMarkLineAction.kt:41-46 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/mark/MotionGotoMarkLineAction.kt:64-69 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/mark/MotionGotoFileMarkLineAction.kt:65` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (8 lines × 4) · ×1
  • Duplicated block (8 lines × 4) vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/scroll/CtrlUpDownAction.kt:40 — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/scroll/CtrlUpDownAction.kt:40-47 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/scroll/CtrlUpDownAction.kt:66-73 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/window/LookupDownAction.kt:39-46 | vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/window/LookupUpAction.kt:39-46 — before extracting anything, compare `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/window/LookupDownAction.kt` and `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/window/LookupUpAction.kt` as WHOLE FILES: 86% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/scroll/CtrlUpDownAction.kt:40` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D8 · Code Coverage · Coverage not measured · ×1
  • Coverage not measured — JavaScript/TypeScript suite — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — scripts-ts/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
R10 · Code Duplication · Duplicated block with local edits (30 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (30 matched lines × 2 locations) scripts-ts/src/selectIssueWithoutArea.ts:22 — scripts-ts/src/selectIssueWithoutArea.ts:22 · scripts-ts/src/selectTicketForAnalysis.ts:16 — the two spans are one implementation copied and then locally edited — 220 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (30 lines × 2 locations) · ×1
  • Duplicated block (30 lines × 2 locations) scripts-ts/src/tools/youtrack.ts:161 — scripts-ts/src/tools/youtrack.ts:161 · scripts-ts/src/tools/youtrack.ts:314 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (18 lines × 2 locations) · ×1
  • Duplicated block (18 lines × 2 locations) scripts-ts/src/youtrack-cli/set-fix-version.ts:17 — scripts-ts/src/youtrack-cli/set-fix-version.ts:17 · scripts-ts/src/youtrack-cli/set-status.ts:18 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block (14 lines × 2 locations) · ×1
  • Duplicated block (14 lines × 2 locations) scripts-ts/src/youtrack-cli/add-tag.ts:26 — scripts-ts/src/youtrack-cli/add-tag.ts:26 · scripts-ts/src/youtrack-cli/remove-tag.ts:22 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (13 lines × 3 locations) · ×1
  • Duplicated block (13 lines × 3 locations) scripts-ts/src/youtrack-cli/remove-tag.ts:31 — scripts-ts/src/youtrack-cli/remove-tag.ts:31 · scripts-ts/src/youtrack-cli/set-fix-version.ts:21 · scripts-ts/src/youtrack-cli/set-status.ts:22 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (11 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (11 matched lines × 2 locations) scripts-ts/src/prepareReleaseChangelog.ts:57 — scripts-ts/src/prepareReleaseChangelog.ts:57 · scripts-ts/src/syncChangelogToMaster.ts:60 — the two spans are one implementation copied and then locally edited — 68 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (10 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (10 matched lines × 2 locations) scripts-ts/src/promoteChangelog.ts:52 — scripts-ts/src/promoteChangelog.ts:52 · scripts-ts/src/releaseActions.ts:52 — the two spans are one implementation copied and then locally edited — 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (10 lines × 2 locations) · ×1
  • Duplicated block (10 lines × 2 locations) scripts-ts/src/youtrack-cli/create-version.ts:17 — scripts-ts/src/youtrack-cli/create-version.ts:17 · scripts-ts/src/youtrack-cli/delete-version.ts:19 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (8 lines × 3 locations) · ×1
  • Duplicated block (8 lines × 3 locations) scripts-ts/src/youtrack-cli/add-comment.ts:18 — scripts-ts/src/youtrack-cli/add-comment.ts:18 · scripts-ts/src/youtrack-cli/get-ticket.ts:18 · scripts-ts/src/youtrack-cli/set-area.ts:21 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (7 lines × 2 locations) · ×1
  • Duplicated block (7 lines × 2 locations) scripts-ts/src/updateAuthors.ts:237 — scripts-ts/src/updateAuthors.ts:237 · scripts-ts/src/updateYoutrackOnCommit.ts:58 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R2 · Cyclomatic Complexity · Complex function main (cyclomatic 14, cognitive 27) · ×1
  • Complex function main (cyclomatic 14, cognitive 27) scripts-ts/src/selectTicketForAnalysis.ts:25 — main has cyclomatic complexity 14 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function unreleasedEntries (cyclomatic 13, cognitive 16) · ×1
  • Complex function unreleasedEntries (cyclomatic 13, cognitive 16) scripts-ts/src/syncChangelogToMaster.ts:101 — unreleasedEntries has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseFailureDetails (cyclomatic 12, cognitive 12) · ×1
  • Complex function parseFailureDetails (cyclomatic 12, cognitive 12) scripts-ts/src/propertyTestFailures.ts:129 — parseFailureDetails has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function main (cyclomatic 11, cognitive 12) · ×1
  • Complex function main (cyclomatic 11, cognitive 12) scripts-ts/src/completeTicketAnalysis.ts:76 — main has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files · scripts-ts/src/tools/youtrack.ts · ×1
  • scripts-ts/src/tools/youtrack.ts: 465 lines of code scripts-ts/src/tools/youtrack.ts:1 — scripts-ts/src/tools/youtrack.ts has 465 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R6 · Tooling · No lint script · ×1
  • No lint script — test ✓ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
Minor — 59 finding(s)
D34 · Knowledge Freshness · Orphaned file · ×19
  • Orphaned file vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/Graphemes.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/main/java/com/maddyhome/idea/vim/thinapi/IjJsonExtensionProvider.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/CollectionElementVisitor.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/engine/nfa/NFA.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/TryStatement.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/SelectionInfo.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/engine/nfa/matcher/ColumnMatchers.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/engine/nfa/matcher/LineMatchers.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/StringUtil.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimCaretBase.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/main/java/com/maddyhome/idea/vim/ui/widgets/macro/MacroWidgetFactory.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/main/java/com/maddyhome/idea/vim/ui/widgets/mode/listeners/ModeWidgetListener.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimCommandLineServiceBase.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/TabMoveCommand.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/main/java/com/maddyhome/idea/vim/RegisterActions.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file annotation-processors/src/main/kotlin/com/intellij/vim/processors/ExtensionsProcessor.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/main/java/com/maddyhome/idea/vim/thinapi/IjPluginExtensionsScanner.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/IdeaPlug.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file api/src/main/kotlin/com/intellij/vim/api/scopes/editor/ReadScope.kt:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
X10 · Duplicated predicate · Duplicated predicate · ×17
  • Duplicated predicate vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/select/motion/SelectMotionArrowLeftAction.kt:48 — `OptionConstants.keymodel_stopsel in keymodel || OptionConstants.keymodel_stopselect in keymodel` appears character-identically in 2 files — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/select/motion/SelectMotionArrowLeftAction.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/select/motion/SelectMotionArrowRightAction.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/main/java/com/maddyhome/idea/vim/group/MotionGroup.kt:296 — `action is MotionActionHandler && action.motionType === MotionType.EXCLUSIVE && isForwardMotion` appears character-identically in 2 files — src/main/java/com/maddyhome/idea/vim/group/MotionGroup.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimMotionGroupBase.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/change/ChangeCaseLowerMotionAction.kt:41 — `argument == null || argument !is Argument.Motion` appears character-identically in 3 files — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/change/ChangeCaseLowerMotionAction.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/change/ChangeCaseToggleMotionAction.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/change/ChangeCaseUpperMotionAction.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/text/MotionSectionAction.kt:86 — `caret.offset == 0 && count < 0 || caret.offset >= editor.fileSize() - 1 && count > 0` appears character-identically in 2 files — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/text/MotionSectionAction.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/text/MotionWordEndAction.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/main/java/com/maddyhome/idea/vim/group/visual/VisualGroup.kt:29 — `caret.offset == lineEnd && lineEnd != lineStart` appears character-identically in 2 files — src/main/java/com/maddyhome/idea/vim/group/visual/VisualGroup.kt, src/main/java/com/maddyhome/idea/vim/listener/VimListenerManager.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/mapping/MapClearCommand.kt:43 — `cmd.startsWith(it.prefix) && it.bang == bang` appears character-identically in 3 files — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/mapping/MapClearCommand.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/mapping/MapCommand.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/mapping/UnMapCommand.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/ex/MoveCaretLeftAction.kt:26 — `completion != null && completion.expectedText == commandLine.text && injector.globalOptions().wildmenu` appears character-identically in 2 files — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/ex/MoveCaretLeftAction.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/ex/MoveCaretRightAction.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/leftright/MotionEndAction.kt:46 — `editor.inVisualMode || editor.inSelectMode` appears character-identically in 2 files — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/leftright/MotionEndAction.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/leftright/MotionShiftEndAction.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/leftright/MotionArrowRightAction.kt:51 — `editor.usesVirtualSpace || editor.isEndAllowed` appears character-identically in 2 files — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/leftright/MotionArrowRightAction.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/leftright/MotionRightAction.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/datatypes/VimFuncref.kt:154 — `handler is DefinedFunctionHandler && handler.function.flags.contains(FunctionFlag.DICT)` appears character-identically in 2 files — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/datatypes/VimFuncref.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/expressions/NamedFunctionCallExpression.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/main/java/com/maddyhome/idea/vim/group/ScrollGroup.kt:217 — `inlay != null && !inlay.isRelatedToPrecedingText` appears character-identically in 2 files — src/main/java/com/maddyhome/idea/vim/group/ScrollGroup.kt, src/main/java/com/maddyhome/idea/vim/helper/EditorHelper.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate scripts/src/main/kotlin/scripts/help/generateHelp.kt:229 — `isNotEmpty() && (ctrl != null || previousIsCtrl)` appears character-identically in 2 files — scripts/src/main/kotlin/scripts/help/generateHelp.kt, src/main/java/com/maddyhome/idea/vim/vimscript/model/commands/HelpCommand.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/DigraphSequence.kt:34 — `key.keyCode == KeyEvent.VK_V || key.keyCode == KeyEvent.VK_Q` appears character-identically in 2 files — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/DigraphSequence.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/key/consumers/ForcedMotionConsumer.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimVisualMotionGroupBase.kt:55 — `mode is Mode.VISUAL && mode.isSelectPending` appears character-identically in 2 files — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimVisualMotionGroupBase.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/helper/EngineModeExtensions.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/VimRedoBuffer.kt:255 — `mode is Mode.VISUAL || mode is Mode.SELECT` appears character-identically in 2 files — vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/change/VimRedoBuffer.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimVisualMotionGroupBase.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate scripts/src/main/kotlin/scripts/help/generateHelp.kt:238 — `part.length != 5 || !part.startsWith("<C-", ignoreCase = true) || !part.endsWith('>')` appears character-identically in 2 files — scripts/src/main/kotlin/scripts/help/generateHelp.kt, src/main/java/com/maddyhome/idea/vim/vimscript/model/commands/HelpCommand.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/main/java/com/maddyhome/idea/vim/group/OptionGroup.kt:1108 — `storedValue is OptionValue.Default && storedValue.value != option.unsetValue` appears character-identically in 2 files — src/main/java/com/maddyhome/idea/vim/group/OptionGroup.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/api/VimOptionGroupBase.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
D16 · Bus Factor · Off-boarding risk · ×4
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 55 significant file(s) lose their only recent owner: src/main/java/com/maddyhome/idea/vim/extension/targets/TargetsExtension.kt, scripts-ts/src/propertyTestFailures.ts, src/main/java/com/maddyhome/idea/vim/extension/camelcasemotion/CamelCaseMotion.kt, scripts-ts/src/buildWhatsNewSite.ts, src/main/java/com/maddyhome/idea/vim/extension/signature/SignatureExtension.kt, src/main/java/com/maddyhome/idea/vim/extension/abolish/AbolishExtension.kt, src/main/java/com/maddyhome/idea/vim/extension/indentwise/IndentWiseExtension.kt, scripts-ts/src/collectPropertyTestFailures.ts (+47 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 31 significant file(s) lose their only recent owner: vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/SetCommand.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/datatypes/VimFuncref.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/datatypes/VimDataType.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/FunctionHandler.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/functions/handlers/collectionFunctions/MapFunctionHandlers.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/key/KeyMapping.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/commands/LetCommand.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/expressions/operators/AssignmentOperator.kt (+23 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 10 significant file(s) lose their only recent owner: src/main/java/com/maddyhome/idea/vim/extension/exchange/VimExchangeExtension.kt, api/src/main/kotlin/com/intellij/vim/api/VimApi.kt, api/src/main/kotlin/com/intellij/vim/api/scopes/mappingPluginExtensions.kt, scripts-ts/src/updateAuthors.ts, scripts/src/main/kotlin/scripts/youtrack.kt, scripts-ts/src/selectTicketForAnalysis.ts, api/src/main/kotlin/com/intellij/vim/api/scopes/TextObjectScope.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/action/motion/object/MotionQuoteAction.kt (+2 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #4 — If anonymized user #4 becomes unavailable, 6 significant file(s) lose their only recent owner: src/main/java/com/maddyhome/idea/vim/helper/SearchHighlights.kt, src/main/java/com/maddyhome/idea/vim/action/OutsideEditorKeyDispatcher.kt, src/main/java/com/maddyhome/idea/vim/newapi/PrimarySelectionWriter.kt, ideavim-backend/src/main/java/com/maddyhome/idea/vim/group/format/FormatRemoteApiImpl.kt, src/main/java/com/maddyhome/idea/vim/vimscript/model/commands/HelpCommand.kt, src/main/java/com/maddyhome/idea/vim/EventFacade.java. Pair on, review, or document these before any departure.
D19 · Documentation Quality · Documentation · ×4
  • Documentation: no project overview README.md — The document begins with an overview of IdeaVim but does not state what the repository's main package or deploy tier is for, nor whether it contains a README that explains what the directory does. Add a one-line description of what IdeaVim is and where to find usage examples.
  • Documentation: no installation or build instructions README.md — The setup section describes installing via Settings | Plugins but omits build/setup commands such as 'vundle' or 'Plug' plugin initialization. Add installation/build steps for vundle/Plug and the .ideavimrc configuration.
  • Documentation: no usage examples README.md — The Get Early Access section is cut by the scanner; there are no usage examples showing how to run IdeaVim. Add a short 'how to run it' example, such as opening a file and typing J.
  • Documentation: no contributor guidance README.md — The README mentions contact channels but gives no guidance for contributors on how to submit patches or files. Add contribution guidelines covering pull request structure and the repository's issue tracker.
M4 · Documentation accuracy · README/code drift · ×3
  • README/code drift CONTRIBUTING.md:72 — CONTRIBUTING.md links to `src/main/resources/ksp-generated/intellij_commands.json`, but `src/main/resources/ksp-generated/intellij_commands.json` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
  • README/code drift CONTRIBUTING.md:79 — CONTRIBUTING.md links to `src/main/resources/ksp-generated/intellij_ex_commands.json`, but `src/main/resources/ksp-generated/intellij_ex_commands.json` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
  • README/code drift api/doc/Plugin-API-introduction.md:15 — api/doc/Plugin-API-introduction.md links to `IdeaVim%20Plugins.md`, but `api/doc/IdeaVim Plugins.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (108 single-owned of 521 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 521 of the 1359 production source files in this repository met that bar). They are anonymized user #5 (2 file(s)), anonymized user #6 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/visual/VimSelection.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/visual/VisualOperation.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/CollectionElementVisitor.kt.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 2 of 14 project(s) overshoot their size bounds, lowering Project Cohesion to 7.1/10. The most over is `vim-engine` (68982 LoC, 1799 module-visible types across 101 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D27 · Navigability · High interface indirection · ×1
  • High interface indirection — 71 % of calls go through an interface — tracing a call means resolving the implementation each hop. Prefer concrete types where there's a single implementation.
D28 · Secrets (history) · Rotate the exposed credentials · ×1
  • REDACTED
D34 · Knowledge Freshness · Orphaned files with no living knowledge · ×1
  • Orphaned files with no living knowledge — 19 of 521 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 521 of the 1359 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: vim-engine/src/main/kotlin/com/maddyhome/idea/vim/common/Graphemes.kt, src/main/java/com/maddyhome/idea/vim/thinapi/IjJsonExtensionProvider.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/parser/visitors/CollectionElementVisitor.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/engine/nfa/NFA.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/vimscript/model/statements/TryStatement.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/engine/nfa/matcher/ColumnMatchers.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/regexp/engine/nfa/matcher/LineMatchers.kt, vim-engine/src/main/kotlin/com/maddyhome/idea/vim/group/StringUtil.kt (and 11 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P10 · Library API & versioning · Large public API surface · ×1
  • Large public API surface — 1566/1885 types (83%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.
X2 · Cancellation propagation · Not all functions that make a request accept an AbortSignal or the coroutine's cancellation · ×1
  • Not all functions that make a request accept an AbortSignal or the coroutine's cancellation — Only 10/14 functions that make a cancellable request (fetch, axios, ky, ofetch; Ktor, OkHttp newCall, URL streams) accept an AbortSignal or the coroutine's cancellation or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, a cancelled request, a shutdown, an expired deadline. Take a `signal` () and hand it to the request; in a Kotlin suspend function, make the request with a call that suspends — Ktor, OkHttp's `executeAsync()`, or a `suspendCancellableCoroutine` that cancels the `Call` — not a blocking `execute()`: `withContext(Dispatchers.IO)` moves the call off the caller's thread but does not make it cancellable; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
X23 · Unguarded diagnostic materialisation · Diagnostic log message is built whether or not it is wanted · ×1
  • Diagnostic log message is built whether or not it is wanted src/main/java/com/maddyhome/idea/vim/thinapi/IjPluginExtensionsScanner.kt:42 — `debug` at line 42 is called with an argument built by `extensionBeans.joinToString("…")` (line 43), whose cost grows with the collection it walks. Kotlin evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isDebugEnabled` test, no `BuildConfig.DEBUG` flag, no trailing lambda (`logger.debug { … }`) the logger calls only when the level is on.
Minor — 10 finding(s)
D10 · Test Quality · Skipped (documented) · ×10
  • Skipped (documented): (unnamed test) scripts-ts/src/propertyTestFailures.test.ts:202 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) scripts-ts/src/propertyTestFailures.test.ts:203 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) scripts-ts/src/propertyTestFailures.test.ts:213 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) scripts-ts/src/propertyTestFailures.test.ts:216 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) scripts-ts/src/propertyTestFailures.test.ts:229 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) scripts-ts/src/propertyTestFailures.test.ts:232 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) scripts-ts/src/propertyTestFailures.test.ts:252 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) scripts-ts/src/propertyTestFailures.test.ts:253 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) scripts-ts/src/propertyTestFailures.test.ts:293 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
  • Skipped (documented): (unnamed test) scripts-ts/src/propertyTestFailures.test.ts:313 — Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs

Appendix B — Reproduction & audit trail

Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-7b3a5a60e9ba484592ddf8c3103ae6ff/history.json --exit-code 0 --source .6artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-7b3a5a60e9ba484592ddf8c3103ae6ff/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off .180artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update6artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 26 file(s) — `.idea/fileTemplates/code/I18nized Concatenation.java`, `.idea/fileTemplates/code/I18nized Expression.java`, `api/src/main/kotlin/com/intellij/vim/api/models/ApiModels.kt`, `src/main/java/com/maddyhome/idea/vim/autocmd/AutoCmdPattern.kt`, `src/main/java/com/maddyhome/idea/vim/extension/VimExtensionFacade.kt`, … (+21 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update0artifacts/raw/trivy-fs.json

Run 01a16fa9-b1c3-7171-85bf-63dff9fbe170 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Issues: 188 · Warnings: 684 · Recommendations: 59 · Info: 10 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 24-10-2026 @ 20:45 UTC.

Downloadable artifacts

Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md