{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"]}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"ScalaToplevelMtags.loop (cyclomatic 77): ScalaToplevelMtags.loop has cyclomatic complexity 77 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/ScalaToplevelMtags.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3f77312edea2076f3c53954b207987a7bfc18822dd3a60b3f94e370eb0b2f8"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceLspService.executeCommand (cyclomatic 68): WorkspaceLspService.executeCommand has cyclomatic complexity 68 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"c101dcf9b3065d635d29e4d62fe08883ae160ab24f37a1f81a5551e9ffcfd665"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionProvider.completions (cyclomatic 66): CompletionProvider.completions has cyclomatic complexity 66 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9562d4631d65e58e067ac32a9f5e82b39bf524510394e9ae3d54cc6ef03e6df"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassfileParser.parseAttributes (cyclomatic 62): ClassfileParser.parseAttributes has cyclomatic complexity 62 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a01b46ee369c75187895e482a046871aba07feefacd8ee385842681eea0aec"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalaMtags.apply (cyclomatic 53): ScalaMtags.apply has cyclomatic complexity 53 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/ScalaMtags.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee41e4ca883d3bca22ff38d4a44d2d6f4eacd26df0cdf3dc574c127c557daa9f"}},{"ruleId":"D1","level":"warning","message":{"text":"MetalsGlobal.shortType (cyclomatic 49): MetalsGlobal.shortType has cyclomatic complexity 49 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e45637be6cd9318d782df04778b6987629fa4663b83ef893b20064f1a693472"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassfileParser.sigToType (cyclomatic 46): ClassfileParser.sigToType has cyclomatic complexity 46 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e85ebdbc4b36bc9ea72d7927a894c6d156f7007634f5d62a8465b6431931a80"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolTraverser.apply (cyclomatic 43): SymbolTraverser.apply has cyclomatic complexity 43 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/DocumentSymbolProvider.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d340c7007319101e19c6e735f142b59415333cbb3e58bbbbe99def7179460d"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaToplevelMtags.fetchToken (cyclomatic 42): JavaToplevelMtags.fetchToken has cyclomatic complexity 42 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/JavaToplevelMtags.scala"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcf0ef07ab47651ca05381711dda034fbf7e081f4cfe9cbcb6c6c62c5e94b5f"}},{"ruleId":"D1","level":"warning","message":{"text":"ScaladocParser.parseAtSymbol (cyclomatic 40): ScaladocParser.parseAtSymbol 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"745bde851f7ec1849ad192bd113db6d7ea47df0505da3cda9cdaa1fccbdb03d3"}},{"ruleId":"D1","level":"warning","message":{"text":"XtensionGSymbolSSymbolInformation.properties (cyclomatic 38): XtensionGSymbolSSymbolInformation.properties 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"749ace2b8182ea9663bccb61c1ef3a67a3814a174fbe96096a81f870b6b67847"}},{"ruleId":"D1","level":"warning","message":{"text":"ProblemResolver.problemMessage (cyclomatic 36): ProblemResolver.problemMessage has cyclomatic complexity 36 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/doctor/ProblemResolver.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8554e894ca8b12b42e4241a43eb2400fa1f0c4a00384ecafc736c55269cc30ba"}},{"ruleId":"D1","level":"warning","message":{"text":"ProblemResolver.findProblem (cyclomatic 32): ProblemResolver.findProblem has cyclomatic complexity 32 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/doctor/ProblemResolver.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7986608194411c69212cb49e08c227b8e8f149f2f8990c963508985f0032295a"}},{"ruleId":"D1","level":"warning","message":{"text":"PcCollector.traverseSought (cyclomatic 32): PcCollector.traverseSought has cyclomatic complexity 32 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe515d3c0a30ab7e50bf02cf82517047892458e6ea586fafc6c65bd46743e782"}},{"ruleId":"D1","level":"warning","message":{"text":"PackageProvider.calcImportEditsForFileMove (cyclomatic 31): PackageProvider.calcImportEditsForFileMove has cyclomatic complexity 31 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/PackageProvider.scala"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df8c28089a791a3e336f30aa073cbc0e434e70228c1e98e85baf2fcd70e0f4c"}},{"ruleId":"D1","level":"warning","message":{"text":"McpMain.parseArgs (cyclomatic 28): McpMain.parseArgs has cyclomatic complexity 28 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals-mcp/src/main/scala/scala/meta/metals/McpMain.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fd863c1987939d5315d91914a838b7e2a4b62e894bbda89ab67f9362b33b8a"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplementationProvider.symbolLocationsFromContext (cyclomatic 28): ImplementationProvider.symbolLocationsFromContext has cyclomatic complexity 28 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/implementation/ImplementationProvider.scala"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a0cefd87ffd98c2f28d63f5691746fbee83054051347a4da9d5a43a4c3cdfa"}},{"ruleId":"D1","level":"warning","message":{"text":"ClasspathTreeView.children (cyclomatic 28): ClasspathTreeView.children 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/tvp/ClasspathTreeView.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06b6f547911371a128fee20669569ddeb584313f5c3d82e08aa38c48561399c"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoImportsProvider.autoImports (cyclomatic 28): AutoImportsProvider.autoImports has cyclomatic complexity 28 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/AutoImportsProvider.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe99fa480cc343da30031b8ba0035d79ff89e9e41066ef643ff0522fbf60cf4"}},{"ruleId":"D1","level":"warning","message":{"text":"CaseKeywordCompletion.contribute (cyclomatic 27): CaseKeywordCompletion.contribute 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c74e725cc1faf138e0e26ea543c561d4767f60d2cfd214ab088dad1752483f"}},{"ruleId":"D1","level":"warning","message":{"text":"PcSemanticTokensProvider.makeNode (cyclomatic 26): PcSemanticTokensProvider.makeNode has cyclomatic complexity 26 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcSemanticTokensProvider.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7057b423d68352ba1082a276c8450ab069f136694283ce41dde1542a356aec3"}},{"ruleId":"D1","level":"warning","message":{"text":"Foldable.unapply (cyclomatic 25): Foldable.unapply 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/FoldingRangeExtractor.scala"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d859effe6681e0de6a5ecf6f084d8f93c8548b0a7ae1f4d170f39a25c75433"}},{"ruleId":"D1","level":"warning","message":{"text":"HoverProvider.hoverOffset (cyclomatic 25): HoverProvider.hoverOffset has cyclomatic complexity 25 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/HoverProvider.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"45da6eab92569a5ee1b86d305375e106973b4721dce992d4486940afcc37eb89"}},{"ruleId":"D1","level":"warning","message":{"text":"WikiParser.table (cyclomatic 25): WikiParser.table has cyclomatic complexity 25 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfce106f50ca280f46e950121c73a9f67d3cd12844fe90898082b95b662e88a8"}},{"ruleId":"D1","level":"warning","message":{"text":"BspConnector.connect (cyclomatic 24): BspConnector.connect has cyclomatic complexity 24 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3403da3e5436bebccd2238dcdad340f69366cd902ea8562f72fd30cf8a8130da"}},{"ruleId":"D1","level":"warning","message":{"text":"RenameProvider.rename (cyclomatic 24): RenameProvider.rename 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/rename/RenameProvider.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab3243a630783a088e2473790c61d187c650e2d0f7adb172221ba2b6e9abb02"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredTypeProvider.inferredTypeEdits (cyclomatic 24): InferredTypeProvider.inferredTypeEdits 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/InferredTypeProvider.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4634028568579cfe8ba4a635f04436e451d15e4c752a46321967628f41669349"}},{"ruleId":"D1","level":"warning","message":{"text":"OverrideCompletions.getMembers (cyclomatic 24): OverrideCompletions.getMembers has cyclomatic complexity 24 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a4704fb4f9db5b2ad0b9d744fdca95ac8ce73a998d5cf42b9b492ea7820f95"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtractMethodProvider.extractMethod (cyclomatic 23): ExtractMethodProvider.extractMethod has cyclomatic complexity 23 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/ExtractMethodProvider.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5599b06277b05aceb9597dec977cd682ccf9182d40500aeeb79d78dcc7f77362"}},{"ruleId":"D1","level":"warning","message":{"text":"UserConfiguration.fromJson (cyclomatic 22): UserConfiguration.fromJson has cyclomatic complexity 22 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/UserConfiguration.scala"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"66de59a439d0b39ad60b1f2befeb408c8299c2d2d9fb959a13bca47642bdf4a4"}},{"ruleId":"D1","level":"warning","message":{"text":"PcDefinitionProvider.definitionTypedTreeAt (cyclomatic 22): PcDefinitionProvider.definitionTypedTreeAt has cyclomatic complexity 22 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcDefinitionProvider.scala"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb75bd8d123ca4c3239bd08e08d4e4ddcb98c8adf49cbd84168aa7dee9b4f26"}},{"ruleId":"D1","level":"warning","message":{"text":"SignatureHelpProvider.toSignatureInformation (cyclomatic 22): SignatureHelpProvider.toSignatureInformation 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afa902ac26ecc4b079a01a1a2ce2e1111e759a0b4f37ad9c0af23b2a552db92"}},{"ruleId":"D1","level":"warning","message":{"text":"FallbackDefinitionProvider.search (cyclomatic 21): FallbackDefinitionProvider.search has cyclomatic complexity 21 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/FallbackDefinitionProvider.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b101e7450514ebed2a55d74dd0492f80afd413e73e786d9c3f4ee061539a72"}},{"ruleId":"D1","level":"warning","message":{"text":"DebugDiscovery.validate (cyclomatic 21): DebugDiscovery.validate has cyclomatic complexity 21 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/DebugDiscovery.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"725c930c665f8f22469b37aea6b9795b14a919aac5d0b3ab3d50290b6b2a24d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassFinder.findClassNameForOffset (cyclomatic 21): ClassFinder.findClassNameForOffset has cyclomatic complexity 21 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/ClassFinder.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bf9d892b5a56572e3df211a3a27cd1786dbdaebd1d6586631965b8ef5a2a66"}},{"ruleId":"D1","level":"warning","message":{"text":"PcCollector.resultWithSought (cyclomatic 21): PcCollector.resultWithSought has cyclomatic complexity 21 (threshold 15). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e2ae3cb365415c96805a30fb46d169184be5e8444bbf28ea52941e4ee98d43"}},{"ruleId":"D1","level":"warning","message":{"text":"Visitor.visitClass (cyclomatic 21): Visitor.visitClass has cyclomatic complexity 21 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36c17ccc22192113df6f159c099faa36f4c7ac78c39c8ca4092cb8970aa53af"}},{"ruleId":"D1","level":"warning","message":{"text":"DebugProvider.startDebugSession (cyclomatic 20): DebugProvider.startDebugSession has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"86059f77ce9d6a65aacd1d574287a8587c79a60915eaf79649840da3a82abbc6"}},{"ruleId":"D1","level":"warning","message":{"text":"HoverProvider.toHover (cyclomatic 20): HoverProvider.toHover has cyclomatic complexity 20 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/HoverProvider.scala"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"945b40aa1c10077bfdabfdc698efbc703dd22b4983fbb667b505cf3f9950435a"}},{"ruleId":"D1","level":"warning","message":{"text":"FlatMapToForComprehensionCodeAction.turnPatToTerm (cyclomatic 19): FlatMapToForComprehensionCodeAction.turnPatToTerm 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/FlatMapToForComprehensionCodeAction.scala"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac0a7cbe6077a515f3ad690cd0db3f3f514dd0ab06c2291e1ecb088938ea9b3"}},{"ruleId":"D1","level":"warning","message":{"text":"InsertInferredType.contribute (cyclomatic 19): InsertInferredType.contribute has cyclomatic complexity 19 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/InsertInferredType.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df63482e82e6c2417c8b0e0ac2a293cd1b2178de218a08c9bc2db81245f5dc4"}},{"ruleId":"D1","level":"warning","message":{"text":"Fuzzy.forgivingFirstCharMatcher (cyclomatic 19): Fuzzy.forgivingFirstCharMatcher 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/metals/Fuzzy.scala"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"0746725b74657b09f1939b515fcd5fec7e29664acde5111e0f1abea842f3dfbe"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.completionPositionUnsafe (cyclomatic 19): Completions.completionPositionUnsafe has cyclomatic complexity 19 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ac8907f38765c52c433e5d2b686486b9ffb33fe84ad6047a1911c5cba31042"}},{"ruleId":"D1","level":"warning","message":{"text":"Embedded.fallbackDownload (cyclomatic 18): Embedded.fallbackDownload 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Embedded.scala"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ce98cf3b295dac4f7495160b974d6022d9b7658abd83c1e94a83aa9ba6b70c"}},{"ruleId":"D1","level":"warning","message":{"text":"FormattingProvider.inspectDialectRewrite (cyclomatic 18): FormattingProvider.inspectDialectRewrite 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/FormattingProvider.scala"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fd7f562737b9ffb0021ff9c9975cd8826b68b55a092f4e9d6c879dd9599ac3"}},{"ruleId":"D1","level":"warning","message":{"text":"Default.resolve (cyclomatic 18): Default.resolve 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf684bcb75292c78fcf4cffa122c5899da9e2290e1c6bf90ecbaa72dbbe9090"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalafixProvider.scalafixEvaluate (cyclomatic 18): ScalafixProvider.scalafixEvaluate 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ScalafixProvider.scala"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c349e3193abdea00a22599c3989a42d5cd36d73c7e1b6e5486d2d434fc7b93"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceSymbolProvider.workspaceSearch (cyclomatic 18): WorkspaceSymbolProvider.workspaceSearch has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"2defc624f09d9e2be627cc5a23c95c66e45311a89e7deb9e714b3d5f5d2b4ec7"}},{"ruleId":"D1","level":"warning","message":{"text":"StringActions.contribute (cyclomatic 18): StringActions.contribute 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/StringActions.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cb869cad205c08d1c43b2a3b8593fad3347472b58cce2ef7e5f82e7913888e"}},{"ruleId":"D1","level":"warning","message":{"text":"Diff.toRevised (cyclomatic 18): Diff.toRevised 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70c93edd649fe61ddd022ffd16ab9e38bfa1c94f040c6dadeeb0f27b647fe45"}},{"ruleId":"D1","level":"warning","message":{"text":"Keyword.matchesPosition (cyclomatic 18): Keyword.matchesPosition has cyclomatic complexity 18 (threshold 15). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/pc/Keyword.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0518d91fc9ae6b836dbf50eab63afe2f410f742e14a445ce79e1213727ad6bac"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlConverter.processHtmlElement (cyclomatic 18): HtmlConverter.processHtmlElement 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/HtmlConverter.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4443f810da7bddebbb463bc0de2b629628ae0dacf7cff6c3d8756ef6b58ce74d"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaFormattingProvider.runFormat (cyclomatic 17): JavaFormattingProvider.runFormat 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/JavaFormattingProvider.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eadfb01d42c13ca1b506a8d32d8ada25feddab1639266da39fc257e2f137193"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalafmtConfig.parse (cyclomatic 17): ScalafmtConfig.parse has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ScalafmtConfig.scala"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b75e1224c6d31fc23e206a5eb54e1a7901b43931f581a35f5f0efe78bb3e3a"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectWarnings.noSemanticdb (cyclomatic 17): ProjectWarnings.noSemanticdb 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Warnings.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f2cfc56369fd44a8089775ec7e4c6769da62f4038d94a05ad989991fa0e5a1"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexedSymbols.jarSymbols (cyclomatic 17): IndexedSymbols.jarSymbols has cyclomatic complexity 17 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/tvp/IndexedSymbols.scala"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"133de3cbf717ab9aa35864be57d526788fdb377a91bda4d9ccab56173b41091f"}},{"ruleId":"D1","level":"warning","message":{"text":"XtensionSymbolSSpec.descriptor (cyclomatic 17): XtensionSymbolSSpec.descriptor 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc60d0b475dad649b78be5beb61a35c0299002ab01594291a705cd1b790e445"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassfileParser.parseClass (cyclomatic 17): ClassfileParser.parseClass has cyclomatic complexity 17 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"428bb36842676ca0665d61f4f6bc026f98315d01a27e1cbf66a461e47bd3dd8f"}},{"ruleId":"D1","level":"warning","message":{"text":"MetalsGlobal.inverseSemanticdbSymbols (cyclomatic 17): MetalsGlobal.inverseSemanticdbSymbols 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3daa7fe9584971107cff1ee4b39bc23ca9652d6bb8335128a20d47b8393ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"SignatureHelpProvider.treeSymbol (cyclomatic 17): SignatureHelpProvider.treeSymbol 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b6757531f5bae51da020b4b2e0e72f7e92920401181a13fb9de06a0ff60a2d"}},{"ruleId":"D1","level":"warning","message":{"text":"WikiParser.parseInline (cyclomatic 17): WikiParser.parseInline has cyclomatic complexity 17 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c5cf61dad5767c0c162f9bbc6c2055cda16d3694b79024e6fa8c79c4a4d003"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalafixProvider.runScalafixRules (cyclomatic 16): ScalafixProvider.runScalafixRules 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ScalafixProvider.scala"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6d81d0c39ff99005af35cccc992d5b4d01696f8b41ee23e462cc509ea9950f"}},{"ruleId":"D1","level":"warning","message":{"text":"MultilineString.contributeNewline (cyclomatic 16): MultilineString.contributeNewline has cyclomatic complexity 16 (threshold 15). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/formatting/MultilineString.scala"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"103b48255b6a3b121f73b6d9e33a948371c4de922c9ffb1bd8a57d18e10b9768"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenEditDistance.apply (cyclomatic 16): TokenEditDistance.apply has cyclomatic complexity 16 (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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"74769c0b88ba8a4b77475fe03f17c5cb8b252340b802b9501ff01693d2bc3ed7"}},{"ruleId":"D1","level":"warning","message":{"text":"XtensionGSymbolSSymbolInformation.kind (cyclomatic 16): XtensionGSymbolSSymbolInformation.kind 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d78957efd178e1e2fb509199cc243f9b230c52bb679577549bf0e0a25a6386"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplicitParameters.partsFromImplicitArgs (cyclomatic 16): ImplicitParameters.partsFromImplicitArgs 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcInlayHintsProvider.scala"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eb978d57931ab29e1ce3cea6b97ab2c69024a64c49cef6d7398b490eec65de"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.computeRelevancePenalty (cyclomatic 16): Completions.computeRelevancePenalty 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c150640e395ba96fddb0c631ddd667014d7c4abf3a8f7f0be261c5991522b5af"}},{"ruleId":"D1","level":"warning","message":{"text":"Completions.memberOrdering (cyclomatic 16): Completions.memberOrdering 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6075a189c9d2ebe5f6358f70f64852864990a959b6adf786bae9502e27c3235d"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaToplevelMtags.loop (cognitive 127): ScalaToplevelMtags.loop has cognitive complexity 127 (threshold 15). Drivers by points: if/else 41 (78 pts), match/switch 10 (30 pts), boolean chains 19 (nesting depth added 57). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/ScalaToplevelMtags.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"debe23f26e05514bd5cf68bd6558a31c05675dd1414d02c847527b5c1fb92584"}},{"ruleId":"D2","level":"warning","message":{"text":"MetalsGlobal.shortType (cognitive 89): MetalsGlobal.shortType has cognitive complexity 89 (threshold 15). Drivers by points: if/else 34 (59 pts), match/switch 7 (18 pts), boolean chains 11, error handling 1 (nesting depth added 36). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fa01cf73897e685e48f8c20c2ffb37f3f7e08dcdff7e38f83a1e4fd803af53"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplementationProvider.symbolLocationsFromContext (cognitive 87): ImplementationProvider.symbolLocationsFromContext has cognitive complexity 87 (threshold 15). Drivers by points: loops 15 (55 pts), if/else 8 (16 pts), match/switch 5 (14 pts), boolean chains 2 (nesting depth added 57). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/implementation/ImplementationProvider.scala"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1d679697bddb6c2d8b66fa608053cc3446258a3ec1f483b90dd79414a2c582"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionProvider.completions (cognitive 86): CompletionProvider.completions has cognitive complexity 86 (threshold 15). Drivers by points: if/else 45 (58 pts), match/switch 12 (16 pts), boolean chains 12 (nesting depth added 17). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c3aa1b0a882523b18f900ef8cb1c57785c1b61b8f9e9fa6166483ce919c85e"}},{"ruleId":"D2","level":"warning","message":{"text":"XtensionGSymbolSSymbolInformation.properties (cognitive 78): XtensionGSymbolSSymbolInformation.properties has cognitive complexity 78 (threshold 15). Drivers by points: if/else 31 (64 pts), boolean chains 11, match/switch 1 (3 pts) (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"875ffd7b023c393ae4fb21513336ef42aef39b95c3a202bfc65e14261bf7859a"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassfileParser.sigToType (cognitive 71): ClassfileParser.sigToType has cognitive complexity 71 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 9 (18 pts), match/switch 5 (16 pts), boolean chains 7 (nesting depth added 32). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acc56c259570908aa9e05bc18ee9724391a913d8e0866a9053ccbcaf7c7cfdc"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassfileParser.parseAttributes (cognitive 71): ClassfileParser.parseAttributes has cognitive complexity 71 (threshold 15). Drivers by points: if/else 23 (34 pts), match/switch 9 (22 pts), loops 6 (7 pts), boolean chains 5, error handling 3 (nesting depth added 25). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a841923b063e5fd53fce2c8be3ab44a9f31090523fe69290ec99b94fcd55c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaMtags.apply (cognitive 65): ScalaMtags.apply has cognitive complexity 65 (threshold 15). Drivers by points: if/else 24 (32 pts), match/switch 9 (19 pts), loops 5 (11 pts), boolean chains 3 (nesting depth added 24). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/ScalaMtags.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ac21bd08956d01cbd83de922b17f0b53fb801ab7def47fbbf37294559b3a5a"}},{"ruleId":"D2","level":"warning","message":{"text":"FallbackDefinitionProvider.search (cognitive 60): FallbackDefinitionProvider.search has cognitive complexity 60 (threshold 15). Drivers by points: match/switch 7 (30 pts), if/else 9 (19 pts), loops 3 (6 pts), error handling 2 (5 pts) (nesting depth added 39). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/FallbackDefinitionProvider.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6addf2eefadc199776a60759f8a3e0e157aa691fbfe5bec5cb84e33f679ad41"}},{"ruleId":"D2","level":"warning","message":{"text":"CaseKeywordCompletion.contribute (cognitive 60): CaseKeywordCompletion.contribute has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (41 pts), match/switch 5 (13 pts), boolean chains 6 (nesting depth added 28). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeaea65e3e4ac567737c9d50ecf947963cadd14ef8ee1a01af1a51387f5f25b6"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugProvider.startDebugSession (cognitive 58): DebugProvider.startDebugSession has cognitive complexity 58 (threshold 15). Drivers by points: loops 12 (49 pts), match/switch 2 (5 pts), if/else 3, boolean chains 1 (nesting depth added 40). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"9762dd1d82a17d9bb36193652b4a9899477574508ef4bffbe0c66dde1b9f3eee"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageProvider.calcImportEditsForFileMove (cognitive 57): PackageProvider.calcImportEditsForFileMove has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (36 pts), match/switch 7 (17 pts), boolean chains 4 (nesting depth added 22). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/PackageProvider.scala"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0add7bb6c8ad726853e70774c8e49e87b4157a92294ad1e1f26f2531d19e6b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.memberOrdering (cognitive 56): Completions.memberOrdering has cognitive complexity 56 (threshold 15). Drivers by points: if/else 25 (54 pts), boolean chains 1, match/switch 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2ddb39205143f669f7a839e50eeb9b10368e3485c912e60b4f3c70135a5dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalafmtConfig.parse (cognitive 54): ScalafmtConfig.parse has cognitive complexity 54 (threshold 15). Drivers by points: loops 8 (36 pts), if/else 13 (14 pts), error handling 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 31). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ScalafmtConfig.scala"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab67ef3f137aa1ff8fea348b29c2e4d4f6790d67030a6169d17a15d5fd20577"}},{"ruleId":"D2","level":"warning","message":{"text":"ScaladocParser.parseAtSymbol (cognitive 53): ScaladocParser.parseAtSymbol has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 10 (26 pts), if/else 15 (21 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 23). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a2aa465da44d0d84b65e69599b6a24bf785a3d8a5fef75dd1540c3702da3e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalafixProvider.scalafixEvaluate (cognitive 51): ScalafixProvider.scalafixEvaluate has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 4 (10 pts), error handling 1 (6 pts), match/switch 2 (6 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ScalafixProvider.scala"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba26dcb11613be5c7ebba28c7c4be2a1d7117412703a2436409997aa4916c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractMethodProvider.extractMethod (cognitive 51): ExtractMethodProvider.extractMethod has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 7 (14 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 19). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/ExtractMethodProvider.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab74caf00a0a45b4d1fca2db2152d84d6b6619f7d284c9fad012fac83d8e4e61"}},{"ruleId":"D2","level":"warning","message":{"text":"RenameProvider.rename (cognitive 43): RenameProvider.rename has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 6 (13 pts), boolean chains 8 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/rename/RenameProvider.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"796a967623f57156fd7c7ae9e4f5f7d1c6084cefab25e47878f8b666fb36f670"}},{"ruleId":"D2","level":"warning","message":{"text":"SignatureHelpProvider.toSignatureInformation (cognitive 43): SignatureHelpProvider.toSignatureInformation has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 5, loops 2 (5 pts), match/switch 2 (4 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc5c2536aa5282f0ab44ed4c86bcaa0ea7192d3b808b6818bed3c8accd53c53"}},{"ruleId":"D2","level":"warning","message":{"text":"ProblemResolver.findProblem (cognitive 40): ProblemResolver.findProblem has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 10, match/switch 5 (7 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/doctor/ProblemResolver.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdc5ac54f6e20f75dd9a389a27eb553db7360d7a106c59a9706637f118e973d"}},{"ruleId":"D2","level":"warning","message":{"text":"BspConnector.connect (cognitive 39): BspConnector.connect has cognitive complexity 39 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 8 (13 pts), match/switch 6 (10 pts), boolean chains 2 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2fb4e144c4a76851fdb63fa9e6f7d2770f5d1ed90f8e6ebb2975ff0507ee89"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolTraverser.apply (cognitive 39): SymbolTraverser.apply has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 3 (9 pts), match/switch 4 (7 pts), boolean chains 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/DocumentSymbolProvider.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a7c0a3b57718af30fa55f4175cdbf32e3a6194a0a3f291ddba30a31f973d2d"}},{"ruleId":"D2","level":"warning","message":{"text":"HoverProvider.hoverOffset (cognitive 39): HoverProvider.hoverOffset has cognitive complexity 39 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 10 (13 pts), boolean chains 5, match/switch 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/HoverProvider.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"33118716a04f8eacb3d58c41752fe81607dee41177a92360f91099950448df06"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredTypeProvider.inferredTypeEdits (cognitive 39): InferredTypeProvider.inferredTypeEdits has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 7, match/switch 4 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/InferredTypeProvider.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"583518874d1fff716ea93bb524ba59b720aeb7d4c56f1befdc179390367f8c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"PcCollector.traverseSought (cognitive 39): PcCollector.traverseSought has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 5 (10 pts), boolean chains 9 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f05b26e21a778d1a335bb81fba50b96c04cfbf136a2a9328ff0ca42cd472b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractValueCodeAction.contribute (cognitive 38): ExtractValueCodeAction.contribute has cognitive complexity 38 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 5 (15 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 25). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractValueCodeAction.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"67af250ab3761902b7205db4796671c914a0be26373919b5e210a8e20f9026ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Fuzzy.forgivingFirstCharMatcher (cognitive 38): Fuzzy.forgivingFirstCharMatcher has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 7 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/metals/Fuzzy.scala"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a466324553f38b939aa35f009374d1af1ba517eafebe7a8d9228a4755fb1d1a"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportedBuild.fromConnection (cognitive 36): ImportedBuild.fromConnection has cognitive complexity 36 (threshold 15). Drivers by points: loops 8 (36 pts) (nesting depth added 28). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ImportedBuild.scala"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"745ed7643082f383de7b67c8412bbadadce9b920fd6c3f53ce32710ecafe374d"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractValueCodeAction.withInsertNewValueDef (cognitive 36): ExtractValueCodeAction.withInsertNewValueDef has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (28 pts), match/switch 3 (5 pts), loops 2 (3 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractValueCodeAction.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b75a1ab1c133dea85221ddde6e4fa4403f69174c061f84b12bf96f8f6c1bccf"}},{"ruleId":"D2","level":"warning","message":{"text":"ProblemResolver.problemMessage (cognitive 36): ProblemResolver.problemMessage has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22, match/switch 3 (7 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/doctor/ProblemResolver.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f344772558381f4a03ef5228f535ccb9a70ed8440806c714827d6b52eda1a7ef"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodCallTraverser.visit (cognitive 36): MethodCallTraverser.visit has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 2 (6 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"69979d4dd96d3019204f91b563bbddf0e1b4d0bde81c8624b8408f4d1f73787f"}},{"ruleId":"D2","level":"warning","message":{"text":"ForwardingMetalsBuildClient.buildTaskFinish (cognitive 35): ForwardingMetalsBuildClient.buildTaskFinish has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (5 pts), match/switch 2 (5 pts), error handling 1 (4 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ForwardingMetalsBuildClient.scala"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6be9670e8444648cbe81dc79ab2d1c27e6b2f3427d921c28ec9871e021c565b"}},{"ruleId":"D2","level":"warning","message":{"text":"JavadocParser.extractParamTags (cognitive 35): JavadocParser.extractParamTags has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/JavadocParser.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"86de098fce213688af642b600a5164cb7b2e9a193d4eb3f76c631ff05b07b3a5"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaFormattingProvider.runFormat (cognitive 34): JavaFormattingProvider.runFormat has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 4 (14 pts), error handling 2, boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/JavaFormattingProvider.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b72d79c276b5429da52b81c608fd77cb856227797a1a6e5b681d2fbfddee289"}},{"ruleId":"D2","level":"warning","message":{"text":"Diff.toRevised (cognitive 34): Diff.toRevised has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 12 (15 pts), boolean chains 3 (nesting depth added 11). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d81fd0b4223927da5d70bcf6228b344b4b6efc2e8eef15ec592c15c34173a6"}},{"ruleId":"D2","level":"warning","message":{"text":"OverrideCompletions.getMembers (cognitive 34): OverrideCompletions.getMembers has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22 (23 pts), boolean chains 7, match/switch 2 (3 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"21385ae478bdad19f284c1c5edce43a51316fd23ce8ef0b989f5b750b8b403a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceProvider.references (cognitive 33): ReferenceProvider.references has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 2 (5 pts), boolean chains 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ReferenceProvider.scala"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e8906b11d5a18dce1d36350d6aad4109d4b9b7cece7653f9b77566f344e554"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassfileParser.parseMethod (cognitive 33): ClassfileParser.parseMethod has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (14 pts), boolean chains 4 (nesting depth added 17). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"360384825bce1c5aa13ef0a6dc72cb696ab2b28a769a6b5d0f702565599535f0"}},{"ruleId":"D2","level":"warning","message":{"text":"HoverProvider.toHover (cognitive 33): HoverProvider.toHover has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 7 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/HoverProvider.scala"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed615318355ec00d7bf6883a34020f30e38665035fb8608adfe9c9746098cc8d"}},{"ruleId":"D2","level":"warning","message":{"text":"Connect.bloopInstallAndConnect (cognitive 32): Connect.bloopInstallAndConnect has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3 (13 pts), loops 3 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ConnectionProvider.scala"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a1ad4de22573f88ce5af7cf5e441ffb2b9a94504219721fa64a9f28fa12205"}},{"ruleId":"D2","level":"warning","message":{"text":"WikiParser.table (cognitive 32): WikiParser.table has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22 (25 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbea1c6a41148fa401c61f225ad76ab5c7ba1961129a1fdcdf002d804042af3b"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSystemSemanticdbs.textDocument (cognitive 31): FileSystemSemanticdbs.textDocument has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (9 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 18). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/FileSystemSemanticdbs.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2d699a9aa8ff43632d777bf9c9dc2ab8bb3ad8de7f0ab2ddb6691a3c380028"}},{"ruleId":"D2","level":"warning","message":{"text":"FormattingProvider.inspectDialectRewrite (cognitive 31): FormattingProvider.inspectDialectRewrite has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/FormattingProvider.scala"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70630f30b4caaa531560ad7191b0e097b07348d5ef5615328fde43a1128819a"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassfileParser.parseClass (cognitive 31): ClassfileParser.parseClass has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 10). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bfa2571a0334f8ec4fa31aee55c5237dc16488d21037b8c794170281e66b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaToplevelMtags.fetchToken (cognitive 31): JavaToplevelMtags.fetchToken has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (17 pts), match/switch 6 (10 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/JavaToplevelMtags.scala"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"746266af17ce6abefb4af07dab3870bb3a083ac5a4af4072163916b2278f5e37"}},{"ruleId":"D2","level":"warning","message":{"text":"SbtBuildTool.checkCorrectJavaVersion (cognitive 30): SbtBuildTool.checkCorrectJavaVersion has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (14 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/builds/SbtBuildTool.scala"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4455c1d0ffb2dd14168e607dbdd63402116701d872ec807bf6f8c69f4158443"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveSemanticdbs.textDocument (cognitive 30): InteractiveSemanticdbs.textDocument has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 6, match/switch 2 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/InteractiveSemanticdbs.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37e26b8fde642982cd9780b782506d857ee1f7a4c63f56563a5e0ba1a664295"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoImportsProvider.autoImports (cognitive 30): AutoImportsProvider.autoImports has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 6, match/switch 6 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/AutoImportsProvider.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d747522b801e34da66c3f7bcd1408c2c485ac32161ca2ecd657245eb6f740a52"}},{"ruleId":"D2","level":"warning","message":{"text":"Visitor.visitClass (cognitive 30): Visitor.visitClass has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 7 (11 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0dcf8e2a9efc8784e60993cf80ff49d8dc3ec85a75a7b15d87646523c19811"}},{"ruleId":"D2","level":"warning","message":{"text":"Embedded.fallbackDownload (cognitive 29): Embedded.fallbackDownload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 4 (8 pts), error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Embedded.scala"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef08794389f000b2bc34c4a674d5d32171a714081ed0966d1cfcd7af78c4379"}},{"ruleId":"D2","level":"warning","message":{"text":"MetalsPasteProvider.didPaste (cognitive 29): MetalsPasteProvider.didPaste has cognitive complexity 29 (threshold 15). Drivers by points: loops 4 (16 pts), if/else 7 (11 pts), boolean chains 1, match/switch 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MetalsPasteProvider.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"472410eb603eec3619f23411a89c79976e25d5231a7cd77490f1f7a9eb59ca21"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectWarnings.noSemanticdb (cognitive 29): ProjectWarnings.noSemanticdb has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 3 (6 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Warnings.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa5ceae7ef0acf7509a41118117a2614bfdca3f81450c81da4609056b8226b6"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalafixProvider.runScalafixRules (cognitive 28): ScalafixProvider.runScalafixRules has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (5 pts), boolean chains 4, match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ScalafixProvider.scala"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f81d10dfaf4764662f7944ad0c7191a5fb553e9ee154564a93a9acfea13e56"}},{"ruleId":"D2","level":"warning","message":{"text":"MetalsMcpTools.createFileCompileTool (cognitive 28): MetalsMcpTools.createFileCompileTool has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (10 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a044c9464595df8712d0dfc7a3d79e34c53736b31e02715a76b324854545582a"}},{"ruleId":"D2","level":"warning","message":{"text":"PcSemanticTokensProvider.makeNode (cognitive 28): PcSemanticTokensProvider.makeNode has cognitive complexity 28 (threshold 15). Drivers by points: if/else 23 (24 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcSemanticTokensProvider.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef08c3989140827d94c5c68a93f020dddf92481971638ed3f3599c6609ca21ce"}},{"ruleId":"D2","level":"warning","message":{"text":"SignatureHelpProvider.toSignatureHelp (cognitive 28): SignatureHelpProvider.toSignatureHelp has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (7 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"66814798396a1d488e198314fdd6ff661b61f37dd2c22a37bc7c0840f75e4451"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerConfiguration.enrichWithReleaseOption (cognitive 27): CompilerConfiguration.enrichWithReleaseOption has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 6 (9 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/CompilerConfiguration.scala"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"382a632f4f57d59a422d4d23882d1530a225d298f202f84ed828e8cf64006495"}},{"ruleId":"D2","level":"warning","message":{"text":"Compilers.semanticTokens (cognitive 27): Compilers.semanticTokens has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 2 (4 pts), boolean chains 3, error handling 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Compilers.scala"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f300ac918b44af4782f1cc84fc571579c8f4de4e2ba12e3cece81525edb70f"}},{"ruleId":"D2","level":"warning","message":{"text":"XtensionAbsolutePathBuffers.toFileOnDisk0 (cognitive 27): XtensionAbsolutePathBuffers.toFileOnDisk0 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"6688d1af4d78ace21b8a6b94c597399d10e997a2392dd8e76f22aefd7879ea7d"}},{"ruleId":"D2","level":"warning","message":{"text":"UserConfiguration.fromJson (cognitive 27): UserConfiguration.fromJson has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9, match/switch 7 (9 pts), loops 5 (7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/UserConfiguration.scala"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d28ad91ecdbc461ee41b9b70d9bd5545ccde39981d26c67ee08b5ba31250ba"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexedSymbols.jarSymbols (cognitive 27): IndexedSymbols.jarSymbols has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 3 (9 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/tvp/IndexedSymbols.scala"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6065978e46d7f3d6a4c7f87f1876b81400775a7b437c1aeade7d6874c99ffe9a"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionItemResolver.fullDocstring (cognitive 27): CompletionItemResolver.fullDocstring has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (20 pts), match/switch 1 (4 pts), boolean chains 2, error handling 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/CompletionItemResolver.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a016484a6182c045942ea7b8d3829207209e91d9e70f33b2e9af26a71fb0087a"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplicitParameters.partsFromImplicitArgs (cognitive 27): ImplicitParameters.partsFromImplicitArgs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 2 (3 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcInlayHintsProvider.scala"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacc9da9d3904f6bd879c11b6618b58be7e2a99a5a26a0414843405a591dbd62"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionProvider.reloadWorkspaceAndIndex (cognitive 26): ConnectionProvider.reloadWorkspaceAndIndex has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (9 pts), match/switch 4 (6 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ConnectionProvider.scala"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"719109e5560d5ae708b21e407ccbd5d7d6ff911c9a975f39694df72c8c246610"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceSymbolProvider.workspaceSearch (cognitive 26): WorkspaceSymbolProvider.workspaceSearch has cognitive complexity 26 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 4 (6 pts), boolean chains 2, match/switch 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccda11d79816ab76c0cba4f02ec873513ec8ef576603ae469e9cf87939939cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Fuzzy.bloomFilterQueryStrings (cognitive 26): Fuzzy.bloomFilterQueryStrings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (5 pts), loops 1 (2 pts), boolean chains 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/metals/Fuzzy.scala"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f59c3cda9d14d1952cc78d9fe8a0734961c48fcd209a15b49df553b83439d8"}},{"ruleId":"D2","level":"warning","message":{"text":"McpMain.parseArgs (cognitive 25): McpMain.parseArgs has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 5 (7 pts), boolean chains 2 (nesting depth added 11). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals-mcp/src/main/scala/scala/meta/metals/McpMain.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3745ca830b1bbe3e67b7019455dd617cf023841b107759585b82f79b742681"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceLspService.executeCommand (cognitive 25): WorkspaceLspService.executeCommand has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 5 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1102fccd60e92ddad9db3cec05c55913a2961aca303c25183e7e87def3a50bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ClasspathTreeView.children (cognitive 25): ClasspathTreeView.children has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/tvp/ClasspathTreeView.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef7942237bc39216be9a603ab07db120bdb0f4abd9f06c57881e8c2ef36ff29"}},{"ruleId":"D2","level":"warning","message":{"text":"PcDefinitionProvider.definitionTypedTreeAt (cognitive 25): PcDefinitionProvider.definitionTypedTreeAt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, match/switch 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcDefinitionProvider.scala"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1998d093b3f4ccbfaa47c97d597067a5bb9df83e03ec2b8598dac241b331e972"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplementationProvider.toPcSymbolInfo (cognitive 24): ImplementationProvider.toPcSymbolInfo has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 5 (8 pts), if/else 5, boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/implementation/ImplementationProvider.scala"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"f562d1e56678a6f9a6f532a99ba6cb0906ccd0809539f562218207cec32cef82"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceProvider.referenceAlternatives (cognitive 24): ReferenceProvider.referenceAlternatives has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 7 (9 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ReferenceProvider.scala"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd202011a1534bf9c3cae0941ffccc212e2267832a891e73093615c4ac28cbc0"}},{"ruleId":"D2","level":"warning","message":{"text":"StringActions.contribute (cognitive 24): StringActions.contribute has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 5 (7 pts), boolean chains 5 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/StringActions.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d25d59a1d06179b8a8dcb31a3d05435b5e63cb155f336e3e3757beccaf82902"}},{"ruleId":"D2","level":"warning","message":{"text":"BloopDiagnosticsParser.getDiagnosticsFromErrors (cognitive 24): BloopDiagnosticsParser.getDiagnosticsFromErrors has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (10 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/BloopDiagnosticsParser.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2693020aaae8c62fbc81ae563054a9e8119e637ee28b4cbeffd60ba92df13d47"}},{"ruleId":"D2","level":"warning","message":{"text":"Foldable.unapply (cognitive 24): Foldable.unapply has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (7 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/FoldingRangeExtractor.scala"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b05cadba4d82b4cd6a0cd88f7e39c43590268382e645111640a7fccd8d3f532"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaDefinitionProvider.definitionImpl (cognitive 24): JavaDefinitionProvider.definitionImpl has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08d419fb628e45fef423ed455c75f9b9f33d1a8de2f67c93fd325ba2946e828"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredMethodProvider.makeEditsMethodObject (cognitive 24): InferredMethodProvider.makeEditsMethodObject has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 4 (11 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/InferredMethodProvider.scala"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77ec6616ea9f6aa3cc6e9904b4eb827657af45b8fc5a92c8169038a4cb42f4f"}},{"ruleId":"D2","level":"warning","message":{"text":"PcDefinitionProvider.definition (cognitive 24): PcDefinitionProvider.definition has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (5 pts), boolean chains 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcDefinitionProvider.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cf034a3e351ddaf3e022ccd3024fd56a9cfdd320ab5673803d27b06d173892"}},{"ruleId":"D2","level":"warning","message":{"text":"WikiLink.atOffset (cognitive 24): WikiLink.atOffset has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/WikiLink.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"970996ec1e4d7640756e3a413cebb955030cfaa819c74fd4eeab6868b6f97b52"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildTargetInfo.buildTargetDetail (cognitive 23): BuildTargetInfo.buildTargetDetail has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20 (23 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/BuildTargetInfo.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7062d92ca10fb6879f4f8f062e6a48f2143cfe84039f7f8ec50f13e4e8de3be"}},{"ruleId":"D2","level":"warning","message":{"text":"Fuzzy.matchesName (cognitive 23): Fuzzy.matchesName has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/metals/Fuzzy.scala"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2677a73e61275dc4a7563cf1fb51de559c51f0a693b7c9ed4f373648966c03b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.indexWorkspace (cognitive 22): Indexer.indexWorkspace has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 4 (8 pts), error handling 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Indexer.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70e1f861c9c15bb0289a3c0268500fbfa198271f177f09a7b4425e242aae35e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractRenameMember.calculate (cognitive 22): ExtractRenameMember.calculate has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 3 (6 pts), if/else 3, boolean chains 2 (nesting depth added 10). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractRenameMember.scala"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"9516e662624c454480564d3ecc1899686cd45b8ef519df07bba7d5c59f754f2c"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaCliServers.start (cognitive 22): ScalaCliServers.start has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/scalacli/ScalaCliServers.scala"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca439a6bb46fff4977e40149452a38f9904ab0c57c1ad19ef6e19aa4d45602d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeHierarchyProvider.subtypes (cognitive 22): TypeHierarchyProvider.subtypes has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/typeHierarchy/TypeHierarchyProvider.scala"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"07db567d228cfd0b5441cb04dae2c3dff1fc36bba26eda88c544328630a16dc7"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassFinder.findClassNameForOffset (cognitive 22): ClassFinder.findClassNameForOffset has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/ClassFinder.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"daabe2826d6e52d2f7f06a2b9b8010f7c1898a5bc51b26dab7f5ac93d994a4f2"}},{"ruleId":"D2","level":"warning","message":{"text":"RenameProvider.findRealRange (cognitive 22): RenameProvider.findRealRange has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/rename/RenameProvider.scala"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e26b123332ba638e328752f04d07c31c75d310087b7602f071b323403506e07"}},{"ruleId":"D2","level":"warning","message":{"text":"XtensionSymbolSSpec.descriptor (cognitive 22): XtensionSymbolSSpec.descriptor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e0067f802ddc8f29bc320328220a0e84fb892281a025762b7ffbc64de8a612"}},{"ruleId":"D2","level":"warning","message":{"text":"XtensionGSymbolSSymbolInformation.kind (cognitive 22): XtensionGSymbolSSymbolInformation.kind has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2450a93104148f1139a93582b33547a8cf83d192f021a65a933ace9e697250dd"}},{"ruleId":"D2","level":"warning","message":{"text":"SignatureHelpProvider.treeSymbol (cognitive 22): SignatureHelpProvider.treeSymbol has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 7, loops 2 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f176f882326751d65c8254e7bcd0f3c477420795215c88ec7c552f030065742"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.inferCompletionPosition (cognitive 22): Completions.inferCompletionPosition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e369fc7da6bdbbea1131ed65c52d8c9504df6f7c5da7095b1ec7b6b26c4d66"}},{"ruleId":"D2","level":"warning","message":{"text":"Compilers.loadCompiler (cognitive 21): Compilers.loadCompiler has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2, match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Compilers.scala"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e88bbb54478123693d67cb9646287cae061c94e4c4d46ed9d739a8df6db277"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.indexDependencyModules (cognitive 21): Indexer.indexDependencyModules has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 2 (7 pts), loops 3 (6 pts), error handling 1 (5 pts), if/else 2, boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Indexer.scala"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e80fe470b40925bf98e67d7f5edf50e08a1895851d335b67bd1b6d4b881a896"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectMetalsLspService.maybeImportScript (cognitive 21): ProjectMetalsLspService.maybeImportScript has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (9 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd4e72ed20542c0c7c4ebaf56cf44cbb4bcf7216783846a8e5cd7499b369c05"}},{"ruleId":"D2","level":"warning","message":{"text":"RewriteBracesParensCodeAction.switchFrom (cognitive 21): RewriteBracesParensCodeAction.switchFrom has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (7 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/RewriteBracesParensCodeAction.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29f7ba7d7a3db25e7ef488a0f6d0f83dabc0a16239c4fdb2d699c36cd9efa53"}},{"ruleId":"D2","level":"warning","message":{"text":"McpConfig.getPort (cognitive 21): McpConfig.getPort has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (20 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/mcp/McpConfig.scala"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"8385c6f279635f89b75ad2a7938bc2d77438e45b359a6e1c1a2bcde1b3ace514"}},{"ruleId":"D2","level":"warning","message":{"text":"SignatureHelpProvider.cursor (cognitive 21): SignatureHelpProvider.cursor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1f535cc4bd4b80c4eb35908560e51c62f3848da36ea601852c0d8ed8d7a48f"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaCliBspScope.scalaCliBspRoot (cognitive 20): ScalaCliBspScope.scalaCliBspRoot has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 1 (4 pts), if/else 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/bsp/ScalaCliBspScope.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19acc41c26828bd0d9d4f8c980d53e87262dc85db52e1572da3e9ac736b04ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Supermethods.getGoToSuperMethodLocation (cognitive 20): Supermethods.getGoToSuperMethodLocation has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (5 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/implementation/Supermethods.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0952df83a1aede3f07a1caf625680ee8861d0d8b12abf795e12f89ae62302f4f"}},{"ruleId":"D2","level":"warning","message":{"text":"MetalsLspService.definitionOrReferences (cognitive 20): MetalsLspService.definitionOrReferences has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb814237116ec0aef6cf8f301c9eaec6dafd091c5d27fdc767a7ff3f9670a55"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectMetalsLspService.onUserConfigUpdate (cognitive 20): ProjectMetalsLspService.onUserConfigUpdate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74199f84c4873b693c83ae2e969cd1c93f897127c96e09cc4c09270fc8fb02e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalafixProvider.getScalafixConf (cognitive 20): ScalafixProvider.getScalafixConf has cognitive complexity 20 (threshold 15). Drivers by points: error handling 2 (6 pts), if/else 4 (5 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ScalafixProvider.scala"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"412b0fc7658a11d1c5e6fc5d72752561dbf36d234d66c0af75520f56b47ad37b"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfiguredLanguageClient.metalsStatus (cognitive 20): ConfiguredLanguageClient.metalsStatus has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 7 (8 pts), boolean chains 2 (nesting depth added 6). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/clients/language/ConfiguredLanguageClient.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f5f3afc7e28fee3616415bd17d71a23d7e0345aadfce787471464e7ce0946a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractRenameMember.contribute (cognitive 20): ExtractRenameMember.contribute has cognitive complexity 20 (threshold 15). Drivers by points: loops 2 (7 pts), boolean chains 5, match/switch 3 (5 pts), if/else 3 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractRenameMember.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb757fbf090f449c349faee12ee170f90adee52b0b35283c68352c7c52fa6d9"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugProvider.retryAfterRebuild (cognitive 20): DebugProvider.retryAfterRebuild has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 1, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d047f22f38a27e0aba15c54bf627c49fbe455b12a32c02f0419780cbfdd358"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugProxy.modifyLocationInTests (cognitive 20): DebugProxy.modifyLocationInTests has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (13 pts), match/switch 2 (5 pts), if/else 2 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/DebugProxy.scala"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a109b254d70e3ab167949ae881c2f8bc33cd22450d139885904dfe4aff6ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugeeParamsCreator.create (cognitive 20): DebugeeParamsCreator.create has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), error handling 1 (5 pts), match/switch 1 (5 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/server/DebugeeParamsCreator.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1925ff07149abcc263daee18ae4fe179099f54f5ecd1bdefee16b9400ea8b295"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoImports.autoImportPosition (cognitive 20): AutoImports.autoImportPosition has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (5 pts), loops 2 (4 pts), boolean chains 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/AutoImports.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2c87678aeebe41c805feff7845574499232987cf7547349dff7c6092aa78d2"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionProvider.safeCompletionsAt (cognitive 20): CompletionProvider.safeCompletionsAt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 5 (6 pts), match/switch 3 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3acecb18098f90165fe8a7c2902bfd0ae53b09542f103130ef7ceb5aa09802"}},{"ruleId":"D2","level":"warning","message":{"text":"MetalsGlobal.inverseSemanticdbSymbols (cognitive 20): MetalsGlobal.inverseSemanticdbSymbols has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (5 pts), error handling 2 (3 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"15583905ad66ab5db53956bee77ea6a3f8667959e6005e2f7b9cd20cbaca90a7"}},{"ruleId":"D2","level":"warning","message":{"text":"WikiParser.parseInline (cognitive 20): WikiParser.parseInline has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d794c5060a6cf745f973e3de16f031f3dcd3e8c5f85f32cb72669e1341e62aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Connect.disconnect (cognitive 19): Connect.disconnect has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 4 (6 pts), match/switch 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ConnectionProvider.scala"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b1bae00d82702a7b7bede52fa6a09c7ce40ffbe5ea144a99451cd522e92852"}},{"ruleId":"D2","level":"warning","message":{"text":"FileDecoderProvider.findBuildTargetMetadata (cognitive 19): FileDecoderProvider.findBuildTargetMetadata has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (9 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/FileDecoderProvider.scala"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad0e6fd8aa73ac8672ee7505859900588b3a8d7dcfa670236a3a86b1d6eb580"}},{"ruleId":"D2","level":"warning","message":{"text":"ForwardingMetalsBuildClient.buildTaskProgress (cognitive 19): ForwardingMetalsBuildClient.buildTaskProgress has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (16 pts), match/switch 2, if/else 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ForwardingMetalsBuildClient.scala"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40a5ede81e7e41db8f41ad675d09d8a55f0568ef8d07118c46e301a6b708e75"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageProvider.findTopLevelDecls (cognitive 19): PackageProvider.findTopLevelDecls has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (3 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/PackageProvider.scala"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b49d41efab21b62ad17f215ae5827ad40fabf168caa3f8a04fe13b49662e24"}},{"ruleId":"D2","level":"warning","message":{"text":"StacktraceAnalyzer.toToplevelSymbol (cognitive 19): StacktraceAnalyzer.toToplevelSymbol has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/StacktraceAnalyzer.scala"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"92316de1b3eb8202005e133eeb300b6daddbf9adcbe956cca9e1873bbfd24a45"}},{"ruleId":"D2","level":"warning","message":{"text":"MetalsHttpClient.completeCommand (cognitive 19): MetalsHttpClient.completeCommand has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/clients/language/MetalsHttpClient.scala"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe75bda8a1698250a378c1675f6127b4f8d0b2369ea9032e40e5ad42e0343dc"}},{"ruleId":"D2","level":"warning","message":{"text":"HoverMarkup.apply (cognitive 19): HoverMarkup.apply has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"429e3286035219f79295dc24443158c6ed74decae9e877638d70566928a957eb"}},{"ruleId":"D2","level":"warning","message":{"text":"WithCompilationUnit.symbolAlternatives (cognitive 19): WithCompilationUnit.symbolAlternatives has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/WithCompilationUnit.scala"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9286c8438b0c7793b6781ab0e2cc87a0f5ea997755c8a50c4fed9a70431a95f"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.inferIdentOffsets (cognitive 19): Completions.inferIdentOffsets has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57e8bbb25d5772c059d58dc018ab6fa9d10c8326aa38811a75dffeecd6a5992"}},{"ruleId":"D2","level":"warning","message":{"text":"MetalsLocator.traverse (cognitive 19): MetalsLocator.traverse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15c3f375db64930399c9668567078fa26cc6aca4403bc309aedb38ac59a5f11"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionValueGenerator.toCaseMember (cognitive 19): CompletionValueGenerator.toCaseMember has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"491e02d08d7b6f8c84b18afa6ec0f7de795c870c3d7e9d996bdf6227cca231ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Compilers.debugCompletions (cognitive 18): Compilers.debugCompletions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (2 pts), boolean chains 1, match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Compilers.scala"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1274fa3ae9e4aba5093622629cfc1aa94066bf35a00ba3ef3b96ee870008a7a0"}},{"ruleId":"D2","level":"warning","message":{"text":"Connect.createSession (cognitive 18): Connect.createSession has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 4 (7 pts), if/else 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ConnectionProvider.scala"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"671f57445077b508f97440294e86447f813221be942d45ec3242342cc41a8805"}},{"ruleId":"D2","level":"warning","message":{"text":"FlatMapToForComprehensionCodeAction.turnPatToTerm (cognitive 18): FlatMapToForComprehensionCodeAction.turnPatToTerm has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/FlatMapToForComprehensionCodeAction.scala"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad17b51cecd078329b0e4fbdbf300ecc70e9034cb04d69e3e06b5b8aa7ecef6"}},{"ruleId":"D2","level":"warning","message":{"text":"IndentOnPaste.contribute (cognitive 18): IndentOnPaste.contribute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/formatting/IndentOnPaste.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f42b09e80e15dbe488dd3e811035db08ddaad64caa150319458219c45022ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassfileComparator.compare (cognitive 18): ClassfileComparator.compare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/metals/ClassfileComparator.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b70fb6d927fdd94ce92d6575d0faa2c88a0808061d24b61d33b1ddb3945c70"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpolationSplice.apply (cognitive 18): InterpolationSplice.apply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6, match/switch 4 (6 pts), boolean chains 5, loops 1 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/pc/InterpolationSplice.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e52b8b9b2a68e8d94b486b71a2332a9f2c22d7dbd78e325da482481a5d9ff56"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionProvider.filterInteresting (cognitive 18): CompletionProvider.filterInteresting has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cd6bfc3b3a0a257e9a5950fb9e5cfb8f3dee44b94e5d93f23c21e621feb6ed"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalaDocPrinter.toText (cognitive 18): ScalaDocPrinter.toText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/printers/ScalaDocPrinter.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"babff1284e056b3ffd48813941e04ad63683a37da177a9df98714e366951ae50"}},{"ruleId":"D2","level":"warning","message":{"text":"BspConnector.switchBuildServer (cognitive 17): BspConnector.switchBuildServer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d452e4abdf2f1b69cd7da5e2b22f1b90c3ac1938dc653261b8e03667c8eddb79"}},{"ruleId":"D2","level":"warning","message":{"text":"BloopInstall.runIfApproved (cognitive 17): BloopInstall.runIfApproved has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (7 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/builds/BloopInstall.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"235ae83fca541063c3a629f24410fdf6a66dbab70ce50959516bc820307fdbaf"}},{"ruleId":"D2","level":"warning","message":{"text":"DefinitionProviderReportBuilder.build (cognitive 17): DefinitionProviderReportBuilder.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 5 (7 pts), boolean chains 3 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/DefinitionProvider.scala"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"4697f146cc1c4309b68fcd69832a27f109e76b6e27e95ab40e196126242cf7d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Embedded.findInPath (cognitive 17): Embedded.findInPath has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Embedded.scala"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"406cd46bbf8d705efc71308185bd3dbff2300a02bd653ab4fe59026a55100f46"}},{"ruleId":"D2","level":"warning","message":{"text":"FormattingProvider.formatForMcp (cognitive 17): FormattingProvider.formatForMcp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), error handling 4 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/FormattingProvider.scala"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"db821f0a7a1bd446edf0581a0701e144a8bd1b7968ffa44b77995f1882d5163d"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.indexSourceFile (cognitive 17): Indexer.indexSourceFile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, match/switch 1 (2 pts), error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Indexer.scala"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a688f5cb0988715642f68c5eabf8e1fc8b151e7bf8b294d20b39657d7085961f"}},{"ruleId":"D2","level":"warning","message":{"text":"Default.resolve (cognitive 17): Default.resolve has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 5, error handling 2 (nesting depth added 4). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75cbb50fca521610c7a1622be8564457c9e317da02bc9c14b880fd32e4320f9"}},{"ruleId":"D2","level":"warning","message":{"text":"SourcePathAdapter.toDapURI (cognitive 17): SourcePathAdapter.toDapURI has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 2, boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/SourcePathAdapter.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d76f5757d2e723691d04a2910b8fbf0b5c7abd718b8d08431aa8173727b600"}},{"ruleId":"D2","level":"warning","message":{"text":"FoldingRangeExtractor.extractCommentRanges (cognitive 17): FoldingRangeExtractor.extractCommentRanges has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/FoldingRangeExtractor.scala"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"711215378d74de9f29484c5f9aaa14594ab3889fa68b5b97dcd3dd03745ea43a"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenEditDistance.apply (cognitive 17): TokenEditDistance.apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, match/switch 3 (6 pts), boolean chains 4 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea4e956f7e7226289354576c4c7237a8fef80f61240b49a78397401136627aa"}},{"ruleId":"D2","level":"warning","message":{"text":"XtensionGSymbolSSymbolInformation.access (cognitive 17): XtensionGSymbolSSymbolInformation.access has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"968b16483e19504170639b80c76ba663f54a8db4560df86956a070e6060dd60b"}},{"ruleId":"D2","level":"warning","message":{"text":"Keyword.matchesPosition (cognitive 17): Keyword.matchesPosition has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 17. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/pc/Keyword.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbf254a1eebd9e315d2add0a303ff8681d5d5b5250c74b414c54072d868a77b"}},{"ruleId":"D2","level":"warning","message":{"text":"MetalsGlobal.addCompilationUnit (cognitive 17): MetalsGlobal.addCompilationUnit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda44faeb654f2e2b1f89d0d1181f000df441cea46609a863dcdc08cfa7f1ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceSymbolSearch.info (cognitive 17): WorkspaceSymbolSearch.info has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/WorkspaceSymbolSearch.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4709d37c488574c79575ea36a9dc2c9fdfab6237274225c2b1b7dd20be1004c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ScaladocParser.createComment (cognitive 17): ScaladocParser.createComment has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8 (9 pts), if/else 7, error handling 1 (nesting depth added 1). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ea27e7563a1b977c7c0e83ccac32c4f8711b85302a7a4a624bddfc0563cc02"}},{"ruleId":"D2","level":"warning","message":{"text":"Visitor.visitVariable (cognitive 17): Visitor.visitVariable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee26b4f980d80efa03011629085c43e3d66416eadd53f590d6528e5e5c58a34"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildTargets.inferBuildTargets (cognitive 16): BuildTargets.inferBuildTargets has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), loops 2 (5 pts), if/else 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/BuildTargets.scala"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6de035ece341904ebae6b9e9d817ff864b1e4351a2578db0150da01f773a23"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientConfiguration.hoverContentType (cognitive 16): ClientConfiguration.hoverContentType has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (6 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ClientConfiguration.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"89202e193c1d87ff060ba9d325b338743f417a3a0e63b358dcc673e8298b9715"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleStatus.refresh (cognitive 16): ModuleStatus.refresh has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (10 pts), loops 2 (5 pts), if/else 1 (nesting depth added 9). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ModuleStatus.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0a4b55e0f298ea5b7d44c5512658ca120f1ba6d14a1a9bb7dbe17033b66f52"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageProvider.calcFullyQuilifiedEdits (cognitive 16): PackageProvider.calcFullyQuilifiedEdits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (6 pts), match/switch 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/PackageProvider.scala"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"191beea399c4582341a01859345bc86ebf6a677e3ad9deb373a13a5b3bb47e01"}},{"ruleId":"D2","level":"warning","message":{"text":"StdReporter.create (cognitive 16): StdReporter.create has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (5 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ReportContext.scala"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"35eb2821ef8f430bdcec6c59552706ce925670e1d54285e8b54f879dc0298161"}},{"ruleId":"D2","level":"warning","message":{"text":"InsertInferredType.contribute (cognitive 16): InsertInferredType.contribute has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), match/switch 4 (5 pts), if/else 2 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/InsertInferredType.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"892e1080a9b9467ac535778209e190ab6d7aceb82fb27be227f6193fab55efe0"}},{"ruleId":"D2","level":"warning","message":{"text":"OrganizeImports.contribute (cognitive 16): OrganizeImports.contribute has cognitive complexity 16 (threshold 15). Drivers by points: loops 2 (7 pts), if/else 5 (6 pts), match/switch 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/OrganizeImports.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5138dbf8518a07c816126a9de5bdfdefee863c05f370693f04f1b84b6201df45"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugDiscovery.validate (cognitive 16): DebugDiscovery.validate has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/DebugDiscovery.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a666ad735d957693a92119fe62df7b2172203a11aa62a314654da07d1d600587"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassFinder.findAllClasses (cognitive 16): ClassFinder.findAllClasses has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/parsing/ClassFinder.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c06f9124fd0aab8ff53adb7d67a091d64aa3ac6861c11ef4616b8d8362f2a23"}},{"ruleId":"D2","level":"warning","message":{"text":"TrigramSubstrings.fromLists (cognitive 16): TrigramSubstrings.fromLists has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (6 pts), boolean chains 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/metals/TrigramSubstrings.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"016e99a8e999bd38b05b7e73be25b78227662f362196256b9b6a0094e6b07900"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemResolver.enrichDocs (cognitive 16): ItemResolver.enrichDocs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, match/switch 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/pc/ItemResolver.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5baad6dddb10b3576fec331d8b09b3ed4c398827b3c4f5cf7babe8f060e1f6"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassfileParser.parseField (cognitive 16): ClassfileParser.parseField has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbafc644091a088d495c8d5e57867b7c26d2917cabc96f928368047e3ff1cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"PcCollector.resultWithSought (cognitive 16): PcCollector.resultWithSought has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 3, match/switch 1. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24c4f8d88f5700ea38be1823d9254cabb4265a7c8f672b91b0451f9331d3973"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeParameters.getInlayHints (cognitive 16): TypeParameters.getInlayHints has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 5, boolean chains 3 (nesting depth added 5). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcInlayHintsProvider.scala"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efd0769a5f9dc3c51eaf9e4ff1558a1d4cd2cee2e04d6a08ba74f07e36af388"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.computeRelevancePenalty (cognitive 16): Completions.computeRelevancePenalty has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04aef51be0186da7b6b73d6de9e679f9857fc8876a4b69241883358eb15ea7d"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpolatorCompletions.interpolatorMemberSelect (cognitive 16): InterpolatorCompletions.interpolatorMemberSelect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/InterpolatorCompletions.scala"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"911fb59f8bda9bb7bb9b91bea34721969eafb5d51a986a0036cce247ca3f8e69"}},{"ruleId":"D2","level":"warning","message":{"text":"OverrideCompletions.implementAll (cognitive 16): OverrideCompletions.implementAll has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fe5104830e9423fe2f4acbcbac677e91e2038ddc8201c8fc757435fa841a85"}},{"ruleId":"D2","level":"warning","message":{"text":"Visitor.findNameRange (cognitive 16): Visitor.findNameRange has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, loops 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f57a3134c753555cfaf6c4617fff40a5082df7e7da7d60e709f1bc36e733d8"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolIndexBucket.modulePaths (cognitive 16): SymbolIndexBucket.modulePaths has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/SymbolIndexBucket.scala"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae6316ce30f51bf1ad5e702f796ba7fe66d98a622330acb4add1d2c6aa9207e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptFirstImportPosition.skipComments (cognitive 16): ScriptFirstImportPosition.skipComments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, match/switch 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/pc/ScriptFirstImportPosition.scala"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ebd77c033f24757967f09943488b9ed938242725f074d7ed04b9b046b93248"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScaladocParser.parseWikiAtSymbol: MethodTooLong \u2014 parseWikiAtSymbol runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.21\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9af536f460eac900240d17cddfd59b52e05ce8ad566077d39369fedaaa8eeb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MetalsLspService: TooManyMethods \u2014 91 methods. The bar is 30 methods; this is 61 over it, 3.03\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f536db91bf2cc1bf905da356a597807991c2e4510925500b4e018b9ac54c3a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkspaceLspService: ClassTooLong \u2014 1171 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 771 over it, 2.93\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ac6b072993fc36812cee75163bf6575af7fdfb98e6e213ed55846e2a886208"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/Compilers.scala: FileTooLong \u2014 1383 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: Compilers (79-1851). The bar is 500 significant lines; this is 883 over it, 2.77\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Compilers.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4ff9fe99d7a02e25e60d3d8b3e1977f751eb5fb24974973594c570805d5b13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/MetalsLspService.scala: FileTooLong \u2014 1372 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 872 over it, 2.74\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de7d278906149d3c50fcc0017c7c3a348f60bbf5c54d6f9de8cce70e45ace2b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BuildTargets: TooManyMethods \u2014 79 methods. The bar is 30 methods; this is 49 over it, 2.63\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/BuildTargets.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d99bd0cd8a9b5faef1ce409c4e85210a80330ed6a0b6780a68c30cdaaadd386"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/WorkspaceLspService.scala: FileTooLong \u2014 1290 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: WorkspaceLspService (103-1584). The bar is 500 significant lines; this is 790 over it, 2.58\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f6ada413714cecadad317c12dbd0c50567688afeed2432a8507cc4b2b25f08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/MetalsMcpTools.scala: FileTooLong \u2014 1172 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 672 over it, 2.34\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4352da597a72d43bdc89906ee0fed719ca5ea4b25b8860626991a57a58a7da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mtags/ScalaToplevelMtags.scala: FileTooLong \u2014 1081 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: ScalaToplevelMtags (49-1272). The bar is 500 significant lines; this is 581 over it, 2.16\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/ScalaToplevelMtags.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03997282851bacb8d34afe88e4d98bc10938589f1b9d7c0c87f7c6fac76b32fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/MetalsEnrichments.scala: FileTooLong \u2014 1033 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 533 over it, 2.07\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d1e5246c5c28892a8505b4276854bdee1071984e35c027ff422ff8012d54a3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Compilers: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Compilers.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b6a73cfaff52261a7865fed9b611c94c3c73bccd4b79e785dbf3513ca7c404"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClassfileParser: ClassTooLong \u2014 804 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 404 over it, 2.01\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"27caa7699e2d9d9d216ad88738c38590b7c72b0e4c5c63fe97d6f9b0d2772d71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pc/MetalsGlobal.scala: FileTooLong \u2014 943 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 443 over it, 1.89\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaae55be77fe52d825f81d9fdcd0223d74a65ef00d3883521e05d8cbcb54587"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: docstrings/ScaladocParser.scala: FileTooLong \u2014 936 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 436 over it, 1.87\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9103d11ce9fcac0cd9371e76deabbf9d44beb097906e12b9811da9ae1aa46549"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/Messages.scala: FileTooLong \u2014 919 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 419 over it, 1.84\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Messages.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0419c9be07540e196d7199ed2f43d39321c69098893b9d481b64540162cf7a4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/PackageProvider.scala: FileTooLong \u2014 900 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 400 over it, 1.80\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/PackageProvider.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"943237581be5982bcb1d082e35559cfb48322adb7cdfd2a4e1f7fe4b1cdc6572"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/UserConfiguration.scala: FileTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 339 over it, 1.68\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/UserConfiguration.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a651b87eb0e832ddbc906ffcafa59b4aaf56b77e1ffca1b19baa3a9e7ac02f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProjectMetalsLspService: ClassTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 265 over it, 1.66\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb337275214f784d947a1c80c2921222999e0d25cbcdb3311b4f1e554b6ad14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: classfile/ClassfileParser.scala: FileTooLong \u2014 820 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: ClassfileParser (29-1205). The bar is 500 significant lines; this is 320 over it, 1.64\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de8a62e655328dc91da3606743bcaf0a1fad439a7817fd3bd687a6f20bd0ce2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassfileParser.parseAttributes: MethodTooLong \u2014 parseAttributes runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb368aa61220d688195edccd7212046b2c7a794526376dba19fb968f120120c5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PresentationCompiler: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-interfaces/src/main/java/scala/meta/pc/PresentationCompiler.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc4a055afdd2e98e4c84d1fceebfed5a8af05e8d009e22ef96c7b3d1a9c676e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/ScalafixProvider.scala: FileTooLong \u2014 802 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 302 over it, 1.60\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ScalafixProvider.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"666be122e58d34acad447241e84d1972e1497c639a0cdca58b0dd072546dbd9a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BspConnector.connect: MethodTooLong \u2014 connect runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad0ebd58fbd444796ce9d4a17d80e1b51e1ea88b944b45f7f4a9284a2399fb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/ServerCommands.scala: FileTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 278 over it, 1.56\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ServerCommands.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17e2e3bb16fb2a4bc58078f52f8d93e8dfd78a71f035bea2185d52e7cdc03a0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BuildServerConnection: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5888a23ee2df287e5be448f0e7648f89aa327e2ea6e891a36a6691831e3c401"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: debug/DebugProvider.scala: FileTooLong \u2014 762 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: DebugProvider (77-827). The bar is 500 significant lines; this is 262 over it, 1.52\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3e16bb213ba244c001709be285c49de09ba738ac1e0a2dd26b38d4afc399f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/FileDecoderProvider.scala: FileTooLong \u2014 714 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: FileDecoderProvider (85-940). The bar is 500 significant lines; this is 214 over it, 1.43\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/FileDecoderProvider.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f8e129740cb3f4f6308ae5af3226fd66abaeed3ccbb07beadd9b989d553840"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/ProjectMetalsLspService.scala: FileTooLong \u2014 707 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: ProjectMetalsLspService (48-945). The bar is 500 significant lines; this is 207 over it, 1.41\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e2e28c6ed9d3cece6830dd5b43399c8c8cb56683ff78d7e88097e37d2e6aac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: completions/Completions.scala: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 203 over it, 1.41\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4860e7f747fcc3aac6967c4a11f2ef5658fed4cc53e43db1723a93031d0d3dce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClassfileParser: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f430d7cbf4f30c6786209d9b6904bc0b9a133f894194de0c1ee48fe7a1add5bc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RenameProvider: ClassTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 159 over it, 1.40\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/rename/RenameProvider.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"08de3159493fc1f8809fd05b0577ff1889db31fd4e6385b8034f287184f09af4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CompletionProvider: ClassTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 159 over it, 1.40\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0875ee316e215eb8f59f8c562f7fc4fcf49744da16a715bb2cf876f11ac245d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/ReferenceProvider.scala: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: ReferenceProvider (41-732). The bar is 500 significant lines; this is 179 over it, 1.36\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ReferenceProvider.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3d3910c9798926e0e795700c25145c740544a0d52cfd0ea55c39044e9be28e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/ConnectionProvider.scala: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: ConnectionProvider (43-793). The bar is 500 significant lines; this is 173 over it, 1.35\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ConnectionProvider.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb062e7e726f46fe8d048f76aeaae917885fb579671822532bbc622287f7a125"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OverrideCompletions.getMembers: MethodTooLong \u2014 getMembers runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a213bea0dfba7405a7b4ca8f079ce28d7b6471635362b3f50b489c5b1ecf47"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SignatureHelpProvider: ClassTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 134 over it, 1.34\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bca187a9ee31f7ee34bf6ee53efadb3d54e99b28e610c0c70e53be9607f7ec7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RawPresentationCompiler: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-interfaces/src/main/java/scala/meta/pc/RawPresentationCompiler.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"481b6296cbe1403aaf03ad022c563381ba8144875b674b2ac2b884b9e2719930"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: XtensionAbsolutePath: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/ScalametaCommonEnrichments.scala"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"54105417946dd756b8c34fd4a333310daa5887c80cb5e1e09520ca3d85fce2b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PcCollector.isCorrectPos: MethodTooLong \u2014 isCorrectPos runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b122a93faeadfcb2adb784a5917330e3b824c07d8250276a81783864f30cae"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReferenceProvider: ClassTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 128 over it, 1.32\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ReferenceProvider.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf5301c085cd20bbff77222fb628be868fd9c0d89b704a8ba044a0420791435"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PcCollector.traverseSought: MethodTooLong \u2014 traverseSought runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89358225fe8bdd3ecff6c82b535c52d23f988d1e7a50d9555f021dd81654980"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScalaToplevelMtags: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/ScalaToplevelMtags.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1df6ea2a9ef2517b3edcd315eabea568a489bcbc902032ac4799f94ea9b48d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PcInlayHintsProvider: ClassTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 116 over it, 1.29\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcInlayHintsProvider.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"12146505c4a2b60ddca79fe7bceb522e2b54acd0809d2886179fc0ac180c7c1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/BuildServerConnection.scala: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded), about 62% of them inside a single declaration: BuildServerConnection (49-603). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b84b132ed0aafa5d1462e90b1d311898e674daa1473e67b64138ccbf7f29399"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rename/RenameProvider.scala: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: RenameProvider (58-795). The bar is 500 significant lines; this is 111 over it, 1.22\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/rename/RenameProvider.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d02bc5fc4b5162093bb8d3db8c4481f00ed132d816878570ac64649489fda9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: doctor/Doctor.scala: FileTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: Doctor (57-718). The bar is 500 significant lines; this is 95 over it, 1.19\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/doctor/Doctor.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5f2d8807871577c278d64ef54fa0f9901be0465c6849a4a135c0b94d0e01f1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BuildTools: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/builds/BuildTools.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25b06691b437dc33b6e4f6ace279880bf0aad4c050ea1a6c2242b50dc30c2f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: XtensionAbsolutePathBuffers: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cd70386f59595f521af23dd705ecfe62871572e83beed6dcc447ff81ac0903"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pc/CompletionProvider.scala: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: CompletionProvider (23-777). The bar is 500 significant lines; this is 76 over it, 1.15\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3864f65fbe619362823992d2cb981291749a470d0c5a94f60712c7f04290495"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/Embedded.scala: FileTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 71 over it, 1.14\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Embedded.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"614df3c0127a7b10d57edd606bb7319dcb71bde11223bfe41fb85efa79683933"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReferenceProvider.references: MethodTooLong \u2014 references runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/ReferenceProvider.scala"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"675cc8e67a5a90398a3a7848978acc532882298077ac1b3e41a01a6adc2ef35c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TargetData: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/TargetData.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5800ba9796e9c95727485b15c935c3a475474a750d8696b47b9a6fefdaf1a7e9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MetalsGlobal: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d69380d1332a4685a496574d6f26c56010576efb01026dd4e030ab52d360b05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: debug/DebugDiscovery.scala: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: DebugDiscovery (39-655). The bar is 500 significant lines; this is 58 over it, 1.12\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/DebugDiscovery.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e019bb79ed77e8857cc04df3aa57285cf5c0fc7dc51e521da9c04bdcac3d756"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/BuildTargets.scala: FileTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: BuildTargets (30-712). The bar is 500 significant lines; this is 53 over it, 1.11\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/BuildTargets.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5215a6e37f1dcc123ad1c16bda5fb694b8b6551223767550886297ff42cdc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metals/FormattingProvider.scala: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: FormattingProvider (45-672). The bar is 500 significant lines; this is 47 over it, 1.09\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/FormattingProvider.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be99e94b0bd81da908ff89c75dcf212f5615f8dba8549cb9a9bfdd69975b0ddf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pc/SignatureHelpProvider.scala: FileTooLong \u2014 542 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: SignatureHelpProvider (12-773). The bar is 500 significant lines; this is 42 over it, 1.08\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93201c56dbaddfbfad18c6f363a0017b9636898cc2b2153edfefa3ac357dc971"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pc/ScalaPresentationCompiler.scala: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/ScalaPresentationCompiler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb4bb75eeb3996f44f247fee8c66b22478402e0f2f5214863d50689e083c409"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FileDecoderProvider: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/FileDecoderProvider.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ff72bc078b09b648914eb721a1ee9216a842d5b45e2e00fa6814b8402f4330"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WorkspaceLspService: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. This type is on a published API surface \u2014 a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0001d338506cd210345a6f9201eff53c0638381a044663d05d23e03566637f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pc/PcInlayHintsProvider.scala: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: PcInlayHintsProvider (14-717). The bar is 500 significant lines; this is 24 over it, 1.05\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcInlayHintsProvider.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee02e5260560b2255e5260fe0812df4892b7f51f870d2ab2f2e197ea202c9386"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BuildServerConnection.fromSockets: MethodTooLong \u2014 fromSockets runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"af74ea5fc120ff071c6919f14674680e5eb3b48d960a072870dd9158a84ca0e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mtags/ScalametaCommonEnrichments.scala: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/ScalametaCommonEnrichments.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c57efb5df0850d8c766c841300a491b750af8bad3642beafbd5fcb84d65516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201346 lines \u00D7 3): metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:596-641 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:661-700 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:722-761 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:596\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"9998c0819fcea98606ff5b6b41bf64e4f2af4d01ab3e9e8207b8ffec061494e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201333 lines \u00D7 2): metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:492-518 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:535-567 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:492\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"799f2f1cd588b1c2a2a79f8b0435db53921aa09144ac6ff8ebf7ffa30ec8a354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala:18-41 | mtags/src/main/scala-2.13/scala/meta/internal/pc/JrtClasspathCompat.scala:18-41 \u2014 before extracting anything, compare \u0060mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala\u0060 and \u0060mtags/src/main/scala-2.13/scala/meta/internal/pc/JrtClasspathCompat.scala\u0060 as WHOLE FILES: 100% of the shorter file\u0027s 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 \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala:18\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala:42\u0060 calls \u0060printStackTrace\u0060 and \u0060mtags/src/main/scala-2.13/scala/meta/internal/pc/JrtClasspathCompat.scala:42\u0060 does not \u2014 after which the two agree again for 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2bf5b5dbfa95717aaba5b216fa3951f18e520518b53fa09f2a5a0d4e258266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:37-53 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaRenameProvider.scala:46-62 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:37\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"468d84097055797a798caa22220c8ebc799f75e9bf2c8da002344f5383938708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:398-412 | mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:449-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:398\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e75071557aefe1d370a1b62a07bbec1b041d8478b56a2742695d66aef74722c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala:233-246 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaMetalsGlobal.scala:144-157 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c588e63dadbda24dd94d7fd2ae4de7b894e2d872d3dd77f3503aad5ea776a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): mtags-java/src/main/scala/scala/meta/internal/pc/JavaReferencesProvider.scala:85-98 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaRenameProvider.scala:94-107 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060mtags-java/src/main/scala/scala/meta/internal/pc/JavaReferencesProvider.scala:85\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-java/src/main/scala/scala/meta/internal/pc/JavaReferencesProvider.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5db0647659be6ff076e2a7c2b8de547d332d2346a1e915518dd0f9462d3f33b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:42-54 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaRenameProvider.scala:51-63 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaRenameProvider.scala:99-112 \u2014 there are 3 copies across 2 file(s) \u2014 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 \u0060mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1893b5c091c69e1f0767264f2af6da82bbae8b4a214d1d43637548a32776a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): metals/src/main/scala/scala/meta/internal/metals/JavaInteractiveSemanticdb.scala:267-278 | sbt-metals/src/main/scala/scala/meta/metals/MetalsPlugin.scala:192-203 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060metals/src/main/scala/scala/meta/internal/metals/JavaInteractiveSemanticdb.scala:267\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/JavaInteractiveSemanticdb.scala"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"be140b7c5617c7a5d34180b7f3cb899103f0e87dbeb3d5079e8003735ea289bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala:28-39 | mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala:94-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala:94\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5629670d4cd058793d29247639afd532a1afa077d639b63c80d497f56ea263c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): mtags/src/main/scala-2.12/scala/meta/internal/pc/Compat.scala:42-53 | mtags/src/main/scala-2.13/scala/meta/internal/pc/Compat.scala:66-77 \u2014 before extracting anything, compare \u0060mtags/src/main/scala-2.12/scala/meta/internal/pc/Compat.scala\u0060 and \u0060mtags/src/main/scala-2.13/scala/meta/internal/pc/Compat.scala\u0060 as WHOLE FILES: 92% of the shorter file\u0027s 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 \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.12/scala/meta/internal/pc/Compat.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec16cc3499f5ebaea62c8aa26bd40a7c1ba39ca67d28b96007ba557cc034e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): metals/src/main/scala/scala/meta/internal/metals/doctor/DoctorResults.scala:81-91 | metals/src/main/scala/scala/meta/internal/metals/doctor/DoctorResults.scala:95-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060metals/src/main/scala/scala/meta/internal/metals/doctor/DoctorResults.scala:81\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/doctor/DoctorResults.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2addf2cc5aafb689e494d7275957ef4aca80cb4e5eef62a8eadd6cf8ddc2ca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:1217-1225 | metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:1228-1236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2281e3ba410a677e982ae1dcc707ffe5508faef10599e583d5a881ce47d62b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:189-196 | metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:217-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:214\u0060 calls \u0060get\u0060, \u0060Some\u0060 and \u0060metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:187\u0060 does not \u2014 after which the two agree again for 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a41e092e2871a614b2c74bffed8850bb59e9552497e34e83f6dd2c19081b682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mtags/src/main/scala-2/scala/meta/internal/pc/ExtractMethodProvider.scala:27-34 | mtags/src/main/scala-2/scala/meta/internal/pc/InferredTypeProvider.scala:55-62 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/ExtractMethodProvider.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"305e256a18095d59b9e1838865b03548f6326bb2ee690062288c009f55c7cdce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mtags/src/main/scala-2/scala/meta/internal/pc/InferredMethodProvider.scala:576-583 | mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala:517-524 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/InferredMethodProvider.scala"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4fe5bbfb382651ea69e0d2411a39829f9ee37542924cc8208e711884564c6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mtags/src/main/scala/scala/meta/internal/mtags/JavaToplevelMtags.scala:97-104 | mtags/src/main/scala/scala/meta/internal/mtags/JavaToplevelMtags.scala:106-113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060mtags/src/main/scala/scala/meta/internal/mtags/JavaToplevelMtags.scala:97\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/JavaToplevelMtags.scala"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa68bae1bf8a6491c255d192b203caf9b846d70b496be72bb2e33f9d885af0c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala:40-46 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala:100-106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2b80eb164d8cf4b310cc9c68c06a04bb5339e1ac8291e44b5487f6ea662128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): metals/src/main/scala/scala/meta/internal/metals/Configs.scala:34-43 | metals/src/main/scala/scala/meta/internal/metals/Configs.scala:52-56 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060metals/src/main/scala/scala/meta/internal/metals/Configs.scala:52\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Configs.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b0fad4f2c6c79f4b10e523418a46401bfaa708d23652f5395f55e433744524"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): metals/src/main/scala/scala/meta/internal/metals/FallbackMetalsLspService.scala:71-81 | metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala:128-138 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/FallbackMetalsLspService.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fbc4202ddebf53dc55ee6e30867be1b89cb7185767c49377766de7b0b1524d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:735-742 | mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala:228-235 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:735\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d51824f48de4be5bbfd2e3833b156e163e6387a8355b8e129fc58c34185825a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): metals/src/main/scala/scala/meta/internal/metals/Timer.scala:54-63 | metals/src/main/scala/scala/meta/internal/metals/debug/server/testing/LoggingEventHandler.scala:176-185 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Timer.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda19e35d0d2cd319c2395520766a052b6d864f52409c14b34299b6dffbf6d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): metals/src/main/scala/scala/meta/internal/metals/codeactions/ImportMissingSymbol.scala:266-270 | metals/src/main/scala/scala/meta/internal/metals/codeactions/RemoveInvalidImport.scala:391-395 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060metals/src/main/scala/scala/meta/internal/metals/codeactions/ImportMissingSymbol.scala:266\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/ImportMissingSymbol.scala"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a167d1fb27c32039843a701c6d8bafaf60b59b5efbff58c0f1311e41e9ca432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala:36-40 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:28-32 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaHoverProvider.scala:40-44 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaReferencesProvider.scala:49-53 | mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala:51-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060OffsetParams\u0060 in one and \u0060ReferencesRequest\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37735029a4d6b7ef99fcd7b1926074b407f799bd07276f677d0af5351c0f2b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mtags-shared/src/main/scala/scala/meta/internal/metals/ClassfileComparator.scala:5-15 | mtags/src/main/scala-2/scala/meta/internal/pc/SymbolSearchCandidate.scala:68-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/metals/ClassfileComparator.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc76ad7e531519d2a4641556447cefe583eea1171aeea85609630661cf23174d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mtags/src/main/scala-2.12/scala/meta/internal/pc/Compat.scala:26-36 | mtags/src/main/scala-2.13/scala/meta/internal/pc/Compat.scala:33-43 \u2014 before extracting anything, compare \u0060mtags/src/main/scala-2.12/scala/meta/internal/pc/Compat.scala\u0060 and \u0060mtags/src/main/scala-2.13/scala/meta/internal/pc/Compat.scala\u0060 as WHOLE FILES: 92% of the shorter file\u0027s 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 \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.12/scala/meta/internal/pc/Compat.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"60102f76064bfe8f2e3c0132eb8bc65bb68c8238cc530b147becd617ab2e726c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): metals-bench/src/main/scala/scala/meta/bench/InlayHintsBench.scala:28-32 | metals-bench/src/main/scala/scala/meta/bench/SemanticTokensBench.scala:31-35 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals-bench/src/main/scala/scala/meta/bench/InlayHintsBench.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6038a2054c64163bf2d84413f35eb93e02850bd4737a7cb6600820e2b2a4622"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MetalsGlobal (LCOM4 14): MetalsGlobal\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdf0d84af6c1a7b645e312be9aaa8aa51f55236d5e4da77d3e8ca7dd8cd9fe0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MetalsHttpClient (LCOM4 5): MetalsHttpClient\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/clients/language/MetalsHttpClient.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2f4aa2e323546625b322fcfdd63f68e1e9a4c68a4e1ee0e95e3f0f97edfbdc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: JavaMetalsGlobal (LCOM4 5): JavaMetalsGlobal\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-java/src/main/scala/scala/meta/internal/pc/JavaMetalsGlobal.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"12234a0641af8f18cc163342534c0e5e3e2c34cfc61e21a2544ec33c594b5eae"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompilerConfiguration (LCOM4 4): CompilerConfiguration\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/CompilerConfiguration.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"41270a2e067d0af3db86f259dfaf3599833a3640fc75ca7acaf9a38800546906"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ConfiguredLanguageClient (LCOM4 4): ConfiguredLanguageClient\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/clients/language/ConfiguredLanguageClient.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"348152a753d52bb35290e88e23499f79a9f1708356ff70f2bcdf4978ac8d7939"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DebugProvider (LCOM4 4): DebugProvider\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"953887f4b862cf27d9f03e094f4e1863e6b04d9327049b78a572c767b686f4fe"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DebugProxy (LCOM4 4): DebugProxy\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/DebugProxy.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b5b42f6e38c1b347ef17ecb4b4686e626b9ac5aa9895d9e80a68a39aabac43"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Fuzzy (LCOM4 4): Fuzzy\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-shared/src/main/scala/scala/meta/internal/metals/Fuzzy.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa21b0a2ffef3547f218078d98bb5797a86ddecc69340dc6beee1dbeb181b5a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala: mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala changed 2 times in last 90 days, max cyclomatic complexity 49 in MetalsGlobal.shortType at line 341. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-27..2026-09-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-27 17:09:50 \u002B02:00\u0027 --until=\u00272026-09-25 17:09:50 \u002B02:00\u0027 --full-history --no-merges -- mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"896fcd0d73951bcbe8f7b2c201e93d2de01f78518b848823a89184978964b220"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 13 significant file(s) lose their only recent owner: metals/src/main/scala/scala/meta/internal/metals/mcp/ScalafixLlmRuleProvider.scala, metals/src/main/scala/scala/meta/internal/builds/NewProjectProvider.scala, mtags-java/src/main/scala/scala/meta/internal/pc/JavaMetalsGlobal.scala, metals/src/main/scala/scala/meta/internal/metals/watcher/ProjectFileWatcher.scala, mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala, metals/src/main/scala/scala/meta/internal/metals/FallbackDefinitionProvider.scala, metals/src/main/scala/scala/meta/internal/search/SymbolHierarchyOps.scala, metals/src/main/scala/scala/meta/internal/metals/doctor/ScalaProblem.scala (\u002B5 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"232dc5e88e33d12097ce0f721a644e8cfa7433ce5a044ebc7cbdb6e6528cbc59"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 6 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (20 single-owned of 351 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; 351 of the 682 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/scalacenter/bloop/issues/700"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8198e8a83237253572051043e03ea92b766bc1cdcc10ee484af1505fbe88d447"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo https://github.com/scalameta/metals/issues/4788"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/Indexer.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa2f01aff72a2999dd6437cff8654932e2185d47ed5b86163fabfb618051d83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo https://github.com/scalameta/metals/issues/4788"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/scalacli/ScalaCli.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"716288c83dca34201ddcd422194a376e70fb4e758cafaa00f1ecf36c3ec05494"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO replace with strip once we drop jdk 8 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/ConvertCommentCodeAction.scala"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1b53c4acf8c81b71ee08dbce81b315ca705d503fdfde4de196f0e0eac03a40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Shall we think of a better way to format this delimiter based on screen length? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/debug/server/testing/LoggingEventHandler.scala"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f75dacd9ac80df1788d5d7b4e7967666cde24fe9eebb5b9e26d4aff3694e96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo https://github.com/scalameta/metals/issues/4785"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/metals/MetalsLanguageServer.scala"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b433a5f40e759ae4f387f542bfd87212228434aff32d73f94fae169bf909c096"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO also make sure that it\u0027s a local symbol \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags-java/src/main/scala/scala/meta/internal/pc/JavaRenameProvider.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2461bf7f7d7844c1d5073d41c2c1640921609a3a029b9ac3e188e5d47d9ee13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO More consistency with use of stub symbols in \u0060Unpickler\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b925b4fbacefd0f9f99f8fb001d2697459025f23e5ffbafde61b1ec89dbff622"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this should be !optimized, no? See c4181f656d. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"1354d5fbca255adb1ef4ef206630252fe77446ee8c33bc87968b7effbb9b13ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO 1: parse runtime visible annotations on parameters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6999f28853a711ea40da5fabb2666e07e5f6d3b2be5c8ccc012e04f5733de0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO 2: also parse RuntimeInvisibleAnnotation / RuntimeInvisibleParamAnnotation, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f569cc6131cf1f60126ee451b98df0ad131ab646b6d8162565cc374f8b5018b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO SI-9296 duplicated code, refactor"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf726325fa0d1efa454444657b620c768b2a358212df71c6a36dedef93c4f856"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this performs an equivalent of getExceptionTypes instead of getGenericExceptionTypes (SI-7065)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"95dab2b40a646e7dc9cb2c5ea3ecc9660e480eb7688abaef4deb09ebdfbd41ce"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(olafur): we\u0027re using a type pretty-printer to pretty-print term objects here. \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/Signatures.scala"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"20564db77b46fa4e1bbab1db7cd5f0f0adcb95e5ff479a60bc5b26a4b54d4e92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: guard with try/catch to deal with ill-typed qualifiers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/PcDefinitionProvider.scala"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9184f4a9f09a6f71cb08da863e10654f9b87326d0b0007a071c326f432fa0898"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(olafur) Check if the position of the symbol in the old \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be458218484890b89bd7b21190932b4f0504dccbcf6a98ddf5ae5dcd7eab0ab"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // xxx match { \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1267072bed73284b3743842ee7b3b52c76f0b4fa5cbef8666368a2e2425b51"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // xxx match { \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1d6428c9c7bad2cf523659c26a1f004f0e66b45e22ae786856b3834f7e340c"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // xxx match { \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b92a0791076ed2c2025e92f27a9284815fe3c90cae7b9360fcb2d870210e602"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Convert to Char \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e84bd31cf8ee4968078b46e593af244b4229203bce0d5bc6ea7b49d59dd357f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Should this be defined at some list companion? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"480ca4ffc362658f7cb50abaca875e438595e72fd7422fef12028088d78f1bab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The header row must match the delimiter row in the number of cells. If not, a table will not be recognized: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efc0b6dcc467acd9467a03e24fecb9150c8853d0d4657b47f54f20b35e432dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Break at following block level element: The table is broken at the first empty line, or beginning of another block-level structure: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9af63eac854c68f6c6940468d09f0a9f6d45c5170e18d4d2cd7ebdad69a7e00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Do not return a table when: The header row must match the delimiter row in the number of cells. If not, a table will not be recognized \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"4158ed1f838c2b7b85cdd1d7de2dca96bbf2e0caf5d84ccba6624589a9b0045a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Abandon table parsing when the delimiter is missing instead of fixing and continuing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"07373000be7339b3fe20ba5fe6348fe9fd1a236730a4b7388de085c1a9cd47b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse the second row without parsing inline markdown \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d20016f0b8238033e9e6617299e9df183cb6c7e36f8cb0c8097b9d126e57429"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Save pos when delimiter row is parsed and use here in reported errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf0f7ec8f3a0d220b04b066fec8fa8324a7df8e9c9e75913bc1d3a44397b908"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - Add conversion of tables \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/metals/docstrings/HtmlConverter.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"57231aea365f2459a1b4d879fdf066ab0225bcf7280467380476ae9635d52af0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO short names are not supported yet \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cross/src/test/scala/tests/pc/SignatureHelpSuite.scala"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"605a3aa4f0bb71dd48e2231ecead684d12535a815ca0b670b063bb403f98cfda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO short names are not supported yet \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cross/src/test/scala/tests/pc/SignatureHelpSuite.scala"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"06506aa5528e58ab56dade80da1df2e2d3db50024007cb3388e8045bdabd072a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add a separate option for hints for context bounds \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cross/src/test/scala/tests/pc/InlayHintsScala3Suite.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83edb474d9a44b95f6f5e57a8748c227425ee0dfda517db3a0bfc5658a07e17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should provide empty completions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cross/src/test/scala/tests/pc/CompletionKeywordSuite.scala"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"865b49dd07f25f65df81b840032ecd42b99a3115f8306bcfad6fc07df987d601"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this isn\u0027t right, we should see \u0060snd = : Int\u0060 here as well \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cross/src/test/scala/tests/pc/CompletionArgSuite.scala"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9d58a4675d08b2c2e599bd48768fe1ec28ae592bbdb63ce5655f1132e9df64"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/scalameta/scalameta/issues/1789"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/input/src/main/scala-2/example/MacroAnnotation.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbb5b3885c475fb81215731e1592740738fc5ee10e1b5bbf547b2591535c380"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/scalameta/scalameta/issues/1789"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/resources/definition/example/MacroAnnotation.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"159315544ae172f71e6c7d8b3fb34adc1f6eefb383d4659adbf1e463eac35bc8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/scalameta/scalameta/issues/1789"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/resources/documentSymbol/example/MacroAnnotation.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f01fe53505e51df90dd6480dee4086938cbc2a13e66df1681de0c4c9021fca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/scalameta/scalameta/issues/1789"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/resources/inlayHints/example/MacroAnnotation.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c981dc666d94b48de5a8082152d80f8cd960a285b7708db1d1d3f91e8f34947"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/scalameta/scalameta/issues/1789"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/resources/mtags/example/MacroAnnotation.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c4205b74b13e922fb1ce93c5aa07e7ca3e82730fd8fff712d21dfb48806acd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/scalameta/scalameta/issues/1789"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/resources/semanticdb/example/MacroAnnotation.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8b6118d443ae034a6faea0611369d9e7f7c3311ca8be46ceae45b2cd83ab35"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/scalameta/scalameta/issues/1789"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/resources/toplevel-with-inner/example/MacroAnnotation.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"922a9da2c229c7e2fdb630e02f904b32b8801b3622d9712611bc7279a5a6ac01"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/scalameta/scalameta/issues/1789"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/resources/workspace-symbol/example/MacroAnnotation.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"659e8161cd520403a809033fdec17b426a8da37f7624fb035d53593fa792447d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo investigate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/javapc/src/test/scala/hover/HoverDefnSuite.scala"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8443eb882e7ac29fd72e287a9d816f148bb6d898b5c0426e797fae862a17a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(olafur): Start actual file watcher. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/main/scala/tests/TestingClient.scala"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a6d1477d3c64ddf148cc7227f8953afedd84b2ccf12484811ce78f45ec3be1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: delete condition after https://github.com/com-lihaoyi/mill/issues/3148"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/main/scala/tests/debug/BaseStepDapSuite.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b05b4c46e779c5353c5e75046473b8c0ba62c19639cdb877c5411e33d6ccc5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/scalameta/scalameta/issues/1789\u003E\u003E/*comment*/"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/resources/semanticTokens/example/MacroAnnotation.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7456c19b55a446865ed9132f5e75a7af631dfe3bc0bced438ddd8405ef08283d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should, but doesn\u0027t find the class declaration: https://github.com/scalameta/metals/issues/1553#issuecomment-617884934"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/scala/tests/ReferenceLspSuite.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26f0efc21d35f450a7441d818465c312209e4bb1016a0c90a668857bfe82c03"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: https://github.com/scalacenter/bloop/issues/785"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/scala/tests/DiagnosticsLspSuite.scala"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"da10f0a2a30ed7419d6678cbaf2e9af1d56a992f679eae75c9af95876b21edc3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(gabro): the tests don\u0027t pass with 2.12.10, although the plugins seem to work fine when \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/scala/tests/CompletionLspSuite.scala"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e3311635fc9f21e0d30353ec931fd8fbd4252d45b78b08fe3ca1f279256520"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should show info about renames (\u0060val ttt: S[Int]\u0060 instead of \u0060val ttt: Set[Int]\u0060) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/scala/tests/inlayHints/InlayHintsHoverSuite.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbea65108ec36d2725626903995c393ca6bb918885b8137985f8d1c5273ec93b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: @@ \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/scala/tests/rangeFormatting/ScalaCliDependencyRangeFormatter.scala"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff613f4a0390001fd31940e0f43fc84cf50c91117ce59e7d06e996670b13e0dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0022org.scalameta\u0022 %% \u0022munit\u0022 % \u00220.7.26\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/src/test/scala/tests/rangeFormatting/ScalaCliDependencyRangeFormatter.scala"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d71fc265678657a33c7989c2e091fdffaf568290b61c85980948471b52a93e"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no project overview: The README is a single-file repository overview that does not state what the project is for or how to use its contents (e.g., the metals-bench benchmarks directory). State what Metals is and where each documented directory lives in one sentence."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dbf18d06aa983c06246108610908ba99aae6784280b3aacd1a6655733d71be"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no installation or build instructions: There are no installation, build, or setup instructions for the repository root. Add a short install section covering how to get started with Metals (language server, Bloop import)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa6bfcd5c6ae231d1b8ee99bced50b832d1f61cde9da6cbb533467b879a57db"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b02bc470801397122866d4e2bcf5397f5f30aad177fc253dc98845e8fcb5a826"},"properties":{"commitSha":"612f7e8a18befa0250b406749d4397e8ab786bb8"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2e45e8b278479bd93a161c3164229748821dadbca8a6e4c21d4ac85d928d70a"},"taxa":[{"id":"CWE-269","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44dffc34cf2d54ae284265c43b1332602c7b71f4c78886df312ecf17e8c4168f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92bef03ff9532370b34be0a629362a06ebc6f1079f7ae30fcd75808a8c2a00e7"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aff3f09c70375ae301d2f3e5d7b851c35db1a85fffcfe6e2f77d8979ba9b7431"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b0b338274b3a5efb45d30aaae0e7203c4e25c80dfd6a60e411822518107df42"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05b1c24aed8cb690de2984bc49a0f183393ef16fe1afafc2237cfb58776b35f2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1730df7aa5d3379ee021812c8fc1957aa9aa625e4790eb5f39c025d85a6f0fe8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a7b3c0a5b8863f98662414ffce1e743ed2b0fb09cfb371189c62224292ca563"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8381cdd9539330ccdf5f2819fb2f0ec8e0d20d645b1467a3e5e48700a37b69b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"efc52c5baba9934ff90d17b14b58060f998d588e08d327d65cdccb929cef2cd6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3df12394b97e9b3cd494e871b20ca9c711acc48ca28c3fa4c058c08d35c13f8d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1722ab9379d2e862b1294a086077f2ee9041923401aa2ca1a6570cdc982b9fbe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ebac61d292e4757946ff83f15293e2fa751db1ae0044345ec1ca160a7804b230"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c36d34807986b0b04a3d64aa09b65d4c956cd33c00056520e2e75feec1ae3d9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e00215733d710b952891c0520b89c7ffb60ae3c6f3f4a65d264aa46070dc85e4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cce79852cf69d61250d1cef768a025daec4d4fc9600e36025ee85e638476d166"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"537b9a55e5a4e4c2895dcd347caee496be7ad6007be7bec957b5e56cf0c9dd67"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34a652ba53ae68613b6eb82730bd56103dde8326e97c0c8906e04aa8a7194133"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65e19366592b94066f543bc891eedb827c73f9a2490cd924eba40b4f95a4d983"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7bf7082bec1dd17030eaba27d84773c932228df8a1b651be35dedbf4d20f7c5b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"38d21ae4a0f169ecb4ed1031dc65cd5ae3dc61b8e2c8518bb52f1f2ddde09f3b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3692e4f1eb32a5578fdee3825a1a335d0da3631d52718476c70a6087ed1a1cb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29c786acdd597a3ea75f96bc992a28dae0f5f1e9eb82762437febab37b6f33fa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"341bfad29865bda652dac40cd0b3940d1821ae1c40a9ce0d3826daa4e322ef38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7a7fc0ffe72ab1d095110c833797e6b0b038d8e4db377cc5e0e735eaf600028"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4f82c567cba061bbb8e2b31b4cccdec90057052bdbed727c1293fbf9a23354d"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22cbe6ea62ae7c7aeb02493586b7b976b1f16873a3fc960afc55404a346ee342"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a468e7d7647cb35963fec276f8f4caea50067495a4ebce0802b01471bfa09395"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/FlatMapToForComprehensionCodeAction.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f0752a8da9a418c63c7feb538ee578c1a697896a0fd14f122bbcdb8deeae87"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f373a2a44c0bb20f952c4f68ddbfca06effe9ab686b518299f794bc0a4ec0e2b"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractRenameMember.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d733f702a35c81aad07fc21bc69711b14e632114d0a819823f467e26e9abee4"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6ee6d467510cf01c4c8c18b452c108f5eaf563e9007b89139265c8678e4dbd"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 122 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala, metals/src/main/scala/scala/meta/internal/metals/codeactions/RemoveInvalidImport.scala, metals/src/main/scala/scala/meta/internal/metals/InitializationOptions.scala, metals/src/main/scala/scala/meta/internal/metals/testProvider/frameworks/MunitTestFinder.scala, metals/src/main/scala/scala/meta/internal/metals/MetalsHttpServer.scala, mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocUtils.scala, metals/src/main/scala/scala/meta/metals/lsp/DelegatingScalaService.scala, metals/src/main/scala/scala/meta/internal/parsing/ClassFinder.scala (and 114 more) (126 orphaned of 351 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; 351 of the 682 production source files in this repository met that bar). 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: MtagsResolver.scala \u2194 V.scala: \u0060metals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala\u0060 (context metals) and \u0060project/V.scala\u0060 (context project) sit in DIFFERENT parts of the tree yet change together 56% of the time (24 of the 43 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\u0027s 10,000 most recent commits rather than its whole history \u2014 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) \u2014 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\u0027t see. You can check this without leaving the row: of the 24 shared commits counted here, the most recent 3 are \u0060a863edf5\u0060 chore: Add support for 2.12.21 (#8019); \u006024b57eda\u0060 chore: Add support for Scala 2.13.18 (#7962); \u006052b8fb2c\u0060 chore: Add support for Scala 2.13.17 (#7846) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85711f3b22bf3ff4c04a1c9e47d423e76bb57c4712eab93096d760ef057d5fb2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: DelegatingLanguageClient.scala \u2194 NoopLanguageClient.scala: \u0060metals/src/main/scala/scala/meta/internal/metals/clients/language/DelegatingLanguageClient.scala\u0060 and \u0060metals/src/main/scala/scala/meta/internal/metals/clients/language/NoopLanguageClient.scala\u0060 change together 80% of the time (12 of the 15 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\u0027s 10,000 most recent commits rather than its whole history \u2014 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 \u2014 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 12 shared commits counted here, the most recent 3 are \u0060753fcc8b\u0060 improvement: Improve the UX of new file provider (#8209); \u006075b51685\u0060 improvement: Add fallback if showMessageRequest is not supported (#7954); \u006076c95fb8\u0060 LSP general progress notification support (#6055) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/clients/language/DelegatingLanguageClient.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daa39564de664daa0cedb62a7c56b48677496505271e3d778987b25acabd300"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: MetalsLspService.scala \u2192 ClientExperimentalCapabilities.scala, DismissedNotifications.scala, ImportedBuild.scala, PopupChoiceReset.scala, WorkspaceSearchVisitor.scala, JdkSources.scala: \u0060metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala\u0060 changes together with 6 other files \u2014 \u0060metals/src/main/scala/scala/meta/internal/metals/ClientExperimentalCapabilities.scala\u0060, \u0060metals/src/main/scala/scala/meta/internal/metals/DismissedNotifications.scala\u0060, \u0060metals/src/main/scala/scala/meta/internal/metals/ImportedBuild.scala\u0060, \u0060metals/src/main/scala/scala/meta/internal/metals/PopupChoiceReset.scala\u0060, \u0060metals/src/main/scala/scala/meta/internal/metals/WorkspaceSearchVisitor.scala\u0060, \u0060mtags/src/main/scala/scala/meta/internal/metals/JdkSources.scala\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 6 separate couplings, not 6 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 6."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"547c39a3f951a55f435c290e9a3fc76cfc2f7adcba6aefa02eb2ad36d4892999"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: BloopInstall.scala \u2194 BuildTool.scala: \u0060metals/src/main/scala/scala/meta/internal/builds/BloopInstall.scala\u0060 and \u0060metals/src/main/scala/scala/meta/internal/builds/BuildTool.scala\u0060 change together 50% of the time (12 of the 24 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\u0027s 10,000 most recent commits rather than its whole history \u2014 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 \u2014 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 12 shared commits counted here, the most recent 3 are \u006073944e46\u0060 fix: retry counting build tool digest; \u00609a859e0a\u0060 feat: add setting to choose preferred build server (#6121); \u0060510386db\u0060 bugfix: Use buildServerName instead of executableName in BSP \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metals/src/main/scala/scala/meta/internal/builds/BloopInstall.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e70992528969a852e37f18d11c5bd0660bda94e6d0783c5b179c5b7d44ad2a"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d068c977b62d9a977df1bb6f53e8b00b586c3abee955f91d715f92b8e019d624"}},{"ruleId":"M1","level":"warning","message":{"text":"README may be stale: 96 code files changed in the last 6 months but the README was not touched \u2014 it may no longer reflect the system."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e973e7a8d5d866995cbf78b120250fe7f132bf928812d48ca62e69aba11b9910"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-269","guid":"70e1f5f6-81e5-4e5a-ba40-b541c3a346e2","name":"CWE-269","shortDescription":{"text":"CWE-269"},"helpUri":"https://cwe.mitre.org/data/definitions/269.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":38,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}