{"$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":"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02: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":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"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":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"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":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"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":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"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":"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":"graph-viewer.paint (cyclomatic 201): graph-viewer.paint has cyclomatic complexity 201 (threshold 15). Of this number, 146 points are the body\u0027s own statements and 55 belong to 10 function items inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3d974c636a38f54301903bdebb9b97e1dd20e60cf61d17813f0c955bd274b4"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.build (cyclomatic 116): Builder.build has cyclomatic complexity 116 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2fd53b35ff4a42beb11ab5e489c0e70804f36b115cf6dc013949d70c396976"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingContainerCallableChecker.checkImpl (cyclomatic 110): BindingContainerCallableChecker.checkImpl has cyclomatic complexity 110 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"61babd7acdbee5c512cc0d4cf50f3e38e527201da260f4c87f04d2597e4337ca"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.applyOptionValue (cyclomatic 101): Builder.applyOptionValue has cyclomatic complexity 101 (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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/MetroOptions.kt"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"15def15bb9c100cca318d524396685dee987b91f5b2053205f9a680ed7026ec7"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphExpressionGenerator.generateBindingCode (cyclomatic 98): GraphExpressionGenerator.generateBindingCode has cyclomatic complexity 98 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd05c5cd7f20981997135a25d40c4b63e41673c89f94dd187158b35fd4352e8"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingGraphGenerator.generate (cyclomatic 86): BindingGraphGenerator.generate has cyclomatic complexity 86 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddc7254a39ac376341324a8742bb93981350a62cac8e82d16ff3f514c0b94a5"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyGraphChecker.checkImpl (cyclomatic 74): DependencyGraphChecker.checkImpl has cyclomatic complexity 74 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3944750bcb364f4704afd736266fb38a2f3f7b8b1883f6cc6c338f0330181dd2"}},{"ruleId":"D1","level":"warning","message":{"text":"renderDetails (cyclomatic 74): renderDetails has cyclomatic complexity 74 (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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"716af281cfeb84a6ebf7033d946620a3f0928ec7de1d880a4569c3be36a1065c"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.refreshView (cyclomatic 65): graph-viewer.refreshView has cyclomatic complexity 65 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 14 belong to 2 function literals inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefb37cd0759eef24bdec240701d6f5b9c662997c6d52910d90a965f9f9d75de"}},{"ruleId":"D1","level":"warning","message":{"text":"startup-benchmark-report.html.renderBinaryMetrics (cyclomatic 62): startup-benchmark-report.html.renderBinaryMetrics has cyclomatic complexity 62 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 29 belong to 7 function items inside it that branch. 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":"docs/benchmark_assets/runs/2026-07-30/startup-benchmark-report.html"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae82f0adba33d37de1e66b2a51eea1c191232873b6f2a5f01b095189725fd831"}},{"ruleId":"D1","level":"warning","message":{"text":"indexGraph (cyclomatic 57): indexGraph has cyclomatic complexity 57 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 1 belongs to 11 function literals inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f015b5036d0381ee5e5d4c34f755a02503f7639511bdfb37419b8f501c72971"}},{"ruleId":"D1","level":"warning","message":{"text":"boundaryContour (cyclomatic 54): boundaryContour has cyclomatic complexity 54 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 14 belong to 5 function items inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3390db9a971043c581c8edca5076c3f0da46f1e3fdcfed8372bf3a28e464c2"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingPropertyCollector.processBindingNode (cyclomatic 53): BindingPropertyCollector.processBindingNode has cyclomatic complexity 53 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17c5869fc947c1db40b8cc2c5293f51d7b0c71f314a65433a7a47c9dcff3af5"}},{"ruleId":"D1","level":"warning","message":{"text":"ContributedInterfaceSupertypeGenerator.computeContributionSupertypes (cyclomatic 52): ContributedInterfaceSupertypeGenerator.computeContributionSupertypes has cyclomatic complexity 52 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bc6d2baf7bba0e01d62985c48156ae4d4dcd5c5e28e13c4930aa5f5b3b82b7"}},{"ruleId":"D1","level":"warning","message":{"text":"buildView (cyclomatic 49): buildView has cyclomatic complexity 49 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 21 belong to 8 function literals inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce53d4171fdf5fb3f8f129881eee5a6016b9e1542aa6977935c5cada38453c75"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.layoutRegions (cyclomatic 48): graph-viewer.layoutRegions has cyclomatic complexity 48 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebef9241bc4f16e5bd03d7c3c139728bac16b0d15241a400125b2df98be9e8aa"}},{"ruleId":"D1","level":"warning","message":{"text":"MetroAnnotationsKt.metroAnnotations (cyclomatic 47): MetroAnnotationsKt.metroAnnotations has cyclomatic complexity 47 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7728b58ddfab325dc6e8511394ce0d0cdc6f6c7d21f0d1f4c73302e75ebcc641"}},{"ruleId":"D1","level":"warning","message":{"text":"MetroAnnotationsKt.metroAnnotations (cyclomatic 45): MetroAnnotationsKt.metroAnnotations has cyclomatic complexity 45 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"02390e3ecc232db7b392acb0eaa83e2f9bb445392119b11f624c7fab87e1bebb"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch-all-ide-kotlin-versions.main (cyclomatic 45): fetch-all-ide-kotlin-versions.main 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":"compiler-compat/fetch-all-ide-kotlin-versions.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af1e26e4a15820dc136d5248fc2427088b51f68a8c87c026e249dbbaa63bd49"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingContainerClassChecker.checkImpl (cyclomatic 43): BindingContainerClassChecker.checkImpl has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerClassChecker.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d562d104e97a2fd11a47731d67d0784aad73a1beaed30797195a18f57d772908"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingGraphGenerator.computeRawInheritedGraphData (cyclomatic 43): BindingGraphGenerator.computeRawInheritedGraphData has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd96fe68b9f4c8da84ab4ad86dc772c9eb2b46b258fcecb145ff3e8e760f1627"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingIndexLookups.build (cyclomatic 41): BindingIndexLookups.build has cyclomatic complexity 41 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndexLookups.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01742bbab3045fa055ee3a1c1a78170df41b412ce19effca6961231032439d0"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyGraphTransformer.prepareDependencyGraph (cyclomatic 39): DependencyGraphTransformer.prepareDependencyGraph has cyclomatic complexity 39 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/DependencyGraphTransformer.kt"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02ca8ab826f411612cd92742304b13690516a310225de3a019e2b8ea6cb0d6d"}},{"ruleId":"D1","level":"warning","message":{"text":"MetroResolutionService.classifyFileChange (cyclomatic 39): MetroResolutionService.classifyFileChange has cyclomatic complexity 39 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dabc16f3f14ae4d6b05403d196cbd363122308481a00f0010a218b2699fadbf"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingIndex.bindingCandidateRejection (cyclomatic 39): BindingIndex.bindingCandidateRejection has cyclomatic complexity 39 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"82adcde0ba2c58a59ef8c307c17fecd9b70cb717e5dbdf45945b32f3bd0a646a"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyGraphCreatorChecker.checkImpl (cyclomatic 38): DependencyGraphCreatorChecker.checkImpl has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphCreatorChecker.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b360ca467c91d318000b82bbe546d43eda3a5844e28320379b9fe38bd4673574"}},{"ruleId":"D1","level":"warning","message":{"text":"MultibindsChecker.checkImpl (cyclomatic 38): MultibindsChecker.checkImpl has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MultibindsChecker.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"300217e7618df92f5ab790c7dcc8f820f0c18d7155740647b3e3d7f1ebf33e28"}},{"ruleId":"D1","level":"warning","message":{"text":"MetroResolutionService.drainCoordinatorEvents (cyclomatic 38): MetroResolutionService.drainCoordinatorEvents has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"297219d5c516ff1aed87e780605e4cf53a05366ad514ad5a4be48580a8aad5d9"}},{"ruleId":"D1","level":"warning","message":{"text":"startup-benchmark-report.html.renderMetadata (cyclomatic 33): startup-benchmark-report.html.renderMetadata has cyclomatic complexity 33 (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":"docs/benchmark_assets/runs/2026-07-30/startup-benchmark-report.html"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"541f6993df282899edff70ea45ca39db4740c4a91d5f5de078c9f77cab16ae39"}},{"ruleId":"D1","level":"warning","message":{"text":"BetterKotlinLikeDumper.printMemberAccessExpressionWithNoIndent (cyclomatic 32): BetterKotlinLikeDumper.printMemberAccessExpressionWithNoIndent has cyclomatic complexity 32 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8dd72507724d257a192d731f600e5182a505988e4d23a28718dfb379f1d886"}},{"ruleId":"D1","level":"warning","message":{"text":"AggregationChecker.checkBindingContribution (cyclomatic 31): AggregationChecker.checkBindingContribution 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AggregationChecker.kt"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"40299030df9bace6318f342d21d8dc02f2a85ae89c868ba4e7d82b23a3201b13"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingExtractionKt.classBindingData (cyclomatic 31): BindingExtractionKt.classBindingData 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/BindingExtraction.kt"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"834e0413dfddf1ad86128aade4ad6a9441def80e83dd40cf22e2b3a142494543"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolutionInputCapture.capture (cyclomatic 31): ResolutionInputCapture.capture has cyclomatic complexity 31 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/ResolutionInputCapture.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d02b137c8f2a68926938d80fc8015a25b9c45b3fd4ee019031dca18f8a8b0e1"}},{"ruleId":"D1","level":"warning","message":{"text":"MultibindingExpressionGenerator.generateMapMultibindingExpression (cyclomatic 30): MultibindingExpressionGenerator.generateMapMultibindingExpression 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/MultibindingExpressionGenerator.kt"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"624540c5f031ce13fef7924af83dd3f3808c480e758f1af1eef4ab5f194d52ca"}},{"ruleId":"D1","level":"warning","message":{"text":"build-benchmark-report.html.renderMetadata (cyclomatic 30): build-benchmark-report.html.renderMetadata has cyclomatic complexity 30 (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":"docs/benchmark_assets/runs/2026-07-30/build-benchmark-report.html"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9896f24a3f0c89f1d8993b20968bc3436403f82d6fbc6b3af289107ada98ea8"}},{"ruleId":"D1","level":"warning","message":{"text":"IrContributionMerger.computeContributions (cyclomatic 29): IrContributionMerger.computeContributions 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccbf9fad0d064e28f05df1d15e26fcd5ae674f6d23a7937a6586551f710d07c"}},{"ruleId":"D1","level":"warning","message":{"text":"BindsMirrorClassTransformerKt.transformBindingDeclarations (cyclomatic 29): BindsMirrorClassTransformerKt.transformBindingDeclarations 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindsMirrorClassTransformer.kt"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3e566801ae83e6812d72beadac671070020c43290a82d55e0ab514b9deebce"}},{"ruleId":"D1","level":"warning","message":{"text":"MembersInjectorTransformer.getOrGenerateInjector (cyclomatic 29): MembersInjectorTransformer.getOrGenerateInjector 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"92917d9bc513ce266afc4578db21281182467765542f1a988f3c6919f2f0cd8c"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceLibraryInputsKt.libraryInputs (cyclomatic 29): SourceLibraryInputsKt.libraryInputs 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/SourceLibraryInputs.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"252657c21f5e5eaa700e70e5f98ec9ef5c5270e1821b02b1c689fdee4092ca4c"}},{"ruleId":"D1","level":"warning","message":{"text":"MetroResolutionService.buildResolutionCandidate (cyclomatic 28): MetroResolutionService.buildResolutionCandidate 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae5d311ceefc550ea5ac52721b1d4714848f17d9d656925ad91055b99cba9d7"}},{"ruleId":"D1","level":"warning","message":{"text":"MembersInjectChecker.checkImpl (cyclomatic 27): MembersInjectChecker.checkImpl 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MembersInjectChecker.kt"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"95db02d373ead5b3eb618ec81df76b46bfa0d13830efdbee6120bd6003c0d31f"}},{"ruleId":"D1","level":"warning","message":{"text":"MetroCompilerPluginRegistrar.registerExtensions (cyclomatic 26): MetroCompilerPluginRegistrar.registerExtensions 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroCompilerPluginRegistrar.kt"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0d3497d235194665f24a8f586bf622737921aef6f6dbacece600ad7fed847b"}},{"ruleId":"D1","level":"warning","message":{"text":"IrGraphGenerator.implementOverrides (cyclomatic 26): IrGraphGenerator.implementOverrides 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15bcaf486d3b3851d023cc86e6fde304215eaf7718d4d96eccb7008fca0cdc1"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.offsetContour (cyclomatic 26): graph-viewer.offsetContour has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5073249061e063ba54195f205a7a60513d500b3d9fda67344c0b77febae9117"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 26): (anonymous) 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7226f836ed558ea69393c553f3e345c3f620497f3368ba1ec1ba139b7e89ba"}},{"ruleId":"D1","level":"warning","message":{"text":"IrBindingGraph.validateBindings (cyclomatic 25): IrBindingGraph.validateBindings 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e4a1b1f80dab74251b38bf00040f7a506d15ccb89f415b9b9bcdd8f6a5f712"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingContainerTransformer.loadExternalBindingContainer (cyclomatic 25): BindingContainerTransformer.loadExternalBindingContainer 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"f080c550bb5484f3f2e910f3f72c634ad7301f41010d03db20b34e1b186b342a"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryContributionScanner.processLibraryHint (cyclomatic 25): LibraryContributionScanner.processLibraryHint has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryContributionScanner.kt"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2d60a89124880d79cea21d46cfa069a78d526e58cf8536824784feafa5dd0a"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.projectGraph (cyclomatic 25): graph-viewer.projectGraph has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9a67de292c433b134139827eb1c2171d838dfcb1476bcfe02855bf3d038dde"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.layoutNeighborhood (cyclomatic 25): graph-viewer.layoutNeighborhood has cyclomatic complexity 25 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad5900cb1b84a31eb0c0975169299dc4477488c05291825bd1b3c2d8fa14651"}},{"ruleId":"D1","level":"warning","message":{"text":"FirAccessorOverrideStatusTransformer.needTransformStatus (cyclomatic 24): FirAccessorOverrideStatusTransformer.needTransformStatus has cyclomatic complexity 24 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/FirAccessorOverrideStatusTransformer.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03bbf0cc292a977f4dd394a6544a09130a22f96546e17efe8eb68732f8b6db9"}},{"ruleId":"D1","level":"warning","message":{"text":"IrBindingGraph.findSimilarBindings (cyclomatic 24): IrBindingGraph.findSimilarBindings 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"61997104bc3502c1fcbfc5c17792e44c7ad5c5be349526bff1f3a21d2066b5d5"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidationSourceSnapshot.capture (cyclomatic 24): ValidationSourceSnapshot.capture 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/ValidationSourceSnapshot.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c710a182ed4315ab676d647fcf44e2e08fe4afa50ad617ca75ef03453d0e996b"}},{"ruleId":"D1","level":"warning","message":{"text":"FileShardBuilder.processBindingCallable (cyclomatic 24): FileShardBuilder.processBindingCallable 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c77b6d1da195ee6a8476aa59d97dbbe0a248d97c0bd1228244a73119b153d2"}},{"ruleId":"D1","level":"warning","message":{"text":"MetroSortKt.computeStronglyConnectedComponents (cyclomatic 24): MetroSortKt.computeStronglyConnectedComponents 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/MetroSort.kt"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0104e0dcc6c82843dd8fc25d52ec3e57f8235af50f4742ae5ae3a847785995"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.document.addEventListener(\u0022keydown\u0022) (cyclomatic 24): graph-viewer.document.addEventListener(\u0022keydown\u0022) has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7f11b0108570cb647c332e5883c7d19146e3e805bafe2593c2666da2398b0e"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 24): (anonymous) 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"029440468abb82cb8b955fdc9aa222c0af70bc0fa11e181c85cd32766c528ac7"}},{"ruleId":"D1","level":"warning","message":{"text":"AggregationChecker.checkImpl (cyclomatic 23): AggregationChecker.checkImpl 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AggregationChecker.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf79f6470c81d2a5c256d394cf885ef592f2787fd32d2e7af3208b4415d0962"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphLifecycleChecker.check (cyclomatic 23): GraphLifecycleChecker.check 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/GraphLifecycleChecker.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21fad05a68e345adb3c737d25dc7f54588a0d4c9e2e8457120aaa69eee69af1"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.buildCreator (cyclomatic 23): Builder.buildCreator 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab24f8b357c661592753b5a7d0a3f1155bda906e4a7b535f2b10add5f1c30329"}},{"ruleId":"D1","level":"warning","message":{"text":"IrKt.materializeWrappedType (cyclomatic 23): IrKt.materializeWrappedType 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"507acaa9e3a3441efd36dc68345183a199ebc675f53151ab30746dea3a708de6"}},{"ruleId":"D1","level":"warning","message":{"text":"ContributionIrTransformer.generateContributionProviderFunctions (cyclomatic 23): ContributionIrTransformer.generateContributionProviderFunctions 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"0741a8d33f87ad78f34ded5075886f98cd8f3de60291d699bc39e842d3942a36"}},{"ruleId":"D1","level":"warning","message":{"text":"layoutBindings (cyclomatic 23): layoutBindings has cyclomatic complexity 23 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 6 belong to 8 function items inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e2795775488cd36dd5f661fecafcc2fbcee1eba93a1cdda8466d5073e678e6"}},{"ruleId":"D1","level":"warning","message":{"text":"InjectionSiteChecksKt.validateInjectionSiteType (cyclomatic 22): InjectionSiteChecksKt.validateInjectionSiteType 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/injectionSiteChecks.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2306aa8b8eab2554c4e5622d3841463b20b89170e8f463bd6eb3b561214ba6"}},{"ruleId":"D1","level":"warning","message":{"text":"IrDeclarationRenderingKt.renderForDiagnosticImpl (cyclomatic 22): IrDeclarationRenderingKt.renderForDiagnosticImpl 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/irDeclarationRendering.kt"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"249bc2839b6738e47d56c34c2dd2a76981166cf9fd98092e21e83abdf24c0348"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryIndexPostProcessor.bindingSeeds (cyclomatic 22): LibraryIndexPostProcessor.bindingSeeds 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryIndexPostProcessor.kt"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d626e02f07fa0aeb74f95e2ceeb4474980d8c86be71cb65f1cc3c7da4b27cd6"}},{"ruleId":"D1","level":"warning","message":{"text":"ContributionCandidateKt.contributionCandidate (cyclomatic 22): ContributionCandidateKt.contributionCandidate 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributionCandidate.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb987adb53f0e7b2848092bb059eda852510dafde660371b6ddacbd086a3cc7"}},{"ruleId":"D1","level":"warning","message":{"text":"MetroValidationSelectionKt.validationSelectionVisitor (cyclomatic 22): MetroValidationSelectionKt.validationSelectionVisitor 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroValidationSelection.kt"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe476f30c71e0a03d03751b782e816990aa7a158f0ea07877216087df9e5cfc8"}},{"ruleId":"D1","level":"warning","message":{"text":"build-benchmark-report.html.frameworkVersion (cyclomatic 22): build-benchmark-report.html.frameworkVersion 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":"docs/benchmark_assets/runs/2026-07-30/build-benchmark-report.html"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db1177c9038fb1103d1f3a4b6797f6437ad0bc824798bca639b74d1f0b4bb9a"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyGraphChecker.checkStaticCreatorCollisions (cyclomatic 21): DependencyGraphChecker.checkStaticCreatorCollisions 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dae355148a69edf8e4936e1d6d5de8a42818cc20f198a2879f7047750447dd2"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphExpressionGenerator.generateBindingArguments (cyclomatic 21): GraphExpressionGenerator.generateBindingArguments has cyclomatic complexity 21 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d9be767a4b60ca116cafeedcd41484addf50e6cd3856fdabef77c71a581e85"}},{"ruleId":"D1","level":"warning","message":{"text":"ContributionEditKt.applyContribution (cyclomatic 21): ContributionEditKt.applyContribution 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributionEdit.kt"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe4400012ef1ababd7e58745790d7d6664d59eca184844763e9a3b715e2d0c4"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingIndex.selectedGraphComposition (cyclomatic 21): BindingIndex.selectedGraphComposition 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"21844bf64a82a19df47cefd88f2ed322d1a4e93964f491199b65f149d60c85e1"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingIndex.isConsumerInContext (cyclomatic 21): BindingIndex.isConsumerInContext has cyclomatic complexity 21 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"8056e5bbca3198e0473a0777b4b4e3efdc4c7cd6d9c3199b73f549922c04d939"}},{"ruleId":"D1","level":"warning","message":{"text":"AssistedInjectChecker.checkAssistedFactory (cyclomatic 20): AssistedInjectChecker.checkAssistedFactory 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AssistedInjectChecker.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3e9134fd4470bbdd41a5d6553bb633dbbcf8fde3186c61148ec5fa1a650bd7"}},{"ruleId":"D1","level":"warning","message":{"text":"IrGraphGenerator.collectShardPropertyInitializers (cyclomatic 20): IrGraphGenerator.collectShardPropertyInitializers 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"0caf7f54cf13890f31e612076cc586828480a0e24550daa073912323a6764b2d"}},{"ruleId":"D1","level":"warning","message":{"text":"IrKt.renderTo (cyclomatic 20): IrKt.renderTo 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. This shape REPEATS in the file: one other method here (IrKt.renderTo) 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2ebc902c3025b751f3f14f7c3baa3022f67f031e4782ced18e408fba54cefa"}},{"ruleId":"D1","level":"warning","message":{"text":"IrKt.renderTo (cyclomatic 20): IrKt.renderTo 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. This shape REPEATS in the file: one other method here (IrKt.renderTo) 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a661b195fc79e6dc5acebd354e2e4503aaa460a9bf701c7d3f8859fbe1dbfaf"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingContainerTransformer.findContainer (cyclomatic 20): BindingContainerTransformer.findContainer 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"798698d2c8368deb269883ff8e41743ead675be45306f779db869ffb7d8b4a8b"}},{"ruleId":"D1","level":"warning","message":{"text":"MetroLineMarkerProvider.consumerMarker (cyclomatic 20): MetroLineMarkerProvider.consumerMarker 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f4c03b8e5158d54f55f770444219998554e887b7cfd84540a190385c7faa48"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingExplanationKt.explainBindingSelection (cyclomatic 20): BindingExplanationKt.explainBindingSelection 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingExplanation.kt"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c709c0386e38d8c186ca1fd3f5b489daacf0a7c5c6216363439b66be03d5d9"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphMetadataReporter.buildBindingJson (cyclomatic 19): GraphMetadataReporter.buildBindingJson has cyclomatic complexity 19 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06dc853ade4291690a3c6552ed0a15c8d2a2042e8e2b8de3121ecedda510ee2"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingExplanationRenderingKt.selectionReason (cyclomatic 19): BindingExplanationRenderingKt.selectionReason has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/reporting/BindingExplanationRendering.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7500ccb13a4a39cc6f702e47f6b645af917d397e9e02e0cdb6243581865ee56a"}},{"ruleId":"D1","level":"warning","message":{"text":"KaBindingLookup.delegateToParentIfScoped (cyclomatic 19): KaBindingLookup.delegateToParentIfScoped 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingLookup.kt"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5403b49cab82b22a338f1a373a51c37971156e31df602cdee115de08b691e8d5"}},{"ruleId":"D1","level":"warning","message":{"text":"MetroResolutionService.index (cyclomatic 19): MetroResolutionService.index 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d7776bbe4a35e1515aa951493eaf742464e3961c0bae2c45f8c6e64dec9bbe"}},{"ruleId":"D1","level":"warning","message":{"text":"InjectionTargetsKt.injectionAnnotationTargets (cyclomatic 19): InjectionTargetsKt.injectionAnnotationTargets 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/injection/InjectionTargets.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53ed6fb64efc86071e2be6fd374de156ef5bddde3942d11ab98293a5d8e1c9c"}},{"ruleId":"D1","level":"warning","message":{"text":"SuspendBindingValidator.runtimeRequirement (cyclomatic 19): SuspendBindingValidator.runtimeRequirement 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/SuspendBindingValidator.kt"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17ffafd9926b7929ef592950466066df16d8cb9296507397217aa994aa23bc5"}},{"ruleId":"D1","level":"warning","message":{"text":"startup-benchmark-report.html.renderMetadata (cyclomatic 19): startup-benchmark-report.html.renderMetadata has cyclomatic complexity 19 (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":"docs/benchmark_assets/runs/2025-12-08/startup-benchmark-report.html"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6866d190a1c1b0c317d6304c49197c607f70b38922fc3786c33e4ca731a1343b"}},{"ruleId":"D1","level":"warning","message":{"text":"startup-benchmark-report.html.renderMetadata (cyclomatic 19): startup-benchmark-report.html.renderMetadata has cyclomatic complexity 19 (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":"docs/benchmark_assets/startup-benchmark-report.html"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90b4bbc88d6331c7810298eb7fe787cb08d408c5725bd23df40cb809960a0df"}},{"ruleId":"D1","level":"warning","message":{"text":"KotlinToolingVersion.compareTo (cyclomatic 18): KotlinToolingVersion.compareTo has cyclomatic complexity 18 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/src/main/kotlin/dev/zacsweers/metro/compiler/compat/KotlinToolingVersion.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3752410407c3bc46f15aae4daacbedcc29d34d2ef4973483a255df08c805e2e"}},{"ruleId":"D1","level":"warning","message":{"text":"CircuitInjectClassChecker.checkImpl (cyclomatic 18): CircuitInjectClassChecker.checkImpl 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitInjectChecker.kt"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"256f84cfc9ebe97f61fe809afac805ef40cd6c18b52ef12f6c484c4831de632c"}},{"ruleId":"D1","level":"warning","message":{"text":"CircuitSerializableClassChecker.check (cyclomatic 18): CircuitSerializableClassChecker.check 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitSerializableChecker.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a6e9be16bd83fcb9cfca5c45c80550f5cb1d15184e395a731c3d6ef507dd41"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingPropertyCollector.collect (cyclomatic 18): BindingPropertyCollector.collect 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"039645bce53581ca597039cca11776a3e4ad0fbe7bc56e19138d54d33660204f"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingPropertyCollector.knownPropertyType (cyclomatic 18): BindingPropertyCollector.knownPropertyType 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17dfc63e8ab91e3d01ceaa13f413b7357ba6b1096bb988f8a750b70fe0b6e81"}},{"ruleId":"D1","level":"warning","message":{"text":"ShardingDiagnostics.generateShardingPlanReport (cyclomatic 18): ShardingDiagnostics.generateShardingPlanReport 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/sharding/ShardingDiagnostics.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf621cd2c84af4a87a641a7658a62f6abaeab33c856e45d0ee87169bc441c819"}},{"ruleId":"D1","level":"warning","message":{"text":"CreateGraphTransformer.visitCall (cyclomatic 18): CreateGraphTransformer.visitCall 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/CreateGraphTransformer.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ec028fd9e3cd8833b3e64cc087d59b26adff94cc56b79a99cca2bb6506b6c0"}},{"ruleId":"D1","level":"warning","message":{"text":"InjectedClassTransformer.getOrGenerateFactory (cyclomatic 18): InjectedClassTransformer.getOrGenerateFactory 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ded26ab7e53369495a0e25d30bc8f04aebddd6cd4d3c88cfd797017b3d6aa2"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphReportRendererKt.bindingType (cyclomatic 18): GraphReportRendererKt.bindingType 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":"graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae969f13782c27ca3d5aab89d73a296641bf3893f8307207b55024925af2f813"}},{"ruleId":"D1","level":"warning","message":{"text":"MetroLineMarkerProvider.collectNavigationMarkers (cyclomatic 18): MetroLineMarkerProvider.collectNavigationMarkers 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df09cc54c0fc91d9afb924f2e55b499aa9ceadc4417c7576c528ecb59276412"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphMemberExtractor.indexGraphCallable (cyclomatic 18): GraphMemberExtractor.indexGraphCallable 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphMemberExtractor.kt"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a228a4ad8005e0a4b8ed38be0063c34cdafae39874aff25c96a41da15afe7071"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticRenderer.render (cyclomatic 18): DiagnosticRenderer.render 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/diagnostics/render/DiagnosticRenderer.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fdd5fe09c0042d81aeec4a08a43294b0435354cb0ff53428c22da1568a646c"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.layoutRadial (cyclomatic 18): graph-viewer.layoutRadial has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faf438af01b8220eb3af7a3983cdb7bdac6c0bd81dbc62f5f49dca084ba3656"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.groupPackages (cyclomatic 18): graph-viewer.groupPackages has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to 7 function items inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53cf8a2514f5775b2ec9c93ba7ccf6b24390c936b21006a903cc1ef864fae6b"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.attentionFor (cyclomatic 18): graph-viewer.attentionFor 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ad910f121ba1c8c69957a2bec6b15d5a2488b2c175ee4d342f413ab64c4532"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.renderExplanations (cyclomatic 18): graph-viewer.renderExplanations 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14e7a229e6a0aff35a5d98fa2907ae92585bbcd7e4df95030136ed23eedc429"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.canvas.addEventListener(\u0022pointermove\u0022) (cyclomatic 18): graph-viewer.canvas.addEventListener(\u0022pointermove\u0022) 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"e264ed97e42265bdf83092245c27790e98f6bc8d81dbebca17d65e2fe34375b9"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 18): (anonymous) 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db35a202971ba4f4769d29e78a3e364ba9e2135621fb9edccd40747da5294f9"}},{"ruleId":"D1","level":"warning","message":{"text":"ContributionProviderNameIdentityKt.contributionProviderArgumentIdentity (cyclomatic 17): ContributionProviderNameIdentityKt.contributionProviderArgumentIdentity 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ContributionProviderNameIdentity.kt"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de0786df3db4147a0d9d9c09cc435ed4a5f09633ca2fdf76d32be9fc1097c38"}},{"ruleId":"D1","level":"warning","message":{"text":"CreateGraphChecker.checkImpl (cyclomatic 17): CreateGraphChecker.checkImpl 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/CreateGraphChecker.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f9186bb642a00d5f12b0a214c0879477e82f2ea253fde4236be7937da757ce"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingLookup.deriveBinding (cyclomatic 17): BindingLookup.deriveBinding 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingLookup.kt"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f91225e6d1e499673f5980ad742fda1345811cacf31b7a8c0966744226883a"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.buildExternalGraphOrBindingContainer (cyclomatic 17): Builder.buildExternalGraphOrBindingContainer has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44e53d5fe51611d3a987075be61324b45a9a89e96e98bb7cf7f9b3f5bebad7e"}},{"ruleId":"D1","level":"warning","message":{"text":"IrBindingGraph.finishSeal (cyclomatic 17): IrBindingGraph.finishSeal 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"88099d680445627b9a16bfc56d141c9a2b2f63892ea6ef2343466320267aef9e"}},{"ruleId":"D1","level":"warning","message":{"text":"IrKt.irInvokeResolved (cyclomatic 17): IrKt.irInvokeResolved 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: IrKt.primitiveFactoryClassId (cyclomatic 18) 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7ae8e9d84f9a517378e6f09911ada6d96377de883c3b4028a61190c3a88315"}},{"ruleId":"D1","level":"warning","message":{"text":"FactoryIrUtilKt.generateMetadataVisibleDeclarationMirror (cyclomatic 17): FactoryIrUtilKt.generateMetadataVisibleDeclarationMirror 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/factoryIrUtil.kt"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"252f223a946955e661398c98920cdc74135e83ce3070201aff1dc42844edc53d"}},{"ruleId":"D1","level":"warning","message":{"text":"FileShardBuilder.processInjectAnnotated (cyclomatic 17): FileShardBuilder.processInjectAnnotated 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b78be1cdc4772e6993b23608334a77daaf6d85d12846dd80b83ac295df8630"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryIndexPostProcessor.resolveLibraryInjectBindings (cyclomatic 17): LibraryIndexPostProcessor.resolveLibraryInjectBindings 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryIndexPostProcessor.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7930687a96fb6a6e785fcfbe5da0c3fef6743fcc92bef74b0c45812a8847fdda"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphDeclarationExtractor.extract (cyclomatic 17): GraphDeclarationExtractor.extract 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphDeclarationExtractor.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdc0ef3f4c81109f269597770aec1155de45b8dc268bb88da3b83d5cf8508db"}},{"ruleId":"D1","level":"warning","message":{"text":"ContributionMapKeysKt.mapKeyChoice (cyclomatic 17): ContributionMapKeysKt.mapKeyChoice 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributionMapKeys.kt"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7d30df407bdcd5c1d87005d88f13870d1ffd67ac8e4e2b95812941a41d14c2"}},{"ruleId":"D1","level":"warning","message":{"text":"MutableBindingGraph.prepareSeal (cyclomatic 17): MutableBindingGraph.prepareSeal 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/BindingGraph.kt"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"687f344c3a7e48027e2f1bd3241429a47805f77567a547d3a1e16f9109e7cca7"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.exploredNeighborhood (cyclomatic 17): graph-viewer.exploredNeighborhood has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a322aa779bd444fa78f66e5bdf7e387654ade68d839d11ec8cd16a2d664b190"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.renderBindings (cyclomatic 17): graph-viewer.renderBindings has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 2413, 2403, 2429). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f42746d15f10598317f38e6ccfb9e2a535f43929d2bfa6acbfed6eb03d79e85"}},{"ruleId":"D1","level":"warning","message":{"text":"createBindingRow (cyclomatic 17): createBindingRow has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8153e36da67d2196d2efa03a75134e63f3234caf23c66d15ee38d5ffd0417d"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphLifecycleCheckerKt.checkGraphLifecycle (cyclomatic 16): GraphLifecycleCheckerKt.checkGraphLifecycle 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/GraphLifecycleChecker.kt"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c03ec1c35664d9095b422dadddd0035ff1b9884631ef7c91e02bdacd8e8a3d"}},{"ruleId":"D1","level":"warning","message":{"text":"ContributionsFirGenerator.generateFunctions (cyclomatic 16): ContributionsFirGenerator.generateFunctions 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27176b22b0b560be9620cfe689c0a50e7574739ad2f392637c1f6607f971417"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyGraphFirGenerator.generateFunctions (cyclomatic 16): DependencyGraphFirGenerator.generateFunctions 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/DependencyGraphFirGenerator.kt"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"216c90b653f50947c6ba4d4b1e423c047955f9ecc2ac84f9990a530fc443bf7b"}},{"ruleId":"D1","level":"warning","message":{"text":"InjectedClassFirGenerator.generateFunctions (cyclomatic 16): InjectedClassFirGenerator.generateFunctions 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30a8dacb119b1d1c53afa0f8006ebbc62bd138d173fab7a30eaf046b519e081"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingContainerTransformer.getOrLookupProviderFactory (cyclomatic 16): BindingContainerTransformer.getOrLookupProviderFactory 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc44a1306dd51dfa947ba03820982c6ca3e1744acff69953ba604582995440a5"}},{"ruleId":"D1","level":"warning","message":{"text":"ContributionIrTransformer.transformTopLevelContributionProvider (cyclomatic 16): ContributionIrTransformer.transformTopLevelContributionProvider 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fcff3b4b326834a2e0670daeb145f5cd92e31ae33e077ea06b6831fcb3f546"}},{"ruleId":"D1","level":"warning","message":{"text":"MetroGradleSubplugin.applyToCompilation (cyclomatic 16): MetroGradleSubplugin.applyToCompilation 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":"gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/MetroGradleSubplugin.kt"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6670c34c47b270c4a68a2a20d7fda31286b0a4eae169d984ae3f3dafd8f413fb"}},{"ruleId":"D1","level":"warning","message":{"text":"ContributionMergingKt.applyExcludesAndReplaces (cyclomatic 16): ContributionMergingKt.applyExcludesAndReplaces 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/ContributionMerging.kt"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c600432b5962eb746875afc858c78ba571e05bdc32d4e1319b1e417977f2116"}},{"ruleId":"D1","level":"warning","message":{"text":"BetterKotlinLikeDumper.printSimpleFunction (cyclomatic 16): BetterKotlinLikeDumper.printSimpleFunction has cyclomatic complexity 16 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"465d1bf911974b0ce25f38e428de5fab2dd82a4b2d216a2159b09b68f47e8534"}},{"ruleId":"D1","level":"warning","message":{"text":"build-benchmark-report.html.renderMetadata (cyclomatic 16): build-benchmark-report.html.renderMetadata has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/benchmark_assets/build-benchmark-report.html"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a6780a15dab0c356a0e768b7f96c5ff2f556ff9e7787a9a818594c6c1f37d9"}},{"ruleId":"D1","level":"warning","message":{"text":"build-benchmark-report.html.renderMetadata (cyclomatic 16): build-benchmark-report.html.renderMetadata has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/benchmark_assets/runs/2025-12-08/build-benchmark-report.html"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd2ae77922c031802c82343b86dbf0fd6e623007e35b4cf76bac66c3c48d0f7"}},{"ruleId":"D1","level":"warning","message":{"text":"startup-benchmark-report.html.frameworkVersion (cyclomatic 16): startup-benchmark-report.html.frameworkVersion 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":"docs/benchmark_assets/runs/2026-07-30/startup-benchmark-report.html"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e39cb2dedffce0b22d874875097d7cb81b64886a37c3900a0762b5e41459db1"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.rootConnections (cyclomatic 16): graph-viewer.rootConnections has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7926052484ed94549a736afbc04e2f187aa048aa92ed18b74f3d69ef0b6dfb"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-viewer.switchMode (cyclomatic 16): graph-viewer.switchMode 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb0ca31b91ceeed528043d3d95d91572d4074d81ff3b3264c06b1e3e90eda5d"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.build (cognitive 338): Builder.build has cognitive complexity 338 (threshold 15). Drivers by points: if/else 92 (283 pts), loops 16 (32 pts), boolean chains 21, match/switch 1 (2 pts) (nesting depth added 208). 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecfb2eab36736fce5816a303c2307d050654a68dacd7953f732472daf1093cb"}},{"ruleId":"D2","level":"warning","message":{"text":"paint (cognitive 241): paint has cognitive complexity 241 (threshold 15). Drivers by points: ternaries 59 (116 pts), if/else 39 (59 pts), boolean chains 57, loops 7 (9 pts) (nesting depth added 79). Of this number, 202 points are the body\u0027s own statements and 39 belong to 23 function items inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbb3b98e0fe5a637d9585d053a9031be4ae8aa4a8930ed610c05019c356a156"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingContainerCallableChecker.checkImpl (cognitive 197): BindingContainerCallableChecker.checkImpl has cognitive complexity 197 (threshold 15). Drivers by points: if/else 87 (155 pts), boolean chains 27, match/switch 4 (11 pts), loops 2 (4 pts) (nesting depth added 77). To reduce it, split the body into named stages: move each independent 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1750be0505306ec1f324525e06611ad79c3f679ca555ede706164a91f68b4c46"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphExpressionGenerator.generateBindingCode (cognitive 160): GraphExpressionGenerator.generateBindingCode has cognitive complexity 160 (threshold 15). Drivers by points: if/else 60 (116 pts), boolean chains 31, match/switch 4 (7 pts), loops 2 (6 pts) (nesting depth added 63). To reduce it, split the body into named stages: move each independent 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebee016438a3b23af4ee1389f6334d41b8557b9105322d70143cdc456167abab"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingGraphGenerator.generate (cognitive 154): BindingGraphGenerator.generate has cognitive complexity 154 (threshold 15). Drivers by points: if/else 52 (108 pts), loops 18 (24 pts), boolean chains 16, match/switch 2 (6 pts) (nesting depth added 66). To reduce it, split the body into named stages: move each independent 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70a1b2a207c9e8fbff9f8603cdb52d4a0b12e534850b9e0eb1c27f147bfc252"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphChecker.checkImpl (cognitive 132): DependencyGraphChecker.checkImpl has cognitive complexity 132 (threshold 15). Drivers by points: if/else 45 (94 pts), boolean chains 18, match/switch 4 (11 pts), loops 6 (9 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"83426a2bfca2e51f4f98f9169cd59792ff65bb29e63c2737c93281c439cb5a52"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingGraphGenerator.computeRawInheritedGraphData (cognitive 107): BindingGraphGenerator.computeRawInheritedGraphData has cognitive complexity 107 (threshold 15). Drivers by points: if/else 20 (63 pts), loops 12 (32 pts), boolean chains 12 (nesting depth added 63). To reduce it, split the body into named stages: move each independent 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c548ad14b707fe5a6e79843fdbd3136cc9bdb4063ffcfcac44f22ac53de88fb"}},{"ruleId":"D2","level":"warning","message":{"text":"renderDetails (cognitive 100): renderDetails has cognitive complexity 100 (threshold 15). Drivers by points: if/else 27 (32 pts), ternaries 15 (29 pts), boolean chains 20, loops 10 (18 pts), other 1 (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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4692d1b37928f9d5b71fd3f8109f3cb8ea27ba8a42b2fa90a05b20c775a3bae"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch-all-ide-kotlin-versions.main (cognitive 90): fetch-all-ide-kotlin-versions.main has cognitive complexity 90 (threshold 15). Drivers by points: if/else 22 (53 pts), loops 13 (24 pts), ternaries 5 (9 pts), boolean chains 3, error handling 1 (nesting depth added 46). To reduce it, split the body into named stages: move each independent 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":"compiler-compat/fetch-all-ide-kotlin-versions.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5855e59713823d9dbd358a62587412aa6bd2fb8ce34406cfeb5de1ea00250d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingContainerTransformer.loadExternalBindingContainer (cognitive 88): BindingContainerTransformer.loadExternalBindingContainer has cognitive complexity 88 (threshold 15). Drivers by points: if/else 21 (72 pts), boolean chains 6, match/switch 1 (6 pts), loops 1 (4 pts) (nesting depth added 59). 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48a4b2b7a7b22e73bf1059ce8aefa6dce86f496cd50e275c305a48dda1819c9"}},{"ruleId":"D2","level":"warning","message":{"text":"indexGraph (cognitive 87): indexGraph has cognitive complexity 87 (threshold 15). Drivers by points: if/else 11 (32 pts), boolean chains 25, loops 13 (24 pts), ternaries 4 (6 pts) (nesting depth added 34). Of this number, 86 points are the body\u0027s own statements and 1 belongs to 11 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbd97571bb231432ba6a0766d9c61279fe9040316db44d7834b3e6ab9b70f31"}},{"ruleId":"D2","level":"warning","message":{"text":"startup-benchmark-report.html.renderBinaryMetrics (cognitive 85): startup-benchmark-report.html.renderBinaryMetrics has cognitive complexity 85 (threshold 15). Drivers by points: if/else 38 (68 pts), boolean chains 10, ternaries 4 (7 pts) (nesting depth added 33). Of this number, 40 points are the body\u0027s own statements and 45 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent 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":"docs/benchmark_assets/runs/2026-07-30/startup-benchmark-report.html"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86e5d8a534ee1771e7bdd0662df6249c7dfd3b34cb004ee6f294f8f742560d1"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphTransformer.prepareDependencyGraph (cognitive 83): DependencyGraphTransformer.prepareDependencyGraph has cognitive complexity 83 (threshold 15). Drivers by points: if/else 23 (54 pts), loops 10 (24 pts), boolean chains 5 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/DependencyGraphTransformer.kt"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"1422b25bf4137490ef175a968eb9b4f4762c397c000c0887dfb3fbd399d8af7a"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributedInterfaceSupertypeGenerator.computeContributionSupertypes (cognitive 82): ContributedInterfaceSupertypeGenerator.computeContributionSupertypes has cognitive complexity 82 (threshold 15). Drivers by points: if/else 26 (42 pts), loops 19 (31 pts), boolean chains 9 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb0436552d47d28162bcbaaf1bc61e7c841eb3d039a1bdbae0a5c2fdcc2f7d6"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingIndexLookups.build (cognitive 75): BindingIndexLookups.build has cognitive complexity 75 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 19 (32 pts), boolean chains 4 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndexLookups.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4389d7b927bf419f4bee4794005d818a015471072a4a07167b034b187c9d2bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"refreshView (cognitive 74): refreshView has cognitive complexity 74 (threshold 15). Drivers by points: ternaries 20 (31 pts), boolean chains 22, if/else 20 (21 pts) (nesting depth added 12). Of this number, 57 points are the body\u0027s own statements and 17 belong to 7 function literals inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b6c4c193ae0becefcec0546d8a1b2c1638804ad5064fe07c0a1bd86d5dfda8"}},{"ruleId":"D2","level":"warning","message":{"text":"MultibindsChecker.checkImpl (cognitive 72): MultibindsChecker.checkImpl has cognitive complexity 72 (threshold 15). Drivers by points: if/else 31 (58 pts), boolean chains 11, match/switch 1 (3 pts) (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MultibindsChecker.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"13810e86ea5000ff699bb2f73b9e7820bf260bd22539956f3d851f2710e7bc12"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingContainerClassChecker.checkImpl (cognitive 71): BindingContainerClassChecker.checkImpl has cognitive complexity 71 (threshold 15). Drivers by points: if/else 32 (58 pts), boolean chains 10, loops 2 (3 pts) (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerClassChecker.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09ef31eeec4f9d86a7ea431e8edc8eaf622bcca41c0dd79a8d4b3f3900ad9c9"}},{"ruleId":"D2","level":"warning","message":{"text":"boundaryContour (cognitive 71): boundaryContour has cognitive complexity 71 (threshold 15). Drivers by points: ternaries 22 (37 pts), if/else 12 (19 pts), boolean chains 7, loops 5 (7 pts), other 1 (nesting depth added 24). Of this number, 57 points are the body\u0027s own statements and 14 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d37b691be2bcbb23652cf220962d71acd79fa436713cc30c4b398d80abcfcf1"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingPropertyCollector.processBindingNode (cognitive 67): BindingPropertyCollector.processBindingNode has cognitive complexity 67 (threshold 15). Drivers by points: boolean chains 36, if/else 21 (30 pts), loops 1 (nesting depth added 9). 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"850bc588c34526880e0bfa19765cb035789a64a6062b6ebebe370da084de6f20"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.layoutRegions (cognitive 65): graph-viewer.layoutRegions has cognitive complexity 65 (threshold 15). Drivers by points: boolean chains 19, if/else 9 (19 pts), loops 13 (18 pts), ternaries 7 (9 pts) (nesting depth added 17). Of this number, 61 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c67406afb3a4cb767bd7ce57680b625d05c1faaa45bf8d3516fc902c8de753b"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphCreatorChecker.checkImpl (cognitive 64): DependencyGraphCreatorChecker.checkImpl has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (47 pts), boolean chains 7, loops 3 (5 pts), match/switch 2 (5 pts) (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphCreatorChecker.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f25fc452212e4311e1b1208486c090d6a1d73cdda407e69de36f8b3dab9d40"}},{"ruleId":"D2","level":"warning","message":{"text":"MembersInjectorTransformer.getOrGenerateInjector (cognitive 62): MembersInjectorTransformer.getOrGenerateInjector has cognitive complexity 62 (threshold 15). Drivers by points: if/else 32 (54 pts), loops 4 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c449464428a4356545e3acd711a1589de20bec805ff2daae2ac9df23873a342"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroResolutionService.classifyFileChange (cognitive 60): MetroResolutionService.classifyFileChange has cognitive complexity 60 (threshold 15). Drivers by points: if/else 27 (44 pts), boolean chains 16 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ce8166883c876beb583a412dbff4268205c20aa9f316024d264185ec4a5647"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregationChecker.checkImpl (cognitive 58): AggregationChecker.checkImpl has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (50 pts), loops 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AggregationChecker.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cac772e1a41ee820483855ad697e5a94d192640347404a650c2aaf15964c150"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceLibraryInputsKt.libraryInputs (cognitive 53): SourceLibraryInputsKt.libraryInputs has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 10 (20 pts), boolean chains 8 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/SourceLibraryInputs.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f65cd26dd6bbd00c596aa113045be696295df8bee9222e7b5a571911b44e56"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregationChecker.checkBindingContribution (cognitive 52): AggregationChecker.checkBindingContribution has cognitive complexity 52 (threshold 15). Drivers by points: if/else 25 (42 pts), boolean chains 6, loops 1 (2 pts), match/switch 1 (2 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AggregationChecker.kt"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bed005cb149efabf16b89ca4cd62ebed514e73deda21aaf9049421439a95e31"}},{"ruleId":"D2","level":"warning","message":{"text":"IrBindingGraph.finishSeal (cognitive 52): IrBindingGraph.finishSeal has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 2 (9 pts), boolean chains 2 (nesting depth added 33). 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a696f88206ab278836b327f7d89bbfad118eeb4a8b528b62136b6524452b1e7"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.buildCreator (cognitive 51): Builder.buildCreator has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (43 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e87a0a364b231d10d55513fb46d42090e04ab9ae578e1f8c7e99740b19ecc1f"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionInputCapture.capture (cognitive 49): ResolutionInputCapture.capture has cognitive complexity 49 (threshold 15). Drivers by points: loops 18 (35 pts), if/else 9 (10 pts), boolean chains 4 (nesting depth added 18). 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/ResolutionInputCapture.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee57b861be3efb1e4feb26821744b376fe3319a21d3d2937a955edf1aea37348"}},{"ruleId":"D2","level":"warning","message":{"text":"BetterKotlinLikeDumper.printMemberAccessExpressionWithNoIndent (cognitive 49): BetterKotlinLikeDumper.printMemberAccessExpressionWithNoIndent has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (35 pts), match/switch 2 (6 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 20). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4960b45cd8b2dd670b95286385531e27a69160ddd256b7e1e6468fdf4121fa73"}},{"ruleId":"D2","level":"warning","message":{"text":"MultibindingExpressionGenerator.generateMapMultibindingExpression (cognitive 48): MultibindingExpressionGenerator.generateMapMultibindingExpression has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (35 pts), boolean chains 6, match/switch 3 (5 pts), loops 1 (2 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/MultibindingExpressionGenerator.kt"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d24171aa908a310dd9e67bcf2ec67fe300ed0d51b9a11c95b8b96462e943a5"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroResolutionService.drainCoordinatorEvents (cognitive 48): MetroResolutionService.drainCoordinatorEvents has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 9, match/switch 3 (8 pts), loops 1 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d54eab7981aec12b4b4cd0417970b009f8fd84ec6233adbbd61bda014f1cecb"}},{"ruleId":"D2","level":"warning","message":{"text":"FileShardBuilder.processBindingCallable (cognitive 47): FileShardBuilder.processBindingCallable has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 3 (8 pts), boolean chains 5, match/switch 3 (4 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"78969e588445417220e89b01989b5e177090615cf10e015c6d4b6b452e980042"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroSortKt.computeStronglyConnectedComponents (cognitive 47): MetroSortKt.computeStronglyConnectedComponents has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (38 pts), loops 6 (9 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/MetroSort.kt"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"21868f2b7ed25860e6b8c9117ee514f827a0289f7d49e8ad95a31146aece8415"}},{"ruleId":"D2","level":"warning","message":{"text":"MembersInjectChecker.checkImpl (cognitive 46): MembersInjectChecker.checkImpl has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 7, loops 2 (4 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MembersInjectChecker.kt"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0cb2735ef4525eb3ccdd84c7cd35fff96e8aaa2bd1137a9d7e4b6029917fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"IrContributionMerger.computeContributions (cognitive 46): IrContributionMerger.computeContributions has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 13 (20 pts), boolean chains 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee93175b428c1d3d51f2d4015e42218f48a30b574e40d798e3f3e265770f20c"}},{"ruleId":"D2","level":"warning","message":{"text":"projectGraph (cognitive 46): projectGraph has cognitive complexity 46 (threshold 15). Drivers by points: if/else 6 (18 pts), ternaries 3 (10 pts), boolean chains 9, loops 5 (9 pts) (nesting depth added 23). Of this number, 44 points are the body\u0027s own statements and 2 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd1013f815f4031ba9167564354ec6a16bd52bac49dc53f97bd642b0c209120"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryIndexPostProcessor.bindingSeeds (cognitive 45): LibraryIndexPostProcessor.bindingSeeds has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 4 (9 pts), boolean chains 6 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryIndexPostProcessor.kt"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b100fdf0a888a9093ed0d70b8d3b6dfce39efa9c2057ed604f4f3ab9ec3023"}},{"ruleId":"D2","level":"warning","message":{"text":"buildView (cognitive 45): buildView has cognitive complexity 45 (threshold 15). Drivers by points: boolean chains 21, ternaries 11 (13 pts), if/else 10 (11 pts) (nesting depth added 3). Of this number, 28 points are the body\u0027s own statements and 17 belong to 8 function literals inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fb6931c57d8b289975bdd1e2aa38da52be282d0907cc3831ef1924f42d012a"}},{"ruleId":"D2","level":"warning","message":{"text":"BindsMirrorClassTransformerKt.transformBindingDeclarations (cognitive 44): BindsMirrorClassTransformerKt.transformBindingDeclarations has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 9, match/switch 2 (5 pts), loops 2 (3 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindsMirrorClassTransformer.kt"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"88450c696998ce03283fdb9141620f4ca0343c4169c16424b1fd0fc44be16a20"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingExtractionKt.classBindingData (cognitive 44): BindingExtractionKt.classBindingData has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (26 pts), boolean chains 15, match/switch 1 (2 pts), loops 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/BindingExtraction.kt"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"292805e1bd44902d3e9e4f75c24314be7c83664c820f4cd1e73155c697b57b94"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroAnnotationsKt.metroAnnotations (cognitive 42): MetroAnnotationsKt.metroAnnotations has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 5 (12 pts), boolean chains 6, loops 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e1555d1225bf275f7149654096693a8329f4be68e6fc53ccb819681e9e77ae"}},{"ruleId":"D2","level":"warning","message":{"text":"IrGraphGenerator.implementOverrides (cognitive 42): IrGraphGenerator.implementOverrides has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 9, loops 4 (5 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16ee8f6779999b53e6823d289170619fdd2b89509fda8876cfa3969774ad763"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroAnnotationsKt.metroAnnotations (cognitive 41): MetroAnnotationsKt.metroAnnotations has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 9, match/switch 3 (8 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"0753b1ce070589a6c11fd971958d95811baab21a503b0f463fc5f7749c60ebac"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroCompilerPluginRegistrar.registerExtensions (cognitive 41): MetroCompilerPluginRegistrar.registerExtensions has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 3, error handling 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroCompilerPluginRegistrar.kt"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a220e08263ce1609d8f52fb5100a05ef9032c054345b517d68154a3a0739725"}},{"ruleId":"D2","level":"warning","message":{"text":"IrGraphGenerator.collectShardPropertyInitializers (cognitive 41): IrGraphGenerator.collectShardPropertyInitializers has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 6, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc026745f4a9425653a5e043f445fd92b5e5d9afcdf48e50b1bcd07f2c0750f"}},{"ruleId":"D2","level":"warning","message":{"text":"LifecycleWarningsKt.reportLifecycleWarnings (cognitive 41): LifecycleWarningsKt.reportLifecycleWarnings has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 3 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/LifecycleWarnings.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"553e70fb1fe93b2feb5a1b141dbc4dcdb4cec8f8cac98121a5dcc1b195abc57a"}},{"ruleId":"D2","level":"warning","message":{"text":"IrKt.materializeWrappedType (cognitive 41): IrKt.materializeWrappedType has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (36 pts), boolean chains 4, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb4c623326ef0c58a0946bc0210d457be38cb7440ca091b65dd51e38073a93b"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingIndex.bindingCandidateRejection (cognitive 41): BindingIndex.bindingCandidateRejection has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 6, match/switch 3 (4 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabf3622a32d941d8c6f4332c381eaa03605acbbb02e8697651d6f309344223a"}},{"ruleId":"D2","level":"warning","message":{"text":"AssistedInjectChecker.checkAssistedFactory (cognitive 40): AssistedInjectChecker.checkAssistedFactory has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (31 pts), loops 2 (7 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AssistedInjectChecker.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e05d3131a23eba0608569af049381f176ca37423face82a4b1f520fbb6b9648"}},{"ruleId":"D2","level":"warning","message":{"text":"IrDeclarationRenderingKt.renderForDiagnosticImpl (cognitive 40): IrDeclarationRenderingKt.renderForDiagnosticImpl has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (36 pts), boolean chains 3, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/irDeclarationRendering.kt"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f056bfc04e265c3c595374f14d2fc7c24fa748e2186ee2bcc7fccb9155d44472"}},{"ruleId":"D2","level":"warning","message":{"text":"layoutBindings (cognitive 40): layoutBindings has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 5 (18 pts), loops 8 (12 pts), if/else 3 (6 pts), boolean chains 3, other 1 (nesting depth added 20). Of this number, 33 points are the body\u0027s own statements and 7 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c225eabe679badbecee91b55e063ed3b5570af1bc98061ee628103425dd6ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"layoutNeighborhood (cognitive 39): layoutNeighborhood has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 4 (11 pts), loops 6 (8 pts), boolean chains 7 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 9 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb8f830f45499a25b4e45860137cc303f437a58bb81f8b1f13c7d24bf8f4eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphChecker.checkStaticCreatorCollisions (cognitive 37): DependencyGraphChecker.checkStaticCreatorCollisions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 3, loops 2 (3 pts), match/switch 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"a044c4bf4e94964af93c7e8233cf5416c209654c457cd7d2453117a894046505"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingPropertyCollector.collect (cognitive 37): BindingPropertyCollector.collect has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 6 (10 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee5a8fdeebb032d1776d9a63127abc3cd4c5c9da42b410a074672d7455e29fa"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryContributionScanner.processLibraryHint (cognitive 37): LibraryContributionScanner.processLibraryHint has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11, boolean chains 9, loops 5 (9 pts), match/switch 2 (8 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryContributionScanner.kt"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7256a5c69b41b91cd77047e117f4abf0d759e16c776d42e6d9fe0c1e10a4b0"}},{"ruleId":"D2","level":"warning","message":{"text":"offsetContour (cognitive 37): offsetContour has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 4 (7 pts), boolean chains 5, ternaries 1 (nesting depth added 13). Of this number, 32 points are the body\u0027s own statements and 5 belong to 11 function items inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f3227a04f27f495fc39eea77cf8410621637af48b15b066dea6981c4646112"}},{"ruleId":"D2","level":"warning","message":{"text":"InjectedClassFirGenerator.generateFunctions (cognitive 36): InjectedClassFirGenerator.generateFunctions has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 4 (9 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d013dcc6d4a12391ab383544bd121bdff02a42bdd78b3bef2d3732d53b63d6"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidationSourceSnapshot.capture (cognitive 36): ValidationSourceSnapshot.capture has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 8 (13 pts), match/switch 1 (3 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/ValidationSourceSnapshot.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"423c96f473435dd89bdf02df2482a6ee21de87c973aceae810c64723e414315a"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryIndexPostProcessor.resolveLibraryInjectBindings (cognitive 36): LibraryIndexPostProcessor.resolveLibraryInjectBindings has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 5 (9 pts), boolean chains 2 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryIndexPostProcessor.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e050c0119fb6913d97ebb5275be9da60344dbb41fd5e27fb5b6bc3445bd54bc"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingIndex.selectedGraphComposition (cognitive 36): BindingIndex.selectedGraphComposition has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 6 (9 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"80908d472642e1d90c9a57e4e8be4d76dbbc00f052991228b938cd0be8a09489"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroLineMarkerProvider.consumerMarker (cognitive 35): MetroLineMarkerProvider.consumerMarker has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 5, match/switch 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee97983f9fd6873a3df4a80233b92c9c89fbc45a3431ac2f5985026262a8896"}},{"ruleId":"D2","level":"warning","message":{"text":"renderExplanations (cognitive 35): renderExplanations has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 4 (14 pts), loops 5 (11 pts), boolean chains 6, if/else 2 (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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bce63962db5f19a22833fc5c3b75a824ffe73c264442d1c1e203245b3b9074"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.buildExternalGraphOrBindingContainer (cognitive 34): Builder.buildExternalGraphOrBindingContainer has cognitive complexity 34 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 8 (15 pts), boolean chains 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c5cf3d1c93ec1b56bde103e85a526edda4531908100969ca8e55cadc6c9820"}},{"ruleId":"D2","level":"warning","message":{"text":"ShardingDiagnostics.generateShardingPlanReport (cognitive 34): ShardingDiagnostics.generateShardingPlanReport has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 8 (13 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/sharding/ShardingDiagnostics.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"18940f63191a7bee73b894531a083eda3b4e55248080b02e0e08d08c4392fbee"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateGraphChecker.checkImpl (cognitive 33): CreateGraphChecker.checkImpl has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 2, loops 1 (2 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/CreateGraphChecker.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4e8921577efab95ec38c39ded1ed36f0dfa826fa704f9f61fed9c1aa88eb75"}},{"ruleId":"D2","level":"warning","message":{"text":"FirKt.argumentAsOrNull (cognitive 33): FirKt.argumentAsOrNull has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 2 (7 pts), loops 2 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/fir.kt"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c7cd9b7e40b1bdf8a65ecce513a24075573e8f009e5b776dd97c56e548f6d8"}},{"ruleId":"D2","level":"warning","message":{"text":"IrBindingGraph.validateBindings (cognitive 33): IrBindingGraph.validateBindings has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 9, loops 1 (2 pts), 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d56332c64a9947e148d26fa20ce1cbc031c4ca013166f8cb7295ca4abbb694"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributionIrTransformer.generateContributionProviderFunctions (cognitive 33): ContributionIrTransformer.generateContributionProviderFunctions has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 2 (4 pts), boolean chains 3, loops 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74d0c79050d3b934d20f0fa8d28b397b98d6ff9ecd1fb01ac2500fc65f456a9"}},{"ruleId":"D2","level":"warning","message":{"text":"KaBindingLookup.delegateToParentIfScoped (cognitive 33): KaBindingLookup.delegateToParentIfScoped has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (28 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingLookup.kt"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"da139a408a6856347c299b68f4dd41aba0d5fc75c67c55291bedb16b3b4e40a8"}},{"ruleId":"D2","level":"warning","message":{"text":"InjectionSiteChecksKt.validateInjectionSiteType (cognitive 32): InjectionSiteChecksKt.validateInjectionSiteType has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 6, match/switch 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/injectionSiteChecks.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0fda3d2769967197668dc9df48412b7297d4b9a759a3ee8866437be91f980c"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphExpressionGenerator.generateBindingArguments (cognitive 32): GraphExpressionGenerator.generateBindingArguments has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (19 pts), loops 3 (8 pts), boolean chains 4, match/switch 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fd2cc7784fa20aeb36680a84123d98f837eb4f02ff3a8ed47dbbc6d6fc8a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphReportRendererKt.bindingType (cognitive 32): GraphReportRendererKt.bindingType has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfad477befb84be0812a8fed06e8e6c331be253e3fd22b5310215dc266b97744"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableBindingGraph.populateGraph (cognitive 32): MutableBindingGraph.populateGraph has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 5 (12 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/BindingGraph.kt"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"096e587553e0e0d82575ebf5fdc2eed5199056e5cc181165fac8532aea6bb800"}},{"ruleId":"D2","level":"warning","message":{"text":"MapKeyChecker.check (cognitive 31): MapKeyChecker.check has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 16). 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MapKeyChecker.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8f40db7ae9ae4833f2dc81a7ac5f0110b7b3bb0784e8806452ca5e9aaf0dca"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributionIrTransformer.transformTopLevelContributionProvider (cognitive 31): ContributionIrTransformer.transformTopLevelContributionProvider has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (26 pts), loops 2 (4 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fd42aac500a6e35838262fe00fbd75a0e82dcca26259ee76769bcee6937eff"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroResolutionService.buildResolutionCandidate (cognitive 31): MetroResolutionService.buildResolutionCandidate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14, error handling 10, boolean chains 6, 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5113c1aac2886d9c41efade1a72de92d1e87e287cce71febdfed843928fbad"}},{"ruleId":"D2","level":"warning","message":{"text":"CircuitInjectClassChecker.checkImpl (cognitive 30): CircuitInjectClassChecker.checkImpl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 3 (7 pts), boolean chains 2, 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitInjectChecker.kt"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b62c20b350fbb758c2069a6662676e30ecdb1ec339211f0d6de7fa0ef6e85d8"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildersKt.copyParameters (cognitive 30): BuildersKt.copyParameters has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 1 (2 pts), loops 1 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/builders.kt"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd28d2c4547731e334962da0ecde4b91a424555fc4ba2fae0d179ace0066db2"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDeclarationExtractor.extract (cognitive 30): GraphDeclarationExtractor.extract has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (8 pts), boolean chains 2, match/switch 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphDeclarationExtractor.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf027e71abb7194469085ef0edb55f6aa14963da7776013d43cff5ea4c88373"}},{"ruleId":"D2","level":"warning","message":{"text":"startup-benchmark-report.html.renderMetadata (cognitive 30): startup-benchmark-report.html.renderMetadata has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 29, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/benchmark_assets/runs/2026-07-30/startup-benchmark-report.html"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0658b81e160e3eb2f5372f8dcc6d60b9ae3eb037c7db3e9b15b3d9009d5460"}},{"ruleId":"D2","level":"warning","message":{"text":"IrKt.renderTo (cognitive 29): IrKt.renderTo has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 6 (10 pts), loops 1 (3 pts), boolean chains 1 (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. This shape REPEATS in the file: one other method here (IrKt.renderTo) 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5830e564d28f675c05bc756c382c9a3238898f05cd5953e6070f077da3448e"}},{"ruleId":"D2","level":"warning","message":{"text":"IrKt.renderTo (cognitive 29): IrKt.renderTo has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 6 (10 pts), loops 1 (3 pts), boolean chains 1 (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. This shape REPEATS in the file: one other method here (IrKt.renderTo) 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2030dab11ba4658e7845b23964348c36809d8eca11506eea4338cf6d264ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"InjectedClassTransformer.getOrGenerateFactory (cognitive 29): InjectedClassTransformer.getOrGenerateFactory has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (21 pts), match/switch 2 (5 pts), loops 1 (2 pts), boolean chains 1 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99c99ec9854f886c41a128b7847c276f617414fac94e1ffa9940a92de9909f6"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroGradleSubplugin.applyToCompilation (cognitive 29): MetroGradleSubplugin.applyToCompilation has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (28 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":"gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/MetroGradleSubplugin.kt"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a78f7caaa12db18dd1c745440135a0a48f310317200947a8449675b087dfe06"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroLineMarkerProvider.collectNavigationMarkers (cognitive 29): MetroLineMarkerProvider.collectNavigationMarkers has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 3, match/switch 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3005f9dfa50064066156a977394dcdd3995d032eab1b2970a0fe6e9cc7ab5c"}},{"ruleId":"D2","level":"warning","message":{"text":"IrBindingGraph.findSimilarBindings (cognitive 28): IrBindingGraph.findSimilarBindings has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 5, loops 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d0b53c24be764b91de379c39655a1d33e71e4e7c83b8d8e464b54acf7f2253"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributionEditKt.applyContribution (cognitive 28): ContributionEditKt.applyContribution has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributionEdit.kt"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb1c28e5a9a82c730dbce4b8a95e91eb46cc6851e4e1dd1a69546feee5e3a28"}},{"ruleId":"D2","level":"warning","message":{"text":"build-benchmark-report.html.renderMetadata (cognitive 28): build-benchmark-report.html.renderMetadata has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 27, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/benchmark_assets/runs/2026-07-30/build-benchmark-report.html"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"5feba25e003793a755b56eb99700e15dae13eaf78e66f17cc89baa8edd434b72"}},{"ruleId":"D2","level":"warning","message":{"text":"IrDiagnosticsKt.reportCompatImpl (cognitive 27): IrDiagnosticsKt.reportCompatImpl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5, loops 1 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrDiagnostics.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d99e2b0af3deddc45676befc4f334878d5e354cf977543fee0ea468c222b9c"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingContainerTransformer.getOrLookupProviderFactory (cognitive 27): BindingContainerTransformer.getOrLookupProviderFactory has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 3 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1f01d8415da0b901b4585a7447d4eac40c73571152e9a3768fbc2621e99950"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateGraphTransformer.visitCall (cognitive 27): CreateGraphTransformer.visitCall has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 6, 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/CreateGraphTransformer.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccecfe9f4e566b6596a4d2502f39191b5af6079230b5c26788e15f3a7fe2665"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroValidationSelectionKt.validationSelectionVisitor (cognitive 27): MetroValidationSelectionKt.validationSelectionVisitor has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroValidationSelection.kt"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a1b4316a96ec0ceedd86ff1a7411130b8755835dd8ffca25cc9952b1484a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"FileShardBuilder.processInjectAnnotated (cognitive 26): FileShardBuilder.processInjectAnnotated has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 1 (3 pts), match/switch 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"9193b3c25ac49400793aa15d5c1ec888d045833a75effcbb7d1f16c89cacc9de"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 26): (anonymous) has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (7 pts), loops 4, ternaries 3 (4 pts) (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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2db1d1685ae8611bfdda7bd0919b963fd0b9e75d381efd579d118353cf80ff"}},{"ruleId":"D2","level":"warning","message":{"text":"FactoryIrUtilKt.generateMetadataVisibleDeclarationMirror (cognitive 25): FactoryIrUtilKt.generateMetadataVisibleDeclarationMirror has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 4, loops 1 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/factoryIrUtil.kt"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"4592987afa19ba52ed7591e9fce77d7e083d9c6d29bcc998190af6ca00f0437f"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticRenderer.render (cognitive 25): DiagnosticRenderer.render has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, loops 2 (3 pts), 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/diagnostics/render/DiagnosticRenderer.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ad06ede8fddbae0d10f84946082a07e9aa1630b357fa91519e1503e4401bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultValuesUtilKt.copyParameterDefaultValues (cognitive 24): DefaultValuesUtilKt.copyParameterDefaultValues has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/DefaultValuesUtil.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c14d289030cd9db49e73f6c2d748d2d992d2ca2dc523b883ce3adf8b78444b"}},{"ruleId":"D2","level":"warning","message":{"text":"Entry.injectedAt (cognitive 24): Entry.injectedAt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e719b02cd6b4b107e0fe684d2c38d04cc28758e0771e25baf0456dcc78795563"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroLineMarkerProvider.validateMarker (cognitive 24): MetroLineMarkerProvider.validateMarker has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b893e9f13a4ebb5c508fff18aaff446ae9c8a19255c76f5512292a3d3ff5d3a"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroResolutionService.indexForToolWindow (cognitive 24): MetroResolutionService.indexForToolWindow has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 5 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8071bdb2cbf3d70e0415f02733988d5394bc1baa6d013fd64317223336b89b"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributionMapKeysKt.mapKeyChoice (cognitive 24): ContributionMapKeysKt.mapKeyChoice has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributionMapKeys.kt"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1c45725ffba484b79097d5390253158b946e51b39b3f26ebff72300d3d51ed"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingIndex.isConsumerInContext (cognitive 24): BindingIndex.isConsumerInContext has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a95f1ff25d9ee120c1fe343214d07c644197d789c021bc853f2a0bcdff286f"}},{"ruleId":"D2","level":"warning","message":{"text":"IdeTraceTimeline.lanes (cognitive 24): IdeTraceTimeline.lanes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceTimeline.kt"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"277dd1f46d3ae9585b10ae2ba5e46971afbf8e8c367f7c8d31d4ceafb595891e"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableBindingGraph.prepareSeal (cognitive 24): MutableBindingGraph.prepareSeal has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 6 (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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/BindingGraph.kt"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19ebb476e5d054f479ffdedf895fbbbfd1eae083d5f745e94584705b54ad988"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.groupPackages (cognitive 24): graph-viewer.groupPackages has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 4 (5 pts), ternaries 2 (4 pts) (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 9 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"580421a70fb4149415fad781c56a24b052b519a0613ff416b097774087fc3159"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.exploredNeighborhood (cognitive 24): graph-viewer.exploredNeighborhood has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 4 (7 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"3989e0f935591fb8278a46f1fc0e0283cefaf77fd17dbc380551cbbf7ae98def"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 24): (anonymous) has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd5c96401eacec75dc172b763622d804f291af2c998d392848a4187e63b0a78"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphLifecycleCheckerKt.checkGraphLifecycle (cognitive 23): GraphLifecycleCheckerKt.checkGraphLifecycle has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/GraphLifecycleChecker.kt"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99c4ab5b649922f011efc3e8d6b408547a887e11f7fa45914c2f11ca9ee2ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"MergedContributionChecker.checkImpl (cognitive 23): MergedContributionChecker.checkImpl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MergedContributionChecker.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb7d36abf855d4ef3d93a28626cb9ec24f7434045feab6a9d78cdacde73d305"}},{"ruleId":"D2","level":"warning","message":{"text":"IrBindingGraph.findSimilarMultibindings (cognitive 23): IrBindingGraph.findSimilarMultibindings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (22 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c5e7168ba0832042fd57e6737e1a08a6a37f7af03324c615e67b3a3d0506dc"}},{"ruleId":"D2","level":"warning","message":{"text":"MultibindingExpressionGenerator.generateSetBuilderExpression (cognitive 23): MultibindingExpressionGenerator.generateSetBuilderExpression has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/MultibindingExpressionGenerator.kt"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5067cef5ee1cc81bcc306096e5c0e5f8a4222579569a3f8fd5d9cb0e1f678efa"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepTypeSubstitutor.remapType (cognitive 23): DeepTypeSubstitutor.remapType has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (7 pts), boolean chains 2 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/irTypes.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef457a541febbd3362f661f691d89f3da8dd772c0519763e9d17faf280302d7"}},{"ruleId":"D2","level":"warning","message":{"text":"FileShardBuilder.recordAnnotationDependencies (cognitive 23): FileShardBuilder.recordAnnotationDependencies has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"21437e4767b195e72036a4d4502f8a45aa3aa5ea4a7e301badabefc015450436"}},{"ruleId":"D2","level":"warning","message":{"text":"InjectionTargetsKt.injectionAnnotationTargets (cognitive 23): InjectionTargetsKt.injectionAnnotationTargets has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/injection/InjectionTargets.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6437186cf35017f416fd5ac573613d31a9f72d3208f43930797408a3b264e1"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.neighborhood (cognitive 23): graph-viewer.neighborhood has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), ternaries 2 (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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a989668911c4d3e04b4071f0f86ab0710c4c6598f8c053cced26517b11da26"}},{"ruleId":"D2","level":"warning","message":{"text":"CircuitFirExtension.generateConstructors (cognitive 22): CircuitFirExtension.generateConstructors has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts), match/switch 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitFirExtension.kt"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7086e91a3cb80f166b6ce7d3bab0150a7603a21ec531361f47ce2713315a969"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributionsFirGenerator.generateFunctions (cognitive 22): ContributionsFirGenerator.generateFunctions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2cdfde20c2501e336e756374a59d0e5b408223eee291f859f97433ee73affe"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingPropertyCollector.knownPropertyType (cognitive 22): BindingPropertyCollector.knownPropertyType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 8, 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7d741b0b5e8ddcad994577405103bb50d5a111a20a04e17c26d1a9ee4c832c"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingContainerTransformer.findContainer (cognitive 22): BindingContainerTransformer.findContainer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8, match/switch 1 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b9de404e86185302342b588d82a2f2e37582be1814896da28c34cd510048d3"}},{"ruleId":"D2","level":"warning","message":{"text":"BindsMirrorCollector.add (cognitive 22): BindsMirrorCollector.add has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindsMirrorCollector.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"60262a45f08c84119bac8c58c5a561124ffbd44658f03117a1021004aa5f3bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributionIrTransformer.collectContributionDataFromSourceClass (cognitive 22): ContributionIrTransformer.collectContributionDataFromSourceClass has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"037fb3cb1d4666a6803600c81d3b2e87b9bfcf1dff2687cb52dc1370c94874c8"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionBuilder.selectRegions (cognitive 22): RegionBuilder.selectRegions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 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":"graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbde84625ecb9cdefa50a71c0a96b7e28f19a06bbd8d45cb650ca85d5572ef3d"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroResolutionService.startPendingFilePresentationAnchors (cognitive 22): MetroResolutionService.startPendingFilePresentationAnchors has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 3 (6 pts), boolean chains 3, 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"d261d7bd4f36b4f24fa354ce8e4dcc375d51fed495bd3985be679db4a25e212e"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributionMergingKt.applyExcludesAndReplaces (cognitive 22): ContributionMergingKt.applyExcludesAndReplaces has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/ContributionMerging.kt"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3677eefeb03224605d55fed2a422f47a7ac30329c55836a68d1fd10f015e267"}},{"ruleId":"D2","level":"warning","message":{"text":"SuspendBindingValidator.runtimeRequirement (cognitive 22): SuspendBindingValidator.runtimeRequirement has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5, loops 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/SuspendBindingValidator.kt"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"319952d1a69824b9fcb819f59ad8606159ea2c50f7b5bdb379abfe8fa0e0fe77"}},{"ruleId":"D2","level":"warning","message":{"text":"SuspendBindingWorklist.expand (cognitive 22): SuspendBindingWorklist.expand has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/SuspendBindingWorklist.kt"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e5d025d762ab1b0b94009800d07b15be5a77f8e0d88d9017cc4dbc45f93d0c"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.projectBoundaryNode (cognitive 22): graph-viewer.projectBoundaryNode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 10). Of this number, 14 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"09566a98fa6ebaef27722ffc57ffab83eefe96475bbdbba7a5e5678748c9920f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 22): (anonymous) has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 5 (7 pts), boolean chains 4 (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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"696393774342ff599a5ce5721c8f445bf8b047479862742560aed261e946d571"}},{"ruleId":"D2","level":"warning","message":{"text":"CircuitInjectCallableChecker.checkTarget (cognitive 21): CircuitInjectCallableChecker.checkTarget has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitInjectChecker.kt"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a8a0fedbf550f4490dfa3e4ad920579f463bb76bcd42cc1494b506f2f8939f"}},{"ruleId":"D2","level":"warning","message":{"text":"InjectedClassFirGenerator.getNestedClassifiersNames (cognitive 21): InjectedClassFirGenerator.getNestedClassifiersNames has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"c073802d48067c047384a1908807816046a0f3072a8074ec2f78ac5bed2a9ecf"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroLineMarkerProvider.specializedConsumerMarker (cognitive 21): MetroLineMarkerProvider.specializedConsumerMarker has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cc2d3f63277f6ecbd45467a0362c6c48cfe2d19d907a97ce6aa088af7bbb61"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroResolutionService.publishCompletedFilePresentationAnchors (cognitive 21): MetroResolutionService.publishCompletedFilePresentationAnchors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee0098bf5a1aa384e2844321ec51e4849c2b4447feb0f4c8b8f58ba6d97dbcb"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributionCandidateKt.contributionCandidate (cognitive 21): ContributionCandidateKt.contributionCandidate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, boolean chains 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributionCandidate.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9423eec0966726cd869b3c13a4d94cd25fc8615b31bb727d450cc7a827f0113"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingIndex.isSupersededByNearerInheritedBinding (cognitive 21): BindingIndex.isSupersededByNearerInheritedBinding has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3ed28abcdf3df525ba25493172bc96247965cacbe649704d8b79b16833114b"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphPartitionerKt.partitionBySCCs (cognitive 21): GraphPartitionerKt.partitionBySCCs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/GraphPartitioner.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ddb20960dcadc58a87e4a3e10b76a3a221b57baff29b688a8ee2525e6733df"}},{"ruleId":"D2","level":"warning","message":{"text":"SuspendBindingWorklist.buildWitnessEdges (cognitive 21): SuspendBindingWorklist.buildWitnessEdges has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (7 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/SuspendBindingWorklist.kt"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5176e4b716e90b6c752696b883cc422f786073af378f344fc2daaf67d4fbbf"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.layoutRadial (cognitive 21): graph-viewer.layoutRadial has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (7 pts), loops 4 (5 pts), ternaries 2 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86974ce4b82489292c771c7eb6404163dca4510c7ed2c9a68c3f838818dc181"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.visibilityBoundaries (cognitive 21): graph-viewer.visibilityBoundaries has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (5 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"366db12b8d03e4eebc8eaa42d17b781f7aa0ea4c7867e40a9a41191aca8cd818"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.attentionFor (cognitive 21): graph-viewer.attentionFor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 1 (2 pts), ternaries 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b097c410e1114729aa6b0565b955fc9c02299467a41bee118ee0306d14a8d75"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.document.addEventListener(\u0022keydown\u0022) (cognitive 21): graph-viewer.document.addEventListener(\u0022keydown\u0022) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0907d47cc631af8f73c1308296e3ff88508c4566889e1a212cc7e6cbbf8c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributionProviderNamesKt.contributionProviderFunctionName (cognitive 20): ContributionProviderNamesKt.contributionProviderFunctionName has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 1, match/switch 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ContributionProviderNames.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dcdf340c2f7e631367c7dc77a3d2467cf373da6da5bf3db64e7d3a4fb3af41"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributesToBindingContainerChecker.hasSafeAncestors (cognitive 20): ContributesToBindingContainerChecker.hasSafeAncestors has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/ContributesToBindingContainerChecker.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30d61431e894eed4165031997f3e4c998af101cd5091dbcebf09b69cbd50a09"}},{"ruleId":"D2","level":"warning","message":{"text":"ParentContext.resolve (cognitive 20): ParentContext.resolve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 10). 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ParentContext.kt"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"733bfd3b0d67dfb9f023453795302a00949fcded253a062db02e5a7c8d51cb73"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntheticGraphGenerator.validateOverrides (cognitive 20): SyntheticGraphGenerator.validateOverrides has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/SyntheticGraphGenerator.kt"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b83213dea39d0aacc81ee3ca4068a5c2537ef4ebf3b2f5a5a9f7085a9237e83"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphExtensionExtractionKt.graphExtensionFactoryOwner (cognitive 20): GraphExtensionExtractionKt.graphExtensionFactoryOwner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphExtensionExtraction.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e566f43edd69222304ea5ddcf7d7b10cafef4fb5a2af0645751f1126ca5b56"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphMemberExtractor.indexGraphCallable (cognitive 20): GraphMemberExtractor.indexGraphCallable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphMemberExtractor.kt"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddad572f863b44b67efb441e54b19af1e8d70c57ff2358651dbc7a07624e273"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticRenderer.renderFrames (cognitive 20): DiagnosticRenderer.renderFrames has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/diagnostics/render/DiagnosticRenderer.kt"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"809e8d6979f319a9b780db3d0738abdf1f25b0a11199d517dc78ae67aa465d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroSortKt.sortVerticesInSCC (cognitive 20): MetroSortKt.sortVerticesInSCC has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (4 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/MetroSort.kt"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb40f039f425a5bd7c5c3bca82789fca6e033bf842a7bc2988dc1f5938fd222"}},{"ruleId":"D2","level":"warning","message":{"text":"build-benchmark-report.html.frameworkVersion (cognitive 20): build-benchmark-report.html.frameworkVersion has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 7, ternaries 1 (2 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/benchmark_assets/runs/2026-07-30/build-benchmark-report.html"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7f15a7b6448d84698acbec61056cb50f46116e2c5c2aeebcedf125d7fc8f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"createBindingRow (cognitive 20): createBindingRow has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 4 (7 pts), boolean chains 4 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"5597601523f092741b021b2a13f138041bcda4f936aeb6b575b8f5912eb434b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayClassKeyValues.check (cognitive 19): ArrayClassKeyValues.check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (3 pts), 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/ArrayClassKeyChecker.kt"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cc1d1b570bcf90ee29c9b087e308a3a3c748e53b1a1074a3f88f53a26e8149"}},{"ruleId":"D2","level":"warning","message":{"text":"InjectConstructorChecker.checkImpl (cognitive 19): InjectConstructorChecker.checkImpl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/InjectConstructorChecker.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb5757f2e5d33bb0c2cf71efcf1d9cf65a3c3015e6f5525c662d218c339e6c3"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphFirGenerator.generateFunctions (cognitive 19): DependencyGraphFirGenerator.generateFunctions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, loops 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/DependencyGraphFirGenerator.kt"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"184eb559a473278c6ce90e885a334052f294836e3920b036539d6809c338edb6"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphMetadataReporter.buildBindingJson (cognitive 19): GraphMetadataReporter.buildBindingJson has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, match/switch 4, boolean chains 3, loops 1 (2 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"04399762a8a9fea54106f1ab9653c40835af8aa961f1f25bda8786c52dda5822"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingExpressionGenerator.toTargetType (cognitive 19): BindingExpressionGenerator.toTargetType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 4 (6 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/BindingExpressionGenerator.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefc8504ec58c8a7842478b1968790386ce436ab0dc606b87f8897cbc930ce24"}},{"ruleId":"D2","level":"warning","message":{"text":"IrKt.irInvokeResolved (cognitive 19): IrKt.irInvokeResolved has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, match/switch 2 (3 pts), loops 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5dc2cb6054a1ec5c170446174abf119cc31bdca4dc3d81ee8f79abf8abc526"}},{"ruleId":"D2","level":"warning","message":{"text":"FactoryIrUtilKt.addParameters (cognitive 19): FactoryIrUtilKt.addParameters has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/factoryIrUtil.kt"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58d0dde8d16dfe80e9357fc79e1d4dcf87049eca74381dcd0590bbe0fd0c37d"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionBuilder.findIncludedGraphs (cognitive 19): RegionBuilder.findIncludedGraphs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 8, 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":"graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af7f8b664fc7f7aaeaa82fc9498b6413a77329f61faeb2440f4daef8e7beb0f"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroEditorDiagnosticKt.metroDiagnosticsForFile (cognitive 19): MetroEditorDiagnosticKt.metroDiagnosticsForFile has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/diagnostics/MetroEditorDiagnostic.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea62d3baa793d7f811ec274e877ce18221f1756ac59ec4baa23e9763a5879d0"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphFactoryInputsKt.graphFactoryInputs (cognitive 19): GraphFactoryInputsKt.graphFactoryInputs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/GraphFactoryInputs.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1a1a3284067eafd3cdd190b308d24805facd559181714c0dfa06c1bdd88786"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphFactoryInputsKt.includedGraphDependency (cognitive 19): GraphFactoryInputsKt.includedGraphDependency has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/GraphFactoryInputs.kt"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3c9c9cce985b76961a117c110d34abb307dac9ce1f14285e7037956d5fe54d"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroResolutionService.index (cognitive 19): MetroResolutionService.index has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d244ec0d1234c6ab3893a59cb6862aa9b53c2b01d82b8e20e94665f097f0303"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceSnapshotTransaction.snapshot (cognitive 19): SourceSnapshotTransaction.snapshot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/SourceSnapshot.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"028709986cfa8c7c4e34acc988c1daff4d71bbe23f4d37a44ce393763377568c"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingIndex.consumersFor (cognitive 19): BindingIndex.consumersFor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd7cc9525ee657100f4e345f295782fc13b2559d50bc6e33abcf18441ce0e51"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroFindUsagesKt.collectMetroUsagesInReadAction (cognitive 19): MetroFindUsagesKt.collectMetroUsagesInReadAction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/usages/MetroFindUsages.kt"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde604297438619d64562ac9e6ba35d09727afb25795853516fc251bffa7427f"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingGraphValidator.validate (cognitive 19): BindingGraphValidator.validate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/BindingGraphValidator.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"19edcc84abe700ca570fa0bc70c0b576104670e686a1bdb100ea9070fb86ae7a"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.rootConnections (cognitive 19): graph-viewer.rootConnections has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (6 pts), boolean chains 4, ternaries 1 (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab41d0b02b55bbe800d54a9847771592a5784e8819103f34c87fe3e912b51209"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionInjectionChecker.checkImpl (cognitive 18): FunctionInjectionChecker.checkImpl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/FunctionInjectionChecker.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6609e60921357e06da8715659e61fbd92d35c2d2f520e33e7412922547dd9f"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributionsFirGenerator.getNestedClassifiersNames (cognitive 18): ContributionsFirGenerator.getNestedClassifiersNames has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"da624463e3d5dd5a7669c6be30f5e53e42cc55ab50ca198a29029bbd0e620d26"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphFirGenerator.computeCallableNames (cognitive 18): DependencyGraphFirGenerator.computeCallableNames has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/DependencyGraphFirGenerator.kt"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f068ec85d128a3fafdbc7b133a67a68f5fec64d0047b3c66c31b2a55e2aec7c0"}},{"ruleId":"D2","level":"warning","message":{"text":"IrGraphGenerator.computeBindingMetadata (cognitive 18): IrGraphGenerator.computeBindingMetadata has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4cc5458612cdb7287c1900f2bea61501f06b82295403458d30dc02edf18887"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphExpressionGenerator.generateNestedSuspendFactoryCall (cognitive 18): GraphExpressionGenerator.generateNestedSuspendFactoryCall has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"968c1889808a43ac28fa2b8239e6bb7e9510e1558231ea046ee8f441c7a5a21c"}},{"ruleId":"D2","level":"warning","message":{"text":"IrKt.typeRemapperFor (cognitive 18): IrKt.typeRemapperFor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (7 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":2324}}}],"partialFingerprints":{"codehealthFindingId/v1":"015b078f60d3836cbd632719e57ba61eaab1a944947f6d705707ec2dd42884cc"}},{"ruleId":"D2","level":"warning","message":{"text":"IrDeclarationRenderingKt.toUnknownLocationContext (cognitive 18): IrDeclarationRenderingKt.toUnknownLocationContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/irDeclarationRendering.kt"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e441dff3112a8134b248fa5de59c594fef4337ba875bc62583429cc67e21838"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingExtractionKt.bindingData (cognitive 18): BindingExtractionKt.bindingData has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/BindingExtraction.kt"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b86e2416dfa41654fef718b670c100ee23002a4d7fb9d82ca1fd3a2658cff9"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionSnapshotBuilder.containsRelevantAnnotation (cognitive 18): ResolutionSnapshotBuilder.containsRelevantAnnotation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/ResolutionSnapshotBuilder.kt"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ce10ab849a88df3325cf55b1eed4dcb79219fecde240da04b0c6a5bebf80b3"}},{"ruleId":"D2","level":"warning","message":{"text":"KaUtilKt.toKaAnnotationSnapshot (cognitive 18): KaUtilKt.toKaAnnotationSnapshot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/kaUtil.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d471a20f386e0262eff5eb12e44c158890b355b6026d2bd2c2bc79fcd1c1079c"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingIndex.candidateContextsFor (cognitive 18): BindingIndex.candidateContextsFor has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5585e63761aa925359121e94d35b14b2320f0689eb53d802489ca0fb18ebfff0"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticRenderer.renderCycle (cognitive 18): DiagnosticRenderer.renderCycle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (5 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/diagnostics/render/DiagnosticRenderer.kt"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0d000537c82dd98888029645a6d4699b481b33e638efd19362dabf7032481c"}},{"ruleId":"D2","level":"warning","message":{"text":"SuspendBindingValidator.validateGraphRequests (cognitive 18): SuspendBindingValidator.validateGraphRequests has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/SuspendBindingValidator.kt"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"19246f800f06b82bf0e5ce47929062c07a291188a0426f69210be604d70b26fa"}},{"ruleId":"D2","level":"warning","message":{"text":"BetterKotlinLikeDumper.printSimpleFunction (cognitive 18): BetterKotlinLikeDumper.printSimpleFunction has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5 (nesting depth added 3). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"821d440e518011ff043d3c7ba4220ec77b61715811324898d3e1f46058be6a61"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.rootRoute (cognitive 18): graph-viewer.rootRoute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), boolean chains 2 (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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d37fc709a1975868aa2fc927cc543dd1c5b0be47b35e25b2cf42ac0c4d1b7a"}},{"ruleId":"D2","level":"warning","message":{"text":"orientPoint (cognitive 18): orientPoint has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 4 (5 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"328289b3a5793fbe2967a8f6f10b5b99ec16b13261e8d76f4334ed37121e3f38"}},{"ruleId":"D2","level":"warning","message":{"text":"KotlinToolingVersion.compareTo (cognitive 17): KotlinToolingVersion.compareTo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 8. This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/src/main/kotlin/dev/zacsweers/metro/compiler/compat/KotlinToolingVersion.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8eaec97e2b1c0b918c80c39c1cfdee13714e311aaba6e45a29b5f985d41e769"}},{"ruleId":"D2","level":"warning","message":{"text":"CircuitInjectCheckerKt.validateCircuitInjectParams (cognitive 17): CircuitInjectCheckerKt.validateCircuitInjectParams has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitInjectChecker.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f2bd8c402ea8bee4a0f3cc8f725b65f88cba0514c294b51e7f2423c9efa4b2"}},{"ruleId":"D2","level":"warning","message":{"text":"CircuitIrFactoryTransformer.generateFunctionFactoryCall (cognitive 17): CircuitIrFactoryTransformer.generateFunctionFactoryCall has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae45497fbbecdbd4f15aa24e50c794feb92dc4847396f44732d9a24b63529160"}},{"ruleId":"D2","level":"warning","message":{"text":"CircuitSerializableClassChecker.check (cognitive 17): CircuitSerializableClassChecker.check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitSerializableChecker.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7b40ca71edfff399d82a5cf82235111668d82b9548782f8598a69eb8da7a46"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphLifecycleChecker.check (cognitive 17): GraphLifecycleChecker.check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 4, loops 2, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/GraphLifecycleChecker.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb67b323cec6673d59b994fe83e6ce4f5c509a02e425d924147e251cf94fe24"}},{"ruleId":"D2","level":"warning","message":{"text":"ContributedInterfaceSupertypeGenerator.getScopedContributions (cognitive 17): ContributedInterfaceSupertypeGenerator.getScopedContributions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"84478c217a03dc409f2d59d0e757fb8a0397b80ed5e924248aabac9f96089211"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphFirGenerator.getNestedClassifiersNames (cognitive 17): DependencyGraphFirGenerator.getNestedClassifiersNames has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/DependencyGraphFirGenerator.kt"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b7e0bdaffb310a738c6d1d584a3a0140d28b02af9d79dfa20c41c109c80159"}},{"ruleId":"D2","level":"warning","message":{"text":"InjectedClass.memberInjections (cognitive 17): InjectedClass.memberInjections has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e7283a43df7241b3d83fe13482355ac4df846b23c5007e24b183e7cf57cca7"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphMetadataReporter.write (cognitive 17): GraphMetadataReporter.write has cognitive complexity 17 (threshold 15). Drivers by points: loops 9 (13 pts), if/else 3 (4 pts) (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dca1d8e9cde640b20113eee23d3db0628755e9f561d40111bd2c6d8e8f26530"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTransformers.visitClassInner (cognitive 17): CoreTransformers.visitClassInner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/CoreTransformers.kt"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6b771d74ac3797a7e23841a42cb0941b8e12e16ecbfd71c11c79f69c7c5866"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphTransformer.reportUnusedInputs (cognitive 17): DependencyGraphTransformer.reportUnusedInputs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/DependencyGraphTransformer.kt"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b61e00d701abefe109e824d3febcb928a58342125da9968ad11be2d8bfba135"}},{"ruleId":"D2","level":"warning","message":{"text":"FactoryIrUtilKt.generateCompatibilityBridges (cognitive 17): FactoryIrUtilKt.generateCompatibilityBridges has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/factoryIrUtil.kt"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"7529e71fc812b244695952b6d89ff6ffebb61f2001d0ddd5b88701089f8e187e"}},{"ruleId":"D2","level":"warning","message":{"text":"LongestPath.paths (cognitive 17): LongestPath.paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/analysis/LongestPath.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a17ab0c71a80598d6ba0b66064d4252d3a1588db56fa57799ee0fb0aaa37104"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphReportImport.findMissingReports (cognitive 17): GraphReportImport.findMissingReports has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/viewer/GraphReportImport.kt"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"96df609effaedfb4f6fabe9654986021e0fb3d8074eeb284709810da60fdbdf1"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroGraphValidationService.validate (cognitive 17): MetroGraphValidationService.validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e89388676815b44b950fc43dfcb49f768f0d7a93efc10669e901a382bb81ddf"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedDeclarationFingerprintKt.appendSharedDeclarations (cognitive 17): SharedDeclarationFingerprintKt.appendSharedDeclarations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 2 (5 pts), boolean chains 2, match/switch 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/SharedDeclarationFingerprint.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cad6aab3e7ab5a58cffde25ddca6e85c1bbc0277c1acb4a88ac10d8b8824f3"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingIndex.buildChains (cognitive 17): BindingIndex.buildChains has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb28e5e152d4b7bcc6aa1217738d709628185dffbac3d4eeef8ce3a041e46a1"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroTreeStructure.graphChildren (cognitive 17): MetroTreeStructure.graphChildren has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, loops 2, match/switch 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroTreeStructure.kt"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c4b09dac5e61e92876677dad4ec27abd8343afb6d68c80a7ce8706809334bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.applyOptionValue (cognitive 17): Builder.applyOptionValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/MetroOptions.kt"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a2fd640dacb85407956a3d84f5f560450c73fc7d6f4b5a5701d4b4ea054951"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroSortKt.findMinimalDeferralSet (cognitive 17): MetroSortKt.findMinimalDeferralSet has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/MetroSort.kt"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5ae89f39ca73d98a1f92cb886c6107cf0882f9e6d250ce2e352fa73489434d"}},{"ruleId":"D2","level":"warning","message":{"text":"BetweennessCentrality.compute (cognitive 17): BetweennessCentrality.compute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/java/dev/zacsweers/metro/gradle/analysis/BetweennessCentrality.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0723c335606b7bbca1d87824e9b586de3fcf2b4d5915c8fa1b3fd1d1023edf"}},{"ruleId":"D2","level":"warning","message":{"text":"startup-benchmark-report.html.renderMetadata (cognitive 17): startup-benchmark-report.html.renderMetadata has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 16, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/benchmark_assets/runs/2025-12-08/startup-benchmark-report.html"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb4fdb296e670db48ffd8c0b2db99c53c557dbeb3a0d1b5259e832e21f0b3e8"}},{"ruleId":"D2","level":"warning","message":{"text":"startup-benchmark-report.html.renderMetadata (cognitive 17): startup-benchmark-report.html.renderMetadata has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 16, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/benchmark_assets/startup-benchmark-report.html"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca32c6348913b92be33e6befcab495e72339c4a77bd50b16178656b98536cc98"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.packageOverview (cognitive 17): graph-viewer.packageOverview has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e1a24adc87ff059c94a8b73b3db0aa4990d94e04304dda0f6e609a403729fe"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.canvas.addEventListener(\u0022pointermove\u0022) (cognitive 17): graph-viewer.canvas.addEventListener(\u0022pointermove\u0022) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (6 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd1b3ecfa652975469ab5ba75bdb6c84333aa2e292a5d8a4574419eb2c1eb59"}},{"ruleId":"D2","level":"warning","message":{"text":"graphBoundary (cognitive 17): graphBoundary has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (11 pts), boolean chains 3, if/else 3 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 2 belong to 14 function literals inside it that branch. 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad2504bf7d21c3b3e310aa1385696a9728676f9ba7aeb8f91e777b088bf1dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"renderBindings (cognitive 17): renderBindings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 3). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 2413, 2403, 2429, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"be24bb870a87ae8ab7ff539f0c549c0c8906a927bbc73287c4c6569a9e3aa2d7"}},{"ruleId":"D2","level":"warning","message":{"text":"NameAllocatorKt.toSafeIdentifier (cognitive 16): NameAllocatorKt.toSafeIdentifier has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 7). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/NameAllocator.kt"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5696fd2af7bbeaac1bff088ca347b6eac3d1fd362b66fb72422919098f98d1"}},{"ruleId":"D2","level":"warning","message":{"text":"CircuitFactorySupertypeGenerator.bfsForFactoryType (cognitive 16): CircuitFactorySupertypeGenerator.bfsForFactoryType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitFactorySupertypeGenerator.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"030a3e778a954c4ae63b69b9d845eb85d5b10f06879150b792729bb7e682a56b"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphFirGenerator.unresolvedSuperClassOrNull (cognitive 16): DependencyGraphFirGenerator.unresolvedSuperClassOrNull has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/DependencyGraphFirGenerator.kt"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"635a0745cebd48c09fdea740f3e8108a663257988dfe29f6565a4eb457a398f7"}},{"ruleId":"D2","level":"warning","message":{"text":"IrCallableMetadataKt.toIrCallableMetadata (cognitive 16): IrCallableMetadataKt.toIrCallableMetadata has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrCallableMetadata.kt"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"560de2183dabfcf625200ca043ca5e6b5372944f4afd0a8789eb36a77e3d046c"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingPropertyCollector.markAccess (cognitive 16): BindingPropertyCollector.markAccess has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05611760d3761f662ad0d416c002626b547775c2157aa739aa375d84c19a436"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntheticGraphGenerator.checkOverrideCompatibility (cognitive 16): SyntheticGraphGenerator.checkOverrideCompatibility has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, loops 2 (3 pts), 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/SyntheticGraphGenerator.kt"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"8262b3ef4d74ea27c6926140a821eddad2770d37e0f322124115331a4b446c28"}},{"ruleId":"D2","level":"warning","message":{"text":"IrKt.typeAsProviderArgument (cognitive 16): IrKt.typeAsProviderArgument has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6b96420568daa95710304ca31df56bfc2284708eff9e6b8c3198f0e2d47a46"}},{"ruleId":"D2","level":"warning","message":{"text":"IrKt.isVisibleTo (cognitive 16): IrKt.isVisibleTo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 1 (3 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab90e8b04b3d6780c4ec6e781e889f54cd7375ac81ca6c17e9e8e237de030333"}},{"ruleId":"D2","level":"warning","message":{"text":"IrTypesKt.hasErrorTypes (cognitive 16): IrTypesKt.hasErrorTypes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/irTypes.kt"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76dd13c8241e873e80727c14c04c15f0737e4d0577365e3ef727cb1d7af3bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"MembersInjectorTransformer.getOrComputeMemberInjectParameters (cognitive 16): MembersInjectorTransformer.getOrComputeMemberInjectParameters has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d2d936e381547e8ccfb3aab849fa173d22620a5e5e1fc5abee52c0d61ee89d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisEdgesKt.analysisEdges (cognitive 16): AnalysisEdgesKt.analysisEdges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 5 (7 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":"graphs/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/AnalysisEdges.kt"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd1e0575c4f2f1720d4bd1a251b5b2afcd26b392d93ddc4a974665e078979ec"}},{"ruleId":"D2","level":"warning","message":{"text":"FileShardBuilder.processDynamicGraphCall (cognitive 16): FileShardBuilder.processDynamicGraphCall has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2, boolean chains 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69cc1a32618e9fe1a393a2ebb77a6c5bb3a13df21a4f693f876126db8a371e4"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroLineMarkerProvider.injectorMarker (cognitive 16): MetroLineMarkerProvider.injectorMarker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c31d4d93a297668b67ffff1c38b957fd7801bd474fcde7297e29a56eec655b"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroResolutionService.completeSatisfiedBuildRequests (cognitive 16): MetroResolutionService.completeSatisfiedBuildRequests has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c57eefd518786e3fb837294fac926a7cb2a65a27a259f6c35fefdadff2defe8"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroResolutionService.startPendingFileBundles (cognitive 16): MetroResolutionService.startPendingFileBundles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3a7783249bc217b5c482f45a3390d9d49230799df321bf4ac31a9f4ab28699"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroResolutionService.sharedDeclarationChange (cognitive 16): MetroResolutionService.sharedDeclarationChange has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9aec325bd0e0640403454fb605e1e70159b8162b7f7a5aad0a7737556a487c"}},{"ruleId":"D2","level":"warning","message":{"text":"IdeTraceRecorder.own (cognitive 16): IdeTraceRecorder.own has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, error handling 4 (6 pts), boolean chains 2 (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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceRecorder.kt"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7c6b51a2ab1cdfb0a6dbd445738927cd02a4f9fea960d742446f80eff470b0"}},{"ruleId":"D2","level":"warning","message":{"text":"IdeTraceTimeline.writeTo (cognitive 16): IdeTraceTimeline.writeTo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceTimeline.kt"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"12041ebae9a55075ad08b6eb541fd5c2d94cf85c330b3dfe727b7c1a308dbf4f"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroIdeTracingService.captureFinished (cognitive 16): MetroIdeTracingService.captureFinished has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, error handling 1 (2 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/MetroIdeTracingService.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a199539600c650bba00c1e1567887d16b7bcc47199e8052f0adec215923f3a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroFindUsagesKt.metroUsageRelations (cognitive 16): MetroFindUsagesKt.metroUsageRelations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/usages/MetroFindUsages.kt"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3b3a5e2b78c23395ca594ff22e482488b70ba525400a516fe23167f3665907"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticRenderer.renderLocations (cognitive 16): DiagnosticRenderer.renderLocations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/diagnostics/render/DiagnosticRenderer.kt"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5472b9ce78327881f81a3781738a1cc0439133f3364f0a4e5539a42425e32560"}},{"ruleId":"D2","level":"warning","message":{"text":"MetroSortKt.metroSort (cognitive 16): MetroSortKt.metroSort has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/MetroSort.kt"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77d6bb2423a7b6eaf194a010a9891154152ff81c2743e2945d5ad10b6914d4a"}},{"ruleId":"D2","level":"warning","message":{"text":"build-benchmark-report.html.getSampleSeries (cognitive 16): build-benchmark-report.html.getSampleSeries has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (6 pts), boolean chains 4, if/else 1 (3 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":"docs/benchmark_assets/runs/2026-07-30/build-benchmark-report.html"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"900a61e03ce5d3f1646f0bff161880b41edc2984761bc6cd82dfecb3c89d12ab"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-viewer.boundaryContour::fallback (cognitive 16): graph-viewer.boundaryContour::fallback has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 8 (12 pts), if/else 4 (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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"e104555a31685072eb299bc68bdf6b1e108ef91f4ed4483b73967ca8794f9ac5"}},{"ruleId":"D2","level":"warning","message":{"text":"annotationEnd (cognitive 16): annotationEnd has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8675d84d5db19d2f6a5c5410e95fe7c4d42671adb2d4fa8be389beea89d4f66f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/graph-viewer.js: FileTooLong \u2014 3124 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 1624 over it, 2.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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b5e2e8f4680ebee1e115c13509a5eaa21242e2e8a28093cbdddcd3b8ac5f95"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.build: MethodTooLong \u2014 build runs 485 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 385 over it, 4.85\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfe58ddf998545b6d13a00d8b8b9084ee917bf7f860d821048b44262f8c4429"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MetroResolutionService: ClassTooLong \u2014 1902 significant lines (blank, comment-only and punctuation-only lines excluded), 116 methods. The bar is 400 significant lines; this is 1502 over it, 4.76\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"774f7ef3d7621c0c36bef390c288f653d4f55cc20d445978bdd5855628e9fcb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index/MetroResolutionService.kt: FileTooLong \u2014 2296 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: MetroResolutionService (118-2788). The bar is 500 significant lines; this is 1796 over it, 4.59\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd3463a5c4db6dc4bfa9d4d75761e14e4627dfb8ce4f27decc0b4efa247dbf1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ir/ir.kt: FileTooLong \u2014 2198 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1698 over it, 4.40\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b53ea4e7d1c164fbefe72d7b7c1213436243f236b429d392963fed1c8bad549"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingContainerCallableChecker.checkImpl: MethodTooLong \u2014 checkImpl runs 437 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 337 over it, 4.37\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a043f8b4c66aac3b0dacb38febe686376c81868e0db764297d3431941be2023"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingGraphGenerator.generate: MethodTooLong \u2014 generate runs 416 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 316 over it, 4.16\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a0ec6b5ce22b6e96a40773fa5cad69cae4e081e89d916b75f99aa866b8aadf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BindingIndex: ClassTooLong \u2014 1596 significant lines (blank, comment-only and punctuation-only lines excluded), 119 methods. The bar is 400 significant lines; this is 1196 over it, 3.99\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baa87aa01ec8942dce659dfee7790c149bd18789c6365fc254d663fc4b9a573"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BindingIndex: TooManyMethods \u2014 119 methods. The bar is 30 methods; this is 89 over it, 3.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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"163466e4a2ecf70d705cc54469e08d6232a257d594fccc5cc72ff2838c6103e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/MetroOptions.kt: FileTooLong \u2014 1943 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1443 over it, 3.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/MetroOptions.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a67942d4962a210bbee59a454c54ebd711f5f7cb890c8714eed6128c1ea24b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MetroResolutionService: TooManyMethods \u2014 116 methods. The bar is 30 methods; this is 86 over it, 3.87\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dab3d591ce2c1062b4eb43ddb428283368d9cf9313225ccb703343aa2b18abb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IrGraphGenerator: ClassTooLong \u2014 1511 significant lines (blank, comment-only and punctuation-only lines excluded), 46 methods. The bar is 400 significant lines; this is 1111 over it, 3.78\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac861838b08d9e277c4d6293a82e438e421dcab6ed6121bde5e522af4bd3077c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/BindingIndex.kt: FileTooLong \u2014 1657 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: BindingIndex (26-2239). The bar is 500 significant lines; this is 1157 over it, 3.31\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af9980b344f2e2527a4c4bbf34e22b8677df58ace295a4b41ab4c9b6fc46ba6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/IrGraphGenerator.kt: FileTooLong \u2014 1641 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: IrGraphGenerator (134-2464). The bar is 500 significant lines; this is 1141 over it, 3.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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dc7f67ebe9acf16a24fa6c0731b543c73eaa693a611ac48c2ea7b24c3f7034"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BetterKotlinLikeDumper: TooManyMethods \u2014 98 methods. The bar is 30 methods; this is 68 over it, 3.27\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":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee9abd003a0092162149894c9cac07c977c13de00c159388b4496f3f9cbd011"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DependencyGraphChecker.checkImpl: MethodTooLong \u2014 checkImpl runs 325 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 225 over it, 3.25\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bad77b087e84e7e1338d30dc6c4c6b44983e15cebbcaeab9ab5e554bd267df1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphExpressionGenerator: ClassTooLong \u2014 1257 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 857 over it, 3.14\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"52674d80b36b577150bdf14cc892e7e24a499dc0a92b5b8a63dd5cc6e7c97fe1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IrBindingGraph: ClassTooLong \u2014 1244 significant lines (blank, comment-only and punctuation-only lines excluded), 74 methods. The bar is 400 significant lines; this is 844 over it, 3.11\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dfe38f19fff1eaadb9fc55ed708b1a3a6301f787cdf25d8fe603d249d90780"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graph-viewer.paint: FunctionTooLong \u2014 paint runs 308 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 208 over it, 3.08\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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"698920a7a3c469b6f759339647dc4498dda0f38b805a0f25116199c45f85708c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphReportRenderer: ClassTooLong \u2014 1224 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 824 over it, 3.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":"graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"408c29f421ed80caa5e4ea6d43f35ac3ea8d62597f0a9d22fdb1d1c39d51e778"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/IrBindingGraph.kt: FileTooLong \u2014 1412 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: IrBindingGraph (154-2145). The bar is 500 significant lines; this is 912 over it, 2.82\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bfb99dcaf041f37bc4dd6621a7738ee78c2c6357f5f4a70ece0c121249f4ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/GraphReportRenderer.kt: FileTooLong \u2014 1378 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: GraphReportRenderer (22-1673). The bar is 500 significant lines; this is 878 over it, 2.76\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":"graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ed05b2790fb0fde0157a60800806c94c9c89e2477360dbc2d0546f6bf17900"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/GraphExpressionGenerator.kt: FileTooLong \u2014 1325 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: GraphExpressionGenerator (73-2037). The bar is 500 significant lines; this is 825 over it, 2.65\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11a82e432807d5f807dcb409cfb16e9d3457d633c3ea794423b6cedcbf10b66"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphNodes: ClassTooLong \u2014 1030 significant lines (blank, comment-only and punctuation-only lines excluded), 4 methods. The bar is 400 significant lines; this is 630 over it, 2.58\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc147cabb0325011e23f8d622f5a351e68e17c6630deb0c34f176330b2480cc5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MembersInjectorTransformer.getOrGenerateInjector: MethodTooLong \u2014 getOrGenerateInjector runs 255 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 155 over it, 2.55\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d697c65738d6c8a809d3df0caf6b374cd7d9754e993554abfede7a54142da8d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Companion.build: MethodTooLong \u2014 build runs 252 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndexLookups.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a13bbc99d766c7bc13a87505e5875d517ff7753632d13a7f714759e3006d97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transformers/BindingContainerTransformer.kt: FileTooLong \u2014 1252 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: BindingContainerTransformer (173-1614). The bar is 500 significant lines; this is 752 over it, 2.50\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfcfde4cb7eb2d4fa0646e4edca81accd56a38dac88d2c5d37630e7a7de010c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fir/fir.kt: FileTooLong \u2014 1248 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 748 over it, 2.50\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/fir.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"998bca4f337ef580df6679c57dcd87138fd1a09b6610d64a3125309fa2e83d6c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BindingContainerTransformer: ClassTooLong \u2014 996 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 596 over it, 2.49\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c35b588fc413ce7eae4ab5db23bf56b5aa1ca226bf7f6171befda84bcc5328"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IrBindingGraph: 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"702e96c7288c966544e8c3887d87628aa8430bbe85370e818f3fa980db39b8a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: k230/betterDumpKotlinLike.kt: FileTooLong \u2014 1220 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 720 over it, 2.44\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":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a540b01989404e46f666ef8bc7459135b9c8ee7c21bb03df2616f6b8ec02a50d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/GraphNodes.kt: FileTooLong \u2014 1169 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: GraphNodes (130-1754). The bar is 500 significant lines; this is 669 over it, 2.34\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2405c4012ff1de55de6cf4799ab106432c09afca3ae75d539b3eead3aeed572"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DependencyGraphTransformer.prepareDependencyGraph: MethodTooLong \u2014 prepareDependencyGraph runs 221 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 121 over it, 2.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/DependencyGraphTransformer.kt"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e8e0c7e36f437731e6b2f8ba1445e8621d14b06aba9a52af293efe57b523d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContributedInterfaceSupertypeGenerator.computeContributionSupertypes: MethodTooLong \u2014 computeContributionSupertypes runs 219 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 119 over it, 2.19\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"2232531c9ba8919842b428dd04417c6b5e30d80d51a08d57085825f3acd418d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingContainerTransformer.getOrLookupProviderFactory: MethodTooLong \u2014 getOrLookupProviderFactory runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"5466ed9d8db85254a898bfc37ebbc22c61c016b1e65b57c52ff3d8d9346bc90e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BindingLookup: ClassTooLong \u2014 854 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 400 significant lines; this is 454 over it, 2.14\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingLookup.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"899f7210bdd761e2d4b0203d69ddaf41b624c2649b7cb5e5aa755cc59d0c3882"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContributionsFirGenerator: ClassTooLong \u2014 847 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 447 over it, 2.12\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6ca57d1be0180145816bba54b42d4fdad2fe619c8cb88c857a446f4c6a1758"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InjectedClassTransformer.getOrGenerateFactory: MethodTooLong \u2014 getOrGenerateFactory runs 210 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 110 over it, 2.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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"03db67b13ec9674886d8f2ab7ad5a496f3e93ded6e3de2660c513d05c87c46b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IrBindingStack.copy: MethodTooLong \u2014 copy runs 208 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"042f6410dde438d3409a3aa19ab4ce84aab1bb08e5fd7f704cd5104e471a255a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/BindingLookup.kt: FileTooLong \u2014 968 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: BindingLookup (75-1676). The bar is 500 significant lines; this is 468 over it, 1.94\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingLookup.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffd4f2888d36f288f59e06fe8ea440f76aa9d3bc605d318a670067e52905b7e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DependencyGraphCreatorChecker.checkImpl: MethodTooLong \u2014 checkImpl runs 192 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphCreatorChecker.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33187419a80531e4020f75e036cb461ab9d24df6397094487567c249d32c547"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generators/ContributionsFirGenerator.kt: FileTooLong \u2014 955 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: ContributionsFirGenerator (119-1477). The bar is 500 significant lines; this is 455 over it, 1.91\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29de584b7e57a840dc450c59d203a54dc2696fcebd385920f9d250b1332a79b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DependencyGraphTransformer: ClassTooLong \u2014 756 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 356 over it, 1.89\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/DependencyGraphTransformer.kt"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe10284a0aa8b6f8c81724aa7d3be7a5937cecf94999236c898f0f93bc631cde"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transformers/DependencyGraphTransformer.kt: FileTooLong \u2014 922 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: DependencyGraphTransformer (180-1403). The bar is 500 significant lines; this is 422 over it, 1.84\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/DependencyGraphTransformer.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d20033a6be2fba8a1cdf1101b244cf365e29daa93560b17cde2f0b5b26d413"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IrGraphGenerator.implementOverrides: MethodTooLong \u2014 implementOverrides runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c92f8ec5c98581fa02a9f112f3da5e19c061922519f1d9b03a55800b1ddc3ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: circuit/CircuitIrExtension.kt: FileTooLong \u2014 919 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 419 over it, 1.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae233af8c19c5458790e96c054b1a720fa6c4cf3c95581a269129482788306d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingContainerTransformer.loadExternalBindingContainer: MethodTooLong \u2014 loadExternalBindingContainer runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"26beede55710223b7bdfdf2a8b18ab0b05879b3e71f87442a1350e5ff089b7bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index/BindingExtraction.kt: FileTooLong \u2014 906 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 406 over it, 1.81\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/BindingExtraction.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfca74b3b6b2f03c25bb47d64c2ecbf2f818ef1730b217803f6fed08e806d5d0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContributionIrTransformer: ClassTooLong \u2014 714 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 314 over it, 1.79\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf77c4b5384fd8cb56f9fc89a3406f42f76ef8e6e7e81653d40dafaf6fe11b3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MultibindingExpressionGenerator: ClassTooLong \u2014 709 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 309 over it, 1.77\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/MultibindingExpressionGenerator.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b593c6da01aa27b3d48033049124e4b20c993c69cc0e2d00c8b3484ec8749177"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IrBinding: ClassTooLong \u2014 708 significant lines (blank, comment-only and punctuation-only lines excluded), 1 methods. The bar is 400 significant lines; this is 308 over it, 1.77\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBinding.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6677a2018f3257b1765c1f4f0a41ee44942abdc1f36dfe3c406a84d2311ffce7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Symbols: ClassTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 286 over it, 1.72\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/Symbols.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabc2e5fdae4bc3d2031bf35284951922da199e957fa6d023da4d40c15e21999"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: startup-benchmark-report.html.renderBinaryMetrics: FunctionTooLong \u2014 renderBinaryMetrics runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\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":"docs/benchmark_assets/runs/2026-07-30/startup-benchmark-report.html"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"247540e1416dbfcfb0f1094ffbfc7daeeeae9722512cc06861949b8c13a2ef52"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BindingGraphGenerator: ClassTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 283 over it, 1.71\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79c7519be30ae654f21363628517d7033f4b5b26b32dc58636eace1917a8a7c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetroAnnotationsKt.metroAnnotations: MethodTooLong \u2014 metroAnnotations runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e806d2c1666d44ea4bb2c7f85d40b9432f9d922bd73a059018b89879729e2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AggregationChecker.checkBindingContribution: MethodTooLong \u2014 checkBindingContribution runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AggregationChecker.kt"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd20916d55c256ac94a1afdca6e342b6168584c57c4bff6bd83d8734a9fa2977"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transformers/ContributionIrTransformer.kt: FileTooLong \u2014 838 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: ContributionIrTransformer (130-1199). The bar is 500 significant lines; this is 338 over it, 1.68\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55ae9b98026567c5f56c5f801142e732258743123b3c28035ef8bf71cc3a617"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FileShardBuilder: ClassTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 254 over it, 1.64\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b80c07cc3690ff627e018129c2ebc41c7fdeb72430546a1b11c33197027c8c5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BindingLookup: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingLookup.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c0e31cc9c1cc683b20e5a9fd911145f72db35cafa27c8890ba3a66119c31a3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MetroGraphValidationService: ClassTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded), 46 methods. The bar is 400 significant lines; this is 245 over it, 1.61\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6448991514aaff71145c1ef845618bea16d710f38d6fd34f584c4ff4a7cce0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MultibindsChecker.checkImpl: MethodTooLong \u2014 checkImpl runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MultibindsChecker.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88b6bc243758de965c25d6d33e6c6635bab9cb5f945bbf0597be83ecc4a552f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetroResolutionService.buildResolutionCandidate: MethodTooLong \u2014 buildResolutionCandidate runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc654c8ba06c5f1edadb0fb610a1b7b1d27ab4a20212e959ddf5edb3241f7be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/BindingGraphGenerator.kt: FileTooLong \u2014 804 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: BindingGraphGenerator (64-1217). The bar is 500 significant lines; this is 304 over it, 1.61\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89deb7257a4dbf248f4d392d70c04a3bb1c6ea28dd1f25de711ede6913da7ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetroAnnotationsKt.metroAnnotations: MethodTooLong \u2014 metroAnnotations runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"52af1abfa556447976ebd72fb8ed717c980ae0bb841841e2abe266d3919006ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/IrBinding.kt: FileTooLong \u2014 774 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: IrBinding (71-1162). The bar is 500 significant lines; this is 274 over it, 1.55\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBinding.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"849e7ec3c8ea0b0d82f2d3aca136abdbe779738d3942254f7f4e07ac04ffbb95"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IrGraphGenerator: 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa243bbbb4e74d2cfb922cd2d0352e4a1ec52b3569427d434eaf515904c8373b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MetroGraphValidationService: 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"104356146168cacede5857999916684b6cd8c44e1209835a3a5f33db2324bad4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/MultibindingExpressionGenerator.kt: FileTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: MultibindingExpressionGenerator (57-1142). The bar is 500 significant lines; this is 261 over it, 1.52\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/MultibindingExpressionGenerator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e366e943d7363788e1dbd7e66b4838f124ac89a1ea5c7e944ff84c9fcba38d18"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IrGraphGenerator.collectShardPropertyInitializers: MethodTooLong \u2014 collectShardPropertyInitializers runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5568a926e26376a0532f0ef8973a83a8d1546da57cf880b129c7f7db6a310e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checkers/BindingContainerCallableChecker.kt: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 254 over it, 1.51\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8234e5e28782c68e6b1b3d5a6334d00e0643985b2020424af92c500d9ae2bbce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transformers/MembersInjectorTransformer.kt: FileTooLong \u2014 734 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: MembersInjectorTransformer (121-1027). The bar is 500 significant lines; this is 234 over it, 1.47\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf9cf41d3a0d4361afce433e61993622cc16b5a9ff837945d5467e56d795197"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index/FileShardBuilder.kt: FileTooLong \u2014 734 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: FileShardBuilder (81-970). The bar is 500 significant lines; this is 234 over it, 1.47\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71284a020c64797460ee26a263e7beacbacd7c31ca96b2571afff58da5844bd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: symbols/Symbols.kt: FileTooLong \u2014 732 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: Symbols (45-1038). The bar is 500 significant lines; this is 232 over it, 1.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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/Symbols.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaf7f7563dca6cc3b77c0a72aae1d27d525a7aa36a2c0736a44343813d62eb2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MembersInjectorTransformer: ClassTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 183 over it, 1.46\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2994c9a6db6150bf6782644a382bd1674b6f677a8903212c1a94254e3dff5316"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: 2026-07-30/startup-benchmark-report.html: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 228 over it, 1.46\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":"docs/benchmark_assets/runs/2026-07-30/startup-benchmark-report.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ff996c41c3945a0efb56ea4f5833d77498305046c8696246f38df565df0261"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.applyOptionValue: MethodTooLong \u2014 applyOptionValue runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/MetroOptions.kt"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6954c351f9bf155059245c690e1dc6ecb905c06c2f3aed82ecec83c9bc4f5e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graph-viewer.renderDetails: FunctionTooLong \u2014 renderDetails runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24959508d34fa65969524cb10904669ed20fadbe4a48939bc669d14c478ccd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/MetroGraphValidationService.kt: FileTooLong \u2014 714 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: MetroGraphValidationService (61-1008). The bar is 500 significant lines; this is 214 over it, 1.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d22341684118dbb9eab73a33ea877e6f510636b737c5f3815238e5165b783d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetroCompilerPluginRegistrar.registerExtensions: MethodTooLong \u2014 registerExtensions runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroCompilerPluginRegistrar.kt"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4836fea39b61ccb015b9fbbcffbcffaceb2fb11acfdd4522b4dd3a7c14972542"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ContributionsFirGenerator: 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"198cd506ebecbcd4bc3df43a4b11674fa3ea488c410e765e56118b307fcd245c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InjectedClassFirGenerator: ClassTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 145 over it, 1.36\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c249ca7a9b4a8ea597694b46ecfbbdaced9c8543cccf94647e1f9148babd7c9d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AggregationChecker.checkImpl: MethodTooLong \u2014 checkImpl runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AggregationChecker.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fb28ae220bb7f9c832cdde42d28aea8134dd4ed6628f3886d4e244a1fba2a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index/MetroLineMarkerProvider.kt: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded), about 63% of them inside a single declaration: MetroLineMarkerProvider (79-616). The bar is 500 significant lines; this is 173 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f804023e66e92b344ba9a4255b19265ac872b96f293965ced1e3b127364a7819"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: KaBindingGraph: ClassTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 136 over it, 1.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingGraph.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbad27531385e6279f7d53b6922d9fa95c5fe1ec6d31dc9630249b49c3e8ad1b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IrKt.materializeWrappedType: MethodTooLong \u2014 materializeWrappedType runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ffb40c490d83d37b98150b7e0d8e7f4dc4c7033316ae8bad79ab447d6ae09c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transformers/factoryIrUtil.kt: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 155 over it, 1.31\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/factoryIrUtil.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa7e1652f37aabbdea31e25af1cb48905e12e9bd5e56d598ba2a331d32fc283"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingGraphGenerator.computeRawInheritedGraphData: MethodTooLong \u2014 computeRawInheritedGraphData runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc43da6e5b55422e1d7cab742d63a0d023ffaa23235618190ea7c653d4b7365"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IrBindingGraph.finishSeal: MethodTooLong \u2014 finishSeal runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"b166c943dd4396e2e87ca1c44925bd90a055244c8e42516b00fdf957df90fa6c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IrGraphGenerator.generate: MethodTooLong \u2014 generate runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf623b5c9105eda26395041767b6d7a3888b2d13268720850a32da5d9989b23"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CompatContextImpl: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. Most of these members implement compat.CompatContext (35 of 35 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/CompatContextImpl.kt"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f650b90b1928c765a0cb49ae684d86ff95e4011cc65d689d5d68b8e224187370"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generators/InjectedClassFirGenerator.kt: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: InjectedClassFirGenerator (94-928). The bar is 500 significant lines; this is 133 over it, 1.27\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac120de26fe2b0b247d7940e8b2a8b4b474dbd1325e2444bf90441dd91eeb20a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphMetadataReporter.write: MethodTooLong \u2014 write runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c868cc8c7465dc82645125fd7653db9d4613632c9738940ddbd96f624323b25"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Builder: 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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/MetroOptions.kt"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"5102e3b00078526f61bcf9395392a4a8ff060d46fbf2d5e79a1ea6d0353b0212"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContributionIrTransformer.generateContributionProviderFunctions: MethodTooLong \u2014 generateContributionProviderFunctions 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba71c4a101bc51a2b62b1776323b8bcd73e53a9304e0f3972fabb3931a3caa18"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssistedInjectChecker.checkAssistedFactory: MethodTooLong \u2014 checkAssistedFactory 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AssistedInjectChecker.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ed81e8abb68bbb446fcab7fa5c6f16d69bc7d0c3e0f441492d705ed1bc99f3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InjectedClassTransformer: ClassTooLong \u2014 487 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 87 over it, 1.22\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"212e1e9acd8e69b472b8c259d10b647ef8a5954f66ede5ff1c6622037ecf8ea2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CompatContext: ClassTooLong \u2014 486 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 86 over it, 1.22\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":"compiler-compat/src/main/kotlin/dev/zacsweers/metro/compiler/compat/CompatContext.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76c15b1d7dae15bbace70e9858a40a31e23ceb6cc7e503fa90cbbb7ada2ecc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/MetroAnnotations.kt: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 102 over it, 1.20\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8187aa0b4d11df31dcb81abaca8c3c4b385b7534625f1dc76e864e44fb8a6c93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/KaBindingGraph.kt: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: KaBindingGraph (74-851). The bar is 500 significant lines; this is 102 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingGraph.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dc3f0c4b52c3bc096258a8da97ccf72da53c473702c77bb14dc252595c2b0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checkers/DependencyGraphChecker.kt: FileTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 95 over it, 1.19\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da27fc50478abaa472e7a29c5001b32a5a3848367a451ed30f2eaf710a1f7de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContributionsFirGenerator.generateFunctions: MethodTooLong \u2014 generateFunctions runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df1938ffe6b91079b17df905c70140958cc891ae946b95b042534920acaa5ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResolutionSnapshotBuilder.prepare: MethodTooLong \u2014 prepare runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/ResolutionSnapshotBuilder.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1899d981abed7b337176819d669bf167523f47767b39a6bc401c028d0c683f33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResolutionSnapshotBuilder.libraryShardFor: MethodTooLong \u2014 libraryShardFor runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/ResolutionSnapshotBuilder.kt"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"144165c09453b0b5a4c95e9e8d6d3e9a92e5fa1da495ffcc4ad8f889732d0b69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graph-viewer.layoutRegions: FunctionTooLong \u2014 layoutRegions runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"2043034d26dfe36e9931340d9c7a8c3f22a36d65e9cfe5262f4ad8fe42a2e715"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transformers/InjectedClassTransformer.kt: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: InjectedClassTransformer (101-846). The bar is 500 significant lines; this is 83 over it, 1.17\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a515a8319abd2acf76b0e15a9beb2f5c1391310c6c63b68c6d4706a854eac9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: toolwindow/MetroGraphDebugExporter.kt: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded), about 70% of them inside a single declaration: GraphDebugReport (162-689). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroGraphDebugExporter.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d75a82d510306305c4f7886751e0e15828fc130650c0819c763efdfadb944e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: 2026-07-30/build-benchmark-report.html: FileTooLong \u2014 580 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 80 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":"docs/benchmark_assets/runs/2026-07-30/build-benchmark-report.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c6c7fc9764665e68bf1d2fdae153734a690433cefe4ff173f2c6ea34ce5436"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FactoryIrUtilKt.generateMetadataVisibleDeclarationMirror: MethodTooLong \u2014 generateMetadataVisibleDeclarationMirror runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/factoryIrUtil.kt"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b52d01508da0879a0f60b8c74fbd799651dd6b04ac85d05b9b9ace66a02e36b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CircuitIrFactoryTransformer: ClassTooLong \u2014 463 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 63 over it, 1.16\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7489a56fb75c87c174b7ad0ed60d6fc34447bf42a945a6e5f1f518590b32e39"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: toolwindow/MetroTreeStructure.kt: FileTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 77 over it, 1.15\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroTreeStructure.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3092c6eb99138eac354816142a85c16f973da9ddd77880edab70a808a99c59c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compat/CompatContext.kt: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: CompatContext (77-848). The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/src/main/kotlin/dev/zacsweers/metro/compiler/compat/CompatContext.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"338bd178f2550bf4453c4d6dc56b38a2682ba11123f7150689e8211afdaa84cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/DerivedBindings.kt: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 73 over it, 1.15\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/DerivedBindings.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"059328e2fc3fefcf77ae85579ef306c514d21f613a10d25e7b14f368dfbd722f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InjectedClassFirGenerator.generateFunctions: MethodTooLong \u2014 generateFunctions runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"8910f81c3b00e67044b03765eb87fd651e973911e939ca48d234dceb8da0fd77"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingPropertyCollector.processBindingNode: MethodTooLong \u2014 processBindingNode runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"329e84f1ffe6e33f9b574eeee92367fa7d6d2701612d1e8ace28500f48f2d1a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetroGradleSubplugin.applyToCompilation: MethodTooLong \u2014 applyToCompilation runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/MetroGradleSubplugin.kt"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f15c5985461aefc37e88dfacf074bb65e8bcbc471ee10af9d8f189e9298fce2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingIndex.selectedGraphComposition: MethodTooLong \u2014 selectedGraphComposition runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"05305aebe27079aa44ee34345ba2c0cffdccb38d6623c152a46715124f277864"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InjectionSiteChecksKt.validateInjectionSiteType: MethodTooLong \u2014 validateInjectionSiteType 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/injectionSiteChecks.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fcc4ffe845099773db3bd7863c6fde2ba142b079c55d2b4c89be13805eb9be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetroResolutionService.drainCoordinatorEvents: MethodTooLong \u2014 drainCoordinatorEvents runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30737411fc60e6379d107c398f5a28af60230d92b9af71d142f265b7ee3b464"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graph-viewer.refreshView: FunctionTooLong \u2014 refreshView runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2007431e4405802f2cb1242ae44dc74694ae9efe648b56be8a99cd3f817653c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snapshot/ResolutionSnapshotBuilder.kt: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: acceptSourceFingerprints (69-703). The bar is 500 significant lines; this is 57 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/ResolutionSnapshotBuilder.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0fe88ea458465c52a58e305137c330534db878807b3755cbff8beded99f3ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphDebugReport.render: MethodTooLong \u2014 render runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroGraphDebugExporter.kt"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1c108c7f9bddc0d73181c999e5fcac063d7c2caaaae4c028172127140d4ba5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DiagnosticRenderer: ClassTooLong \u2014 442 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 42 over it, 1.11\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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/diagnostics/render/DiagnosticRenderer.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d16bc96d50f9ac00971b0ee4b43f850b3e33379bdee8a53d16d3dde793144bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IndexingHelpersKt.toKaBinding: MethodTooLong \u2014 toKaBinding 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/IndexingHelpers.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14e52a465195874f0f148b7be7ee8fc3539de9ed2c81515181c359d5a4f7d52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graph-viewer.boundaryContour: FunctionTooLong \u2014 boundaryContour 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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"58357b686ac639b7a52c38588667f89650f52959ed112e7c528cae87ff16337a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BindingLookup.lookupClassBinding: MethodTooLong \u2014 lookupClassBinding runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingLookup.kt"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca478726c40a7cf49e5c1084154c330075464340ee285d4949058ce065568fa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContributedInterfaceSupertypeGenerator: ClassTooLong \u2014 434 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 34 over it, 1.09\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d112a4a4647a858e44fe1f4dc4814d67dc336a7b2ecbed6e035e8a98434f034c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MembersInjectChecker.checkImpl: MethodTooLong \u2014 checkImpl runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MembersInjectChecker.kt"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a8d2feeb0cc767042b23aefd451bbda02902c0d9761bba0c050a7744b0f4f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GraphDataBuilder: 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":"graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17cc4c81bc10de043fbdc74d27f2ee495a1aea2ca289a2c2762759364419510"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checkers/AggregationChecker.kt: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 30 over it, 1.06\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AggregationChecker.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc45994231a201d5e9972c9c0a3feb304c13865295527bb36466944a203068a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MetroLineMarkerProvider: ClassTooLong \u2014 422 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 22 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f38f2ee89796728216b1db06c9a5229b17a4795d464b44eca816159802d37f1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SuspendBindingValidator: ClassTooLong \u2014 416 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 16 over it, 1.04\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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/SuspendBindingValidator.kt"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfc616ed4051bc94b5b446e3ef33a4001da61f9beb68260e408e1df77a69c1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generators/DependencyGraphFirGenerator.kt: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 20 over it, 1.04\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/DependencyGraphFirGenerator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d620337b365e8e352f64dc16ab87167e3d8c1d0254e1538b24c92006acc9216"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IrGraphGenerator.processShard: MethodTooLong \u2014 processShard runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"16473c5839ac074ed786af44869d4406e84a66b00a818aec449771d5ee99d0fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BindingResolutionSession: 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingResolutionSession.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c73ad697937c56def2885ffcc9e6e962939ded2015a7dea19f3567382a6003"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: toolwindow/MetroToolWindowPanel.kt: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 over it, 1.03\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroToolWindowPanel.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49aa1b7c2f3d289866d9decb7fe555a1c4edcb02798ad33810d314c5b801d36b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphMemberExtractor: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 8 over it, 1.02\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphMemberExtractor.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b1a63e5a908aa5e6316bbc5424bd0875d2b32b5101e4d30738c92beea769ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InjectedClassTransformer.possiblyImplementInvoke: MethodTooLong \u2014 possiblyImplementInvoke runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"16711f9b9524d80e9924b1dee39cbec62c9c27a499d3dae59865b1d3e5234c94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generators/ContributedInterfaceSupertypeGenerator.kt: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: ContributedInterfaceSupertypeGenerator (77-825). The bar is 500 significant lines; this is 6 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b9819b5d6dad183da48f93f505ddb5f91908b7abaeec7bcb75530fef809a31"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphDebugReport: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroGraphDebugExporter.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd2117b9be1ecbf3fe8658c99f3eec793a30f126aec46702f6ea3a23a03fd30"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetroResolutionService.classifyFileChange: MethodTooLong \u2014 classifyFileChange runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e75cd6d9e0eebacc4b3e408656776c7bfc5dd0a1845a841a63e56c45f9da230"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler-compat/k240/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k240/CompatContextImpl.kt:215-233 | compiler-compat/k240/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k240/IrConstructorCallIrGeneratedDeclarationsRegistrarCompat.kt:56-74 | compiler-compat/k240_dev_2124/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k240_dev_2124/IrConstructorCallIrGeneratedDeclarationsRegistrarCompat.kt:52-70 | compiler-compat/k2420_dev_6138/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k2420_dev_6138/IrAnnotationIrGeneratedDeclarationsRegistrarCompat.kt:77-95 \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":"compiler-compat/k240/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k240/CompatContextImpl.kt"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1057ef925d47adc948a57bce55f046a93ccb40b8ce0f3e4c24ada70b6e4d7fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (221 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt:261-503 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt:555-775 \u2014 These two members are one piece of code written twice and then edited apart: 221 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3855ec64b6fbce53a455977bd270eca33de57d98f7380196a69b89618b1554e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt:350-419 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt:1126-1182 \u2014 These two members are one piece of code written twice and then edited apart: 57 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ffb607d8b66c2c17ec5b62fbe3e938704c410533ef3319ef09a67386423dcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/CompatContextImpl.kt:136-156 | compiler-compat/k2320/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k2320/CompatContextImpl.kt:76-97 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/CompatContextImpl.kt"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"16eeebbdd1260ffe752754d2271d04c135034fe12b7462b6a701950dab6acdc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt:196-247 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt:249-300 \u2014 These two members are one piece of code written twice and then edited apart: 52 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2736dc653325eb8ec48af214c3d43d5b65b23d535cd1958f3367aa00cb80236b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingLookup.kt:1343-1392 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingLookup.kt:281-329 \u2014 These two members are one piece of code written twice and then edited apart: 49 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingLookup.kt"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d00a398e4093dead3c7e9e269ecce7d031529a0ec59d3435e8b4dc5ba5c406"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt:238-279 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt:291-333 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8024ab55cc9a88b1b5ca5c13823be254500bcb77e9ca637f4846c0c7c9de9b66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt:212-254 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt:259-295 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26853c5bc191e23272080f13712b928ba2c6c438b162b0c171c6adbc2056045"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/FirIdentities.kt:65-90 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/TypeKeyResolution.kt:164-194 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/FirIdentities.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a172204abf3d1d0eed616784f5b34942bbfeb766bf17ada2bbcf85bc2430cb2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt:2324-2372 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/irTypes.kt:93-135 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":2324}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1031f6c7de9a8001a6238a2c868c7c8f4b6c0948540fe76a56761d970a8e6a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/hilt/HiltIrContributionExtension.kt:63-86 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/hilt/HiltIrContributionExtension.kt:91-115 \u2014 These two members are one piece of code written twice and then edited apart: 24 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/hilt/HiltIrContributionExtension.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d00fada7ca1eef529ab810375bf1c2f08d11fd5286e73fb209932fb2891c5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt:592-624 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt:786-812 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"5844e6d2d0a602efd64b61fec19a8cc0588650652fd16d9aefe102e5b372e693"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/SwitchingProviderGenerator.kt:297-332 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/SwitchingProviderGenerator.kt:340-374 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/SwitchingProviderGenerator.kt"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8779ba79b9b3096ad042a0e7a529b9214dcfc626ad9353b97d78a29b17a7e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/BindingExtraction.kt:597-623 | metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/DerivedBindingMatching.kt:379-408 \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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/BindingExtraction.kt"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"48586b2294a2406c8ce95d92ad4c07b27aa7ad76ce59c6cc64dfb3d40ce5f2fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt:1629-1655 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingGraph.kt:483-513 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"218fad8814657fc25adfb003f3f747d2ef379037596bb094bf16978d7430e813"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt:610-627 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt:634-656 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e1bbac6db9a6fd6cdfbfca8cbc1ca9bccf2b982974bf35897281578f72db80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt:1407-1421 | compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt:1427-1445 \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":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"82831457cebac14ab2d29317f7bdf7662b35dac61781a5752530a491ccb8a137"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitContributionExtension.kt:88-118 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitContributionExtension.kt:125-150 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitSerializableContributionExtension.kt:44-61 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitContributionExtension.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd16dc35b5be4c25385e869c0fa6805d7605fcc3c873ef704ae5137dbad750fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/BindingExpressionDecorator.kt:396-421 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/BindingExpressionDecorator.kt:427-449 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/BindingExpressionDecorator.kt"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2808f4b9131d96c6a52abf22d2899e8b83e184048f402f590739dfdb0239cd3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt:1712-1725 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt:1788-1801 \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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"752b62a916453e52b19830c11b557867cc33526b0b9e2a522d4775e92bdeb3c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/CompatContextImpl.kt:296-322 | compiler-compat/k2320/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k2320/CompatContextImpl.kt:167-198 \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":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/CompatContextImpl.kt"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f267675b412055521167a4480094f4d0a63cd108663334e40126a990cbf68384"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt:112-141 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MultibindsChecker.kt:52-72 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"616c96d59e1fec9cb7dc29d07046491c5d067b5a3e1738e323177493ddc9ad02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/MetroTraceContext.kt:53-76 | metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/MetroTraceContext.kt:96-119 | metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/MetroTraceContext.kt:134-149 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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":"metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/MetroTraceContext.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4ac92a193312ace69fbcbf115edd35ce5b3c1849e66acb1f129ea317e154ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/BitField.kt:56-65 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/BitField.kt:76-85 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/BitField.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"651129dc508e44d1235005f55dd0d859588197bbfe9cf3e3c8fecf732563d174"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/analysis/GraphAnalyzer.kt:71-93 | gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/analysis/GraphAnalyzer.kt:99-117 \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":"gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/analysis/GraphAnalyzer.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1688636c4fc9ffd15f73111d13020f885d670a50d293a44c6d2ebaf94d915039"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/CompositeMetroFirDeclarationGenerationExtension.kt:192-204 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/CompositeMetroFirDeclarationGenerationExtension.kt:209-221 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/CompositeMetroFirDeclarationGenerationExtension.kt"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"80132e66e8d193ca4628d218cf788256678117aea3ab0f04593abd77484e795d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/MetroFirExtensionRegistrar.kt:235-252 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/MetroFirExtensionRegistrar.kt:287-304 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/MetroFirExtensionRegistrar.kt"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9240c909f013461369bd15015e8e777a4dc605cf9ce34c0bbacd63f50e57e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt:1471-1490 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt:1494-1513 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dc4e0860d2426a846f247c51002b5140aa84b8ccc57531eccf492e65b8a06e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/SourceSnapshot.kt:190-198 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/SourceSnapshot.kt:200-208 \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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/SourceSnapshot.kt"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb9793773c840780a529b5ec4ef02c1df41cceab83e68ce6f44f3c6f6413724"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt:313-327 | graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt:330-341 \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":"graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b10d7a7575f3b3d1a65d458ed8e9e31d54e98ad9f674b88d7ad3a7b136c935"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/MetroFirExtensionRegistrar.kt:312-330 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/MetroFirExtensionRegistrar.kt:337-354 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/MetroFirExtensionRegistrar.kt:360-377 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrDependencyGraph.kt:187-204 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/MetroFirExtensionRegistrar.kt"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f76451bba9b82531890fe8d5a7d414336f93e82025753b133abcb2d388b377"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/TraceTestUtil.kt:56-66 | metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/TraceTestUtil.kt:78-89 \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":"metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/TraceTestUtil.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b276433a285e36a1891a6917f16486603dc43a4b5a9a018e2d28d06393013e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitFirExtension.kt:397-414 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitFirExtension.kt:425-442 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitFirExtension.kt"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da067c0caa058bda1de55962d74340cf67d07598c20fd1e6475d1c651eb3e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt:502-513 | metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/BaseBindingStack.kt:27-38 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda359162c474df390666f9f5cac8fc22350b312d09d2e57c9303e9b48f84b87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt:206-229 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt:343-360 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"116fb414636c1011297eafd8a0359752d6c66b09f8a0f482fc150a82d693c3c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroToolWindowPanel.kt:463-476 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroToolWindowPanel.kt:559-574 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroToolWindowPanel.kt:576-590 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroToolWindowPanel.kt"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa8a598a30a9e8fcb3b403bdec7f8dfde7e1020493f84f821d104340dfc88e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/CompositeMetroFirDeclarationGenerationExtension.kt:126-138 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/CompositeMetroFirDeclarationGenerationExtension.kt:165-177 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/CompositeMetroFirDeclarationGenerationExtension.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8b1bc1144307b0095cbaedf5835731622edecc9ee5661f57d6cc50a993762f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/CompositeMetroFirDeclarationGenerationExtension.kt:93-108 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/CompositeMetroFirDeclarationGenerationExtension.kt:145-160 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/CompositeMetroFirDeclarationGenerationExtension.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ef53629f1c2b5b368211eaae03892e540b01ad59451ad0a967831510895612"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/explanation/MetroBindingExplanationPanel.kt:144-154 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroToolWindowPanel.kt:593-601 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroValidationResultPanel.kt:197-207 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/explanation/MetroBindingExplanationPanel.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b299761f0979120a3db0fad4849a7de8b8dc696466dc2f1223d4e10e3a13c4ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/irDeclarationRendering.kt:463-471 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/irDeclarationRendering.kt:475-482 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/irDeclarationRendering.kt"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa1588f7bc9e3dba4457be2d1d86982e77a8f6a2cde8bd42b7b327293e46bf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt:1538-1546 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroTreeStructure.kt:398-414 \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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fcfaf7a28bd9eac77b9d173d05f245cdea5b3b369d5481215c5660ee066fee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt:616-631 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt:640-660 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"59331d3ae2802b227d9cb478feeac45d3dc07351c912c54a505bc48f8af972db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt:1401-1409 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt:1417-1426 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4b8197c3e5a692828cde5c6b2ff5340f909946bdfb071343be627932dc0d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt:311-322 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt:523-534 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt:541-555 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69141a9946b64465686d57635b5c60b81469b951cc4ec3df551a25084985ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceRecorder.kt:276-286 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceRecorder.kt:292-302 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceRecorder.kt:305-315 \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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceRecorder.kt"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0ca586047a9ece242f4b5050383d3d2e2e2a4d2f8e9bcc66f7d3283a5df3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/WrappedType.kt:57-69 | metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/WrappedType.kt:89-101 | metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/WrappedType.kt:121-133 | metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/WrappedType.kt:153-165 | metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/WrappedType.kt:186-198 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/WrappedType.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a67c16aa7aa896e8a028c17a04dabc73bbab916bfcb688984ee4c3f937d10c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/identity/TypeKeyIdentity.kt:77-88 | metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/identity/TypeKeyIdentity.kt:172-183 \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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/identity/TypeKeyIdentity.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b95e87fe4e193578a4f778267d2ca3d8f6f5ba5d9119fed80fdefc80999d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitFirExtension.kt:474-481 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt:369-377 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitFirExtension.kt"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ad33d6c527b90baa31b16cece16574116031b27cd79b800a9c2350ed31efcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/ConsumerExtraction.kt:26-41 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/GraphFactoryInputs.kt:353-367 \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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/ConsumerExtraction.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d03302862c854034870d792227a50d4eb7d88150f46f1b304a9937471886ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/hilt/HiltFirDeclarationExtension.kt:53-65 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/hilt/HiltFirDeclarationExtension.kt:67-78 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/hilt/HiltFirDeclarationExtension.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"592ca0456f29782e4560c18224cc2bcdd96d3bea07ad982b0ddc6d42fe218f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): runtime-coroutines/src/jvmMain/kotlin/dev/zacsweers/metro/internal/SafePublicationSuspendLazy.kt:32-49 | runtime-coroutines/src/nativeMain/kotlin/dev/zacsweers/metro/internal/SafePublicationSuspendLazy.kt:29-46 | runtime-coroutines/src/webMain/kotlin/dev/zacsweers/metro/internal/SafePublicationSuspendLazy.kt:29-46 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 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":"runtime-coroutines/src/jvmMain/kotlin/dev/zacsweers/metro/internal/SafePublicationSuspendLazy.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0bb7aec0fff5594773fd71d7da30c09f40d827096aa84ffeb2c60bf653518e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt:164-177 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt:716-729 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d464667b667f86083e7b9281a6968547a3f5550751f9766d2d2b4bf4e2fea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitFirExtension.kt:495-502 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt:391-398 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitFirExtension.kt"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de8db5a4c1d465c98d8d9516ee709c61c435e664125cc63f852009ce4d794bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/FirTypeKey.kt:35-40 | metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/identity/TypeKeyIdentity.kt:31-36 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/FirTypeKey.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dc6dfcaa2273ff219c6491f88d3b22928f8cd38a45d57dc2da9321a4ef4254"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): runtime-coroutines/src/commonMain/kotlin/dev/zacsweers/metro/internal/GraphCleanup.kt:57-68 | runtime/src/commonMain/kotlin/dev/zacsweers/metro/internal/GraphLifecycleState.kt:66-77 \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":"runtime-coroutines/src/commonMain/kotlin/dev/zacsweers/metro/internal/GraphCleanup.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30e75a890276258d738d3a8c168339d740b5414e753bfa6cf55125f11670e87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/commonUtil.kt:47-55 | runtime/src/commonMain/kotlin/dev/zacsweers/metro/internal/MetroCollections.kt:47-55 \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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/commonUtil.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6940838b9100b2bc1d3cb908111d3f153910b16399842b71c4a9dd465cb61bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroToolWindowPanel.kt:478-481 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroValidationResultPanel.kt:172-175 \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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroToolWindowPanel.kt"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a096d71ad246f9e9778f14b14580c40b6737fe2f0f5c503c10707a7cbb87ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): runtime/src/commonMain/kotlin/dev/zacsweers/metro/internal/MapFactory.kt:33-40 | runtime/src/commonMain/kotlin/dev/zacsweers/metro/internal/MapLazyFactory.kt:32-39 \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":"runtime/src/commonMain/kotlin/dev/zacsweers/metro/internal/MapFactory.kt"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f035885f347c77cde04b1424eb0b1cfbabacccbca8467afbd67b93f37032888c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt:427-436 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitSerializableIrExtension.kt: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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"2183e72e8c10bca2ffe9d88307b4737f7959966a8f48e1e1197f4d2494e01f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt:749-753 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingGraph.kt:159-165 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b290adae0fea7d548c87d3615464c8a399c107cafafa10b638078d03ef2d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/TracedProvider.kt:26-35 | metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/TracedSuspendProvider.kt:30-39 \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":"metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/TracedProvider.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"170da96c236faa997370ee31b390b5be0fdd785bf51c681dd8d103259d6cdcc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt:217-247 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt:270-300 \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 \u0060idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt:217\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060block\u0060 to \u0060(IdeTraceOperation?\u0060 in one and \u0060suspend (IdeTraceOperation?\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6547b4ad4a51e8c0ef45ef2ef2f7cb1f604e5abcbef51c2ac415b95653ca3f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt:318-342 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt:410-433 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt:318\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa13384f49dd66326651164ddb3a476da972f05c576f745ead263a97f743a59d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt:1198-1220 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt:1314-1336 \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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacb693155cab5d24dd976701201a4ce940aa23c62fc266405d541f19fa6842b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt:1042-1062 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt:1066-1087 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt:1042\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"315586bb9193a21d6efaaef59a730148c09afab234c945d532fcc6cdb5cd08be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt:313-333 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt:613-633 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt:313\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3164afd819dcaf4d1ccfd388364766c1affab47b69226f5cc35ad63564141f43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201320 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt:312-331 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt:428-441 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt:312\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt:311\u0060 calls \u0060trace\u0060 and \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt:427\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"415e179e996ffdc679a98bf12e440065b97deb9784d394459c2ff3d8af6d7ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt:702-721 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt:735-754 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt:702\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c37eb2e0ec3b4146a2bf77b09f17d47a6acb2a659bd7e6834f22d6866ea0ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/CompatContextImpl.kt:304-322 | compiler-compat/k2320/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k2320/CompatContextImpl.kt:180-198 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/CompatContextImpl.kt:304\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":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/CompatContextImpl.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c723ffda2c2c8676459280e3b5a52ef371259969e1efc58c415da86490d223"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt:1416-1434 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt:1505-1523 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt:1416\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"393258eeff02295eb9b9dd07a7c30087ddec75896526bcd2f078859872988e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt:197-215 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt:250-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 \u0060idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt:197\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060block\u0060 to \u0060(IdeTraceOperation?\u0060 in one and \u0060suspend (IdeTraceOperation?\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"356a7b927e45f5b1f7ca85140745cb9a5cd133c4ac4fba3a34ec76c8c073e070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): compiler-compat/k240/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k240/CompatContextImpl.kt:217-233 | compiler-compat/k240/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k240/IrConstructorCallIrGeneratedDeclarationsRegistrarCompat.kt:58-74 | compiler-compat/k240_dev_2124/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k240_dev_2124/IrConstructorCallIrGeneratedDeclarationsRegistrarCompat.kt:54-70 | compiler-compat/k2420_dev_6138/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k2420_dev_6138/IrAnnotationIrGeneratedDeclarationsRegistrarCompat.kt:79-95 \u2014 before extracting anything, compare \u0060compiler-compat/k240/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k240/IrConstructorCallIrGeneratedDeclarationsRegistrarCompat.kt\u0060 and \u0060compiler-compat/k240_dev_2124/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k240_dev_2124/IrConstructorCallIrGeneratedDeclarationsRegistrarCompat.kt\u0060 as WHOLE FILES: 87% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler-compat/k240/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k240/CompatContextImpl.kt:217\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":"compiler-compat/k240/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k240/CompatContextImpl.kt"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e283393cbb634ddb0f0b61fc3259af04b58b925b28c9c7216af330c8db17ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt:418-433 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt:711-726 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt:418\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c34995c3c9173342cf053a5a2b9950d4fc4d34050a7a7ff4278337bbc29a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/MetroTraceContext.kt:63-76 | metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/MetroTraceContext.kt:106-119 \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 \u0060metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/MetroTraceContext.kt:63\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":"metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/MetroTraceContext.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b867421510e87597790f9ab4364161cfd1f0e656a6c690a2b4898eec849a4b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrProviderFactory.kt:275-287 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrProviderFactory.kt:331-343 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrProviderFactory.kt:275\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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrProviderFactory.kt:346\u0060 calls \u0060join\u0060 and \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrProviderFactory.kt:288\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrProviderFactory.kt"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ea026a7da8736f04f69b58ba2b5b15c09a20a1ee10c93950803783bf2a7ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt:137-148 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt:159-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt:137\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, \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt:171\u0060 calls \u0060put\u0060, \u0060JsonPrimitive\u0060 and \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt:149\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e41cd7248c06ac4ad070a140c58b0c4f8344a49e348dbbbd36feb8dcbb9ddd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt:1242-1253 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt:1278-1289 \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 \u0060idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt:1242\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. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb0d116a42a135684e250a96e26622776553aaee92cbcaa2b237c887a840a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt:1126-1135 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt:1146-1156 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt:1126\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3201fcbfed948c0051d8fec37777a64997e813d1761e243411cd1e8bb22a49dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt:1407-1416 | compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt:1427-1436 \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 \u0060compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt:1407\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":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"48543c2a0585c3e1322a6ffe0b88c37690277fe1b7684d8b64835f279a67c366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphMemberExtractor.kt:359-368 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphMemberExtractor.kt:433-442 \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 \u0060idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphMemberExtractor.kt:359\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphMemberExtractor.kt"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84e43f354c4a3b3074dcfc48149a86639ddac176d40e47e79a83fcc8118e5eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt:248-256 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt:300-309 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt:248\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderFramework.kt"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"6201f2285afe1800dd2df52e7d63900cf27b64651a678c1a95ae7594d400f3c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt:506-513 | metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/BaseBindingStack.kt:31-38 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt:506\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e70a2b9e93bde1670559fd68b78d3d1f7569a56a7b4ff26f88df06b2d271b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/SyntheticGraphGenerator.kt:415-421 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/SyntheticGraphGenerator.kt:443-450 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/SyntheticGraphGenerator.kt:415\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/SyntheticGraphGenerator.kt"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"732c9eeac403fb3f933a707842842975a7352c92515217d77abad7b4d4579333"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrIdentities.kt:99-103 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/TypeKeyResolution.kt:224-228 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrIdentities.kt:99\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrIdentities.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46c3e54d81fadceddf945f10131c49d6a011cb98c5de6a9049c974ff5659b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt:418-425 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingStack.kt:55-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"993beb06fb3f67de7897dc3aa7c6faca494d7e9140242d495c57222f8c44866a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): runtime-coroutines/src/jvmMain/kotlin/dev/zacsweers/metro/suspendLazyUtil.kt:14-18 | runtime-coroutines/src/nativeMain/kotlin/dev/zacsweers/metro/suspendLazyUtil.kt:14-18 | runtime-coroutines/src/webMain/kotlin/dev/zacsweers/metro/suspendLazyUtil.kt:14-18 \u2014 before extracting anything, compare \u0060runtime-coroutines/src/jvmMain/kotlin/dev/zacsweers/metro/suspendLazyUtil.kt\u0060 and \u0060runtime-coroutines/src/nativeMain/kotlin/dev/zacsweers/metro/suspendLazyUtil.kt\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime-coroutines/src/jvmMain/kotlin/dev/zacsweers/metro/suspendLazyUtil.kt:14\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":"runtime-coroutines/src/jvmMain/kotlin/dev/zacsweers/metro/suspendLazyUtil.kt"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bf1f8f6b7473c8f4e02f2a53e8f4bf13d31521e46faeb0366a79fecc99ee72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt:357-371 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt:450-464 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt:357\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"636c96c5a0a45df6ae279eae91b0e80df4d44b8f1b3ce86cc6f278c9f762007f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt:666-677 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt:685-696 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt:666\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dff9a47cd272c63179823a848f3a8cace132081077d3afc6253d04e672611c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt:941-952 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt:1015-1026 \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 \u0060idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt:941\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84dd4228989ce8c05a08a62ce1b6f985030149b2bb0b05e072c0ee1aa4f92f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt:897-904 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt:977-984 \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 \u0060idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt:897\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"209ef96721d12b86c796bcf2bf830771ec7190db2ff0881df3f3349d2f6ddec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): compiler/src/main/kotlin/dev/zacsweers/metro/compiler/BitField.kt:57-61 | compiler/src/main/kotlin/dev/zacsweers/metro/compiler/BitField.kt:77-81 \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 \u0060compiler/src/main/kotlin/dev/zacsweers/metro/compiler/BitField.kt:57\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/BitField.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d6e583f74638c0fd5f91077966c5a97667e92b4a999fea36241500f6ef357d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt:1153-1157 | graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt:1272-1276 \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":"graph-viewer/src/commonMain/kotlin/dev/zacsweers/metro/gradle/analysis/GraphReportRenderer.kt"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"bceecdd7a5482a576da4214eda238789d0f98090decfff55e1e35d002965516d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt:611-615 | idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt:636-640 \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 \u0060idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt:611\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt:635\u0060 calls \u0060reportProgress\u0060 and \u0060idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt:610\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/MetroGraphValidationService.kt"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"870be2f4d9bd55d3effb576a8e378555158c35378fa77210f360904ed099a361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): compiler-compat/fetch-all-ide-kotlin-versions.py:141-158 | compiler-compat/fetch-all-ide-kotlin-versions.py:493-510 \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":"compiler-compat/fetch-all-ide-kotlin-versions.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"520ab5d3bc61c9a5a1ad8958444cc50ca3a11545fd187645218d8b52ef3aef04"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): compiler-tests/src/generator230/kotlin/dev/zacsweers/metro/compiler/GenerateTestsImpl.kt:23-68 | compiler-tests/src/generator2320/kotlin/dev/zacsweers/metro/compiler/GenerateTestsImpl.kt:23-68 | compiler-tests/src/generator240/kotlin/dev/zacsweers/metro/compiler/GenerateTestsImpl.kt:23-68 | compiler-tests/src/generator2420/kotlin/dev/zacsweers/metro/compiler/GenerateTestsImpl.kt:24-69 \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":"compiler-tests/src/generator230/kotlin/dev/zacsweers/metro/compiler/GenerateTestsImpl.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c273c49bf68eba9fb962cb97ca2b7add163ece8212609c6e27c9f0593f035e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 4): compiler-tests/src/generator230/kotlin/dev/zacsweers/metro/compiler/GenerateTestsImpl.kt:24-68 | compiler-tests/src/generator2320/kotlin/dev/zacsweers/metro/compiler/GenerateTestsImpl.kt:24-68 | compiler-tests/src/generator240/kotlin/dev/zacsweers/metro/compiler/GenerateTestsImpl.kt:24-68 | compiler-tests/src/generator2420/kotlin/dev/zacsweers/metro/compiler/GenerateTestsImpl.kt:25-69 \u2014 before extracting anything, compare \u0060compiler-tests/src/generator230/kotlin/dev/zacsweers/metro/compiler/GenerateTestsImpl.kt\u0060 and \u0060compiler-tests/src/generator2320/kotlin/dev/zacsweers/metro/compiler/GenerateTestsImpl.kt\u0060 as WHOLE FILES: 98% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/generator230/kotlin/dev/zacsweers/metro/compiler/GenerateTestsImpl.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6081de4c3188d0c1520bd4c57e92615b60841b746dcc1e4d1e74104bedcd0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): compiler-tests/src/generator2320/kotlin/dev/zacsweers/metro/compiler/MetroDiagnosticsCompat.kt:53-73 | compiler-tests/src/generator240/kotlin/dev/zacsweers/metro/compiler/MetroDiagnosticsCompat.kt:53-73 \u2014 before extracting anything, compare \u0060compiler-tests/src/generator2320/kotlin/dev/zacsweers/metro/compiler/MetroDiagnosticsCompat.kt\u0060 and \u0060compiler-tests/src/generator240/kotlin/dev/zacsweers/metro/compiler/MetroDiagnosticsCompat.kt\u0060 as WHOLE FILES: 96% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/generator2320/kotlin/dev/zacsweers/metro/compiler/MetroDiagnosticsCompat.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a911a89dfdc5ff23eef40f4eb0fcd91e8210344387d342ba210f08f93abad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): samples/compose-viewmodels/screen-details/src/commonMain/kotlin/dev/zacsweers/metro/sample/composeviewmodels/details/DetailsScreen.kt:28-41 | samples/compose-viewmodels/screen-home/src/commonMain/kotlin/dev/zacsweers/metro/sample/composeviewmodels/home/HomeScreen.kt:27-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060samples/compose-viewmodels/screen-details/src/commonMain/kotlin/dev/zacsweers/metro/sample/composeviewmodels/details/DetailsScreen.kt:28\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":"samples/compose-viewmodels/screen-details/src/commonMain/kotlin/dev/zacsweers/metro/sample/composeviewmodels/details/DetailsScreen.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b259246a4946082158d571185fd458292a550fa8ea270bd7d8d10ae899d2795"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: metro:graphs: metro:graphs: abstractness 0.01, instability 0.00, distance 0.99 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3f52bc1f68e10a4b731315517ba8afd1c01f75772d10a0be791e248be711d70e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: metro:compiler-compat: metro:compiler-compat: abstractness 0.21, instability 0.00, distance 0.79 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0716f5287c8eead01385a62d8883f02f04f1ae8d36b590afdf831dd38eeb2011"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: metro:metrox-android: metro:metrox-android: abstractness 0.75, instability 1.00, distance 0.75 \u2014 zone of uselessness \u2014 abstract and unstable, so it\u0027s likely unused."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"65053d052b6c9f34cc550229a3d14982c7a8b58d660cd01b8efe7374fccb25e0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ContributionHintFirGenerator (LCOM4 4): ContributionHintFirGenerator\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionHintFirGenerator.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"152b47c8c39d29f8a1be9b82fd0b5c7c0853e45564da83de564a9239efe84749"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/MetroOptions.kt: metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/MetroOptions.kt changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in Builder.applyOptionValue at line 2031. 1 of those changes was a fix/bug commit, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/MetroOptions.kt\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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/MetroOptions.kt"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40320628cf8a196dedac77c761fd4a6e4da32d57b73d98c9c63c4cef9fdc968"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in GraphExpressionGenerator.generateBindingCode at line 173. 3 of those changes were fix/bug commits, and the other 11 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcf191ae9800561ae689a28f0e083470e24b70cbe0837b65e938dc326a25e9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 116 in Builder.build at line 833. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"7deeb557c037ad1b867e3bc405882e68883b9a24ba33d404a33aeb7492ed5b3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in BindingGraphGenerator.generate at line 83. 4 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea04f01ab83d78da92cf988d6ecbd27d6f57104f9dd6471a50a203214d71542"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 110 in BindingContainerCallableChecker.checkImpl at line 144. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"691dd27864dd71c6b202bd259dc0eb1e35a15fae5fa6a2769a83dc97efa8987d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in BindingPropertyCollector.processBindingNode at line 412. 1 of those changes was a fix/bug commit, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dbecc2bc5b77bc9bdb598f09e02ec3fb90479bdf66677fc64be061055a65f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/DependencyGraphTransformer.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/DependencyGraphTransformer.kt changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in DependencyGraphTransformer.prepareDependencyGraph at line 493. 2 of those changes were fix/bug commits, and the other 11 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/DependencyGraphTransformer.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/DependencyGraphTransformer.kt"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6d0e1a4bf50089257a249829c322e7257bf7dcf71cb196069d6a89f916cc71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in MetroResolutionService.classifyFileChange at line 2490. 1 of those changes was a fix/bug commit, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"08648f2f881133f8a3a522dee93165a7fef295c8f073a902dbf94409aab1e697"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in IrBindingGraph.validateBindings at line 1517. 3 of those changes were fix/bug commits, and the other 16 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"61df3e47ee4043d2a482eacdeb46e9a805e3383d15fb7b20ad3837955102a762"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in BindingIndex.bindingCandidateRejection at line 1516. 2 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingIndex.kt"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55e7c20cd85b5d98ee53f945bcfbb85621adadfcd5bc787bac71f15fecfff4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in ContributedInterfaceSupertypeGenerator.computeContributionSupertypes at line 403. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdafe179262a00a63c0c5958d010516cca7e13547ad820fdfe85d218bf69dcf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in DependencyGraphChecker.checkImpl at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"10401d854ef04c7b8170a5c3c00825a3f8c9ee882860bcfe5ff7fb5ecf2da23d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in IrGraphGenerator.implementOverrides at line 2188. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dec218843163c0f4ca95004b1c380a595333cea915b16f510dd02cb00047ced"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in IrKt.irInvokeResolved at line 528. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f359ad7258aefce77a6824393d6f502eb9ba7d56bc016417cd3fa4dc9396ec2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in BindingContainerTransformer.loadExternalBindingContainer at line 1095. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7035541289c44e37aa6d684fe125f5e85c6f792b21c9c7c41edfa56812cc3a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/BindingExtraction.kt: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/BindingExtraction.kt changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in BindingExtractionKt.classBindingData at line 635. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/BindingExtraction.kt\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/BindingExtraction.kt"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fd111ce3c261fd58d21675b95880ca6eea5dca9765cee88dcaa278abb5af45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in FileShardBuilder.processBindingCallable at line 338. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c0085b000ffa9bbce70575cb568b2c1a7bd7b8aa5281a102fff0e4bd107dd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in MembersInjectorTransformer.getOrGenerateInjector at line 205. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e44b4b79c32f778c9198caa4d1136edbec8e27c3ae974aec43fb7580e458bda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js: gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in graph-viewer.renderDetails at line 2488. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js\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":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.js"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceeb9a0d05718d4d8084676a19a87d2f53437972b7e678351ab3b8837405c455"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/MultibindingExpressionGenerator.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/MultibindingExpressionGenerator.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in MultibindingExpressionGenerator.generateMapMultibindingExpression at line 563. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/MultibindingExpressionGenerator.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/MultibindingExpressionGenerator.kt"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0e04db86bc6abdccf93c256453dfa20dbaf98018e5d0e62c0894fbc19df3f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/BindingGraph.kt: metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/BindingGraph.kt changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in MutableBindingGraph.prepareSeal at line 154. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/BindingGraph.kt\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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/BindingGraph.kt"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdc0c11ed884668082ba58f3d561facb91d502db1f86f3248ac2b03be4024fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroCompilerPluginRegistrar.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroCompilerPluginRegistrar.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in MetroCompilerPluginRegistrar.registerExtensions at line 33. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroCompilerPluginRegistrar.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroCompilerPluginRegistrar.kt"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c90650609ae8f77924e04360b672b3286735fc8527ef3ef19505a8410c1ad3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in IrContributionMerger.computeContributions at line 173. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContributionMerger.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba70d73ed807373b92559a3a6914ec5fc36ceac305372a46c7a77b9d5f7fcd87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in InjectedClassTransformer.getOrGenerateFactory at line 135. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2100d4acdcbca69b8344b704181b3f5e81bc61e8c4417f48fba6bbf413b03f21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in GraphMetadataReporter.buildBindingJson at line 339. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f039980194e3b6c780263d495a53fc3a0d9064b050d5c27476c20548266e6b60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingLookup.kt: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingLookup.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in KaBindingLookup.delegateToParentIfScoped at line 336. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingLookup.kt\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingLookup.kt"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"625d3d066a9eed7e39636ad1947cfffcf617cbe7ba74b57cfa3aa592b76eb2d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryIndexPostProcessor.kt: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryIndexPostProcessor.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in LibraryIndexPostProcessor.bindingSeeds at line 245. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryIndexPostProcessor.kt\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryIndexPostProcessor.kt"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74c9c6834a4fe404f2a7230a24896190a3e139df88e0488727abeeda5dc1868"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in MetroLineMarkerProvider.consumerMarker at line 370. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroLineMarkerProvider.kt"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7c33d44d94142acaa83bac64cc42f5cad5251d491dc3efe1c3dfd2c5ff9b1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/factoryIrUtil.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/factoryIrUtil.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in FactoryIrUtilKt.generateMetadataVisibleDeclarationMirror at line 369. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/factoryIrUtil.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/factoryIrUtil.kt"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba361ef8542564b1d3ed594afe1ccb975b8d9c73143269f64e97a52a371f8019"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/SourceLibraryInputs.kt: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/SourceLibraryInputs.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in SourceLibraryInputsKt.libraryInputs at line 77. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/SourceLibraryInputs.kt\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/SourceLibraryInputs.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17fbe692b2ea0f97f0050227ce2633ca99d7c01e8043c8829eaf40d4e2100cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ContributionIrTransformer.generateContributionProviderFunctions at line 464. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad2ec4b2614217eedc0f0de7e3990a0f635ec5c7577e0e15bbd84503cc0ef66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/CreateGraphTransformer.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/CreateGraphTransformer.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in CreateGraphTransformer.visitCall at line 72. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/CreateGraphTransformer.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/CreateGraphTransformer.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2972134d42c06144ee2274d5d7b28104a72c550b19c376f6dad8ed1a1951dd3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryContributionScanner.kt: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryContributionScanner.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in LibraryContributionScanner.processLibraryHint at line 178. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryContributionScanner.kt\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryContributionScanner.kt"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3a858c2d21ac34e56b305d6d3c7f596a1743c1c56d41498b8102a1216fdbaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in InjectedClassFirGenerator.generateFunctions at line 688. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"8259c33dca89eb09c9180af7731e37e2ddaaa40fb00f0e863037ab732b9cddec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/MetroSort.kt: metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/MetroSort.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in MetroSortKt.computeStronglyConnectedComponents at line 663. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/MetroSort.kt\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":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/MetroSort.kt"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fc77a0186c2ab7d40cd8389d56c41d436238d109ca0dadbcfb8c0c2ae7d73f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerClassChecker.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerClassChecker.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in BindingContainerClassChecker.checkImpl at line 83. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerClassChecker.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerClassChecker.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f319a3fcb4aedd2846f027eccd98b01a49291ab188b20159e6caab238d8b26fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ContributionsFirGenerator.generateFunctions at line 497. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab58212181c73efaa0c29dbf32d849ecdd5fa57abf1a56be136ce29b13ad3076"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MultibindsChecker.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MultibindsChecker.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in MultibindsChecker.checkImpl 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MultibindsChecker.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MultibindsChecker.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e6b001db510c7beea5fe98ddd3f6b6e268d1c5f5b959efc608170668a7fb3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphCreatorChecker.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphCreatorChecker.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in DependencyGraphCreatorChecker.checkImpl at line 71. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphCreatorChecker.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphCreatorChecker.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c84de5e200c88b251a701f7cb5fba60180cf84822455c0d07901a1922b071de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/DependencyGraphFirGenerator.kt: compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/DependencyGraphFirGenerator.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DependencyGraphFirGenerator.generateFunctions at line 731. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/DependencyGraphFirGenerator.kt\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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/DependencyGraphFirGenerator.kt"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35ce3b6ff6e69922e0fa6f6cc7ca15a5c5ba11414b25edda9b6cf0abf2069fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/ResolutionInputCapture.kt: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/ResolutionInputCapture.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ResolutionInputCapture.capture at line 39. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/ResolutionInputCapture.kt\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/ResolutionInputCapture.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd9351882a860c3f08adf155ab6fc9c1424b181addf91709c640aa4bdf36011"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/MetroGradleSubplugin.kt: gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/MetroGradleSubplugin.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MetroGradleSubplugin.applyToCompilation at line 187. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/MetroGradleSubplugin.kt\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":"gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/MetroGradleSubplugin.kt"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4c0b55e3c9311911c4879295b1f3b1d9ca442b7f315cc0cdee9401d1850755"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphDeclarationExtractor.kt: idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphDeclarationExtractor.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in GraphDeclarationExtractor.extract at line 61. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 12:20:00 -05:00\u0027 --until=\u00272026-11-16 12:20:00 -05:00\u0027 --full-history --no-merges -- idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphDeclarationExtractor.kt\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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/graph/GraphDeclarationExtractor.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aab14ded200677315d71c60f8f4120f15887644c310545b41460ead0d4ae8ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO KAPT/KSP are unreliable here, the generated code is not always linked :( \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/interop/dependencies-dagger/src/test/kotlin/dev/zacsweers/metro/sample/DaggerDependenciesTest.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"189842ae444984dd577de5c51d3ee0b37cda3b9cada82e88a402d62eecc41bf7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO KAPT/KSP are unreliable here, the generated code is not always linked :( \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/interop/dependencies-dagger/src/test/kotlin/dev/zacsweers/metro/sample/DaggerDependenciesTest.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"517d85594dfb9486335a401f9eb10e6600e08c7edf560192443b53363134a093"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this wrapper is because of a strange bug in kotlinc where TypeResolverService \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/integration-tests/src/commonTest/kotlin/dev/zacsweers/metro/test/integration/CycleBreakingTests.kt"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f952012a4f4ab2d4e2a4e725a4ef3966affd86f22060836780fe9182f93986"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this wrapper is because of a strange bug in kotlinc where TypeResolverService \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/integration-tests/src/commonTest/kotlin/dev/zacsweers/metro/test/integration/CycleBreakingTests.kt"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5840132dde3acbd5a3198bffbe9a1a6950fb417a6be70e53fbc01438629d25f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this wrapper is because of a strange bug in kotlinc where TypeResolverService \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/integration-tests/src/commonTest/kotlin/dev/zacsweers/metro/test/integration/CycleBreakingTests.kt"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ce91a97c1cfbc6becac81cd5fc82a0fb8ab1f7ec9b574639fe527d5925edbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this wrapper is because of a strange bug in kotlinc where TypeResolverService \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/integration-tests/src/commonTest/kotlin/dev/zacsweers/metro/test/integration/CycleBreakingTests.kt"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"840fd130c240941aebf335656ff3ff0582bbe45596ff639f6ebd7937bd5e3528"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO on the JVM we get Collections.singleton() but other platforms just us HashSet. Maybe we \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/integration-tests/src/commonTest/kotlin/dev/zacsweers/metro/test/integration/DependencyGraphProcessingTest.kt"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"24acba31e5e12bdb39aa5fbf1f3a44a9a422be5f65110b045f2440205590d6f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Wasm annotation classes don\u0027t implement equals correctly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/integration-tests/src/commonTest/kotlin/dev/zacsweers/metro/test/integration/DependencyGraphProcessingTest.kt"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a71134dc405dc36c66ddc26e6ec80ea1bea6a9c2e97189d207fdca754745ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this needs more work to support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/integration-tests/src/commonTest/kotlin/dev/zacsweers/metro/test/integration/DependencyGraphProcessingTest.kt"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"73851f7ea0d59cb5d45da072f74eef4773c8df63a3441b2002c5fb099f0d0209"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move back to function injection once non-JVM platforms work with top-level FIR injections \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/circuit-app/src/commonMain/kotlin/dev/zacsweers/metro/sample/circuit/CounterApp.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71bc04a88f4f9ec84cb2fdb8e62d53be9e6052c6d2a94bcc924b232ec24c103"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO are these overrides right? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/commonMain/kotlin/dev/zacsweers/metro/internal/MapProviderFactory.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9a11cec8e2752c41585bfad7e96af6743f941728ff7e08e6ee8391e609bafc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ronshapiro): Store a List\u003C extends Provider\u003CT\u003E\u003E and avoid the cast to Provider\u003CT\u003E \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/commonMain/kotlin/dev/zacsweers/metro/internal/SetFactory.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"95858aed65ac3e38eddaaaa4686851927789acd8d0a7d7ac1e4922789e4fb7b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is really just here for tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metro-common/src/test/kotlin/dev/zacsweers/metro/compiler/graph/MetroSortTest.kt"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5f97f9d64e4122ee3b55994372f90cb5ebb7ff6b2dc8bcd1948a26a6036d95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO instead of implementing BindingGraph, maybe just make this a builder and have build() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/BindingGraph.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b00d5d5e9630056ff475ddeba9bce2649038df098f3752f60fe34bdaab8f500"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Assert on companion object inlay once we have a test case for it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ide-integration-tests/src/test/kotlin/dev/zacsweers/metro/ide/MetroIdeSmokeTest.kt"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5d719f77a5b84073bd883028d61485151a1fff9d285c9692bd3d02bb353d61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should this use throwing() and fail the build instead? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/MetroGradleSubplugin.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2854d875a3b9d20428d606e3559f1d98a32b27132d0f37cc41a969637c455bd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO sort outputs further? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/artifacts/GenerateGraphMetadataTask.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b73a7eae58d2815890faf907371fe227c66c25f3d2ceeef5b9f50c2d3765a6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO invoke main()? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/functionalTest/kotlin/dev/zacsweers/metro/gradle/InteropConfigurationTest.kt"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"07614058ee87050446d366a99549333546fcf28e45363e1064d94cc96bbe0647"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add more example outputs here. This\u0027ll probably churn a bit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/functionalTest/kotlin/dev/zacsweers/metro/gradle/MetroArtifactsTest.kt"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6e4f9f978d6188e587b6472586967819bf5b58dc6ae2bf3e3f49e4b6f0d0aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dedupe with MetroCompilerTest \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/functionalTest/kotlin/dev/zacsweers/metro/gradle/testUtil.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d7ffcd482d4022ad26c775d67bbdfaee8f6de06ce48326f7985cfc60cb4d58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO shared model? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/functionalTest/kotlin/dev/zacsweers/metro/gradle/incremental/BaseIncrementalCompilationTest.kt"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df04280e3e6527f296c459c29f57890d8d7d00a3bab38166751211f8ee12b65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO eventually support multiple outputs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/kotlin/dev/zacsweers/metro/compiler/MetroDirectives.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11169aef565dc25c0ba735f8c97a61f50aff7b0bd41566a7a1b56ce608dce58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO ever support this in tests? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/kotlin/dev/zacsweers/metro/compiler/MetroExtensionRegistrarConfigurator.kt"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e31ef7456fa94648240daeb104165b8e1e86d1a0c80bbb99c7c5fdb01253a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this escapes other preprocessors but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/kotlin/dev/zacsweers/metro/compiler/interop/Ksp2AdditionalSourceProvider.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5ab6cff9441cee76a37a360997168ffda84757a36e708a37263637691bb743"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is there a corresponding Directive? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/kotlin/dev/zacsweers/metro/compiler/interop/Ksp2AdditionalSourceProvider.kt"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"188f2a4e5d98ea37b70adcafb53419661bce31673edfcc7f276b325531978679"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO untested \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/data/diagnostic/api/circuit/InvalidSupertypes.kt"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ff6e60899d6e4988c1a3e0fdf03588638c272bb7a87f79895a02352baa8c5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO untested \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/data/diagnostic/api/circuit/PresenterFunctionMissingReturn.kt"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0245736fabec4e55954399109b0ddd7eb73f197bf0e60b936dfb587900dd2838"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO untested \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/data/diagnostic/api/circuit/UiFunctionMissingModifier.kt"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1d18f2466ac20502836f5b8ebc4106bb322af750a6ea0a5cdd1c30b69b579f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO eventually enable this on 2.4.0\u002B again \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/data/box/reports/DeeplyNestedGraphsAreHandledWhenGeneratingReports.kt"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceac837020fdc970b660f4a6f33e17976e69ad0e6af6e43dc3c8ca5b1fa6fae0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/data/box/multibindings/DifferentMapWrappingTypes.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b117d0754d478155b6aa67cd5752d893493086372543e15bd70859e54bf7e92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/data/box/inject/member/MemberInjectorRequestMultipleLocations.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f575b248d110a30ea1ec1d796e9e0951bd391249aa74b55ace3e6cd449f1c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/test/kotlin/dev/zacsweers/metro/compiler/transformers/BindingContainerTransformerTest.kt"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e03b0b14562fc2b82d41bbf178ba7c6f4642e80b2533375a3a9bd4b10e70b16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/MetroSimpleFunction.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f020f8655efa0defccd35be27fcfe0378a213465dd1e0fb1591a88c7b384771"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBinding.kt"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"29df8cf27eea95592bbf766d9ed5673476ecd01a462bbd9a234eb77b0b85dfd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/MetroFirAnnotation.kt"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f5d2405263684c5c04a2e61c2b9deb247189e4e3fd39ffb3ec8832992bf0ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a790cb4a975073c30f88cc44ae6655818dd4ca86b1d45fa336df50e48c85f5c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-logic/src/main/kotlin/MetroProjectExtension.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1d5d140032756cd7f143a3cfea358530ae7e6e7f1cf5e43ad7a97be1a22db9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO anvil (and anvil-ksp) don\u0027t support setter injection \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/data/box/interop/dagger/DaggerMemberInjectorCanBeLoadedFromKotlin.kt"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f9d7b439a2a6f725dcda1e677467fc6eae479da3d8ef17ae3a527b9f680767"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO anvil/anvil-ksp don\u0027t support setter injection \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/data/box/interop/dagger/QualifiersFromDaggerMemberInjectorCanBeLoadedFromKotlin.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0db79b206a39573ff3aacbe529e42004a34926af1c6e6d3a8cff202459a985a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/data/box/inject/member/MultiInheritanceMemberInject.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ad78d8b71b5e2571dbe1d0d7764238347ed7fa5a35d0868cd045c21be0272c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO finish support if we support custom collection types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/src/test/data/box/dependencygraph/extensions/PropagatingMultibindingsAcrossExtensionsOnlyUsedInExtensions.kt"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"518ed121ba3b7d7c7f42a7dc5728b752a6acc50631c3d2c5ef496024e9c860ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO short-circuit if we hit a factory with the exact version \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/src/main/kotlin/dev/zacsweers/metro/compiler/compat/CompatContext.kt"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d26e064e83c99b3050ce613d9f54349cd12e2d95754c7db393213f16018db1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move text to the message? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1b672d52fc67aa8a032dbdf4ca2e303b954b4af27f596631732be2b31af1e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO better process expressions and statements \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0318f21756f7f4da531a7a610a2030ba807052ce3e539e7ca92b68e9c380be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO omit super class for enums, annotations? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"1438562a6685672483d1c3bff7db89822a7cec96d33251b8e1c3717ebf3199d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO omit Companion name for companion objects? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c5256f9ad92cc9909dbad46c7deb0c08a9219b443933a0e3f2aae397f0afe3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO do we need to print info about \u0060thisReceiver\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbad69a833c4c3cd760d96c9e6ad2237dc6b174c033d6a30cfeb20816b91a251"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO special support for objects? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f08ee363b5fc1bb2fae92744b434564887cb4ed09535ca713bd4ea66ce2db42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO no test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8957e5fda2c094e715e0c1d1eb9c8d2a92e77b14f1308126241ff711c483d526"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO no test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9655aa46eb20b256bb9eb4b2a1d4fe721cafb4500f72fe55b96ae230d242a38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO no test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c6fa8700da358dafb8e313cc65161fc6a22bc0f8f2d06e25be8c12d93aaff3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO no test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a99be7dca83b93c55e7ada35d14287aa40582500873b57f8e715cd91fbd5365"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO actual? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d453b5f24b7f00c8087173f6f026a0cd13967afb286a2c8390f2b4d5abaef0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO don\u0027t print visibility if it\u0027s not changed in override? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"be48f2dd55dd19c337fc87c1af2621167cdbf9b89dfe43d85fe2fa7ffbaa1b97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO no test with more than one generic parameter with more supertypes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd6a64c0db8f219ae560393e7cb80f7a56d00129529dadb10cd3cbe1898d5d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO don\u0027t print \u0060Any?\u0060 as upper bound? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94184317a1dcbc2dee2a4465a5a91dd47183cc11c07f9e997803ecd641d706a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO abbreviation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fabe53b70f97e260807869a75d1b8313f144642cd1047255cd82f7f0bd7d68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO better rendering for enum entries \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f68c4b193cbce316453c04a939d12c010123f45158bad4de31a1c9bee1ba941"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO no tests, looks like IrAnonymousInitializer has annotations accidentally. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"839cf706b75d40d897854e6cada3c99699b17f7f1ecbccd162002cfd6972e659"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO no tests, looks like there are no irText tests for isStatic flag \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9c5c242397afe8f8fcde04618bcfce67f147692a53436827f087f0971b89f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO name? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5fa36ba104fa0610b51ed79986573fd36667650f51d1d73804ff71966d665c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is it worth to merge code for IrConstructor and IrSimpleFunction? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f8840f1d9080ac1a9a97c6d917c7e0f165185787837d9d33005a0ce2a4c88f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dispatchReceiverParameter -- outer \u0060this\u0060 for inner classes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60776770078659247c0409b4462d2a4f7f41bb9871eeba1e0b4fdda4b48bdae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO return type? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4c9635cadb78590fee4cd8ce16b1a9ae78cca93ebdb98360641caebfe1efec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO print it.type too for varargs? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d21af6fbbdbf409008e9eade8453fa29f66e1f4123e07ecd0a549bfe3120357"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO index? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8187c9306f8ff1d608aa8335336828bc595a35636ff84ec339d420e18da666"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO better rendering for modifiers on property and accessors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f24cb7346084af45f3b29e36f5837e7d6da9054db0dc9bb6f06151cd31f6361"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO don\u0027t print borrowed flags and assert that they are same with a setter or don\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff1a905c2307a606493c45e799b7adf13e24dc02bc5f1bf0c204f09e6aba8b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we can omit type for set parameter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e129c2b44609aff769b4ce34dd8c16ddf8628c19e4c267ad8cae016a89a04bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO assert that typeparameters and receiver are ~same for getter ans setter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18bbc515f628e59042f4b43551298363e7ae64375de7ff2b6d21d929be7b807"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO share code with visitField? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ce6e0a4177cdc268010c58f3e075ba16bda1b548d6e061aa37bf86549c9f26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO generate better name for set parameter \u0060\u003Cset-?\u003E\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c1fc2080b5e7d9973e78984010477b51558cfbd4f704519b0a3045a4816269"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO correspondingPropertySymbol \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"13884beb115d45a4112e590ba78d244d052b2b16f6322c42cd56927b2784db66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO think about better rendering \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec79e133b6dc4f5f5eb0832e87a6582ee62c0ee79ca63ad4779927244f5279b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should we print something here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1a1de97d9d6611888ef11153a4122a97c9aee699a3edbe115119d5d07ff28d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO special blocks using \u0060origin\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41eb802bb8f69fa834a2e60b64bd9252bb0302da7f03997195b9cb8fc2038e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO inlinedFunctionSymbol for IrReturnableBlock \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa2eb9c0ab2568b72728618abb2342f577654c0ffe0146d6a5fb6969734d5a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO no tests for IrReturnableBlock? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaecbe9a916b258ff73ee914b0e84bcd89643794924b83a0f47ba632090c0e0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO type for IrContainerExpression \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"33675956516442d44af661112555da0cc079b529f1ab6ba5b33d4522cb8d0f87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO process specially builtin symbols \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e853f7767b194336fd4d8fed6592a3a5545ff431383ab1ce17108e41832c49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO origin \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f40fe7a8e20731cc415d4ebaa91a0bde11c899e789ff2b0510911bf4d06beb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO which super? smart mode? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"22384d02304d4baf30f5bde428496ab2d371b3b97983839eec2c5cd59fe80e64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO where from to get type arguments for a class? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11155bcf092e7d1402173c7f892882c5a1bfc90116165e2b219f77c2be7cc1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO render it also for static members (from java) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"871dd7cd461d4912e3e81f315f1be9c14ab4c93bffe96fbee925973332e0f33f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO flag to print type param name? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcd69e28b6e01b5559c4ace357c87de87f6893e7275cb39d6c49a77df06d65f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should we print something for omitted arguments (== null)? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14f0c16134e6ab3a468b94cd8168dc6ffccf1347fdfd6398a448c0ac2b8ab36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO skip call to Any? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fae7cd9cd3a3b2f4ad435132d870e6c367c2f119172d76312b4a0db7ae5ff4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO skip call to Enum? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e32b887067952b923446dfe3ac66e1b9a87cc1f2ba3aa110dc8a7aa6055fde"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO flag to omit comment block? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60bef2709ad2320f9bcf4aad565f22bf07b9b811c9658f32be06dd45b4f958b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO assert that \u0060expression.classSymbol.owner == data.parentAsClass \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57fb7aae42f406998a2ee47b066112df3c73964031940440c9f11d027304474"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO better rendering \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"876282c33f38a9ff606427a45a632863987809a76e19b778e7b93c416d257c7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO better rendering \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c23c0e5e98c744dfd05ee9f4406c982a1361e3fa53e8361aeb4cc4088e33ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO omit the name when it\u0027s possible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ced708b0d2c3076cd5fe15060a2bbc39cdf9f09cd6676cfd0caa014ad900c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Is there a difference between \u0060\u003Canonymous\u003E\u0060 and \u0060\u003Cno name provided\u003E\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedab9305a9f4b4257d75440490e949ceb2accea3ff501c2ce189e564b0c670e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Is name of function used somewhere? How it\u0027s important? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"9559b26cd86a9aa2799fc839544737e280bb0b1e27904fd697f20802b67700ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Use lambda syntax when possible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"621f1a5047a015946a046052474c09318b3b8ba294d042ca2918f9c3f3330874"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO don\u0027t print visibility? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7026250b8c090efae3aefb3d96bd6b1a18c1bdc5976a7bc4d6e72b4bc5ff29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO which supper? smart mode? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1252b21e077fa20d7f3391b1ad519badb139181c3b0754419dcc338164d5a10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO what if symbol is unbound? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63632aad2b472b7f590865b073a7906e222436f277e2072c6c8d856a16c25dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"6579763d4347b4940fe3f8af0ebce78d22d4dfceebf9101039b7bd733614eaee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO label \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"65be98d43afaaed72875d81f1910b0cc3ecb1853ba62e0abc9a7c456198a9902"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO optionally don\u0027t print Unit when return type of returnTargetSymbol is Unit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ad0ddbb557f9a4412211af75984a610a1eb00a829ae5357317c211b22c372a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use triple quotes when possible? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e4e1cf7b2a76f72c42d19a9d3103510a7151cadb495f8b24e8dbc30a3c57cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO optionally each argument at a separate line, another option add a wrapping \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fd76f2f0ab186d8e632eab11e4b7c73f42117ffb25253169e415024e0494fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO no tests for escaping quotes (\u0027,\u0022) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f62cf1a550cdfe631548c16ce84807850d4cc35ee3ad675f727e72bb2559ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO better rendering? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c26d28c90858f604d7d87cd4c5aedc367e8be60a95d87797f1f44fc1132451"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO varargElementType \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46e95bedeca7806bfeaea7b3d6cccfa2903882386afb49aba816e04717e7d15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO print if when possible? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"2642a200d9abdc6d6c3317326b7f4ece2cb2618b649647c190a1ff8ac3aad55f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO render loop reference \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf82b4b8c34b5abb9f99fc10639995b4e71bf0ff3861a4710ee8bc0f9ac80c42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO reflectionTarget \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b55fd12d1c434974ea0a6f4e897689d66601b75d6a6130f06433eb6649f8904"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO do we need additional fields (field, getter, setter)? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a9138c6682b5ceee30c06c918d174930a6024b932cf0277c25887ebd9f07cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO do we need additional fields (delegate, getter, setter)? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dc569f36250a0614dadb1046d0bbc6999308de535b2c517536e0e9a353956d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO description \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aba31bc9584af5484b33af101f9c8e7e6338d7ddd577fa931430c264781bba0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO description \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-compat/k230/src/main/kotlin/dev/zacsweers/metro/compiler/compat/k230/betterDumpKotlinLike.kt"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"9586919b6057b1ce1c0b18ad99a2f4a80df9d98267c1fb916292592ed981a5e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO every time we update this a ton of tests fail because their line numbers change \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/test/kotlin/dev/zacsweers/metro/compiler/MetroCompilerTest.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcafaae610eafb7931b96057b62dd206280572ec3fc5e5ea68b83b5b0d4befa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO update callers to new location \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/test/kotlin/dev/zacsweers/metro/compiler/TestUtils.kt"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"d995c180d2970746587a16dd39642b25109827b5162e94a7a0e3489e94de1858"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO update callers to new location \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/test/kotlin/dev/zacsweers/metro/compiler/TestUtils.kt"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c34a3dd1e11e78fc603b13e2452545e3556ca024b58fa1f84f5bb3b773f676d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO these appear to need metadata annotations written correctly to work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/test/kotlin/dev/zacsweers/metro/compiler/transformers/BindingContainerTransformerTest.kt"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"172253f6e4eb801c740cca9bf530e3ce9a46e12d8c50fae3dee8d7affcd8c158"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO these appear to need metadata annotations written correctly to work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/test/kotlin/dev/zacsweers/metro/compiler/transformers/BindingContainerTransformerTest.kt"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdf5eb2a0e3c096b185cf78ca89e3e98010bd222e43527bfc94a2b7cc67eeb5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move to compiler-tests when reporting sourceless diagnostics work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/test/kotlin/dev/zacsweers/metro/compiler/transformers/BindingContainerTransformerTest.kt"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"329a02e05da1970fdabdf8542ecf5adc4d06987e2652a743b4c8b6ab587d9cac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add context parameters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/test/kotlin/dev/zacsweers/metro/compiler/ir/RenderingTest.kt"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4973b4e2ab049b959271c640fc4319423c585d8bbaa089d79f5c228189acd39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO the lack of a type here is unfortunate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad25d07a359f073b0b86e0853b4ab51e07c2531f720ef7119a6c631f7b1b6e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO unfortunate but we do kinda know it\u0027s safe here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc177bee0808696e86daba13b35e9c0f1cd6de3450d712af614b6104f8a5b0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"1196fb77a437e9f59c6518d874c50ca0838c19be90495855ea5c043f6af6c0f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO change to Name? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/NameAllocator.kt"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e24c7f8eab6fa3676c4094a953ee32dd1e0a721138ae100df4a78d289c48e57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO would be nice to handle \u0060foo\u003C*\u003E\u0060 -\u003E \u0060foo_star_\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/NameAllocator.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e0c87883b89e6d9387efec0cf1cadd9e0e3718e3cc03356fdecd7255e9c331"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this currently only checks raw class IDs and not supertypes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/symbols/ProviderTypeConverter.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb93e1b9bcdb10003431212b0946e5f3b538d0450d84f27fddbf9c4d4b606309"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO also report target scopes? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrBindsLikeCallable.kt"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f61265fa7f0bea5e0b547bd42ced394e87aed45d0d1beb964ef6177bc41c6ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO what if we support other optionals? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrBindsLikeCallable.kt"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e2b08dc7644e62c6549c73db0442afb5e6fa5edc593c6c0b15d3402033bd06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO iter once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrBoundTypeResolver.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4686577b2b56338304a5e03322cdc172157c2131dee7123e7b3ad1b064934fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO cache these in DependencyGraphTransformer or shared transformer data \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContextualTypeKey.kt"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"274049c32541ec72472345f22d5b42d04f437120458bbf6d15403d4bcd2821e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO do we need to transform contextkey for multibindings here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrContextualTypeKey.kt"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"143bd67d44984133dd0fe6505d7d90ad1f941fea4122cfeee0084ee24f486397"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO https://youtrack.jetbrains.com/issue/KT-83491"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrDiagnostics.kt"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e089a3160932df9cdfc0986e70814a5eadf7b7b4a37db3153792a46b31d2aa8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO inline extension? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrMetroContext.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1902f4faa34d8b66c1e00d07f5e3ac55895684be24eff7fb8c88290947acd1e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO can we pass the remapper in? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrMetroFactory.kt"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a0d33269fa8a6a35cf2d0310996aa084d649a71f7ba7ef42c57122841e483f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO what about !contextualTypeKey.isDeferrable? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrProviderFactory.kt"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1887c8c3a5762dfab650aa0aab56fb1013a588b3a6a8e122ddabbcfaac5c45de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support fields \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrProviderFactory.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b14221a372fcc3a4f54964101721c2ba15ac9a8e8981d2b31c72802ade4754d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO these extra properties are awkward. Should we make this a sealed class? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrTypeKey.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"975e6a6a85ba40f11f41ef772fae4528efc03303a254e17145175cac3e67ace2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use AccessType \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ParentContext.kt"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60fe77d5db24673e6c9abf7f8d893d8646031be09a065d281146b8f31472b4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this can be removed after moving to 2.4.20 as a minimum \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a02d1a90a544f23ccb3f91b8c5081c417b377c24babb2a4b39bb700a18b49b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO create an instance of this that caches lookups? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e4d92b938fca65a2cfe2ede5dd5377640638f936e55f98efc7553831896e09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO create an instance of this that caches lookups? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a5f97a998e19af92ab413c75e9dd009eb71f0e12098c8fd7ca91a660f7599c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is only left over for member injectors. Should migrate that to the typekey fields \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af6636d6d1ccb234d4770960e46306d06b6d122375ab6ce470f8aa1ab0db4f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO eventually just return a Map\u003CTypeKey, IrField\u003E \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d9bbf9b868fb2b2761686b9991c1f72cbbaa319050ca564039b42109e53001"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO IrErrorType.symbol? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cda006b09076825cb35bcf1426e566595908e07eba569321366d7ff753ba5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is there a faster way to do this use case? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9924d565f987d90defbbb12f603617b4ce8818fec30f4ab2f4acf65e285ad2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO can we consolidate function logic? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68a74c3a5b0e476565c2acea07004ac7d3fa702c94dda572c02e9408022227b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO impl use \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0477aad4f2418cd9561468c1f5e4985d6c3260c2a593b4f88349fd24415787cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO reconcile this with isVisibleTo()? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce99b3ad540d7f79f562e546d948326550b85cff499a955361ce7da1de74ce69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO cache lookups of injected_class since it\u0027s checked multiple times \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/metadata.kt"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9232940683e4e80909822d3aaf0cb9ef1d2ad3ee45d3e5ff59b086c1842bfec4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO metadata for graphs and containers are a bit conflated, would be nice to better separate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/metadata.kt"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"228150d32a354ea5e434be2028c5213fe4a9f73456a2ebcf34777ee0b6cfd751"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO DRY this up with the constructor injection override \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6cb78b91f839eda068f34f9b35ff67ff822462044980827228cce936a671f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO the if check here is if/when we move factory gen totally to IR \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e6aa8a3a5d1673c2656d07cf679c104ac419e2f47a4db483ea7424001ba37a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO what if they forgot to run the metro compiler? Should we put something in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindsMirrorClassTransformer.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"02694dfba9baf74d7770faeaa3b85e4863339a6bf72c6a40bed6a1a1bdeca2a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO these locations are bogus in generated binding functions. Report origin class \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindsMirrorClassTransformer.kt"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2d5e296cd0d2d025a9def5976c702cc67d9cfa74031bd338371cd3361f51d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO others? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4746f8ac909fb9bf32230e235426be0a74d547f13f268a0b9812a21731fddbf8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO others? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cceccbda3b41c6921e9f44b5602a6371bdf3dd91a8f829bd7875da3a9c7a3f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO any qualifiers? What if we want to qualify the instance type but not the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b84fd9aeb4d9ee612bd058e259fdd9e14e80747fb931b4c4c681de7ebf6229"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO can we remove this and just rely on the copy in BindsMirrorTransformer? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/ContributionIrTransformer.kt"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b535f369af74255d94af262a3e532452eec9df5d90c0391f88d4242efcf8257"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO need to better divvy these \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/CoreTransformers.kt"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b6d6253f62202ce1bf24c7c0538646158d12517bd2600dfa129655beebf176"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO can we eagerly check for known metro types and skip? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/CoreTransformers.kt"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29c7b52fbb8e141b52ac8d876dbc2cfe4ffc6c67fe7547953f729aeb7504b53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this doesn\u0027t work as expected in KMP, where things compiled in common are seen \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce17fab673f4a5f0e911327092184ccb171cefc86e049081476618bb4603406a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is it an error if we ever hit this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/InjectedClassTransformer.kt"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9673fe233e8dac10eb4428bb3e342b3948f041cdc5327d79ad79d7a93bda808"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO This is ugly. Can we just source all the params directly from the FIR class now? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a899fa742b3426ca23a55b47732ec2fdfffb13dfcaff7a05bcf510485bf466"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO maybe better to abstract metadata writing somewhere higher level \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"370124726e90f6b0682a3d8433b0aef4b493b3cddf7c96bd1799a085f6b50220"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO what about overloads of the same name? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/MembersInjectorTransformer.kt"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"405f722b24cee6d95b3fe8efd6c61a2eb29d19d00faf0912387065afddc1b096"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO eventually move this to function creation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/factoryIrUtil.kt"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9e9a75b534c433f439c6c25d0ef99eb0c485782b668cbdf48fba0ca5e01c56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move to function creation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/factoryIrUtil.kt"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6622eac009e89d3e701a04bb8e2de471c0c265db92de656a406e8f25a4f0c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO warn if it\u0027s anything other than null for now? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/parameters/Parameter.kt"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de6d71a8feebad11ff939198f90b7b6228767c39a829e7d8464c2a528e84fa8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO not supported for now \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/parameters/Parameter.kt"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cf7fed070d4c7a89ebb0f54884ccc2dcfb6896ead7061ae5b9e17385f24543"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO render context receivers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/parameters/Parameters.kt"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7e9ed9a63d11c78ccbe976aa4d6d4ea5baf2fb9d5173a98ae7cf0193374006"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dedupe supertype iteration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9445e5672f269113f15bfd69d0bf06950246a485f368bd731961c1e6c24538a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO warning? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"52946c96fcaa05ff3b3cee323f98c6389985eae77234323e32cee1507107b151"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dedupe this allDependencies iteration with graph gen \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17d016f2ba902adf5beed0ccf4b66fbd57ab18b90a765154a754b5503a2c2e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO try to make accessors in this single-pass \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b371abd3f6e6d17ff45fbbf0ec8472ab869c846f253745345cef3bc0cba012"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO replace with AccessType \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5853b3def05ce618db939357ee06942ef4db8bee73e5885e2450f6809aa0b41f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO since we already check this in FIR can we leave a more specific breadcrumb \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3596358eacbc3541879efa7fac5dc0a23905c9529940b9130a0f328f5b20a0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dagger doesn\u0027t appear to error for this case to model off of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"615227516c9ff440a1b5909129d6ac3be6a48a399f25db7d77fd9d51971b2541"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dagger doesn\u0027t appear to error for this case to model off of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"860e98b1faf8054481235de6427e5246c4ee89f5b4a7a714fa5acc9ada9afb7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO it appears that on native compilations, which appear to complain if you don\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"273dcbfdc0f95767347b86a92433a99fcc6c1604afb268ef8ae796c56f00c379"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO it kinda sucks that we compute this in both FIR and IR? Maybe we can do this in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"406fcb4bb1345c35d465bd54c5700c143a298862904c7b13d397d865ea4883a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO single supertype pass \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a1ac8f39d4b81d0a7af6cf6b6f8b952d56a8a1b8a12f04a0a8ba5f5dc2e16a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO only if annotated @BindingContainer? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a78011438bb0fa14b84e0ae6783a107c616ab3bb6d1d467a7ab8c767d1ab5b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO need to look up accessors and binds functions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c7f96809515c8bde852bda88bfd9ab1b472f73d47a7634c3601c95c0afbfe5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is this duplicating info we already have in the proto? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e6c5f1ede46e32c6e4b4f4a661a19286de00c9e06843aee3c9fd866f3a2eae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO are both necessary? Is there any case where only one is specified? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBinding.kt"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"376ab2d22ceb85cc1a68b1d61f527cc36864621f356a306619fe1faf134b16ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO sets \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBinding.kt"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef79832c4e3575b5323d16f04a48d025175de0bf34512eb3fdc1534c833516e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO improve this cleanup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7b81173bbfab8952707eaa68101f956668852495d12af0771ccfe91c07d1ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO hoist accessors up and visit in seal? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"2406d1fddaefe49291589417a05c035e67fe56cd677fc10a26447c2987e5be9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO cache these in metrocontext. Just IrTypekey -\u003E IrContextualTypeKey \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9e32faf92af1f0e3a2d8af4985c2949d0cfd86b3fac473378eea20d9e6dcb7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO iterate on this more! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c9b4ffb1102b479332fa278ef0d9d5b201a2b96d3e934575cd82afc7790dcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO can this check move to FIR injection sites? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b0f26880f4f116b31f53681ab28035d89dd90fad4906611550ec0c6e4d690d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO can we use one structure? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"644d3e1ede8c25e7a54baca36cdb035059dc43e18e120af21bddcad270ed3be8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO can we use scattermap\u0027s IntIntMap? Store the typekey hash to its index \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27bb56a8f639dc1383baa78a0cdb44165604b57c8ea2dbbfbfa18c93655c05f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO optimize this by looking in the entrySet first? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ec42c8715d64b34861330bc0bec7abe4de83f82a69ea63f6dd27d998871c3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is all super ugly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingStack.kt"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36aaa1ae67d9a43dfc54906487b080c4ae2218bf8aa7914ea9be4fcb226fe65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO if we copy the annotations over in FIR we can skip this creator lookup all together \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"431ee2895c0c76840f53ce0954e75658bc20a0f538d7f0b345a5e809e22bf1bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add asProvider support? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1d71915bf442bd9b1f6c99b76a6ca74d61fb1f81d18730db20e87fb5a27427"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO switch to direct initializers? For some reason when I try, the fields are not set \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/SwitchingProviderGenerator.kt"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6d065d26f9e260b73945390b10db769e6d9b44c87f7a6275d78d06d2545db9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO generics? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/SyntheticGraphGenerator.kt"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4c4220113b42a89508f0e358c3906e2e79b264bb886cbc33cf3f905c84601c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO generics? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/GraphFactoryFirSupertypeGenerator.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7409420f68394d8798814c50a7cc87ddf910da2f1334ca85060a965454a5d0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO generics? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/GraphFactoryFirSupertypeGenerator.kt"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"191c627db272df26b267e28c149e3d4dfd0c440c872fe9669b8d9f02807318c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make this just hold the original binding \u002B extras? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/sharding/ShardBinding.kt"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3336fe821598d1a09239c452751916e57de808effdc16166bf7f3b14f35acf45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO cache the aliases (or retrieve from binding property collector?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1b680690df67fc4266e2d6b0d1114c479f2ea9ef3159240ca28ece98f1ffa5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO what if the return type is a Provider? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acbdebb7dc51b6ececf98f79a0657c2ea8e4fb591c999baf029f3d75d61c2a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO sealed subtypes for self-bindings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de51e042e7e39208d201a3a35ce7f3242c8249579f5c5ab2e0e760fb4126e7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO clean all this up \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"0637438adcf885f3c717dde87c55f2d4b0a3838c2bd4234926cf46bfa95dfa91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO consolidate this logic with generateBindingCode \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c124710a12e31bef9b3b131396b84c6f6610da82bc405438044e22773994649"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO cache these? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/FirContextualTypeKey.kt"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"681d6c9051b95460385dbf2f4f2026426afe8e98cf1bbf12f44d1256a0a5054d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make this severity configurable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/MetroDiagnostics.kt"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d485a06816e3ca85e129eac4b3716362753b77ed064805b8e08ba904aa5c92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO eventually this will change to allow function injection \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/MetroDiagnostics.kt"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"515c9cbc1ad3489c1c3155c0f64e7ac8b3406fb57aab0e05eb8044c05d28c614"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO type args not supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/MetroFirAnnotation.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bb6496fc36c3b90e5031f0955887c0b91395554d671029eae88bfe08ba4a9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO it would be neat to transform default value expressions in FIR? Right now only \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/builders.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7263144f5ef4bf007a9122febb4ec58464628d2549b9bb59cc85c969be9d7a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check how it will actually work in fir2ir \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/builders.kt"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"df15fae90895ea386dcdb0215fbd83a120db10265f5c88805a4d4b09a1fc17ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO after min kotlin 2.3.20 we can remove this for FirCollectionLiteral \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/fir.kt"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"418f659e03620a09efe0ce1bd5bd351a01ba5afe838aca32deccb4db07134697"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO what about expect/actual/protected \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/fir.kt"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6bbfe55e93ab7027d7f35fb0b0a81c2badf489549c1780c033bf228b433921"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO what about across modules? Is internal really ok? Or PublishedApi? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/fir.kt"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d722d8b87103db4dbd0d790c19efe32e5458bc100761f5e936ae2096e12fd60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use FirExpression extensions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/fir.kt"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e42b6d23c9becdd5c676ea35de7c074f5a1a3c00a382f9ee3bacda806102b85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add a single = true|false param? How would we propagate errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/fir.kt"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"29735c95a3a3b3093dfac05b4655fa748163cf07bd85d8ffb94b4e92cd4d2204"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this still doesn\u0027t seem to work in 2.2 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/fir.kt"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"92137cd115e5f91de2b31828b9c53e8d5cc4fb0cf67f55e838d1fce8b3f45180"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove expectAs in 2.3.20 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/fir.kt"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a91135cd26388c9e22be88b204f1aaa10e571cd7fc6933c2b6f61a4a8396e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove expectAs in 2.3.20 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/fir.kt"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd467ab1db59cd395290ec0ee7a58471a65458986f9ab8300d3e170f1a9deb1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove expectAs in 2.3.20 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5bd9e0d0c5c99c209057e668cdd2261176735fd43bd4d0bded85aef0a7100b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO lookup tracking? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/fir.kt"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1155780157c42a20be30e840869ce059a82f8fe7c5b2fe62998efcf6152e4f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO also check for factory annotation? Not sure what else we\u0027d do anyway though \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/AssistedFactoryFirGenerator.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce95f1bcac55c3c1cb28d775238e083a1b35ad8895d0eb08bfd116cd60266aec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO test this case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/AssistedFactoryFirGenerator.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d614f5ec200029351d3289ac35b1871359e643b09cfba6f4583606109dc9c9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO probably not needed? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/BindingMirrorClassFirGenerator.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8409d651ecaaafb4e8d67092fc0dac681a13b7e39c9ae5a4566e8e36b4cef88b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make this lazily computed? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"2376497855c955d9a4d5b59f9302549d774c755aea0f0acfd5cef0a6af1890dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is finicky and the target class\u0027s annotations aren\u0027t resolved. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributedInterfaceSupertypeGenerator.kt"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd3a615312642f2f83b316c5e15997ec52a5645ca0469cff244b796e63eb68e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO a bunch of this could probably be cleaned up now that the functions are generated in IR \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f49a528144017e0a9f9d92053f5bddb97de85d8e9f637f2f7a53d8a859ad8ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make formatted name instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ef891a60e87a04a5697b115e9f6df70a665224bcd7d1d7570badfb6b8efb84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO what\u0027s the better way to log? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/DependencyGraphFirGenerator.kt"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"715eb83676fb62cce04c8768de975ac829b557bf9c8be3cb6cc246d08e7cd75c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO why does this happen in the IDE? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/DependencyGraphFirGenerator.kt"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fdf8a3cacbdc1ffb5663e37373d4b1061eca640bd9e44465923c95741a1c96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO why does the above work but not the predicate matcher? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/GraphFactoryFirSupertypeGenerator.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48546720584de24890a28abb986000a40b4f5ddca594ffb591db5e2d576c76a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO apparently writing these types of caches is bad and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d0047b373bbe775648af982e312ecb12570a2fb89bcc0bcb7540b3cfe4ce14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO apparently writing these types of caches is bad and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ProvidesFactoryFirGenerator.kt"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b906be88f707c980b4283826aa5c3eb754b797295267a3ccccb039e6b8c036"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dedupe keys? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6522a69bf01ef807ccd7bac99853d3868dc958351fb20f8eedf91fa0dab480"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is ugly but there\u0027s no API on SimpleFunctionBuildingContext \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/InjectedClassFirGenerator.kt"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3869ad5ce57118b18f82b1c5d64a1b7ba70d661707ae4e5cde205ed4258edca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO can we get a finer-grained callback other than just per-class? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ProvidesFactoryFirGenerator.kt"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc54b760c07545ad95d0744cb3e031b595700b2fb2ccc1643066f25d14c60ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AggregationChecker.kt"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea4db90c8238c52809249ffe8ec73eca87860de70397d064aaf5b6c050d472d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO validate the assisted injection here too? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AssistedInjectChecker.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"462017a9e78f6f3d152d171b2bc7a1e03a99ae7bc09bb88db0fd26101eed3238"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dagger doesn\u0027t allow type params on these, but seems like we could? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AssistedInjectChecker.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f2685ada624579bb8f369cf3ff23d06b11f613b0ad49227fc2d6624de8ea7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO error \u002B test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AssistedInjectChecker.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49ae2467343d0e21dd40f805380206fae34436973cf54b3c79696b1b2ff71aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   // TODO error \u002B test. Or just just ignore them? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/AssistedInjectChecker.kt"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9073c3bd37ea14c984df7565b65c52d6169872b587d109127b3f2526f0a36a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support first, non-receiver parameter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9bdde3989cf2d7eba1d5beca7341d79db8ac85fb8f60f4710234566aae6f41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add a test for isIntoMultibinding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76cf951f4755a4c9efdd8dc4d98019ff87b5a22c519b4833124d18de2ecb69a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO maybe we should report matching keys but different scopes? Feels like it could \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbce5dc4a585a7e5ce7c5965188ab0c628d99b3ea6ba16ee5e0dded3346ea77a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Not actually sure what dagger does. Maybe we should support this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/DependencyGraphChecker.kt"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e559c2c4d1653ea6cd48c6b45f835a5412ad4bf8e71b8b37bdcb675a2c65e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO checker \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitContributionExtension.kt"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c245272d93971a26b99baf494239a0e7552d6d16fdab41b09807119652b34c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO not currently able to fully implement this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitFirExtension.kt"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"d978ffca7bf364d9680b127d0775bcd1144d2340b44b6fe654c66608f83aa24f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this seems expensive to do there. Maybe FirLanguageVersionSettingsChecker? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitInjectChecker.kt"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f52791729235cb790846e125559e1f241da2a9ee8c399e106893b48902e5d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO irLambda \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b10d74e7ee7fe60c860444518a872fe369b33619124f7eeb5654e01df67e5f9"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060compiler-tests/build.gradle.kts\u0060 makes this repository a deployable product (line 358)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler-tests/build.gradle.kts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6dd7eb5b339adad3aaa13b75fa83b3f1db38768a15b6b63f0ce2d33778049b"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060buildIROnlyFactoriesAnnotation\u0060 spells \u0060IR\u0060 where 62 names in the project spell it \u0060Ir\u0060: 62 of 63 names in project compiler spell the token \u0060Ir\u0060 (62 of 63; unit: names in project compiler containing \u0060Ir\u0060). Peers: MetroAnnotationsKt.mirrorIrConstructorCalls (compiler/src/main/kotlin/dev/zacsweers/metro/compiler/MetroAnnotations.kt:784); dev.zacsweers.metro.compiler.api.ir.MetroIrContributionExtension (compiler/src/main/kotlin/dev/zacsweers/metro/compiler/api/ir/MetroIrContributionExtension.kt:31); dev.zacsweers.metro.compiler.circuit.CircuitIrExtensionKt (compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt:1); dev.zacsweers.metro.compiler.circuit.CircuitIrDeclarationGenerationExtension (compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt:94); dev.zacsweers.metro.compiler.circuit.CircuitIrExtension (compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitIrExtension.kt:145). Rename to \u0060buildIrOnlyFactoriesAnnotation\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/ContributionsFirGenerator.kt"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"52727e55bab3412fd0a8779200b63b0509029552c9022418d3eb3a769db32907"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060compiler\u0060 (69434 LoC, 674 module-visible types across 20 directories) overshoots its size bounds. 3 of 29 build unit(s) (Gradle) overshoot their size bounds, lowering Project Cohesion to 7.9/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":"compiler/build.gradle.kts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b76526145613a64977046a031fd90b533683e37856aca0b1af010432817f56"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060idea-plugin\u0060 (33060 LoC, 525 module-visible types across 18 directories) overshoots its size bounds. 3 of 29 build unit(s) (Gradle) overshoot their size bounds, lowering Project Cohesion to 7.9/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":"idea-plugin/build.gradle.kts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"198104786b1de963dfe3323d447fa1badd49fed55a71ea551d9e706ac7b35b7e"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060metro-common\u0060 (10595 LoC, 424 module-visible types across 11 directories) overshoots its size bounds. 3 of 29 build unit(s) (Gradle) overshoot their size bounds, lowering Project Cohesion to 7.9/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":"metro-common/build.gradle.kts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e73ab05b11de4e0af7a4265185c5f0e9806e7bf4d2671c99012b66a3bb57827"}},{"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":"db282fde3e5ce016f87499c7de817b2ca3d87392df02124f6b001d79775b08a2"},"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":"a2dc6dd6e308d3ffcb467e733b49f7aa74ecc6ec69c9db06ef7e663d174791ff"},"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":"6b55d5ba2d30a1943e55777970e516d30dc20d6fa2ed3073b9980821dc5f1a2a"},"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":"a91fb6a31270555631ef477282439ea9000c0249bd45af68b5c05105750e9726"},"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":"dae7e1438dc4a7f7535a27db3f195b067b7c4d1f1dc329307f6df044cb09cdb3"},"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":"08171afa4b060269630ee38ea23e20e3745829d5b114a04b8621aa2c448e4d9c"},"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":"96bcdc97425e881d4820c23b75536cf99d4e93abc4b5083bca2059457154fe58"},"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":"c78931419d93e14be677292e7a845a9484c89164aa074a560a8ef9f2c9c98e40"},"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":"659b46dce83bd80d7de2d1c5d5c012c52534ab6b62b960d713ec4f21d7623b3e"},"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":"b880fb504874fa72450f82dc5aad7712eeeb56bf8b76e40eb57a081d752ece8d"},"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":"d8f4a90c5682ec72a1d5f070a69447182373fc53e3070ea217cbd4b5d58ad531"},"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":"ba6cbdee7f306d6e77e637a461cd8300ff3b3d33112c8803016ba446302b89d7"},"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":"66b36dbd84f3a97751296b6a28a5afdf2061781ddba908b3709e7926b5eda65c"},"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":"4f2ac3d1e00541b1de4827f4791a3446d98193ab56a2ee5c595e289dca831340"},"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":"eab0b1356ada59f9304a61dd1b0df9e1316c398fbf714b7d8e787149406acad4"},"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":"c6998d9561c296f720347d2bce3826aac230add3852ca442ad7189b71116a81a"},"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":"d86a4e121c4dfb658e58c1b583e42c34e459846f79b5bae5eabf7c04ae8bbed6"},"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":"caa20b6f746da8cc2190275348d2681020a74f3b1e4719cafde958ce96f41496"},"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":"e301645cddeef54e68582c95674b2d5a91e7a25ffc01f97843d2e139c3aa5d8d"},"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":"54dbcc7d0dd46eca3611f62b80b99d27f73b237a7b977dbdb22aba3a736c4f30"},"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":"f389f09b702e7d299a843f1a17b5a9b693b7d19c91691ae2dcac9d8021401853"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"1f1600f4dcb714de583fbb0d0f1f3b00a317ee3bc54aaa457d4ecd3905599e3c"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"c8eda36e37518cfd5aa35efd301b4fbaea8c345daecc83486ab24b8a083dade2"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"4bea64dbccc9360faa56eb166c693ab188f67dd5eb1c0376a05cd543b80b6577"},"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":"f94ac06d1ee4666c28e9846ae73efce8cdc5dcb7867e9927b7dd30f1280a67db"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"dc7afff3960d3707c57ae493e4ad198f68f6a58fa0725b76409fc6dcc8483683"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"0a8b527777d6d2922f84d2883b4d0f8e55a31bd5cf43224fc529bdb684b957b1"},"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":"2c3a4bec23981e477dafc39383479d3e9ac1ce95046086f5b112334bfca3d005"},"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":"732826f8f0fd2d29239f81bdddde4ab23db1f323e8f3e85cd32a0585dfa7fa38"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"663c400c4c6b6181e71cc31957464db7dff80c6feacfcafb049905f598bf58ea"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"d0b15b9280918819ce7134d39779f430ecd07ad46566a4ba86a4526803aaaaca"},"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":"02df58307a1daa8f328a5123782460aa263c81dcd7569c1bfd445e2d70801246"},"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":"d0be1f234637e0f47706b95221a77d1039e086be457abe371dca3a360cd33aa3"},"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":"f29d86e08ab493ac38a5d4de619dee3aced071a0cf632d9a8ee4d3ca4592ca72"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"64c31f373687d877d5442556624451898111b2026308d82fa264c62d154292f0"},"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":"b6ef344f2eca690fedd3dc44632a41b99a6ac3dd4a71216a862e0c13f44339b7"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"ac4701fe3f3454f85c4841f90f49f74b6e3a66fd050565f48d7952db30ee6ed9"},"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":"e0e17bd8724a530ec70955015fd2aae8c0d096876ecdf0e513a790c2c9bc236f"},"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":"2f57e30a4e69c7f2b6bd716e1e5b74380d7e3b7e9730a8efa535bbc5bcbb6a66"},"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":"5d2094181c92f2ae19a56dd36aae037a47c7d7597b97a834dbcb02a0ddb0ad81"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"0c4528676a4be8ae1e4f2db4ec17f1456134081aec68e93bfee937d1321b9a4d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"cfeb923ed3b3d0a7a998f88bcd784e5f90539ab71ecb6ffea58716aa6f16e7c7"},"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":"5dc06f03733d25cdb2265174cdb1189dc2bd90ad6f61690a700b981571a68705"},"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":"fc0a74add94913b5867efc72fc0778dc2bef9c75afdc3796ec37eee44c5048f8"},"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":"04cc6ef8b2713c5ae671a21c5adfc62ed3d32eec231bd27236ea49e066082d50"},"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":"53041d0452eb7a0f6d7363cca46cccfc47fe77904a465fee573e39f7c59d9395"},"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":"8a7c60d84ec124dea0266da2cf23510056e10aadd6ac2dae11dd81d8528da72e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"c8381cdd9539330ccdf5f2819fb2f0ec8e0d20d645b1467a3e5e48700a37b69b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"953092d519214da1adfedd8f1f0cd1cdc2f07a91da810dc64136237b4fb3667d"},"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":"c2804692a2d33cc7fe8886a989b3c079ee90729a60fdd37561fe48cfd9d144b2"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"ebac61d292e4757946ff83f15293e2fa751db1ae0044345ec1ca160a7804b230"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"1a4d15f5c6108807a0296fe4147567e1932e97fad7e897dacb19849b03e0f1bf"},"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":"fe23e21be11fd9c3de7b0fa8a4222e5f966800501bf69109de090f8bfa54a411"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"17c766048720a8335fe9cee4b5c94d175d687786ce4fe5ac15a7d88cc7deda62"},"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":"f4e3417d64af10aa90d910629e488ca4a221e76e59de7a43696a14c8a72578bf"},"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":"baa151beff35ac46ee2536907cc918a207da07c42b004fec4c9aab8d58a6df6d"},"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":"cc4313e08c448232f318be35b7241d4b93cdb38b46607e6d9e1235238dd8f561"},"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":"dc5e2088b71196c0ce78a0fb26e1a46e4f899c4f8f754ee40ecf8ae4d551e3b5"},"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":"958d4abe0376dbd29ad22deac42da4dd1c7272133d26a369ed188ff72a75e6fb"},"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":"80601ef1163bb10c026e9e3e52eced6786bef1b6b2f370a319769433c3d836f1"},"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":"89122daa9eadbee0becf88df1842c3687c4e4ff108e4e21aa3f49bb2edfed292"},"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":"c042825cd039100ec2e325c5b7cc9aa4d77265842e78071dabe9e1da1307c3d1"},"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":"27caafaf56fda6b53f8eac51f3d304cc10e80b180ee1514289a98fae21e73a43"},"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":"e5f905f4a880a8ae5bea568eb4b16cf6a931399077c51aab3cac3c49bbaa8359"},"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":"58b8eafdd1a76ceb3f191235aef9de7f808102b9dbe4eca85247b06ec6b8ac9f"},"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":"ce4c50ed651a00d1a03d2a80cd9ccffdaa6fdf0081ec413ad840f0f6d26f7b48"},"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":"408aabba94a045839d4f0a0751733d94e1dab8a01dac3ee942be3f50a1677511"},"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":"338b2a73a7bd1226aebeb059c71414cb741ecf8ee9ace99d376d091aea1ddf5e"},"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":"7fff35323c2d89354577d51ad5cbd4588d3e3cadb25490f71f11e828feef4cce"},"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":"ca6499009cd67be96e857dcc182cda5f265da18ab13daedfae9f0fd4681a102b"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"5d3c31b8d3a0ef4a59f8b2188bc8189eee8bead7a5b36c00ad124babf3ed94ac"},"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":"b43cc717d0eab8337e7c5b1a34f900794e510bbf33a5ed19d31614abc4fff527"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"ded56d2f75a8bf9f4a67e0a9f3a795f66ad13689af649ddc4ba19107a05dd589"},"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":"1623e36daf7dd84a4a0a15d42ac541f3cd90eb37634dd5165328303f23854864"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"6467fec00b9cf88d10dfd4bca24ee72869b21863379e20e7e6e10fe51db5e8f6"},"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":"c7164997e9c8527135257c160ff67ca219cb3cd69da0320ab9ab962c94906b9b"},"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":"c0caa4820f99c32cfca9301d542920d3e4181812e80f0d60622d8bb48342bf69"},"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":"4af69397c1b96eb44faa8c72d4247495a33410e4f2fed5924a588674eb1814fd"},"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":"638b7fbb13226fed52ada2740de3eaa328f2b4f47b785feff49eba6fcf4535de"},"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":"0ebd78f54e9a5e864acb205ccc04013597ca6aea1f051708920de58295638fb3"},"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":"dfbdbb01c49961490d2920a2b1059870466350bd1e21e0757cf3931b5101afe6"},"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":"c9447f13c6c56d88fd3af76e0057c081f988b998d64ad775c2471c9c35fbd641"},"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":"bbd2932fbe6329607de611105ccc1bbc0a4823dbfae42d06659bdbf6263463b9"},"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":"f4c0e897a77f8794f198c12a1555937b0faaed564009610f77a8ea69a31791ee"},"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":"c7e1e1cf1754af63ac0b5c17fad949df612eb4c571dd1b313794ff0a89521291"},"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":"a31c0e9c4bc6f55e7411f971f03878995a4df163416e4cf3a3435b761a148f85"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"ab6e74fcb4fd0b8f21d3f26b6a85c477c5b95cc4f31a54a786f572fff75573df"},"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":"e3f9e06cff59f6b5a97dd3e863ccb80e05690f44e944d0e28f3e6f46e4c9d9a4"},"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":"3d45f70e15434206f8928b91d3c59cb85bc9c5089dc11e8b509616f76606718b"},"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":"de78867ddb65681e58c0027d2633238c3f9deb40bd923328bc2020bcf204ab54"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"556fc40800c8b426a7e48296a14a1608d106f1ccfc6346a4636ec4027046c9bf"},"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":"1a7aef0dca1c0564c25c2b9b8420674f58823e339363ddd46b38fdda79d6bd3c"},"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":"6d82da2588072e28be5aff0505664adf467bd62c713ee86ee71111b749805f12"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"a4142ae7535ddf5e50748788107c47264ba02c085db3182b0c4be51e491d337a"},"taxa":[{"id":"CWE-345","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":"4b09739c0814e9af7f50b4a33bb0e55c19f379d732e343b8f8a9d460c69bea42"},"taxa":[{"id":"CWE-345","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":"8b53aaf75c3b6ab764f2741671522a13fefb283cf8a8baf3196d385ed701e980"},"taxa":[{"id":"CWE-345","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":"97675f79ff75e686655a89c1ed5585462576b5deb574f0f346c90a6b7fc4eb76"},"taxa":[{"id":"CWE-345","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":"7073bbfcd7943414252f0e33a3c1e9f81db78d880467299f419c2cd55a25b2a3"},"taxa":[{"id":"CWE-345","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":"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":"7fc9436c1564f253d075602eaf8ca33eaf2eb6fd52a25ba34824454d6860a6e6"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3fe787532ed9044aabb370691dadba0e1001a907c4b0d3cf56d1769aa46e995e"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"47d4e33f1f41f1bb70dfe8e93f24dca40c4079810927e32cfd0374b0bfb4054b"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"eee6dfa6c47e8a6889935551e7db7d12f08f58a65cc8135cd129b7cf5fbba7cf"},"properties":{"dependency":{"package":"diff","version":"7.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"4e1a668f83cd27f9363280743b0b7689f1eb43d7d576b15ff9da7055b14e0d68"},"properties":{"dependency":{"package":"diff","version":"7.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D31","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":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D31","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":"5cfed0ee4e80785ce23c7083cffdead9acc6c64f9dce56a00ca7178bd3d7bee5"},"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":"D31","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":"d15df5171d54d9a3cfe919193b940b95eb1db599610449c8b68164e072da6651"},"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":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 4 of 395 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 395 of the 681 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/TraceTestUtil.kt, gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/artifacts/GenerateGraphMetadataTask.kt, gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/artifacts/MetroArtifactCopyTask.kt, metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/GraphPartitioner.kt. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metro-trace/src/main/kotlin/dev/zacsweers/metro/trace/internal/TraceTestUtil.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f2e43c7aab1d87f9cb070e0d39f9e7c9e3d974faeb5f9ebe4cb19ee9e599d7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/artifacts/GenerateGraphMetadataTask.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7ea6d122cc46526e8b4d2ffd6e1fad792a8e8e53d895f87263de1af8c7c85e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/kotlin/dev/zacsweers/metro/gradle/artifacts/MetroArtifactCopyTask.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"142d2bcc1055dbdea36bc6276ba5a8931b0206e867c8bb8fafc33d26cfe97fcc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/GraphPartitioner.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0221df8c4fc37b6ff6df0bf871dceba797cebd2771ce2993503fa2fdbe58494"}},{"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":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"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":"61d9c64c1de88e7edb9c757178d6ec3103868cef4ae7e825aeeac5d15e61fb7d"}},{"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":"6f303cc230ab2a45a04e3551b13dbb6bf2e87e8f11cc494fc2d1227fea68d920"},"taxa":[{"id":"CICD-SEC-6","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":"81d0799af757bba1afbed34637d383ea39ed22bd8ff8ec5b09c5aa413595d701"},"taxa":[{"id":"CICD-SEC-6","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":"23de80666e688f520d1bd0ae4e7fa7399cd514f7bc0b5c0be67e64809894a702"},"taxa":[{"id":"CICD-SEC-6","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":"51b0a564e85f0f1fd2b34d33099d8db8cc86f7dbb8ae65c991d187df743f3698"},"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":"a2c0d5ec50f0f153069ac107d76903aae64b42c4c63f21af898369264f36e6c7"},"taxa":[{"id":"CICD-SEC-5","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":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/resources/inspectionDescriptions/MetroContributeBinding.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab219cf2a6ba023b917bd49667360f398eb8d6f20d017f8c678ad5dd43740d65"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/resources/inspectionDescriptions/MetroContributeBinding.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f84e65d6ab210b75a0f5051181790260a939d54a4d3dc6493b2d46e452494e"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/resources/inspectionDescriptions/MetroContributeBinding.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b3b32c526a945e27477b33af016bae0d0b7443ebc6a60c7e37030194919acf"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/resources/inspectionDescriptions/MetroGraph.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"602037afc46b446afb42c0cdce67b7a1253e186b7f8f4afea1c981aa26282a36"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/resources/inspectionDescriptions/MetroGraph.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cdcd4feed79ec3057d4ee1af22242df555cabafa40f477797df74314b022cf"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/resources/inspectionDescriptions/MetroGraph.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce627d191b6cfe874391b0b2fa3ca8b2a6482319d993fec5f6eb13acd777db5"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/resources/inspectionDescriptions/MetroGraphWarning.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2c4731e4ff1fa02f8b4ebafd223012c6017dfa537abba02e3b37dd1eab3aef"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/resources/inspectionDescriptions/MetroGraphWarning.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4025f6664e0c1ec2a4951dc6006ad5b22b4c49499359749d46899e9a48ff7f39"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/resources/inspectionDescriptions/MetroGraphWarning.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20fea6f04b06c12dfb749ab688564ccbf94ddebdd77dd74d22192f96bb26902"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/resources/intentionDescriptions/MakeClassInjectableIntention/description.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25c8738521810fe2a05e0c25e5aad58d6c101dab73ccadba82a75ae8ddeaf27"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/resources/intentionDescriptions/MakeClassInjectableIntention/description.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3051009fc1b1886e2a535579a183c97bdc3fac7ff6a2ebf95dbc46650467545"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/resources/intentionDescriptions/MakeClassInjectableIntention/description.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"543d0181c821384bea3667e0f0d8fa1fa30ca5abc9ffc563ef570b393297644d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.search-box input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.css"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c08123288ec889ba885403319840bb3e7f02edab98dedfb1dc86deec396ae8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.search-box input:focus-visible\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle-plugin/src/main/resources/dev/zacsweers/metro/gradle/analysis/graph-viewer.css"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5642c4965d254f46d1f08c4bb957cd0516f1ab8174c91bdb79abc35b68884a66"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: CompatContext (33 abstract methods): \u0060CompatContext\u0060 declares 33 abstract methods: \u0060createTypeResolutionConfigurationCompat\u0060, \u0060createCompilerConfigurationCompat\u0060, \u0060createTopLevelFunction\u0060, \u0060createMemberFunction\u0060, \u0060copyWithOverrideCompat\u0060, \u0060fakeElement\u0060, \u0060defaultValueSourceCompat\u0060, \u0060isNamedFunction\u0060, \u0060buildMemberFunction\u0060, \u0060addBackingFieldCompat\u0060, \u0060getEffectiveSeverityCompat\u0060, \u0060createCompat\u0060, \u0060withSeverityCompat\u0060, \u0060reportAt\u0060, \u0060registerFirExtensionCompat\u0060, \u0060registerIrExtensionCompat\u0060, \u0060createIrGeneratedDeclarationsRegistrar\u0060, \u0060irAnnotationCompat\u0060, \u0060clearTopLevelPluginFileMarkerCompat\u0060, \u0060annotationsCompat\u0060, \u0060replaceAnnotationsCompat\u0060, \u0060finderForBuiltinsCompat\u0060, \u0060finderForSourceCompat\u0060, \u0060evaluateAsCompat\u0060, \u0060getDeprecationsProviderCompat\u0060, \u0060getBooleanArgumentCompat\u0060, \u0060getStringArgumentCompat\u0060, \u0060buildValueParameterCopyCompat\u0060, \u0060dumpKotlinLikeCompat\u0060, \u0060messageCollectorCompat\u0060, \u0060buildResolvedQualifierCompat\u0060, \u0060createEmptyExternalPackageFragmentCompat\u0060, \u0060getAnnotationArgumentCompat\u0060. Counted over its public functions with no body, once per name; default-bodied functions and properties 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":"compiler-compat/src/main/kotlin/dev/zacsweers/metro/compiler/compat/CompatContext.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"368120e232f56d5b4661c64a058ef001d2c350041a138579f9c69af68d84ff6a"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P12","level":"warning","message":{"text":"Test failure does not fail the CI gate: \u0060continue-on-error: true\u0060 lets the step or job that runs \u0060./metrow publish\u0060 fail without failing the pipeline \u2014 the suite can go red and the change still merges. Remove it from the test step, or quarantine the specific failing tests instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0a0330f5c496e9759c1d4eaa52ab1810fcdceb83de53f0d8fb36304ec33ab7"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 2/3 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add spotbugs with find-sec-bugs (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 12 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/benchmark-regression.yml"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!generateClassesInIr || (generateContributionHints \u0026\u0026 generateContributionHintsInFir)\u0060 appears character-identically in 2 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitFirExtension.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitSerializableFirExtension.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitFirExtension.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31fc8e1a54233ea370abd4f76520ea9cdf4e0de59312383177bee4e8f17db09"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!hasModifier(KtTokens.PRIVATE_KEYWORD) \u0026\u0026 !hasModifier(KtTokens.PROTECTED_KEYWORD)\u0060 appears character-identically in 2 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributionCandidate.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/injection/InjectionTargets.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributionCandidate.kt"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7877ecacbb05fd891cffff1ba042a35565ac4f04416e6687ecb87035981b726e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!options.enableCircuitCodegen || options.generateClassesInIr\u0060 appears character-identically in 2 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitContributionExtension.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitSerializableContributionExtension.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/circuit/CircuitContributionExtension.kt"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab02dcf9d63790d4492b97189056b61f720c9f1a4505a72915fd53ff0caac23b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060annotations.isBinds || annotations.isMultibinds || annotations.isBindsOptionalOf\u0060 appears character-identically in 3 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/BindingMirrorClassFirGenerator.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphNodes.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindsMirrorClassTransformer.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/generators/BindingMirrorClassFirGenerator.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a56865f326fb2e2f9ac9d887ac74251a4dd503bc319f74b5a8f3d3e82bcce5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060annotations.isProvides || annotations.isBinds\u0060 appears character-identically in 2 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/MultibindsChecker.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef764509a3ece940ca7472f5b228aab0f0605e58de48e519ba6ef27070dbb72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060annotations.isProvides || annotations.isBinds || annotations.isMultibinds || annotations.isBindsOptionalOf\u0060 appears character-identically in 2 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/checkers/BindingContainerCallableChecker.kt"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad25a6c69e442bfa3def8de9b481e016d5d485b2dbe44c26da70429e08664565"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060basePath != null \u0026\u0026 file.path.startsWith(\u0022$basePath/\u0022)\u0060 appears character-identically in 2 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/explanation/BindingExplanationSources.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroGraphDebugExporter.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/explanation/BindingExplanationSources.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a1f0896b5a93225ef9d28eb900343f8d263280faac9abb24c11fc1c34aafd5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060binding == null || binding is IrBinding.Absent\u0060 appears character-identically in 2 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyContext.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyContext.kt"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"359ca3a86cd14b43f7e1ba8025c945827623114c1d6d41d81ffe9059bd93daaf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060binding is IrBinding.ConstructorInjected \u0026\u0026 binding.isAssisted\u0060 appears character-identically in 4 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/GraphMetadataReporter.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrBindingGraph.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingPropertyCollector.kt"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"113cd03d19d098b4e3a5d0e17f7f338fe489c27036f9c8b4dd2ca26ee5008f43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060binding is IrBinding.GraphDependency \u0026\u0026 binding.canPassThrough(contextualTypeKey)\u0060 appears character-identically in 2 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/expressions/GraphExpressionGenerator.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/IrGraphGenerator.kt"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"049bca885ad19af59b0cb424faa980d911dcdf71a2b9590f3dd5730404ceefdf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060binding is KaBinding.AssistedFactory || binding is KaBinding.ConstructorInjected\u0060 appears character-identically in 3 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingGraph.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryIndexPostProcessor.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/SourceLibraryInputs.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingGraph.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf00611ef73dfc5accc06cf4ed2f70ba089e887d88de6706ce58f71d164c042"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060binding is KaBinding.AssistedFactory || binding is KaBinding.ConstructorInjected || binding is KaBinding.Provided \u0026\u0026 binding.isClassContribu\u2026\u0060 appears character-identically in 2 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryIndexPostProcessor.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/snapshot/SourceLibraryInputs.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryIndexPostProcessor.kt"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab5340d29a4795bdac809ada31bbfc47fed20e39acab8d5d7395fb6b63e0498"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060binding is KaBinding.ConstructorInjected \u0026\u0026 binding.isAssisted\u0060 appears character-identically in 2 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingGraph.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/BindingExplanation.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/graph/KaBindingGraph.kt"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"799d47bf84cb742f9ec36d00fbef2bfdc02fb75011616894a611796e00815f2e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate.existingMapKey || edit.boundType.hasMapKey\u0060 appears character-identically in 2 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributeBindingAction.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributionEdit.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributeBindingAction.kt"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1e61086136462ca3c93468180129b8c1e86ae8d8779158ec0f67efe37ab95b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060edit.kind == ContributionKind.MAP \u0026\u0026 !hasMapKey\u0060 appears character-identically in 2 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributeBindingAction.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributionEdit.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/intentions/contributions/ContributeBindingAction.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7b80103d0fe718b93d419163fc8b33414e540dbf63daf7cf112ca5212babd9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060element is MetroTreeNode.BindingRow || element is MetroTreeNode.StackEntry || element is MetroTreeNode.Summary\u0060 appears character-identically in 2 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroTreeStructure.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroValidationResultPanel.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/toolwindow/MetroTreeStructure.kt"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fa18771ba6d28337882e029a2dbbc7a99648f62d4f26441045ff6873e1758a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060failure is CancellationException || failure is ProcessCanceledException\u0060 appears character-identically in 2 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceWorkSummary.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/tracing/IdeTraceOperation.kt"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3a28412fd55ca4688ff5d880aced52052d74950bd42398f4993b1893c9b4a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file.extension == \u0022kt\u0022 || file.extension == \u0022kts\u0022\u0060 appears character-identically in 2 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/SourceFileArrivalListener.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/MetroResolutionService.kt"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"8911f5dbb947b0776a9f4c0c64696a60f5a60a2c7d9b73bade7ffadcfd9ca916"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060functionTypeParameters.isNotEmpty() \u0026\u0026 functionTypeArguments == null\u0060 appears character-identically in 2 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrBindsLikeCallable.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrProviderFactory.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrBindsLikeCallable.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed98e688b3e9704a828fa3bc2f7baec432343d546e97c7acc93030ffdbadefa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasContainerTypeParameters || hasFunctionTypeParameters\u0060 appears character-identically in 2 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindsMirrorClassTransformer.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/BindingContainerTransformer.kt"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"b576277db8012ea48cdb1f5b4f360ac42f74c1a9b423390bad90ecf38ef87602"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it is ExternalDependency \u0026\u0026 it.group == \u0022dev.drewhamilton.poko\u0022\u0060 appears character-identically in 2 files \u2014 compiler/build.gradle.kts, metro-common/build.gradle.kts. 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":"compiler/build.gradle.kts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbfc0fbcd002afb834186ace17526aa040edc4982147d1df39eaa6d66794dac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.isDirectory \u0026\u0026 it.name.startsWith(\u0022k\u0022) \u0026\u0026 File(it, \u0022version.txt\u0022).exists()\u0060 appears character-identically in 3 files \u2014 build.gradle.kts, compiler/build.gradle.kts, settings.gradle.kts. 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":"build.gradle.kts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5e815825c1476fe89518c75d80270d2fb0abf6ee735591fbbf837e10b3a745"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060providerFactory is ProviderFactory.Metro \u0026\u0026 providerFactory.isGeneric\u0060 appears character-identically in 2 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/transformers/DependencyGraphTransformer.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/graph/BindingGraphGenerator.kt"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d18d5768ed17f4b251c203d46aa1dbcff9d7ac94b2da2fb1b7447e0d10c7d4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060symbol.classKind == KaClassKind.OBJECT || symbol.classKind == KaClassKind.COMPANION_OBJECT\u0060 appears character-identically in 2 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/ClassBindingResolver.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/SourceClassBindingPostProcessor.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/ClassBindingResolver.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a879488c0b2a95da17bae3d5f011ecc3bdde2e8ed0363ccc412292705b6514"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060symbol.hasAnyAnnotation(injectIds) || symbol.backingFieldSymbol?.hasAnyAnnotation(injectIds) == true || symbol.setter?.hasAnyAnnotation(inje\u2026\u0060 appears character-identically in 2 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/BindingExtraction.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/FileShardBuilder.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/BindingExtraction.kt"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa9b79244241318bc5d23694b1adbb0eb4c1c134289e9a46637746aebd07bed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type == other.type \u0026\u0026 qualifier == other.qualifier\u0060 appears character-identically in 3 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/FirTypeKey.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrTypeKey.kt, metro-common/src/main/kotlin/dev/zacsweers/metro/compiler/graph/identity/TypeKeyIdentity.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/fir/FirTypeKey.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bb6b839ace60f0ddd6f173ed5aa0001defbd098c7765b6ffa1cb4d352d9794"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type is IrSimpleType \u0026\u0026 type.arguments.isNotEmpty()\u0060 appears character-identically in 2 files \u2014 compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrTypeKey.kt, compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/ir.kt. 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":"compiler/src/main/kotlin/dev/zacsweers/metro/compiler/ir/IrTypeKey.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e779f1aba211bf729861147ab97eac49925932499d747f8bb371819294949563"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060virtualFile != null \u0026\u0026 fileIndex.isInContent(virtualFile)\u0060 appears character-identically in 3 files \u2014 idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryContributionScanner.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryGraphDiscovery.kt, idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryIndexPostProcessor.kt. 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":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/index/LibraryContributionScanner.kt"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"70afeffe296c28a70cb5f24713b04eecb56f60a7d85866f15a5a05af3d18f2b5"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/1 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: readAsset: \u0060readAsset\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graph-viewer/src/host/host.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"735318336d61c9e2b2bfd7a3897a59b2a4fc015b1ed67e1c17c694f09c52bdd4"}},{"ruleId":"X27","level":"warning","message":{"text":"Collection is structurally changed while it is being enumerated: \u0060dependencies\u0060 is walked by the loop on line 380, and line 381 calls \u0060dependencies \u002B=\u0060 on \u0060dependencies\u0060 inside the loop body \u2014 a structural change to a \u0060ArrayList\u0060. The loop\u0027s hidden iterator is fail-fast, so its next \u0060next()\u0060 throws \u0060ConcurrentModificationException\u0060: every pass that reaches this call ends the loop by exception instead of by running out of elements, and the remaining elements are never seen."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"idea-plugin/src/main/kotlin/dev/zacsweers/metro/idea/model/DerivedBindings.kt"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afb0be80e3f161f6ae702e35de01ff7afadf71716f9ea92ecb6e02233203af3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except 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":"compiler-compat/fetch-all-ide-kotlin-versions.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2bc5fc3370c1246505c263abec8c6cb5b7010bdc38fa24cc7dedc207445103"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except 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":"compiler-compat/fetch-all-ide-kotlin-versions.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d0fd2150fb6c3f121367c4445f4127eee0e34639e7f9750b191d70c918da4a"}},{"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":"compiler-compat/src/main/kotlin/dev/zacsweers/metro/compiler/compat/CompatContext.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"af15affaadc2690b825169a61997c5707d51870c5591d67a71e14f07908a3dbc"}},{"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":"build-logic/src/main/kotlin/GitCommitValueSource.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dad5b9ae0f346f58de43e7948942969aa4f2789b67a81ec2f98016b9d90252d"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.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-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"Insufficient Verification of Data Authenticity","shortDescription":{"text":"Insufficient Verification of Data Authenticity"},"helpUri":"https://cwe.mitre.org/data/definitions/345.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-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.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-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.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":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"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":"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-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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"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":117,"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."]}]}