{"$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":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"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"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"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":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"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"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"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"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"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"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"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"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"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"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"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":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"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":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"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":"SyntaxHintClassifier.classify (cyclomatic 130): SyntaxHintClassifier.classify has cyclomatic complexity 130 (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":"src/main/scala/onion/compiler/parser/SyntaxHintClassifier.scala"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f87e24d853fcac1c8a1b65d46ca68c046cf0e4936f7c5a315423af47336f1f8"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockElementLowering.translate (cyclomatic 111): BlockElementLowering.translate has cyclomatic complexity 111 (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":"src/main/scala/onion/compiler/typing/BlockElementLowering.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8381a29561d950f50712bfce734fc63a608ca78db68228b1b72783e8c1af08a"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectExpressionTyping.typeSelectExpression (cyclomatic 96): SelectExpressionTyping.typeSelectExpression has cyclomatic complexity 96 (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":"src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"569c0bb4f8dcb23d4dce602c8572e44bc3f6e94cb1996e394717bae2a799492c"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionLexer.operator (cyclomatic 64): OnionLexer.operator has cyclomatic complexity 64 (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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c82959ebe1782d2bbe7b258e53a6f1e848cabd17ef9bf8068b8ee0fdcfbb7fc"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectExpressionTyping.processPatterns (cyclomatic 62): SelectExpressionTyping.processPatterns has cyclomatic complexity 62 (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":"src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e1fa62ad3c5bec3d27895671b7097647644c2d377d2d86b24d2280f618661b"}},{"ruleId":"D1","level":"warning","message":{"text":"ASTWalk.visitChildren (cyclomatic 54): ASTWalk.visitChildren has cyclomatic complexity 54 (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":"src/main/scala/onion/compiler/ASTWalk.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e90aa895807f7af743c7fcf8fcf254e56070106f8ac03393aa6c1a46ecb697b"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstructionTyping.typeNewObject (cyclomatic 54): ConstructionTyping.typeNewObject has cyclomatic complexity 54 (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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcfe1a88a331e2b12a5afa320a09a861b767866d4e1d8a3741c8523e8641723"}},{"ruleId":"D1","level":"warning","message":{"text":"MigrateCommand.migrate (cyclomatic 54): MigrateCommand.migrate has cyclomatic complexity 54 (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":"src/main/scala/onion/tools/migrate/MigrateCommand.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce3090f642ccca3d4371301264c6c22e1faf738bcd2accaf679f1979dab67a9"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticErrorReporter.reportMethodNotFound (cyclomatic 51): SemanticErrorReporter.reportMethodNotFound has cyclomatic complexity 51 (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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0957217e0c40a03210a6b0c3cb9292b775890d7c2ec0f69b3bdd9dafdf5d2cb"}},{"ruleId":"D1","level":"warning","message":{"text":"CapturedVariableCollector.collectUncached (cyclomatic 49): CapturedVariableCollector.collectUncached has cyclomatic complexity 49 (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":"src/main/scala/onion/compiler/backend/asm/CapturedVariableCollector.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"72deefe77bae5b6ffc125018f9efd69cc702874ac565ba0774f23a41cdb07a9c"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignabilitySupport.processAssignable (cyclomatic 49): AssignabilitySupport.processAssignable 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":"src/main/scala/onion/compiler/typing/AssignabilitySupport.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c567c7ed06e0d2e7aa05d950309add239cefb09dfb58110a37ad4f3881db7494"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolCli.dispatch (cyclomatic 48): ToolCli.dispatch has cyclomatic complexity 48 (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":"src/main/java/onion/ToolCli.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f121d6fb1abc16304effea6cd3891e69f0525fbeb57eb0f3b6f11280b3bba18"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionMethodFallbackSupport.tryExtensionMethodCallBidirectional (cyclomatic 47): ExtensionMethodFallbackSupport.tryExtensionMethodCallBidirectional has cyclomatic complexity 47 (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":"src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8340ada6d5e4ee88af685ca759d7b0f602e4199d3603be8cde212179de63943"}},{"ruleId":"D1","level":"warning","message":{"text":"TypingOutlinePass.processRecordDeclaration (cyclomatic 46): TypingOutlinePass.processRecordDeclaration has cyclomatic complexity 46 (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":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe37066bd1a768c60ebc8ff3b687351692af60db4380c7425008c3d07edefe1"}},{"ruleId":"D1","level":"warning","message":{"text":"TermWalk.children (cyclomatic 45): TermWalk.children has cyclomatic complexity 45 (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":"src/main/scala/onion/compiler/TermWalk.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9978f4754281b3d7ec9f1473850eb300e87816cfcb066dfeb465024b6782ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector.term (cyclomatic 45): Collector.term has cyclomatic complexity 45 (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":"src/main/scala/onion/compiler/effects/EffectInference.scala"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6382bf22e8d63f472e0ead35310828061203649ac85db4a35d82c8736e48f4"}},{"ruleId":"D1","level":"warning","message":{"text":"ClosureTyping.typeClosure (cyclomatic 45): ClosureTyping.typeClosure has cyclomatic complexity 45 (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":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4ec269267939d4f5f0fe3c5de279557c103d2704578060d67d408322f231dd"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionFormTyping.isValidCast (cyclomatic 40): ExpressionFormTyping.isValidCast has cyclomatic complexity 40 (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":"src/main/scala/onion/compiler/typing/ExpressionFormTyping.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a49234b188b2af42149d1ff2491119c88eade4bc361052605a75ec0d86993b"}},{"ruleId":"D1","level":"warning","message":{"text":"LawExampleToPredicate.find (cyclomatic 40): LawExampleToPredicate.find has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf5ffa00b0e67655fbaf463a4c7d6b7a5dc805e42d42bc7278a5f3bb5bea52f"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticErrorReporter.report (cyclomatic 39): SemanticErrorReporter.report has cyclomatic complexity 39 (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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"47524419120fff174be425d616bea518657eb735a1f92315952d7522a55cd837"}},{"ruleId":"D1","level":"warning","message":{"text":"TailCallOptimization.findMaxLocalIndexInBody (cyclomatic 39): TailCallOptimization.findMaxLocalIndexInBody has cyclomatic complexity 39 (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":"src/main/scala/onion/compiler/optimization/TailCallOptimization.scala"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe807c3979fdb652b5f0d47b9764ac0315f1e5cb33792fcf7dbcfe29c0369b7b"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraints.unify (cyclomatic 38): Constraints.unify has cyclomatic complexity 38 (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":"src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d09ceb0e331fc81fb51c9b07d87984202e71ff414b2c9139af0f41c50298359"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticErrorReporter.reportIncompatibleType (cyclomatic 37): SemanticErrorReporter.reportIncompatibleType has cyclomatic complexity 37 (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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"86766c4d51a019aee5fc1f7d5c7da922537aea6393f249523183e8266c982931"}},{"ruleId":"D1","level":"warning","message":{"text":"Repl.processCommand (cyclomatic 35): Repl.processCommand has cyclomatic complexity 35 (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":"src/main/scala/onion/tools/Repl.scala"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5992fee0d6ed62c8464e2d62ae3baeb35ccd3a08507f3a593176eb4ece7d825a"}},{"ruleId":"D1","level":"warning","message":{"text":"UnqualifiedMethodCallSupport.typeUnqualifiedMethodCall (cyclomatic 33): UnqualifiedMethodCallSupport.typeUnqualifiedMethodCall has cyclomatic complexity 33 (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":"src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e107d42ee21ed69a6a3871c3cc2227e92505b13e60e0cd5637486e4f7d4c9d8a"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodCallFallbackSupport.typeCallWithBidirectionalInferenceCore (cyclomatic 32): MethodCallFallbackSupport.typeCallWithBidirectionalInferenceCore 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":"src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"97045403ae54fd8979cdd30bdb4da8cb58f1e55cf6cd1b01f009bacd8e723389"}},{"ruleId":"D1","level":"warning","message":{"text":"AsmCodeGeneration.codeMethod (cyclomatic 31): AsmCodeGeneration.codeMethod has cyclomatic complexity 31 (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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"685535921eb36a0ebf3ff87eacf62aad728942069f0ef7fb3a5e936a51392f8a"}},{"ruleId":"D1","level":"warning","message":{"text":"InstanceMethodCallSupport.typeMethodCallOnObjectChecked (cyclomatic 31): InstanceMethodCallSupport.typeMethodCallOnObjectChecked 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":"src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee15b550f0da303442148f6a0ee2d5b6e7145f9c3ab24d78548dfa98f87e9303"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCheckingHelpers.leastUpperBound (cyclomatic 31): TypeCheckingHelpers.leastUpperBound has cyclomatic complexity 31 (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":"src/main/scala/onion/compiler/typing/TypeCheckingHelpers.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0893e6b31bc59cf5acbef97406a4aa06b474a17d94470facc4fbaf6eb02406"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodResolutionSupport.applicable (cyclomatic 30): MethodResolutionSupport.applicable has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b93419292f02c172ffa59cbcdf275857944d02d8cd90784420e47c985757db"}},{"ruleId":"D1","level":"warning","message":{"text":"TryExpressionTyping.typeTryExpression (cyclomatic 30): TryExpressionTyping.typeTryExpression has cyclomatic complexity 30 (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":"src/main/scala/onion/compiler/typing/TryExpressionTyping.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f83ad8680fd8485e26450b9390e2715d9c04b802caaf564b3a0eed752824072"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRules.isSuperType (cyclomatic 29): TypeRules.isSuperType has cyclomatic complexity 29 (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":"src/main/scala/onion/compiler/TypedAST.scala"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a387dd1cd273471bea2ef8d0b3d3f518739f53a0aca33dc27a546e206d194c1"}},{"ruleId":"D1","level":"warning","message":{"text":"AsmCodeGeneration.asmType (cyclomatic 29): AsmCodeGeneration.asmType has cyclomatic complexity 29 (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. This shape REPEATS in the file: one other method here (AsmCodeGeneration.asmType) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b884a58358850f86368f4efdbd0819589ae79fc7de10994fc82c265015f61991"}},{"ruleId":"D1","level":"warning","message":{"text":"AsmCodeGeneration.asmType (cyclomatic 29): AsmCodeGeneration.asmType has cyclomatic complexity 29 (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. This shape REPEATS in the file: one other method here (AsmCodeGeneration.asmType) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a1f4d0824295a4c0c8f391bd6f6286635f80324a0de224404317aea4f22f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionParser.newBracketsAreTypeArgs (cyclomatic 29): OnionParser.newBracketsAreTypeArgs has cyclomatic complexity 29 (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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2592}}}],"partialFingerprints":{"codehealthFindingId/v1":"048fe9c3d2e942d83a628cafe3a4e54296997166a2b70209b09a2fd99689c3e4"}},{"ruleId":"D1","level":"warning","message":{"text":"NameResolver.map (cyclomatic 29): NameResolver.map has cyclomatic complexity 29 (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":"src/main/scala/onion/compiler/typing/NameResolution.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cec665d307f1ce7ef4fb0da150d3bf435461aa2aee2321c8b5af08693338f6"}},{"ruleId":"D1","level":"warning","message":{"text":"RecordCopySupport.tryRecordCopy (cyclomatic 29): RecordCopySupport.tryRecordCopy has cyclomatic complexity 29 (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":"src/main/scala/onion/compiler/typing/RecordCopySupport.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5ee1c2bd3c8858e40135ec25808abc839f14c5aa15c3231ec09f3c76d7105b"}},{"ruleId":"D1","level":"warning","message":{"text":"BridgeMethodEmitter.emitBridges (cyclomatic 28): BridgeMethodEmitter.emitBridges has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/backend/asm/BridgeMethodEmitter.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"212c3a3c71163e90d0cfaa03ad80bae6ef0fc2c5afcff194dadbf0d784fb9098"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraints.withDefaults (cyclomatic 28): Constraints.withDefaults has cyclomatic complexity 28 (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":"src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0f850914b3d2992b577bb44f837b6f8a76b75eaef4f8fbb301878e88635ac5"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionParser.classDecl (cyclomatic 27): OnionParser.classDecl 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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a0fc0edaa60cea8ff4256a6d0f5ad3d055a5e8b24388f74e1894f960803ed7"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionParser.integerLiteral (cyclomatic 27): OnionParser.integerLiteral 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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2868}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ee5352e790935c023afc1a6c505ced82343f5b8dea8db840c858eae7ed8488"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignabilitySupport.structurallyAssignable (cyclomatic 27): AssignabilitySupport.structurallyAssignable has cyclomatic complexity 27 (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":"src/main/scala/onion/compiler/typing/AssignabilitySupport.scala"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4072805dc1dcce049dfaab89a038535eacf5bdd6e7c0075d3c0b6af0d2db47e4"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticMethodCallSupport.typeStaticCallWithBidirectionalInferenceCore (cyclomatic 27): StaticMethodCallSupport.typeStaticCallWithBidirectionalInferenceCore has cyclomatic complexity 27 (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":"src/main/scala/onion/compiler/typing/StaticMethodCallSupport.scala"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3c9d274e7daf59a74f6f262f44ced4b962d1c4696fee30cc1a7a7ee05835e5"}},{"ruleId":"D1","level":"warning","message":{"text":"Cli.tryParse (cyclomatic 27): Cli.tryParse 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":"src/main/java/onion/Cli.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea55fa5d690ba7166b89e889abd5566fdff5b9555d78ee72cbafbacdc0d8a280"}},{"ruleId":"D1","level":"warning","message":{"text":"ControlFlowEmitter.emitTry (cyclomatic 26): ControlFlowEmitter.emitTry has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"03323e3b201faa45266c1cbb490380a75989faf928f84f9c2343138687653d05"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionLexer.scanToken (cyclomatic 26): OnionLexer.scanToken has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bcbe40af2024dab9fe500afdfc6287d392a3b3bd1d322dc49196529d2ac3f5"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionLexer.integerEnd (cyclomatic 26): OnionLexer.integerEnd has cyclomatic complexity 26 (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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd71caf5e8388f54a36f485afa3e7789fb9b85da8fe78d30b0a31ddae69e75e"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionParser.primaryRest (cyclomatic 26): OnionParser.primaryRest has cyclomatic complexity 26 (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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"22848be8bf6c05d7d2f329a3f72c3d38806e985ae9eca5c49c0e891fe78d1027"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstructionTyping.diamondTypeFromArguments (cyclomatic 26): ConstructionTyping.diamondTypeFromArguments has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"88101957802fd17995b4656de25a5cb9b5a2b522c5bab00af3da93d51d128520"}},{"ruleId":"D1","level":"warning","message":{"text":"Cli.parse (cyclomatic 26): Cli.parse has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Cli.java"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"06159f262ae8628237ed9ac45baf748540ee04887f9df79fb73843490cd43439"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonParser.parseNumber (cyclomatic 26): JsonParser.parseNumber 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":"src/main/java/onion/Json.java"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3f3f29126796ff3bc79fb68dc08393e0e51df4ff7be3c014c1557fa3309540"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticErrorReporter.reportNullableMemberAccess (cyclomatic 25): SemanticErrorReporter.reportNullableMemberAccess 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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"c648605d340f81890441726191f627e8c458df776fb4958e0c2275181c5f6251"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRules.isSuperTypeForClassUncached (cyclomatic 25): TypeRules.isSuperTypeForClassUncached 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":"src/main/scala/onion/compiler/TypedAST.scala"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5944283730e4ae1bd5f24468cc95f3b5ec1f6fd4022fd26def854dbab5627d2"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentTyping.processMemberAssign (cyclomatic 25): AssignmentTyping.processMemberAssign has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/AssignmentTyping.scala"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b14dba4ea37f7e93fc6c4402d22340046dee2f3ce4b2ec881d361a83344c95"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstructionTyping.resolveConstructorForClosures (cyclomatic 25): ConstructionTyping.resolveConstructorForClosures 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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc79fd398d049d98621c9f2fcd991065454b69c7bc48d56ab2acfa951bcc9ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Rewriting.appendAutoCliCall (cyclomatic 24): Rewriting.appendAutoCliCall 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. This is NOT this file\u0027s highest cyclomatic complexity: Rewriting.rewriteExpression (cyclomatic 83) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05d13bba62cc25d76ebcf19e0531201dd287ff676b4a2fcee9636509fcd0891"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionParser.interpolated (cyclomatic 24): OnionParser.interpolated 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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf5c5dee7467fb82f98835f39eb31e3e6f30f59ef0cc82018cddd2cc840dfc2"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodBodySupport.processConstructorDeclaration (cyclomatic 24): MethodBodySupport.processConstructorDeclaration 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":"src/main/scala/onion/compiler/typing/MethodBodySupport.scala"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb0032630ff622c74d4d0585a804795e26898e74c474517f0f4995ec469b932"}},{"ruleId":"D1","level":"warning","message":{"text":"Repl.requiresContinuation (cyclomatic 24): Repl.requiresContinuation 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":"src/main/scala/onion/tools/Repl.scala"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"04374bb328f585b684399f6c60c6dde692a26801d262bc13d3368bfb4bc44a2f"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigShape.printLossless (cyclomatic 24): ConfigShape.printLossless 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":"src/main/java/onion/ConfigShape.java"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"847832c5c78d605cd470c640621821024b69cd015814715e18b8fd938fb70211"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionFormTyping.typeElvis (cyclomatic 23): ExpressionFormTyping.typeElvis has cyclomatic complexity 23 (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":"src/main/scala/onion/compiler/typing/ExpressionFormTyping.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f781c5ae7ede18b8680b96235ceda5cb6a9b1a754e72658c5cc45137c6f27d9f"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleExpressionTypingSupport.typeMapLiteral (cyclomatic 23): SimpleExpressionTypingSupport.typeMapLiteral 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. This is NOT this file\u0027s highest cyclomatic complexity: SimpleExpressionTypingSupport.typeSimple (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.scala"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88ad513bdf5f65fc703f2799ae4c1907113e90602696819fc0ef01f3b4c3436"}},{"ruleId":"D1","level":"warning","message":{"text":"DocModel.scanDocComments (cyclomatic 23): DocModel.scanDocComments 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":"src/main/scala/onion/tools/doc/DocModel.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"657a931bf708af2c5f0de554ea3528b44459cced8d21ef620c46c67200f43b7a"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignedVariableScanner.scan (cyclomatic 22): AssignedVariableScanner.scan 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":"src/main/scala/onion/compiler/AssignedVariableScanner.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e490c58f6a60ad9a4eae73dde4ee38dbabc24423206bca2b03ec4b85288beb7e"}},{"ruleId":"D1","level":"warning","message":{"text":"Rewriting.toolContractJson (cyclomatic 22): Rewriting.toolContractJson 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. This is NOT this file\u0027s highest cyclomatic complexity: Rewriting.rewriteExpression (cyclomatic 83) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"becc72d199cb9be0f2a5334d699cdfd910ad9f0c64c501eb208f0a89f5ff8ad3"}},{"ruleId":"D1","level":"warning","message":{"text":"ControlFlowSyntaxHints.classify (cyclomatic 22): ControlFlowSyntaxHints.classify 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":"src/main/scala/onion/compiler/parser/ControlFlowSyntaxHints.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a19198634aac103550d5f6dcc463d711531b7e0e21ebc17979ef6a30f5c2de"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentTyping.processArrayAssign (cyclomatic 22): AssignmentTyping.processArrayAssign 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":"src/main/scala/onion/compiler/typing/AssignmentTyping.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d25dd44474ee1ff4e55c971bf60365e2f63a81e27c5402a3f439ef57b3e70c"}},{"ruleId":"D1","level":"warning","message":{"text":"OperatorTyping.processEquals (cyclomatic 22): OperatorTyping.processEquals 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":"src/main/scala/onion/compiler/typing/OperatorTyping.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92d7bd974c018eddd19bb2457b908a179ab50d18ab38f61ce9638ff46230970"}},{"ruleId":"D1","level":"warning","message":{"text":"Repl.executeCode (cyclomatic 22): Repl.executeCode 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":"src/main/scala/onion/tools/Repl.scala"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb177a77f55259382ea687a3950ebceb71ed3258b761ecc7acb4c819b0f54d67"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticOperands.operand (cyclomatic 21): StaticOperands.operand 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":"src/main/scala/onion/compiler/effects/StaticOperands.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc699cee2c457c7b4a56ca633a543edc8c3f8a28f2a4463a6f4699472b043cb"}},{"ruleId":"D1","level":"warning","message":{"text":"ClosureTyping.resolveClosureArgTypes (cyclomatic 21): ClosureTyping.resolveClosureArgTypes has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"276dda48eb39a24e4969fdd75bdb88c483f87b9aabc175589a357072b98f8aaf"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryWritePass.checkInherited (cyclomatic 21): HistoryWritePass.checkInherited has cyclomatic complexity 21 (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":"src/main/scala/onion/compiler/typing/HistoryWritePass.scala"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6dd722032f7499ed01e6c1a8924988f3210e4dc25c7d7475f44e3ba466b0f7"}},{"ruleId":"D1","level":"warning","message":{"text":"OperatorTyping.typePostUpdate (cyclomatic 21): OperatorTyping.typePostUpdate 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":"src/main/scala/onion/compiler/typing/OperatorTyping.scala"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcaed3ccd96cb019cbed95c37c88df7f17a51807ce9685a4ab2e49238488d2a"}},{"ruleId":"D1","level":"warning","message":{"text":"evolution_lib.classify (cyclomatic 21): evolution_lib.classify has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/evolution_lib.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a275ae0f4ace43dcd48a62eee930b915976cb8e8f7340f4672947fcd531403"}},{"ruleId":"D1","level":"warning","message":{"text":"AsmCodeGeneration.generateClass (cyclomatic 20): AsmCodeGeneration.generateClass 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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf43a54d3d4662342b88c58c144d8b02679afd025163beb094ef6661d50ed57"}},{"ruleId":"D1","level":"warning","message":{"text":"TailCallOptimization.isSelfCall (cyclomatic 20): TailCallOptimization.isSelfCall has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/optimization/TailCallOptimization.scala"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb57bda033458624a1791cb6a4ba054cd52ef46c68ebbe10b7a3d982b8d61cf"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionLexer.decode (cyclomatic 20): OnionLexer.decode has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3182a82325252fd93aab59921756e0313ae410374b1ad566bd9e707cd6a802b"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodResolutionSupport.primitiveExactTiebreak (cyclomatic 20): MethodResolutionSupport.primitiveExactTiebreak has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae8d33beceeb51fce5b83484702f14a3dcd50914bf1b6694c192b8953b473a2"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticMethodCallSupport.typeStaticMethodCall (cyclomatic 20): StaticMethodCallSupport.typeStaticMethodCall has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/StaticMethodCallSupport.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbb535ce4a70d222a68b778fc0e84c2285f9bfbdfde25ee5c191b5883539faa"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRelations.isAssignableWithBoxing (cyclomatic 20): TypeRelations.isAssignableWithBoxing has cyclomatic complexity 20 (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":"src/main/scala/onion/compiler/typing/TypeRelations.scala"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"306ffcd673289f3a55f6f0ac9dfae4d4dbe33087ca75f046a090b984e04d3649"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionCli.run (cyclomatic 20): OnionCli.run has cyclomatic complexity 20 (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":"src/main/scala/onion/tools/OnionCli.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6636984bda7d8bd00cbdd8581182f6b36cd2e48e6efdc2777b046cc0e843af96"}},{"ruleId":"D1","level":"warning","message":{"text":"Migrator.interpolationBodies (cyclomatic 20): Migrator.interpolationBodies has cyclomatic complexity 20 (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":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"701d71b665788b50b2fe2769219702df735183415d59b83cdb9c867d432f391b"}},{"ruleId":"D1","level":"warning","message":{"text":"Csv.parse (cyclomatic 20): Csv.parse has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Csv.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cb5a602fea41de9e42b9543511ec5905a7ff18afd290dc09e3c92a59fb3524"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolCli.plan (cyclomatic 20): ToolCli.plan has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/ToolCli.java"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe323236a0d4abaec438ce32043aacc395f5d840ed38e63eaedacb1e49df715a"}},{"ruleId":"D1","level":"warning","message":{"text":"Rewriting.formatSegments (cyclomatic 19): Rewriting.formatSegments has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Rewriting.rewriteExpression (cyclomatic 83) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7254384f113bc8a8b32205762ce9ff7416189bf9891a8e0f8261a4754b7268"}},{"ruleId":"D1","level":"warning","message":{"text":"CallOverloadSupport.boxingTiebreak (cyclomatic 19): CallOverloadSupport.boxingTiebreak has cyclomatic complexity 19 (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":"src/main/scala/onion/compiler/typing/CallOverloadSupport.scala"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"276191cc71e4da61c7486b93dbe9f0dd63a641545e1dab58f45c73a5bb590f8c"}},{"ruleId":"D1","level":"warning","message":{"text":"DuplicationChecks.checkOverrideContracts (cyclomatic 19): DuplicationChecks.checkOverrideContracts 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":"src/main/scala/onion/compiler/typing/DuplicationChecks.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70a902008ef5c52f4b3b90bf1eebce3e3bdc1123ead2d6ead55d6bccd916d68"}},{"ruleId":"D1","level":"warning","message":{"text":"DuplicationChecks.checkAbstractMethodImplementation (cyclomatic 19): DuplicationChecks.checkAbstractMethodImplementation 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":"src/main/scala/onion/compiler/typing/DuplicationChecks.scala"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"08727e267e25cf9b475dab57f62cc0e62cab3dfcf906514872c757feb7bb4b3e"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraints.collect (cyclomatic 19): Constraints.collect 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":"src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b98ec0e97478db59eb33bde596962a626991b839cdf465d0a510b0b47cb8938"}},{"ruleId":"D1","level":"warning","message":{"text":"SuperMethodCallSupport.typeSuperMethodCall (cyclomatic 19): SuperMethodCallSupport.typeSuperMethodCall 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":"src/main/scala/onion/compiler/typing/SuperMethodCallSupport.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba773ce92861a080cec352d895aca66f3a176336132cb4bf7dcfc0b022f285d2"}},{"ruleId":"D1","level":"warning","message":{"text":"TypingBodyPass.processEnumDeclaration (cyclomatic 19): TypingBodyPass.processEnumDeclaration 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":"src/main/scala/onion/compiler/typing/TypingBodyPass.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4eafb15e04274996e364e9cb6fc4f6aa07add5877eb8a1e829c214fb1847850"}},{"ruleId":"D1","level":"warning","message":{"text":"Run.step (cyclomatic 18): Run.step has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/contracts/HistoryProver.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74fcbd449ee6e03f6579765381523c85fe3e605522be335b7ded37662ee9eb2"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionLexer.characterEnd (cyclomatic 18): OnionLexer.characterEnd 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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"685b99cf0b8e73f56a78beac234dc327f61185f72765149a321dd2369671a1b1"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionLexer.withExponentAndSuffix (cyclomatic 18): OnionLexer.withExponentAndSuffix 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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f55c267ff021d7fd8be0a0161c1eb01978af478fa607c42c62baf956ed65e9"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionParser.staticAccessPrimary (cyclomatic 18): OnionParser.staticAccessPrimary 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. This is NOT this file\u0027s highest cyclomatic complexity: OnionParser.blockElement (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2419}}}],"partialFingerprints":{"codehealthFindingId/v1":"5648e42e266a4fa42d480cb9c85e2159778fe3a72192618079d6280887828d07"}},{"ruleId":"D1","level":"warning","message":{"text":"Boxing.unboxing (cyclomatic 18): Boxing.unboxing has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/toolbox/Boxing.scala"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"463790a9535ce8c36019cecf8a17171a540e16248fd415d0c22f1c6fb36c6400"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockElementLowering.translateDestructuring (cyclomatic 18): BlockElementLowering.translateDestructuring has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/BlockElementLowering.scala"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61ed33def24d555bef5cf71983c19aa07545929a854273052cd1984d0c04d29"}},{"ruleId":"D1","level":"warning","message":{"text":"CallArgumentTypingSupport.processNamedArguments (cyclomatic 18): CallArgumentTypingSupport.processNamedArguments 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":"src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf0b1f73591fd02fedd771c802c34a2de155ec9ee633383f46f76bee0d96cfd"}},{"ruleId":"D1","level":"warning","message":{"text":"CallOverloadSupport.narrowNamedByArgumentTypes (cyclomatic 18): CallOverloadSupport.narrowNamedByArgumentTypes 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":"src/main/scala/onion/compiler/typing/CallOverloadSupport.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10882530c2b143ee7de9134ab919132ec492c761e0f7f6daa08f2ff57664401"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleExpressionTypingSupport.typeBinaryAssignmentSimple (cyclomatic 18): SimpleExpressionTypingSupport.typeBinaryAssignmentSimple 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. This is NOT this file\u0027s highest cyclomatic complexity: SimpleExpressionTypingSupport.typeSimple (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.scala"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60b8ce4d17b11d249eecd97749365ad28eec8557598acd5b4423b891b3276b3"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleExpressionTypingSupport.typeIdentifier (cyclomatic 18): SimpleExpressionTypingSupport.typeIdentifier 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. This is NOT this file\u0027s highest cyclomatic complexity: SimpleExpressionTypingSupport.typeSimple (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.scala"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"c588c73a373df126bc8d429623dd2173b1089f6111e9be1f2f69ef0525d89853"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeNarrowingAnalysis.extractNarrowing (cyclomatic 18): TypeNarrowingAnalysis.extractNarrowing 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":"src/main/scala/onion/compiler/typing/TypeNarrowingAnalysis.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11bf2d3f49dea808e288bc0c8e0595ee926550d4496f9f52506fb1c942d12a5"}},{"ruleId":"D1","level":"warning","message":{"text":"RetToYield.endsDoBlock (cyclomatic 18): RetToYield.endsDoBlock 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":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca39062cc7fd6124a70fb9891aec659bf3c879379ee27cf7e8b565c76c1babdb"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonParser.parseString (cyclomatic 18): JsonParser.parseString 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. This is NOT this file\u0027s highest cyclomatic complexity: JsonParser.parseValue (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Json.java"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76f7ab5794d5bf1b81bebc8b074935f2c92d1b6f9f79e69bd54b8d1c08e4c90"}},{"ruleId":"D1","level":"warning","message":{"text":"Yaml.parseScalar (cyclomatic 18): Yaml.parseScalar 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":"src/main/java/onion/Yaml.java"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"c170e46ff7b7d550a8b6eee3e8e7658b518a44a2792f538ae17129e5c4d8be29"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticErrorReporter.javaParamAccepts (cyclomatic 17): SemanticErrorReporter.javaParamAccepts 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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b506f027a3b2379f04b2cd9b45753b8f7d61fe68dd42f8347d405f9bdf6619"}},{"ruleId":"D1","level":"warning","message":{"text":"AsmCodeGeneration.codeConstructor (cyclomatic 17): AsmCodeGeneration.codeConstructor 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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ebb984114c45063aae719dc68758b0bb3d4d8fd42bbe1684c7d3fe6ea1ca39"}},{"ruleId":"D1","level":"warning","message":{"text":"AsmCodeGeneration.emitSetLocal (cyclomatic 17): AsmCodeGeneration.emitSetLocal 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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a54e778f71c29cdf1dcb819c7a13384e3c3984aa1ca94a3e9b40c03210c71e2"}},{"ruleId":"D1","level":"warning","message":{"text":"MutualRecursionOptimization.argumentStores (cyclomatic 17): MutualRecursionOptimization.argumentStores 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":"src/main/scala/onion/compiler/optimization/MutualRecursionOptimization.scala"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"e318767ac8f363360f12cda76a5fbe4b95350e2745575f992fb6baa1678d257b"}},{"ruleId":"D1","level":"warning","message":{"text":"TailCallOptimization.transformTailCall (cyclomatic 17): TailCallOptimization.transformTailCall 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":"src/main/scala/onion/compiler/optimization/TailCallOptimization.scala"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2807928fb72b6f4c17f448da54feabc6af1081ad465738420a6d423c415204b"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionLexer.getNextToken (cyclomatic 17): OnionLexer.getNextToken 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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"045db5ea7b49e91d510f7aa8c54753c74d7c63030912993c9f4904b68162a68b"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionParser.typeImpl (cyclomatic 17): OnionParser.typeImpl 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. This is NOT this file\u0027s highest cyclomatic complexity: OnionParser.blockElement (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b87bd6cf8676d0fe34b9e762f737148f2006270be025f71d88e1c00d0d14e7"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclarationBodySupport.unitDefaultJobs (cyclomatic 17): DeclarationBodySupport.unitDefaultJobs 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":"src/main/scala/onion/compiler/typing/DeclarationBodySupport.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca046d56e1f2aebb6a0ac7249717cc51949bf687096e43acc6ba4a0239c0eeb4"}},{"ruleId":"D1","level":"warning","message":{"text":"DestructuringPatternProcessor.process (cyclomatic 17): DestructuringPatternProcessor.process 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":"src/main/scala/onion/compiler/typing/DestructuringPatternProcessor.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca984772238f2e611146962bb885884a460892ffad0f9d77abef6a576721c9e8"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodBodySupport.processMethodLikeBody (cyclomatic 17): MethodBodySupport.processMethodLikeBody 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":"src/main/scala/onion/compiler/typing/MethodBodySupport.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7bef02f1395e52474f041baf208c61dee9b4111256f4f6add3c9e926e5398f"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleExpressionTypingSupport.typeListLiteral (cyclomatic 17): SimpleExpressionTypingSupport.typeListLiteral 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. This is NOT this file\u0027s highest cyclomatic complexity: SimpleExpressionTypingSupport.typeSimple (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.scala"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1e5ca92b8257139cee902c15d4da1a0dd3d40ded68b7f7e65e1569b78f0be9"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeNarrowingAnalysis.extractNullCheckNarrowing (cyclomatic 17): TypeNarrowingAnalysis.extractNullCheckNarrowing 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":"src/main/scala/onion/compiler/typing/TypeNarrowingAnalysis.scala"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2705fb4d75abc7a9256546b66b9014a786feed2eeb1405b1bb1ec80870bc95"}},{"ruleId":"D1","level":"warning","message":{"text":"UnqualifiedMethodCallSupport.typeUnqualifiedCallWithClosures (cyclomatic 17): UnqualifiedMethodCallSupport.typeUnqualifiedCallWithClosures 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":"src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4a5ddce1659578a483c9c8fd1da889e6574c23d98107da46cecea7cb1f36ba"}},{"ruleId":"D1","level":"warning","message":{"text":"CompilerFrontend.run (cyclomatic 17): CompilerFrontend.run 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":"src/main/scala/onion/tools/CompilerFrontend.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"83912abf668cad34e63af31cbd2cdb0f7a6a86a41ec356b66d50360a34ef75ad"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceRegions.codeMask (cyclomatic 17): SourceRegions.codeMask 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":"src/main/scala/onion/tools/lsp/SourceRegions.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e180925abc9421a65115daec3e9ce838f02e55596568eef6be52ecc7c13e69d"}},{"ruleId":"D1","level":"warning","message":{"text":"LawExampleToPredicate.render (cyclomatic 17): LawExampleToPredicate.render 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":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"acac491b4d44fc0d64a6a371da086342ea14cef72b7e3787c606303dccfac271"}},{"ruleId":"D1","level":"warning","message":{"text":"Scalars.coerce (cyclomatic 17): Scalars.coerce 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":"src/main/java/onion/Scalars.java"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5941e656ca897bdfcb00436969b9afa66c4117a068a061810d1eedadc2e1f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Parsing.syntaxErrorMessage (cyclomatic 16): Parsing.syntaxErrorMessage 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":"src/main/scala/onion/compiler/Parsing.scala"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6984a13b40bf87d46a13c3a272d412b7b54bde2aa05926387b37a7440b88f01e"}},{"ruleId":"D1","level":"warning","message":{"text":"Rewriting.appendToolCliMain (cyclomatic 16): Rewriting.appendToolCliMain 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. This is NOT this file\u0027s highest cyclomatic complexity: Rewriting.rewriteExpression (cyclomatic 83) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3359d86da469fad59fe1b90a36a4d53d8ce84f988299ec8fef303c06216ba7b5"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticErrorReporter.argPassable (cyclomatic 16): SemanticErrorReporter.argPassable 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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a10e3651178d8250f01fa90f1cf9744d470ec7a119903867b501f8dfaab9169"}},{"ruleId":"D1","level":"warning","message":{"text":"AsmCodeGeneration.emitRefLocal (cyclomatic 16): AsmCodeGeneration.emitRefLocal 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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11b52d94e86ab87d70c2101c4b907446ed3738d50c141bcc039bb484a815c79"}},{"ruleId":"D1","level":"warning","message":{"text":"Run.cond (cyclomatic 16): Run.cond has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/contracts/HistoryProver.scala"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"962b078d6e7133c91e36013435fcc0c9cae21e331b98afacddc1a4349d35449e"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector.recordObjectMethod (cyclomatic 16): Collector.recordObjectMethod has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/effects/EffectInference.scala"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc20c842843e3e041d2e64b206d8b745efb5d59ffb9a4fa830be30d32ee341eb"}},{"ruleId":"D1","level":"warning","message":{"text":"EffectTable.parseLines (cyclomatic 16): EffectTable.parseLines 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":"src/main/scala/onion/compiler/effects/EffectTable.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f84ac7d2811230ea48577fb84414760919c8622d178e3ee3ae73a41dad84c7"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericTypeMapper.toOnionType (cyclomatic 16): GenericTypeMapper.toOnionType 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":"src/main/scala/onion/compiler/environment/ReflectionRefs.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"060eb1bf8158173e719dcfa4255a15a32390fc13da476e000a503e190d4b708e"}},{"ruleId":"D1","level":"warning","message":{"text":"TailCallOptimization.checkStatementForTailCall (cyclomatic 16): TailCallOptimization.checkStatementForTailCall 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":"src/main/scala/onion/compiler/optimization/TailCallOptimization.scala"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ba7c25ddc19e190af255b084e11b12269968a144ccff80f87132a8f016f1bd"}},{"ruleId":"D1","level":"warning","message":{"text":"OnionParser.topLevel (cyclomatic 16): OnionParser.topLevel 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. This is NOT this file\u0027s highest cyclomatic complexity: OnionParser.blockElement (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c00d8999db039bc7fd413abcf8fbf3dfd90c23b9e667a9b5cd3f5de17a3d31"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentExpectedTypeRetyping.retypeTargetTypedClosures (cyclomatic 16): ArgumentExpectedTypeRetyping.retypeTargetTypedClosures 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":"src/main/scala/onion/compiler/typing/ArgumentExpectedTypeRetyping.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"15151c51a2e31f94e29f581718b7e187cdf318ab339623bdeae0373f5d2ebec4"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstructionTyping.resolveConstructorWithNamedArgs (cyclomatic 16): ConstructionTyping.resolveConstructorWithNamedArgs 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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"e389b61086dc40b8c16de6e65ccf2b8300985c88875c8f81070d9cf233031b41"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstructionTyping.processNamedArgsForConstructor (cyclomatic 16): ConstructionTyping.processNamedArgsForConstructor 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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72e01fa47009901ea517082689f4fc939aebeba284b86bd43c76eaf40fa5345"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryWritePass.proveRest (cyclomatic 16): HistoryWritePass.proveRest has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/HistoryWritePass.scala"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd7550e986bf81f2a9f3df6a2bbee4b773220e9e8d2182dd2824b6aa0fea91d"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementReachability.definitelyReturns (cyclomatic 16): StatementReachability.definitelyReturns 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":"src/main/scala/onion/compiler/typing/StatementReachability.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe12c623d512bfa948860f7824670a9555feedea72f2ab0e10db270923732cb9"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticImportMethodCallSupport.resolveStaticImportMethodCall (cyclomatic 16): StaticImportMethodCallSupport.resolveStaticImportMethodCall 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":"src/main/scala/onion/compiler/typing/StaticImportMethodCallSupport.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e762fb7d06f8eec26b76ebf0e7bd6d6b35aaef5d788efbedc44b1b2da620f989"}},{"ruleId":"D1","level":"warning","message":{"text":"StringInterpolationTyping.typeStringInterpolation (cyclomatic 16): StringInterpolationTyping.typeStringInterpolation 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":"src/main/scala/onion/compiler/typing/StringInterpolationTyping.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bbeb75c8a8b2309ef07ee730753136fea5631ec025bd69ad1821536694e9dc"}},{"ruleId":"D1","level":"warning","message":{"text":"TopLevelTypingSupport.processToplevels (cyclomatic 16): TopLevelTypingSupport.processToplevels 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":"src/main/scala/onion/compiler/typing/TopLevelTypingSupport.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"651c01598fe25ce0e4bab1f0f5422d38227109b28999490ee8590d52aec6beeb"}},{"ruleId":"D1","level":"warning","message":{"text":"TypingTypeSupport.checkTypeArgumentBounds (cyclomatic 16): TypingTypeSupport.checkTypeArgumentBounds 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":"src/main/scala/onion/compiler/typing/TypingTypeSupport.scala"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a07eb1095c428b776e928b75a712f55c27784351171a79377d0bfa2b72b814e"}},{"ruleId":"D1","level":"warning","message":{"text":"UnqualifiedMethodCallSupport.typeUnqualifiedMethodCallWithNamedArgs (cyclomatic 16): UnqualifiedMethodCallSupport.typeUnqualifiedMethodCallWithNamedArgs 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":"src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d84fd0c42cdb04a046bffe898a7a5db30fd11622b79343554e958ea4373237b"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgGenerator.normalize (cyclomatic 16): ArgGenerator.normalize 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":"src/main/scala/onion/compiler/verification/ArgGenerator.scala"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f3e10b8c11238352d8b097aa5b6b6ba4e974e45042c0cb404db322030fef2b"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptRunner.prepare (cyclomatic 16): ScriptRunner.prepare 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":"src/main/scala/onion/tools/ScriptRunner.scala"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda7626e20d0152814297bc37d570fa6a7fc52263fe2b6f17ab7ed103e67d169"}},{"ruleId":"D1","level":"warning","message":{"text":"RetToYield.inThisCode (cyclomatic 16): RetToYield.inThisCode 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":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"8396706c891e49ba3cce7f8e517aaa31c5d58b34978aa7d32d594e5c984f4484"}},{"ruleId":"D1","level":"warning","message":{"text":"Json.stringifyInternal (cyclomatic 16): Json.stringifyInternal 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. This is NOT this file\u0027s highest cyclomatic complexity: JsonParser.parseValue (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Json.java"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5102508f957fb6293e6c3aac80553e4ecf5e9b1d19ea75a7a03b7370d56ed91"}},{"ruleId":"D1","level":"warning","message":{"text":"Text.table (cyclomatic 16): Text.table 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":"src/main/java/onion/Text.java"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd2bc6174546404e818973419f4c82f6419f7d500e2dcb483b3cf51b85b7c3d"}},{"ruleId":"D1","level":"warning","message":{"text":"Yaml.findKeySeparator (cyclomatic 16): Yaml.findKeySeparator 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":"src/main/java/onion/Yaml.java"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5b947366560488cb4334641cb2295f2536079d62fc871a5ad054723e6850a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Yaml.needsQuoting (cyclomatic 16): Yaml.needsQuoting 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":"src/main/java/onion/Yaml.java"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b3f07866f961d6e0cc0601c5095bc5f53bfb04d7307439aee2dea622e304be"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockElementLowering.translate (cognitive 220): BlockElementLowering.translate has cognitive complexity 220 (threshold 15). Drivers by points: if/else 84 (163 pts), match/switch 13 (34 pts), boolean chains 15, loops 4 (8 pts) (nesting depth added 104). 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":"src/main/scala/onion/compiler/typing/BlockElementLowering.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6814e48de5d84891245954acb95b524aca5f2fb9392aa137657f453517951436"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectExpressionTyping.typeSelectExpression (cognitive 191): SelectExpressionTyping.typeSelectExpression has cognitive complexity 191 (threshold 15). Drivers by points: match/switch 30 (92 pts), if/else 52 (84 pts), boolean chains 14, loops 1 (nesting depth added 94). 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":"src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a97728ddd499376c77cc428e80e0633db1c684b5ded862d241ff6b56b2bd6a"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignabilitySupport.processAssignable (cognitive 105): AssignabilitySupport.processAssignable has cognitive complexity 105 (threshold 15). Drivers by points: if/else 36 (50 pts), match/switch 14 (45 pts), boolean chains 10 (nesting depth added 45). 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":"src/main/scala/onion/compiler/typing/AssignabilitySupport.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"13386e77912ac7f12df65fcba37e65da175f4f87871e9b786fd6ba93ceb68956"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolCli.dispatch (cognitive 98): ToolCli.dispatch has cognitive complexity 98 (threshold 15). Drivers by points: if/else 34 (76 pts), loops 9 (14 pts), ternaries 4 (5 pts), boolean chains 2, error handling 1 (nesting depth added 48). 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":"src/main/java/onion/ToolCli.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"741a9bf2d55417cac7f595d6bc8ded32fdcc389a649a0cd58b09bf0822fabafe"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosureTyping.typeClosure (cognitive 94): ClosureTyping.typeClosure has cognitive complexity 94 (threshold 15). Drivers by points: if/else 36 (62 pts), match/switch 9 (18 pts), boolean chains 14 (nesting depth added 35). 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":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"afda18d85b366fa49606ee43564f1c731eedccee30ddef773d0347db904d54bb"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionLexer.operator (cognitive 93): OnionLexer.operator has cognitive complexity 93 (threshold 15). Drivers by points: if/else 64 (92 pts), match/switch 1 (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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"17df6d9436ef1ccd3c52e08a9031e3465d4a9106f14cc56a82fe75ed72b4e3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingOutlinePass.processRecordDeclaration (cognitive 92): TypingOutlinePass.processRecordDeclaration has cognitive complexity 92 (threshold 15). Drivers by points: if/else 29 (59 pts), boolean chains 21, match/switch 4 (10 pts), loops 2 (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":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b851e89a1bc9b67df0ef082fb4fef7047cbc231457dd1403acfc52ed35e68a0"}},{"ruleId":"D2","level":"warning","message":{"text":"BridgeMethodEmitter.emitBridges (cognitive 91): BridgeMethodEmitter.emitBridges has cognitive complexity 91 (threshold 15). Drivers by points: if/else 24 (73 pts), boolean chains 9, loops 3 (9 pts) (nesting depth added 55). 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":"src/main/scala/onion/compiler/backend/asm/BridgeMethodEmitter.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f31989e9ff2e895c4dbcce7d1afd667f7987d7ad7386e3ee9e52c61850c90e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionMethodFallbackSupport.tryExtensionMethodCallBidirectional (cognitive 81): ExtensionMethodFallbackSupport.tryExtensionMethodCallBidirectional has cognitive complexity 81 (threshold 15). Drivers by points: if/else 31 (51 pts), match/switch 6 (15 pts), boolean chains 13, loops 2 (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":"src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"94424aaa961f07a210f4452c7597ecd4e93fe0dcab2480ad79b4643ead920109"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectExpressionTyping.processPatterns (cognitive 78): SelectExpressionTyping.processPatterns has cognitive complexity 78 (threshold 15). Drivers by points: if/else 26 (41 pts), match/switch 9 (19 pts), boolean chains 16, error handling 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc241861e10c4523640257cf6cf91bd6a10f58bea7b79377f71c728135c4a9b"}},{"ruleId":"D2","level":"warning","message":{"text":"MigrateCommand.migrate (cognitive 76): MigrateCommand.migrate has cognitive complexity 76 (threshold 15). Drivers by points: if/else 33 (46 pts), boolean chains 16, match/switch 5 (8 pts), error handling 5 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/migrate/MigrateCommand.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5c0f7406ff4ea5071971cbfc5ade812a4c2f4e339a914dc60507dc72ad917c"}},{"ruleId":"D2","level":"warning","message":{"text":"LawExampleToPredicate.find (cognitive 74): LawExampleToPredicate.find has cognitive complexity 74 (threshold 15). Drivers by points: if/else 21 (51 pts), boolean chains 16, match/switch 2 (5 pts), error handling 1, loops 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e919fd9d06dfebfd752cea43c88de95757fe333eceb896befc7deecb0079a4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"LawExampleToPredicate.render (cognitive 70): LawExampleToPredicate.render has cognitive complexity 70 (threshold 15). Drivers by points: if/else 10 (38 pts), loops 7 (26 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 50). 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":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ba2f32b4f52d185ffcfed47c082872db0a879450710659b3891bbe609f30c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructionTyping.typeNewObject (cognitive 69): ConstructionTyping.typeNewObject has cognitive complexity 69 (threshold 15). Drivers by points: if/else 31 (36 pts), match/switch 14 (21 pts), boolean chains 12 (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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"00409273f13779554f7b2e60deadeeb9030528a6a15e44484148ec6efe63976b"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.interpolated (cognitive 68): OnionParser.interpolated has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (52 pts), loops 3 (9 pts), error handling 1 (4 pts), boolean chains 3 (nesting depth added 38). 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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"9faa811e55deaed7a52fdfe83f0ce6eb302758c6b53ca80687352ba4d628c8a3"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticErrorReporter.reportMethodNotFound (cognitive 66): SemanticErrorReporter.reportMethodNotFound has cognitive complexity 66 (threshold 15). Drivers by points: if/else 31 (34 pts), boolean chains 19, match/switch 9 (13 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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c18b4907344474b4df11df7833c9c8cf0abf76d07fd087b3ca806d8bf4e32b"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodResolutionSupport.applicable (cognitive 61): MethodResolutionSupport.applicable has cognitive complexity 61 (threshold 15). Drivers by points: if/else 25 (41 pts), boolean chains 8, loops 3 (7 pts), match/switch 2 (5 pts) (nesting depth added 23). 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":"src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc94a4cd8f06fe4555d61a0949851a596c8dbd4652690882ae4bf908a85572ce"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordCopySupport.tryRecordCopy (cognitive 61): RecordCopySupport.tryRecordCopy has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (29 pts), match/switch 11 (26 pts), boolean chains 4, loops 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/RecordCopySupport.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9a5f920ace9d7db52e452b79c4551d166e717c29a7c73cc5ce591c1c256990"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraints.unify (cognitive 60): Constraints.unify has cognitive complexity 60 (threshold 15). Drivers by points: match/switch 12 (29 pts), if/else 17 (25 pts), boolean chains 6 (nesting depth added 25). 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":"src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad417ca9b560f9ee65a191530c33d5c2ee4e14da7ebbef7a44a7991d187ffc0"}},{"ruleId":"D2","level":"warning","message":{"text":"InstanceMethodCallSupport.typeMethodCallOnObjectChecked (cognitive 58): InstanceMethodCallSupport.typeMethodCallOnObjectChecked has cognitive complexity 58 (threshold 15). Drivers by points: if/else 25 (44 pts), match/switch 5 (11 pts), boolean chains 3 (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":"src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2950e0c0f887c929f77e10acf4da25798a1a7809a30b0c747aacf9c8cfc77b"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlFlowEmitter.emitTry (cognitive 55): ControlFlowEmitter.emitTry has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (43 pts), loops 6 (11 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":"src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b7acb70394d4298b4f28430a8eacec1007fb21444e0ae961ca3afc29202996"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticErrorReporter.reportIncompatibleType (cognitive 54): SemanticErrorReporter.reportIncompatibleType has cognitive complexity 54 (threshold 15). Drivers by points: if/else 31 (33 pts), boolean chains 11, match/switch 6 (10 pts) (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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ef8ee05d7c9a8980755119c18ac00c3aa2ba16f6b6327704aebe283f35b79e"}},{"ruleId":"D2","level":"warning","message":{"text":"Cli.tryParse (cognitive 54): Cli.tryParse has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (37 pts), loops 6 (8 pts), ternaries 4 (7 pts), boolean chains 2 (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":"src/main/java/onion/Cli.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a877e8a5f8691e7e7e3d6e6d84de7667ab9386b9c9ec13e476a24e600e1f863c"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructionTyping.diamondTypeFromArguments (cognitive 53): ConstructionTyping.diamondTypeFromArguments has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (32 pts), boolean chains 9, match/switch 4 (8 pts), loops 1 (4 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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7c9ff2997638e9bf10121cc28e0c4962d76f84f59b93894e7000e6c3f226e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolCli.plan (cognitive 53): ToolCli.plan has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (46 pts), loops 2 (4 pts), boolean chains 3 (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":"src/main/java/onion/ToolCli.java"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"897862d2827a5158e5110344832284cc51653bb2343e2dd1efefbd43beb73054"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraints.withDefaults (cognitive 52): Constraints.withDefaults has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 7 (14 pts), match/switch 6 (14 pts), boolean chains 8 (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":"src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"667affdb3f0c4bee92261523469fbf2e259b9aaa8e01c7ce66a934fed1f8c8f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Cli.parse (cognitive 52): Cli.parse has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 6 (8 pts), ternaries 3 (6 pts), boolean chains 2 (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":"src/main/java/onion/Cli.java"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dd298e8e8fc98181556295bf8f11f95d4d70881dc2757deff03f1534394630"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionLexer.scanToken (cognitive 50): OnionLexer.scanToken has cognitive complexity 50 (threshold 15). Drivers by points: if/else 27 (40 pts), boolean chains 6, loops 2 (4 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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5aca09808239833c2de0aaf52bb7a402c59c3196ad3d3273d6efdf070f7c2fe"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxHintClassifier.classify (cognitive 50): SyntaxHintClassifier.classify has cognitive complexity 50 (threshold 15). Drivers by points: boolean chains 36, if/else 9 (13 pts), match/switch 1 (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":"src/main/scala/onion/compiler/parser/SyntaxHintClassifier.scala"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"af03ade2e1bbdf2da0325af07237e0698a044244f20c9286c273b5b420407f3c"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleExpressionTypingSupport.typeIdentifier (cognitive 50): SimpleExpressionTypingSupport.typeIdentifier has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 5 (18 pts), boolean chains 2 (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":"src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.scala"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9765e4aa955254b85465de1187b70f2ef4b5a74df4bb749f67f750ec89323da"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentTyping.processMemberAssign (cognitive 49): AssignmentTyping.processMemberAssign has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (36 pts), match/switch 5 (9 pts), boolean chains 4 (nesting depth added 21). 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":"src/main/scala/onion/compiler/typing/AssignmentTyping.scala"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7132b730d6579db0a986ab524f239ac2247442ef27756e00a61b592fe7ba4d"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectTable.parseLines (cognitive 48): EffectTable.parseLines has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (31 pts), match/switch 4 (14 pts), boolean chains 2, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/effects/EffectTable.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef73c780286212cd534869b25dceb61cd933d62a6e138f98c80d3c8ea4a89821"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.newBracketsAreTypeArgs (cognitive 48): OnionParser.newBracketsAreTypeArgs has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 7, loops 2 (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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2592}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1051da67ae532deda9cc198b0a39ef5135dca8f32dc996f95d6ec205f6a252"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmCodeGeneration.emitSetLocal (cognitive 47): AsmCodeGeneration.emitSetLocal has cognitive complexity 47 (threshold 15). Drivers by points: if/else 22 (44 pts), match/switch 2 (3 pts) (nesting depth added 23). 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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"105b744ec39d44e00bb7476633f4c30008c871b4e1378156b0e5dbebbb8022ab"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionLexer.decode (cognitive 47): OnionLexer.decode has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 6 (20 pts), boolean chains 3, match/switch 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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d67cbe3d6c994a2f7406cd5cea9bd94a3c37d5e252874634fe3f8a16275686b"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleExpressionTypingSupport.typeMapLiteral (cognitive 47): SimpleExpressionTypingSupport.typeMapLiteral has cognitive complexity 47 (threshold 15). Drivers by points: if/else 29 (43 pts), boolean chains 4 (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":"src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.scala"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfedb2e17c359a5211f5f7482bea6f7e7350f6e196b0d0d9f1f36642879cf1c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRules.isSuperTypeForClassUncached (cognitive 46): TypeRules.isSuperTypeForClassUncached has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 7 (27 pts), if/else 10 (13 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 24). 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":"src/main/scala/onion/compiler/TypedAST.scala"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a2a6c16a1fa4087706ead043d1aa8b8fb90c32a0bd59aa7002c1d1b5aed28a"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.classDecl (cognitive 46): OnionParser.classDecl has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (31 pts), loops 5 (11 pts), boolean chains 4 (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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a62a2ae0941fdc024de3f417e0b0a852c53d553054ab020ebb3f60bb3156f5"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentTyping.processArrayAssign (cognitive 46): AssignmentTyping.processArrayAssign has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 4 (12 pts), boolean chains 3 (nesting depth added 23). 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":"src/main/scala/onion/compiler/typing/AssignmentTyping.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f39725cd6930f8dc48a2303067b3e8acbe05db1bfc81861895adff0aa4b2064"}},{"ruleId":"D2","level":"warning","message":{"text":"DocModel.scanDocComments (cognitive 46): DocModel.scanDocComments has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 6 (12 pts), boolean chains 5 (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":"src/main/scala/onion/tools/doc/DocModel.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ef898421549a28ba593d488c261fe541f583a14556bf5012f65a01f1d75ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosureTyping.resolveClosureArgTypes (cognitive 45): ClosureTyping.resolveClosureArgTypes has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 4 (11 pts), loops 3 (8 pts), boolean chains 2 (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":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5c9f20d1d29849ac2a239d358ac28f57a26e708b4775332c1f414971a59ce1"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryWritePass.checkInherited (cognitive 45): HistoryWritePass.checkInherited has cognitive complexity 45 (threshold 15). Drivers by points: loops 9 (21 pts), if/else 5 (11 pts), match/switch 2 (9 pts), boolean chains 4 (nesting depth added 25). 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":"src/main/scala/onion/compiler/typing/HistoryWritePass.scala"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"901c79e4e4e10091ca40fb082fffc6c152fc58c35646273efb3822b7a2930594"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodCallFallbackSupport.typeCallWithBidirectionalInferenceCore (cognitive 45): MethodCallFallbackSupport.typeCallWithBidirectionalInferenceCore has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (24 pts), match/switch 9 (15 pts), loops 4 (5 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":"src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89ff7cb09426d0dc4bbfd1bc1d1593e6cfaae172942623958ba303e3d83ab7b"}},{"ruleId":"D2","level":"warning","message":{"text":"TryExpressionTyping.typeTryExpression (cognitive 45): TryExpressionTyping.typeTryExpression has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (25 pts), match/switch 6 (15 pts), loops 3, boolean chains 2 (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":"src/main/scala/onion/compiler/typing/TryExpressionTyping.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b3280beb165f17ab5e6516754ec2985deb01ecc367358c95152ab7b48622b2"}},{"ruleId":"D2","level":"warning","message":{"text":"UnqualifiedMethodCallSupport.typeUnqualifiedMethodCall (cognitive 45): UnqualifiedMethodCallSupport.typeUnqualifiedMethodCall has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (26 pts), match/switch 6 (15 pts), boolean chains 4 (nesting depth added 14). 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":"src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6e0f838816da38ccf7fdaf731921b6afa9cb5537db64b4025a2876788f6549"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionFormTyping.typeElvis (cognitive 44): ExpressionFormTyping.typeElvis has cognitive complexity 44 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 11 (15 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":"src/main/scala/onion/compiler/typing/ExpressionFormTyping.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"772c0f2133f6aec0580a62ac9a62e6ba65fe7b7dd51e12b66791f49f9763fa25"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodBodySupport.processConstructorDeclaration (cognitive 44): MethodBodySupport.processConstructorDeclaration has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 7, match/switch 4 (6 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":"src/main/scala/onion/compiler/typing/MethodBodySupport.scala"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35670ae6291c3e7fe9fa8156a3dcaddafd33df3882baf19175f3b1dd41b858b"}},{"ruleId":"D2","level":"warning","message":{"text":"StringInterpolationTyping.typeStringInterpolation (cognitive 44): StringInterpolationTyping.typeStringInterpolation has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (38 pts), match/switch 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 24). 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":"src/main/scala/onion/compiler/typing/StringInterpolationTyping.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96fca75e28b3aaf7f33243890021afe60c7fbbb51a4ce0107bdca64d5eaa965"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionFormTyping.isValidCast (cognitive 43): ExpressionFormTyping.isValidCast has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 18, match/switch 3 (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":"src/main/scala/onion/compiler/typing/ExpressionFormTyping.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"649a0a49e3fcc63e5198663f5eb9ddb724d256288bd176c7d2f5a58ce8842a16"}},{"ruleId":"D2","level":"warning","message":{"text":"Migrator.interpolationBodies (cognitive 43): Migrator.interpolationBodies has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 5 (15 pts), boolean chains 5, match/switch 1 (4 pts) (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":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"632336444b296f9f820703ffbc4246fe1fc09783f365f983ad597e63101ef0b9"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmCodeGeneration.codeConstructor (cognitive 42): AsmCodeGeneration.codeConstructor has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 5 (16 pts), match/switch 1 (4 pts), boolean chains 2 (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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fed7cd6787a6573d5e3e6274b263ff5d04e67e7b086406d1244e1909c27608e"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.integerLiteral (cognitive 41): OnionParser.integerLiteral has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 11, 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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2868}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23edb213dbdf002130a2312f30349e3e08ae60de530690dd5b2c11d556930ef"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructionTyping.resolveConstructorForClosures (cognitive 40): ConstructionTyping.resolveConstructorForClosures has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (21 pts), match/switch 7 (14 pts), boolean chains 3, loops 2 (nesting depth added 10). 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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"360fc1d744c5d3db5118bd5e1f53cb0428ccd9c896cef369ef7004aebecc41bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraints.collect (cognitive 40): Constraints.collect has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 3 (7 pts), boolean chains 5, loops 1 (2 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":"src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"96198f356bbcc4823df716a5bf62ce04c48f954b4fb38329d05d0686accf1f28"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigShape.printLossless (cognitive 40): ConfigShape.printLossless has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 4, loops 4 (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":"src/main/java/onion/ConfigShape.java"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd512457d27ad8bf0a7a0414b8b25ed0ea2eb4678dc299ecadf9a113d6b14817"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticMethodCallSupport.typeStaticCallWithBidirectionalInferenceCore (cognitive 39): StaticMethodCallSupport.typeStaticCallWithBidirectionalInferenceCore has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (22 pts), match/switch 8 (15 pts), loops 2 (nesting depth added 10). 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":"src/main/scala/onion/compiler/typing/StaticMethodCallSupport.scala"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4840d0766c5a81a1368fd263946604f1be1eef413bbf709146eaad261a4d71e"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmCodeGeneration.codeMethod (cognitive 38): AsmCodeGeneration.codeMethod has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (22 pts), match/switch 5 (9 pts), boolean chains 6, 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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4627a1237a442d6e96dd45437b4dc0d9418670ce8a93da137c78553fb70a7d3"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockElementLowering.translateDestructuring (cognitive 38): BlockElementLowering.translateDestructuring has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (11 pts), match/switch 7 (11 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/BlockElementLowering.scala"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b82b302251478c9ee262aa5d89a258f08791d1ee0b406f66abfa563c1919c56"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticOperands.forTool (cognitive 37): StaticOperands.forTool has cognitive complexity 37 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 5 (12 pts), match/switch 2 (8 pts) (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":"src/main/scala/onion/compiler/effects/StaticOperands.scala"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ff862449559fc74cb88a268c59d7b3fc94d4789dbde699863bda923863541f"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignabilitySupport.structurallyAssignable (cognitive 37): AssignabilitySupport.structurallyAssignable has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 8 (9 pts), boolean chains 8 (nesting depth added 13). 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":"src/main/scala/onion/compiler/typing/AssignabilitySupport.scala"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8649a642682957c26be4275adcd161141edaf194aec52405c3df309ef4eacf4"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleExpressionTypingSupport.typeListLiteral (cognitive 37): SimpleExpressionTypingSupport.typeListLiteral has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (33 pts), boolean chains 2, match/switch 1 (2 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":"src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.scala"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da24394f544ffaaa06e407b6a895434b1259d440dff774b85057c9c1fa80f31"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticMethodCallSupport.typeStaticMethodCall (cognitive 37): StaticMethodCallSupport.typeStaticMethodCall has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 5 (11 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":"src/main/scala/onion/compiler/typing/StaticMethodCallSupport.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaf54965b7fa92a5a1ed68f688e8f29bbc17fceed81712105fb631feab67e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver.propagate (cognitive 36): Solver.propagate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 23). 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":"src/main/scala/onion/compiler/contracts/smt/Sat.scala"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec35216dff8bb0688f91762424efe2c10e99942cd33318866a7c22ee4d5d90f"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver.run (cognitive 36): Solver.run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (7 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":"src/main/scala/onion/compiler/contracts/smt/Sat.scala"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84fcb41dde63e62b5983018c8969dd6f7ad6559a6fd29442af566cfbab6ccaa"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionLexer.integerEnd (cognitive 36): OnionLexer.integerEnd has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 16, loops 4 (11 pts), if/else 8 (9 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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"5039f650ad31df1c6ade678e040d2f683386c624e2309e947c2667a9bbb1eef3"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewriting.appendAutoCliCall (cognitive 35): Rewriting.appendAutoCliCall has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 7 (9 pts), boolean chains 8 (nesting depth added 10). 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":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"3452fc3b8aa51ed0d99ca8a701262035496fad2424a3a0ad1f725b8f9dfec278"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector.recordObjectMethod (cognitive 35): Collector.recordObjectMethod has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (11 pts), match/switch 3 (8 pts), boolean chains 4 (nesting depth added 19). 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":"src/main/scala/onion/compiler/effects/EffectInference.scala"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a67445b438d31357154afa11a8a1723d1bbfe13f08a4a638f5f46c3bb16be0d"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionLexer.characterEnd (cognitive 35): OnionLexer.characterEnd has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 6, loops 2 (6 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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aec4f325fe5a63993fc248dd47319430abe009a18d067d568b88307a180325"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingBodyPass.processEnumDeclaration (cognitive 35): TypingBodyPass.processEnumDeclaration has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (24 pts), match/switch 3 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/TypingBodyPass.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6c56393ea11914e401bacf36d40c0e0ad5ec2b7bc4f9f2862cee110c521d16"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution_lib.classify (cognitive 35): evolution_lib.classify has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/evolution_lib.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62d8ae4919a3b6b9cbb2b252f44eec42fe31a2747751e35fc396ee9dc1d5f45"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmCodeGeneration.emitRefLocal (cognitive 34): AsmCodeGeneration.emitRefLocal has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 16). 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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab30564585e626f754780f30c7c19f4012e2af75249ee5436f458e46c1a78c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationChecks.checkOverrideContracts (cognitive 34): DuplicationChecks.checkOverrideContracts has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 7, match/switch 1 (4 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":"src/main/scala/onion/compiler/typing/DuplicationChecks.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a072700db7130338bf6adb65b557606c4128be8aee62e1eb5278ff621a6634d9"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCheckingHelpers.leastUpperBound (cognitive 34): TypeCheckingHelpers.leastUpperBound has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 10, match/switch 2 (3 pts) (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":"src/main/scala/onion/compiler/typing/TypeCheckingHelpers.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cee5e9e40c7d754ccc9c6de6866882cac5fda67d52b30dde86e7a084a1841f0"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryWritePass.check (cognitive 33): HistoryWritePass.check has cognitive complexity 33 (threshold 15). Drivers by points: loops 8 (22 pts), if/else 4 (10 pts), boolean chains 1 (nesting depth added 20). 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":"src/main/scala/onion/compiler/typing/HistoryWritePass.scala"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3693ddfc17af1be053bc7a1ea98f22afb396839f3152d83dbf35308f97b94dc3"}},{"ruleId":"D2","level":"warning","message":{"text":"Csv.parse (cognitive 33): Csv.parse has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Csv.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2def10a2a4bf67e51065faf7f95e752623de6244924dc2eaca6ecf14324de78c"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonParser.parseNumber (cognitive 33): JsonParser.parseNumber has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 11, loops 3 (6 pts), error handling 1 (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":"src/main/java/onion/Json.java"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c049aa4c13b4e5b1b385c046a3f5c8a15e117ca4d0e793e2d48b6e5d9e5155b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Yaml.findKeySeparator (cognitive 33): Yaml.findKeySeparator has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 3, loops 1 (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":"src/main/java/onion/Yaml.java"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"6072afb94477945e9ab54b791048614751b85e2471001c8e3bb51e627876fe31"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewriting.formatSegments (cognitive 32): Rewriting.formatSegments has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 3 (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":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"557007fa728d45244958a7e45e3f34a544760645be425c36b370e68958ef9af6"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructionTyping.typeSafeIndexing (cognitive 32): ConstructionTyping.typeSafeIndexing has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (12 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"207659dc24b864f0d9d81d1e043a0d351254b23a0f01940782a8a1fa1ba7c808"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRules.isSuperType (cognitive 31): TypeRules.isSuperType has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (23 pts), match/switch 5, 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":"src/main/scala/onion/compiler/TypedAST.scala"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31acd3bfe3c24b676efe25757c4d3dcebc441937ea9cbc10c0cbca4868a5f46"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmCodeGenerationVisitor.emitArgumentsWithDefaults (cognitive 31): AsmCodeGenerationVisitor.emitArgumentsWithDefaults has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 5 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"728bfb0b58fd38096bd7751f84dd4c26e1bdeb5f6f064e2fce798e0ed6708ce1"}},{"ruleId":"D2","level":"warning","message":{"text":"TailCallOptimization.isSelfCall (cognitive 31): TailCallOptimization.isSelfCall has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/optimization/TailCallOptimization.scala"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41b8db18be74ffda885dd5c6d2848906fde7b3a0d0349c9a35800087feaeae9"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationChecks.checkAbstractMethodImplementation (cognitive 31): DuplicationChecks.checkAbstractMethodImplementation has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 5 (7 pts), boolean chains 5 (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":"src/main/scala/onion/compiler/typing/DuplicationChecks.scala"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c874d64d4e09d7ea346aa0649c5e78d44540a5cf14989dd0b0eaed1e16ea9f3"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver.map (cognitive 31): NameResolver.map has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 5 (10 pts), boolean chains 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":"src/main/scala/onion/compiler/typing/NameResolution.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"917097276c75b26fabd333191f872ef5b7dacb2d97e0301d7dc1b18aadd8e447"}},{"ruleId":"D2","level":"warning","message":{"text":"OperatorTyping.typePostUpdate (cognitive 31): OperatorTyping.typePostUpdate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 7 (11 pts), boolean chains 4 (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":"src/main/scala/onion/compiler/typing/OperatorTyping.scala"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"2463dc488a2182bec92e674810e5f44a72cedc0c28ac74246b287651b061652f"}},{"ruleId":"D2","level":"warning","message":{"text":"Repl.processCommand (cognitive 31): Repl.processCommand has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 7 (13 pts), loops 1 (2 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":"src/main/scala/onion/tools/Repl.scala"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2013a2433985b26c01e17f642757c68c097ec56979bb1d17c62d32c8b45ccfb"}},{"ruleId":"D2","level":"warning","message":{"text":"Repl.requiresContinuation (cognitive 31): Repl.requiresContinuation has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 6, match/switch 1 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/Repl.scala"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cf155d1e42fa2d553bfc317d4dca51ff9fda5886ce1e6ac1cb4d8dd509c49f"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceRegions.codeMask (cognitive 31): SourceRegions.codeMask has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3 (5 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/lsp/SourceRegions.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08fa2fe73b9e20a65952f28924ce582ff2743468807ef1eb8ebf036ad75ea02"}},{"ruleId":"D2","level":"warning","message":{"text":"Files.expandBraces (cognitive 31): Files.expandBraces has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (10 pts), boolean chains 2 (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":"src/main/java/onion/Files.java"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"74187ef883e689ce74f020f908412a0f39d094316e74ed22f23c5ab58909a9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"CapturedVariableCollector.collectUncached (cognitive 30): CapturedVariableCollector.collectUncached has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 5 (8 pts), loops 1 (2 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":"src/main/scala/onion/compiler/backend/asm/CapturedVariableCollector.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"708c5f61247356ae1e421715ef5f288e34d1161ab967f94c09e5025b2e512fa1"}},{"ruleId":"D2","level":"warning","message":{"text":"OperatorTyping.processEquals (cognitive 30): OperatorTyping.processEquals has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 9 (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":"src/main/scala/onion/compiler/typing/OperatorTyping.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47ab644fdfdd05f6d6b89be6113d6c858b290f70033684f459d085dbbb20496"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeNarrowingAnalysis.extractNullCheckNarrowing (cognitive 30): TypeNarrowingAnalysis.extractNullCheckNarrowing has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/TypeNarrowingAnalysis.scala"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2de1700dfe8076918d0e9392c9c32e7b5d4c1326571e65b8c8f56e54ce217e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingTypeSupport.checkTypeArgumentBounds (cognitive 30): TypingTypeSupport.checkTypeArgumentBounds has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 5 (10 pts), boolean chains 3 (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":"src/main/scala/onion/compiler/typing/TypingTypeSupport.scala"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e157fe2d1a6fa84c604c8c71d801dcce2a682739abb31b16a3d86ede805f263"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptDirectives.scan (cognitive 30): ScriptDirectives.scan has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (9 pts), match/switch 2 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/ScriptDirectives.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9c008f812b8c0409fe25916832876c451372cf122ff6553ce701e7e5a01f86"}},{"ruleId":"D2","level":"warning","message":{"text":"Rup.refutes (cognitive 29): Rup.refutes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (7 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":"src/main/scala/onion/compiler/contracts/smt/Sat.scala"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b7de71d41cc99f0393baf178406a67e835c9ea6c908fe65a91dc878a77be63"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructionTyping.resolveConstructorWithNamedArgs (cognitive 29): ConstructionTyping.resolveConstructorWithNamedArgs has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 8 (11 pts), boolean chains 1 (nesting depth added 13). 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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b385f33a69aae5c8fe57a00164ebac122cac1492105fa4b9f206d8af9362d3c"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptDirectives.leadingBlock (cognitive 29): ScriptDirectives.leadingBlock has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (4 pts), boolean chains 2 (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":"src/main/scala/onion/tools/ScriptDirectives.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8857d28a3b056096c8e6355a556493947782197c804a4b338e978c58e9661a0f"}},{"ruleId":"D2","level":"warning","message":{"text":"Text.table (cognitive 29): Text.table has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 5 (10 pts), ternaries 2 (6 pts), boolean chains 2 (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":"src/main/java/onion/Text.java"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8089e4a1d91cd11c6f9e4475c348391ba29ec4c1a90b7656c2b57ccf87389974"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmCodeGeneration.generateClass (cognitive 28): AsmCodeGeneration.generateClass has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (20 pts), loops 4 (5 pts), boolean chains 3 (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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9acfefd703060a8afc11b4226b1d52c21e01377ce5ffeaaae00213ea84e117"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectInference.inferUnits (cognitive 28): EffectInference.inferUnits has cognitive complexity 28 (threshold 15). Drivers by points: loops 9 (13 pts), match/switch 3 (9 pts), if/else 4 (6 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":"src/main/scala/onion/compiler/effects/EffectInference.scala"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"60985eba2d65208550374dcd883905c2769a4eee4d3efc2e1d4d1140f9448827"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericTypeMapper.toOnionType (cognitive 28): GenericTypeMapper.toOnionType has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 3, 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":"src/main/scala/onion/compiler/environment/ReflectionRefs.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0ddb00f7a6f0f146bdd729871df00a0266ce9789b2a8c23f21742d3fa5e987"}},{"ruleId":"D2","level":"warning","message":{"text":"CallArgumentTypingSupport.processNamedArguments (cognitive 28): CallArgumentTypingSupport.processNamedArguments has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 3 (7 pts), boolean chains 3 (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":"src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d12c234fedb4113e2043568f0f7f806d493c3071c7eb73f37d9c94dcfb0a42"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructionTyping.typeIndexing (cognitive 28): ConstructionTyping.typeIndexing has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (9 pts), loops 3 (6 pts), boolean chains 2 (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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"65521da3b0498061d119d012c6a254572131df19488eff0a4e38314f4ba5589b"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractPurityPass.run (cognitive 28): ContractPurityPass.run has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (16 pts), match/switch 2 (7 pts), boolean chains 3, if/else 2 (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":"src/main/scala/onion/compiler/typing/ContractPurityPass.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d97ff43b2393b1e63f368549831d43ced7f9a845e735a779e8d518bb7b0c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryWritePass.builtCallees (cognitive 28): HistoryWritePass.builtCallees has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (21 pts), match/switch 2 (7 pts) (nesting depth added 20). 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":"src/main/scala/onion/compiler/typing/HistoryWritePass.scala"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6db1f04a9f5b253bca1f21cbb0fc54dce0202a0f8a9b92c03685f6f1a3b3702"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberSelectionResolutionSupport.resolveMemberSelection (cognitive 28): MemberSelectionResolutionSupport.resolveMemberSelection has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 1 (4 pts), loops 1 (3 pts), boolean chains 2 (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":"src/main/scala/onion/compiler/typing/MemberSelectionResolutionSupport.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e17a04c343772ecae00358ff332553cdafb578f4e9e0c37e2065ea00522567"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerFrontend.run (cognitive 28): CompilerFrontend.run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/CompilerFrontend.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d853d2e321a102e51284915c200b4f5a43372a2cd44abab5f9e1730cd24cdec"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptRunner.prepare (cognitive 28): ScriptRunner.prepare has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/ScriptRunner.scala"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"107e599c9b505df51794dc74029756878b4d3c6b636e79da1df874ad6b49680e"}},{"ruleId":"D2","level":"warning","message":{"text":"RetToYield.endsDoBlock (cognitive 28): RetToYield.endsDoBlock has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"c527c443a3d59f79f19eab2f58e156a42733a2c5ed5f96ebb1f6e505d9c79233"}},{"ruleId":"D2","level":"warning","message":{"text":"Csv.parseWithHeader (cognitive 28): Csv.parseWithHeader has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 3 (7 pts), loops 5 (7 pts), boolean chains 2 (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":"src/main/java/onion/Csv.java"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d2ed4946bf78870510a48ca53761a4aa5aad386aa83dbf7a26e22276dd68cf"}},{"ruleId":"D2","level":"warning","message":{"text":"MutualRecursionOptimization.transformMethodBodyForStateMachine (cognitive 27): MutualRecursionOptimization.transformMethodBodyForStateMachine has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 5 (10 pts), boolean chains 2 (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":"src/main/scala/onion/compiler/optimization/MutualRecursionOptimization.scala"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"275bb4d7c808ff656a0d4090e7ada014cc3cf73a2645eb21663910e294d0df7a"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionLexer.getNextToken (cognitive 27): OnionLexer.getNextToken has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, loops 2 (4 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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1f21c70353a3821ce68b22ed12ac0e55e46ad52be5232c6990cef393672013"}},{"ruleId":"D2","level":"warning","message":{"text":"LawExampleToPredicate.bodyText (cognitive 27): LawExampleToPredicate.bodyText has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (9 pts), boolean chains 2 (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":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc28f1178d9abb48e70ce3afd37bbee11f65b2c2f293147e07d4c1c3303c07f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Yaml.stripComment (cognitive 27): Yaml.stripComment has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 3, loops 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":"src/main/java/onion/Yaml.java"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"274295b9812c236857977a2867ee5e0f292d5f05e0b982d685e35f4db8f393c4"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticErrorReporter.reportNullableMemberAccess (cognitive 26): SemanticErrorReporter.reportNullableMemberAccess has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14, boolean chains 12. 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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f823de8e2e83360fe2f64a8c41aeb72245cc152c38ba03e28f8798954132e71"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.typeImpl (cognitive 26): OnionParser.typeImpl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3 (7 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6408ae1934472146392a66a41efac31feead06f5d193c482c3365b9f00290ca"}},{"ruleId":"D2","level":"warning","message":{"text":"CallableValueCallSupport.resolveCallableValue (cognitive 26): CallableValueCallSupport.resolveCallableValue has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/CallableValueCallSupport.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5d35896e225b235dc8abeb82742558f3bba853e9ad64622ccda792988ef995"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryWritePass.proveRest (cognitive 26): HistoryWritePass.proveRest has cognitive complexity 26 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 3 (8 pts), boolean chains 4, loops 2 (3 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":"src/main/scala/onion/compiler/typing/HistoryWritePass.scala"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1eaf5864d609ed3f8b18642050a873412a7cb7ee8793d951594a9c1be014fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Repl.executeCode (cognitive 26): Repl.executeCode has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 8 (22 pts), if/else 2 (4 pts) (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/Repl.scala"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d97d18d3ae27eb4f26511d9e3e91da4345d9fc3be2134fc7b2728f8b309f455"}},{"ruleId":"D2","level":"warning","message":{"text":"Text.wrap (cognitive 26): Text.wrap has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 pts), ternaries 1 (4 pts), 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":"src/main/java/onion/Text.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"897a9ac4bcc9c9b6139b5d82c949e4c5dbee9ccffa20ba507c51e2543c42c101"}},{"ruleId":"D2","level":"warning","message":{"text":"Yaml.parseSequence (cognitive 26): Yaml.parseSequence has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 2 (6 pts), loops 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":"src/main/java/onion/Yaml.java"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1beb4c1028a6510e0f00a989b6e89e142e65b17a536c6c055d885b0bb21b08"}},{"ruleId":"D2","level":"warning","message":{"text":"ASTWalk.visitChildren (cognitive 25): ASTWalk.visitChildren has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (3 pts) (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":"src/main/scala/onion/compiler/ASTWalk.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3531e8834d3beed47088f81e133eba50f9cc106b49cb592e659de4da7a232e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosureCodegen.generateBridgeMethod (cognitive 25): ClosureCodegen.generateBridgeMethod has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 1 (3 pts), 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":"src/main/scala/onion/compiler/backend/asm/ClosureCodegen.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b49711569b0e15e95bcc340bbe1988c8336b46d28bb2bc674eed0406a24280"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.staticAccessAhead (cognitive 25): OnionParser.staticAccessAhead has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (4 pts), boolean chains 3 (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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2376}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfcfa27445820ddddd27fd12e2a75dbc112237e0a0c2d20ddcc1b0aa22c6f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentTyping.processStaticFieldAssign (cognitive 25): AssignmentTyping.processStaticFieldAssign has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 2 (3 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":"src/main/scala/onion/compiler/typing/AssignmentTyping.scala"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae159a5662b96a664df69be6387aa4e733b12ad99028ee902f168331aad0f36"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionFormTyping.typeCast (cognitive 25): ExpressionFormTyping.typeCast has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 4 (10 pts), boolean chains 1 (nesting depth added 10). 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":"src/main/scala/onion/compiler/typing/ExpressionFormTyping.scala"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa50b63ce4f79dd8df05ed71f7696b63d599bbf1215c456556d818e04e62c51"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodResolutionSupport.primitiveExactTiebreak (cognitive 25): MethodResolutionSupport.primitiveExactTiebreak has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 9, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"907126d6e8b52b6ee7937260208b4075976f084c235aaaa4a3838b110aa524ce"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignedVariableScanner.scan (cognitive 24): AssignedVariableScanner.scan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 6, loops 2 (4 pts), boolean chains 2 (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":"src/main/scala/onion/compiler/AssignedVariableScanner.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea11443eab578ebcc7d6490f769a80b77c3e9e9df25e82737cad84184e6dbb7"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewriting.appendToolCliMain (cognitive 24): Rewriting.appendToolCliMain has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 3 (4 pts), match/switch 3 (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":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dd0ed26eaf128bbed917521fe2ac07d2eb6c92b68cda206fa082505a72f12f"}},{"ruleId":"D2","level":"warning","message":{"text":"OperandStackTracker.popsDownTo (cognitive 24): OperandStackTracker.popsDownTo has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 1 (2 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":"src/main/scala/onion/compiler/backend/asm/OperandStackTracker.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44d1579cd7dcf7edf376f5a9be38925aaa5a125668c490104c3532e909a102c"}},{"ruleId":"D2","level":"warning","message":{"text":"Run.step (cognitive 24): Run.step has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (9 pts), boolean chains 2, match/switch 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":"src/main/scala/onion/compiler/contracts/HistoryProver.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a52b318d1c8bf6eafcfb9bbd1ea507e04354225af1cdac1ecd8cf183f861dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"MutualRecursionOptimization.argumentStores (cognitive 24): MutualRecursionOptimization.argumentStores has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 4, match/switch 3 (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":"src/main/scala/onion/compiler/optimization/MutualRecursionOptimization.scala"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b766b8905ea84a393e2594816ba518b3e00bb89854a0447bc57227c84a603da"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentExpectedTypeRetyping.retypeTargetTypedClosures (cognitive 24): ArgumentExpectedTypeRetyping.retypeTargetTypedClosures has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, match/switch 2 (4 pts), 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":"src/main/scala/onion/compiler/typing/ArgumentExpectedTypeRetyping.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abd28ce8c7909c7f177509adf4843fc2fae19d5924a10ed13394ae6e548bbdd"}},{"ruleId":"D2","level":"warning","message":{"text":"DestructuringPatternProcessor.process (cognitive 24): DestructuringPatternProcessor.process has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (6 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/DestructuringPatternProcessor.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a746c625e5beaae992ddf40324e0b1eeae115102fd7eeab264115f940802e67"}},{"ruleId":"D2","level":"warning","message":{"text":"Markdown.renderInline (cognitive 24): Markdown.renderInline has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/doc/Markdown.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68a84bb99573c57a96ffde92dcdc06b784db41e1e77aa37bbc42de5924ddc9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver.analyze (cognitive 23): Solver.analyze has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/contracts/smt/Sat.scala"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"678352706c067336e115eaaf789bb9c3d8f931f1a4065f4ec85fd30b0d8ac56e"}},{"ruleId":"D2","level":"warning","message":{"text":"TailCallOptimization.findMaxLocalIndexInBody (cognitive 23): TailCallOptimization.findMaxLocalIndexInBody has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 2 (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":"src/main/scala/onion/compiler/optimization/TailCallOptimization.scala"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"147210a01622d07fd433c6a5932dada8d97c6a5e29de2c3475d6d1a70b2608de"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.recordDecl (cognitive 23): OnionParser.recordDecl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (4 pts), boolean chains 3 (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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12b0a5a36f86d0c582dd010ab65cb5b06096380adcff380e2490c7faf45f9ff"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.staticAccessPrimary (cognitive 23): OnionParser.staticAccessPrimary has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f152101a35dc838b474e23f53d14482b3db4e171142abff9110d92ec800af87"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodBodySupport.fitSuperTypeVariableSlots (cognitive 23): MethodBodySupport.fitSuperTypeVariableSlots has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 10). 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":"src/main/scala/onion/compiler/typing/MethodBodySupport.scala"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7a4f01e838d1c2d28fc44786d486e08363980c9afce02076f88f4c072b11a9"}},{"ruleId":"D2","level":"warning","message":{"text":"OperatorTyping.processRefEquals (cognitive 23): OperatorTyping.processRefEquals has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 7 (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":"src/main/scala/onion/compiler/typing/OperatorTyping.scala"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d45d4e2835a4bbd49f9e6ed52ba6b6481175a211fcffdb88c7f8f5b121f53b"}},{"ruleId":"D2","level":"warning","message":{"text":"SuperMethodCallSupport.typeSuperMethodCall (cognitive 23): SuperMethodCallSupport.typeSuperMethodCall has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/SuperMethodCallSupport.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0886e75a5fcf75e5f516f6209831f4684101f2fa0d8a5f0e4783f6a9764e5c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingOutlinePass.constructTypeHierarchy (cognitive 23): TypingOutlinePass.constructTypeHierarchy has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (6 pts), match/switch 2 (3 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":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cd9ccbc7042d3bf1ed73503e39f52a5492bc3a6c04a85ce8d55bc57db5f449"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryReproPhase.run (cognitive 23): HistoryReproPhase.run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/verification/HistoryReproPhase.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a9a0ac11f03fc8cd1280709ce36b07010382e415a032b6395f99634ba9b029"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigShape.parseLossless (cognitive 23): ConfigShape.parseLossless has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2, ternaries 2, 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":"src/main/java/onion/ConfigShape.java"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fb8df17eebf443680fc2bd732a4b962aed70d876b9bab07e3b681dcf82bc9f"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmCodeGenerationVisitor.visitMapLiteral (cognitive 22): AsmCodeGenerationVisitor.visitMapLiteral has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 6, loops 2 (4 pts) (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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"c410f1c04d7efb1b265d2a755002e40ee4da3f0e5a72255695fb22fd102c8662"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlFlowSyntaxHints.classify (cognitive 22): ControlFlowSyntaxHints.classify has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, boolean chains 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":"src/main/scala/onion/compiler/parser/ControlFlowSyntaxHints.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"162384c55cd88cdc97de80eab520d6ac25597946c19b6347a38ff66bb487deac"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionLexer.withExponentAndSuffix (cognitive 22): OnionLexer.withExponentAndSuffix has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (9 pts), loops 1 (3 pts) (nesting depth added 4). 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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"25843b45bdd1b1ce96b7ec08ac6309ad72f44139e9be488f270d091b9121cd1a"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.unescape (cognitive 22): OnionParser.unescape has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (5 pts), boolean chains 2 (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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b3fe12156c39784d4d786780ef5130241ae7a4aeb4b1c5cfcfca05a4858009"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxHintClassifier.stripComments (cognitive 22): SyntaxHintClassifier.stripComments has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, 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":"src/main/scala/onion/compiler/parser/SyntaxHintClassifier.scala"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4eec8c858adfd4a946e42e09ea2cf5c520e2e218fb1e56c6208b657f65587be"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxHintClassifier.enclosingEnum (cognitive 22): SyntaxHintClassifier.enclosingEnum has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (3 pts), boolean chains 2, loops 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":"src/main/scala/onion/compiler/parser/SyntaxHintClassifier.scala"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d41f27c2f7eb821eeef56612615fa10ebfb68a57c6b836c1a99dc125c73e0b"}},{"ruleId":"D2","level":"warning","message":{"text":"CapabilityCheckPass.recordStaticOperands (cognitive 22): CapabilityCheckPass.recordStaticOperands has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 2 (8 pts), boolean chains 2, 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":"src/main/scala/onion/compiler/typing/CapabilityCheckPass.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fddd0d36d75c056ed90eaee572d935b7ccef80416313729234faa662352997"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructionTyping.processNamedArgsForConstructor (cognitive 22): ConstructionTyping.processNamedArgsForConstructor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3 (7 pts), boolean chains 2 (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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a17fc2d5f2c99d6812e7fd27b80aee9f48323d113965263f1a60369ea2e965"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodBodySupport.splitIntoBodyAndGuard (cognitive 22): MethodBodySupport.splitIntoBodyAndGuard has cognitive complexity 22 (threshold 15). Drivers by points: if/else 21, boolean chains 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":"src/main/scala/onion/compiler/typing/MethodBodySupport.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"268f820bf02c501634413a8e7126aae0db92c0dfa82d0a6c2e0428c698370008"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodResolution.findMethodsWithViews (cognitive 22): MethodResolution.findMethodsWithViews has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 4 (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":"src/main/scala/onion/compiler/typing/MethodResolution.scala"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8d82cead5fc2fde4c6c44f903742f418394ca15cda765f06d5317d4529ea3c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRelations.isAssignableWithBoxing (cognitive 22): TypeRelations.isAssignableWithBoxing has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8, boolean chains 7, match/switch 3 (7 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":"src/main/scala/onion/compiler/typing/TypeRelations.scala"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"957c4a2f24ef3950708ae4d30ac7bd9e7e2a2e18d073973cccc8d8cf7d03a552"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionDaemon.serve (cognitive 22): OnionDaemon.serve has cognitive complexity 22 (threshold 15). Drivers by points: error handling 6 (11 pts), if/else 4 (8 pts), loops 2, 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":"src/main/scala/onion/tools/daemon/OnionDaemon.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49e1a7d7c65a5eacd018011bcab8a7d337ad74ba2256345211ad4948865b99b"}},{"ruleId":"D2","level":"warning","message":{"text":"Files.glob (cognitive 22): Files.glob has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Files.java"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6178e9fd56eac131e2c5364772420c8e824a5397c8f566d1504de2e0d5e9bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonParser.parseString (cognitive 22): JsonParser.parseString has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 1 (4 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Json.java"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c4b6f23e8cedcdc5f99787ab139a839571f7b93c3498540300cd7c2dc8ce85"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexShape.parse (cognitive 22): RegexShape.parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Shapes.java"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"72978faf9e452fb1b9f125e51b33e04c27a0170ebf3be9ab256b14d3b699794f"}},{"ruleId":"D2","level":"warning","message":{"text":"TailCallOptimization.transformStatement (cognitive 21): TailCallOptimization.transformStatement has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (8 pts), boolean chains 1 (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":"src/main/scala/onion/compiler/optimization/TailCallOptimization.scala"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"758f30f33b08bf3d16eb2626a0cbb615ca0e85bd8756f249be92f6e6f4e9dd31"}},{"ruleId":"D2","level":"warning","message":{"text":"CallOverloadSupport.boxingTiebreak (cognitive 21): CallOverloadSupport.boxingTiebreak has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 9 (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":"src/main/scala/onion/compiler/typing/CallOverloadSupport.scala"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"14970da59d500ae66874f60dbbe09c87f4d177d7916b90d4bdac8521a4752204"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodBodySupport.processMethodLikeBody (cognitive 21): MethodBodySupport.processMethodLikeBody has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, boolean chains 8, match/switch 2 (3 pts) (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":"src/main/scala/onion/compiler/typing/MethodBodySupport.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d0086d38c30d297f982b37a8863a7ea840de48efa414611690706a8047a20c"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver.forName (cognitive 21): NameResolver.forName has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (3 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":"src/main/scala/onion/compiler/typing/NameResolution.scala"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dd9c134517766d4d0d5e07ccdd6e8d433002923787779aa383d278c226d69c"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerOptions.configFrom (cognitive 21): CompilerOptions.configFrom has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 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":"src/main/scala/onion/tools/CompilerOptions.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f98eb0c7ce6399ecd0860bda44c07ef8741c0f7683d9db375dd0ea42ff55d96"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptDirectives.tokenize (cognitive 21): ScriptDirectives.tokenize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 3 (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":"src/main/scala/onion/tools/ScriptDirectives.scala"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f23bb59009629a177bc752cc5f370d4f63c17f1f4f344dcaa799aff394f048"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandLineParser.parse (cognitive 21): CommandLineParser.parse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/option/CommandLineParser.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf75916ac54eb3c2ceec2832ce40fdedf78ec9e0a33df8f4e952438a4b9115bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Csv.stringifyWithHeader (cognitive 21): Csv.stringifyWithHeader has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Csv.java"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef316aad9ea9fc2b71c4f357157b3763f59e9e838f7ff92d1254fef5783cabc2"}},{"ruleId":"D2","level":"warning","message":{"text":"check_docs.check (cognitive 21): check_docs.check has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (7 pts), ternaries 1 (2 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":"tools/pygments-onion/check_docs.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a356e37821bf12f0c6bc9b52fd972ff2023778615bc71b307613073ead1303b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassTable.loadOrNull (cognitive 20): ClassTable.loadOrNull has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), error handling 1 (3 pts), boolean chains 2 (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":"src/main/scala/onion/compiler/ClassTable.scala"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"911721a99ac9f835916841dfa22d3b682e9ae4a6a9156cb8297783fd6687ead1"}},{"ruleId":"D2","level":"warning","message":{"text":"TermWalk.reflectiveChildren (cognitive 20): TermWalk.reflectiveChildren has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (10 pts), loops 3 (7 pts), error handling 1 (2 pts), if/else 1 (nesting depth added 12). 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":"src/main/scala/onion/compiler/TermWalk.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"515cbab8a92ff0243836eebf2a2ce00f046bd26dbad6c8d86f7574b2e70a8d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"AppliedClassType.apply (cognitive 20): AppliedClassType.apply has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 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":"src/main/scala/onion/compiler/TypedAST.scala"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd1a447d62e7fbf4ccef6d42b76185ada6bcc3c29664c73187963e515e01589"}},{"ruleId":"D2","level":"warning","message":{"text":"StandardParameterMatcher.matchesVararg (cognitive 20): StandardParameterMatcher.matchesVararg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/TypedAST.scala"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2a817e2ec1d7f7b55d255dabab1c17c0aa713cdde096fd21f9a457c48462ba"}},{"ruleId":"D2","level":"warning","message":{"text":"CapturedVariableCollector.findOuterThis (cognitive 20): CapturedVariableCollector.findOuterThis has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 7 (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":"src/main/scala/onion/compiler/backend/asm/CapturedVariableCollector.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa70c18e99a5dffca384f5f43b656da3b61849bcb029408481c2200f5911a5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Run.run (cognitive 20): Run.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (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":"src/main/scala/onion/compiler/contracts/HistoryProver.scala"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce890b68fa5875091823e83a168537157c9b6435077715c0fc592d3745b90a06"}},{"ruleId":"D2","level":"warning","message":{"text":"TailCallOptimization.checkStatementForTailCall (cognitive 20): TailCallOptimization.checkStatementForTailCall has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, 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":"src/main/scala/onion/compiler/optimization/TailCallOptimization.scala"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e586c18f6b5cf121db573c2aa975119b039da6eeb13f46140bc951146c9f3cc8"}},{"ruleId":"D2","level":"warning","message":{"text":"TailCallOptimization.transformTailCall (cognitive 20): TailCallOptimization.transformTailCall has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 4 (5 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":"src/main/scala/onion/compiler/optimization/TailCallOptimization.scala"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c570ce3b411adfd8903e83635deabfa45567de34de9741e0d9069f489e9993d8"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionLexer.fqcnEnd (cognitive 20): OnionLexer.fqcnEnd has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 2 (5 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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d621c8a36e12c297fbf3987e6da1885d9a3327b7603797dbf4c4192a5605a6"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.importDecl (cognitive 20): OnionParser.importDecl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03a82d6f28d8b3992c5e1f50139400a9ac7eba425230f87a7aecdb07beeda49"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosureTyping.buildReturnBlock (cognitive 20): ClosureTyping.buildReturnBlock has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"849525bd5a0eb07cb335afda0d27f97457659a8762bc245a46187c2ddb861027"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlExpressionTyping.typeBlockExpression (cognitive 20): ControlExpressionTyping.typeBlockExpression has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (9 pts), loops 1 (2 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":"src/main/scala/onion/compiler/typing/ControlExpressionTyping.scala"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"42759cdadf9c0a5a0fd274582e8a715d58532bc79c518b3f87866a1844fb8f44"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclarationBodySupport.processClassDeclaration (cognitive 20): DeclarationBodySupport.processClassDeclaration has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 4 (6 pts), match/switch 2 (6 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":"src/main/scala/onion/compiler/typing/DeclarationBodySupport.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eac1db34a9726e5fe85ed4bff9e33994cae136c3f870f572bae05c794c16924"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationChecks.checkOverrideTargets (cognitive 20): DuplicationChecks.checkOverrideTargets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/DuplicationChecks.scala"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9995f33ca078ac31398559476d3564b566eab730a6deb2a6fbfedd3f6b82015b"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberSelectionResolutionSupport.normalizeTarget (cognitive 20): MemberSelectionResolutionSupport.normalizeTarget has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (3 pts), boolean chains 1 (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":"src/main/scala/onion/compiler/typing/MemberSelectionResolutionSupport.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b199f1b8c3ad1ebef01132bd17f09d7f7423dfd206b5d80e5f501f5560379ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeSubst.specializeFromScrutinee (cognitive 20): TypeSubst.specializeFromScrutinee has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (8 pts), boolean chains 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":"src/main/scala/onion/compiler/typing/TypeSubstHelpers.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"035f76a48976c44c23313efe0ac72ff8bf68b184b26ee9fffe2a547be658b399"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingOutlinePass.processMethodDeclaration (cognitive 20): TypingOutlinePass.processMethodDeclaration has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2adb6e614ed0b7f279edaa5e3447a8f201aea55aa701e326c5a9ad864c4c0b"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingOutlinePass.validateSuperType (cognitive 20): TypingOutlinePass.validateSuperType has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, match/switch 2 (3 pts) (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":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5819021548a8a69f04b4cd80ec01d3bf05d7c73d2ed69e2d8ef78e9a918d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"UnqualifiedMethodCallSupport.typeUnqualifiedCallWithClosures (cognitive 20): UnqualifiedMethodCallSupport.typeUnqualifiedCallWithClosures has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (8 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":"src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28a421c76f5f9c45685d9705c9330f055284e60d5860d049917d0033c56ec84"}},{"ruleId":"D2","level":"warning","message":{"text":"RetToYield.inThisCode (cognitive 20): RetToYield.inThisCode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 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":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e60471dd5d9afb45d7c32e3b49414854a5e68de7c1c3a17c91eff95bcc159a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewriting.processBody (cognitive 19): Rewriting.processBody has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (4 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9618cebe0ed7f5735a33e3ef1600806fafbd3aa2b8f1ee52292fd353cad9a08a"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewriting.dealiasDeep (cognitive 19): Rewriting.dealiasDeep has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3afff1230b4a4fa39a327fb4d4f86766e0600506cc7552a8bcc4c7f3bdca081"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionLexer.identifierOrScheme (cognitive 19): OnionLexer.identifierOrScheme has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6112400826366fe96dbc08ef4a50d58b3d473d9959bb337b920449069f44127a"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionLexer.invalidStringEscapeAt (cognitive 19): OnionLexer.invalidStringEscapeAt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82f6dade305e777a4b699693858079eedc16c5e3363584e15ff95ec946f366e"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.skipToToplevelSyncPoint (cognitive 19): OnionParser.skipToToplevelSyncPoint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8617fb1a879a370c08137bc99e118b31e363a7edc0d0e0c0d380acb073216082"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.peekUncached (cognitive 19): OnionParser.peekUncached has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"959d824bacd6956b10c6da2758437895a25679533b649afe2eff6066fb47bec2"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.primaryRest (cognitive 19): OnionParser.primaryRest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, match/switch 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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bd6d0ac4d5a15af1c1f82428f5d94178bf722e07d75e4cdb15dec3f438d33c"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentTyping.iterableWideningOf (cognitive 19): AssignmentTyping.iterableWideningOf has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 2 (6 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":"src/main/scala/onion/compiler/typing/AssignmentTyping.scala"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa11000ed1a31144c936f1030e6293d3c33d99dfab723700462573cedf6082b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructionTyping.varargConstruction (cognitive 19): ConstructionTyping.varargConstruction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"8217b69265c8337a7f5cce7230432aeeed05319b66c2da965e8749b055b34445"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructionTyping.closureCanTarget (cognitive 19): ConstructionTyping.closureCanTarget has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 6 (7 pts), boolean chains 4 (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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a255d6c231e303e7eade942c8a2a71c8ecb8864945a0bf249951499660a1c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractFramingPass.checkWrites (cognitive 19): ContractFramingPass.checkWrites has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 5 (6 pts), boolean chains 2, loops 1 (2 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":"src/main/scala/onion/compiler/typing/ContractFramingPass.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00f7c4fb076bc1e1283b7e955e457f72df9e46270273912670590f1b7419e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionMethodFallbackSupport.selectApplicableExtensionMethod (cognitive 19): ExtensionMethodFallbackSupport.selectApplicableExtensionMethod has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (8 pts), boolean chains 3 (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":"src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"802e66134f34012fc03f1ed92e28ec41eca89cc54353431c9b342c096ff984e1"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericMethodTypeArguments.explicitFromMappedArgs (cognitive 19): GenericMethodTypeArguments.explicitFromMappedArgs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 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":"src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3258bb80e17feb40f9cf6da54c9e68de470f83e75051546693c22a1807ccc6d"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodResolutionSupport.structuralMatch (cognitive 19): MethodResolutionSupport.structuralMatch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (8 pts), boolean chains 3 (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":"src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5988802163f2616280fdd3e4cab81143ec0566849a0b5e5bd3b4040f22378e"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleExpressionTypingSupport.mergeListElementType (cognitive 19): SimpleExpressionTypingSupport.mergeListElementType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 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":"src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.scala"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"971adbf38b4fb6edbc4308bd2d25934e914ff8e7f9fae60d5a65550b1b196f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingTypeSupport.validateTypeApplication (cognitive 19): TypingTypeSupport.validateTypeApplication has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (5 pts) (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":"src/main/scala/onion/compiler/typing/TypingTypeSupport.scala"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad524a913e4e52909c51750c4a5aae63b92b971b9e2d3fec2b179408f49a8829"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatCommand.format (cognitive 19): FormatCommand.format has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, error handling 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":"src/main/scala/onion/tools/format/FormatCommand.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d371f57788c1c93c2b232bb2c3cc87c0320b4b5b069b5484050285dddfe97e4"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionTextDocumentService.findMethodNameBeforePosition (cognitive 19): OnionTextDocumentService.findMethodNameBeforePosition has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 4 (7 pts), boolean chains 3 (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":"src/main/scala/onion/tools/lsp/OnionTextDocumentService.scala"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1091b616dbe2322dd7646e6b78c23c342db5843f84b0dd86239bdcc8fab5841"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessReplClient.close (cognitive 19): ProcessReplClient.close has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 5 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/readiness/benchmark/ReplProcess.scala"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"93144277c7601fc4ffd1ee0e01aff0f676ed91add45b83d7aa994dadcd922bde"}},{"ruleId":"D2","level":"warning","message":{"text":"Json.stringifyInternal (cognitive 19): Json.stringifyInternal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, loops 1 (2 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":"src/main/java/onion/Json.java"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf98cc7b73cd929a39eb60a2f9705cc06a010eeffbd0ae9dd3125f33de995be"}},{"ruleId":"D2","level":"warning","message":{"text":"Yaml.parseScalar (cognitive 19): Yaml.parseScalar has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 4, error handling 2 (4 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":"src/main/java/onion/Yaml.java"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"1229644179af294925d878de7b577779d989dc5f4d2a059724f6eea8c4d0aed4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parsing.parseFile (cognitive 18): Parsing.parseFile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 4 (5 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":"src/main/scala/onion/compiler/Parsing.scala"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dd7ffbf900938aa7be2cfb466f22525bfc3b65e48a8dc1536d557e46962171"}},{"ruleId":"D2","level":"warning","message":{"text":"Parsing.syntaxErrorMessage (cognitive 18): Parsing.syntaxErrorMessage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, boolean chains 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":"src/main/scala/onion/compiler/Parsing.scala"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1baf64cfd8dddffc5b07cd66fad084dfde01a1f4ba486d19bf051820277e16"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticErrorReporter.javaParamAccepts (cognitive 18): SemanticErrorReporter.javaParamAccepts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (5 pts), boolean chains 2, error handling 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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8cbd5b0d6ea290947222ecc1f3d723186b427ebf791b1c8a2cd4841f317b71"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmCodeGenerationVisitor.emitArgumentsWithAdaptation (cognitive 18): AsmCodeGenerationVisitor.emitArgumentsWithAdaptation has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 6 (8 pts), boolean chains 1 (nesting depth added 7). 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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66e93b6fea8cb0556dbb72926a1081ec08aed4f3419489e7cf6c1c2723eb8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosureCodegen.emitNewClosure (cognitive 18): ClosureCodegen.emitNewClosure has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 5 (6 pts), loops 2 (nesting depth added 7). 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":"src/main/scala/onion/compiler/backend/asm/ClosureCodegen.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b36ffb46965bf555d8aaec2c939311b9e6194102bfbcc7c6997108abb17552"}},{"ruleId":"D2","level":"warning","message":{"text":"TailCallOptimization.unboxedJoin (cognitive 18): TailCallOptimization.unboxedJoin has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (9 pts) (nesting depth added 7). 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":"src/main/scala/onion/compiler/optimization/TailCallOptimization.scala"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1ac6b766a64f663b9f4cfb7e733b52abb351cff2a1f9b54d7b6f57670d1750"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.unitWithRecovery (cognitive 18): OnionParser.unitWithRecovery has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e4ed2d957a966512fb7c9f9f7332d461c805ba9de62dd5f9e5b7338c479418"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionParser.enumDecl (cognitive 18): OnionParser.enumDecl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7407bcd7883dc1c25de97fead266d8233e1d7db3fd002cac9dcbebbc313f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentExpectedTypeRetyping.retypeArguments (cognitive 18): ArgumentExpectedTypeRetyping.retypeArguments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (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":"src/main/scala/onion/compiler/typing/ArgumentExpectedTypeRetyping.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e248dfd6e89f02980cde6e964e701fedcacb50ebb640da66e7efeb3b95f138d"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignabilitySupport.retypeEmptyCollectionLiteral (cognitive 18): AssignabilitySupport.retypeEmptyCollectionLiteral has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (5 pts), boolean chains 2 (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":"src/main/scala/onion/compiler/typing/AssignabilitySupport.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47acaeeff9ec3d929b2316228eeafe091878aa4b0ad33f8afa3c497815ad248"}},{"ruleId":"D2","level":"warning","message":{"text":"CallOverloadSupport.narrowNamedByArgumentTypes (cognitive 18): CallOverloadSupport.narrowNamedByArgumentTypes has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 6, 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":"src/main/scala/onion/compiler/typing/CallOverloadSupport.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"07aa7a997ecdcce033aacf083b844c99cd97a91f90a712bd339aa5a846c83c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"CallOverloadSupport.isStaticApplicable (cognitive 18): CallOverloadSupport.isStaticApplicable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6 (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":"src/main/scala/onion/compiler/typing/CallOverloadSupport.scala"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed649ec1d66f5cf4ecbb034b5b27b61d35899a9c4a8598be92a6de7c8b78876"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclarationBodySupport.unitDefaultJobs (cognitive 18): DeclarationBodySupport.unitDefaultJobs has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8 (14 pts), if/else 4 (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":"src/main/scala/onion/compiler/typing/DeclarationBodySupport.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ea4b1a1e1878999b36ba0daf2349a0145d045f22f4cf0a48ac8beadb8ca454"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationChecks.checkRecordFinalObjectOverrides (cognitive 18): DuplicationChecks.checkRecordFinalObjectOverrides has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (5 pts), loops 3 (5 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/DuplicationChecks.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fabb586ad21a8b54d7dbb9bcc9444449e8b8653a020e1cf9fb1634dbdaa0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleExpressionTypingSupport.warnSuspiciousInterpolation (cognitive 18): SimpleExpressionTypingSupport.warnSuspiciousInterpolation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 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":"src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.scala"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92b62dc45cb7db4df6403013d749f12f6633bfb18ec5c3e23be8c92291929b9"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeSubstitution.substituteType (cognitive 18): TypeSubstitution.substituteType 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":"src/main/scala/onion/compiler/typing/TypeSubstitution.scala"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd283989b1f3a5f120118946e772f1594928d7e513d324d05c2965aec2e10403"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingBodyPass.processTopLevelVarDeclaration (cognitive 18): TypingBodyPass.processTopLevelVarDeclaration has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (2 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":"src/main/scala/onion/compiler/typing/TypingBodyPass.scala"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1dfcae62e9703e089fa5c46a5c668219fae4792572a869188eb3485d06f1d4a"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingTypeSupport.mapFromExtensionReceiver (cognitive 18): TypingTypeSupport.mapFromExtensionReceiver has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 4 (8 pts), boolean chains 1 (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":"src/main/scala/onion/compiler/typing/TypingTypeSupport.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccebe4e692199786c42ff0a4011497d8004b236f578b9a3853a81f01de48b1ea"}},{"ruleId":"D2","level":"warning","message":{"text":"CompiledClassWriter.writeAll (cognitive 18): CompiledClassWriter.writeAll has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 2 (5 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/CompiledClassWriter.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fade149bf9894be6aa6d14af7b1e6a63149d7f0aa57bf99603d09debabf56748"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsolutePerformancePolicy.evaluate (cognitive 18): AbsolutePerformancePolicy.evaluate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/readiness/policy/PerformancePolicy.scala"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c8c43a3f2dc326ece02196dd9a0db73fe8b955509834e3ed4591a805beca09"}},{"ruleId":"D2","level":"warning","message":{"text":"Args.parse (cognitive 18): Args.parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (4 pts), boolean chains 3 (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":"src/main/java/onion/Args.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1ae91692dee5d95c278e106102b81de54e0323df3d92656c188970076446ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.get (cognitive 18): Config.get has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Config.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"574fe735678cbbd9eeb60a06de7b768a51d7b09e92864e1c8d66042e8be6eb29"}},{"ruleId":"D2","level":"warning","message":{"text":"Scalars.integral (cognitive 18): Scalars.integral has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Scalars.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb2eeb7138b2d49d449e18a49d0bbc456c0710027a61f51def4b09d319bf3dd"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticErrorReporter.report (cognitive 17): SemanticErrorReporter.report has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (6 pts), match/switch 2 (3 pts) (nesting depth added 2). 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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d5efed7bf817c4a75bed5d3e1b1065805c42950e44bdcc5b3b398dbe49b963"}},{"ruleId":"D2","level":"warning","message":{"text":"TermWalk.children (cognitive 17): TermWalk.children has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (3 pts) (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":"src/main/scala/onion/compiler/TermWalk.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f765b64d4f348b419e25c86f675fe553d0519b11d8fc77ed94003119a9f04d2e"}},{"ruleId":"D2","level":"warning","message":{"text":"Run.condPost (cognitive 17): Run.condPost has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 1, 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":"src/main/scala/onion/compiler/contracts/HistoryProver.scala"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1700d79f7d4bf528adf85fe1cc7e30b550c82a06e237aa972dff37a24c52bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"Run.exprPost (cognitive 17): Run.exprPost has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 1, 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":"src/main/scala/onion/compiler/contracts/HistoryProver.scala"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74fe0f7c700249f6256db74bbd2bb071d20ed6c476f23991ce76a1b5dc13af9"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectInference.libraryCallbacks (cognitive 17): EffectInference.libraryCallbacks has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (5 pts), match/switch 1 (2 pts) (nesting depth added 2). 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":"src/main/scala/onion/compiler/effects/EffectInference.scala"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d9f8f0d77be5fa878c63bf89b03c7850b0d8e22b04042372b8f7c15b6e85b4"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosureTyping.matchesSam (cognitive 17): ClosureTyping.matchesSam has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 3, boolean chains 2 (nesting depth added 7). 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":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4f46ba446ba087fa93a3c6538684be126877db8cdb54f499ad8f04e78a6800"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractFramingPass.checkFields (cognitive 17): ContractFramingPass.checkFields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ContractFramingPass.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74a68fe60a9a535aa954307dbea486b8a24606bded9c9303a62ebe72b80f35d"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosedPredicatePhase.run (cognitive 17): ClosedPredicatePhase.run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 2 (7 pts), boolean chains 1, loops 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":"src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23bab7ac96599b026ffade62fdeb343de123490edb243760925860a6b3fddd2"}},{"ruleId":"D2","level":"warning","message":{"text":"LspProjectClasspath.lookup (cognitive 17): LspProjectClasspath.lookup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 10). 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":"src/main/scala/onion/tools/lsp/LspProjectClasspath.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d337115482523ec3061f8261404d74bebd9692a4ec090116f7cbb12a12f143e9"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownExampleExtractor.scanFences (cognitive 17): MarkdownExampleExtractor.scanFences has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/readiness/docs/MarkdownExampleExtractor.scala"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca9a639c6d594ba9750693b1168b1283176b6a1758f79809e8d80040b9bf7ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Yaml.needsQuoting (cognitive 17): Yaml.needsQuoting has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Yaml.java"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7235efcc1b5367c005dd7e85212d1d09eee77529876eb01cae5b7508912eb3ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewriting.rewriteRecordDeclaration (cognitive 16): Rewriting.rewriteRecordDeclaration has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 4, 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":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb943d18b6f6db365dbdab77f9bdcf40e68e2c5870aa4c125f4947e087e2acd6"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector.term (cognitive 16): Collector.term has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, match/switch 2 (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":"src/main/scala/onion/compiler/effects/EffectInference.scala"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"507f112623e6c55af63b2ebf6068f15adfd860c2410b0734bf088dc0366242b9"}},{"ruleId":"D2","level":"warning","message":{"text":"TailCallGraphAnalysis.findTailCalls (cognitive 16): TailCallGraphAnalysis.findTailCalls has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6 (7 pts) (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":"src/main/scala/onion/compiler/optimization/TailCallGraphAnalysis.scala"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e9c186459bd9712d0faaa3712df46c8c8c779b6fda4ab6017018b9f91de06e"}},{"ruleId":"D2","level":"warning","message":{"text":"OnionLexer.stringEnd (cognitive 16): OnionLexer.stringEnd has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7c085b814ff16fff0ebf40d8a0f49ac758e12dbdad51e2daaea354a2d8e7d4"}},{"ruleId":"D2","level":"warning","message":{"text":"CallOverloadSupport.isApplicableAtIndex (cognitive 16): CallOverloadSupport.isApplicableAtIndex has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/CallOverloadSupport.scala"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8a9b8da07bf52454db9485d407d072ecb57b71ea9bf3eb8991f465f2bd819f"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructionTyping.resolveConstructorForMalleableArgs (cognitive 16): ConstructionTyping.resolveConstructorForMalleableArgs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), match/switch 3 (6 pts), boolean chains 2, loops 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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e2fd2bca4d02dc19ebcff52c8ef554f749498fa6a7eb36bd6ebfdcd21c9d8f"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicationChecks.checkConflictingInterfaceDefaults (cognitive 16): DuplicationChecks.checkConflictingInterfaceDefaults has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (8 pts), if/else 4 (5 pts), boolean chains 3 (nesting depth added 3). 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":"src/main/scala/onion/compiler/typing/DuplicationChecks.scala"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddef558efc70a9325e949820d49bff47df369c49661e6499ed54cebebc6e854"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionFormTyping.isUncheckedCast (cognitive 16): ExpressionFormTyping.isUncheckedCast has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, match/switch 4 (5 pts), boolean chains 2 (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":"src/main/scala/onion/compiler/typing/ExpressionFormTyping.scala"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"af78a3016ceeeeeef38c4790740f17a5ad0d6c0fea92d25c97938b86364c538d"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryWritePass.uncheckedForms (cognitive 16): HistoryWritePass.uncheckedForms has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (5 pts), boolean chains 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":"src/main/scala/onion/compiler/typing/HistoryWritePass.scala"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfdb85f21a1984aaa32a93a9a2b8a534ccd17d837850461cc214a7b8fa90fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodCallReportingSupport.reportMethodNotFound (cognitive 16): MethodCallReportingSupport.reportMethodNotFound has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (7 pts), if/else 6, boolean chains 3 (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":"src/main/scala/onion/compiler/typing/MethodCallReportingSupport.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca2684957ea908ea991eb1088f1f190dfbca09f889e393e0cd0bc59dfd7c379"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticImportMethodCallSupport.resolveStaticImportMethodCall (cognitive 16): StaticImportMethodCallSupport.resolveStaticImportMethodCall has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (5 pts), boolean chains 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":"src/main/scala/onion/compiler/typing/StaticImportMethodCallSupport.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cf3777e67c44b5dfe1848f7a933e86977b72d5d53e6ee4562bbe7adef1e2d4"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingOutlinePass.processFunctionDeclaration (cognitive 16): TypingOutlinePass.processFunctionDeclaration has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 5 (6 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"063d8303bd6d198e1b4736c1cc8536b6df2836fe525238e47e008f1a877f7eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"UnqualifiedMethodCallSupport.typeUnqualifiedMethodCallWithNamedArgs (cognitive 16): UnqualifiedMethodCallSupport.typeUnqualifiedMethodCallWithNamedArgs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (6 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":"src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c96002f12149fdfa7d072ac9394d971d368bb0c9c739b655f68a3992d3338b"}},{"ruleId":"D2","level":"warning","message":{"text":"DaemonClient.absolutizeRunnerOptions (cognitive 16): DaemonClient.absolutizeRunnerOptions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/daemon/DaemonClient.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"04642fc75cc8585d197cdc80aadd34a28aefe34c4712285715abb7b9dca5875a"}},{"ruleId":"D2","level":"warning","message":{"text":"Codec.base64Decode (cognitive 16): Codec.base64Decode has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Codec.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a45e3f59d00ec4003c72e334b425b6e37902fbe513a322d021cc0e300a4a71"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OnionParser: TooManyMethods \u2014 208 methods. The bar is 30 methods; this is 178 over it, 6.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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a45ddc961f6c5fca0eccb2cfa3b1d3e1ca0792b28e08e39e3c3524652f407ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/OnionParser.scala: FileTooLong \u2014 2230 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: OnionParser (245-3040). The bar is 500 significant lines; this is 1730 over it, 4.46\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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbd82f459c4cb8f8585179aad826bba0c8cad1418abe124a388085199f3d710"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Colls: TooManyMethods \u2014 104 methods. The bar is 30 methods; this is 74 over it, 3.47\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":"src/main/java/onion/Colls.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54046bac95d669f0427614a417d3a7aa88798e414780119ed8ccc3cac6c4e33"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Rewriting: TooManyMethods \u2014 90 methods. The bar is 30 methods; this is 60 over it, 3.00\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":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6051d475eb3975bec29a521a31ffe42ed766f77b21241e543262b3ce7ae76bce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Typing: TooManyMethods \u2014 77 methods. The bar is 30 methods; this is 47 over it, 2.57\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":"src/main/scala/onion/compiler/Typing.scala"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbdffc3743210a4e573c6fc2c3397f306212eddc024158c3a8fdbacf43cf917"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/Rewriting.scala: FileTooLong \u2014 1246 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 746 over it, 2.49\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":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"036f942c08fbbf478a5e1a116c7a6fe9549d2fa184e581a6bb09c3ebfa3fe09d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypingBodyPass: TooManyMethods \u2014 74 methods. The bar is 30 methods; this is 44 over it, 2.47\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":"src/main/scala/onion/compiler/typing/TypingBodyPass.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d05ff9d3ef1d0d1322de8cb66140c54f7c54a4f59dd4206600d3b2ffccb77e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LocalContext: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\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":"src/main/scala/onion/compiler/LocalContext.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce90f5dcb9cce8fdc762f180327d102ba2a1690b30295c6e167bdebbef665c1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/TypedAST.scala: FileTooLong \u2014 1142 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 642 over it, 2.28\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":"src/main/scala/onion/compiler/TypedAST.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a969282896e864d54d1768c6318a971620395ab1a82202a0108a81a516dca574"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/SemanticErrorReporter.scala: FileTooLong \u2014 1117 significant lines (blank, comment-only and punctuation-only lines excluded), about 67% of them inside a single declaration: SemanticErrorReporter (88-1319). The bar is 500 significant lines; this is 617 over it, 2.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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af2dd764693297788f1627839978105b019e351e105fb7ffaa0a0f9c032e7e7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SemanticErrorReporter: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0a66e7aeaa787221a6358dcb613efcca7694e11247f2e92680904429f5e673"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MethodCallTyping: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\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":"src/main/scala/onion/compiler/typing/MethodCallTyping.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"23631a2074407d4f402b3dd4a54cac07bf98da7952b68575495de6675cc07f7c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypingOutlinePass: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\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":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6859a46c45dbc958422cd2cdf4c03f652d4032e1396229b761d40f0fb8b0b78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/Repl.scala: FileTooLong \u2014 809 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: Repl (74-1104). The bar is 500 significant lines; this is 309 over it, 1.62\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":"src/main/scala/onion/tools/Repl.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e5039ace6ab3866d5b35fe5040cac50541770d7c23081427dfc2a469debe1a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ASTBuilderAdapter: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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":"src/main/java/onion/compiler/parser/ASTBuilderAdapter.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85fa0edc316a045b25ded7d2b25e2495749d8f56c5b282c2addae342eee2d07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typing/ConstructionTyping.scala: FileTooLong \u2014 800 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 300 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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02959771496c28631cd56ece7ed6619c9b508c1cdf8d5134b747b961968fad68"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypingOutlinePass: ClassTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded), 57 methods. The bar is 400 significant lines; this is 234 over it, 1.59\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":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2429d9749f46d038255f6d91ff73d01a24722af182c0b15c4c2726c667c8c30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: asm/AsmCodeGeneration.scala: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 284 over it, 1.57\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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"140c96e7ef56b4c3bbf4f939661dcf6b33b50f4d76f7257d62dc33e742af7584"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Files: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\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":"src/main/java/onion/Files.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1d2709e4151b9fa16107f6964b646fb3e15976cbf00080dd04eab65dbf2bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MethodBodySupport: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\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":"src/main/scala/onion/compiler/typing/MethodBodySupport.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"076cc204b729c41170bcae9cc74a323ab9182669e010896eff6879495035c945"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypingOutlinePass.processRecordDeclaration: MethodTooLong \u2014 processRecordDeclaration runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41519b77997ae88b1b199edcae2aed7d49a584bccf00d204965d26d6479af10"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BlockElementLowering: ClassTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 191 over it, 1.48\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":"src/main/scala/onion/compiler/typing/BlockElementLowering.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49a2e538ade0d2121acf2e5959382047678f472c52829eb5754bddd8aaf3853"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Strings: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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":"src/main/java/onion/Strings.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ae2902f107b353605b5ff1edb5c01b2ed9f44f009375eb5d23f0f3443cc1af"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HistoryWritePass: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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":"src/main/scala/onion/compiler/typing/HistoryWritePass.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"48df8e0e2579f6b854888bf15460ff7fb589cedae399fa946082058fe678cc06"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Repl: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\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":"src/main/scala/onion/tools/Repl.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea29b4d2508c8cc19699408325005aec925ed8e46f872e356f478ac39984bfcf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DateTime: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 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":"src/main/java/onion/DateTime.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90a9dc7d774cd849d3787e667e584fa88ecb83f159d439fa40e68c43f1363da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Sat.solve: MethodTooLong \u2014 solve runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"src/main/scala/onion/compiler/contracts/smt/Sat.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dcf3a481f2ea7d3f0640e17e604f097ad9a2cadd8ca012e7a0eb3dde051db0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Sat.satisfies: MethodTooLong \u2014 satisfies runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\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":"src/main/scala/onion/compiler/contracts/smt/Sat.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"60065c27ed8d7179d40c37dc017624a826c23220a98ebe375290b77cba3ca114"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/OnionTextDocumentService.scala: FileTooLong \u2014 682 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: OnionTextDocumentService (115-1100). The bar is 500 significant lines; this is 182 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":"src/main/scala/onion/tools/lsp/OnionTextDocumentService.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"014526cb47fa58bc523e94e0a16361335f82d64f4bfc06d8f832ca2a121fb424"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OnionMath: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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":"src/main/java/onion/OnionMath.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c8db56404e661948c82a7fee026303ec498b368a069d639351964439771482"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typing/TypingOutlinePass.scala: FileTooLong \u2014 641 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: TypingOutlinePass (11-1073). The bar is 500 significant lines; this is 141 over it, 1.28\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":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20d573a55ba6952052cb8145ba343cc7bf648db7b0779bc53029b3facf2641f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typing/MethodBodySupport.scala: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 133 over it, 1.27\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":"src/main/scala/onion/compiler/typing/MethodBodySupport.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c22ef729335e2aacc7aa3c5e4ba41f0572ef125c710279dd63e7bb51f1d8052"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MutualRecursionOptimization: ClassTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 102 over it, 1.26\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":"src/main/scala/onion/compiler/optimization/MutualRecursionOptimization.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f995825d6b369bb39ccb470065b44970d1c512691c8232eb320a106b0f1b8e93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: asm/AsmCodeGenerationVisitor.scala: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 122 over it, 1.24\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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c07484b4052190bfde8c10755aa9b9d5f7c9e4e9133fdd3e3f634741c080fe"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SelectExpressionTyping: ClassTooLong \u2014 494 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 94 over it, 1.24\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":"src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ddabd91e7c36990ce8bb3081279ca77652ddcb6ac56bf1865fa799a2f93e0d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AsmCodeGeneration: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4301dcecb69b153b7fea76243c1d97873fa996d21973c525a1af700af6b9f455"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OnionTextDocumentService: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\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":"src/main/scala/onion/tools/lsp/OnionTextDocumentService.scala"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c77c5cd9fbb13f0a9a8cbe666e5881b8cea7346c06b99900d371f4c2a50920d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MethodCallFallbackSupport.typeMethodCallWithBidirectionalInference: MethodTooLong \u2014 typeMethodCallWithBidirectionalInference runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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":"src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea688c5d97da978a5ef8e9c226811cce14f796857be5491c1ae1458d61c7f76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolCli.dispatch: MethodTooLong \u2014 dispatch runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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":"src/main/java/onion/ToolCli.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6792dfeb20aee77e8e7374b4f49b3a33cc6910f5b60b8e170df32e76658f5941"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typing/BlockElementLowering.scala: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: BlockElementLowering (11-979). The bar is 500 significant lines; this is 98 over it, 1.20\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":"src/main/scala/onion/compiler/typing/BlockElementLowering.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1c619eb52321dbf9a53c3bf704a3f65fc0febe51959695dcd9f87a4565e4ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MutualRecursionOptimization: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\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":"src/main/scala/onion/compiler/optimization/MutualRecursionOptimization.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"465f09d0a79513529be324be5e2dfd801fa41e0507d836f3dfd523448561888a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typing/ExtensionMethodFallbackSupport.scala: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 78 over it, 1.16\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":"src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9c3a7449563cf2049488d12ae4d271e68f6f505b0e4a56dc52b8784bf4ac7a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TailCallOptimization: ClassTooLong \u2014 458 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 58 over it, 1.15\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":"src/main/scala/onion/compiler/optimization/TailCallOptimization.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d561f4b801da41aa6606734ca27109baec0209dc3c9f63a9c04398ecfc10a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/OnionLexer.scala: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 67 over it, 1.13\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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2d152dfb07e08a401c4463f08fab2687c549cfcf5a6530c8f9556b89631fb3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Future: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\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":"src/main/java/onion/Future.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"71930c4bc724129fd778aa4b3ae7077a0cd537930090363cd9a3203cbcfa9a82"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExtensionMethodFallbackSupport: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\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":"src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8349a38bd44a1fc9746d03343d9b6c750058368c4d7bbe65cd47706cd540b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MethodCallFallbackSupport.typeCallWithBidirectionalInferenceCore: MethodTooLong \u2014 typeCallWithBidirectionalInferenceCore runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"def72b104e2aee484fd355ea81f35674f16a097e0624c242df050a76a34c7b59"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ControlFlowEmitter: ClassTooLong \u2014 441 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 41 over it, 1.10\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":"src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"488e1c7bb19e3c7a126a2b4bbb45190212804fc2cdcff9e340f716c82c34844f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ASTWalk.visitChildren: MethodTooLong \u2014 visitChildren runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"src/main/scala/onion/compiler/ASTWalk.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c46fd0efc9b964f52631049d3974b9a8fd504cf181c7c7a4a378f0c405ba6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/SyntaxHintClassifier.scala: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 39 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":"src/main/scala/onion/compiler/parser/SyntaxHintClassifier.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da7d1430e8dce810c9233cd52602e4b97e8ab96b1b291529f38dec05251fa8a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Json: ClassTooLong \u2014 430 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 30 over it, 1.08\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":"src/main/java/onion/Json.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"244de44df187c311f33eb4ca8654cee6892eb6b23b3d293206e66474b1e6ae4d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IO: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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":"src/main/java/onion/IO.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94d52e2893f8ff6ae154fe06961df901ff455e777cbecde0783f22ef5de0b05"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Json: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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":"src/main/java/onion/Json.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4722060fd0b77ac213e6b9dade483b3a0fd9a806fcf68ee040cc2ed4f13f5d1c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OnionLexer: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab78a8a6759756360f68f57b3e38fd317ffea6e91a65977001277099a51f1662"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClosureTyping: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cf4aff4432c3b65cd99c123458ffe41510244c75346fb358693b07c1536fd5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OperatorTyping: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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":"src/main/scala/onion/compiler/typing/OperatorTyping.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9711e4e9609b053e59833b62b778175ff57d3bda96a4da23fb8a4fe6c91d3c69"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Colls: ClassTooLong \u2014 425 significant lines (blank, comment-only and punctuation-only lines excluded), 104 methods. The bar is 400 significant lines; this is 25 over it, 1.06\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":"src/main/java/onion/Colls.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"286865143845c236c503e1f4cd78d527780ff458fe78a1cf3eeef5939fca9896"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConstructionTyping: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"031717a4ff7657cf2f6f0ddea9677405db5c5edbda54398fe039f9c1bee11d36"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypingDuplicationPass: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\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":"src/main/scala/onion/compiler/typing/TypingDuplicationPass.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cc99a4c7cdd67f38f348fbab72b4ee844024776493ba3e43cb668b1347a7ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimization/MutualRecursionOptimization.scala: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: MutualRecursionOptimization (62-951). The bar is 500 significant lines; this is 8 over it, 1.02\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":"src/main/scala/onion/compiler/optimization/MutualRecursionOptimization.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"215a2727c09c3a40cdd9ec75a4c726c5ee12ff4d3ae0a05f2c007f236e270195"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typing/SelectExpressionTyping.scala: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: SelectExpressionTyping (17-845). The bar is 500 significant lines; this is 3 over it, 1.01\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":"src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"227ce889e84aa869ac5f6ae129693fb5e351c688ca5ec2cce38bd8e1207e177e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): src/main/scala/onion/compiler/typing/ConstructionTyping.scala:837-888 | src/main/scala/onion/compiler/typing/ConstructionTyping.scala:926-1043 \u2014 These two members are variants of one another: 36 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9bc83e346d474c5341f9284c0abc438208584e310303702335635b25fdefc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): src/main/java/onion/Cli.java:92-159 | src/main/java/onion/Cli.java:161-242 \u2014 These two members are variants of one another: 35 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Cli.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f8e9e3f30095278c12d438600d4b7d777863fa35df4248ad6d573818b3c7b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/main/java/onion/Regex.java:27-37 | src/main/java/onion/Regex.java:111-123 | src/main/java/onion/Regex.java:129-142 | src/main/java/onion/Regex.java:247-259 | src/main/java/onion/Regex.java:261-274 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Regex.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31f96c5c45a588adfcde3d4db4306473b496557cb633bfad4a1d0234ca92ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala:211-257 | src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala:115-160 | src/main/scala/onion/compiler/typing/SuperMethodCallSupport.scala:177-214 | src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala:389-440 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81ebf50f91a91b0431b25b06ba40b698c6d33283ded68f8d7f10a598a5cae51"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:156-166 | src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:168-180 | src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:182-194 | src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:196-216 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/TypingHeaderPass.scala"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3775ea3fc91d5c077a7e530455db431efa5a57b49882820ca1bcce4a22dc7b6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/main/scala/onion/compiler/parser/OnionParser.scala:857-888 | src/main/scala/onion/compiler/parser/OnionParser.scala:1319-1344 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"907ed0b15eaeb8b8624778eb07798b94e62f95a293c371bd7ff3e2e7a5d8e916"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/main/scala/onion/compiler/typing/ConstructionTyping.scala:21-70 | src/main/scala/onion/compiler/typing/ConstructionTyping.scala:78-115 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a39d21d046ca78c937a2c912b95738d4bc9ab64835001a4ab5e2f1b73e775b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:808-855 | src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:857-896 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99e917562873a233db89d81817d31051fd8a72810d3e1cbaf5d1c5c8c0d2c3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/main/scala/onion/compiler/parser/OnionParser.scala:2318-2345 | src/main/scala/onion/compiler/parser/OnionParser.scala:2347-2374 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f53c8eecf04c7c012c07e121168fdf0885293280d4ef82216c4f552df8ec7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/main/java/onion/Yaml.java:476-500 | src/main/java/onion/Yaml.java:509-535 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Yaml.java"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bad4d6d6521aa3be439079b134617fd7c7029d6ee52c90d7c0b8ccabf28323"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:367-396 | src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:461-485 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"03743594449205660beb634dd0ba64b8bcba473406d0adccf59e400d4e81918d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:295-324 | src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:405-431 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3765f1e9790af1a02c04e9688b0a597778376f49704cbd82113923f98d295c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:130-148 | src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:150-164 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a834fade6f74210325c539a1b63103c28633e7dad17313f8aedea3048816e573"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/main/scala/onion/compiler/parser/OnionParser.scala:1188-1205 | src/main/scala/onion/compiler/parser/OnionParser.scala:1218-1233 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a83a684bdf995c97c7f68f9eb5a46340af3996cb223f22b98013c73d38dabe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala:254-286 | src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala:682-713 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b2fae9aa16f0bb994e168b919ac32baf09472f0b0ce47d5631266e81febda1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/main/java/onion/Json.java:671-707 | src/main/java/onion/Json.java:709-739 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Json.java"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec464bab6b2f77e114cc57d80d93c7b59a4e5b5648cb6040dab94480b018898f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/main/scala/onion/compiler/parser/OnionParser.scala:834-844 | src/main/scala/onion/compiler/parser/OnionParser.scala:1646-1657 | src/main/scala/onion/compiler/parser/OnionParser.scala:1659-1669 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9d2d562289b7f6b95ba460c66e2a375b750fd372ddfbd5f8ccf38cc8ff2609"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/main/scala/onion/compiler/parser/OnionParser.scala:2242-2248 | src/main/scala/onion/compiler/parser/OnionParser.scala:2262-2268 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccf97f9bcea66f6f22fe412d154a7273a3e6cc8210f6c8bcf37074f246b0984"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/main/scala/onion/tools/format/OnionFormatter.scala:241-256 | src/main/scala/onion/tools/lsp/OnionSemanticTokens.scala:219-239 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/format/OnionFormatter.scala"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcfcd9d1ea99f7990780b2dae729fbac44cfedcd65dce1fc100a44969871029"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/main/scala/onion/compiler/parser/OnionLexer.scala:395-413 | src/main/scala/onion/compiler/parser/OnionLexer.scala:423-441 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionLexer.scala"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"035c515441cb9340e294c1cd816d39d71dcc4d66da90c49a8b734895036f4f56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/main/scala/onion/compiler/typing/TypingDuplicationPass.scala:36-51 | src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:115-128 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/TypingDuplicationPass.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72a1dae1126bc5afae7cef44f7b697a29bd257fe936336a6575e46f58e587f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/main/scala/onion/compiler/Typing.scala:242-250 | src/main/scala/onion/compiler/typing/HistoryWritePass.scala:69-77 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/Typing.scala"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d5113e7ea833f6fa1d3e07c42e0e439099b469e50a98d3780fee2d92317a9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/main/scala/onion/compiler/parser/OnionParser.scala:2219-2229 | src/main/scala/onion/compiler/parser/OnionParser.scala:2231-2240 | src/main/scala/onion/compiler/parser/OnionParser.scala:2250-2260 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68fb438702d9750851e208082d6a26c24e9e922eaf254a0a2fc0d0b4abaab14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala:135-143 | src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala:146-153 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5eec21776af5578b19939e5ed7ef2c6cdff92f75e144aae5fb88b5df24b4d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/main/scala/onion/compiler/diagnostics/DiagnosticRenderer.scala:263-273 | src/main/scala/onion/compiler/diagnostics/DiagnosticRenderer.scala:275-287 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/diagnostics/DiagnosticRenderer.scala"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8334ccdd0f90bc3acb74bcf3fc7386cc17de498934a02fdac0a3ba66b50af05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/main/scala/onion/compiler/Rewriting.scala:784-797 | src/main/scala/onion/compiler/Rewriting.scala:809-822 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"0210726da10983ea80a490a8d76c61599bc0ea649ac45e043f61b4f993304769"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/scala/onion/compiler/typing/ArgumentExpectedTypeRetyping.scala:225-232 | src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala:21-28 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ArgumentExpectedTypeRetyping.scala"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"793557016862549748eed08b4c8b30ae04d8243608f40e700132d46b586dd620"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/main/scala/onion/tools/lsp/OnionTextDocumentService.scala:617-633 | src/main/scala/onion/tools/lsp/OnionTextDocumentService.scala:1002-1017 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/lsp/OnionTextDocumentService.scala"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38499d55b89140efde1bbfed2044352d9f14ab6f02031f551c3e3a4266d50d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/onion/Http.java:177-187 | src/main/java/onion/Http.java:207-216 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Http.java"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eeaa163b53442d2f37030a2067c5cbe4bbaf812657876159f1beb18bb0479f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/main/scala/onion/compiler/parser/OnionParser.scala:807-818 | src/main/scala/onion/compiler/parser/OnionParser.scala:820-832 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04d1d58002a326825849bfda7e2ad5f84a4cfe1b76a69a28841987f24530c63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/scala/onion/compiler/typing/ClosureTyping.scala:561-568 | src/main/scala/onion/compiler/typing/MethodBodySupport.scala:834-841 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0510d53ec90c434ec814d41636f108f46d65d6e0487498b669eb18ab7ab0b4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/main/java/onion/Colls.java:1104-1117 | src/main/java/onion/Colls.java:1120-1133 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Colls.java"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bbf202575b0a0df6896cca1e4b8c9fe708eb260c60fc1e48e79255af6b6a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/main/scala/onion/compiler/typing/DuplicationChecks.scala:39-49 | src/main/scala/onion/compiler/typing/DuplicationChecks.scala:51-61 | src/main/scala/onion/compiler/typing/ExtensionShadowCheck.scala:48-55 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/DuplicationChecks.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae192dc8f3968f6b7bc5b98addddcd26e9c01ec0f2cba53bbb01a64e8d470736"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/main/java/onion/FileResource.java:102-112 | src/main/java/onion/HttpResource.java:65-75 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/FileResource.java"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"441a9305cdda9c32ec5d4b053b94741b552b34439998beb490bfa63019796d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/main/scala/onion/compiler/toolbox/Boxing.scala:83-99 | src/main/scala/onion/compiler/toolbox/Boxing.scala:101-116 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/toolbox/Boxing.scala"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67340740911dd59a93164fe5b3dd66171c39a5e7c5b426a8699346dbf8e6801"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/main/scala/onion/compiler/typing/EnsuresVerifyPass.scala:31-40 | src/main/scala/onion/compiler/typing/HistoryWritePass.scala:565-576 | src/main/scala/onion/compiler/typing/OverrideContractPass.scala:25-34 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/EnsuresVerifyPass.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7227de2552bd6e0011488837746636d6c02a24980b9f33801d5c70131c9460ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/main/java/onion/Config.java:93-105 | src/main/java/onion/Config.java:110-122 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Config.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48bb090e08a6de0b56892af2f163a630529b004a4d45ec7b9e38026fbe6528a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/main/scala/onion/compiler/Rewriting.scala:827-834 | src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:248-257 | src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:259-268 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"875433a7ff5ad179b15cc87a776ffafa0883b8c70be1abce7d3a1a4bf9da91d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/main/scala/onion/compiler/typing/EnsuresVerifyPass.scala:24-29 | src/main/scala/onion/compiler/typing/OverrideContractPass.scala:16-23 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/EnsuresVerifyPass.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"980b6ec3b5240574b479842f074b596e4dcf7ffe9d281c191aaedd5ec68b6f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/main/scala/onion/compiler/SemanticErrorReporter.scala:725-735 | src/main/scala/onion/compiler/SemanticErrorReporter.scala:765-775 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64ebd370429e6bcd4a0856767c5b525ecc66b8a365710fee9042a317a3632b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/onion/Colls.java:1052-1059 | src/main/java/onion/Colls.java:1065-1072 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Colls.java"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"664457d50df0918040467a902e555dfccab214206cd4b02e35a376b36500df3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala:158-172 | src/main/scala/onion/compiler/typing/MethodCallTyping.scala:373-380 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedec6e9ee81e8bac4e05f8c6cc54b677d8108582e9ca27c3cb5b163e3a522ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): src/main/scala/onion/compiler/ClassTable.scala:97-110 | src/main/scala/onion/compiler/ClassTable.scala:139-149 | src/main/scala/onion/compiler/ClassTable.scala:211-217 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/ClassTable.scala"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8e04e94ac5b2d714a79f96409a591e6d3f39fcead67622c7bea6538d895361"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/main/scala/onion/compiler/Parsing.scala:146-165 | src/main/scala/onion/compiler/Parsing.scala:175-193 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/Parsing.scala"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9553739675a8347722edd743b9e4db2a6228a10dcfa16c4d10bf39b5ced42e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/scala/onion/compiler/typing/OperatorTyping.scala:391-398 | src/main/scala/onion/compiler/typing/OperatorTyping.scala:417-424 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/OperatorTyping.scala"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"3696ae264d58b8c493c9cb7a91f45137e54983451e0599584733bf540e81556e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/main/scala/onion/tools/Repl.scala:269-281 | src/main/scala/onion/tools/Repl.scala:287-297 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/Repl.scala"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cda0b14b44b990bcf6966e8ace1a9d933832e7358f4b776d2fc4fe85f0ae79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 10\u002B corresponding lines): src/main/java/onion/Http.java:32-41 | src/main/java/onion/Http.java:47-56 | src/main/java/onion/Http.java:63-73 | src/main/java/onion/Http.java:78-89 | src/main/java/onion/Http.java:94-104 | src/main/java/onion/Http.java:480-490 | src/main/java/onion/Http.java:495-504 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Http.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0ff00308ec5b5568f7ffbac8d150b396a8aeee2f08bb508c3d838f2d1fdeab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): src/main/scala/onion/compiler/typing/HistoryPreorder.scala:44-48 | src/main/scala/onion/compiler/typing/HistoryPreorder.scala:59-64 | src/main/scala/onion/compiler/typing/HistoryPreorder.scala:68-73 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/HistoryPreorder.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ef00bd7099d379de2540e7cdfed1965ac41eff0a06a22e23e1cb7985f1a9ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/onion/Archive.java:218-227 | src/main/java/onion/Archive.java:230-239 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Archive.java"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4fba29c7ab0836cae2c4441f8f124295620d5af4d09e3c1f72df95438297f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/main/java/onion/LineShape.java:26-37 | src/main/java/onion/SepByShape.java:35-46 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/LineShape.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5c1bba15d6c29ca2d17dc81674badd8e1b762c946bd51fef92a1dbc8fecca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/main/java/onion/Http.java:163-172 | src/main/java/onion/Http.java:193-201 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Http.java"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce346a40597f0277d380cc367196b2b7221656d4c243632f9bb07d2245338c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/main/scala/onion/compiler/effects/EffectInference.scala:375-383 | src/main/scala/onion/compiler/verification/BuildRun.scala:139-147 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/effects/EffectInference.scala"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00c6294013a514b4bf14ea712434972e5875420be824de08008ad82a60f9ea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): src/main/java/onion/Colls.java:976-984 | src/main/java/onion/Maps.java:40-50 | src/main/java/onion/Maps.java:55-65 | src/main/java/onion/Maps.java:71-81 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Colls.java"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0e30739ed025ec2f17cd9ac1284a6979eb8f4ef29e76189cd4ca19fae1823f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/main/scala/onion/compiler/toolbox/MethodInvoker.scala:18-31 | src/main/scala/onion/compiler/toolbox/MethodInvoker.scala:33-47 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/toolbox/MethodInvoker.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a54f37a25045cd71806b19cbd6f26aa983ca3b8285655b33fee5cee5a43e766"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala:27-50 | src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala:218-230 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"490b9809b104e4dbfbf84210ad92e38f773e5390566cfaff8fbb3b333f968116"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/main/java/onion/Regex.java:85-93 | src/main/java/onion/Regex.java:233-239 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Regex.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"34caeeb251ef1ffb5d950c9b2dd6ee9edb6e3bc485d6306fbe5b25aa4f04c487"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/main/java/onion/IO.java:153-163 | src/main/java/onion/IO.java:170-180 | src/main/java/onion/IO.java:187-197 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/IO.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0c47bb01d89a3581eabe9fd650a7da6637d34d4d779d5e0160c1cb7276e671"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/onion/Future.java:225-234 | src/main/java/onion/Future.java:242-253 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Future.java"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c58d40f94d20bb775677945f20e13fbbe299b22f04e2263f952683a3851e13b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/main/java/onion/Colls.java:551-555 | src/main/java/onion/Colls.java:562-566 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Colls.java"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"66be5f3fc218e65b2e38688213100b6f4ccc722d4d1af29dab3ab045cf183a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/onion/Stats.java:64-71 | src/main/java/onion/Stats.java:74-81 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Stats.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6220467ff9c8a12be6788f95fb7544975eb551a1805a79108ac37bc1959261b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/scala/onion/compiler/environment/AsmRefs.scala:27-34 | src/main/scala/onion/compiler/environment/ReflectionRefs.scala:39-46 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/environment/AsmRefs.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9411b35374d0839f835756b4df54e94d819a2b22d3c91cc022fe30bbf431e8b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/main/java/onion/Future.java:160-173 | src/main/java/onion/Future.java:204-216 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Future.java"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c51333f14a62a9a87a1732ff8166a74230e1425a18ac5b04b2ceb14f538e7ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala:31-38 | src/main/scala/onion/compiler/typing/TypeCheckingHelpers.scala:20-38 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8033fd747ab2f676f7eecc09d5e604aac7d5bbb50d6954713ee184bca8aa4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/main/scala/onion/tools/Repl.scala:577-594 | src/main/scala/onion/tools/Repl.scala:621-635 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/Repl.scala"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"476747119d6463d836167c240f44df886520b4f72365edd67e71bb7afece6e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/main/java/onion/Colls.java:249-254 | src/main/java/onion/Colls.java:256-262 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Colls.java"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a2c4798b91ccb7859fce5df9abeca72796e7730b9f4cba4b034c06cc513d58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/main/java/onion/FileResource.java:88-96 | src/main/java/onion/HttpResource.java:50-58 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/FileResource.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0785c215981a3bd1e67760c3d640082b5986929f6c5024087d99a492f93e495a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/main/java/onion/Colls.java:230-236 | src/main/java/onion/Colls.java:960-966 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Colls.java"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd31f0b210398bf5bdec7c3a5f6f849aa3b6220be0927d365c971fb21f6dc82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/main/java/onion/Maps.java:208-216 | src/main/java/onion/Maps.java:221-228 | src/main/java/onion/Maps.java:234-241 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Maps.java"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f80e04baaababd91a89b9c0bd2a9033bfb9096204bf519266a6e3e51a70500"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/main/scala/onion/compiler/SemanticErrorReporter.scala:1019-1023 | src/main/scala/onion/compiler/SemanticErrorReporter.scala:1038-1042 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc37fdece99d4d8ea7e7e75261eb7bddb77203575b839cdc6d10cfde688c66c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/main/java/onion/Json.java:222-227 | src/main/java/onion/Json.java:233-238 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Json.java"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c815ee1f15fd20ec1491581382242f735b45ac6c27eab46e7f669d390b31c287"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/main/java/onion/Strings.java:103-112 | src/main/java/onion/Strings.java:114-122 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Strings.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9322aad0db4b1bad21f2b964015fab93a62bdff7f0d39df79ed73e3031e5f8f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/main/java/onion/Files.java:70-80 | src/main/java/onion/IO.java:118-128 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Files.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5bddf6c62491949b7ca5e71153b760df03aa6ee8ff198166ec9223f92eb57c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): src/main/java/onion/Maps.java:86-93 | src/main/java/onion/Maps.java:99-106 | src/main/java/onion/Maps.java:131-138 | src/main/java/onion/Maps.java:162-169 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Maps.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"89143c093a3da728d71d047c95b9653c5898b662109308a9f0d56657ae88c3ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): src/main/scala/onion/compiler/verification/ArgGenerator.scala:141-143 | src/main/scala/onion/compiler/verification/ArgGenerator.scala:147-149 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/verification/ArgGenerator.scala"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a556e6b153c34b5083212f06e7b83fdbfa339090b22c0ea6b7d7969fb3af42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/onion/Sets.java:83-90 | src/main/java/onion/Sets.java:159-167 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Sets.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"926e854a0779d2931cd3d200dadea97ca478ffa7aaaaf8984361066434e30022"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/main/scala/onion/tools/doc/Markdown.scala:74-84 | src/main/scala/onion/tools/doc/Markdown.scala:107-115 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/doc/Markdown.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"623de562ac04c110a7402353b37bc736fa3284f99fa90e8918598bdc2f6e8acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/main/scala/onion/compiler/typing/MemberSelectionResolutionSupport.scala:41-47 | src/main/scala/onion/compiler/typing/MethodTargetTypingSupport.scala:38-44 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/MemberSelectionResolutionSupport.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69420aedfa098ae4dc1367afe873f9c9fbf51601963398e44856f5f21730374"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/main/java/onion/Option.java:233-237 | src/main/java/onion/Result.java:316-320 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Option.java"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b52dda1e5d90e34f083aed34fdcfc23e6763aaac116c90ba05ba1b5cceaa11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): src/main/scala/onion/compiler/typing/ClosureTyping.scala:681-682 | src/main/scala/onion/compiler/typing/ControlExpressionTyping.scala:280-281 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4414d8d44d19f6b677bb62c6ca832fc3c6e63b552d1f9b3dc50105704bb32c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): src/main/java/onion/Colls.java:336-342 | src/main/java/onion/Iterables.java:43-49 | src/main/java/onion/Sets.java:30-38 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Colls.java"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"1385ded86a47ba7b409806d58e00926071dbd90694af86b415ab9686730dceb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/onion/Iterables.java:102-110 | src/main/java/onion/Sets.java:207-214 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Iterables.java"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8f15ce7e8dae6ea2f60218617047853844ab17b0145f1af8464b60f14d2b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/onion/Iterables.java:91-99 | src/main/java/onion/Sets.java:195-202 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Iterables.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"411bc280929176d546532746337bbabb07b9a174bb3962ec4239efd34c2c9f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/main/java/onion/Regex.java:293-296 | src/main/java/onion/Strings.java:130-133 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Regex.java"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6e037ee0592f9a15a5d135766adfd761950cb7f12aa9f5f2183a7c18deaed5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/main/java/onion/HttpResource.java:77-80 | src/main/java/onion/MappedShape.java:485-488 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/HttpResource.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f384928f7e1e090673fe48eb4afbfd10ae3086eecca19522c1c34d45eb67ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): src/main/scala/onion/compiler/environment/AsmRefs.scala:17-19 | src/main/scala/onion/compiler/environment/ReflectionRefs.scala:25-27 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/environment/AsmRefs.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7258bdc95f4e5e96420f9742010f644ea82add88c04790d7733991af7e0c0304"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/main/java/onion/Option.java:221-225 | src/main/java/onion/Result.java:309-313 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Option.java"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"989df5344f7bcd2817175f5e86aec4f064d8be8f1b8570cbcb8104e69e2dffa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): src/main/scala/onion/compiler/typing/EnsuresVerifyPass.scala:43-43 | src/main/scala/onion/compiler/typing/HistoryWritePass.scala:579-579 | src/main/scala/onion/compiler/typing/OverrideContractPass.scala:37-37 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/EnsuresVerifyPass.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"635caf418868d6dfdd40e18a40e1d5abfd9765a01c3f3cd1b567b9403e16f7f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/main/java/onion/Maps.java:143-147 | src/main/java/onion/Sets.java:52-56 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Maps.java"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fc646868a34300a02a2d74cf194b6255c6f8e7a34aaf7ad62cdac72d07e948"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/main/java/onion/Outcome.java:47-53 | src/main/java/onion/Rand.java:122-127 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Outcome.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58aaaa023eba62ed9b35feaf140f4b4a52131988426a4f1dc2212d51e9ba687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201334 lines \u00D7 2): src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala:507-540 | src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala:607-635 \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 \u0060src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala:507\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":"src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"897290e8246af7f2392b5e9732785f4d8f2dfc465e9e8f8c4eaa3d5bf18ace19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala:185-217 | src/main/scala/onion/compiler/typing/StaticMethodCallSupport.scala:219-250 \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 \u0060src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala:185\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":"src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db04aeda57955cdfed19bdfcfa7b7b871653eb63bd03379b9a9b238c3cc4f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/main/scala/onion/compiler/typing/ConstructionTyping.scala:867-888 | src/main/scala/onion/compiler/typing/ConstructionTyping.scala:1022-1043 \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 \u0060src/main/scala/onion/compiler/typing/ConstructionTyping.scala:867\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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"5299e1b8c4d7f047e0e349dd2116c775bdbc4316b3e2c58c7d72404a2094ccf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201322 lines \u00D7 2): src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala:29-50 | src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala:221-230 \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 \u0060src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala:29\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":"src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1705280ac72f938ec28223ca96f8b30549a9f61aa290ecda6a564c51eaaeca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala:590-609 | src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala:662-681 \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":"src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"551cc37e039cae3997e817f66a3dcb779c712c27d93140793432f99882a1d0fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala:184-199 | src/main/scala/onion/compiler/typing/ConstructionTyping.scala:1242-1259 \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 \u0060src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala:184\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":"src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"573c1df7abc7b28108f93614cb882ae42fe6bafd0f5bc4bc860ddad6194b4673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala:567-579 | src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala:634-650 \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":"src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59315489708c38ae99a686597ca750f47b84e5bd7ff9fa0503f4b5c12a0b429"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 2): src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala:315-330 | src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala:405-415 \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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d4349236bd204c62a87b3dac944d656120fc0a822ff15077011692712def7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/main/scala/onion/compiler/optimization/MutualRecursionOptimization.scala:816-831 | src/main/scala/onion/compiler/optimization/MutualRecursionOptimization.scala:833-847 \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":"src/main/scala/onion/compiler/optimization/MutualRecursionOptimization.scala"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71f3bb193b1f92fe077d5fae1e17072ba05a2b2800d45affc67e37d357e3f7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala:418-432 | src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala:468-480 \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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ddbcc1f2d63cbd7ce26b9995bc2ff82bba0f24c809b6a886be1e5497d239cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala:239-253 | src/main/scala/onion/compiler/typing/StaticMethodCallSupport.scala:283-296 \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 \u0060src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala:239\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala:254\u0060 calls \u0060finalParams\u0060 and \u0060src/main/scala/onion/compiler/typing/StaticMethodCallSupport.scala:297\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":"src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4730bb94db0d786c0f00082a829e7853850e058769de828ee00054443fdd21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/main/scala/onion/compiler/typing/TypingBodyPass.scala:172-185 | src/main/scala/onion/compiler/typing/TypingBodyPass.scala:287-298 \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 \u0060src/main/scala/onion/compiler/typing/TypingBodyPass.scala:172\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":"src/main/scala/onion/compiler/typing/TypingBodyPass.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3801dd178a1b2f8505f4603b2ff140a8c4024fb58ddcd995103ba7484e95ddad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:100-112 | src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:339-348 \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":"src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8115ce0edb8f6ef13b844795749d8aad5a9a4986360b105fc051ebe9815de902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala:235-247 | src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala:139-150 \u2014 before extracting anything, compare \u0060src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala\u0060 and \u0060src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala:235\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":"src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d600598b442cfb1aabbb536d5bd784a92c45387fe1f07e20c7d5f048870e02a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala:230-241 | src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala:134-145 | src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala:413-423 \u2014 before extracting anything, compare \u0060src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala\u0060 and \u0060src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala:230\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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala:241\u0060 calls \u0060Selected\u0060, \u0060isMemberAccessible\u0060, \u0060report\u0060 and \u0060src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala:423\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":"src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0d684aca9513d632bfc3757b12a6046ea859c399a7a042012beacf5b46c4ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:674-685 | src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:809-818 | src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:858-867 \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 \u0060src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:674\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":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d40a761055233a6c3b24296e260a5a8c18c45f585da57bead8c8ed3845b657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/scala/onion/compiler/typing/BlockElementLowering.scala:574-585 | src/main/scala/onion/compiler/typing/TryExpressionTyping.scala:84-95 \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":"src/main/scala/onion/compiler/typing/BlockElementLowering.scala"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a934de39cc817929b5df1b6848328e0646547f74ed840dec2c9c48daa7e1f553"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:368-379 | src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:462-473 \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 \u0060src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:368\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":"src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0eb8ab9e32c53de74ddb2eba022ca3fffc6d2cda569cd02a44680ae83c44f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/scala/onion/compiler/parser/OnionParser.scala:2320-2330 | src/main/scala/onion/compiler/parser/OnionParser.scala:2349-2359 \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 \u0060src/main/scala/onion/compiler/parser/OnionParser.scala:2320\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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcab111ce0f26fe1046f1eac4f5cbafc01a89ac581a25964948f87351ce589b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:838-847 | src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:880-890 \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 \u0060src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:838\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. 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":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71682cce4c4fd740954ad13d1d59fbcc7a163336e4af4a05a629017887ebb37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala:215-224 | src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala:119-128 \u2014 before extracting anything, compare \u0060src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala\u0060 and \u0060src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"96de2276464c53546acefba39c8b6c0efcfc834ec1a5436a0e776829f460aecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala:226-234 | src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala:130-138 | src/main/scala/onion/compiler/typing/SuperMethodCallSupport.scala:187-195 | src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala:409-417 \u2014 before extracting anything, compare \u0060src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala\u0060 and \u0060src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala:226\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":"src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b557302e5e454ffdae03abcaa3759c9d5424871bf0965e8373596910f7e82e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:158-166 | src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:172-180 | src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:186-194 \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 \u0060src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:158\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":"src/main/scala/onion/compiler/typing/TypingHeaderPass.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae10b2cb0bf5f3cca43a14f33a180c9972d5003380da55211a6489ffb3e7966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/scala/onion/compiler/SemanticErrorReporter.scala:727-735 | src/main/scala/onion/compiler/SemanticErrorReporter.scala:767-775 \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 \u0060src/main/scala/onion/compiler/SemanticErrorReporter.scala:727\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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"2519cf37794c207af1ce1230a12303121200c2ee070d8db1b9bc3735afa260fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala:723-729 | src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala:745-752 \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. 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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb30970bd5c7b2191011946e69d7e9a22d753c5e23e4ff7254fb68c4ba9cf44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/main/scala/onion/compiler/environment/AsmRefs.scala:28-34 | src/main/scala/onion/compiler/environment/ReflectionRefs.scala:39-46 \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 \u0060src/main/scala/onion/compiler/environment/AsmRefs.scala:28\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":"src/main/scala/onion/compiler/environment/AsmRefs.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b733dd949c3a212a6347c42559bd9f08733af14b83573741326514b3ae3c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:308-315 | src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:417-424 \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 \u0060src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:308\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":"src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6148cae3145ada3a2312d53c1bc1bf4b9ef3aaf9c4acc938f1ee73ecb0963b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/main/scala/onion/compiler/SemanticErrorReporter.scala:726-732 | src/main/scala/onion/compiler/SemanticErrorReporter.scala:741-747 | src/main/scala/onion/compiler/SemanticErrorReporter.scala:766-772 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"45956cc110e67611da98c8b6114145ab38fec5f5f7b38f789239553449a6e70f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/scala/onion/compiler/Rewriting.scala:1113-1119 | src/main/scala/onion/compiler/Rewriting.scala:1299-1305 \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":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d3cce86e316cff5958ff82154d0a2cbe6cff4f10ba31edb5da0fde5dd7dc85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/scala/onion/compiler/Rewriting.scala:1274-1281 | src/main/scala/onion/compiler/Rewriting.scala:1537-1544 \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":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaae5fb2679e5c9d2380fae5f095426e45aa3265fcb546aa7b5f5e97681bcc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala:182-188 | src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala:233-239 \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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c48751f4ec76be310c411fb34eb1ca22c6a9dab6eb66d9633994ad194d2be88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/scala/onion/compiler/parser/OnionParser.scala:810-816 | src/main/scala/onion/compiler/parser/OnionParser.scala:823-829 \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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e93af7a2055c19d6c841ed7f9cc75ea7cb18495880435ae11e8574039a819e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/scala/onion/compiler/parser/OnionParser.scala:2332-2338 | src/main/scala/onion/compiler/parser/OnionParser.scala:2361-2367 \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 \u0060src/main/scala/onion/compiler/parser/OnionParser.scala:2332\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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":2332}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee6c3779c2f5f0db3f91523f7f7d63b2333501ad444aaac2096f9f8edb563f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/scala/onion/compiler/typing/ConstructionTyping.scala:41-47 | src/main/scala/onion/compiler/typing/ConstructionTyping.scala:98-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 \u0060src/main/scala/onion/compiler/typing/ConstructionTyping.scala:41\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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1128bb98444e0b1817fc6b205776e6613562778510701a68f5c83826a842d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/scala/onion/compiler/typing/ConstructionTyping.scala:858-864 | src/main/scala/onion/compiler/typing/ConstructionTyping.scala:1013-1019 \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 \u0060src/main/scala/onion/compiler/typing/ConstructionTyping.scala:858\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"f755ebf226702f5515fe25cf40585827c79a7af849f06c8c30951bae404afbb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala:37-43 | src/main/scala/onion/compiler/verification/ShapeContractPhase.scala:35-41 \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":"src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"203dadc41d47001c8a5f27d32f49836f40e84a3b535d8ab38debe4499425f084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:159-164 | src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:173-178 | src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:187-192 | src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:207-212 \u2014 all 4 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 \u0060src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:159\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, \u0060src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:214\u0060 calls \u0060registerExtensionDeclaration\u0060 and \u0060src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:165\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":"src/main/scala/onion/compiler/typing/TypingHeaderPass.scala"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6406e1647623a7cefc129432146aa22876344fa06b7d141588189aba26e1ad64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/main/scala/onion/compiler/contracts/HistoryProver.scala:242-247 | src/main/scala/onion/compiler/typing/HistoryPreorder.scala:93-98 | src/main/scala/onion/compiler/typing/HistoryWritePass.scala:669-674 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/contracts/HistoryProver.scala"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede1277f8c35d00744789446cd104249c2e18279888295564d00c682d82b27bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala:219-224 | src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala:123-128 | src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala:402-407 \u2014 before extracting anything, compare \u0060src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala\u0060 and \u0060src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1228ea37323241c740d61b073a05ba78ef1c4a105c127e7729797bfcca41cbfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala:137-143 | src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala:148-153 \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":"src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8931b93bb12c6bfc6cf15b122edb0a8b28491f085c790482619126211b73770d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): src/main/scala/onion/compiler/parser/OnionParser.scala:836-838 | src/main/scala/onion/compiler/parser/OnionParser.scala:1650-1655 | src/main/scala/onion/compiler/parser/OnionParser.scala:1662-1667 \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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/scala/onion/compiler/parser/OnionParser.scala:1662\u0060 calls \u0060id\u0060 and \u0060src/main/scala/onion/compiler/parser/OnionParser.scala:836\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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf3f4a60e518d3f4201ee089b9df6af6c76e7461fccc047fa7b4e93acde6737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala:187-192 | src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala:90-95 \u2014 before extracting anything, compare \u0060src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala\u0060 and \u0060src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala:187\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":"src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fb8555d1cac837211378c162c6aaed2df117780115d15bd02d467bbbfc11c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala:106-111 | src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala:132-137 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala:114\u0060 calls \u0060isSuperType\u0060 and \u0060src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala:138\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":"src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6666276e32773e9c0b45a983f974d9084ca942d059ac4e10bb40953ca5b42972"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala:193-199 | src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala:218-223 \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 \u0060src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala:193\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":"src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3109511faac71059bfe88c02621c1864e136e7e2d4dc40f3c9e74a198d7793a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:250-257 | src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:261-268 \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 \u0060src/main/scala/onion/compiler/typing/TypingHeaderPass.scala:250\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":"src/main/scala/onion/compiler/typing/TypingHeaderPass.scala"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dd25053f99eb0f8e8830e8404e08a502d90bb49bde07220ea68a6ec765f951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala:37-42 | src/main/scala/onion/compiler/verification/HistoryReproPhase.scala:43-48 \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":"src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"360e3c39a0d5fc2cf73070c51fd1c331a221e09783832ec199d7377789fe5ca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala:66-71 | src/main/scala/onion/compiler/verification/ShapeContractPhase.scala:47-52 \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 \u0060src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala:66\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":"src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb6d636c103771521c2cdfa7eedabfc8a0496f14bfea3d2d14ddd0ac265f578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/scala/onion/compiler/typing/BlockElementLowering.scala:84-88 | src/main/scala/onion/compiler/typing/BlockElementLowering.scala:94-98 \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 \u0060src/main/scala/onion/compiler/typing/BlockElementLowering.scala:84\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":"src/main/scala/onion/compiler/typing/BlockElementLowering.scala"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"431d74280b87c9e17dea024b886f4c9e99bc2715b7458128b9f28f9dc1083db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/scala/onion/compiler/typing/EnsuresVerifyPass.scala:32-38 | src/main/scala/onion/compiler/typing/OverrideContractPass.scala:26-32 \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":"src/main/scala/onion/compiler/typing/EnsuresVerifyPass.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5b39747d29a199e1c8dfc9faf57f1ba614d9de339c649150489752b0fb0413"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:386-390 | src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:475-479 \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 \u0060src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:386\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":"src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfde07146bdffd8861383f3144a38f86c8c0d6a8498ceb13c068db24e20ff53c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/scala/onion/compiler/typing/TypingDuplicationPass.scala:41-45 | src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:117-121 \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 \u0060src/main/scala/onion/compiler/typing/TypingDuplicationPass.scala:41\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":"src/main/scala/onion/compiler/typing/TypingDuplicationPass.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"00eefb3fd8c959129706ef8bbd581927024f8c608f58ca03959f301c438c13d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/scala/onion/tools/CompilerFrontend.scala:98-102 | src/main/scala/onion/tools/ScriptRunner.scala:231-235 \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":"src/main/scala/onion/tools/CompilerFrontend.scala"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6a9bf3a445d323976295aabb579a61b1e33d6ad22410fd8697def7d5a9dfd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/scala/onion/compiler/typing/ArgumentExpectedTypeRetyping.scala:290-297 | src/main/scala/onion/compiler/typing/ConstructionTyping.scala:808-815 \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":"src/main/scala/onion/compiler/typing/ArgumentExpectedTypeRetyping.scala"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d821ad7ab694f7ec92f7fd5d4814b820706a2e71c4263f206f1145e8cccac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/scala/onion/compiler/typing/BlockElementLowering.scala:33-38 | src/main/scala/onion/compiler/typing/ControlExpressionTyping.scala:228-233 \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":"src/main/scala/onion/compiler/typing/BlockElementLowering.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bafa266992cece7cb649aadd65f176d7b13b726d4be5036f1a49ba1b03b90c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/scala/onion/compiler/typing/BlockElementLowering.scala:838-843 | src/main/scala/onion/compiler/typing/ControlExpressionTyping.scala:235-240 \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":"src/main/scala/onion/compiler/typing/BlockElementLowering.scala"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a73d555dd7ec9f98d208b5be31d99ac5f32f0354ee44a1c99d5d15c253b132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/main/scala/onion/compiler/typing/ClosureTyping.scala:418-422 | src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala:745-749 | src/main/scala/onion/compiler/typing/FunctionalInterfaces.scala:17-21 \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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad37174d9c2934700192a57c05c6d72602e65378021a46b6e53c288f3cae568b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/scala/onion/compiler/typing/ConstructionTyping.scala:837-843 | src/main/scala/onion/compiler/typing/ConstructionTyping.scala:926-932 \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 \u0060src/main/scala/onion/compiler/typing/ConstructionTyping.scala:837\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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fde8d7a983cf9d175f0e97f01cd957a06fb79da4f87625bc46ad287e18d01c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/scala/onion/compiler/typing/DuplicationChecks.scala:72-76 | src/main/scala/onion/compiler/typing/DuplicationChecks.scala:103-107 \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 \u0060src/main/scala/onion/compiler/typing/DuplicationChecks.scala:72\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, \u0060src/main/scala/onion/compiler/typing/DuplicationChecks.scala:108\u0060 calls \u0060contains\u0060 and \u0060src/main/scala/onion/compiler/typing/DuplicationChecks.scala:77\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/DuplicationChecks.scala"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b31211ec8cd9ff03cdd634bc79e2657b56852e5d1b4d225b1e0c27e2054e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/scala/onion/compiler/typing/EnsuresVerifyPass.scala:48-52 | src/main/scala/onion/compiler/typing/OverrideContractPass.scala:43-47 \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":"src/main/scala/onion/compiler/typing/EnsuresVerifyPass.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ac404e3695f0d54bf80f84db45ac6ad244d64fd89ce0de7bf7abf07a030c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:88-94 | src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:96-102 | src/main/scala/onion/compiler/typing/TypingOutlinePass.scala:104-110 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"61666a7c5127662cc91fe894ca4c428877341540cd15f9b07ea7819d85624202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): src/main/java/onion/Cli.java:100-115 | src/main/java/onion/Cli.java:173-191 \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 \u0060src/main/java/onion/Cli.java:100\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":"src/main/java/onion/Cli.java"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"470e738617609c3b76f4048e49d70722410dd5d444b29be98e14efb887057506"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/main/java/onion/Yaml.java:477-493 | src/main/java/onion/Yaml.java:510-526 \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 \u0060src/main/java/onion/Yaml.java:477\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Yaml.java"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a1b7415790a153f5bb6edd0729929ad362c66d2601db09fbef9dea7f26b86f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/onion/Json.java:411-425 | src/main/java/onion/Json.java:445-459 \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 \u0060src/main/java/onion/Json.java:411\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Json.java"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d7d67ac1d9e97df3e82b44dc8c2256f13a01ce375dbc4920fc5b6229193c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/onion/Cli.java:136-147 | src/main/java/onion/Cli.java:221-232 \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 \u0060src/main/java/onion/Cli.java:136\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":"src/main/java/onion/Cli.java"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"77028fe41f9a46f9599b181381ad38b40ea0850b7fa68034653d9d800b6cde44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/onion/Json.java:377-388 | src/main/java/onion/Json.java:429-440 \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 \u0060src/main/java/onion/Json.java:377\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":"src/main/java/onion/Json.java"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45db42c77ca382ab01eecddefc9cebc25add22b5b3f8a260420edcb3e756e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/onion/Regex.java:116-123 | src/main/java/onion/Regex.java:252-259 \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 \u0060src/main/java/onion/Regex.java:116\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Regex.java"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b8c54d94c41a1afbad1e0daab46552d2b6b95d2d9ead82be87f8aefa1a444c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/onion/Regex.java:133-142 | src/main/java/onion/Regex.java:265-274 \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 \u0060src/main/java/onion/Regex.java:133\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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Regex.java"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14497bee76c7b82e258d2f0d304e6b75817276751ee5441ad88efd58c708e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/onion/Cli.java:128-134 | src/main/java/onion/Cli.java:212-219 \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 \u0060src/main/java/onion/Cli.java:128\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":"src/main/java/onion/Cli.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78253bb352b6466d9d28476aa3e00ada8f7270eaa0fe655d8e0adf3db3b758b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/main/java/onion/Codec.java:59-65 | src/main/java/onion/Hash.java:53-58 \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 \u0060src/main/java/onion/Codec.java:59\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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. 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":"src/main/java/onion/Codec.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e58dfc1b36193bd42edcbb423367ffa6f4d0ccacc93b2ba1cbe6c762ce778f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/onion/Http.java:65-71 | src/main/java/onion/Http.java:179-185 \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":"src/main/java/onion/Http.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f71797f43d6632661a078f4b35a7c043e7852b8999b8d1d5e3205d971218af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/onion/Json.java:546-552 | src/main/java/onion/Json.java:561-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 \u0060src/main/java/onion/Json.java:546\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/onion/Json.java:558\u0060 calls \u0060isEOF\u0060, \u0060peek\u0060, \u0060consume\u0060 and \u0060src/main/java/onion/Json.java:545\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":"src/main/java/onion/Json.java"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf9a22d09b2008cc36de493a764ab92c871386df6418d437f8f195307418e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/onion/Json.java:745-751 | src/main/java/onion/Yaml.java:456-462 \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 \u0060src/main/java/onion/Json.java:745\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Json.java"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb59be3199e8d8d7179ab12fdbbbfa5c7ca138364f8c9edf789f96af3c8c107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/main/java/onion/Regex.java:32-37 | src/main/java/onion/Regex.java:116-121 | src/main/java/onion/Regex.java:252-257 \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 \u0060src/main/java/onion/Regex.java:32\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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Regex.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"662e763856479a9774510fb7e96bbf0866ad7e16b6f9fdd605996ff8b232df8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/onion/Http.java:34-39 | src/main/java/onion/Http.java:165-170 \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":"src/main/java/onion/Http.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f674723eb8301597c36d4da33054c5040c70b0527ddb29afa8968a76eaf3bd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/onion/Proc.java:87-93 | src/main/java/onion/Proc.java:138-144 \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 \u0060src/main/java/onion/Proc.java:87\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":"src/main/java/onion/Proc.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"7920455b9ef143a0013c7e0bf3951861a7ba63f5b654ac4f04e43d2161139ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): src/main/java/onion/Regex.java:31-35 | src/main/java/onion/Regex.java:115-119 | src/main/java/onion/Regex.java:134-138 | src/main/java/onion/Regex.java:251-255 | src/main/java/onion/Regex.java:266-270 \u2014 all 5 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/onion/Regex.java:139\u0060 calls \u0060add\u0060 and \u0060src/main/java/onion/Regex.java:36\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":"src/main/java/onion/Regex.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a33e0d27e74cc4a6471ee878186374f5e7e9b1c30303079f1f25ce967e3883"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/main/java/onion/Json.java:480-484 | src/main/java/onion/Json.java:747-751 | src/main/java/onion/Yaml.java:458-462 | src/main/java/onion/Yaml.java:631-635 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/onion/Json.java:480\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Json.java"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b21d944a999888ccf471f4b3cb462ddfe979ba834adb4435b8667a78000cd09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/onion/Yaml.java:619-625 | src/main/java/onion/Yaml.java:653-659 \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 \u0060src/main/java/onion/Yaml.java:619\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":"src/main/java/onion/Yaml.java"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5bedd50126821418241721143dedb5b4afdb7e953b0de86385c8ca19945249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/main/java/onion/typeclass/Numeric$$Integer.java:9-22 | src/main/java/onion/typeclass/Numeric$$Long.java:9-22 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/typeclass/Numeric$$Integer.java"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7867a9eccd17f19c8474eda4acfa8e83a8f604ac2e6162c61dac814ff0afa5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/onion/Colls.java:387-393 | src/main/java/onion/Iterables.java:82-88 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060initial\u0060 to \u0060U\u0060 in one and \u0060Object\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":"src/main/java/onion/Colls.java"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"65af1fa71150bf866678157f3d5ae1b8705011623186d54343fea37c3b0b5b73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): .github/scripts/evolution_risk_gate.py:42-53 | .github/scripts/evolution_veto_window.py:67-78 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/evolution_risk_gate.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3738d9597ca979cfdc83f893b3e7e683db4ad73848270d539edf97be5f359fd2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: onion: onion: abstractness 0.08, instability 0.00, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"023595efb3287f516a86f29ee296f36b3e7d2849d1384dd197eabcd5b00d9f3b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ClassTable (LCOM4 9): ClassTable\u0027s methods fall into 9 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 9 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":"src/main/scala/onion/compiler/ClassTable.scala"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"06597f0729b22a06869ca09575a315e3d195114367c65f5f9fa9f1602ee4131b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ControlFlowEmitter (LCOM4 5): ControlFlowEmitter\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":"src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"916d04807231e624020e118a8dd54ef6419b3a6db3c544b72f10f071649659ab"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LocalContext (LCOM4 4): LocalContext\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":"src/main/scala/onion/compiler/LocalContext.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0010f86f0feacfd95765239a2313eda59af9170c4c7af3d63104b733ed05e325"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Rewriting (LCOM4 4): Rewriting\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":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a7262b746f40633759801e47d1c640cdf158a08c20534d6f605587d93d2aa7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AsmCodeGenerationVisitor (LCOM4 4): AsmCodeGenerationVisitor\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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4092f6759a675a0110b2a5f7a525beda0c713276c8dd262e1ef78348308d31ec"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MutualRecursionOptimization (LCOM4 4): MutualRecursionOptimization\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":"src/main/scala/onion/compiler/optimization/MutualRecursionOptimization.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"50853045139b3ea0ebb8b41e11980e7c2c1ad1e8cc7a22842c6fd0f344e67547"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MethodResolutionSupport (LCOM4 4): MethodResolutionSupport\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":"src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c2591f303a4258452c01c1ce424345ed3f29556a4a41e9f780de747b673c47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/parser/SyntaxHintClassifier.scala: src/main/scala/onion/compiler/parser/SyntaxHintClassifier.scala changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 130 in SyntaxHintClassifier.classify at line 302. 46 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-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/parser/SyntaxHintClassifier.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":"src/main/scala/onion/compiler/parser/SyntaxHintClassifier.scala"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"f779274a06486728d36578438dde376d997cb92355f6136ee3b63a52b753c5d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/SemanticErrorReporter.scala: src/main/scala/onion/compiler/SemanticErrorReporter.scala changed 108 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in SemanticErrorReporter.reportMethodNotFound at line 138. 91 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-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/SemanticErrorReporter.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":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4739dc9f50380795f27b886e70272ab86991233263e9478596bba7b0cb4e0a09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/BlockElementLowering.scala: src/main/scala/onion/compiler/typing/BlockElementLowering.scala changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in BlockElementLowering.translate at line 55. 23 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-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/BlockElementLowering.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":"src/main/scala/onion/compiler/typing/BlockElementLowering.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e5ce0f19a8a6589f905c42dd22e115b1038a963f890b9a2a1c659c00c1f8ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/ConstructionTyping.scala: src/main/scala/onion/compiler/typing/ConstructionTyping.scala changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in ConstructionTyping.typeNewObject at line 339. 43 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-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/ConstructionTyping.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":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77bcd908cd0dc9d863b2710313ae3b0204f7c700c6b33eecf4e6ef1b9fdb3b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala: src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in SelectExpressionTyping.typeSelectExpression at line 26. 17 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-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/SelectExpressionTyping.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":"src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9eadab06f2186eb63988e9d55255207b0f045f9d3fefc1ab9e6af6e5a2a018"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala: src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in ExtensionMethodFallbackSupport.tryExtensionMethodCallBidirectional at line 493. 33 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-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.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":"src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47fe1ff83dde51a2581bcb8143d4f1408662bf972768fda77789ee952c76e5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/AssignabilitySupport.scala: src/main/scala/onion/compiler/typing/AssignabilitySupport.scala changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in AssignabilitySupport.processAssignable at line 71. 32 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-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/AssignabilitySupport.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":"src/main/scala/onion/compiler/typing/AssignabilitySupport.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"89af0eeccb31e201405833e94964ab0b78c9d8e22b8e55e4d80ed52ab8d88918"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/TypingOutlinePass.scala: src/main/scala/onion/compiler/typing/TypingOutlinePass.scala changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in TypingOutlinePass.processRecordDeclaration at line 166. 31 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-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/TypingOutlinePass.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":"src/main/scala/onion/compiler/typing/TypingOutlinePass.scala"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8453f8d5b2100510e57bafcaa3804f05e7fea1c29988a202233b80c61ef666a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/TypedAST.scala: src/main/scala/onion/compiler/TypedAST.scala changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in TypeRules.isSuperType at line 2023. 33 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-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/TypedAST.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":"src/main/scala/onion/compiler/TypedAST.scala"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"303b1c3941b72450b64112edb31e92c392c92b8f28dcf046b0f15e973f7ae926"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/MethodBodySupport.scala: src/main/scala/onion/compiler/typing/MethodBodySupport.scala changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in MethodBodySupport.processConstructorDeclaration at line 348. 39 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-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/MethodBodySupport.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":"src/main/scala/onion/compiler/typing/MethodBodySupport.scala"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa2b3b3e6b4a70014e724195e27d79fbd595ecab103e25350a362f022cf0211"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/ClosureTyping.scala: src/main/scala/onion/compiler/typing/ClosureTyping.scala changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in ClosureTyping.typeClosure at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/ClosureTyping.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":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed34d4cb29b018229fa96eec446889f8a986b25f6df0cac4116ed60259b35a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/Rewriting.scala: src/main/scala/onion/compiler/Rewriting.scala changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Rewriting.appendAutoCliCall at line 521. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/Rewriting.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":"src/main/scala/onion/compiler/Rewriting.scala"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f8cf551e2a517469e621be76579c23cb3343df830a2632172edb0aa9c19885"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala: src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Constraints.unify at line 313. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.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":"src/main/scala/onion/compiler/typing/GenericMethodTypeArguments.scala"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"d089be45673d53c2a6e4fcf9c33b54f3c0d299f7f093a99a957b69bf646812f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/parser/OnionParser.scala: src/main/scala/onion/compiler/parser/OnionParser.scala changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in OnionParser.classDecl at line 1051. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/parser/OnionParser.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":"src/main/scala/onion/compiler/parser/OnionParser.scala"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e8dd7c032a6b209bf79fd8b0d4c103ccc1e1a56d62201c97fe9e595b7c9fb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/ExpressionFormTyping.scala: src/main/scala/onion/compiler/typing/ExpressionFormTyping.scala changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in ExpressionFormTyping.isValidCast at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/ExpressionFormTyping.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":"src/main/scala/onion/compiler/typing/ExpressionFormTyping.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"db23e9aded1171514e97f08a679ea8aac00b81c564cdf5c09a93644fa56fa9a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/effects/EffectInference.scala: src/main/scala/onion/compiler/effects/EffectInference.scala changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in Collector.term at line 659. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/effects/EffectInference.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":"src/main/scala/onion/compiler/effects/EffectInference.scala"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e51fe1ab8037d70e48b5237c83ecddd60f14c73fdef8e2fd352a85a26dea36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala: src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in UnqualifiedMethodCallSupport.typeUnqualifiedMethodCall at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.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":"src/main/scala/onion/compiler/typing/UnqualifiedMethodCallSupport.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7343f5967de9eabd4eb6969ae6c4c16e26b58958c790f614623ae7e5c33b66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala: src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in AsmCodeGeneration.codeMethod at line 447. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6269226a4f1001134f7884ac5f3e2730f2d3c8cf3f62163be01072c87840c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/Parsing.scala: src/main/scala/onion/compiler/Parsing.scala changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Parsing.syntaxErrorMessage at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/Parsing.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":"src/main/scala/onion/compiler/Parsing.scala"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0532f160007dce8528266200edc64a29a43f4837172d822cfe8698bdea455091"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala: src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in InstanceMethodCallSupport.typeMethodCallOnObjectChecked at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.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":"src/main/scala/onion/compiler/typing/InstanceMethodCallSupport.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb52bc74e82daf3f49f8fd12e80bdd3fa557118eab4c8fb3a38f046b37a093a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/tools/migrate/MigrateCommand.scala: src/main/scala/onion/tools/migrate/MigrateCommand.scala changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in MigrateCommand.migrate at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/tools/migrate/MigrateCommand.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":"src/main/scala/onion/tools/migrate/MigrateCommand.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcfd403470b4bb61a5161b1cc57ce1c6494096ca26eb6fb4c454dba062af4f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala: src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in MethodCallFallbackSupport.typeCallWithBidirectionalInferenceCore at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.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":"src/main/scala/onion/compiler/typing/MethodCallFallbackSupport.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"601ba09afe1f039873971de616a7e05fb181b3a36134ad1e4cbc879afd50415a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.scala: src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.scala changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in SimpleExpressionTypingSupport.typeMapLiteral at line 557. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.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":"src/main/scala/onion/compiler/typing/SimpleExpressionTypingSupport.scala"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"64eb7a803c19188ce781a88e84ca75cfeeacecd9794f4ad9f1b35dae87d5565d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/HistoryWritePass.scala: src/main/scala/onion/compiler/typing/HistoryWritePass.scala changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in HistoryWritePass.checkInherited at line 129. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/HistoryWritePass.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":"src/main/scala/onion/compiler/typing/HistoryWritePass.scala"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d7dbe45d819f4cdb5812949c116f7f4bc6c2ed77f4407fcdcf339c80d19694"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/TypingBodyPass.scala: src/main/scala/onion/compiler/typing/TypingBodyPass.scala changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in TypingBodyPass.processEnumDeclaration at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/TypingBodyPass.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":"src/main/scala/onion/compiler/typing/TypingBodyPass.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbe16712ed5a8ff48ec030024bfe97f6e56515db77f09a75eeac589164f7f7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/StaticMethodCallSupport.scala: src/main/scala/onion/compiler/typing/StaticMethodCallSupport.scala changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in StaticMethodCallSupport.typeStaticCallWithBidirectionalInferenceCore at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/StaticMethodCallSupport.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":"src/main/scala/onion/compiler/typing/StaticMethodCallSupport.scala"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"65431d0be59f0cfd2422dc3b89e053cbb6312fddd2a0d713288bc728696d5a3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/DuplicationChecks.scala: src/main/scala/onion/compiler/typing/DuplicationChecks.scala changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in DuplicationChecks.checkOverrideContracts at line 136. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/DuplicationChecks.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":"src/main/scala/onion/compiler/typing/DuplicationChecks.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b723a7e642f3522aceaf894d284302109f076e39def52e70d7cb13b42a3abc00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/NameResolution.scala: src/main/scala/onion/compiler/typing/NameResolution.scala changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in NameResolver.map at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/NameResolution.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":"src/main/scala/onion/compiler/typing/NameResolution.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfc5a875ca3c6cc7d3c23369549388a37de5d0c2e0e04c40efc17da553df5eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/AssignmentTyping.scala: src/main/scala/onion/compiler/typing/AssignmentTyping.scala changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in AssignmentTyping.processMemberAssign at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/AssignmentTyping.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":"src/main/scala/onion/compiler/typing/AssignmentTyping.scala"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee014ba1f3635cc6104c51ece31134704b3781a09d1bea1b60ccfeb34697137d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/tools/migrate/Migrator.scala: src/main/scala/onion/tools/migrate/Migrator.scala changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in LawExampleToPredicate.find at line 271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/tools/migrate/Migrator.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":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"dceb5564d8297780db7546e51fa4a4c2631ddc7d2b133f77336e2007b42632b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/DeclarationBodySupport.scala: src/main/scala/onion/compiler/typing/DeclarationBodySupport.scala changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DeclarationBodySupport.unitDefaultJobs at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/DeclarationBodySupport.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":"src/main/scala/onion/compiler/typing/DeclarationBodySupport.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae0dacfddd634287b0647a97920020f7e8c0207cdf4456eb0d157c427759a79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/optimization/TailCallOptimization.scala: src/main/scala/onion/compiler/optimization/TailCallOptimization.scala changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TailCallOptimization.isSelfCall at line 259. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/optimization/TailCallOptimization.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":"src/main/scala/onion/compiler/optimization/TailCallOptimization.scala"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41b891a3ca960a623397cd4dd1cf89c175e63e6d48189d6301466fff1188839"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/TermWalk.scala: src/main/scala/onion/compiler/TermWalk.scala changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in TermWalk.children at line 54. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/TermWalk.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":"src/main/scala/onion/compiler/TermWalk.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1a3dc8a449163dad9a0bfa08274f8c31408ed507265303681fa6d8ea361240"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/java/onion/Yaml.java: src/main/java/onion/Yaml.java changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Yaml.parseScalar at line 549. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Yaml.java\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":"src/main/java/onion/Yaml.java"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73a845254b8bd3ff83671831446240a8c0ad08f68c1bdc754887f66e315a4bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/parser/ControlFlowSyntaxHints.scala: src/main/scala/onion/compiler/parser/ControlFlowSyntaxHints.scala changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ControlFlowSyntaxHints.classify at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/parser/ControlFlowSyntaxHints.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":"src/main/scala/onion/compiler/parser/ControlFlowSyntaxHints.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e7caef0308aba216e03027a37cb9160802457640261a558c727ff0dc00e75f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/OperatorTyping.scala: src/main/scala/onion/compiler/typing/OperatorTyping.scala changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in OperatorTyping.typePostUpdate at line 484. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/OperatorTyping.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":"src/main/scala/onion/compiler/typing/OperatorTyping.scala"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c63b11342ac485bad18c44b7058015fd571db5653ba3e6ef204eef3ef8da80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala: src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in MethodResolutionSupport.applicable at line 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/MethodResolutionSupport.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":"src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe6f618b3ee19b7d6328b8b365ce3aeaf549449eca1ca8ab707e4ebe1ddb86c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala: src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ControlFlowEmitter.emitTry at line 326. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.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":"src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"86aa80b5dfcba1595081e05126f4d1db45daf51fbae4d5c2fcc7ee8b75794e51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/TypeCheckingHelpers.scala: src/main/scala/onion/compiler/typing/TypeCheckingHelpers.scala changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in TypeCheckingHelpers.leastUpperBound at line 152. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/TypeCheckingHelpers.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":"src/main/scala/onion/compiler/typing/TypeCheckingHelpers.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6eed450b3ffa94c18aa7517c2a30dba1940c379dff64027b0d44f4335f25c7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/SuperMethodCallSupport.scala: src/main/scala/onion/compiler/typing/SuperMethodCallSupport.scala changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SuperMethodCallSupport.typeSuperMethodCall at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/SuperMethodCallSupport.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":"src/main/scala/onion/compiler/typing/SuperMethodCallSupport.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d7e47ffbd3ffa15ac0a86461fc11f8e1af9c238895ad02b529229e8d542594"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/TypeRelations.scala: src/main/scala/onion/compiler/typing/TypeRelations.scala changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TypeRelations.isAssignableWithBoxing at line 157. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/TypeRelations.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":"src/main/scala/onion/compiler/typing/TypeRelations.scala"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"959e6516d7c5af299c2153c77adef7039c5dc70a9748ce4d2edb97d59d9a9663"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/java/onion/ToolCli.java: src/main/java/onion/ToolCli.java changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in ToolCli.dispatch at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/ToolCli.java\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":"src/main/java/onion/ToolCli.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8276c4f57e9582815021eecf8fe67cc9c29200a636aa6a5071bde1bfdb7f9e57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/RecordCopySupport.scala: src/main/scala/onion/compiler/typing/RecordCopySupport.scala changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in RecordCopySupport.tryRecordCopy at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/RecordCopySupport.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":"src/main/scala/onion/compiler/typing/RecordCopySupport.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"27493839f2d0562a58855f305cb6442d091b45bfe18c53120dc6af27f03fe278"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/TypingTypeSupport.scala: src/main/scala/onion/compiler/typing/TypingTypeSupport.scala changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TypingTypeSupport.checkTypeArgumentBounds at line 306. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/TypingTypeSupport.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":"src/main/scala/onion/compiler/typing/TypingTypeSupport.scala"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cac861922a1ae8ac1e97a6297db1ac3264f8e0564dde7dcc2c576bdd7895ae1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/TryExpressionTyping.scala: src/main/scala/onion/compiler/typing/TryExpressionTyping.scala changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in TryExpressionTyping.typeTryExpression at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/TryExpressionTyping.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":"src/main/scala/onion/compiler/typing/TryExpressionTyping.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32f04f8b67c194d1e2c34bbd41354c7e97f7f3f79b129ca774e154f5241b10e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/tools/CompilerFrontend.scala: src/main/scala/onion/tools/CompilerFrontend.scala changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in CompilerFrontend.run at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/tools/CompilerFrontend.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":"src/main/scala/onion/tools/CompilerFrontend.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6f5e4c86d3eb8a54e4af9c2770e2f4f6755aad9ddabfd783faa671b8289b52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/ASTWalk.scala: src/main/scala/onion/compiler/ASTWalk.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in ASTWalk.visitChildren at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/ASTWalk.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":"src/main/scala/onion/compiler/ASTWalk.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b4de0a081d218fb3c83cc3d537ab4d3b3e37c042251359fec0f1f91caa997a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala: src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in CallArgumentTypingSupport.processNamedArguments at line 168. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.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":"src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c26676c93418a267c03e41c362a1d2e6016b5f8b945d7937ac83a0786610ce3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/backend/asm/CapturedVariableCollector.scala: src/main/scala/onion/compiler/backend/asm/CapturedVariableCollector.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in CapturedVariableCollector.collectUncached at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/backend/asm/CapturedVariableCollector.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":"src/main/scala/onion/compiler/backend/asm/CapturedVariableCollector.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"916c558cf7a4c3c836b998db2c139189a3d52868f7a53b26ec0c5c83d7e9c65e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/contracts/HistoryProver.scala: src/main/scala/onion/compiler/contracts/HistoryProver.scala changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Run.step at line 215. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/contracts/HistoryProver.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":"src/main/scala/onion/compiler/contracts/HistoryProver.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fe3fc6a1cc32d0aeef7593a5c43a71f7f95aaeb20c82c993e49ad077d0f56e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/tools/ScriptRunner.scala: src/main/scala/onion/tools/ScriptRunner.scala changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ScriptRunner.prepare at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/tools/ScriptRunner.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":"src/main/scala/onion/tools/ScriptRunner.scala"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56c48a3e05b73b350951eb50ca0c58c000d467f00fdc5e1e637707caa5f8264"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/backend/asm/BridgeMethodEmitter.scala: src/main/scala/onion/compiler/backend/asm/BridgeMethodEmitter.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in BridgeMethodEmitter.emitBridges at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/backend/asm/BridgeMethodEmitter.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":"src/main/scala/onion/compiler/backend/asm/BridgeMethodEmitter.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3d9e997857b11e5a63cd11b00a7707c1529028501c4850bcd809335858ba3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/AssignedVariableScanner.scala: src/main/scala/onion/compiler/AssignedVariableScanner.scala changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in AssignedVariableScanner.scan at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/AssignedVariableScanner.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":"src/main/scala/onion/compiler/AssignedVariableScanner.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d587f3ca48ae64c1dcb57e4f9b3197585b3003b9fa9ac1a125a83d426ba502"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/java/onion/Csv.java: src/main/java/onion/Csv.java changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Csv.parse at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Csv.java\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":"src/main/java/onion/Csv.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f02052986789d9dd0e5f6af20723af5e97caaec155b3625bf70d80a47c780a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/java/onion/Json.java: src/main/java/onion/Json.java changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Json.stringifyInternal at line 608. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Json.java\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":"src/main/java/onion/Json.java"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6e21d65afb8b22e6ad86f9a0464081b2e6a3805b5dba0976e64e0e23995370"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/java/onion/ConfigShape.java: src/main/java/onion/ConfigShape.java changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ConfigShape.printLossless at line 235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/ConfigShape.java\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":"src/main/java/onion/ConfigShape.java"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0326fa225a41ba31d32f0d5b3b1a928af4f413b406735fb5b0fa3b4eae2879"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/effects/StaticOperands.scala: src/main/scala/onion/compiler/effects/StaticOperands.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in StaticOperands.operand at line 194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/effects/StaticOperands.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":"src/main/scala/onion/compiler/effects/StaticOperands.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"135adbd1972bdf6317fa3185818c02f55c8495fcfb6e6c9c08ae187aa42dcc0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/java/onion/Cli.java: src/main/java/onion/Cli.java changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Cli.tryParse at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Cli.java\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":"src/main/java/onion/Cli.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"783913d72dea1ac55cca170981f19d41c047b8e3e26958b1193748c265bfb7a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/ArgumentExpectedTypeRetyping.scala: src/main/scala/onion/compiler/typing/ArgumentExpectedTypeRetyping.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ArgumentExpectedTypeRetyping.retypeTargetTypedClosures at line 180. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/ArgumentExpectedTypeRetyping.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":"src/main/scala/onion/compiler/typing/ArgumentExpectedTypeRetyping.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd26590c830e8759e3ca5246795d844f9968496ae0567154c2d6646eecd6b5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/TypeNarrowingAnalysis.scala: src/main/scala/onion/compiler/typing/TypeNarrowingAnalysis.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TypeNarrowingAnalysis.extractNarrowing at line 51. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/TypeNarrowingAnalysis.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":"src/main/scala/onion/compiler/typing/TypeNarrowingAnalysis.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e88f8383c24759b76cdcb41cc586f71bebe0b52b4794cac026316609e970eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/StaticImportMethodCallSupport.scala: src/main/scala/onion/compiler/typing/StaticImportMethodCallSupport.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in StaticImportMethodCallSupport.resolveStaticImportMethodCall at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/StaticImportMethodCallSupport.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":"src/main/scala/onion/compiler/typing/StaticImportMethodCallSupport.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9bbbd20921e485efac2e9119fa3c315fe1384a6c9c374ed57a196a5e71359a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/StringInterpolationTyping.scala: src/main/scala/onion/compiler/typing/StringInterpolationTyping.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in StringInterpolationTyping.typeStringInterpolation at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/StringInterpolationTyping.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":"src/main/scala/onion/compiler/typing/StringInterpolationTyping.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e924268cf455e4859137ceda7a13de2e8392377a525a50cc033f15097ad9e4f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/typing/DestructuringPatternProcessor.scala: src/main/scala/onion/compiler/typing/DestructuringPatternProcessor.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DestructuringPatternProcessor.process at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/DestructuringPatternProcessor.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":"src/main/scala/onion/compiler/typing/DestructuringPatternProcessor.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8008ba3a31eb021bb9e66d454324f1ea3f0bf15c2b468fa38c925a532a93a4d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/onion/compiler/effects/EffectTable.scala: src/main/scala/onion/compiler/effects/EffectTable.scala changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EffectTable.parseLines at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/effects/EffectTable.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":"src/main/scala/onion/compiler/effects/EffectTable.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ded4d2f74790746017409508704ebd7d1f1efe2a78b1c18cd9b72e3ae12e6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/TypingDuplicationPass.scala: src/main/scala/onion/compiler/typing/TypingDuplicationPass.scala changed 27 times in last 90 days and 27 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is TypingDuplicationPass.run at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): a class-only file next to a same-named script compiles\u201D; \u201Cfix(typing): a user instance for a built-in Numeric type is E0097\u201D; \u201Cfix(typing): two unrelated interface defaults for one method are E0116\u201D; \u201Cfix(typing): an interface method over a final Object method is E0039\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/TypingDuplicationPass.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":"src/main/scala/onion/compiler/typing/TypingDuplicationPass.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4b27364ca4746c34259610b452f1e87168a0444a5c099a877589192804c00c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/Typing.scala: src/main/scala/onion/compiler/Typing.scala changed 33 times in last 90 days and 20 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is Typing.boxedClass at line 144), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): a lambda body with a type error is no longer compiled\u201D; \u201Cfix(typing): a bound inside a type-parameter bound ignores declaration order\u201D; \u201Cfix(typing): duplicate-instance E0097 names the instance as written\u201D; \u201Cfix(typing): a class-only file next to a same-named script compiles\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/Typing.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":"src/main/scala/onion/compiler/Typing.scala"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6adb7c194d5fcfdfc4f425062d8b6d82a60c60cb8faa99223c7ca3a2504526c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/MethodCallTyping.scala: src/main/scala/onion/compiler/typing/MethodCallTyping.scala changed 25 times in last 90 days and 19 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is MethodCallTyping.buildResolvedCall at line 217), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): copy(..) runs its receiver once\u201D; \u201Cfix(typing): a lambda\u0027s generic result takes the call\u0027s target type\u201D; \u201Cfix(typing): super.f((s) -\u003E ...) types the lambda from the superclass method\u201D; \u201Cfix(typing): a protected member needs a receiver of the calling class\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/MethodCallTyping.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":"src/main/scala/onion/compiler/typing/MethodCallTyping.scala"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"febcfa8080b03bb8540e89e8b03c6ac4ba2d5ef99716cf565221f054bce660b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/SemanticError.scala: src/main/scala/onion/compiler/SemanticError.scala changed 23 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is SemanticError.errorCode at line 421), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): two unrelated interface defaults for one method are E0116\u201D; \u201Cfix(typing): \u0060super.f()\u0060 on an abstract method is E0115, not AbstractMethodError\u201D; \u201Cfix(typing): an override that changes a primitive return type is E0103\u201D; \u201Cfix(diagnostics): E0103 spares a class that declares its own entrySet()\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/SemanticError.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":"src/main/scala/onion/compiler/SemanticError.scala"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8764d43a6471b7e32e60c1f6365b90a90170a9b942e7bc878b0f378f64972c97"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/LocalContext.scala: src/main/scala/onion/compiler/LocalContext.scala changed 16 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is LocalContext.getEffectiveType at line 452), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): a bare \u0060return\u0060 works in a lambda with an inferred result\u201D; \u201Cfix(contracts): hide a history\u0027s parameter bindings, not their names\u201D; \u201Cfix(contracts): a history guard reads the field, not a same-named parameter\u201D; \u201Cfix(typing): a default argument runs in the callee, so it sees fields and earlier parameters\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/LocalContext.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":"src/main/scala/onion/compiler/LocalContext.scala"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3460d081722501683a9736bbbc3999bb95d76ac3d6f1ea2cd2aeeec6d23ac57"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/verification/HistoryReproPhase.scala: src/main/scala/onion/compiler/verification/HistoryReproPhase.scala changed 16 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is HistoryReproPhase.run at line 28), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(contracts): an inherited E0112/W0021 names both classes and the override\u201D; \u201Cfix(contracts): an inherited n = n \u002B 1 that can overflow a subclass history is reported\u201D; \u201Cfix(contracts): a super call is checked against the overload it runs\u201D; \u201Cfix(contracts): a super call can no longer break a subclass history\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/verification/HistoryReproPhase.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":"src/main/scala/onion/compiler/verification/HistoryReproPhase.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c919b883189c9b5c1c07b0922b292c750ed9103ec668b04887d2569e9942a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala: src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala changed 9 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is SafeNavigationTypingSupport.typeSafeMethodCallWithNamedArgs at line 109), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): copy(..) runs its receiver once\u201D; \u201Cfix(typing): a private method via named args or a lambda is E0013\u201D; \u201Cfix(typing): named arguments run in the order they are written\u201D; \u201Cfix(typing): a named argument picks its overload by type, not name only\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.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":"src/main/scala/onion/compiler/typing/SafeNavigationTypingSupport.scala"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea599e602e17b688ac61f86820978deea14bf243ce9c520b5723395e1a5ac6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Files.java: src/main/java/onion/Files.java changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is Files.expandBraces at line 331), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(files): Files::glob matches zero directories for **/ inside braces\u201D; \u201Cfix(files): text readers drop a leading UTF-8 BOM\u201D; \u201Cfix(stdlib): Files::glob \u0027**/\u0027 also matches zero directories\u201D; \u201Cfix(files): copyDir reads symlink/.. the way the OS does\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Files.java\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":"src/main/java/onion/Files.java"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4798339b4901fb86bca1262c106dc9afc5f8a5571f90272f61724b9071db75f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala: src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is ClosedPredicatePhase.run at line 31), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(contracts): E0113 no longer says \u0022did not hold\u0022 for a predicate that never failed\u201D; \u201Cfix(contracts): building sample arguments counts as running the predicate\u201D; \u201Cfix(contracts): E0113 no longer says a predicate with parameters has none\u201D; \u201Cfix(contracts): narrow #2686 to the predicate-owner fix\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/verification/ClosedPredicatePhase.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":"src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8277833ed00be4e24e0aa90481175f81782414b0cb8c3ddccb1d5ac59088fc4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/MemberSelectionTypingSupport.scala: src/main/scala/onion/compiler/typing/MemberSelectionTypingSupport.scala changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is MemberSelectionTypingSupport.buildResolved at line 54), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): this in a lambda and an if/select join keep #2308 sound\u201D; \u201Cfix(typing): a raw receiver\u0027s inherited member stays at its bound\u201D; \u201Cfix(typing): a static sibling via explicit self.name no longer bypasses E0019\u201D; \u201Cfix(typing): a static sibling via a bare non-self selection reports E0019\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/MemberSelectionTypingSupport.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":"src/main/scala/onion/compiler/typing/MemberSelectionTypingSupport.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c8f9b616c1bdd9659c8b3cd2353665f2fdb64e76d4f4b54f95240b9082d37c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Archive.java: src/main/java/onion/Archive.java changed 9 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is Archive.checkFileTransfer at line 244), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stdlib): Archive::gzipFile/gunzipFile read /dev/stdin, /dev/null and pipes\u201D; \u201Cfix(stdlib): Archive::unzip refuses an entry that overwrites its archive\u201D; \u201Cfix(stdlib): Archive::zip refuses a zip path that is also a source file\u201D; \u201Cfix(archive): gzipFile/gunzipFile refuse the same source and target path\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Archive.java\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":"src/main/java/onion/Archive.java"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ced8839f1ba2f6dc5e77a122ce35f3b632d200fc67ba1405f99969d290c0806"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/TypingHeaderPass.scala: src/main/scala/onion/compiler/typing/TypingHeaderPass.scala changed 9 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is TypingHeaderPass.run at line 14), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): duplicate-instance E0097 names the instance as written\u201D; \u201Cfix(typing): a duplicate instance in one package is E0097, not E0008\u201D; \u201Cfix(typing): a class-only file next to a same-named script compiles\u201D; \u201Cfix(typing): two scripts with the same file name give E0008, not an internal error\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/TypingHeaderPass.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":"src/main/scala/onion/compiler/typing/TypingHeaderPass.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b1cd59286240b57a7d9863163a2a88507a6db15cb46f8a96aa35a1c16f0226"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/DateTime.java: src/main/java/onion/DateTime.java changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is DateTime.parse at line 81), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stdlib): DateTime::parse(text, pattern) honours an offset in the text\u201D; \u201Cfix(stdlib): DateTime::format and nowString accept zone letters\u201D; \u201Cfix(stdlib): DateTime::addDays keeps the offset in the repeated fall-back hour\u201D; \u201Cfix(stdlib): DateTime::addDays moves the calendar date across DST\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/DateTime.java\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":"src/main/java/onion/DateTime.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f034c228231d07c64bacf401f251f9fa6d1b0d38827ce80ab826780a40b28dae"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/MethodCallReportingSupport.scala: src/main/scala/onion/compiler/typing/MethodCallReportingSupport.scala changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is MethodCallReportingSupport.reportMethodNotFound at line 11), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(records): a shape named like a component gives one error, first\u201D; \u201Cfix(typing): nested lambda overloads compile fast again; migration docs\u201D; \u201Cfix(diagnostics): explain why 0xFFB no longer fits a Byte\u201D; \u201Cfix(diagnostics): a static call on a nested class names the outer method\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/MethodCallReportingSupport.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":"src/main/scala/onion/compiler/typing/MethodCallReportingSupport.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfbb69a46b8da7f21887843d8e5b6a3e59d755dd844cc61850705783c605e2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/TypeSubstitution.scala: src/main/scala/onion/compiler/typing/TypeSubstitution.scala changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is TypeSubstitution.substituteType at line 177), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): a call on \u0060this\u0060 sees the class\u0027s own type variables\u201D; \u201Cfix(typing): F-bound chains of any length, no \u0060!!\u0060 hint on a T slot\u201D; \u201Cfix(typing): super two levels up and B extends Box[T] keep their T\u201D; \u201Cfix(typing): this in a lambda and an if/select join keep #2308 sound\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/TypeSubstitution.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":"src/main/scala/onion/compiler/typing/TypeSubstitution.scala"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bef1917d052108bd8a4ee6d6bcf90ba5bb815f9b8bb1d8a06cafb5b5363da53"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/verification/BuildRun.scala: src/main/scala/onion/compiler/verification/BuildRun.scala changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is BuildRun.source at line 40), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(contracts): the Shape check also bounds time and checks interface defaults\u201D; \u201Cfix(contracts): the Shape round-trip check no longer runs a shape with outside effects\u201D; \u201Cfix(contracts): a Foo? sample argument counts, and a skipped replay says W0023\u201D; \u201Cfix(contracts): building sample arguments counts as running the predicate\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/verification/BuildRun.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":"src/main/scala/onion/compiler/verification/BuildRun.scala"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4156fa0ca0cff9fc0f85437e994debb268b70c08601b81237f32a09aa55210f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala: src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is AsmCodeGenerationVisitor.emitArgumentsWithDefaults at line 125), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): super.m() reaches an interface\u0027s default method\u201D; \u201Cfix(codegen): a field initializer\u0027s locals get their own slots\u201D; \u201Cfix(codegen): a reference cast to Byte/Short narrows the value\u201D; \u201Cfix(typing): a default argument runs in the callee, so it sees fields and earlier parameters\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.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":"src/main/scala/onion/compiler/backend/asm/AsmCodeGenerationVisitor.scala"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"054da5dbf74d5d6b142ea04b7bf302636302c015b6fd337225d479e09dbccf26"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/ControlExpressionTyping.scala: src/main/scala/onion/compiler/typing/ControlExpressionTyping.scala changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is ControlExpressionTyping.typeIfExpression at line 95), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): a lambda ending with a do/while or labelled loop runs it\u201D; \u201Cfix(tco): sink the unbox of an if result in the tail-call pass, not typing\u201D; \u201Cfix(tco): \u0060= if c { boxed } else { f(..) }\u0060 loops instead of overflowing\u201D; \u201Cfix(tco): expression-body rewrite keeps a captured var\u0027s last store\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/ControlExpressionTyping.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":"src/main/scala/onion/compiler/typing/ControlExpressionTyping.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb234cfda44266c30787d3631b59323d4ecef12e4e42734402fba5648c647469"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/CapturedVariableScanner.scala: src/main/scala/onion/compiler/CapturedVariableScanner.scala changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is CapturedVariableScanner.findReferencedVariables at line 95), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): a lambda with a shared parameter keeps its inferred result type\u201D; \u201Cfix(codegen): a try-with-resources binding read inside a lambda no longer fails verification\u201D; \u201Cfix(typing): a catch variable used inside a lambda no longer fails verification\u201D; \u201Cchore(compiler): fix deprecated mutable Set -- usage in CapturedVariableScanner\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/CapturedVariableScanner.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":"src/main/scala/onion/compiler/CapturedVariableScanner.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d793000f3ff81d9d881aac3d44475d15e3cfb97781aeb0bdd1fce93eb9cb9468"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Future.java: src/main/java/onion/Future.java changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is Future.rootMessage at line 265), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(future): await() no longer hangs on a cyclic cause chain\u201D; \u201Cfix(stdlib): a failed Future.await() names why the task failed\u201D; \u201Cfix(stdlib): Future::delay completes at once for a negative delay\u201D; \u201Cfix(stdlib): Future::first() with no futures errors instead of hanging\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Future.java\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":"src/main/java/onion/Future.java"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1506be08775d97d3a23a7e66c1f195b59126e2f07f967097beaeeb19df1296"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/MethodInvocationBuilderSupport.scala: src/main/scala/onion/compiler/typing/MethodInvocationBuilderSupport.scala changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is MethodInvocationBuilderSupport.boxedSimpleName at line 46), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typeclass): a [T: Numeric] method works from a class file or jar\u201D; \u201Cfix(typeclass): key instances on the type\u0027s full name, not its simple name\u201D; \u201Cfix(typeclass): one instance per trait and type across modules\u201D; \u201Cfix(typeclass): find an instance by its trait, not its simple name\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/MethodInvocationBuilderSupport.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":"src/main/scala/onion/compiler/typing/MethodInvocationBuilderSupport.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9eba6766ec3e09c52028204ee2de6102305f0a91af08e09c5fca7c994ec4b02"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Strings.java: src/main/java/onion/Strings.java changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is Strings.truncate at line 210), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stdlib): Strings::chars and truncate keep an emoji whole\u201D; \u201Cfix(stdlib): an empty delimiter splits \u0022abc\u0022 into [a, b, c] again\u201D; \u201Cfix(stdlib): Strings::split and Regex::split keep trailing empty fields\u201D; \u201Cfix(stdlib): Strings::toDoubleOrNull rejects Java literal forms\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Strings.java\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":"src/main/java/onion/Strings.java"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7f248bb24d61bf9f858c61419c8f913aaa3e542c97b7c109d8aaf183c0f12f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Regex.java: src/main/java/onion/Regex.java changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is Regex.captureGroup at line 47), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stdlib): Regex::matchGroups and captureGroup name the call in their errors\u201D; \u201Cfix(stdlib): an empty delimiter splits \u0022abc\u0022 into [a, b, c] again\u201D; \u201Cfix(stdlib): Strings::split and Regex::split keep trailing empty fields\u201D; \u201Cfix(stdlib): Regex invalid-pattern methods report their own message, not raw JDK text\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Regex.java\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":"src/main/java/onion/Regex.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"84808f3421d626bc29e10c7dfc90aba4dc0d4349f9a7580a6fb8102eed808e69"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Args.java: src/main/java/onion/Args.java changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is Args.parse at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(args): toString shows the reading positional() gives; docs say ask flags first\u201D; \u201Cfix(args): intOption rejects a non-integer value instead of using the default\u201D; \u201Cfix(stdlib): Args::parse keeps the first file in \u0027--verbose a.txt b.txt\u0027\u201D; \u201Cfix(stdlib): Args::parse reads --name -5 as a negative value, not a lost flag\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Args.java\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":"src/main/java/onion/Args.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc5b77a667080570157fb8ef955004a12a6dfb53fb96196f19c82a21e82792c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/toolbox/TypeFormatting.scala: src/main/scala/onion/compiler/toolbox/TypeFormatting.scala changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is TypeFormatting.sourceForm at line 90), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(diagnostics): E0077 names an extension call \u0060String.shout\u0060\u201D; \u201Cfix(diagnostics): name an instance call Owner.method in E0106/E0077\u201D; \u201Cfix(effects): E0077 names a default argument by its method\u201D; \u201Cfix(diagnostics): the List-to-array cast hint suggests only code that compiles\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/toolbox/TypeFormatting.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":"src/main/scala/onion/compiler/toolbox/TypeFormatting.scala"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ccd45a73e8527dd574bb13fc4f8877c32ebbc6f863d5ea9c99a09f2a37697e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Concurrent.java: src/main/java/onion/Concurrent.java changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is Pool.mapAll at line 117), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stdlib): Pool, Db/Net connections, Listener and Server work in try-with-resources\u201D; \u201Cfix(future): await() no longer hangs on a cyclic cause chain\u201D; \u201Cfix(stdlib): Concurrent pool submit/mapAll after close() reports a clean message\u201D; \u201Cfix(stdlib): Channel::receive returns null once a closed channel is drained\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Concurrent.java\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":"src/main/java/onion/Concurrent.java"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9773e0da15df10e55fb3067a6b69d38f819903a8fbf50956d4a061472b44ca2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Codec.java: src/main/java/onion/Codec.java changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is Codec.base64Decode at line 24), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stdlib): Codec errors name an emoji whole, not half a pair\u201D; \u201Cfix(http): Http::decodeUrl names a bad % escape like Codec::urlDecode\u201D; \u201Cfix(codec): base64Decode skips a leading BOM and names bad chars as U\u002BXXXX\u201D; \u201Cfix(stdlib): Codec::base64Decode skips whitespace and names bad input\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Codec.java\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":"src/main/java/onion/Codec.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb518773caff310d0082251b6c65871b1737e104774ccf316cc5b26f995d794"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/ArgumentHelpers.scala: src/main/scala/onion/compiler/typing/ArgumentHelpers.scala changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is ArgumentHelpers.evaluateInWrittenOrder at line 165), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): out-of-order named calls keep @TailRecursive groups loops\u201D; \u201Cfix(typing): named arguments run in the order they are written\u201D; \u201Cfix: block-wrapped lambda { x -\u003E ... } infers param type in non-trailing position\u201D; \u201Cfix(diagnostics): suggest the right parameter name on E0043\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/ArgumentHelpers.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":"src/main/scala/onion/compiler/typing/ArgumentHelpers.scala"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2efb360582e6cea27a9d4df7aa8b1c3bf78d3d8582c29dec6ef507a4d802718"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/ContractFramingPass.scala: src/main/scala/onion/compiler/typing/ContractFramingPass.scala changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ContractFramingPass.checkWrites at line 49), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(contracts): a history or invariant may extend a generic Onion class\u201D; \u201Cfix(contracts): E0110 points at the field a clause names\u201D; \u201Cfix(contracts): \u0060t\u002B\u002B\u0060 in a lambda is a write through \u0060this\u0060, not E0110\u201D; \u201Cfix(contracts): a contract field is written only through this (E0110)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/ContractFramingPass.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":"src/main/scala/onion/compiler/typing/ContractFramingPass.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"87577cc7cfce0ad81ddb4247d5006b21317771b4a5d8d543fbce534ac95727d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Server.java: src/main/java/onion/Server.java changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is Server.start at line 189), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stdlib): a HEAD request to a Server route no longer logs a JDK warning\u201D; \u201Cfix(stdlib): Pool, Db/Net connections, Listener and Server work in try-with-resources\u201D; \u201Cfix(net): Server.dispatch() answers 500 for a thrown Error, not just RuntimeException\u201D; \u201Cfix(server): make onion.Server\u0027s internal dispatcher thread a daemon\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Server.java\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":"src/main/java/onion/Server.java"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d762633b04e7d56c4e4bbce7de09a75093853dd07a744acc0e7792c4c52c769"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/ContractPurityPass.scala: src/main/scala/onion/compiler/typing/ContractPurityPass.scala changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is ContractPurityPass.run at line 20), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(contracts): E0106 underlines the impure call, not a same-named one\u201D; \u201Cfix(diagnostics): name an instance call Owner.method in E0106/E0077\u201D; \u201Cfix(contracts): E0106 points at the impure call, not at \u0060def\u0060\u201D; \u201Cfix(contracts): dispatch and static initializers count toward W0023\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/ContractPurityPass.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":"src/main/scala/onion/compiler/typing/ContractPurityPass.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e85858bdad224fe4895d81407860c1be06d106353312f07fd93f781981fe92"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/MemberSelectionResolutionSupport.scala: src/main/scala/onion/compiler/typing/MemberSelectionResolutionSupport.scala changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is MemberSelectionResolutionSupport.resolveMemberSelection at line 49), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): a protected member needs a receiver of the calling class\u201D; \u201Cfix(diagnostics): hint to copy a top-level var to a local on E0070\u201D; \u201CFix I0000 crash: safe member-selection on nullable primitive\u201D; \u201Cfix(typing): resolve zero-arg extension methods in property-style access\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/MemberSelectionResolutionSupport.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":"src/main/scala/onion/compiler/typing/MemberSelectionResolutionSupport.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"af72651e2abc8bad012354c65241becfc867a9721b67283503a1c706dd0489bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/DefaultScheduling.scala: src/main/scala/onion/compiler/typing/DefaultScheduling.scala changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is DefaultScheduling.stronglyConnected at line 51), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): the held-back default hint lists everything to move\u201D; \u201Cfix(typing): defaults that call each other are typed in declaration order\u201D; \u201Cfix(typing): a same-named held-back call holds a default back too\u201D; \u201Cfix(typing): an import alias holds a default back; say why at the call\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/DefaultScheduling.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":"src/main/scala/onion/compiler/typing/DefaultScheduling.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cbfadf61cfc2da23f0036128da96c57b2325a2e24f637c6d0e744e33e45af2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Iterables.java: src/main/java/onion/Iterables.java changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is Iterables.exists at line 91), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stdlib): map/filter on a range or map.values() return a List\u201D; \u201Cfix(stdlib): m.mapMap(f) keeps the map\u0027s insertion order\u201D; \u201Cfix(stdlib): set.map { } keeps insertion order like Sets::map\u201D; \u201Cfix(stdlib): Iterables::take/drop clamp a negative count instead of throwing\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Iterables.java\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":"src/main/java/onion/Iterables.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dc4fbf2965c239eb34ce56a3ad06942d1078592ea4a1f90a9e5c692850f94e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Config.java: src/main/java/onion/Config.java changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is Config.get at line 48), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stdlib): Config::get reads any Map or List, not only parsed JSON\u201D; \u201Cfix(stdlib): Config::get returns null for an index too big for an Int\u201D; \u201Cfix(stdlib): Config::getInt and getLong return the default for a number that does not fit\u201D; \u201Cfix: Config::getBoolean now falls back to default for unconvertible values\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Config.java\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":"src/main/java/onion/Config.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"989a09f5e76433f8860e4deae31d72d749a5e80c3e893bc145bfa3f18d835383"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Timing.java: src/main/java/onion/Timing.java changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is Timing.formatNanos at line 65), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stdlib): Timing::sleep returns at once for a negative duration\u201D; \u201Cfix(stdlib): Timing::formatNanos/formatMillis roll over at the unit boundary\u201D; \u201Cfix(stdlib): Timing::formatNanos/formatMillis ignore the JVM locale\u201D; \u201Cfix: Timing::formatNanos docs claimed \u0022\u03BCs\u0022, implementation emits \u0022us\u0022\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Timing.java\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":"src/main/java/onion/Timing.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05fa4f62dd01d90a9bb7d83840794cc500f47f4cb93c1192c2ca83d856e3ec5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/backend/asm/ClosureCodegen.scala: src/main/scala/onion/compiler/backend/asm/ClosureCodegen.scala changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is ClosureCodegen.generateBridgeMethod at line 180), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): a lambda can implement UnaryOperator and BinaryOperator\u201D; \u201Cfix(codegen): an error in a lambda is reported at the lambda\u0027s line\u201D; \u201Cfix: prevent I0000 crash when ASM can\u0027t resolve a same-unit class\u0027s superclass\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/backend/asm/ClosureCodegen.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":"src/main/scala/onion/compiler/backend/asm/ClosureCodegen.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1eebf89e7f1dc186e1798b7d5d1821f3140272e71a3d749cf179ef8d8019aa8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/rewrite/AdtEnumLowering.scala: src/main/scala/onion/compiler/rewrite/AdtEnumLowering.scala changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is AdtEnumLowering.lower at line 32), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(contracts): a clause on an extension, enum, interface or abstract method is checked\u201D; \u201Cfix(diagnostics): an error in an ADT enum case points at that case\u201D; \u201Cfix(diagnostics): give three uncoded compile errors real E-codes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/rewrite/AdtEnumLowering.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":"src/main/scala/onion/compiler/rewrite/AdtEnumLowering.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bf6ffefc777e2caa002abe3a83530fd59b14a03317e50026cab6e7a3e31f24"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/TypeSubstHelpers.scala: src/main/scala/onion/compiler/typing/TypeSubstHelpers.scala changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is TypeSubst.specializeFromScrutinee at line 103), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): null to a bare T inside its generic class does not warn\u201D; \u201Cfix(typing): a slot typed T accepts only a T, as in Java\u201D; \u201CFix: destructuring a generic record loses its type argument\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/TypeSubstHelpers.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":"src/main/scala/onion/compiler/typing/TypeSubstHelpers.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"303455c1272d110a8ec8b182382846bf480b95513b37835d7765aa6474d884cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Shapes.java: src/main/java/onion/Shapes.java changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is RegexShape.parse at line 164), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(shape): a json shape\u0027s Defect.origin() names the field\u0027s own line\u201D; \u201Cfix(compiler): shape re\u0022...\u0022 no longer warns W0012 on its own synthesized null\u201D; \u201Cfix(record): shape name = re\u0022...\u0022 accepts a nullable (T?) component\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Shapes.java\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":"src/main/java/onion/Shapes.java"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4462540d45cc55a988136bfe543e65aaa2fb53cc3d8947aa387cf0d34bd3f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/OverrideContractPass.scala: src/main/scala/onion/compiler/typing/OverrideContractPass.scala changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is OverrideContractPass.checkClass at line 41), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(contracts): W0025 checks every ancestor, renamed parameters, no statics\u201D; \u201Cfix(contracts): a history or invariant may extend a generic Onion class\u201D; \u201Cfix(contracts): an override with no contract is checked against the inherited ensures\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/OverrideContractPass.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":"src/main/scala/onion/compiler/typing/OverrideContractPass.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e665797a877ad7c50ac2dbc5be267f1933db55fed18d76dbf1dae47740ffec43"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/FileResource.java: src/main/java/onion/FileResource.java changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is FileResource.describe at line 114), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(shape): a defect with no path drops \u0060: :\u0060; a missing file says why\u201D; \u201Cfix(files): text readers drop a leading UTF-8 BOM\u201D; \u201Cfix: FileResource#read(Shape)\u0027s Javadoc was orphaned above readLossless\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/FileResource.java\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":"src/main/java/onion/FileResource.java"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b685cab30e195e6ec7bdcde47193a7130cb9ed0f3dad1d74e1576b2d1689072"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/typing/CallableValueCallSupport.scala: src/main/scala/onion/compiler/typing/CallableValueCallSupport.scala changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is CallableValueCallSupport.resolveCallableValue at line 17), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typing): a function field called as f() inside a lambda runs\u201D; \u201Cfix(typing): calling a top-level var function as g() no longer crashes\u201D; \u201Cfix: nullable callable value invoked directly reports E0070 instead of E0005\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/typing/CallableValueCallSupport.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":"src/main/scala/onion/compiler/typing/CallableValueCallSupport.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5297e880991c19909cb17d00b67c5fe1a3deda3aa99c509c139b904f5c51b73a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Net.java: src/main/java/onion/Net.java changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is Conn.readLine at line 134), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(net): readLine after a read timeout returns the whole line\u201D; \u201Cfix(stdlib): Pool, Db/Net connections, Listener and Server work in try-with-resources\u201D; \u201Cfix(net): Conn.readBytes() no longer loses bytes after a readLine()\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Net.java\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":"src/main/java/onion/Net.java"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d633c525c0baef59ba9fa05d628bf75876e7f9ba56fc7a0bf7e4479a64fa67ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/scala/onion/compiler/verification/ShapeContractPhase.scala: src/main/scala/onion/compiler/verification/ShapeContractPhase.scala changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is ShapeContractPhase.roundTrip at line 150), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(contracts): the Shape check runs only the methods that implement Shape\u201D; \u201Cfix(contracts): the Shape check also bounds time and checks interface defaults\u201D; \u201Cfix(contracts): the Shape round-trip check no longer runs a shape with outside effects\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/onion/compiler/verification/ShapeContractPhase.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":"src/main/scala/onion/compiler/verification/ShapeContractPhase.scala"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"043048c167c0a8d8ee856561b05bab9f08ea27acb1556da39a5495d106b4afc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/java/onion/Format.java: src/main/java/onion/Format.java changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is Format.duration at line 80), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stdlib): Format::number/fixed/percent no longer print negative zero\u201D; \u201Cfix(stdlib): Format::number/integer/duration garble non-finite and MIN_VALUE input\u201D; \u201Cfix(diagnostics): rank E0005 suggestions by what the call can reach (F15)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 16:33:04 \u002B09:00\u0027 --until=\u00272026-11-17 16:33:04 \u002B09:00\u0027 --full-history --no-merges -- src/main/java/onion/Format.java\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":"src/main/java/onion/Format.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6877faff8175447733ea2b6d00af2d6343ad5bc3ad208126cf9e636bb5781836"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (75172 LoC, 932 module-visible types across 39 directories) overshoots its size bounds. 1 of 3 build unit(s) (Python, npm, sbt) overshoot their size bounds, lowering Project Cohesion to 3.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build.sbt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f60f42d0291794c78c37e89499fa9d6a9731441282cba711d18ea0b8787006"}},{"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":"23a3c153922061d8b6a12cb06526c89608d55d517be1e8a1ebe36191f905cd33"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"0aa40207f4235d9e02b70e9248c9800d00440cfd4f079aed28deea71e7b3c198"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"c264f87e07310bb82d85f643b6a371f8d870cd1bf50ec6192b9d75b764d925f3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"06907f0626eefb160ccda935ace891c485599ce8333ef458550d4793a3f088f0"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"0ec763bca2f6375c73c6e54f09fe27f38afb4a5f5f8655056585504cd458c3f4"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"360f2ae12aeb71042ba6bdd36217cb68c0ced50d57fe962d1af40c67351c52a5"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"f5847804a620aef526e8059f2a66f1dfd01419e74da9ae0a8404a55b67c3cdcc"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"99d1d60052d5fa003fb50fc54e3806b19cdd313008e4e4e605977da369a45c5b"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"7250a41b493f887ca7e9aa4b1ed742f4dc46c9e4bb632284d03fd0993d610c63"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"aad8d32bf8aa4d239f81d8c0c1771a9ef1b95a680806708e8378f5d014d3b743"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"02fb7177b069c3af38833085fae90e36f111ccfe12d09dfaacef49eaec4e69a9"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"5be03ab325ce0dd57044d4e411f1428508ecf7870bea56774afff406be2e7ce3"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"6461481a5c5a671bc46dfd6b4e31ca4416b7d95cc843a13be8bab5f04b3789de"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"4e5029020df57fb6526e5c5c0829575b8ae66519818739da85e06e7441481ea8"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"75369c09bb288495c1ec96550eb2aa9585bb73f2d0abcdd876376a94900b52cc"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"075e4f2ebead1d858c0623e59e3fa637f37079b71d275a966e23073acc84b803"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"7adc332f2d68b4a8e35c8868ce3df7038dc1a68ece15e2a5c16dee165f7a002c"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"98cbf36f5df45c67046ff2890252a51ac3de36a8ef0cc57999f1745455d04b8a"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"4bed3cb3f68fe81d614ae0516f48fd89c9bee1d8be0e388c43588c08593ee777"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"bad769d18b10c03d131bbfd3e779d0bb14cfbe683e68d6a5d8e0fdb9ec137b8c"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"5c9ac337f9a431205ea546cc4fd61b2f5bf1523d9f37691f7d2d4bcef276b417"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"9efa139c9272f0d4236b472299f9a7a54983055f01cacf411f72cacab29a389b"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"c2bf1727e14210836212063eb2dad9c0a4c18d254117f69803ea5d25f945291b"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"bf49614a0793f96aa7a551db4533f154aa03c8a0032bcac875df8e98e69d8dfb"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"bfbff10a80a05cafeb1fc389ef45e77c0c0b8fae25d6ddfb8b3fb7ef512073c8"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"eb16f185395628e055f301a19610216d43995e67133c272a4235f92dae18d23d"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"63bea608fd98974a5a312ed989a52706c988bfdbb0e401f0928bf7ee4f23d1b9"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"08fcfb53fa0d56de3ca852f28500198ccc2d691648b64a5659af5bf0aec2a5f1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"cac833688b0a7f469df8b1f34d42c9ee6bcbbe117aa304b2dad5cb751ff50ec3"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"0e10b2d5284ef46894ac809bd68310f260ff91597d719b797bd4c09214b139ac"},"taxa":[{"id":"CWE-330","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"1fd85623bfd8639f7441a1577b2e005f984ae3c96d59c326e9c93133bb9c506f"},"taxa":[{"id":"CWE-330","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","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":"545671a76d9ae4b4d3c8fab347eda1c6d73cd6aeeab3d809c311c05950c31b71"},"properties":{"dependency":{"package":"@azure/msal-node","version":"5.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"7.1.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"449b5cf800d6d53cbb382f2e5ca8a842117db4ead6cb1f35794e3d89851278e9"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.1.6","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"d8a9bc3e74b9a4679472f158849a2660acbfaa9c7f416e4c3a431bfa6d83a7ee"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.3.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"bcbb5c7643f105030bbf39c1b47d011450e80c4b00aba8cf65d02252e72f30e3"},"properties":{"dependency":{"package":"markdown-it","version":"14.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"14.3.3","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"0a0c1c520682075cb021f55e4da3968f2eed0230d0296a8d3629ed942894827c"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"5.0.10","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"702534543d8cab72d69a35e3dea43bac8c7d10228a2184fa1dfe1af1b3114fa8"},"properties":{"dependency":{"package":"undici","version":"7.28.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"7.30.1","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"a18fc9315d4da1ccd28aff6828624fbb03c77f793b57b1a2de14a791bcce3961"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"03b370c3ca0de3cd22bd1c23e2174b62af79994bd6aad35229acee83dc05eb70"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"e4f1e2ff167748c4081b6fe7483a0eebd54f8f9ed3dad583629fecf57f6c2d7c"},"properties":{"dependency":{"package":"qs","version":"6.15.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"6.16.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"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"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"c84ac69efbb55b7dc7de41de5f38a500016a15e76769114daf0a907559216fd4"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"b44956ebdcdb68739cc91d3524a075a4e2d87d1d382db4a6954b85615c9cc249"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"a4f77715bd3c9b0dfa4487f473e48f82f80b947eb5552858bb5e5e58942a2a00"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: ASTBuilder (18 abstract members): \u0060ASTBuilder\u0060 declares 18 abstract members: \u0060createCompilationUnit\u0060, \u0060createModuleDeclaration\u0060, \u0060createImportClause\u0060, \u0060createClassDeclaration\u0060, \u0060createInterfaceDeclaration\u0060, \u0060createRecordDeclaration\u0060, \u0060createMethodDeclaration\u0060, \u0060createTypeParameter\u0060, \u0060createConstructorDeclaration\u0060, \u0060createFieldDeclaration\u0060, \u0060createBlockExpression\u0060, \u0060createBinaryExpression\u0060, \u0060createUnaryExpression\u0060, \u0060createLiteral\u0060, \u0060createIdentifier\u0060, \u0060createTypeNode\u0060, \u0060createArgument\u0060, \u0060createAccessSection\u0060. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/ASTBuilder.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5750208c0dff9dfbb3c9f041acdddda64a6cad48218a7b4e7103137cd128f33a"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: TypedASTVisitor[T] (54 abstract members): \u0060TypedASTVisitor[T]\u0060 declares 54 abstract members: \u0060visitArrayLength\u0060, \u0060visitDefaultArgument\u0060, \u0060visitRefArray\u0060, \u0060visitSetArray\u0060, \u0060visitBegin\u0060, \u0060visitBinaryTerm\u0060, \u0060visitBoolValue\u0060, \u0060visitByteValue\u0060, \u0060visitCall\u0060, \u0060visitCallStatic\u0060, \u0060visitCallSuper\u0060, \u0060visitSafeCall\u0060, \u0060visitSafeStaticExtensionCall\u0060, \u0060visitSafeRefArray\u0060, \u0060visitNonNullAssert\u0060, \u0060visitSafeFieldAccess\u0060, \u0060visitAsInstanceOf\u0060, \u0060visitCharacterValue\u0060, \u0060visitDoubleValue\u0060, \u0060visitFloatValue\u0060, \u0060visitInstanceOf\u0060, \u0060visitIntValue\u0060, \u0060visitListLiteral\u0060, \u0060visitMapLiteral\u0060, \u0060visitRefLocal\u0060, \u0060visitSetLocal\u0060, \u0060visitNewClosure\u0060, \u0060visitLongValue\u0060, \u0060visitRefField\u0060, \u0060visitSetField\u0060, \u0060visitNewObject\u0060, \u0060visitNewArray\u0060, \u0060visitNewArrayWithValues\u0060, \u0060visitNullValue\u0060, \u0060visitShortValue\u0060, \u0060visitRefStaticField\u0060, \u0060visitSetStaticField\u0060, \u0060visitStringValue\u0060, \u0060visitOuterThis\u0060, \u0060visitThis\u0060, and 14 more. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/TypedASTVisitor.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"48774237b21516cf4fd9f1140b49db2d935dbe30319340793bb838da5d6b4bcd"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060emitNOP\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/backend/asm/ControlFlowEmitter.scala"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7973708fd889c38e0e5f33afe43ddfcdd698d6a22b331722c1d78775f72a12"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 399 JVM, JavaScript/TypeScript production file(s) this check read across 2 module(s). Each was searched for its ecosystem\u0027s logging libraries (JVM: SLF4J, Log4j2, java.util.logging, Logback, kotlin-logging, scala-logging; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060vscode-onion/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vscode-onion/package.json"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bd3d431e9a5f573ece07680095292a32f12fe43646b85bc9ca0ebb8aa39ca7"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/release.yml"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository runs an HTTP server and nothing in its Scala source or committed configuration secures the transport: no HTTPS served (akka/pekko-http \u0060ConnectionContext.httpsServer\u0060/\u0060enableHttps\u0060, an http4s builder\u0027s \u0060withTLS\u0060, Jetty\u0027s \u0060SslContextFactory\u0060, zio-http\u0027s \u0060SSLConfig\u0060, Play\u0027s \u0060https.port\u0060), no \u0060Strict-Transport-Security\u0060 header, HSTS middleware or Play \u0060RedirectHttpsFilter\u0060, no \u0060X-Forwarded-Proto\u0060 read or Play \u0060play.http.forwarded.trustedProxies\u0060 for a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: src/main/java/onion/Server.java:220 \u2014 \u0060HttpServer.create\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is set on a response this repository\u0027s Scala server sends \u2014 defense in depth, even when a proxy could set them. (\u22122.0 on this card.) The server: src/main/java/onion/Server.java:220 \u2014 \u0060HttpServer.create\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"S1","level":"note","message":{"text":"No inbound request validation detected: No handler of this repository\u0027s Scala server answers 400, 413 or 422 (\u0060BadRequest\u0060, \u0060StatusCodes.BadRequest\u0060, \u0060Status.BadRequest\u0060, \u0060UnprocessableEntity\u0060), and nothing declares validation \u2014 no Play \u0060Form(mapping(\u2026))\u0060 or \u0060validate[T]\u0060, no tapir \u0060Validator\u0060, no akka/pekko-http \u0060validate(\u2026)\u0060 or \u0060withSizeLimit\u0060, no validation library (refined, iron, accord, cats \u0060Validated\u0060, Jakarta Bean Validation) \u2014 nothing shows inbound requests being checked, and refused, before a handler acts on them. A check that answers its failure with 200 and an error body is not seen. (\u22122.0 on this card.) The server: src/main/java/onion/Server.java:220 \u2014 \u0060HttpServer.create\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0ffa303f3c9cef4b4c2cf028a78ce2f3c83f6078f80716eea7362fad047265eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rendered.indexOf(\u0027\\n\u0027) \u003E= 0 || rendered.indexOf(\u0027\\r\u0027) \u003E= 0\u0060 appears character-identically in 2 files \u2014 src/main/java/onion/ConfigShape.java, src/main/java/onion/LineShape.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/ConfigShape.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"facfa62e2abb4d3d5109b6e53285d0a9022b88279787a7c4daf899329895904e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(args \u0026\u0026 args.jar) || \u0027/tmp/onion-latest.jar\u0027\u0060 appears character-identically in 2 files \u2014 .claude/workflows/onion-fix-verify.js, .claude/workflows/onion-gap-probe.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/workflows/onion-fix-verify.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c29978bdf16d8816f8683e5300bcd2206e9bf503000c8af40bb5243b463a26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Modifier.isAbstract(m.modifier) \u0026\u0026 m.arguments.length == arity\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala, src/main/scala/onion/compiler/typing/TypingOutlinePass.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/backend/asm/AsmCodeGeneration.scala"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cef816070a3e5f5c4af9dcc887b3222077540baf61473973cab79f8a5136b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!condReassigned.contains(name) \u0026\u0026 !branchReassigned.contains(name)\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/typing/BlockElementLowering.scala, src/main/scala/onion/compiler/typing/ControlExpressionTyping.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/BlockElementLowering.scala"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f5653fad9fd3a855c9e0aebd3dc7a3c4104e5799c0cd491a13144a7c190451"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!expected.isBasicType \u0026\u0026 actual.isBasicType\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala, src/main/scala/onion/compiler/typing/TypeRelations.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5fa8cdd40924b20f05a0de85c0f765c5a39beb986ff80bb6e4013a1df0ca6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!filled(i) \u0026\u0026 argsWithDefaults(i).defaultValue.isEmpty\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala, src/main/scala/onion/compiler/typing/ConstructionTyping.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"124340b5f58da14b340e94e467481085234ac178063cdf8925cd0185996ae2cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!method.isVararg || expectedArgs.isEmpty\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala, src/main/scala/onion/compiler/typing/CallOverloadSupport.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f693b8e20392ca02d0fc7974ad4f4235f545510eef6d07aa42184abe21919dbb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!raw.isInstanceOf[AppliedClassType] \u0026\u0026 raw.typeParameters.nonEmpty\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/typing/ConstructionTyping.scala, src/main/scala/onion/compiler/typing/TypeSubstHelpers.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ConstructionTyping.scala"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"664122a77379f1c5cf9ad12af622d492994fecd37e870f452db5fdcdfa170863"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!result.hasErrors \u0026\u0026 success.options.contains(SHOW_EFFECTS)\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/tools/CompilerFrontend.scala, src/main/scala/onion/tools/ScriptRunner.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/CompilerFrontend.scala"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"db04176a311cbf0ecf39b0603ef1f499249bbb080061ef71843d9bfc3ad7b199"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Files.isSymbolicLink(normalized) || !Files.isDirectory(normalized, NOFOLLOW_LINKS)\u0060 appears character-identically in 3 files \u2014 src/main/scala/onion/tools/project/BuildOutputTransaction.scala, src/main/scala/onion/tools/project/FileTree.scala, src/main/scala/onion/tools/project/ProjectBuilder.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/project/BuildOutputTransaction.scala"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51116327f72555e7b0bfc1342287bc20eaec3475e736c6bed13f48203e1fca8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Modifier.isAbstract(m.modifier) \u0026\u0026 !isPublicObjectMethod(m)\u0060 appears character-identically in 4 files \u2014 src/main/scala/onion/compiler/typing/ClosureTyping.scala, src/main/scala/onion/compiler/typing/ConstructionTyping.scala, src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala, src/main/scala/onion/compiler/typing/FunctionalInterfaces.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d4a5e031fedddd5eb0f480b247a12009012ed48ae991ec84719a355e817dd7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060actual != null \u0026\u0026 !actual.isNullType \u0026\u0026 !actual.isBottomType\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/typing/CallOverloadSupport.scala, src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/CallOverloadSupport.scala"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"35390482856ff693452c9c9f3d554ad8afe81eb14152d8b26e1c23d123af9195"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bt != BasicType.VOID \u0026\u0026 typing.boxedTypeArgument(bt).name == ct.name\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/typing/DuplicationChecks.scala, src/main/scala/onion/compiler/typing/ExtensionShadowCheck.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/DuplicationChecks.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daf7223189751383fa01272a2bb5c35e373d5ce631e9d8111b56e8c84146d93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.contracts != ContractMode.Check || !config.runContracts\u0060 appears character-identically in 3 files \u2014 src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala, src/main/scala/onion/compiler/verification/HistoryReproPhase.scala, src/main/scala/onion/compiler/verification/ShapeContractPhase.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ba8dfdbfa83b6da9dc22605ae3a49a9d1d677a8392a298458532f6773fa9ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expected != null \u0026\u0026 !expected.isBottomType \u0026\u0026 expected != BasicType.VOID\u0060 appears character-identically in 3 files \u2014 src/main/scala/onion/compiler/typing/ExpressionFormTyping.scala, src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala, src/main/scala/onion/compiler/typing/TryExpressionTyping.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ExpressionFormTyping.scala"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fc8e9d3b6f9608edf91edf423cb8422a0e663974986b095954cd2711ee8d6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expected.isBasicType \u0026\u0026 !actual.isBasicType\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala, src/main/scala/onion/compiler/typing/TypeRelations.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2c21a1adb8c844a58ecaa207b715a4b62d29dcfce142f387ac64c01b886b59"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060field != null \u0026\u0026 MemberAccess.isMemberAccessible(field, bodyContext.definition, targetType)\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/typing/AssignmentTyping.scala, src/main/scala/onion/compiler/typing/MemberSelectionResolutionSupport.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/AssignmentTyping.scala"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"26caaad84e64f73ce1073ce23637e8523d49b6102d81b7517d8f0f03468a766d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060group.nonEmpty \u0026\u0026 artifact.nonEmpty \u0026\u0026 version.nonEmpty\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/tools/ScriptDirectives.scala, src/main/scala/onion/tools/project/ProjectBuilder.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/ScriptDirectives.scala"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c070d6157bbb020803e6adc1dd1d058d0df3a870ef6ed6fef7df774d7377971c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index.isBasicType \u0026\u0026 index.\u0060type\u0060.asInstanceOf[BasicType].isInteger\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/typing/AssignmentTyping.scala, src/main/scala/onion/compiler/typing/ConstructionTyping.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/AssignmentTyping.scala"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc1e659e552def23c6f3183d8c45d467adea85729784082613ea208746d180b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lastParamType.isArrayType \u0026\u0026 TypeRules.isSuperType(varargType, lastParamType)\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala, src/main/scala/onion/compiler/typing/MethodResolutionSupport.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/CallArgumentTypingSupport.scala"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4dd90d29b8eaffc19f837fe8e1a5f7a693f45b601d77dd4f214613fcf677cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060m.arguments.length == 1 \u0026\u0026 m.arguments(0).name == \u0022java.lang.Object\u0022\u0060 appears character-identically in 4 files \u2014 src/main/scala/onion/compiler/typing/ClosureTyping.scala, src/main/scala/onion/compiler/typing/ConstructionTyping.scala, src/main/scala/onion/compiler/typing/ExtensionMethodFallbackSupport.scala, src/main/scala/onion/compiler/typing/FunctionalInterfaces.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ClosureTyping.scala"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e44c3c9658b2ed127109acecd337e575c8784df6367d2c6c4845ffbabce251"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.parameters.isEmpty \u0026\u0026 n.constructor.affiliation != null \u0026\u0026 n.constructor.affiliation.name == \u0022java.lang.StringBuilder\u0022\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/effects/EffectInference.scala, src/main/scala/onion/compiler/effects/StaticOperands.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/effects/EffectInference.scala"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12ab3d9d490aa1e31f3a5a6d0097c7394dec281008c2b67e753ac608e3e0169"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resultType.isBottomType || resultType == BasicType.VOID\u0060 appears character-identically in 3 files \u2014 src/main/scala/onion/compiler/typing/ControlExpressionTyping.scala, src/main/scala/onion/compiler/typing/SelectExpressionTyping.scala, src/main/scala/onion/compiler/typing/TryExpressionTyping.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/ControlExpressionTyping.scala"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"900fcccb6169d24a4d5f35a33bc37f60bc99e3fe83959ee7a5cdfdd4d9acd035"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t != null \u0026\u0026 t.desc == AST.PrimitiveType(AST.KInt)\u0060 appears character-identically in 2 files \u2014 src/main/scala/onion/compiler/typing/EnsuresVerifyPass.scala, src/main/scala/onion/compiler/typing/OverrideContractPass.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/typing/EnsuresVerifyPass.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1a67bc2c083b10ed0ed84b80003ed4eb9f455a71d6e3b360cf87705b5f59c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/ConsoleEncoding.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4603060e3403a588c89f1120746a5e8b7ed541a884526b73c9fdf1c06e8b143c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/ConsoleEncoding.scala"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"51110cce6041bddaf14cd442d644f6d4de25f7755af817139b15684d14e05ce5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/OnionVersion.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"19085777ad17014f68b2f9643e28df9b36e03294c5ba583cac097b5cd22e2073"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/Repl.scala"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3c0218ad9ad6211290b23bb3e15ee18352e6f61f11c7bb4e7774653c8f95b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/ScriptDependencies.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8725837803ea9cebb0f55375cea715a3513835a905d28f0a1efedca535c77f58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/ScriptDependencies.scala"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7ac24bc9f38dbe33743a75a3a5b1f316c90fdc2d068c84f10a04ba8ef39031"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/ScriptDependencies.scala"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f416aa62a93ce68fac01f0a980b48962f96f6a51dabc2a0cc31d5d00c43a8b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/ScriptDependencies.scala"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"095c99ecaafb4d7e9110a692631b519b8f325aa04087d2fc50c40d3390e0c782"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/ScriptDependencies.scala"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6afae6a6bb47e53907c336915b4d474234b5215a92693ba4c1793e16b95754"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/project/CompilerIdentity.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c0574e1b9662aa33517d689b8886ec8f6db0265e6eca6bf3b38670f6d5cbf9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/project/CompilerIdentity.scala"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d775359342c8a4815e6f0743b802a56f78c09c856e27fada919eceba10219d78"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/project/CompilerIdentity.scala"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"025b80342e550b35d62dffc43cdc4189b3860b8e0b1a23c2eb0ba770797fa9b0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/project/CompilerIdentity.scala"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b3a5fafe83ee77e9052b2db15eada06b5e71b850a376a70827d722a9d0fa38"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/project/CompilerIdentity.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3664502d8b806073c689c511da9c712824ec4f7aec41862e73d43b2a2b1876c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/project/DependencyClasspathRecord.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde3d36b122fa66a745e28aaf8fa89c35d22781ddc4c8de8a302ba7b50836785"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/project/DependencyClasspathRecord.scala"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4bdcfdb414c30fba8326bb59de2ca2fcbf3277277d04fd4d2883f9808b0d68"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/project/ProjectBuilder.scala"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"974656c2d68f84c2874f5b0d636a21b6f11be66616b5e8877b25609236c6de2f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/migrate/MigrateCommand.scala"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"be30b9afa0cb0f83ab99b66afa43acfac3da21db9ef7bae079d03e7f9e4fcd46"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fe6f3f347642fa51e52a41b752fa017643d5fc2d3506a8dbeac95a736f102f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5a6a8dfaca712c04969e33200e08128b634f6b849667d0522c184cb17f554e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/migrate/Migrator.scala"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc1ba256c734fbcbf1d2f9c164ca46d0c6eebcae923dbff655fcc7278181ecb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/lsp/OnionTextDocumentService.scala"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"e842f74037166da93f58d4d346325e0280de08b654082f93f8772e0512964027"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/lsp/OnionTextDocumentService.scala"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b440a0f3af31e38bc342c4d320e858a34567398df5f0b29ef113039950184c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/daemon/DaemonClient.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21d516397856d35fd7f0fbddc505bf36f1e25d41f409771d4344743a6b9c5dc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/daemon/DaemonClient.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b1e3163f57130566deab481449f76ecd37fb6ff7a4f448991b721dd8d65cbc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/daemon/DaemonClient.scala"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c534e47b2b1ccd8133b117d9b9808df837cccd265e2a5811bb8446fc91db4c86"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/daemon/DaemonClient.scala"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9792437daf973ce65ce33c7bf44c5a832f50cdd15115a1b1cf3d64a5b3bd16f2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/daemon/DaemonClient.scala"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da9a6eab8c65783b4adcae7f0f8f3b900b738cca89e8614a588707cb274adaf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/daemon/DaemonClient.scala"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ad2e5a3fa7851c5f94030a1937c8cbf18d0ff30a4a8345852b6285c15bf492"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/daemon/OnionDaemon.scala"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22864944d7867e253840919ef0b9ce42dc7a3c46019ff91a902377a98836b6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/daemon/OnionDaemon.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72355b49208677bd428e3878e4eb205729a5f56c987f0bf35e0e8b189be7a77"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/daemon/OnionDaemon.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebde149b18bf2594c1a5a9788cd2860ea43ec7e74e4dc2eef6c18b220e5669f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/daemon/OnionDaemon.scala"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"defe1e400aa81c19b935e1a6017c63c57faa90df6427c6a9eb75fcd2e23055e5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/daemon/OnionDaemon.scala"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf3ba82f3596c128bfa599c95fab6a19430939463bffcf747134c58fc209948"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/SemanticErrorReporter.scala"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dcf45b8dea1d4f60be6e7d2bd07df76910de31554c5bfef9bdfa9618bcd1d0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/TermWalk.scala"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"566e1298aab8a84a95958c606046e414eddc3492edb7381054ec01f7f96ad045"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/verification/ArgGenerator.scala"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0472e00728191f7a82647c1ca06c2b0d6fcaa80e2309d8e26d606fa70033b1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/verification/ClosedPredicatePhase.scala"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3be2229bfce6eff16276fa0692d2b46e895322574c3980a6c7776dae728063"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/verification/HistoryReproPhase.scala"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f27292a350913faf7d3a43c37d0c1254dc78d4c0c6176be6e3ae184d11f60a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/verification/ShapeContractPhase.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"238a2cefa1807b896db25efa06ab697668b690ca0f857eab7651bed45314247e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/verification/ShapeContractPhase.scala"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e5499847e05d57539e7f07929d1d851646a0351ee6182ffcf31473ce9b0589"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/compiler/contracts/ContractText.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2915ec77232677d21f00602be111897e1beab45ae5f52b8fedc30f00586165"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Throwable)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Future.java"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"58902d5cab9c26458c70d7231498d42173f6fe86ee3df24db1c8079b0746a437"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Future.java"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"903abf2a285a2d6a7c4297342d909786593718e54710c544faba9f0c148756ed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Future.java"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4b44442da6b6cc86fc8389236f0ecdec54666c3f82c1483385029a1e76174f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/onion/Regex.java"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d142713bbb11a5ed0888ca4d7fc4d212daf68a833051067583e66f6112508e"}},{"ruleId":"X5","level":"note","message":{"text":"Scala\u0027s null is not held to the type system everywhere: No build over this repository\u0027s 314 Scala product file(s) passes \u0060-Yexplicit-nulls\u0060, enables WartRemover\u0027s \u0060Null\u0060 wart or runs Scalafix\u0027s \u0060DisableSyntax.noNulls\u0060, so every reference type admits null and nothing reports a \u0060null\u0060 written into the code or returned from a Java API \u2014 the first one to reach a method call is a \u0060NullPointerException\u0060. \u0060Option\u0060 by convention is a habit no tool here holds the code to."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"23e7c3c6da50151f07723c64ca4f881fd5903e713d143161a7c0594ad7ba29cc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060extractFileName\u0060 swallows every exception into \u0060\u0022unknown.on\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/onion/tools/lsp/OnionTextDocumentService.scala"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9944c64bdb732ef0ce521c7541c7145f11728d1a5b379b7513acf8ee5112ed"}}],"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-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-330","guid":"f811ddf9-2e54-865b-9c76-f97905849790","name":"Use of Insufficiently Random Values","shortDescription":{"text":"Use of Insufficiently Random Values"},"helpUri":"https://cwe.mitre.org/data/definitions/330.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"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":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"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":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"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":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"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":47,"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."]}]}