{"$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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","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-1059"],"owasp":"A02: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":"AX1","name":"Captive dependencies","shortDescription":{"text":"Captive dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/AX1"},{"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":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"NetlistSynthesizer.synthesize (cyclomatic 159): NetlistSynthesizer.synthesize has cyclomatic complexity 159 (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":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ece9f6b25ba0fe111cc0edb9ba82dd70fb7338c969d7e8468017dde89bf60f"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats (cyclomatic 80): SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats has cyclomatic complexity 80 (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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316a8ca3874ffddd63619cc605e79f64f70bd981f671c4b48cefad85ff7dedb"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceTracer.traceJsonForHierarchy (cyclomatic 71): SourceTracer.traceJsonForHierarchy has cyclomatic complexity 71 (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":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c01ef40efe5ab85bdecb818ec9084da57d0b6267aefb9980328ee2bf699f9a"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistCellMapper._registerDefaults (cyclomatic 59): NetlistCellMapper._registerDefaults has cyclomatic complexity 59 (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":"lib/src/synthesizers/netlist/netlist_cell_mapper.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"97283ca285fc051a68fbb13daa8827bfab149682bc99e0d32b1856c9cbbeedc5"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistModuleTranslation.processNetnames (cyclomatic 57): NetlistModuleTranslation.processNetnames has cyclomatic complexity 57 (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":"lib/src/synthesizers/netlist/netlist_module_translation.dart"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c7e4c9258fe04770ab079e02f27a013a315a79b0c49388e10112af8ce22802"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemCSynthesisResult._buildProcesses (cyclomatic 56): SystemCSynthesisResult._buildProcesses has cyclomatic complexity 56 (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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2d78c5ceb4264238aae24d98bff6f81963eb7bd112c79b98192c16b87224c9"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition.SynthModuleDefinition (cyclomatic 56): SynthModuleDefinition.SynthModuleDefinition has cyclomatic complexity 56 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"116e8ebfbfc7a59309b8dd12eefa4c2534ae9f67728b4874e17c1523dc0f3972"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._pruneUnused (cyclomatic 55): SynthModuleDefinition._pruneUnused has cyclomatic complexity 55 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fe90446da52d8c0177789e1a99ad8aa9c04ae7df14d0a9afb757dd6f6762ed"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicValue.of (cyclomatic 52): LogicValue.of 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":"lib/src/values/logic_value.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd34b9d4f0fa2fd77a434ad4864ed9a20f42c3279d9c2dab692b38885e6d0e24"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistPasses.applyTransparentClustering (cyclomatic 50): NetlistPasses.applyTransparentClustering has cyclomatic complexity 50 (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":"lib/src/synthesizers/netlist/netlist_passes.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f7de3d17a62a80eb005f44f649da3a05079bfb325ffd35aa6463f765ddf8ef"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemVerilogSynthModuleDefinition._inlinePackedRangesIntoSubmoduleInputs (cyclomatic 50): SystemVerilogSynthModuleDefinition._inlinePackedRangesIntoSubmoduleInputs has cyclomatic complexity 50 (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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0748ef3d00170d5d50d8d41f897531dd18a9fcfce70576a51d42feaf128876b4"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemVerilogSynthModuleDefinition._collapseAggregateConnections (cyclomatic 50): SystemVerilogSynthModuleDefinition._collapseAggregateConnections has cyclomatic complexity 50 (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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"648176f16c7dd4f3551682f475eeb12acbf03cdc792e866c40f52820d12f1c65"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistEvaluator.collectLeaves (cyclomatic 41): NetlistEvaluator.collectLeaves 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":"rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"739e150ece033315c1d911a44616c037042a9ecb427b9c57695eed4c31c55a1f"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemCSynthesisResult._gateExpression (cyclomatic 41): SystemCSynthesisResult._gateExpression 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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"67883e66bcd708b05ded69a32fedd213be4fd86a223d8c83a78e15f0329218bb"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemVerilogSynthesisResult._buildSvLineMap (cyclomatic 40): SystemVerilogSynthesisResult._buildSvLineMap has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"411fabc438e61726583c286d9a54d697f82cd09551c14a6ea37173223c3e556b"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._planConcatRangeRewrite (cyclomatic 40): SynthModuleDefinition._planConcatRangeRewrite has cyclomatic complexity 40 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":3800}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a580c0625bcbb570cee1bab2ec5beefcd4380d7c8a1d066fe78172d9599ac3"}},{"ruleId":"D1","level":"warning","message":{"text":"_StandaloneDevToolsPageState._loadModuleTree (cyclomatic 39): _StandaloneDevToolsPageState._loadModuleTree 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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3d12010032a91a98cbf9bcde56bf21bdf829a6a41df518d20ec5d27858ce51"}},{"ruleId":"D1","level":"warning","message":{"text":"FlcData.fromJson (cyclomatic 38): FlcData.fromJson 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":"packages/rohd_source_navigator/lib/flc_data.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b081b7ef619f187eeb8a8f38e3a8be87d6985d687e454d71cebd10b3662f6b64"}},{"ruleId":"D1","level":"warning","message":{"text":"Module._traceInputForModuleContents (cyclomatic 38): Module._traceInputForModuleContents has cyclomatic complexity 38 (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":"lib/src/module.dart"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dd89b37e514cf63b1e00d792b4e4c564c07a08b6133875ddc473ed71b930b3"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemVerilogSynthModuleDefinition._forwardPassthroughElementsIntoInlineables (cyclomatic 38): SystemVerilogSynthModuleDefinition._forwardPassthroughElementsIntoInlineables 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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"85819b5080cab4fff61312906c4e7e5020d9ffb0df480a222f4b4015fefe847d"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._findChainableModulesToCollapse (cyclomatic 38): SynthModuleDefinition._findChainableModulesToCollapse has cyclomatic complexity 38 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"81118a4abd7196dd1d28d26574682d0110463fcf5dc86dd3a2cdbef4c2e414c9"}},{"ruleId":"D1","level":"warning","message":{"text":"_SystemCSimCompare.buildSystemCVectorExecutable (cyclomatic 38): _SystemCSimCompare.buildSystemCVectorExecutable 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":"lib/src/utilities/systemc_simcompare.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"78be0bad2172b3d461e567eed0383886afedf06cb9852d3e80b694d900a6c576"}},{"ruleId":"D1","level":"warning","message":{"text":"conditional_completions.detectContext (cyclomatic 38): conditional_completions.detectContext 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":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc676e804118b6535127e40d7e70c08c95ccdeed39b44be728357ca733d15b59"}},{"ruleId":"D1","level":"warning","message":{"text":"conditional_completions.findEnclosingClassInfo (cyclomatic 38): conditional_completions.findEnclosingClassInfo has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 belong 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":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61d3e5875c5fa32714d71b1b5cbe8db2adf2e4cdd8e5ab0ae11dbc8b471219d"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseSignalWaveformApi.getWaveformData (cyclomatic 36): BaseSignalWaveformApi.getWaveformData has cyclomatic complexity 36 (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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1381b6751fad3dd55dfa2f97cf844218ead9aade899da17e79f724d3cdd9b0"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemVerilogSynthModuleDefinition._collapseWholeNetBuses (cyclomatic 36): SystemVerilogSynthModuleDefinition._collapseWholeNetBuses has cyclomatic complexity 36 (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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35ba2c658ff78c0720c40a234ee0aec987f76a068acf74e86bc71ae16599b65"}},{"ruleId":"D1","level":"warning","message":{"text":"Module._traceOutputForModuleContents (cyclomatic 35): Module._traceOutputForModuleContents has cyclomatic complexity 35 (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":"lib/src/module.dart"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"f996c0f185ac0f4bfca397397b68e9a51b087869a5fac70331fab01704d3a864"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._collapseConstantBackedRangeIntermediates (cyclomatic 35): SynthModuleDefinition._collapseConstantBackedRangeIntermediates has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":3295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a2631070e5e35648d43d7cfcaac806d7f08f79a695d90d1c1f996eff855260"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicValue.ofRadixString (cyclomatic 35): LogicValue.ofRadixString has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/values/logic_value.dart"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9349df93be7d67f11f87220e3b100cf15ee27fef8cabe53a0594f1846998928"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._collapseSimpleRangeAssignments (cyclomatic 31): SynthModuleDefinition._collapseSimpleRangeAssignments has cyclomatic complexity 31 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac53a37971a8c5f974116548d3a789fb0987ba453fd8bdc02b73a07eb3167c2"}},{"ruleId":"D1","level":"warning","message":{"text":"_CopyableCell._showCopyMenu (cyclomatic 30): _CopyableCell._showCopyMenu 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":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"7639ccfb173a9f845b4b90d4f46e16dbec79bc7bfc7c7f756bc787f533f5a2d1"}},{"ruleId":"D1","level":"warning","message":{"text":"_StandaloneAppBarState.build (cyclomatic 30): _StandaloneAppBarState.build 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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":2993}}}],"partialFingerprints":{"codehealthFindingId/v1":"44338bb9ba6c25ac1d9ff64d4e374a16ff7f301a135bf4a154cd37b46a5574e6"}},{"ruleId":"D1","level":"warning","message":{"text":"FstBlockReader._decodeSignalChanges (cyclomatic 30): FstBlockReader._decodeSignalChanges 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":"lib/src/fst/fst_block_reader.dart"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ec380f1d276fd08b15d2c4ccf8ad46fa2bbca8fcdc4bac0e4b44973b3c5c7c"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistPasses.removeTrivialConcatAliases (cyclomatic 30): NetlistPasses.removeTrivialConcatAliases 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":"lib/src/synthesizers/netlist/netlist_passes.dart"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbdec3b160d194c15f81d3bea6a92347a4463996fbe7a76ad30f410f0a64a9f"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._pruneClearedSubsetConstantSources (cyclomatic 30): SynthModuleDefinition._pruneClearedSubsetConstantSources has cyclomatic complexity 30 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":3411}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8eabd02799bbb74cfc32f4a7689d60a64daf4672b3e03d25ae4689d1c1a6be"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._collapseWideArrayElementRangeSources (cyclomatic 29): SynthModuleDefinition._collapseWideArrayElementRangeSources 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e18b5a1754096aabf71cfe2bf7334163088273e18dc56a06012371006f1d782"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._collectOutputDrivingConcats (cyclomatic 29): SynthModuleDefinition._collectOutputDrivingConcats has cyclomatic complexity 29 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":3711}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c897bb1aa1adb5c6d371b341e34c79e0d9554d64286eb91f66965b114e2acb0"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistConstExtractor.extract (cyclomatic 28): NetlistConstExtractor.extract has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/netlist_const_extractor.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c2c6a3668c2cb23e1d49e13901132ef0ee08796aa4cefd8996d07993ca3a01"}},{"ruleId":"D1","level":"warning","message":{"text":"_VmConnectionFormState.build (cyclomatic 28): _VmConnectionFormState.build has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbdc2d39429171a941a073be0c30569cd7a380f534fe8354f0e4632294ec70c"}},{"ruleId":"D1","level":"warning","message":{"text":"_SystemVerilogSimCompare.iverilogVector (cyclomatic 27): _SystemVerilogSimCompare.iverilogVector 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":"lib/src/utilities/systemverilog_simcompare.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6fd6b505b57ffacfae7508672e7aa13a13b70e9e5a24e67e89bc426b580236"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistModuleTranslation.processCells (cyclomatic 26): NetlistModuleTranslation.processCells 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":"lib/src/synthesizers/netlist/netlist_module_translation.dart"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"359915159ba306049f1217fd3a97fe2ff6e4ec32999cf5cde5dc4add8cd29987"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemVerilogSynthesisResult._verilogAssignments (cyclomatic 26): SystemVerilogSynthesisResult._verilogAssignments 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":"lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4efac970ced2bc62bebc9721eb12537448d8a8ce51b3aedff320bdc0145bf4a"}},{"ruleId":"D1","level":"warning","message":{"text":"SimCompare.checkVerilatorVector (cyclomatic 26): SimCompare.checkVerilatorVector 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":"lib/src/utilities/simcompare.dart"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fd77cf8ad77d1ec2f6dc127eb04da8cbe05b02ec3bb60917f6c3fc40110d3e"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicValue.toRadixString (cyclomatic 26): LogicValue.toRadixString 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":"lib/src/values/logic_value.dart"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e54b4462dc222b4fe04ca415768235cb45df2dba8ef69902438da23f9f88ba4"}},{"ruleId":"D1","level":"warning","message":{"text":"elk_layout_only.elkLayoutOnly (cyclomatic 26): elk_layout_only.elkLayoutOnly has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 12 of the 26 points are its own statements and the rest belongs to 2 function items inside it that branch (saveHidden, restoreHidden). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e23ca03b073a8e2007127c891d1b35013eada2dccbc169c795e6c7b409040b8"}},{"ruleId":"D1","level":"warning","message":{"text":"flc_service.queryModule (cyclomatic 26): flc_service.queryModule has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function item 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":"rohd_extension/src/flc_service.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cfa7a416502ca26436e828de5b8b0a13cd2564f2de67819edf83e30aa4d5b3"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistPasses.collapseConcatOfAdjacentSlices (cyclomatic 25): NetlistPasses.collapseConcatOfAdjacentSlices 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":"lib/src/synthesizers/netlist/netlist_passes.dart"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"31425997b6d1647987cd3e8322855df63f83d78e57e869e9b9ebf506c71dd8fe"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._collectOutputSplit (cyclomatic 25): SynthModuleDefinition._collectOutputSplit has cyclomatic complexity 25 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"405af3617ac9d892db223df94523d1d1d7b1a661c457c589b2022a5d84a3e8ec"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._collapseAssignments (cyclomatic 25): SynthModuleDefinition._collapseAssignments 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":4364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d830086b93fe6d72629c2bbc6bdf324b6680ed0d66480ae83d0109d52e22686f"}},{"ruleId":"D1","level":"warning","message":{"text":"RohdShellOutput._formatResult (cyclomatic 24): RohdShellOutput._formatResult 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":"rohd_devtools_extension/lib/rohd_devtools/cli/rohd_shell_output.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2199a02368f753e40f870d846b1964fceddb9ea1ba15b0b65c5634de513115b6"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceTracer.traceAttributesForModule (cyclomatic 24): SourceTracer.traceAttributesForModule 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":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2bb17b34ec45cca0ecae1c9e5d0019c34c1e5cd701b7929fcd497fe33bc1c4"}},{"ruleId":"D1","level":"warning","message":{"text":"_FilledLogicValue._equals (cyclomatic 24): _FilledLogicValue._equals 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":"lib/src/values/filled_logic_value.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fbb467253d2a85590af377d8c30baa72500a1c75eab71b849203a626dc44ff"}},{"ruleId":"D1","level":"warning","message":{"text":"_CrossProbeStatusButtonState._showFormatsMenu (cyclomatic 23): _CrossProbeStatusButtonState._showFormatsMenu 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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":3387}}}],"partialFingerprints":{"codehealthFindingId/v1":"04158f82378a2ebf8fc8d4b963589dd40986381c9748149a3861586cc174519c"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistUtils.collapseAlwaysBlockPorts (cyclomatic 23): NetlistUtils.collapseAlwaysBlockPorts 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":"lib/src/synthesizers/netlist/netlist_utils.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fcff83a8411ec1041eb3ee9cea08e957a4bbc8eb7905d774c4f243d050f112"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemCSynthesisResult._buildScLineMap (cyclomatic 23): SystemCSynthesisResult._buildScLineMap 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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70650638a617d4b37d351eb5b4bb8b8922cfc88e773e4a9a3439f3fa7f13f19"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._isValidOutputSplit (cyclomatic 23): SynthModuleDefinition._isValidOutputSplit has cyclomatic complexity 23 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce22b915876635675266e69a2510af1f1dd1431a1da05d7ec36dbc795157b7af"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._composeChainedRangeAssignment (cyclomatic 23): SynthModuleDefinition._composeChainedRangeAssignment 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":3189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4525efaac88f52d7c4866619f85456ebd774f5668bcc671e170551aa6a7f457a"}},{"ruleId":"D1","level":"warning","message":{"text":"buildModuleInfo (cyclomatic 23): buildModuleInfo has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to 2 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":"packages/rohd_devtools_widgets/assets/extension/module_info_helper.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5555c587ebd1b778af44ee208ba69bbb8e89403ff6a7e8a8ee394f44d94260a"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseSignalWaveformApi._synthesizeClientSide (cyclomatic 22): BaseSignalWaveformApi._synthesizeClientSide 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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d662bb8acafc929b2da7d161e213f37985df7cfd2096cb2c26256517964a67e"}},{"ruleId":"D1","level":"warning","message":{"text":"_StandaloneDevToolsPageState._buildSignalValueLookup (cyclomatic 22): _StandaloneDevToolsPageState._buildSignalValueLookup 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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":2662}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c845617fc1dbac9eb1bb83536b2ab40f2a14ddbbde2dcbdef2463298388821"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemVerilogSynthesizer.instantiationVerilogFor (cyclomatic 22): SystemVerilogSynthesizer.instantiationVerilogFor 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":"lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6602b65ae192f515dd6c4c3afa93014b11ea9024a1cc6431c0c20afc2e3e6e5"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition.getSynthLogic (cyclomatic 22): SynthModuleDefinition.getSynthLogic 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"caffc493532699a3c92e0ebabbfd0138f5bf8739fde3b69889d916ad92cdd728"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicValue._doMath (cyclomatic 22): LogicValue._doMath 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":"lib/src/values/logic_value.dart"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dfec84bedc958a87f2e65c6d93d09f37307c207b00f896058d5db0fce3d42e"}},{"ruleId":"D1","level":"warning","message":{"text":"SignalValueFormatRegistry._waveformValue (cyclomatic 22): SignalValueFormatRegistry._waveformValue 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":"packages/rohd_devtools_widgets/lib/src/signal_value_format_registry.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ac92ec605a28ed82e6d7393a1d77ffc48b139017c5fd7106f59e903a1cce5e"}},{"ruleId":"D1","level":"warning","message":{"text":"buildModuleInfo (cyclomatic 22): buildModuleInfo has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to 2 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":"rohd_devtools_extension/shared/module_info_helper.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2735200855a3febbfb4ffa309f0c89fc68b19f931cd2aa4cf71f2bfcc76897e"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseSignalWaveformApi._evaluateComputedInSnapshot (cyclomatic 21): BaseSignalWaveformApi._evaluateComputedInSnapshot 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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b8433c64818f62ac95780bfcf928bdd2a1b96d15d322a8661cc454e61d81fe"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseSignalWaveformApi.ensureFullModules (cyclomatic 21): BaseSignalWaveformApi.ensureFullModules 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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3274acf01b53c2b54137865ff1d81dd701c2031cfe34c1879fac1d842e40b2a"}},{"ruleId":"D1","level":"warning","message":{"text":"VmServiceWaveformDataSource._evaluate (cyclomatic 21): VmServiceWaveformDataSource._evaluate 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d194ffae86779494cae4d46e3ac92088ad212a557bd026ae88640d83119b2ae"}},{"ruleId":"D1","level":"warning","message":{"text":"RohdDesignCommandShell.complete (cyclomatic 21): RohdDesignCommandShell.complete 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":"lib/src/diagnostics/design_command_shell.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5950c19d216727cf4b09ed5dba4dab48bdc91ac4ee9496759f7d61f66e17ce92"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistService._buildSlimJson (cyclomatic 21): NetlistService._buildSlimJson 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":"lib/src/synthesizers/netlist/netlist_service.dart"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b255c2a7c0d4f5343cef8f2af560787399edc4afc013b6e4fbed0090554fc56"}},{"ruleId":"D1","level":"warning","message":{"text":"Namer.signalNameOfBest (cyclomatic 21): Namer.signalNameOfBest 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":"lib/src/utilities/namer.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e0cc9e33f4331d9e412e5792811b0ab63607f5f8c9446bc7e3346f11316839"}},{"ruleId":"D1","level":"warning","message":{"text":"SimCompare.checkVectors (cyclomatic 21): SimCompare.checkVectors 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":"lib/src/utilities/simcompare.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"410b91defa1a82e0047401743a3a6f7c3c3ff417e4451b74c79a74d41ee54a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"_SystemCSimCompare._runSystemCVectors (cyclomatic 21): _SystemCSimCompare._runSystemCVectors 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":"lib/src/utilities/systemc_simcompare.dart"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"81214a1dff5939ae98414089633b75e15b45d6d0d3353cedc4188adff54f0a55"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicValue._doCompare (cyclomatic 21): LogicValue._doCompare 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":"lib/src/values/logic_value.dart"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcc505d11b6e48f8ea2b7a9965f136ce9603f1da9b23bb15a50bba44c26f1bb"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseSignalWaveformApi._resolveFieldBits (cyclomatic 20): BaseSignalWaveformApi._resolveFieldBits 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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a05ce381be8a7fc92b1ccf21752b58e8b56d7b69ae7a6a5a7c5536f7d328c06"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeStructurePageState.build (cyclomatic 20): TreeStructurePageState.build 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":"rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"818521565064609dad04380155b4a2290998cb59ae5ea13142466fc99891b9c6"}},{"ruleId":"D1","level":"warning","message":{"text":"_TypedLogicArrayBuild.build (cyclomatic 20): _TypedLogicArrayBuild.build 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":"lib/src/signals/typed_logic_array.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c03b3c61d4f373b2bd1aab29e62606e7e844dff3f0ba5170dc58df1c0dedd31"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistModuleTranslation._emitDynamicSynchronousResetFlipFlop (cyclomatic 20): NetlistModuleTranslation._emitDynamicSynchronousResetFlipFlop has cyclomatic complexity 20 (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":"lib/src/synthesizers/netlist/netlist_module_translation.dart"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed903671f9463ac5ba9f2f57c15ab93c299fba9b476ebea2438b802469a01bd"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._fullPackedConcatSourceRanges (cyclomatic 20): SynthModuleDefinition._fullPackedConcatSourceRanges 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b754c2b5c450d58dab8d6d51ff12bfe7a632ad321626dfaa29c1a5c8ae49d4"}},{"ruleId":"D1","level":"warning","message":{"text":"HierarchyService.autocompletePortPaths (cyclomatic 20): HierarchyService.autocompletePortPaths 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":"packages/rohd_hierarchy/lib/src/hierarchy_service.dart"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a2eb1a7e12f3be7c16a015ff9ebe09fba08e2338561fd40b928e470433b159"}},{"ruleId":"D1","level":"warning","message":{"text":"WaveformService._ (cyclomatic 19): WaveformService._ 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":"lib/src/diagnostics/waveform_service.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"befea7bf528231d81bb8a5911082fe1d38c31c0e2dfcc12391cf85517b2b5035"}},{"ruleId":"D1","level":"warning","message":{"text":"Case.execute (cyclomatic 19): Case.execute 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":"lib/src/modules/conditionals/case.dart"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad87ced1a5c56227d8d87030ab50503a056206f3b5562601136dc908963b396"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._pickNames (cyclomatic 19): SynthModuleDefinition._pickNames 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c486cf004f65ebeff4e1c692e794f5da32c6150296f1874f722f57985b6be79e"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicValue.compareTo (cyclomatic 19): LogicValue.compareTo 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":"lib/src/values/logic_value.dart"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"7082af7faabfb60f56d7496ea5baae345e1fd2f87c059e301c146f0a2df1fc64"}},{"ruleId":"D1","level":"warning","message":{"text":"SignalWaveformRepository._synthesizeBitSlice (cyclomatic 19): SignalWaveformRepository._synthesizeBitSlice 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":"packages/rohd_waveform/lib/src/waveform_repository.dart"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d96fae0f332119f1c1fbcc7acd38ab607b446ccfa78e203693510d3d6babb7b"}},{"ruleId":"D1","level":"warning","message":{"text":"SignalWaveformRepository._resolveFieldBits (cyclomatic 19): SignalWaveformRepository._resolveFieldBits 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":"packages/rohd_waveform/lib/src/waveform_repository.dart"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b31bc623b4503193cab535358f6493f419683b7573af5d7c66a60fc5abc3e6d"}},{"ruleId":"D1","level":"warning","message":{"text":"DevToolsConnectionHostState.handleDtdVmEvent (cyclomatic 18): DevToolsConnectionHostState.handleDtdVmEvent 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":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4a98d44e433504addb61b0b477b447273ff73af9ab782532df32590a62b56d"}},{"ruleId":"D1","level":"warning","message":{"text":"_SignalTableState._generateSignalRow (cyclomatic 18): _SignalTableState._generateSignalRow 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":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cb841b08ef7b1dce9297c8eab60b69a94308f696be247245a1bca2a2147b35"}},{"ruleId":"D1","level":"warning","message":{"text":"_StandaloneDevToolsPageState._evaluateForDetailsPane (cyclomatic 18): _StandaloneDevToolsPageState._evaluateForDetailsPane 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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"608b527a40af9e7b84f45bb340d2be8f75bcd4e11fa4c29ee8b7ee1dafd53267"}},{"ruleId":"D1","level":"warning","message":{"text":"Module.addTypedInput (cyclomatic 18): Module.addTypedInput has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/module.dart"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dceceef100da9dacf3344d32bb2bf682d505ffd2bd81fa74a5b7fe4a6532b74"}},{"ruleId":"D1","level":"warning","message":{"text":"_TypedLogicArrayBuild._sameElementLayout (cyclomatic 18): _TypedLogicArrayBuild._sameElementLayout has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/signals/typed_logic_array.dart"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"2beb9628b8a0496082302d5fb632a77a41fca64fd4105d324c2f02455ecb964f"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistPasses.removeUnconsumedTransparentCells (cyclomatic 18): NetlistPasses.removeUnconsumedTransparentCells 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":"lib/src/synthesizers/netlist/netlist_passes.dart"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"165675b7d6b22b32ce033be7e07f3e4b4030817868ab6a1c01059b67c00cf8fa"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthLogic.tryMerge (cyclomatic 18): SynthLogic.tryMerge 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":"lib/src/synthesizers/utilities/synth_logic.dart"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"8418ac026770c094b7252c7ba9ddcb7c9f52cce5237a9edcbbf318f091af875f"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthStructureLayout.fieldNameAt (cyclomatic 18): SynthStructureLayout.fieldNameAt 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":"lib/src/synthesizers/utilities/synth_structure_layout.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db20086c5a68b21eb3a5038ef52cb9f62e585809e3af894c2a450d29b7b6f18"}},{"ruleId":"D1","level":"warning","message":{"text":"HierarchyService.autocompletePaths (cyclomatic 18): HierarchyService.autocompletePaths 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":"packages/rohd_hierarchy/lib/src/hierarchy_service.dart"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"044f4668111e4abe26e7d6306c58164da7f69f789b8e4309a3eb9adce1d993ab"}},{"ruleId":"D1","level":"warning","message":{"text":"FlcData._parseSymbolString (cyclomatic 17): FlcData._parseSymbolString 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":"packages/rohd_source_navigator/lib/flc_data.dart"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb6d3a2557c6e331a640a153d2c58b4a41167c0786c4351b089802baca13b60"}},{"ruleId":"D1","level":"warning","message":{"text":"VmServiceTransport.getModuleTree (cyclomatic 17): VmServiceTransport.getModuleTree 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"820ae6ba1fcf833cb6ab25d7422e80da0adf0fa60ef92d6a8906b47e9f2af292"}},{"ruleId":"D1","level":"warning","message":{"text":"_StandaloneDevToolsPageState._tryRefreshDataSource (cyclomatic 17): _StandaloneDevToolsPageState._tryRefreshDataSource 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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a77494e0258f88f1a1ddc803f3c66d974400567733d89b4952668ecf8f81684"}},{"ruleId":"D1","level":"warning","message":{"text":"FlipFlop.scalar (cyclomatic 17): FlipFlop.scalar 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":"lib/src/modules/conditionals/flop.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ffe0cfe5cd1c3431970be53a0afc7f936893521d44c13821ceb4bf3a3f4479"}},{"ruleId":"D1","level":"warning","message":{"text":"Simulator.run (cyclomatic 17): Simulator.run has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/simulator.dart"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b90ce483e2944615e551d456321a7200c6ed5f6d88a1e6e716f14367328a7c"}},{"ruleId":"D1","level":"warning","message":{"text":"SynthModuleDefinition._assignmentConnectedSubmoduleMappingSignals (cyclomatic 17): SynthModuleDefinition._assignmentConnectedSubmoduleMappingSignals 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace5f362b517cfd21b408e398064f92e0b5cba549f9aa86d619d02deded7230a"}},{"ruleId":"D1","level":"warning","message":{"text":"BitFieldUtils.parseBitFieldDefs (cyclomatic 17): BitFieldUtils.parseBitFieldDefs 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":"packages/rohd_devtools_widgets/lib/src/bit_field_utils.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bfcf9377bc2bb84f715b9f6d8d16889951d6df2050546ab9a8f646d6526155"}},{"ruleId":"D1","level":"warning","message":{"text":"_HelpContent._parseDetails (cyclomatic 17): _HelpContent._parseDetails 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":"packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe145cf83404013187f878ff20c7764b0cb77472eedec10ff523f339395c93df"}},{"ruleId":"D1","level":"warning","message":{"text":"FlcData._parseEmbeddedModule (cyclomatic 16): FlcData._parseEmbeddedModule 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":"packages/rohd_source_navigator/lib/flc_data.dart"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"df35e808c144c0834f311a1d651b35712a0e01b94cb03854cc8e3fd670900605"}},{"ruleId":"D1","level":"warning","message":{"text":"VmServiceTreeDataSource.evalModuleTree (cyclomatic 16): VmServiceTreeDataSource.evalModuleTree 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2376e43adb316fe6c0a54c2ea9fe59417c2a2a612b5c8b95559f192069c6308c"}},{"ruleId":"D1","level":"warning","message":{"text":"DevToolsConnectionHostState._checkVmLiveness (cyclomatic 16): DevToolsConnectionHostState._checkVmLiveness 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":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c198059a3bb53d0412b21bea79bce0348c16b3d181aae93a8c98727ee1df6465"}},{"ruleId":"D1","level":"warning","message":{"text":"DevToolsConnectionHostState.attemptAutoReconnect (cyclomatic 16): DevToolsConnectionHostState.attemptAutoReconnect 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":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a739b2872219c4010400c2d5e0af65e2c42cdd2c8849cc0ca7e672a7cdcd31"}},{"ruleId":"D1","level":"warning","message":{"text":"FstBlockReader._readBlockImpl (cyclomatic 16): FstBlockReader._readBlockImpl 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":"lib/src/fst/fst_block_reader.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d920448305c21b766552fa4d1f2d46e1e433070cd95f0b75b5be4c74ce4d8fb5"}},{"ruleId":"D1","level":"warning","message":{"text":"NetlistValidation._driversByBit (cyclomatic 16): NetlistValidation._driversByBit 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":"lib/src/synthesizers/netlist/netlist_validation.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2de573598a63d5a87cac09c9d479d65606c5452d2f21874cc26d480b8b1832"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemCSynthesisResult._buildInlineGates (cyclomatic 16): SystemCSynthesisResult._buildInlineGates 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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6b1d170776af00d9affbe4944179fea2b7ae569d7a084ab4e1f7bfbe57def7"}},{"ruleId":"D1","level":"warning","message":{"text":"_SynthLogicSourcePicker._chooseSource (cyclomatic 16): _SynthLogicSourcePicker._chooseSource 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":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c4ca4a2b1ca264d26b925a550702191909df4e51f76036a473d4a863573682"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistSynthesizer.synthesize (cognitive 425): NetlistSynthesizer.synthesize has cognitive complexity 425 (threshold 15). Drivers by points: if/else 76 (227 pts), loops 49 (132 pts), ternaries 14 (40 pts), boolean chains 26 (nesting depth added 260). 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":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b6be8d17dd7abad5519d87493826b3f5e5075896971f65d413733bae43f563"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistPasses.applyTransparentClustering (cognitive 157): NetlistPasses.applyTransparentClustering has cognitive complexity 157 (threshold 15). Drivers by points: if/else 21 (84 pts), loops 22 (67 pts), boolean chains 6 (nesting depth added 108). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_passes.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdd269c7ec779d43765571dd2e0a2d19318cd2e02b9367acf86bd521d57488a"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats (cognitive 135): SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats has cognitive complexity 135 (threshold 15). Drivers by points: if/else 30 (78 pts), boolean chains 40, loops 9 (17 pts) (nesting depth added 56). 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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"22758cd6b89b8d74a5c7c7f487f936d24c94714bbccffd260a9503758bf44ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemVerilogSynthModuleDefinition._collapseAggregateConnections (cognitive 128): SystemVerilogSynthModuleDefinition._collapseAggregateConnections has cognitive complexity 128 (threshold 15). Drivers by points: if/else 20 (71 pts), loops 14 (36 pts), boolean chains 13, ternaries 2 (8 pts) (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbcadba6a7a7c6ac68ead32c46469cf7ea541bbe4ce1fb4a22c3cdb0daaeaf1"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCSynthesisResult._buildProcesses (cognitive 127): SystemCSynthesisResult._buildProcesses has cognitive complexity 127 (threshold 15). Drivers by points: if/else 28 (65 pts), loops 10 (27 pts), boolean chains 18, ternaries 5 (17 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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaafffcfd8943a74cf6788bf96c9123d903a4bea0428b6dc6d6cec3b5f3dc82"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceTracer.traceJsonForHierarchy (cognitive 124): SourceTracer.traceJsonForHierarchy has cognitive complexity 124 (threshold 15). Drivers by points: if/else 37 (70 pts), loops 11 (21 pts), boolean chains 18, ternaries 9 (15 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0660f2f377b283d9bddf9a6c451e8e2ead3c332b20d1a90cb8443af830d342d"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistModuleTranslation.processNetnames (cognitive 118): NetlistModuleTranslation.processNetnames has cognitive complexity 118 (threshold 15). Drivers by points: if/else 32 (69 pts), loops 16 (34 pts), boolean chains 10, ternaries 2 (5 pts) (nesting depth added 58). 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":"lib/src/synthesizers/netlist/netlist_module_translation.dart"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d80a455c3cb61f5849ad28883db1f2cc3fca8f6054937a32db742a6c16c982"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._pruneUnused (cognitive 118): SynthModuleDefinition._pruneUnused has cognitive complexity 118 (threshold 15). Drivers by points: if/else 26 (82 pts), boolean chains 24, loops 5 (9 pts), ternaries 1 (3 pts) (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"79482953a04a08552aa97b746ae8fba461d52c980f05118e86bb606f3f7bc435"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemVerilogSynthesisResult._buildSvLineMap (cognitive 107): SystemVerilogSynthesisResult._buildSvLineMap has cognitive complexity 107 (threshold 15). Drivers by points: if/else 18 (60 pts), loops 12 (30 pts), ternaries 3 (10 pts), boolean chains 7 (nesting depth added 67). 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":"lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9cbb4584fe3cfe766e6c79caf76ad154232988d42ef0166f3b2fa120337702"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicValue.of (cognitive 100): LogicValue.of has cognitive complexity 100 (threshold 15). Drivers by points: if/else 39 (68 pts), ternaries 6 (17 pts), boolean chains 15 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/values/logic_value.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b02e460a9b06e4b7df27f85cf720921745a70e2462c26b2d9cb0d3906384e87"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistEvaluator.collectLeaves (cognitive 97): NetlistEvaluator.collectLeaves has cognitive complexity 97 (threshold 15). Drivers by points: if/else 25 (69 pts), loops 7 (20 pts), boolean chains 8 (nesting depth added 57). 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":"rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b217a9272a3fe87c6e936d8f43c24c0c2a16124258991190cfce752763805a5e"}},{"ruleId":"D2","level":"warning","message":{"text":"FlcData.fromJson (cognitive 89): FlcData.fromJson has cognitive complexity 89 (threshold 15). Drivers by points: if/else 20 (53 pts), loops 6 (16 pts), ternaries 3 (11 pts), boolean chains 9 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_source_navigator/lib/flc_data.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"430806dc78d2a13e9f28c0201d5e3b773484bf7d0aa39529d368c9e78b233957"}},{"ruleId":"D2","level":"warning","message":{"text":"_StandaloneDevToolsPageState._loadModuleTree (cognitive 89): _StandaloneDevToolsPageState._loadModuleTree has cognitive complexity 89 (threshold 15). Drivers by points: if/else 30 (77 pts), boolean chains 8, ternaries 1 (3 pts), error handling 1 (nesting depth added 49). 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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cde28e2f4996192de782cc8f164e5e661482343eb6a4fba6817f8d49c92bfe2"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemVerilogSynthModuleDefinition._collapseWholeNetBuses (cognitive 88): SystemVerilogSynthModuleDefinition._collapseWholeNetBuses has cognitive complexity 88 (threshold 15). Drivers by points: if/else 18 (56 pts), loops 10 (25 pts), boolean chains 7 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1acf03c7ba09b2b6269f42a26c2f496565918e1a8bd47f937f2c23f5029113f"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicValue.ofRadixString (cognitive 83): LogicValue.ofRadixString has cognitive complexity 83 (threshold 15). Drivers by points: if/else 18 (46 pts), loops 6 (22 pts), match/switch 2 (8 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 52). 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":"lib/src/values/logic_value.dart"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ad32d1a48ce5a6ccbc5267aeae8f077f9c02cc2a18ec28b087c6c29b39d75b"}},{"ruleId":"D2","level":"warning","message":{"text":"Module._traceInputForModuleContents (cognitive 80): Module._traceInputForModuleContents has cognitive complexity 80 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 8 (29 pts), boolean chains 15, ternaries 1 (2 pts), error handling 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/module.dart"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63afb0f7e6399a7da9c4b0cf58642df7286de9bd1f8b45309021b71dda0f868"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistPasses.removeTrivialConcatAliases (cognitive 80): NetlistPasses.removeTrivialConcatAliases has cognitive complexity 80 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 11 (32 pts), boolean chains 7 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_passes.dart"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82a9b3e1ab71bc11a2cae5ebbc56d983b6eeba70d19c5ae5662e0eecc413da7"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition.SynthModuleDefinition (cognitive 80): SynthModuleDefinition.SynthModuleDefinition has cognitive complexity 80 (threshold 15). Drivers by points: if/else 26 (48 pts), boolean chains 24, loops 6 (8 pts) (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ec20747e02e6000b8482c3df8ccbcb168cc7c8f71a2171d64fdd0142b42cf1"}},{"ruleId":"D2","level":"warning","message":{"text":"Module._traceOutputForModuleContents (cognitive 79): Module._traceOutputForModuleContents has cognitive complexity 79 (threshold 15). Drivers by points: loops 9 (34 pts), if/else 13 (30 pts), boolean chains 12, ternaries 1 (2 pts), error handling 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/module.dart"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40d1b314cd173c7257e00738f931f5a7083f7579762b38abf6e2b1975d666f8"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemVerilogSynthModuleDefinition._inlinePackedRangesIntoSubmoduleInputs (cognitive 77): SystemVerilogSynthModuleDefinition._inlinePackedRangesIntoSubmoduleInputs has cognitive complexity 77 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 28, loops 8 (13 pts), ternaries 1 (4 pts) (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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff4f09b712d9f527694bf13ac920aa7d4d6ee598d2354a638d7cabbcd95dffe"}},{"ruleId":"D2","level":"warning","message":{"text":"FstBlockReader._decodeSignalChanges (cognitive 76): FstBlockReader._decodeSignalChanges has cognitive complexity 76 (threshold 15). Drivers by points: if/else 18 (48 pts), ternaries 3 (13 pts), boolean chains 10, loops 2 (5 pts) (nesting depth added 43). 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":"lib/src/fst/fst_block_reader.dart"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"5679217828f9cf5abfaf150128fd01d4d2efb1b6f02f47ef646fa6ef58a9a03d"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemVerilogSynthModuleDefinition._forwardPassthroughElementsIntoInlineables (cognitive 76): SystemVerilogSynthModuleDefinition._forwardPassthroughElementsIntoInlineables has cognitive complexity 76 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 9 (18 pts), boolean chains 9, ternaries 3 (8 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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"352a8636e7db0b92be16aa70e27234c8f6d53387b4b3220aebc82d91f579596d"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseSignalWaveformApi.getWaveformData (cognitive 72): BaseSignalWaveformApi.getWaveformData has cognitive complexity 72 (threshold 15). Drivers by points: if/else 24 (48 pts), loops 8 (17 pts), boolean chains 7 (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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ddb5bbfcb0b2939967951d91164366d35dc1f3bf7dc97205f46d4496ec4a23"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistCellMapper._registerDefaults (cognitive 70): NetlistCellMapper._registerDefaults has cognitive complexity 70 (threshold 15). Drivers by points: if/else 31 (32 pts), ternaries 11 (20 pts), boolean chains 16, loops 2 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_cell_mapper.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe869fd9b26df52418ef2294f95d7a828a9bed126b8ce86573a2f138d804135"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCSynthesisResult._gateExpression (cognitive 66): SystemCSynthesisResult._gateExpression has cognitive complexity 66 (threshold 15). Drivers by points: if/else 28 (44 pts), ternaries 6 (13 pts), boolean chains 7, loops 1 (2 pts) (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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"db06bd7c284912e93b88e97577afb5838deb74ea5cad5073da28ead7d956ef4f"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._collapseConstantBackedRangeIntermediates (cognitive 64): SynthModuleDefinition._collapseConstantBackedRangeIntermediates has cognitive complexity 64 (threshold 15). Drivers by points: if/else 12 (36 pts), boolean chains 18, loops 5 (10 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":3295}}}],"partialFingerprints":{"codehealthFindingId/v1":"157c6822700d1aa290e9b4c93b15823df29fa8bb0146713af75f738777421e0b"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistService._buildSlimJson (cognitive 61): NetlistService._buildSlimJson has cognitive complexity 61 (threshold 15). Drivers by points: if/else 10 (36 pts), loops 8 (23 pts), boolean chains 1, ternaries 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_service.dart"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35a7ae1b466aa0c15cc492ca0b67aee65137b1bf64eb3985f21bfae1d4bf57b"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicValue.toRadixString (cognitive 59): LogicValue.toRadixString has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (48 pts), loops 2 (6 pts), ternaries 3, boolean chains 1, match/switch 1 (nesting depth added 31). 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":"lib/src/values/logic_value.dart"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee85d0857f918f3ad5966151f3aec00296876de60187b53a2ce7a7cdd6d462e"}},{"ruleId":"D2","level":"warning","message":{"text":"conditional_completions.detectContext (cognitive 58): conditional_completions.detectContext has cognitive complexity 58 (threshold 15). Drivers by points: if/else 20 (39 pts), loops 6 (10 pts), boolean chains 9 (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":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e9cd5c43af426ef9e70ee115f354a6c2b54b3d58600463495d5141369e243c"}},{"ruleId":"D2","level":"warning","message":{"text":"SimCompare.checkVerilatorVector (cognitive 55): SimCompare.checkVerilatorVector has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 3 (9 pts), ternaries 2 (7 pts), boolean chains 3, error handling 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":"lib/src/utilities/simcompare.dart"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3084fa3e0edb8edb4dcef0ceacafe5df56dd81761dd9166cef45d66e59dd2f8"}},{"ruleId":"D2","level":"warning","message":{"text":"_CrossProbeStatusButtonState._showFormatsMenu (cognitive 54): _CrossProbeStatusButtonState._showFormatsMenu has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (32 pts), ternaries 3 (14 pts), boolean chains 3, loops 1 (3 pts), error handling 1 (2 pts) (nesting depth added 30). 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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":3387}}}],"partialFingerprints":{"codehealthFindingId/v1":"78addd9ce68e2ae9ea103e62b4fdcc73f6df9f1107a39a00f4b9494111cda51e"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistPasses.collapseConcatOfAdjacentSlices (cognitive 54): NetlistPasses.collapseConcatOfAdjacentSlices has cognitive complexity 54 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 5 (12 pts), boolean chains 9 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_passes.dart"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"21318ca891b59767147acc50735761ea8f00b9dff1ee40c83b59e4b7d1940cce"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistConstExtractor.extract (cognitive 52): NetlistConstExtractor.extract has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 8 (11 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/netlist_const_extractor.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dcf6ad6ccb44a30d2d52fe275086a99c58d26c0154c422b9f2cb804e53f7cb"}},{"ruleId":"D2","level":"warning","message":{"text":"_StandaloneAppBarState.build (cognitive 52): _StandaloneAppBarState.build has cognitive complexity 52 (threshold 15). Drivers by points: ternaries 14 (27 pts), if/else 14 (20 pts), boolean chains 5 (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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":2993}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ede0d517cf1fdd2e2b31dfd51cc9bad4fb8bf158b18f22e673fc9fa0168811"}},{"ruleId":"D2","level":"warning","message":{"text":"conditional_completions.findEnclosingClassInfo (cognitive 52): conditional_completions.findEnclosingClassInfo has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 9 (14 pts), boolean chains 12 (nesting depth added 17). Of this number, 51 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":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39dce31c5e1a1d560e23657d3799a563491af71ee29439ac60f69263021ed5f"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceWaveformDataSource._evaluate (cognitive 50): VmServiceWaveformDataSource._evaluate has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (35 pts), boolean chains 7, error handling 2 (4 pts), loops 1 (4 pts) (nesting depth added 30). 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f0f0e31171dd8c4d5bcbfb9cb4d4b4a6e3cdaead3d627cb954d0935bca575b"}},{"ruleId":"D2","level":"warning","message":{"text":"_SystemCSimCompare.buildSystemCVectorExecutable (cognitive 50): _SystemCSimCompare.buildSystemCVectorExecutable has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (27 pts), loops 16, ternaries 3 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/systemc_simcompare.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a7e2fcec26d83e29a215991b58f4445b0405778e9328a43d7c5d2951fca269"}},{"ruleId":"D2","level":"warning","message":{"text":"RohdShellOutput._formatResult (cognitive 49): RohdShellOutput._formatResult has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (27 pts), ternaries 6 (18 pts), boolean chains 4 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/cli/rohd_shell_output.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04a94c8337c3255fcd7fae6439db84d464612bfe2fff68273479b931d80bb57"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistModuleTranslation.processCells (cognitive 49): NetlistModuleTranslation.processCells has cognitive complexity 49 (threshold 15). Drivers by points: loops 7 (21 pts), if/else 7 (17 pts), boolean chains 5, ternaries 2 (4 pts), match/switch 1 (2 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":"lib/src/synthesizers/netlist/netlist_module_translation.dart"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"7106d75ded2f67a780af40cb134c9cecdfe39f0be23f683cd001954b65d4b133"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._planConcatRangeRewrite (cognitive 49): SynthModuleDefinition._planConcatRangeRewrite has cognitive complexity 49 (threshold 15). Drivers by points: boolean chains 26, if/else 10 (16 pts), loops 3 (4 pts), ternaries 1 (3 pts) (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":3800}}}],"partialFingerprints":{"codehealthFindingId/v1":"080971e1c312f5402d5e466695dd341dba1f16c056e097c7c21f37a3d06ffe8d"}},{"ruleId":"D2","level":"warning","message":{"text":"HierarchyService._searchSignalsRegex (cognitive 48): HierarchyService._searchSignalsRegex has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 5 (14 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_hierarchy/lib/src/hierarchy_service.dart"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4bd2f4aadb2e15629d3d1e7fde6c87df39986414f55a2c2784335b0abf5cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"_CopyableCell._showCopyMenu (cognitive 47): _CopyableCell._showCopyMenu has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (30 pts), loops 2 (6 pts), boolean chains 5, ternaries 2 (4 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":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80dc3dc9650c2d6684f7264076f70dfbe7476730309d36c5037f67c7fde6518"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._findChainableModulesToCollapse (cognitive 47): SynthModuleDefinition._findChainableModulesToCollapse has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 13, loops 12 (13 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"23114aae9590594a377308093deeb41f3d8e8e55c59db760f46ae29309ef1e39"}},{"ruleId":"D2","level":"warning","message":{"text":"_SystemCSimCompare._runSystemCVectors (cognitive 47): _SystemCSimCompare._runSystemCVectors has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 7 (12 pts), ternaries 1 (4 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":"lib/src/utilities/systemc_simcompare.dart"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62ea610c0d14c3ba79937c9e6c1eebe0f0d995992ed1a48fd82d09275cd48d9"}},{"ruleId":"D2","level":"warning","message":{"text":"FlcData._parseSymbolString (cognitive 46): FlcData._parseSymbolString has cognitive complexity 46 (threshold 15). Drivers by points: if/else 7 (22 pts), ternaries 5 (17 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_source_navigator/lib/flc_data.dart"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b683d08ae954597d538ccadc8cff62dbc4aaafdbab8267bbce484ed72ac934"}},{"ruleId":"D2","level":"warning","message":{"text":"_VmConnectionFormState.build (cognitive 45): _VmConnectionFormState.build has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 16 (32 pts), if/else 9 (10 pts), boolean chains 3 (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":"rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d4d95b7a4e24329d67b50f87889cc9ed3fe102c04617a516a661437653c107"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._pruneClearedSubsetConstantSources (cognitive 43): SynthModuleDefinition._pruneClearedSubsetConstantSources has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 13, loops 8 (12 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":3411}}}],"partialFingerprints":{"codehealthFindingId/v1":"441272760c71cdf6243f59a9f8c642fe86a4439c67fb9bb383c7e44d7d2a5335"}},{"ruleId":"D2","level":"warning","message":{"text":"_StandaloneDevToolsPageState._tryRefreshDataSource (cognitive 42): _StandaloneDevToolsPageState._tryRefreshDataSource has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (30 pts), error handling 2 (5 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fe19ed6caa674f7a151022e1eb763c052af07791d68b37e312bf7745bea216"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistUtils.collapseAlwaysBlockPorts (cognitive 42): NetlistUtils.collapseAlwaysBlockPorts has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 8 (12 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_utils.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6f0c0a5c589b41bdd320fae30b3d14cf92f455411d28c57cd9a5febfece5e4"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._collectOutputDrivingConcats (cognitive 42): SynthModuleDefinition._collectOutputDrivingConcats has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 17, if/else 7 (17 pts), loops 4 (8 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":3711}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5f84b0df7b4d1d800e6db7451f05be7425a1c16c9ffc44747ca72e783e5dab"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseSignalWaveformApi._resolveFieldBits (cognitive 41): BaseSignalWaveformApi._resolveFieldBits has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (26 pts), ternaries 5 (12 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"5835a20af9ffb972c1f89bc2cac4ed613c358459867221fe604995b842423f5c"}},{"ruleId":"D2","level":"warning","message":{"text":"SimCompare.checkVectors (cognitive 41): SimCompare.checkVectors has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 3, match/switch 1 (3 pts), error handling 1 (2 pts), boolean chains 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":"lib/src/utilities/simcompare.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39d49e475a569de2ca8d1439c0f62ae712e50a12413e79345a320a8fd945068"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistPasses.removeUnconsumedTransparentCells (cognitive 40): NetlistPasses.removeUnconsumedTransparentCells has cognitive complexity 40 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 6 (16 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":"lib/src/synthesizers/netlist/netlist_passes.dart"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2e06aebca69e39fc18d8de1d4fade0723edec328e9f1d14c6eef0046814c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceTracer.traceAttributesForModule (cognitive 40): SourceTracer.traceAttributesForModule has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 5 (9 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ccacd12d9678ca9060387b8beaa132ad769f58b106bba7d252edf99c893cce"}},{"ruleId":"D2","level":"warning","message":{"text":"_SystemVerilogSimCompare.iverilogVector (cognitive 40): _SystemVerilogSimCompare.iverilogVector has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (31 pts), loops 3, boolean chains 2, error handling 1 (2 pts), ternaries 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":"lib/src/utilities/systemverilog_simcompare.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5ae2d4d082fbcd1a886606d4d782ac37d5c064c634b2b204e6fc928403bb37"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._collapseSimpleRangeAssignments (cognitive 39): SynthModuleDefinition._collapseSimpleRangeAssignments has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (13 pts), loops 8 (10 pts), ternaries 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b8d38e7bb647f408388c22c902ac24fb261cbd934072878c1c40fc361a0e9e"}},{"ruleId":"D2","level":"warning","message":{"text":"SignalWaveformRepository._resolveFieldBits (cognitive 39): SignalWaveformRepository._resolveFieldBits has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 5 (12 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_waveform/lib/src/waveform_repository.dart"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dfc4f1f459281014b2605b5980c37614a475c5954386b72bacb187365dd20b"}},{"ruleId":"D2","level":"warning","message":{"text":"flc_service.queryModule (cognitive 39): flc_service.queryModule has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 4 (7 pts), boolean chains 6, loops 3 (5 pts), error handling 1 (nesting depth added 14). Of this number, 35 points are the body\u0027s own statements and 4 belong to one function item 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":"rohd_extension/src/flc_service.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a431f9937f35e09a82444d8f7abd2b5127365a3648e0c9c40aec599f71431a"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistSynthesizer._compressModulesMap (cognitive 38): NetlistSynthesizer._compressModulesMap has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 5 (15 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0727cdd57759588337124ed16fd2170fac8306e07b214e5c7feef5af65b1f4cc"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._collapseWideArrayElementRangeSources (cognitive 38): SynthModuleDefinition._collapseWideArrayElementRangeSources has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 12, loops 5 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f635d6d6e00f9b14a1ea91c518112d29d8c8c978df5307a1ccd5637a632891"}},{"ruleId":"D2","level":"warning","message":{"text":"PairInterface.connectIO (cognitive 37): PairInterface.connectIO has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (35 pts), loops 1 (2 pts) (nesting depth added 25). 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":"lib/src/interfaces/pair_interface.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf92a13b2d27828ecfdc029903a5cb5149300afc84cbe4fadd3a3fa8caf29c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCSynthesisResult._buildScLineMap (cognitive 37): SystemCSynthesisResult._buildScLineMap has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 9 (13 pts), boolean chains 5 (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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7187e698890ad8a4651b12a33377f074a5b0f69838b3106b51fc9aeef40fe7"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemVerilogSynthesisResult._verilogAssignments (cognitive 37): SystemVerilogSynthesisResult._verilogAssignments has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 15, if/else 6 (13 pts), ternaries 3 (8 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3d84cc9ae0713ef9395e22a9e43589724aaed8581f4387fae621833d27ba51"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._collapseAssignments (cognitive 37): SynthModuleDefinition._collapseAssignments has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 13, if/else 6 (13 pts), loops 5 (7 pts), ternaries 1 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":4364}}}],"partialFingerprints":{"codehealthFindingId/v1":"338d77311803d704d4522097d15c8fcb99364e07d9091e8d9018996702510346"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceSignalValueSource.getSnapshot (cognitive 35): VmServiceSignalValueSource.getSnapshot has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd67943717c697aa46d282a2cf8e7311bcf38c93ad50d1739a639d361a09458"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceWaveformDataSource._onPause (cognitive 34): VmServiceWaveformDataSource._onPause has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (6 pts), boolean chains 4, ternaries 1 (4 pts), error handling 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"54905596f044f25bdf3d6cba0901054fe5afbe64de1690988bb6d926cd20073d"}},{"ruleId":"D2","level":"warning","message":{"text":"Always.Always (cognitive 34): Always.Always has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 5 (10 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":"lib/src/modules/conditionals/always.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb9af91cb6396afb8550569669897edeb9ac48226a34a906187ebaee33bd1fc"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition.getSynthLogic (cognitive 34): SynthModuleDefinition.getSynthLogic has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 10 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42cd35e8329a00bb8316a2e6358e0a5791ef87ecabca4ae1f4ed43ad4e61a61"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._fullPackedConcatSourceRanges (cognitive 34): SynthModuleDefinition._fullPackedConcatSourceRanges has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0210fae4fd33440cc81a9d738defed27fadbcbb4b8ecfccf76a6fa0b898f27b2"}},{"ruleId":"D2","level":"warning","message":{"text":"RohdServiceCubit._handleModuleTreeOperation (cognitive 33): RohdServiceCubit._handleModuleTreeOperation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (18 pts), error handling 3 (9 pts), loops 1 (4 pts), ternaries 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/cubit/rohd_service_cubit.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40a8b083c7a4c73f3c1fc94f9e647f9f5a3ec23b4ac4fbf8688a524a6cf53f1"}},{"ruleId":"D2","level":"warning","message":{"text":"DevToolsConnectionHostState.attemptAutoReconnect (cognitive 33): DevToolsConnectionHostState.attemptAutoReconnect has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 5, ternaries 1 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 17). 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":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f8beaa8f23a79ebdecc98072061a80c65ed5b3fcc6f574ce70dc4a4c52b466"}},{"ruleId":"D2","level":"warning","message":{"text":"VcdParser.confirmValue (cognitive 33): VcdParser.confirmValue has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (32 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":"lib/src/utilities/vcd_parser.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c9c2c2e39b8e0525762b4e183219a9ac82ebffa51ab0de2487931b9d0e983f"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseSignalWaveformApi.ensureFullModules (cognitive 32): BaseSignalWaveformApi.ensureFullModules has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 4 (9 pts), boolean chains 5, ternaries 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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb2942fc6318b54b6068bdbc15c3ebfe655c9f8b14f0afa27de1b2b71d7b84f"}},{"ruleId":"D2","level":"warning","message":{"text":"FlcService.getModuleFormats (cognitive 32): FlcService.getModuleFormats has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (8 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":"rohd_devtools_extension/lib/rohd_devtools/services/flc_service.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e0a2ee33f15fa31eea5ec1db1b499637b253d66d71f4bc42009f922f811182"}},{"ruleId":"D2","level":"warning","message":{"text":"_StandaloneDevToolsPageState._buildSignalValueLookup (cognitive 32): _StandaloneDevToolsPageState._buildSignalValueLookup has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 4, loops 1 (2 pts), ternaries 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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":2662}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0a5e84aa8791cc0f6d4d9d11dd6ea131b3cccf806ed9b0acf3f3bc40f937d8"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistModuleTranslation.processPorts (cognitive 32): NetlistModuleTranslation.processPorts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (7 pts), ternaries 1 (5 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_module_translation.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"948ec73c914f7c3decb3b313a781557f377bb2abbeb1cb33516b6f529de1133c"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemVerilogSynthesizer.instantiationVerilogFor (cognitive 32): SystemVerilogSynthesizer.instantiationVerilogFor has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7, ternaries 2 (6 pts), loops 3 (5 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":"lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5aafdbaa7b17f3c8135081e31bc93583035d03deaaad4766147141dea53b829"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._collapseArrays (cognitive 32): SynthModuleDefinition._collapseArrays has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c0b5a0e3e017f991d629ff0c9e5a7218bf8c502d105106132bafeb6e35e5d1"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseSignalWaveformApi._synthesizeClientSide (cognitive 31): BaseSignalWaveformApi._synthesizeClientSide has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3c4bb933240c7e71ae92426a648363297e825e7e7ea1c269f36dae602b88cb"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._collectOutputSplit (cognitive 31): SynthModuleDefinition._collectOutputSplit has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 16, if/else 5 (10 pts), ternaries 1 (3 pts), loops 2 (nesting depth added 7). 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"089ba87f92b6483e549b957e18e7ef20c8fc45d0277b595cb9e3f103d917b30f"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._assignmentConnectedSubmoduleMappingSignals (cognitive 31): SynthModuleDefinition._assignmentConnectedSubmoduleMappingSignals has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (13 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c6c5879db289a75eaa8dd750168eb0e97c73dbe806e6f9d037bc8341cd2f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Namer.signalNameOfBest (cognitive 31): Namer.signalNameOfBest has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (24 pts), ternaries 2 (4 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":"lib/src/utilities/namer.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"596ef112fb520fc564e761e744caca2d522e1d249f76764364eac2655b3b72d8"}},{"ruleId":"D2","level":"warning","message":{"text":"SimCompare.checkFunctionalVector (cognitive 31): SimCompare.checkFunctionalVector has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (12 pts), boolean chains 2 (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":"lib/src/utilities/simcompare.dart"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"1611cf98a74d18b45bc0a623f15749f91b06a2920d6ff2db48eeabb92a002601"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicValue._doCompare (cognitive 31): LogicValue._doCompare has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 5 (11 pts), boolean chains 8 (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":"lib/src/values/logic_value.dart"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"70494e53a181002020bce7edb7d2aa3e1ed7e3bbafcc41fb3d4c2904c25fff37"}},{"ruleId":"D2","level":"warning","message":{"text":"BitFieldUtils.parseBitFieldDefs (cognitive 31): BitFieldUtils.parseBitFieldDefs has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 5 (10 pts), boolean chains 4, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/lib/src/bit_field_utils.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec05ce778585fdc842305a06b51e1ccaf221d3147bedc36861e4b399b5aa8202"}},{"ruleId":"D2","level":"warning","message":{"text":"elk_layout_only.elkLayoutOnly (cognitive 31): elk_layout_only.elkLayoutOnly has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 5, loops 2 (4 pts), ternaries 2 (3 pts), error handling 1 (nesting depth added 6). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 2 function items inside it that branch (restoreHidden, saveHidden). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce8367900681ff82223e5895aa03cd85523f1dd14b56c6260183518adbaab25"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceTransport._onPause (cognitive 30): VmServiceTransport._onPause has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (6 pts), boolean chains 4, error handling 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"693203646e2c25a3fc4d118e677501ed2438f4093dbcd1405be88ee2e992d1e1"}},{"ruleId":"D2","level":"warning","message":{"text":"WaveformDataService.getSnapshotCompactJSON (cognitive 30): WaveformDataService.getSnapshotCompactJSON has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (7 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":"lib/src/diagnostics/waveform_data_service.dart"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4f6f74dd006a6a44b8207514add52b59643bb85edc5b39e3259421581f4a64"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._connectNestedArrayFields (cognitive 30): SynthModuleDefinition._connectNestedArrayFields has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (5 pts), ternaries 1 (5 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb1f064f7da2b226bd5c32721ae372342a8725b7f7235c49dece2207f1986d6"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._composeChainedRangeAssignment (cognitive 30): SynthModuleDefinition._composeChainedRangeAssignment has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 11 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":3189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3723ebc90f2b098d30e5c9fd5e9c7a99e44d6a09e702171cb08c9427dcde4a"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseSignalWaveformApi._evaluateComputedInSnapshot (cognitive 29): BaseSignalWaveformApi._evaluateComputedInSnapshot has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 5 (7 pts), ternaries 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"466f25d4dbab75c63ea4d528bbdc95bcddbe025438287d696a02576aad7d76c7"}},{"ruleId":"D2","level":"warning","message":{"text":"IoVmConnectionStrategy.connect (cognitive 29): IoVmConnectionStrategy.connect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae9d58c696ab273f87b871f1045fac7b68002c97019ce5ac8133e5a17a8a31b"}},{"ruleId":"D2","level":"warning","message":{"text":"WebVmConnectionStrategy.connect (cognitive 29): WebVmConnectionStrategy.connect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff297761ba7a99e4651262ad338173c2cd6e47d254454fe69f7d1a3e45068fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"WaveformDataService.getSnapshotJSON (cognitive 29): WaveformDataService.getSnapshotJSON has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (8 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":"lib/src/diagnostics/waveform_data_service.dart"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf8c09eb49ce447fff859f95d9881431941edc24e4869763e65f03b92772fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"PairInterface.connectIOAsStructuredPorts (cognitive 29): PairInterface.connectIOAsStructuredPorts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (26 pts), ternaries 1 (2 pts), loops 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":"lib/src/interfaces/pair_interface.dart"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6996b0909c9bff90e927e2d619e5924a82dd02c8b618a5f601f357cab73230cc"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistValidation._driversByBit (cognitive 29): NetlistValidation._driversByBit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_validation.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4c8af41fe994854f79f6da6b63e2cee140bae135078be1adbba6a7b16264b5"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCSynthesisResult._buildInlineGates (cognitive 29): SystemCSynthesisResult._buildInlineGates has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (6 pts), boolean chains 3 (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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fa869a32c666232db38d6f6e392928a3865b5c83f61b41ea4945dd08599bf5"}},{"ruleId":"D2","level":"warning","message":{"text":"SignalWaveformRepository._synthesizeBitSlice (cognitive 29): SignalWaveformRepository._synthesizeBitSlice has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 3 (8 pts), boolean chains 5, 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":"packages/rohd_waveform/lib/src/waveform_repository.dart"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3d6059d19d83c40b31541c6d8d91c550365145bb447e67a1abe1826bbd5963"}},{"ruleId":"D2","level":"warning","message":{"text":"FlcData._parseEmbeddedModule (cognitive 28): FlcData._parseEmbeddedModule has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (6 pts), boolean chains 5, 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":"packages/rohd_source_navigator/lib/flc_data.dart"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"149bc1fa716f5a0af6a2d23ca58bea7f6208102f50ae087b3a3ecbc8d30d5cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"Case.execute (cognitive 28): Case.execute has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (8 pts), boolean chains 6 (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":"lib/src/modules/conditionals/case.dart"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5745af374afdb8a7957c6e8c1d2e0bbacfabbb843ab61c5a339f24fc8b3334"}},{"ruleId":"D2","level":"warning","message":{"text":"buildModuleInfo (cognitive 28): buildModuleInfo has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 8, other 4, ternaries 1 (2 pts), error handling 1 (nesting depth added 7). Of this number, 25 points are the body\u0027s own statements and 3 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":"packages/rohd_devtools_widgets/assets/extension/module_info_helper.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a8d07ec618242368456f25277e59004a312723c0e097d1f08d32a19039a8a9"}},{"ruleId":"D2","level":"warning","message":{"text":"_SignalTableState._generateSignalRow (cognitive 27): _SignalTableState._generateSignalRow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 6 (8 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":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a17a5b7d32d05356829f7362d0e541971003ea4abec6be087c7fe2dd2505e4"}},{"ruleId":"D2","level":"warning","message":{"text":"HierarchyService.autocompletePortPaths (cognitive 27): HierarchyService.autocompletePortPaths has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 7, loops 3, ternaries 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":"packages/rohd_hierarchy/lib/src/hierarchy_service.dart"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3f7548245f081a946ea301b319957dfda5d35150ec58856915d6665a892729"}},{"ruleId":"D2","level":"warning","message":{"text":"flc_service.parseOutputPositions (cognitive 27): flc_service.parseOutputPositions has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (12 pts), ternaries 3 (9 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/flc_service.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"8423b89574cb1a8d7b6d7a8e005f9b26f6a2f64c46a92b362d2ac101229215b3"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthStructureLayout.fieldNameAt (cognitive 26): SynthStructureLayout.fieldNameAt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 8, loops 1 (nesting depth added 9). 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":"lib/src/synthesizers/utilities/synth_structure_layout.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c946d9e0e6b651aff7a18a6939d863a7568c7d902d07b8b0f91c994ef2de8113"}},{"ruleId":"D2","level":"warning","message":{"text":"_HelpContent._parseDetails (cognitive 26): _HelpContent._parseDetails has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48c291724c131b72d681d1dbb5ea925e9cfa8f5f5f982b6106140a85b596fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"buildModuleInfo (cognitive 26): buildModuleInfo has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 8, other 4, error handling 1 (nesting depth added 6). Of this number, 23 points are the body\u0027s own statements and 3 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":"rohd_devtools_extension/shared/module_info_helper.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26df2f9fb71d1c311640cfed63718685b1d53bae5c23687ce7e8dff1098e4c1"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceTransport._findWaveformLibrary (cognitive 25): VmServiceTransport._findWaveformLibrary has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), boolean chains 5, error handling 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"7873e286a623a48586592bc99d7c743482b29e008e932cb3991ff58349d90429"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceWaveformDataSource._findWaveformLibrary (cognitive 25): VmServiceWaveformDataSource._findWaveformLibrary has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), boolean chains 5, error handling 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e60e9a8860ff7a8d545bea5b1cb8a0276716a595c431adf171f04bb6c3c8cd"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeStructurePageState.build (cognitive 25): TreeStructurePageState.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 8, 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":"rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b038efce84d4dbeffed9a52cd12ed06505cdc1e0902e302be030088b7cfc5ed7"}},{"ruleId":"D2","level":"warning","message":{"text":"WaveformDataService._registerNetlistInstance (cognitive 25): WaveformDataService._registerNetlistInstance has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/diagnostics/waveform_data_service.dart"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edd6352e9d58e1888beb0e7e3131d8ac723882920666af283aceff50b54b29f"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicEnum._computeWidth (cognitive 25): LogicEnum._computeWidth has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/signals/logic_enum.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52eefc0e22099e928fc0d105853bb62d47ff7abcee46986c3a09de826c9e102"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._isValidOutputSplit (cognitive 25): SynthModuleDefinition._isValidOutputSplit has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 18, if/else 3 (6 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fd87e285d79921c849de1fe3d75e72394ade3fa33aa97b9bb3829cc8bbcd7e"}},{"ruleId":"D2","level":"warning","message":{"text":"_FilledLogicValue._equals (cognitive 25): _FilledLogicValue._equals has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 9 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/values/filled_logic_value.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"17412328bafe8bff7fbc95beec17c81fb3013315877c083ee3e280a571c593aa"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicValue._doMath (cognitive 25): LogicValue._doMath has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 7, ternaries 4 (7 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":"lib/src/values/logic_value.dart"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bae55b457e9cd40281c553b12f08a328a95c26c9117409a7b7b15764f9fb30"}},{"ruleId":"D2","level":"warning","message":{"text":"HierarchyService.autocompletePaths (cognitive 25): HierarchyService.autocompletePaths has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 4 (7 pts), boolean chains 6, 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":"packages/rohd_hierarchy/lib/src/hierarchy_service.dart"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a8f5534c758e8b1db1b41b390749d9144c1871b94380d7b7e7ea797140fdc2"}},{"ruleId":"D2","level":"warning","message":{"text":"FlcData.lookupByRohdLine (cognitive 24): FlcData.lookupByRohdLine has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (8 pts), boolean chains 4 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_source_navigator/lib/flc_data.dart"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f63b972d403e3dc9c4a0f983c1a468506c8d4e30d168d12fedd3abe6d11e18e"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceTransport.getModuleTree (cognitive 24): VmServiceTransport.getModuleTree has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 8, loops 1 (2 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea92b9e178e8e99d9f9d5be88852c8d266ab94e073faf87b3acdc59c8e53100"}},{"ruleId":"D2","level":"warning","message":{"text":"WaveformService._ (cognitive 24): WaveformService._ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, loops 2 (5 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/diagnostics/waveform_service.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15ee0b317a4685febee3a876ddd148ec4e160461b210d0b156fe61ad7a953e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Sequential._setup (cognitive 24): Sequential._setup has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3, 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":"lib/src/modules/conditionals/sequential.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"61263a775f1f55702febd6e7e222bd18bf7a1089e59851d96644a8fd3d044704"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistUtils.buildLogicType (cognitive 24): NetlistUtils.buildLogicType has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_utils.dart"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2b15939a902843c20b317590d96286e521e69306d824a93d28f1a34e8be337"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCSynthesisResult._buildSubModuleBindings (cognitive 24): SystemCSynthesisResult._buildSubModuleBindings has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 pts), ternaries 1 (5 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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb075127005ad4dbdaff85808eccc4aec7d09a2cd497f4ac219beeb68aa455f"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthSubModuleInstantiation.adjustTypePairs (cognitive 24): SynthSubModuleInstantiation.adjustTypePairs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (6 pts), boolean chains 4, 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":"lib/src/synthesizers/utilities/synth_sub_module_instantiation.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8573049e656e920b173b065b727bfea755a0ddbbe1854643cb2423c0666949a5"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceTransport.getModuleNetlist (cognitive 23): VmServiceTransport.getModuleNetlist has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 6, loops 1 (2 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"84342a734af2edc6e21760c0279e34a4e3a64e7a4a54453a7ae9c03a5b7a07ac"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceTransport._evaluateOnFallbackLibrary (cognitive 23): VmServiceTransport._evaluateOnFallbackLibrary has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 5, loops 1 (2 pts), error handling 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d460a56af3d1b8eaa5e5f90dd0230cc2176ad1893b96091a4636b344f00724"}},{"ruleId":"D2","level":"warning","message":{"text":"DevToolsConnectionHostState.handleDtdVmEvent (cognitive 23): DevToolsConnectionHostState.handleDtdVmEvent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6 (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":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7081e53d84955e869b3f14b5b2bb47def35a0d1eb64c5d8a3d28ffbe18d6ffe"}},{"ruleId":"D2","level":"warning","message":{"text":"RohdDesignCommandShell.complete (cognitive 23): RohdDesignCommandShell.complete has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, ternaries 7 (9 pts), if/else 2 (3 pts) (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":"lib/src/diagnostics/design_command_shell.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00a7139521c62a5655a6204e6c6ac375b250027cc2b4bc2c143edf5e2fba855"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._pickNames (cognitive 23): SynthModuleDefinition._pickNames has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 10, 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d69bac52deec2a073fc9f8e1e5c83027b9aea2c8dbb164dc3a296cc40519940"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicValue.compareTo (cognitive 23): LogicValue.compareTo has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 9 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/values/logic_value.dart"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"144223cf1be38c37d7922f6d0e494eb6683513d68031958f4415bc9eb932285d"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceNavigationService._extractPrefix (cognitive 22): SourceNavigationService._extractPrefix has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8008be74e5fcb80e679ecf89eb00e6c0d01464b002af89beb62ad8a4405abc9"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceTreeDataSource.evalModuleTree (cognitive 22): VmServiceTreeDataSource.evalModuleTree has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (7 pts), loops 2 (5 pts), error handling 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51a252955a3919a1c8836b0af197be21d65201b77ddf19d8df2f4beec436549"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceTreeDataSource.fetchModuleSchematic (cognitive 22): VmServiceTreeDataSource.fetchModuleSchematic has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 6, loops 1 (2 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccffb7ffe07cb353522cb4fdf4d53a5d2d784a62bf576f49797b31a7b0414a9c"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCSynthesisResult._constLit (cognitive 22): SystemCSynthesisResult._constLit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (7 pts), boolean chains 1 (nesting depth added 11). 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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42922364445347bc78acf6a2ae60fa0ecb0f7a1a2807f61d669c5cb73544895"}},{"ruleId":"D2","level":"warning","message":{"text":"_SynthLogicSourcePicker._chooseSource (cognitive 22): _SynthLogicSourcePicker._chooseSource has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"75edc6efda6118b47134bc68dced7372ef0e00f1f57723c2e31c4d1e1e4d86c0"}},{"ruleId":"D2","level":"warning","message":{"text":"HierarchyService._searchSignalsRecursive (cognitive 22): HierarchyService._searchSignalsRecursive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 4 (6 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":"packages/rohd_hierarchy/lib/src/hierarchy_service.dart"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7748ad41cd9a160eef2c1a6dd24c4c246712059d3f766a251206ac39c91069"}},{"ruleId":"D2","level":"warning","message":{"text":"FstBlockReader._readBlockImpl (cognitive 21): FstBlockReader._readBlockImpl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 9, loops 1, ternaries 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":"lib/src/fst/fst_block_reader.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16f2674e2ef0e4b0dcfa70d94aaabeeb15e749a16a451bf132a4d01d766ef27"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistModuleTranslation._emitDynamicSynchronousResetFlipFlop (cognitive 21): NetlistModuleTranslation._emitDynamicSynchronousResetFlipFlop has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (8 pts), loops 1, ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_module_translation.dart"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"77265f09352e428ff17e0ad72615534074c267c651e126b8004ff838f1a2a937"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCSynthesisResult._groupArrayElementsByParent (cognitive 21): SystemCSynthesisResult._groupArrayElementsByParent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"57935a434315da1ef42dae58591f1be10df3e01dd4da99c323373a4d9aa12722"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceTransport.resumeFetches (cognitive 20): VmServiceTransport.resumeFetches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (6 pts), boolean chains 2, error handling 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b26aaa340dd311ddec648897ad8224aa5c5ff591d84616d477705cc924401d5"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceWaveformDataSource.resumeFetches (cognitive 20): VmServiceWaveformDataSource.resumeFetches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (6 pts), boolean chains 2, error handling 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13611ea3dbd874ef9f1c57ed1cb97be95755086c1602f22d1be7a93299ccec7"}},{"ruleId":"D2","level":"warning","message":{"text":"DevToolsConnectionHostState._checkVmLiveness (cognitive 20): DevToolsConnectionHostState._checkVmLiveness has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9 (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":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fc40ceba761c58fc56b178108a9c6126c5655795127378a3ca66c335b644b1"}},{"ruleId":"D2","level":"warning","message":{"text":"_StandaloneDevToolsPageState._evaluateForDetailsPane (cognitive 20): _StandaloneDevToolsPageState._evaluateForDetailsPane has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"110557ff14c4deeb4335d1d04225d0b1b305883ceffbeacf000ccc6d3623990b"}},{"ruleId":"D2","level":"warning","message":{"text":"WaveformDataService._mapLogicObjects (cognitive 20): WaveformDataService._mapLogicObjects has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 4, ternaries 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":"lib/src/diagnostics/waveform_data_service.dart"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"faad31d00f603de212a449dfbc6653777dc8a2914e0a98d018b35f32d2c30aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistPasses._sliceOutputConsumedOutside (cognitive 20): NetlistPasses._sliceOutputConsumedOutside has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_passes.dart"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"244e498d2bd5cc9bd3679edc0e8059e8b4c7eec096c6a53f299322985d5128ad"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthLogic.tryMerge (cognitive 20): SynthLogic.tryMerge has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 7 (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":"lib/src/synthesizers/utilities/synth_logic.dart"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c42c10060083ed5148f3c11eeacf7ee151061c31671e192398f5f23a9812152"}},{"ruleId":"D2","level":"warning","message":{"text":"Vector._toTbVerilog (cognitive 20): Vector._toTbVerilog has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (8 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":"lib/src/utilities/simcompare.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d2cf17cc03e988d50176e967dd1b54b23ddb10855f062636042c6570009f53"}},{"ruleId":"D2","level":"warning","message":{"text":"SimCompare._vectorTestbenchContents (cognitive 20): SimCompare._vectorTestbenchContents has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (7 pts), boolean chains 3, ternaries 2 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/simcompare.dart"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"0952a477283c529693e234b25f873c718da648c6394fba23cf330b70fca62b51"}},{"ruleId":"D2","level":"warning","message":{"text":"SimCompare.iverilogVector (cognitive 20): SimCompare.iverilogVector has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/simcompare.dart"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"903584e1a702aa8678083d9822c9a7fe6435029973bbc828e25a79f91588cbd0"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceSignalValueSource.getCurrentTime (cognitive 19): VmServiceSignalValueSource.getCurrentTime has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cad972c41363238630dc82f9f22b629e330b26939a2d22343b8a43169733c2"}},{"ruleId":"D2","level":"warning","message":{"text":"WellenBackedWaveformDataSource.getSnapshotCompact (cognitive 19): WellenBackedWaveformDataSource.getSnapshotCompact has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac44c23b991bf2350b4c6a34bc9de73539ffc0561b5f0843b403b83b1fb3b85"}},{"ruleId":"D2","level":"warning","message":{"text":"_WaveformViewerWrapperState.build (cognitive 19): _WaveformViewerWrapperState.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (17 pts), boolean chains 1, if/else 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":"rohd_devtools_extension/lib/rohd_devtools/ui/waveform_viewer_wrapper.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b907305bb13973524fdf0956d8718b16d99942836601d9db1193a59f14141af5"}},{"ruleId":"D2","level":"warning","message":{"text":"Concat.inlineVerilog (cognitive 19): Concat.inlineVerilog has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (7 pts), boolean chains 2, 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":"lib/src/modules/bus.dart"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1edbb10f55203ecbc23a71102bd8bd689b866ddbc18b1754f8b4d789483386"}},{"ruleId":"D2","level":"warning","message":{"text":"_TypedLogicArrayBuild.build (cognitive 19): _TypedLogicArrayBuild.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, ternaries 7, 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":"lib/src/signals/typed_logic_array.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83e453a77ae904f7f5b87e0f733ae91af47a7124f689ee1bc270ef03146e0ce"}},{"ruleId":"D2","level":"warning","message":{"text":"_TypedLogicArrayBuild._sameElementLayout (cognitive 19): _TypedLogicArrayBuild._sameElementLayout has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (7 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/signals/typed_logic_array.dart"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8952e0f3c7b4880926dc23314a48f9acd009cc0d052d465ae348bb5e560c56f1"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistService._connectionsForBit (cognitive 19): NetlistService._connectionsForBit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_service.dart"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f42d22c748784cea805f4b2a498a395c8a8eb69f35d61b0de95b05a347052a2"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._sharedSubmoduleMappingSignals (cognitive 19): SynthModuleDefinition._sharedSubmoduleMappingSignals has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (9 pts), boolean chains 6, if/else 2 (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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"694ba411395e2fc6077d0eaa795b774d18a7655f4d0c7e0455e7b16982e29a04"}},{"ruleId":"D2","level":"warning","message":{"text":"SignalValueFormatRegistry._waveformValue (cognitive 19): SignalValueFormatRegistry._waveformValue has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 10 (12 pts), boolean chains 2, error handling 2, match/switch 1 (2 pts), if/else 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/lib/src/signal_value_format_registry.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3c07c20a1200c6ec626861af214f67cc55991a71d87685870264ae61ceb54c"}},{"ruleId":"D2","level":"warning","message":{"text":"FlcExtensionClient.queryModule (cognitive 18): FlcExtensionClient.queryModule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 2, loops 1 (2 pts), error handling 1, ternaries 1 (nesting depth added 9). 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":"rohd_devtools_extension/lib/rohd_devtools/services/flc_extension_client.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6a1892f9b48742a437955b46a02206030b79b778fcf533aac2db20c02216ef"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceNavigationService._lookupSignalViaDtd (cognitive 18): SourceNavigationService._lookupSignalViaDtd has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (3 pts), error handling 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7590362c2e50577737b322e12d9631ca42b1e2c8a3fcb563170ea1b89c7503"}},{"ruleId":"D2","level":"warning","message":{"text":"WellenBackedWaveformDataSource.getSnapshot (cognitive 18): WellenBackedWaveformDataSource.getSnapshot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 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":"rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"02804b6c421ba24b68cbd6885aba4fac575acfed8843dc4f5488904810c73f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"_SignalTableState._collectSubFieldRows (cognitive 18): _SignalTableState._collectSubFieldRows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 5 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"9800efc7dabbd07eb1fefca745e820ff9c62db2e5bb567c0f7634c255c4cc81c"}},{"ruleId":"D2","level":"warning","message":{"text":"_StandaloneDevToolsPageState._childInstancePaths (cognitive 18): _StandaloneDevToolsPageState._childInstancePaths has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, boolean chains 2, ternaries 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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b60b505c2d5494bd89b5be11f3e66d20ec9ab0920317854539e12c353468069"}},{"ruleId":"D2","level":"warning","message":{"text":"IterableRemovableQueue._runPatrol (cognitive 18): IterableRemovableQueue._runPatrol has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 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":"lib/src/collections/iterable_removable_queue.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"267dc5ca5ccc854881001be5ed0397b61a0e44f373932611913667c6b4773b91"}},{"ruleId":"D2","level":"warning","message":{"text":"FstBlockReader._parseOffsetChain (cognitive 18): FstBlockReader._parseOffsetChain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (6 pts), boolean chains 2, ternaries 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":"lib/src/fst/fst_block_reader.dart"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f358ae26307cffc919f9447452ef7906aabbe99ac463defb2da4fb7b1d2ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"Module.addTypedInput (cognitive 18): Module.addTypedInput has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 8. 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":"lib/src/module.dart"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a94893645885328d07bce3cd35a9c198c0b8bdd20a65fb4d5dbb185c998e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"Simulator.run (cognitive 18): Simulator.run has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, error handling 2 (4 pts), loops 4, if/else 3 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/simulator.dart"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba78c09830a57ec2e1754768b1c942a87cfcb7bfb437625e08744d357bdfd92"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCSynthesisResult._findArrayElementsWritten (cognitive 18): SystemCSynthesisResult._findArrayElementsWritten has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edeff551dbd8747b3bc33aec38146e8963aebbd52a2722b78e9d85feeced1d0"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCSynthesisResult._buildWireAssignments (cognitive 18): SystemCSynthesisResult._buildWireAssignments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de233f1c9fe841b152dcd7b83cd7e726072dc2d3d83cd4ebbe93806dd2369bc"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCSynthesisResult._caseItemCondition (cognitive 18): SystemCSynthesisResult._caseItemCondition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, ternaries 1 (4 pts), 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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b2f56d2e88c9e6a628f079141c72b0110fd239f2118c5fb29672ad69e35751"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceTracer.recordModule (cognitive 18): SourceTracer.recordModule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts), boolean chains 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2fd1a43b390c39d6b045c9c592059af285a0990632e6fcf24b374f5b52379a"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceTracer._parseFrames (cognitive 18): SourceTracer._parseFrames has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, boolean chains 1, ternaries 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":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"29697f39c29c450560bea73bdd1f5e5abcf5da068272ad23a46044fd2971f6de"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCFfiCosim._compileAndLoad (cognitive 18): SystemCFfiCosim._compileAndLoad has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/systemc_cosim_ffi.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51bcbc2f0f4a081e79c2dd5aa47e7e40e58b2940d5adf7beb2d82d13237f623"}},{"ruleId":"D2","level":"warning","message":{"text":"_SystemCSimCompare.cleanupSystemCCache (cognitive 18): _SystemCSimCompare.cleanupSystemCCache has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 3, loops 1 (3 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/systemc_simcompare.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6131a864de388e6ddc4aa78df37b15fcbad9a336b7e1c0a6945c8f3578aa9b24"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceNavigationService._sendGoToSource (cognitive 17): SourceNavigationService._sendGoToSource has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 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":"rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"9049d77206a9281a5deb217505d94cc255030d6a59b57cd4826a25036730d4a3"}},{"ruleId":"D2","level":"warning","message":{"text":"VmServiceTreeDataSource._parseResult (cognitive 17): VmServiceTreeDataSource._parseResult has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2 (5 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f868e6e5d76991f2d8f8ca5951d67abf7d14c480b5e3cef157014f8f6395408"}},{"ruleId":"D2","level":"warning","message":{"text":"_SignalTableState._onRowTap (cognitive 17): _SignalTableState._onRowTap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, ternaries 2 (4 pts), loops 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":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6bfa51d60df4588965459a1ff8cb5130bb9fd89c78a5907ea50bb700081f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"IterableRemovableQueue.iterate (cognitive 17): IterableRemovableQueue.iterate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 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":"lib/src/collections/iterable_removable_queue.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6423759988eea5d4061771965bb407fc2badcf5a3550e20d0ba93143a97e81"}},{"ruleId":"D2","level":"warning","message":{"text":"Sequential._execute (cognitive 17): Sequential._execute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (7 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":"lib/src/modules/conditionals/sequential.dart"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"27284c12c5d2e15a77e5839acc03e835b7e1d9ff7cb7f8998d1911f67c0614ff"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemVerilogSynthModuleDefinition._expandNestedUnpackedArrayAssignments (cognitive 17): SystemVerilogSynthModuleDefinition._expandNestedUnpackedArrayAssignments has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), loops 2 (3 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"107ec61160569a230732961830edc03b0e294c43fd571a43e0d0029ab9c090eb"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._preservesWholePackedArray (cognitive 17): SynthModuleDefinition._preservesWholePackedArray 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). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":3950}}}],"partialFingerprints":{"codehealthFindingId/v1":"0411bcc0fb2735a6e41db6edb01bbb3d58b7b9d351941201fa79205855ad8695"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCFfiCosim._pushInputs (cognitive 17): SystemCFfiCosim._pushInputs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/systemc_cosim_ffi.dart"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"a325cca6b772b82c3524c89bba996fe4df45b7b058f76d7dbff8e829cd5bcd74"}},{"ruleId":"D2","level":"warning","message":{"text":"_FilledLogicValue._and2 (cognitive 17): _FilledLogicValue._and2 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 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":"lib/src/values/filled_logic_value.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5fc513a650846b2e59d497ecfecd868a485c3a6dd0f41d87f775e515e063e5"}},{"ruleId":"D2","level":"warning","message":{"text":"SignalWaveformRepository.streamWaveformData (cognitive 17): SignalWaveformRepository.streamWaveformData has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_waveform/lib/src/waveform_repository.dart"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7abc532b12f3ff39a4c2f3e5f41f57cc14411fa84156d25e7f90d121ac063e"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistEvaluator.isComputed (cognitive 16): NetlistEvaluator.isComputed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 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":"rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad4b19ba6db6b705d9ab2519b580c284a3a006aead3d4bb3de5925d9cae9630"}},{"ruleId":"D2","level":"warning","message":{"text":"NetlistEvaluator._collectEvaluablePaths (cognitive 16): NetlistEvaluator._collectEvaluablePaths has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, 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":"rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd782ecc55b7c2a6500ef3ca09b6a5c3e945e5064521c8f796313bb600b3863"}},{"ruleId":"D2","level":"warning","message":{"text":"_RohdDesignShellState._complete (cognitive 16): _RohdDesignShellState._complete has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, error handling 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/rohd_design_shell.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92b46581e1515c61e7a8d8f206e8e313036338397e5e63d8714ab4b198f5798"}},{"ruleId":"D2","level":"warning","message":{"text":"InProcessRohdDesignSession._matchingPorts (cognitive 16): InProcessRohdDesignSession._matchingPorts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 4, 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":"lib/src/diagnostics/in_process_design_session.dart"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d340038b450753bb10e2a62e87e65a402a2973cbca3807ac325190d9f69b6a04"}},{"ruleId":"D2","level":"warning","message":{"text":"FstBlockReader._decodeFrame (cognitive 16): FstBlockReader._decodeFrame 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":"lib/src/fst/fst_block_reader.dart"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"170231a6040c152c3eecaec1a855512f7470a1a18d01a79b3486fcb9f2a66866"}},{"ruleId":"D2","level":"warning","message":{"text":"Module.addTypedInOut (cognitive 16): Module.addTypedInOut has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/module.dart"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"884ed1594a2e9085a9484e8615f8193204a751e5b06cfbf51d222540d14e9baa"}},{"ruleId":"D2","level":"warning","message":{"text":"FlipFlop.scalar (cognitive 16): FlipFlop.scalar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 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":"lib/src/modules/conditionals/flop.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8409b1952d5f7b77cee289354e9b1c5c388837ac207c1f4fe71cc86f33bb3d92"}},{"ruleId":"D2","level":"warning","message":{"text":"If.processSsa (cognitive 16): If.processSsa has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (7 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/modules/conditionals/if.dart"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47037ba7f6e4295305a2660d3110d754cd95c8a5c5b2c9602e14892a8bf454e"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemVerilogSynthModuleDefinition._dropEmptiedArrays (cognitive 16): SystemVerilogSynthModuleDefinition._dropEmptiedArrays has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 4, loops 3 (4 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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e78da8693d0a77227bd21f9dcfa3f26f1a35258c715db7863eadb509ae0c073"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._addSimpleRangeRun (cognitive 16): SynthModuleDefinition._addSimpleRangeRun has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (4 pts), loops 3 (4 pts), ternaries 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4c18ea179acddc9e853aa15878577ce3807aff65f374a9135d9cdc1f18e85b"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthModuleDefinition._isRangeChainIntermediate (cognitive 16): SynthModuleDefinition._isRangeChainIntermediate has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (6 pts), loops 1, ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":4216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5b8973ec21fb4a7638e174bd9676b6724028c334c2488337440421ced24896"}},{"ruleId":"D2","level":"warning","message":{"text":"_FilledLogicValue._triState2 (cognitive 16): _FilledLogicValue._triState2 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (16 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":"lib/src/values/filled_logic_value.dart"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"28de859803877e7497a8b4201828718db94c199b3cb02c4eea32b27165c4518d"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicValue._shift (cognitive 16): LogicValue._shift has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), 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":"lib/src/values/logic_value.dart"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"c388d00481ed24e768f669d4f464455a51051a995f3295a146b5aac10a66b8da"}},{"ruleId":"D2","level":"warning","message":{"text":"_MarkdownHelpButtonState._loadContent (cognitive 16): _MarkdownHelpButtonState._loadContent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (4 pts), loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aee9ffecec5ff9a235924d29241797eed2469db712535ed8ac6bf5f28e92c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"flc_service.lookupSignalInModule::walkNode (cognitive 16): flc_service.lookupSignalInModule::walkNode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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":"rohd_extension/src/flc_service.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"14be35b57a69dc0d7e549c83d8b760dac352cc184b1841d75ba52a310a767db5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SynthModuleDefinition: ClassTooLong \u2014 2818 significant lines (blank, comment-only and punctuation-only lines excluded), 94 methods. The bar is 400 significant lines; this is 2418 over it, 7.05\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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"52300306f81b36b4ba80edfa99acc15ea865f2c528f98f362ee5968c4a210a5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utilities/synth_module_definition.dart: FileTooLong \u2014 2922 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: SynthModuleDefinition (197-4522). The bar is 500 significant lines; this is 2422 over it, 5.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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33af6cad5eaf8e80000637e89cf25c80d52eeb187759b958c90d016a8196ae8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetlistSynthesizer.synthesize: MethodTooLong \u2014 synthesize runs 580 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 480 over it, 5.80\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":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab07a6763366825a12e450f6973a0607629a6afa197d9f342ce26307a76cd005"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/standalone_app_shell.dart: FileTooLong \u2014 2248 significant lines (blank, comment-only and punctuation-only lines excluded), about 69% of them inside a single declaration: _StandaloneDevToolsPageState (156-2785). The bar is 500 significant lines; this is 1748 over it, 4.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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b353cb6cd40df5a5ade4e70b4523f6ac01fd779a34d0f72246f356a0c9fddd1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _StandaloneDevToolsPageState: ClassTooLong \u2014 1541 significant lines (blank, comment-only and punctuation-only lines excluded), 67 methods. The bar is 400 significant lines; this is 1141 over it, 3.85\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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"766d58ce1063f7e2608f009bdc1ea1ef16de1e248b6e826ba666f809db5d9347"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LogicValue: TooManyMethods \u2014 101 methods. The bar is 30 methods; this is 71 over it, 3.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/values/logic_value.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e004cb9b0a7abc97ed763065578e59c81efa0ce48d136224f9b56e9121c473e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LogicStructure: TooManyMethods \u2014 94 methods. The bar is 30 methods; this is 64 over it, 3.13\u00D7 the bar. Most of these members implement src.Logic (71 of 88 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":"lib/src/signals/logic_structure.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6a63b4026ff43c55482132d47a2ea286ddcfa0830eef6da6664589959a5207"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SynthModuleDefinition: TooManyMethods \u2014 94 methods. The bar is 30 methods; this is 64 over it, 3.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa9c57751872beb9ebcb6436b31bd521ab5d2429eaec11bad39650ba8cef42e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SystemCSynthesisResult: ClassTooLong \u2014 1189 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. The bar is 400 significant lines; this is 789 over it, 2.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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1fe2c11b0fe64ea367323b36b4450ecec43175833ca515eae3b00de7d1b985"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SystemVerilogSynthModuleDefinition: ClassTooLong \u2014 1113 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 713 over it, 2.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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab52c8b7bbccefe32acf93aad63bc1298f7d3569f3de613a1e326dd7e003550"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Logic: TooManyMethods \u2014 82 methods. The bar is 30 methods; this is 52 over it, 2.73\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":"lib/src/signals/logic.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"625b998d08f1530b0deadd4fb43f7a5a42a6a652fd18a5384ba2b1f50e186a10"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetlistCellMapper._registerDefaults: MethodTooLong \u2014 _registerDefaults runs 269 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 169 over it, 2.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":"lib/src/synthesizers/netlist/netlist_cell_mapper.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ba96dd121335f3049b3ea2ff7f5aa21ff885d2e8ea4773d7383da796ab8269"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _VmConnectionFormState.build: MethodTooLong \u2014 build runs 263 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 163 over it, 2.63\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":"rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d1ab8bb0a1c6e43dbea0d86dcab426a81d2f15a925b3ad28110cb072eefbb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: systemc/systemc_synthesis_result.dart: FileTooLong \u2014 1282 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: SystemCSynthesisResult (22-1957). The bar is 500 significant lines; this is 782 over it, 2.56\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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc9f0c4c15345bd842d584f1f588ced4b62ce6dc0bb79c94658fa28788d619d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SystemCSimCompare.buildSystemCVectorExecutable: MethodTooLong \u2014 buildSystemCVectorExecutable runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\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":"lib/src/utilities/systemc_simcompare.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b0cd1a9e55488e0bc8046bbd57b66880eb1c7c6d5891e02cd631b401a663e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: systemverilog/systemverilog_synth_module_definition.dart: FileTooLong \u2014 1173 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: SystemVerilogSynthModuleDefinition (19-1874). The bar is 500 significant lines; this is 673 over it, 2.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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f36e817c33116d6cccd84a47dc93e36a7b8aecb0d2e16754574a8f958a6ea1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SystemCSynthesisResult._buildProcesses: MethodTooLong \u2014 _buildProcesses runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bd655e699cf7b52781259064717d7ee9af55dfc350b07ba6ae218a642a3cfe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DevToolsConnectionHostState: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"986b94f4b517db89649a0dde45bcb5adbb8d58c027999f0534a75081afc068c2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogicValue: ClassTooLong \u2014 913 significant lines (blank, comment-only and punctuation-only lines excluded), 101 methods. The bar is 400 significant lines; this is 513 over it, 2.28\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":"lib/src/values/logic_value.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5049abb8198091ccd58fa2b6d41a7d049961616ea89887eb0c3317a221c9c3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SourceTracer: ClassTooLong \u2014 912 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 512 over it, 2.28\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":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7699a3a990d853e7e95a1f00ac7278730b17a5033d21badef9057bd6183c6d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _StandaloneDevToolsPageState: TooManyMethods \u2014 67 methods. The bar is 30 methods; this is 37 over it, 2.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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fbe28a69edd5d356cd3688ee8b8a2b70223ac2bbac1bccf3ce6d7760d4eda6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/signal_table.dart: FileTooLong \u2014 1109 significant lines (blank, comment-only and punctuation-only lines excluded), about 75% of them inside a single declaration: _SignalTableState (140-1416). The bar is 500 significant lines; this is 609 over it, 2.22\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b2008927940d291141194870b9ecc1a6c49979870920ff290a7c7c2206b0b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/netlist_evaluator.dart: FileTooLong \u2014 1080 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 580 over it, 2.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":"rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be864cca03e64572728c2c000080404c1957a79c17fa89b34bb9b62e2ee1ce8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utilities/source_tracer.dart: FileTooLong \u2014 1042 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: SourceTracer (86-1788). The bar is 500 significant lines; this is 542 over it, 2.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"123bce7c9a1392a009395869f537157ab86655c5042b3c8f86acb9f5654e675d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _SignalTableState: ClassTooLong \u2014 831 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 431 over it, 2.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"32afa85b15a98e2964d0d46e66eeb572b4ef267dd2f54e6c4cf857d1de312f20"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Module: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/module.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5821c604964c73265a74d6d961022db07e54dbd4b41428ae7ef26124a33fec"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WaveformDataService: ClassTooLong \u2014 776 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 376 over it, 1.94\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":"lib/src/diagnostics/waveform_data_service.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdcfc34639bd96f86544675b24355a7393bca097d5b12c544af471be9d7cc2a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats: MethodTooLong \u2014 _collapseFullPackedArrayConcats runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"b029f346da954dcdcab3fd6b3126a11c837186748827d4dcd3107f9f7f9863a7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NetlistModuleTranslation: ClassTooLong \u2014 759 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 359 over it, 1.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_module_translation.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"069ce5d360e19b2ad7f2788e62b908f917179e60cfce882f3957264765512add"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: values/logic_value.dart: FileTooLong \u2014 932 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: LogicValue (19-1852). The bar is 500 significant lines; this is 432 over it, 1.86\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":"lib/src/values/logic_value.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc65b6a2e9a16764fd0eaeb62069815956a58a16f0b05fa8a8275c8099fea9e8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BaseSignalWaveformApi: ClassTooLong \u2014 715 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 315 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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acf792f4441acd60858fb285f8b2a492c07a07d2d00434ef754a45c6b761dce"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NetlistSynthesizer: ClassTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 312 over it, 1.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":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e46f8bdaf84ed81033ed515e6005d615f7a6949179f971a75b41ee763092035"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DevToolsConnectionHostState: ClassTooLong \u2014 704 significant lines (blank, comment-only and punctuation-only lines excluded), 70 methods. The bar is 400 significant lines; this is 304 over it, 1.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":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"005aae379e6cfa0ec98e6f7089aee40a57d8fa38678c228115fcd6f606e6dcd0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SystemVerilogSynthModuleDefinition._collapseAggregateConnections: MethodTooLong \u2014 _collapseAggregateConnections runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb2257bc703a61b3406b8cc6e06ad32a38efa2cceaeb56f8424d1c236c2d0c4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Module: ClassTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded), 60 methods. The bar is 400 significant lines; this is 288 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":"lib/src/module.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8fef42111be6b4f6eec92ec9f955919bb65e1bac92cf3a47d4e03b4cfc91ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/devtools_connection_host.dart: FileTooLong \u2014 851 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: DevToolsConnectionHostState (294-1530). The bar is 500 significant lines; this is 351 over it, 1.70\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":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"200318ce3d564409a26b9082350590304ae3083ef80174ddc548bb8f9be2532e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SystemCSynthesisResult: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9d3f64d6d1beb9a9c5df8420c348d527cda3c5f119625db398276504481336"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetlistModuleTranslation.processNetnames: MethodTooLong \u2014 processNetnames runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\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":"lib/src/synthesizers/netlist/netlist_module_translation.dart"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"7001fe32e3119daf13ae19e26dd653296f239d4db059e4e723f6fb8244ab7b7f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SynthLogic: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\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":"lib/src/synthesizers/utilities/synth_logic.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee2ef2700ef20adbdadf56f047d7ab2e8a6b1c42979783bef60e32b8736d20b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _SystemCSimCompare: ClassTooLong \u2014 661 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 261 over it, 1.65\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":"lib/src/utilities/systemc_simcompare.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6a20f99901a62507ed138ed70d43ee522454157b1c240b02f528ca526c31eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/conditional_completions.ts: FileTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 325 over it, 1.65\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":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ac4c62c6917ce18bd6b5cbfd2d211d453828039f417ed75adb4e32857f3097"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/waveform_data_service.dart: FileTooLong \u2014 819 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: WaveformDataService (121-1546). The bar is 500 significant lines; this is 319 over it, 1.64\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/diagnostics/waveform_data_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"293157a5069bf37f60756199c90bcf516ab3e58fcf3ef860c8e6fe7be816ebad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utilities/synth_logic.dart: FileTooLong \u2014 812 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 312 over it, 1.62\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":"lib/src/synthesizers/utilities/synth_logic.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"555eb063366665bbd74a07f79c3d21e4beced55bca65bfab1e0b0f9ffd589c71"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _StandaloneAppBarState.build: MethodTooLong \u2014 build 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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":2993}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd97320f69722ed030cd464813ff80600d652e269f1c44f5b5269b22500dc69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SynthModuleDefinition._pruneUnused: MethodTooLong \u2014 _pruneUnused 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf550930a8402b4a804a9ffcab7defff55e78f252f60e5b76ceaea6454a3adb6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SignalTableState._collectSubFieldRows: MethodTooLong \u2014 _collectSubFieldRows 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":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02a6a424d7ad8e3ae77cc85c17b6dcc7d275defd9d518d1424eca273dfbcc8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: netlist/netlist_module_translation.dart: FileTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: NetlistModuleTranslation (25-1085). The bar is 500 significant lines; this is 272 over it, 1.54\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":"lib/src/synthesizers/netlist/netlist_module_translation.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"347d31b9f3ff70ead0e0db0f3ff91d74015e92c1c67477d618ddc99551edab47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SystemVerilogSimCompare.iverilogVector: MethodTooLong \u2014 iverilogVector runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\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":"lib/src/utilities/systemverilog_simcompare.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4276fb24abc1a2a6343ca92dd7a2cd36cd9de6a3ac866b25fbe0aa6115701a41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utilities/simcompare.dart: FileTooLong \u2014 747 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 247 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/simcompare.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5549a0e067d881fbda5f89a97c6602efc412a01702aef84cf2bf459bca124f34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CrossProbeStatusButtonState._showFormatsMenu: MethodTooLong \u2014 _showFormatsMenu runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":3387}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c7e6138abd53a25aae131c8300ee75428c2b031e3ddd26dcc7130dd4c2bda3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: netlist/netlist_synthesizer.dart: FileTooLong \u2014 726 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: NetlistSynthesizer (45-1267). The bar is 500 significant lines; this is 226 over it, 1.45\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":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9f66a2522ddc01cd5ce8549b4f77d7af4120fe04cfaa4357dec8813dacefce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/base_signal_waveform_api.dart: FileTooLong \u2014 723 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: BaseSignalWaveformApi (32-1246). The bar is 500 significant lines; this is 223 over it, 1.45\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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"917aba27f7ab6320c1e8a16b966a8305378e8b7a61267a9bf6021381ad426fe2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SystemCSynthesisResult._gateExpression: MethodTooLong \u2014 _gateExpression 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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba257b6c909ea3e936b136d7ef54f76ea5d8eefb02588519531d1006aa470ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/module.dart: FileTooLong \u2014 708 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: Module (53-1428). The bar is 500 significant lines; this is 208 over it, 1.42\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":"lib/src/module.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eca42ddfec40df33e144d13d49040d88b01c7dceb8ff3deb33d2e9d72d40b02"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WaveformDataService: 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":"lib/src/diagnostics/waveform_data_service.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d7f7bee6dfce1826e1d0fab8ac3f1c9b0e27e69cd8c56e58cc7534d964c971"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypedLogicValueArray: 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":"lib/src/values/typed_logic_value_array.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c35d6d4e415e94972704810dea1cd09530f9e5fd8646f78076985cf85e94401"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utilities/systemc_simcompare.dart: FileTooLong \u2014 700 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: _SystemCSimCompare (15-1007). The bar is 500 significant lines; this is 200 over it, 1.40\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":"lib/src/utilities/systemc_simcompare.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e9fc2c18a5e99c15a95bbed9224f602f07866760ec57a15955dbdbbbab7883"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SignalTableState._generateSignalRow: MethodTooLong \u2014 _generateSignalRow runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\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":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ce5e91b9c90bb5695db069141f019039b124fea5317b008a0055643f8df3ee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TraceService: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/diagnostics/trace_service.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9b25f9caa3259218af7c3f3aae5f1ad6ae05bfe2230fb53b87269c369f7c37"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HierarchyService: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_hierarchy/lib/src/hierarchy_service.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"551d0a9270abb12510e29fc536f25ed7018c97b2baf8ba494a6caaf56c65414f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SignalWaveform: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_waveform/lib/src/models/signal_waveform.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4676fc21cadcbd22da8fced61f081f6a65e5382f626e4fdeabc5c08ec912a065"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SystemCFfiCosim: ClassTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 141 over it, 1.35\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":"lib/src/utilities/systemc_cosim_ffi.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c774725e7d5529bebf1d789555bdb1194148e6cf975a7b99666c8480ad3f0fe0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InProcessRohdDesignSession: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/diagnostics/in_process_design_session.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"766534f52e4acb4c6cd82413b468b948f67e1c49dc18f154663df0c7d72478d4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VmServiceWaveformDataSource: ClassTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 118 over it, 1.30\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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cda14135fe20142a9c36e7b0f56c490213b43632c6a8b0710c5da1026311d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SystemVerilogSynthModuleDefinition._inlinePackedRangesIntoSubmoduleInputs: MethodTooLong \u2014 _inlinePackedRangesIntoSubmoduleInputs 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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d14d5673bb5dd4ab6140f638686848b96523f11d3b6ced8eb3230cac6c3f99"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FstWriter: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.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":"lib/src/fst/fst_writer.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b475d02b8a2b2640790ea62b7e2c3b1bdc7e42271461252295027d3973707b1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VmServiceTransport: ClassTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 103 over it, 1.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ceea02bc9ea5ec4479821d9f2755bd9c8d54e9266ab2691def49a34ca2e5d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modules/gates.dart: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 121 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/modules/gates.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e72051d43a3d1800a47bb2bb01e581fc4dacb8079a02268047e1bc2f2a823da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BaseSignalWaveformApi.getWaveformData: MethodTooLong \u2014 getWaveformData runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd5afbdad16c74837f7ca83575215e67cebb2905e8082a3b81be2b096b5da80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _StandaloneDevToolsPageState._loadModuleTree: MethodTooLong \u2014 _loadModuleTree runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"85014843f65fdd3ae25cae49a66f58f734a105cc8ce3a192093feaca190783f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VmServiceWaveformDataSource: 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cc9ebe8f699db0c006913cb64d27f119d4405765a4e63dc2482fd041d51104"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SystemVerilogSynthModuleDefinition._forwardPassthroughElementsIntoInlineables: MethodTooLong \u2014 _forwardPassthroughElementsIntoInlineables 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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6dfae2426cf43931ec9ad5167963b7ba3ac67742eca0ebc880a6b6272f9fd7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SynthModuleDefinition._findChainableModulesToCollapse: MethodTooLong \u2014 _findChainableModulesToCollapse 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5726104ec8a94386fdc34067fe3384ca6e1e3ba88fe196b0d3857f04bc612378"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceTracer.flcHtmlViewer: MethodTooLong \u2014 flcHtmlViewer 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":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"985de45197a42ffbc843bf77f01daf94b08de1c69c7521d9be63daff2158672b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BaseSignalWaveformApi: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d75196f88da8218fd86a7e343b239892c219753dfb04f2f24c12e054edca94a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VmServiceTransport: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da4fb023e589aba7ad8c4a5facc6a724cf97f574cbea4ece2b0785c968313f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CopyableCell._showCopyMenu: MethodTooLong \u2014 _showCopyMenu 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":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c553bb4dbe195cb87b386c7c6d78ac91628a6d6d2ce28811bb9304f9b8ae5b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FstWriter: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 67 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fst/fst_writer.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8938025d5c878505dc077ece20b6de016347847124f586eac164bc3b920d7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utilities/systemc_cosim_ffi.dart: FileTooLong \u2014 580 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: SystemCFfiCosim (94-1070). The bar is 500 significant lines; this is 80 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":"lib/src/utilities/systemc_cosim_ffi.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82936067fa14996cb16bcd84adb500c85f6a5b4aa74a13b032b75bb586e64df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SynthModuleDefinition._planConcatRangeRewrite: MethodTooLong \u2014 _planConcatRangeRewrite 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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":3800}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f8229a305fcdca46f0be31607ff7446164b54bf600efec5aaf6ec6d5d0638d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetlistConstExtractor.extract: MethodTooLong \u2014 extract 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":"rohd_devtools_extension/lib/rohd_devtools/services/netlist_const_extractor.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c80986be4ba016170f5fae3155a4c0fc441800a51d4645e2473a8f9c1a88c0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NetlistPasses: ClassTooLong \u2014 462 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 62 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":"lib/src/synthesizers/netlist/netlist_passes.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9826a2cc57b8944d6973377c3e69ada68e10130ac1c9faa1fe41c9bebb593c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SystemCFfiCosim._compileAndLoad: MethodTooLong \u2014 _compileAndLoad runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\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":"lib/src/utilities/systemc_cosim_ffi.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"073ad176d5319fabd6f964333f668e02eef64affec36d45f686784445862dd57"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicValue.ofRadixString: MethodTooLong \u2014 ofRadixString 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":"lib/src/values/logic_value.dart"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73d2f5653ff761a999497810d995dbce4c88aba18493c551f4fa181c2daeaa6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetlistPasses.applyTransparentClustering: MethodTooLong \u2014 applyTransparentClustering 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":"lib/src/synthesizers/netlist/netlist_passes.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1cc15059b9af6d1fd3910022ae1135b0646792fa7fffc557193a9e0fa11d85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hierarchy_service.dart: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 58 over it, 1.12\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":"packages/rohd_hierarchy/lib/src/hierarchy_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84008a6ca9b144ece97bbaacbcfa664b29cf74c8dd74763a477fc8a6ab159dc2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TreeStructurePageState: ClassTooLong \u2014 445 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 45 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":"rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"023f783d0ac8f96561b98fba627c746c8f33ee29e2ba3f8d8c3f53fc854de384"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SourceNavigationService: ClassTooLong \u2014 444 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 44 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":"rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb313b19c0c1a6187228a6605a01490db31fe6b05909f4b3e08a9315fc45327"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicValue.of: MethodTooLong \u2014 of 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":"lib/src/values/logic_value.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f02db7b13d949c3843cdb3c6e93ab505e44b8532cecb433323c7ddf8a3e9fcc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SystemVerilogSynthModuleDefinition: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa68565d2115fba2bd06c285a7fc1fb2ddb451ac2a1da71a6bea616ef67b8929"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SignalWaveformRepository: ClassTooLong \u2014 437 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 37 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":"packages/rohd_waveform/lib/src/waveform_repository.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0804f082df6e5ca0263964124c67c6f6c01964bced25b5c8d7a8d8f413fb33bf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogicStructure: ClassTooLong \u2014 436 significant lines (blank, comment-only and punctuation-only lines excluded), 94 methods. The bar is 400 significant lines; this is 36 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":"lib/src/signals/logic_structure.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e470c098c8e0c86dafecadcd1b9bb4ddf5b86abd936894481b00881c9f1e4c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GateCatalog.GateCatalog: MethodTooLong \u2014 GateCatalog 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":"tool/catalog/gate_catalog.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e77124710449673686206be69210d52624f0d7a39291209f72f2e13c0c7c029"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fst/fst_writer.dart: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: FstWriter (198-1044). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fst/fst_writer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d358a73032b172cfb0fdc59cb72e71d8cbc1eb5bb554ba1cfb08878a5acf169f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetlistUtils.collapseAlwaysBlockPorts: MethodTooLong \u2014 collapseAlwaysBlockPorts 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":"lib/src/synthesizers/netlist/netlist_utils.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"832f91cfbc75104b4f348520b11e83135455a4638233b61ee13f1aed67672f4d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Logic: ClassTooLong \u2014 428 significant lines (blank, comment-only and punctuation-only lines excluded), 82 methods. The bar is 400 significant lines; this is 28 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":"lib/src/signals/logic.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9dbe6fd2a44a87ef3f770ba0c360f5ca68ed8b90c14e3e9aaaad1d7a46f938"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SynthModuleDefinition._collapseSimpleRangeAssignments: MethodTooLong \u2014 _collapseSimpleRangeAssignments runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8537e2b15506bb853772c780f6f5203e68ebfbcc14bb4d43ac6b2527f06a1b85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: systemverilog/systemverilog_synthesis_result.dart: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded), about 71% of them inside a single declaration: SystemVerilogSynthesisResult (78-704). The bar is 500 significant lines; this is 34 over it, 1.07\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":"lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"104c0749427ccac6f5f0868d7dc572c4becca2ee7c5214f6d64634b165f7914f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SignalWaveformRepository: 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":"packages/rohd_waveform/lib/src/waveform_repository.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"132f70e641f7bec0d2e893b7f8a8efb6b7641acb8697903c8a77bebc387de710"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SynthLogic: ClassTooLong \u2014 424 significant lines (blank, comment-only and punctuation-only lines excluded), 50 methods. The bar is 400 significant lines; this is 24 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":"lib/src/synthesizers/utilities/synth_logic.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab8a950dbce832bd5c0524e10b40ed2b96c2f213e8ca6b8d028cd8f976ae002"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SystemVerilogSynthesisResult._buildSvLineMap: MethodTooLong \u2014 _buildSvLineMap runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ef4af8f2a8274e9cc558e1c5183e7703e7a34e0ed675fc4402c9d5258cf342"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/vm_service_waveform_data_source.dart: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: VmServiceWaveformDataSource (59-1068). The bar is 500 significant lines; this is 24 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbdbe94174a0b7b3496ddd2139377079e421c164959da48565e9f662a285d8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WaveformDataService._registerNetlistInstance: MethodTooLong \u2014 _registerNetlistInstance 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":"lib/src/diagnostics/waveform_data_service.dart"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b2454b19f179ad5876c052f3251980facdc25ce49379ba1e67093647acd2da"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SourceTracer: 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":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ac810614a110e2e918d42689ba00bc1fff1edd917c8579a7075cf1a6b2d6e4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SourceNavigationService: 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":"rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"619b1e3b6dd300c195e55633a2e48a5ca62aaca6736dcb9dfc71f5f10e00e280"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/vm_service_transport.dart: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: VmServiceTransport (30-820). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba7dd11cee572332b4654c16ee65f94630d47f5e306e401dd54b26bbb20f039"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (68 shared lines): rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:42-147 | rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart:35-165 \u2014 These two members are variants of one another: 68 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bdbeb81fd67b72f8856742078f33f7bfc12dbcafddb5e4e4023ec6d914a29e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): doc/tutorials/chapter_4/basic_generation_sv.dart:24-47 | doc/tutorials/chapter_5/answers/full_adder.dart:25-48 | doc/tutorials/chapter_5/n_bit_adder.dart:22-48 | doc/tutorials/chapter_6/combinational_logic.dart:27-48 \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":"doc/tutorials/chapter_4/basic_generation_sv.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f583273c0520d03379032fb3da463bf3c172692e66cdb66799e75418493c6e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): lib/src/utilities/simcompare.dart:99-172 | lib/src/utilities/systemverilog_simcompare.dart:61-124 \u2014 These two members are one piece of code written twice and then edited apart: 64 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":"lib/src/utilities/simcompare.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff301c4e35091818d5a19c29aa6f98c4cf02dcc594de2c8f48046ee7cee39e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): lib/src/modules/conditionals/case.dart:450-524 | lib/src/modules/conditionals/if.dart:199-264 \u2014 These two members are one piece of code written twice and then edited apart: 66 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":"lib/src/modules/conditionals/case.dart"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ed424700d4776f6a17e76abbd73eb8415212be8729620023adccdaee536f39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:224-285 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:52-126 \u2014 These two members are one piece of code written twice and then edited apart: 62 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce09ff4f538ce629c7e76dc553d69028cf659721e9388592c9b0cdda74f1310"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:287-338 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:156-206 \u2014 These two members are one piece of code written twice and then edited apart: 51 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3861bac805ffa04e260e9da44d7510a259a7d16321cba3b86cd1cf9063019a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:290-337 | rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:380-428 \u2014 These two members are one piece of code written twice and then edited apart: 48 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":"rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0362de99669022713d61df81c559bb9df1beb67b060c9ca08ea19846cfb652"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:165-207 | rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:209-248 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f995fd4714454b2cf1ac028b7ffc6341147e695db149659d8e87d2aa64e35c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): lib/src/values/filled_logic_value.dart:169-201 | lib/src/values/filled_logic_value.dart:233-267 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"lib/src/values/filled_logic_value.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56f15967f1d623335bb467b7fe2c73ffe26980142abfb544e6a0737f96acb52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:254-276 | rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:452-480 \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":"rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f389afa352738deb36d0e196d61b383d53ca4922e3af34873e857e5458940d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:99-137 | rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart:1659-1690 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b0f6e6c2f9a7acba7b9fa0ebcaddce70ce10894714375d17250c508cab635c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): doc/tutorials/chapter_4/answers/exercise_2_sv.dart:33-53 | doc/tutorials/chapter_5/answers/n_bit_subtractor.dart:17-35 | doc/tutorials/chapter_6/answers/exercise_2_n_bit_subtractor.dart:76-94 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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":"doc/tutorials/chapter_4/answers/exercise_2_sv.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25f146a640fc0de7508fd59b66abac5e5e7e5920cbf416ffe27b4bdc69d1e0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/src/diagnostics/design_command_shell.dart:186-204 | lib/src/diagnostics/design_command_shell.dart:206-220 \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":"lib/src/diagnostics/design_command_shell.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43e8d06ac0051815bfe30db2bdf2eb31992221600652121da496a93b9e5a224"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/src/values/big_logic_value.dart:179-195 | lib/src/values/small_logic_value.dart:156-172 \u2014 These two members are one piece of code written twice and then edited apart: 17 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":"lib/src/values/big_logic_value.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"419a40c99752f0c579ab809f6c6eaeaf446c980ffef0ab9800fb9a2d7709cda1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:100-122 | rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:124-144 \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":"rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bcc7fd1e3ba5907db1e3ea3927e33f03ab5e9bf3724ecd03600be98a1310a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/src/diagnostics/in_process_design_session.dart:310-330 | lib/src/diagnostics/in_process_design_session.dart:332-350 \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":"lib/src/diagnostics/in_process_design_session.dart"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c085c54499b885a046b92c30d94f4ccc3d337716bf8398dd10ba952a90fc8227"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/src/signals/logic_array.dart:104-119 | lib/src/signals/logic_array.dart:121-136 \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":"lib/src/signals/logic_array.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"749d9cb146fd928a5280623a36108d9d53ff390232c9c068a40fc4d88c0193ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rohd_devtools_extension/lib/rohd_devtools/ui/module_tree_card.dart:90-104 | rohd_devtools_extension/lib/rohd_devtools/ui/module_tree_card.dart:117-136 \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":"rohd_devtools_extension/lib/rohd_devtools/ui/module_tree_card.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"de44ecd1aa1ae3531f5aeedf2f0324cd5093eaedcc020da670e49b61e65174ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): doc/tutorials/chapter_3/answers/exercise_sv.dart:15-30 | doc/tutorials/chapter_4/answers/exercise_1_sv.dart:74-90 | doc/tutorials/chapter_4/answers/exercise_2_sv.dart:65-77 | doc/tutorials/chapter_5/answers/full_subtractor.dart:22-36 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doc/tutorials/chapter_3/answers/exercise_sv.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e3c41615630a8cc112027e0dcf4fefec5037957445e5206e649b8a7bbea09d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): rohd_devtools_extension/lib/rohd_devtools/ui/details_panel_content.dart:118-143 | rohd_devtools_extension/lib/rohd_devtools/ui/platform_icon.dart:48-63 | rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:3227-3244 \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":"rohd_devtools_extension/lib/rohd_devtools/ui/details_panel_content.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a77a35d205fae569114232b958d45525cdd401d41ff89ab246135b16501484"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/src/values/big_logic_value.dart:149-158 | lib/src/values/small_logic_value.dart:126-135 \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":"lib/src/values/big_logic_value.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9c87dae1d12366ca05a820ee46571f0f16979f282522934158a355be57c7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): doc/tutorials/chapter_8/counter_interface.dart:23-42 | doc/tutorials/chapter_9/rohd_vf_example/lib/counter.dart:21-32 \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":"doc/tutorials/chapter_8/counter_interface.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacca563ff3b5a7b875269b41ae6e40d88ecc76a1ae11deb413b7fa9a0b1777e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/src/diagnostics/in_process_design_session.dart:58-70 | lib/src/diagnostics/in_process_design_session.dart:75-86 \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":"lib/src/diagnostics/in_process_design_session.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"693015179cdd9b9d72814e887159f9f50e47a88ac63ab0d86b8bb7250b619359"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/src/signals/const.dart:207-217 | lib/src/signals/const.dart:219-229 \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":"lib/src/signals/const.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bdd477a14d8b6240f20c7cba4df95b58147ade061f448d67560e555c0f5507"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/values/big_logic_value.dart:160-168 | lib/src/values/small_logic_value.dart:137-145 \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":"lib/src/values/big_logic_value.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04fb447f8c9ebd1b1a694c363986dd6cf1ac0807acf5336aff1d73358b76105"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): lib/src/signals/const.dart:165-174 | lib/src/signals/const.dart:176-185 | lib/src/signals/const.dart:187-196 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/signals/const.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fd0f797b494f0c90cc1e2b5e2121cdd732b80858643e9bd1c743735bdd958f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/src/synthesizers/utilities/synth_logic.dart:832-845 | lib/src/synthesizers/utilities/synth_logic.dart:926-939 \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":"lib/src/synthesizers/utilities/synth_logic.dart"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba1cf233491bf0c28bacf63aec9891b82669dedef4915dc054659fe1edeb4fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): lib/src/diagnostics/in_process_design_session.dart:173-189 | lib/src/diagnostics/in_process_design_session.dart:205-221 | lib/src/diagnostics/in_process_design_session.dart:237-253 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 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":"lib/src/diagnostics/in_process_design_session.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9fcb848262fe585bc97f7ecefafa42a7b2ef6c6aeb97d9577109d6c70436e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/src/values/big_logic_value.dart:211-223 | lib/src/values/small_logic_value.dart:188-200 \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":"lib/src/values/big_logic_value.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abcd10bdb78d4d67f418be8742285955debed7c80eb8ba00e234add44aa92f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): doc/tutorials/chapter_2/helper.dart:28-32 | doc/tutorials/chapter_2/helper.dart:37-44 | doc/tutorials/chapter_2/helper.dart:49-57 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doc/tutorials/chapter_2/helper.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd10d6487a83cca2b5a8ba438271d94328fb60920561a8a8252735f90be20259"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/src/signals/const.dart:127-138 | lib/src/signals/const.dart:140-152 \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":"lib/src/signals/const.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"30efa8f38bd2901d1ce9f59559459e4ca4269605830d0b27479529e63847eda3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/modules/gates.dart:222-233 | lib/src/modules/gates.dart:1023-1031 \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":"lib/src/modules/gates.dart"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c24dbf62838d65e1672a05b87594a5a38885a3503ef911c553e20b22bbdd49f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rohd_devtools_extension/scripts/fix_directives.py:11-16 | rohd_devtools_extension/scripts/fix_types.py:9-14 \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":"rohd_devtools_extension/scripts/fix_directives.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bcddbe1baa6a28fd6f07c8e6ba4a98e515efe78200e916993fc5de8e799bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/src/signals/typed_logic_array.dart:309-319 | lib/src/signals/typed_logic_array.dart:324-333 \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":"lib/src/signals/typed_logic_array.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"362d11ad4b74000f5eb09be4866b61caf538528fc578df5724e2428c70cdc482"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rohd_devtools_extension/lib/rohd_devtools/ui/devtools_help_button.dart:36-48 | rohd_devtools_extension/lib/rohd_devtools/ui/rohd_shell_help_button.dart:37-48 \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":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_help_button.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c24034a2d6523d654c27788f79c75f7883c519fdabbfa5a3508cba4f9f5ffc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/src/synthesizers/netlist/netlist_utils.dart:155-164 | lib/src/utilities/namer.dart:210-219 \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":"lib/src/synthesizers/netlist/netlist_utils.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"120c07ca8e94760a4e60a79f443ebceb0b329a16ae73a25f4a3b4448e135c380"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/diagnostics/design_command_shell.dart:348-354 | rohd_devtools_extension/lib/rohd_devtools/ui/rohd_design_shell.dart:454-460 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/diagnostics/design_command_shell.dart"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c1deb78f1362832b721f6518ca18932057160e11f9c9759d549cb1962bb12c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/signals/logic_array.dart:94-102 | lib/src/signals/typed_logic_array.dart:272-281 \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":"lib/src/signals/logic_array.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ac72223808026bd66340795783549587649dfa2105556121200f34df58da93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/synthesizers/systemc/systemc_synthesis_result.dart:60-67 | lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart:153-160 \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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ad17a1963942ff6810898849c3d9d947390418989aa8ec4b9a4c4786ee673d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): doc/tutorials/chapter_4/answers/exercise_2_sv.dart:57-63 | doc/tutorials/chapter_5/answers/full_subtractor.dart:38-44 | doc/tutorials/chapter_6/answers/exercise_2_n_bit_subtractor.dart:65-72 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doc/tutorials/chapter_4/answers/exercise_2_sv.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade5f723507e8e6e24a1cd41ae45af5c879915d8e84a4c5f25d9bfdd5473f216"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/src/values/big_logic_value.dart:225-227 | lib/src/values/small_logic_value.dart:202-204 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/values/big_logic_value.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c0578c1b1212aeb24152398bed8390eeeb5a3023cf820ada8699ded4f0bc27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): rohd_devtools_extension/lib/rohd_devtools/ui/details_help_button.dart:35-39 | rohd_devtools_extension/lib/rohd_devtools/ui/devtools_split_layout.dart:177-183 | rohd_devtools_extension/lib/rohd_devtools/ui/module_tree_card.dart:28-35 | rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:53-57 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/details_help_button.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0318698d11f10ee904ddcf0efb574ae313267fef5987c9600847f504ca5ff649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:89-129 | rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart:107-147 \u2014 before extracting anything, compare \u0060rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart\u0060 and \u0060rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:89\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":"rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4a1e05dbf7050c753430d3182c52c16bca7e4b07824458a2dfdfd96c12ca8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201330 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:242-262 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:71-100 \u2014 before extracting anything, compare \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart\u0060 and \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:242\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:70\u0060 calls \u0060debugPrint\u0060 and \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:241\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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fdf13265f188fa429746759f4d127878b7efb613d8cc9dac1caab90feb674f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:294-320 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:162-188 \u2014 before extracting anything, compare \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart\u0060 and \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:294\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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"64417de76512dfa1ef1d09c15d3a19979545fd912cacf1a13b71915e14a86035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:305-325 | rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:404-422 \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":"rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b3380a08371952cb67f24e71fdbe1a56f1d02189a83ba7c0e97825c87dbe7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): doc/tutorials/chapter_4/basic_generation_sv.dart:59-78 | doc/tutorials/chapter_5/n_bit_adder.dart:60-79 | doc/tutorials/chapter_6/combinational_logic.dart:66-85 \u2014 before extracting anything, compare \u0060doc/tutorials/chapter_4/basic_generation_sv.dart\u0060 and \u0060doc/tutorials/chapter_5/n_bit_adder.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doc/tutorials/chapter_4/basic_generation_sv.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9daa5d3a7119cb65790963425d77951d4512656bfb800a2ba59f829b684e1d0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/src/modules/conditionals/case.dart:475-494 | lib/src/modules/conditionals/if.dart:216-235 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/modules/conditionals/case.dart:475\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":"lib/src/modules/conditionals/case.dart"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3464bed989f34d286d50bdf76917ac1fc27245128bb771f150192074d78962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:528-546 | rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:569-588 \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 \u0060rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:528\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb29ea782da938f731eed93775a6f12506817ce8d88dabf8d9fde3b9cfa9334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): doc/tutorials/chapter_4/basic_generation_sv.dart:24-40 | doc/tutorials/chapter_5/answers/full_adder.dart:25-41 | doc/tutorials/chapter_5/n_bit_adder.dart:22-38 \u2014 before extracting anything, compare \u0060doc/tutorials/chapter_4/basic_generation_sv.dart\u0060 and \u0060doc/tutorials/chapter_5/n_bit_adder.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060doc/tutorials/chapter_4/basic_generation_sv.dart:24\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":"doc/tutorials/chapter_4/basic_generation_sv.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4904ad1d415e3365e2ef4d36df0c46d7477b0f0282aea111858222514ec56ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): lib/src/synthesizers/netlist/netlist_synthesizer.dart:433-448 | lib/src/synthesizers/netlist/netlist_synthesizer.dart:457-473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/synthesizers/netlist/netlist_synthesizer.dart:433\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":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f16e23e6e6951d6cea481820f60398f5979644c750250cd26ba9ecc3c296c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:131-147 | rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart:149-165 \u2014 before extracting anything, compare \u0060rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart\u0060 and \u0060rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:131\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":"rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03a126f9d494c9b2bd5600f19b9af49a26ae4f9f64c8120a41a841308ea3453"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:322-338 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:190-206 \u2014 before extracting anything, compare \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart\u0060 and \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:322\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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"701257ce651c6bdd04f8ea544dc28b5f2746a55db975e007c68602c20663fd22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/src/diagnostics/in_process_design_session.dart:426-441 | lib/src/diagnostics/in_process_design_session.dart:446-461 \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":"lib/src/diagnostics/in_process_design_session.dart"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"185a29f5a1c00d6183b3385396355b350634872f7923d1a42ff6a6a0b49515d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:191-203 | rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:230-243 \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 \u0060rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:191\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":"rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"dceef12aabe22c4923c8912c69245ff99c12d486afa0227c82ed3d938273c444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/ui/devtool_appbar.dart:150-163 | rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:3179-3191 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rohd_devtools_extension/lib/rohd_devtools/ui/devtool_appbar.dart:150\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":"rohd_devtools_extension/lib/rohd_devtools/ui/devtool_appbar.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca7273cacef6f11034646e5c8a9b0243be1a8b73b3b17aa2ce8caec96a63316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): doc/tutorials/chapter_3/answers/exercise_sv.dart:18-30 | doc/tutorials/chapter_5/answers/full_subtractor.dart:24-36 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doc/tutorials/chapter_3/answers/exercise_sv.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"31952483170e3ae5e5461830d22d4b8af9c762e1e76075d68e4f1cacfcb90008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/synthesizers/systemc/systemc_service.dart:216-228 | lib/src/synthesizers/systemverilog/system_verilog_service.dart:140-152 \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":"lib/src/synthesizers/systemc/systemc_service.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90e8d2fc15282cc54dd275ffebb95f994cca334ce7a0875fa35f967ac15e93d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:86-98 | rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:98-110 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:95\u0060 calls \u0060getSnapshot\u0060 and \u0060rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:84\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":"rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a270760614b934fd90e23f74b1e44a82f687162a221266a3341140eb5505693e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:226-238 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:289-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 \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:226\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, \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:302\u0060 calls \u0060contains\u0060 and \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:240\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0a144e8d0b7c9af2da22578ae3962aae680186b4d1fcc491844725e90ca65e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:265-276 | rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:469-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart:265\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":"rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a5f0fb73fdcec9c392d67e6ab87d8a42db0ff7ac1d48ac05d5a80eebe56e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/ui/details_panel_content.dart:211-220 | rohd_devtools_extension/lib/rohd_devtools/ui/module_tree_card.dart:46-57 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rohd_devtools_extension/lib/rohd_devtools/ui/details_panel_content.dart:211\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/details_panel_content.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b033b9c5b468d023a14082adacaf7ad96b33a4956233e0f846cf3e059714ba96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2006-2017 | rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart:477-488 \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 \u0060rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart:2006\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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f34b8ddfe7bbcebacbd82685d8c8bcf583b547d270dd92817f6601a129d8e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart:398-409 | rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart:587-598 \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 \u0060rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart:398\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":"rohd_devtools_extension/lib/rohd_devtools/ui/vm_connection_form.dart"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67bb85d166fed92c26906e4791cbecad6e9d156c6abee288605d9f08327209b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:229-239 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:292-301 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart:160-169 \u2014 before extracting anything, compare \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart\u0060 and \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:229\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, \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:302\u0060 calls \u0060contains\u0060 and \u0060rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:240\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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c3ed4cc2924775af04b9883136cf2bcb5f915271f1965d3bb33ca4d6683de7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/utilities/simcompare.dart:762-772 | lib/src/utilities/systemverilog_simcompare.dart:222-232 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/utilities/simcompare.dart:762\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":"lib/src/utilities/simcompare.dart"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b4d3b0deabb403c669f19791e0cdd6f23269827f6c4ea40c5b533a53bbecc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/utilities/source_tracer.dart:678-688 | lib/src/utilities/source_tracer.dart:691-701 \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. 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":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"2880478096afbbd1de714473c6fb1ba34fbf1fd8bdb7ad35dbc5567647df86bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/values/filled_logic_value.dart:191-201 | lib/src/values/filled_logic_value.dart:221-231 \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 \u0060lib/src/values/filled_logic_value.dart:191\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":"lib/src/values/filled_logic_value.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b92ce724fc1cf9fb23b94945f7a5960765df93b6b4224dd65077c4731d055c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart:157-167 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart:244-254 \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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2f702df06ec4a4f86e359289c0d9702e65584f3947b8776e7b79a761884230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): doc/tutorials/chapter_4/basic_generation_sv.dart:28-37 | doc/tutorials/chapter_5/answers/full_adder.dart:29-38 | doc/tutorials/chapter_5/n_bit_adder.dart:26-35 | doc/tutorials/chapter_6/combinational_logic.dart:32-41 \u2014 before extracting anything, compare \u0060doc/tutorials/chapter_4/basic_generation_sv.dart\u0060 and \u0060doc/tutorials/chapter_5/n_bit_adder.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060doc/tutorials/chapter_4/basic_generation_sv.dart:28\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doc/tutorials/chapter_4/basic_generation_sv.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d34e618928551fc6871994e58abcf7fe6a88b452170a885d06381bdf531099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): doc/tutorials/chapter_5/answers/n_bit_subtractor.dart:17-26 | doc/tutorials/chapter_6/answers/exercise_2_n_bit_subtractor.dart:76-85 \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 \u0060doc/tutorials/chapter_5/answers/n_bit_subtractor.dart:17\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":"doc/tutorials/chapter_5/answers/n_bit_subtractor.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"22de8f4efd3f6dee17b694ec5f2ad2a0e8ec95d291d569ebf5b9d05c28a3e69b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/synthesizers/netlist/netlist_utils.dart:112-121 | lib/src/utilities/namer.dart:166-175 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/synthesizers/netlist/netlist_utils.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76c92de6783b6ab131f570a12118ca069317417bc1a305fd45835d9b7887db3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:71-80 | rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart:89-98 \u2014 before extracting anything, compare \u0060rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart\u0060 and \u0060rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:71\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, \u0060rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart:87\u0060 calls \u0060Duration\u0060 and \u0060rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart:70\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":"rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b64e55ea3ea8a2d2e6c988ddf124edd7b905798d003c8187cbd40124f2dae36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/ui/waveform_viewer_wrapper.dart:216-225 | rohd_devtools_extension/lib/rohd_devtools/ui/waveform_viewer_wrapper.dart:254-262 \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 \u0060rohd_devtools_extension/lib/rohd_devtools/ui/waveform_viewer_wrapper.dart:216\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/waveform_viewer_wrapper.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b6b87020a20ce19f0c7c40e548b75bfdf2e7d5b4d8cbe71e89be92712f50c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lib/src/utilities/source_tracer.dart:678-686 | lib/src/utilities/source_tracer.dart:691-699 | lib/src/utilities/source_tracer.dart:704-712 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/utilities/source_tracer.dart:678\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":"lib/src/utilities/source_tracer.dart"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c8257dbe13023deabde32912be2cde2df9f49ab4081d09a03ee546d3cdbcf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/synthesizers/netlist/netlist_synthesizer.dart:356-364 | lib/src/synthesizers/netlist/netlist_synthesizer.dart:379-387 \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":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47568133f8ae170937eb053887ce8488aac5d85fd42797b4548e331b280ce16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/synthesizers/netlist/netlist_synthesizer.dart:920-928 | lib/src/synthesizers/netlist/netlist_synthesizer.dart:1020-1028 \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 \u0060lib/src/synthesizers/netlist/netlist_synthesizer.dart:920\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":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fe5cd79104d532e7337997348bcb8b62e779a6012737b7c6625378e7e83966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): lib/src/utilities/simcompare.dart:822-830 | lib/src/utilities/systemverilog_simcompare.dart:267-274 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/utilities/simcompare.dart:822\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":"lib/src/utilities/simcompare.dart"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9593e7240270990fdf294b8eceb68e1d526d611f86e8d90b96216abe266f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/values/big_logic_value.dart:184-192 | lib/src/values/small_logic_value.dart:161-169 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/values/big_logic_value.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f80105b7adf1e872be98e3fb1b2614fe3705c26214ab2b078f976a5607818eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): lib/src/synthesizers/netlist/netlist_synthesizer.dart:192-199 | lib/src/synthesizers/netlist/netlist_synthesizer.dart:208-214 \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":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba803d985c97d76bba0f5c32edacb2c2ae7d772ce4c44492c4e824376eee20ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/synthesizers/netlist/netlist_synthesizer.dart:581-588 | lib/src/synthesizers/netlist/netlist_synthesizer.dart:1014-1021 \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 \u0060lib/src/synthesizers/netlist/netlist_synthesizer.dart:581\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":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c357d55fb13951137987f905b71825c29d402d8bd6dc2f10f2640267041eebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/synthesizers/systemc/systemc_service.dart:291-298 | lib/src/synthesizers/systemverilog/system_verilog_service.dart:258-265 \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":"lib/src/synthesizers/systemc/systemc_service.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7323dfc5c6033c341cf76e38a28c1c8bd3dc451b5af4528135acdf4718e306f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/cubit/rohd_service_state.dart:17-51 | rohd_devtools_extension/lib/rohd_devtools/cubit/standalone_rohd_service_state.dart:16-51 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rohd_devtools_extension/lib/rohd_devtools/cubit/rohd_service_state.dart:17\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/cubit/rohd_service_state.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"567407b4df3ae9ff4f94c3f1c8a4e0f5a6ff396447af9a490afcbe181052372a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/diagnostics/design_command_shell.dart:335-339 | lib/src/diagnostics/shell_command_registry.dart:329-333 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/diagnostics/design_command_shell.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"730611181e7aad2885924bf5704591112c033b7aec96a22c29643d207442aa36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/diagnostics/design_session_protocol.dart:323-327 | rohd_devtools_extension/lib/rohd_devtools/cli/rohd_design_dtd_service.dart:246-250 \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 \u0060lib/src/diagnostics/design_session_protocol.dart:323\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":"lib/src/diagnostics/design_session_protocol.dart"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ca4dbcfe252b6cdd4f403981c88613d0c028f1a701bc4339d7d328cd75b9c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packages/rohd_devtools_widgets/lib/src/bit_field_utils.dart:185-191 | packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart:503-509 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/lib/src/bit_field_utils.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ea77bf272ab280c414429e7ee6860fd1b2456c7e0100dec3d0de4ae14016ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packages/rohd_devtools_widgets/lib/src/rohd_extension_client.dart:121-126 | rohd_devtools_extension/lib/rohd_devtools/services/flc_extension_client.dart:139-144 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/lib/src/rohd_extension_client.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e3f8a7c95abaecc8b745513da79fcdcc22169191d029d8a4de21c4b8a588d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packages/rohd_devtools_widgets/lib/src/rohd_extension_status.dart:213-219 | rohd_devtools_extension/lib/rohd_devtools/services/flc_extension_client.dart:159-165 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/lib/src/rohd_extension_status.dart"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a4a9f99930ba325eb6c92c2d68feb4ca4199f3e591b4623e17d1949b2c434c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart:73-84 | rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart:60-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"948a8ef13fa90f2e90369437ad3dca9374905ccfc49286ae7766068a41b5f265"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart:466-473 | rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart:1059-1067 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2823ce47091d2a2c05ef71f0324b46cbc4beb6bbc38118da5cab62b2deb9af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rohd_devtools_extension/lib/rohd_devtools/ui/devtools_help_button.dart:50-56 | rohd_devtools_extension/lib/rohd_devtools/ui/rohd_shell_help_button.dart:29-35 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_help_button.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc4d61f6d4a60437cf7f527b9aa41ce7c109888bac2475d8d1316a79f2d6ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): doc/tutorials/chapter_4/answers/exercise_1_sv.dart:92-98 | doc/tutorials/chapter_6/combinational_logic.dart:50-56 \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":"doc/tutorials/chapter_4/answers/exercise_1_sv.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b55745ed48be7f8d99443dd226d3ee3f6144ca72562864d6c484513ca9b966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/values/big_logic_value.dart:78-87 | lib/src/values/small_logic_value.dart:69-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/values/big_logic_value.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d640841ad4336e4eca89ea12804312974d8337bba17307f1a709565f65ad92a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/values/big_logic_value.dart:170-177 | lib/src/values/small_logic_value.dart:147-154 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/values/big_logic_value.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"390d28c097e5ad0e564dbf33f6379665fc8cbc907b92fde18903f6102d7bce07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rohd_devtools_extension/scripts/fix_directives.py:91-99 | rohd_devtools_extension/scripts/fix_types.py:68-76 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/scripts/fix_directives.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba145e599c56a5e082ce752aa3c9d0ebb2462a4bd71461edb0da1e515df5345"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): example/example.dart:28-40 | rohd_devtools_extension/lib/rohd_devtools/examples/rohd_examples.dart:66-75 \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":"example/example.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baada9e19e881e6e9abeecfab9cf456e7ac64489de2045f0be740005c7f1284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): example/filter_bank/filter_sample.dart:24-50 | lib/src/examples/filter_bank/filter_sample.dart:24-47 \u2014 before extracting anything, compare \u0060example/filter_bank/filter_sample.dart\u0060 and \u0060lib/src/examples/filter_bank/filter_sample.dart\u0060 as WHOLE FILES: 83% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/filter_bank/filter_sample.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"813923e6c25cf728e8d12234f713ed82b7ed1294097b1a31fe702d37a2ff87c7"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rohd_devtools_widgets: rohd_devtools_widgets: abstractness 0.19, instability 0.00, distance 0.81 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fcc2b315d327850f8e5de8fdf33f65d902b95d319ef6cfa9dc388cb0959b19fa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LogicStructure (LCOM4 60): LogicStructure\u0027s methods fall into 60 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 60 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":"lib/src/signals/logic_structure.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"90af3781244aa439a0473f4a43d05ee50d567ac3253db16796d6283c2e818e1c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Logic (LCOM4 17): Logic\u0027s methods fall into 17 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 17 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":"lib/src/signals/logic.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb600392692adf5df7e5c8576fb1d06ac31455ec8e0e4ae1f56b9590181c98c1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Module (LCOM4 12): Module\u0027s methods fall into 12 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 12 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":"lib/src/module.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1576b602fea1811c920533ef441b9c02ba7d1ca5ef321b9dacbbb31e75d518"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Const (LCOM4 10): Const\u0027s methods fall into 10 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 10 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":"lib/src/signals/const.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02909fca3e4cdd936d5f6b13cc68e1d39833f27362f95dbd922be0afb13ae07"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SynthLogic (LCOM4 10): SynthLogic\u0027s methods fall into 10 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 10 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":"lib/src/synthesizers/utilities/synth_logic.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89870259430070d9f8b14e21c249844262941b6245dafdbeb0e9f4d8223ab99"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _WireNetBlasted (LCOM4 9): _WireNetBlasted\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/signals/wire_net.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9df9220ceee2fc3cdecff3f9883d0f8edc3fc1c6751d9486e5f8f858eae819"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SynthLogicArrayElement (LCOM4 7): SynthLogicArrayElement\u0027s methods fall into 7 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 7 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":"lib/src/synthesizers/utilities/synth_logic.dart"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a06c5fc018297423167635541fbbe7ee1fcec0f113e0f6ad6773aa01288dd50"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VmServiceWaveformDataSource (LCOM4 6): VmServiceWaveformDataSource\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \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 6 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3542a60931ec45d698fbb2e61e55fbc01905e2469107f63c779556d1b89c11"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _Wire (LCOM4 6): _Wire\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \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 6 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":"lib/src/signals/wire.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf1353b3cb838af273a81547a081fa7dbc8d95d8c4e216deb4fa2e845940593"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NetlistService (LCOM4 6): NetlistService\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \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 6 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":"lib/src/synthesizers/netlist/netlist_service.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eab9b3b59644e523c14ffd1ce8c9d5b77a15e09601857947530db66b851326"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SynthLogicArrayStructureElement (LCOM4 6): SynthLogicArrayStructureElement\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \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 6 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":"lib/src/synthesizers/utilities/synth_logic.dart"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"04baeb983812bfa8fd066b2b59b610131372127ee5c6170f6ad83e09bf43966f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LogicValue (LCOM4 6): LogicValue\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \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 6 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":"lib/src/values/logic_value.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e865553182c45a2a1afd1a6d1c4bb0eec77f361c128451b256f410b7b7747f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InProcessRohdDesignSession (LCOM4 5): InProcessRohdDesignSession\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/diagnostics/in_process_design_session.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"28aa3791f41242b97c9fbfba93e74fc985ee7254c1f32971eef45609e80c1cc5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NullExtensionClient (LCOM4 5): NullExtensionClient\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/lib/src/rohd_extension_client.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d124857b596221905336f0679b86b2e153dc6b96969c217a4af46e7d21ef89b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InProcessWaveformDataSource (LCOM4 4): InProcessWaveformDataSource\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":"rohd_devtools_extension/lib/rohd_devtools/services/in_process_waveform_data_source.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9136d51f494c0716298db2527a1b15072c8c5683d819fbcac028d1dafa5d6ee6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VmServiceTreeDataSource (LCOM4 4): VmServiceTreeDataSource\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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf472f14fffdd4088d9143a463b8d88e7a03d38224bb1f06697f16a9766d9000"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WellenBackedWaveformDataSource (LCOM4 4): WellenBackedWaveformDataSource\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":"rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bccd76d0df2681e5510b1e560c67028c26b774a558541ea314926c96b0022e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _SignalTableState (LCOM4 4): _SignalTableState\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":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"134ee7daf11cb4622112b41183dbb6ad4812c50961a4ea1e5464b2667ad9a1f1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ModuleServices (LCOM4 4): ModuleServices\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":"lib/src/diagnostics/module_services.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ed30ec142784c13c9664171c8e6ee593334ac2dc7312bed8bcb75ee27eb2c4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TraceService (LCOM4 4): TraceService\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":"lib/src/diagnostics/trace_service.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e071e88c8ca713312496b1374def50ec90eb5b5ed5dcad804676a9a0fb0c81"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VcdWaveformWriter (LCOM4 4): VcdWaveformWriter\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":"lib/src/diagnostics/waveform_writer.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73f1e5746e798462cb64341d5937d9db82548e692c0c40d5daa7dc241c0975f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FstWaveformWriter (LCOM4 4): FstWaveformWriter\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":"lib/src/diagnostics/waveform_writer.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddae312aec00927be30066bd92578d76d35a7171e1fe7b1522f4a591ff94385"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SynthesisResult (LCOM4 4): SynthesisResult\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":"lib/src/synthesizers/synthesis_result.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda089226f6a97ed8d9dab9b62c89b7af23ef2af1afc1a61a4c40d6d7060204f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SystemCService (LCOM4 4): SystemCService\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":"lib/src/synthesizers/systemc/systemc_service.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f8eb39578944b6fac911c7d7ef7ef08b44e0ea2b311674e3c6ff04e8f6d9b3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SystemVerilogService (LCOM4 4): SystemVerilogService\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":"lib/src/synthesizers/systemverilog/system_verilog_service.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4f79278faa77cd428d1b5da6b100b635c07b7aae8f36fc3b0d1d1f7be1ecaf"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SynthLogicPackedBitReference (LCOM4 4): SynthLogicPackedBitReference\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":"lib/src/synthesizers/utilities/synth_logic.dart"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c7875d6c31d4aa68f4948ebd67d2847bfef7fd1dffdcff0b190a50abe2364d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/synthesizers/netlist/netlist_synthesizer.dart: lib/src/synthesizers/netlist/netlist_synthesizer.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 159 in NetlistSynthesizer.synthesize at line 94. 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/synthesizers/netlist/netlist_synthesizer.dart\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":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e260afb066b97bc556158e62a6467919957c492429525472159f9a3bc74145a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/synthesizers/utilities/synth_module_definition.dart: lib/src/synthesizers/utilities/synth_module_definition.dart changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in SynthModuleDefinition.SynthModuleDefinition at line 504. 4 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/synthesizers/utilities/synth_module_definition.dart\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":"lib/src/synthesizers/utilities/synth_module_definition.dart"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fec55a3e808a0499b44ce99b0436e9a5a2b85964148a749ea135c2f3bcb962a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart: lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in SystemVerilogSynthModuleDefinition._collapseFullPackedArrayConcats at line 1402. 2 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart\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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"c815c79f4fcc2f938875b2381ed52b4aa05592b15c4fc7d1db8eb438bf42d3ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/values/logic_value.dart: lib/src/values/logic_value.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in LogicValue.of at line 167. 2 of those changes were fix/bug commits, and the other 6 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/values/logic_value.dart\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":"lib/src/values/logic_value.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b519564ad1411f9a150f1ae397d85f6f246d4d4c09d42136dc14f3dd017a1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart: lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in SystemVerilogSynthesisResult._buildSvLineMap at line 509. 1 of those changes was a fix/bug commit, 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart\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":"lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"799135486b16af76a474ea1cc8fde3b9517aba1cf5a56de276543d953437a04a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/synthesizers/systemc/systemc_synthesis_result.dart: lib/src/synthesizers/systemc/systemc_synthesis_result.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in SystemCSynthesisResult._gateExpression at line 676. 1 of those changes was a fix/bug commit, and the other 6 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/synthesizers/systemc/systemc_synthesis_result.dart\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":"lib/src/synthesizers/systemc/systemc_synthesis_result.dart"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"8509702b9b58e660824218bb06312bae9339e3158f99fe7cdf4a713b4bb69838"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/utilities/simcompare.dart: lib/src/utilities/simcompare.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in SimCompare.checkVerilatorVector at line 433. 2 of those changes were fix/bug commits, 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/utilities/simcompare.dart\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":"lib/src/utilities/simcompare.dart"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1271562e92b09be07211fc7b612c68901890f25e5bb799e72a84b069439dea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/module.dart: lib/src/module.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Module.addTypedInput at line 726. 2 of those changes were fix/bug commits, 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/module.dart\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":"lib/src/module.dart"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"2939304d50e2e3faaf4086139bddf83f87f45626c43342a9b8106b781fe8ec1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/synthesizers/utilities/synth_logic.dart: lib/src/synthesizers/utilities/synth_logic.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SynthLogic.tryMerge at line 416. 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/synthesizers/utilities/synth_logic.dart\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":"lib/src/synthesizers/utilities/synth_logic.dart"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f7c9b830fdd7b826a150e603135483a9f358321cac55d53b14cd829331147a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart: rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in _StandaloneAppBarState.build at line 2993. 1 of those changes was a fix/bug commit, and the other 4 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart\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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":2993}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee2dcd3a91a7b5c996acfb851dc90b18b3074b8da00a3df8ffddb525d3f05d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/synthesizers/netlist/netlist_cell_mapper.dart: lib/src/synthesizers/netlist/netlist_cell_mapper.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in NetlistCellMapper._registerDefaults at line 262. 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/synthesizers/netlist/netlist_cell_mapper.dart\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":"lib/src/synthesizers/netlist/netlist_cell_mapper.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee51c40b25a122f9812e1b5f85347eb581990ddefded4a56c132a1da959b043"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/modules/conditionals/case.dart: lib/src/modules/conditionals/case.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Case.execute at line 272. 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/modules/conditionals/case.dart\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":"lib/src/modules/conditionals/case.dart"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d22276a2b0b8f31ef9572bd95394dc77ad2b8ee2289fa2fd42fe3ee03caec6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/utilities/systemc_simcompare.dart: lib/src/utilities/systemc_simcompare.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in _SystemCSimCompare.buildSystemCVectorExecutable at line 209. 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/utilities/systemc_simcompare.dart\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":"lib/src/utilities/systemc_simcompare.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91a5b36c98058b3eb816d50d1aa6482d1074c6fcff1d5892962425a873d235b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart: lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in SystemVerilogSynthesizer.instantiationVerilogFor at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart\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":"lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ced49166ca685fac7d1fe7ea9f01684a5b58bc3013403ba75d48c3d2c9bc96"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/utilities/namer.dart: lib/src/utilities/namer.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Namer.signalNameOfBest at line 288. 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/utilities/namer.dart\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":"lib/src/utilities/namer.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"1687c0baa82aa2faefd284c68fc5adb09fa1e2044ed1c99a0b90be524466ff2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/diagnostics/waveform_service.dart: lib/src/diagnostics/waveform_service.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in WaveformService._ at line 207. 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- lib/src/diagnostics/waveform_service.dart\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":"lib/src/diagnostics/waveform_service.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"186ca7ff43bbdb54bd75f8706e40cdfcd62d0424f1145a9027b3570426aa6f5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart: rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _SignalTableState._generateSignalRow at line 438. 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart\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":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a8223b41f2d0da1ca06a923ab74d429d5a6905f70cd6f713fdabb15f95f406"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart: rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TreeStructurePageState.build at line 343. 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart\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":"rohd_devtools_extension/lib/rohd_devtools/view/tree_structure_page.dart"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"993dbdc55f921a386220b0b3b0b0cd5f86aa78efe93bd697d93e1cfefc84de76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rohd_extension/src/flc_service.ts: rohd_extension/src/flc_service.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in flc_service.queryModule at line 137. 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- rohd_extension/src/flc_service.ts\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":"rohd_extension/src/flc_service.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4843be52d814c41e421f670d43c0002f0fb3be97e347115ac6424b40709dd3cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart: packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _HelpContent._parseDetails at line 411. 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 15:40:27 -08:00\u0027 --until=\u00272026-11-16 15:40:27 -08:00\u0027 --full-history --no-merges -- packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart\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":"packages/rohd_devtools_widgets/lib/src/markdown_help_button.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d695dd2553833beb08b7d4c13b460acc6aad3b318553a41c9ae217553d52f9ad"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 25 significant file(s) lose their only recent owner: rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart, lib/src/synthesizers/systemc/systemc_synthesis_result.dart, lib/src/utilities/source_tracer.dart, rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart, lib/src/diagnostics/waveform_data_service.dart, lib/src/synthesizers/netlist/netlist_synthesizer.dart, lib/src/utilities/systemc_simcompare.dart, rohd_extension/src/flc_service.ts (\u002B17 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c044d2e2ce3afda91095c9e321a6488bbcfa7672637fa1052be87e15a7d2732e"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (27 single-owned of 206 analysed files in total, 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; 206 of the 374 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: lib/src/synthesizers/utilities/synth_assignment.dart, lib/src/modules/clkgen.dart."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"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 \u0060rohd_devtools_extension/lib/main.dart\u0060 makes this repository a deployable product (line 28)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/main.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1416375568f58b1160c75eeaacc99993861f850ae57ee44cdbe931b09593e72"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060sanitizeSV\u0060 spells \u0060SV\u0060 where 18 names in the project spell it \u0060Sv\u0060: 18 of 20 names in project repository.src spell the token \u0060Sv\u0060 (18 of 20; unit: names in project repository.src containing \u0060Sv\u0060). Peers: TraceService.singleFileSvLineMaps (lib/src/diagnostics/trace_service.dart:235); TraceService.singleFileSvLineMapsByModule (lib/src/diagnostics/trace_service.dart:245); TraceService.singleFileSvFileMap (lib/src/diagnostics/trace_service.dart:251); TraceService.singleFileSvFileMapByModule (lib/src/diagnostics/trace_service.dart:264); TraceService._singleFileSvPath (lib/src/diagnostics/trace_service.dart:269). Rename to \u0060sanitizeSv\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/sanitizer.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6924637256081d149d3004e4d7e0df555fbf70e4adbeaecd5847823bf4683b81"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060_reservedSVKeywords\u0060 spells \u0060SV\u0060 where 18 names in the project spell it \u0060Sv\u0060: 18 of 20 names in project repository.src spell the token \u0060Sv\u0060 (18 of 20; unit: names in project repository.src containing \u0060Sv\u0060). Peers: TraceService.singleFileSvLineMaps (lib/src/diagnostics/trace_service.dart:235); TraceService.singleFileSvLineMapsByModule (lib/src/diagnostics/trace_service.dart:245); TraceService.singleFileSvFileMap (lib/src/diagnostics/trace_service.dart:251); TraceService.singleFileSvFileMapByModule (lib/src/diagnostics/trace_service.dart:264); TraceService._singleFileSvPath (lib/src/diagnostics/trace_service.dart:269). Rename to \u0060_reservedSvKeywords\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/sanitizer.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac8d55948f1e8a3470534c627b3686ae2102c4b8b4bd7bbdff722b58a429d43"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Register the tracker factory for Dart debug sessions\u0022 repeats the code it sits on: 5 of its 6 words (register, tracker, factory, dart, debug) are already in \u0060context.subscriptions.push(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/debug_tracker.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"982dfca06b8b1e8d37035722c9732265732e04d9cc5308ce915783a259cd05ce"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022.rohd.json \u2192 .flc.json\u0022 repeats the code it sits on: 3 of its 3 words (rohd, json, flc) are already in \u0060const fromRohdJson = base.replace(/\\.rohd\\.json$/i, \u0027.flc.json\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/flc_service.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"74778d4c4020675ab8e9d15facec1631cdeb16f80e47a49af5cdec36e346d35c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (54026 LoC, 363 module-visible types across 43 directories) overshoots its size bounds. 2 of 8 build unit(s) (npm, pub) overshoot their size bounds, lowering Project Cohesion to 5.0/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":"pubspec.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9fee3010c053c10733ebad6b156234032ce361c46f8c03bb63f2bdc3c8adbd"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060rohd_devtools_extension\u0060 (26600 LoC, 158 module-visible types across 12 directories) overshoots its size bounds. 2 of 8 build unit(s) (npm, pub) overshoot their size bounds, lowering Project Cohesion to 5.0/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":"rohd_devtools_extension/pubspec.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"534a213a8109beb563b5c162842db250e28d70f0c86dd66bfb8b5ea1c452bc06"}},{"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":"69f6539c24c8f8cad47b787f54a6666028db790082326128edc2e924de839d98"},"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":"b571baa27d92551f5a2e0e9ac8336067fb5a1fde1678081ddd6fff53f56bd548"},"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":"6dc0204117c1cfba5c6865fe48a3a789a8dcb778f5be3fe9d82e8ee1e2de024b"},"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":"8a946c056825888e308a2e4a5e0ecbfaa16fcfc7624fcb4dde109df8ede29c31"},"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":"8575d0d26d600ee14844ca189843e9933696bf03e5392221b48bfb9434a11df6"},"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":"acc71865a6716492a61c409edd3a9c95ba56be9498e8f1acec1606210a033053"},"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":"4c5910e61e7c515ca02ca8fdd8b970670799d310a0d142439e49c6e5baf8fe38"},"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":"8907782b898ac884e11abad6c89c7bfeac4120fe4cc14309d7a44c7a7313b451"},"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":"8a3dedc7ff961960207d819cb0009dcb03983b6e7be70f7555e438b6713a8960"},"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":"261f39dce004dcead0d6cb63780a2ed91765d58432ac1ba9a08ddf8ad535879d"},"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":"5f9a5f417543b2d3c4c99a841c725fad30d8b9fe2bb1b744775116ea61c7531e"},"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":"81a8814f503996e175a135ec29c87fa9b1437d581abf604eabdb11a98e2dc3b0"},"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":"2530c6ad11298978dffd0cad0d3c6b634baf315c3c4f157eca76e401ad36f5e1"},"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":"16d2aeb3c63c428f2c3e0e37404d6b3349a4e62280d1873532d75ea8d0f72c8d"},"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":"cfd3e1469060d96a42394561c53a622cd7f044d1f86a5d61d553c674ffe8f687"},"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":"fa80a3f141ef4a78add056317e380aa9cd84fa4add1054783fd28d36a09a2559"},"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":"b45925a1c0f7d42a94ce2f84f3069017157556302964503307907128e3905b9e"},"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":"9b1284eafab5b15e07a1a3334122db610b8316c0e930e73ac250b7cad5dda990"},"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":"308a475c4561e90591229dca4d21847cce3896d4adb09b86c42c9e594faeede0"},"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":"55b22edf2bdebbd1530ed95bdf88a2b349ebe18aea36f11da36331220b4aca97"},"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":"dce18e2d26aa6cf1bab26126c9c4c5338fbf04add0fd5f4a113d77630fd807ff"},"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":"544375e1f7df4f24e510d4d17ca9a00e93ed971b0f90dc28dad07eac6ca793ab"},"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":"f44d79499a2007eed1fb76832dd774c31b20774892e84783487504ff47e829be"},"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":"7c8e8c5abcc6f24e2981ed232198b04ed1473f831bfaec4ee70697582c8c717c"},"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":"ad07121a4ed72b71e9f9e7e52a05bbbbe594eb656dc21fe135c93900fc838ff6"},"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":"cecd37c5aeea9cb4c8bafd00958f940e18437596960a48344114677fcc635d92"},"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":"5921409cdad80e87953784a6360205851cd78cfacd4f7dc94b49cc292fa4a4ba"},"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":"f02a35bcec4cfba07d0c31717ee680e17ed00b2cbe1ef706c23b9dbb92198d32"},"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":"42d430aa85589c0827f3eb8b4e6c76704a89d12cae2e87fa0c6ad00ed02e58db"},"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":"e1deb0af1ad57cc0af2ae02d1b969010fd4270d514c99c0d1ba84f372e53dbf7"},"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":"5c7e675435b917049230f7b946ef08cbae568d43128c4ade5a06a65f3a7e66f6"},"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":"d38d70bad78b720653ade34a0f98be1309ec0140606585dde3a8694c9d7ab83c"},"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":"4383c58da6cf9e87005ebfe82ef452ff729c1bc6138954a3d4c35d0dcbc3dfd4"},"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":"2f3052eea242c921261f39fcfd1f6e053739799bf148fa8263e235de0aad4f3a"},"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":"5518ed180e9b0eccb09f97164b87d02bfae55c2494200fc0be404c605592e7b0"},"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":"c63b313b3741e4505a0c32cc3bc49bcdda50efe3081e9bf0c8278d8e8138f43d"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"b66089928a11cc8eb49b67796a417978252e9964accb5d23d4a12b9d6f2c363d"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ab1b90280fd5ba3f4469612d75311a029336102f7ee1b58404f1bef8ffb1994"},"properties":{"dependency":{"package":"picomatch","version":"4.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 206 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; 206 of the 374 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: lib/src/values/random_logic_value.dart. 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":"lib/src/values/random_logic_value.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b3ede95afca0d9743e9762d9f0d6ad012f0d22af6feb45c7e0655276873f7b"}},{"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":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"IC1","level":"note","message":{"text":"Member throws UnsupportedError: \u0060_addParent\u0060\u0027s body only throws an UnsupportedError or an UnimplementedError that gives its reason \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/signals/wire_net.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4d1317b90655217e789b515ed890902b47f010b6b298d54088151ed92749c9"}},{"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":"P2","level":"note","message":{"text":"Logging is not universal: Only 3/7 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060packages/rohd_devtools_widgets\u0060, \u0060packages/rohd_hierarchy\u0060, \u0060packages/rohd_source_navigator\u0060, \u0060packages/rohd_waveform\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"warning","message":{"text":"Analyzer excludes the shipped package \u0060doc/tutorials/chapter_9/rohd_vf_example\u0060: \u0060analysis_options.yaml\u0060 excludes \u0060doc/tutorials/chapter_9/rohd_vf_example\u0060 from analysis, and \u0060doc/tutorials/chapter_9/rohd_vf_example\u0060 is a Dart package this repository ships \u2014 it has its own \u0060pubspec.yaml\u0060 and 2 Dart file(s). Nothing in that tree is linted, type-checked or reported on by \u0060dart analyze\u0060 / \u0060flutter analyze\u0060, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analysis_options.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefbaa35beb280da9ec5e05eadcb0356ca6f39acf926ff112b525bd90d70821b"}},{"ruleId":"P3","level":"warning","message":{"text":"Analyzer excludes the shipped package \u0060packages/rohd_devtools_widgets\u0060: \u0060analysis_options.yaml\u0060 excludes \u0060packages/rohd_devtools_widgets\u0060 from analysis, and \u0060packages/rohd_devtools_widgets\u0060 is a Dart package this repository ships \u2014 it has its own \u0060pubspec.yaml\u0060 and 35 Dart file(s). Nothing in that tree is linted, type-checked or reported on by \u0060dart analyze\u0060 / \u0060flutter analyze\u0060, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analysis_options.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced82f96cdc763d8478c69e366fa02498e3c84758fc63b008f48adbf6520f876"}},{"ruleId":"P3","level":"warning","message":{"text":"Analyzer excludes the shipped package \u0060packages/rohd_hierarchy\u0060: \u0060analysis_options.yaml\u0060 excludes \u0060packages/rohd_hierarchy\u0060 from analysis, and \u0060packages/rohd_hierarchy\u0060 is a Dart package this repository ships \u2014 it has its own \u0060pubspec.yaml\u0060 and 33 Dart file(s). Nothing in that tree is linted, type-checked or reported on by \u0060dart analyze\u0060 / \u0060flutter analyze\u0060, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analysis_options.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9c7d264b5ad4821a27f513968e04511110c1c3fcb40be0836c0fcbb4373cef"}},{"ruleId":"P3","level":"warning","message":{"text":"Analyzer excludes the shipped package \u0060packages/rohd_source_navigator\u0060: \u0060analysis_options.yaml\u0060 excludes \u0060packages/rohd_source_navigator\u0060 from analysis, and \u0060packages/rohd_source_navigator\u0060 is a Dart package this repository ships \u2014 it has its own \u0060pubspec.yaml\u0060 and 6 Dart file(s). Nothing in that tree is linted, type-checked or reported on by \u0060dart analyze\u0060 / \u0060flutter analyze\u0060, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analysis_options.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4901717daa69dd9ceb737c67cd71c7011bda1c4b7a2ee7ee3eddb37867ce643c"}},{"ruleId":"P3","level":"warning","message":{"text":"Analyzer excludes the shipped package \u0060packages/rohd_waveform\u0060: \u0060analysis_options.yaml\u0060 excludes \u0060packages/rohd_waveform\u0060 from analysis, and \u0060packages/rohd_waveform\u0060 is a Dart package this repository ships \u2014 it has its own \u0060pubspec.yaml\u0060 and 23 Dart file(s). Nothing in that tree is linted, type-checked or reported on by \u0060dart analyze\u0060 / \u0060flutter analyze\u0060, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analysis_options.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ea8e1df5906cafece3c71e471e34634c92b657a812860319b2cda16d3fbc48"}},{"ruleId":"P3","level":"warning","message":{"text":"Analyzer excludes the shipped package \u0060rohd_devtools_extension\u0060: \u0060analysis_options.yaml\u0060 excludes \u0060rohd_devtools_extension\u0060 from analysis, and \u0060rohd_devtools_extension\u0060 is a Dart package this repository ships \u2014 it has its own \u0060pubspec.yaml\u0060 and 176 Dart file(s). Nothing in that tree is linted, type-checked or reported on by \u0060dart analyze\u0060 / \u0060flutter analyze\u0060, locally or in CI. For a published package the excluded tree is usually the example app, which is the code consumers read first and copy from. Remove the exclusion and fix what it surfaces, or narrow it to the generated files it was meant for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analysis_options.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d373bf35f76b35d2206afd7e3c9433430c6d3a0694e66f3bed96c7e5e66206db"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add the Dart analyzer\u0027s security lints plus \u0060semgrep --config=auto\u0060 as a CI step. What was searched, so you can tell an absence from a miss: the 5 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/general.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060rohd_extension/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/package.json"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"215431f0422f2fd3a3033edb0fc029774c025874010ba7a85d8a32800ff205f5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060teardown\u0060 is async and calls deleteSync \u2014 a blocking call inside async code stalls the isolate\u0027s event loop \u2014 every other event, on Flutter the next frame, waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmark/wave_dump_benchmark.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a0de5f8123f5db4dd0c33fccb26e18dfd30b40ae7c06a4d9ffad88f7fb0d45"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060resolveFlcPathWithAvailability\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/assets/extension/module_info_helper.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeef0fdecd44a460953ca0ea0afed90f2db4068ea5ab5b0c8965bf3e66d88fe0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060resolveFlcPath\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/shared/module_info_helper.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc6d9e6aabe067521286b83a01c3f55c156223915f11237f28ec91999099d47"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 8 typed \u00B7 4 plain JS \u2014 the untyped files are packages/rohd_devtools_widgets/assets/extension/module_info_helper.js, rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js, rohd_devtools_extension/shared/module_info_helper.js, rohd_extension/tool/test_flc_instance_paths.cjs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (74 matched lines \u00D7 2 locations): rohd_extension/src/debug_tracker.ts:97 \u00B7 rohd_extension/src/uri_forwarder.ts:87 \u2014 the two spans are one implementation copied and then locally edited \u2014 450 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/debug_tracker.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5ec8b64820bcce14282de78ee38eebf446dfe7a83cc2c01b35dee8b2c87206"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (64 identical lines \u00D7 2 files): packages/rohd_devtools_widgets/assets/extension/module_info_helper.js:13 \u00B7 rohd_devtools_extension/shared/module_info_helper.js:13 \u2014 these 2 files are line-for-line copies of one another \u2014 64 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/assets/extension/module_info_helper.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"850bce0790769e7da9304cb9bf694ef4d64d07b528b8bae3a5d28b3706f3a94a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): rohd_extension/src/debug_tracker.ts:34 \u00B7 rohd_extension/src/uri_forwarder.ts:23 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/debug_tracker.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8535cc14b176ddac9c3a192e29761c2fa5db894601b573c54f236dd00dfd2601"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): rohd_extension/src/conditional_completions.ts:80 \u00B7 rohd_extension/src/conditional_completions.ts:202 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07471eac124c24d381a02d1f89235872caad6b959c61728d898fd0c2a183fe2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): rohd_extension/src/conditional_completions.ts:963 \u00B7 rohd_extension/src/conditional_completions.ts:979 \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":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0c2817883c06db3c242b67c3cb6893b1d6209578a5cc6f3700c52c90b2cbcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rohd_extension/src/conditional_completions.ts:50 \u00B7 rohd_extension/src/conditional_completions.ts:177 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2d4dfda788c4476a0d73f48c0bff9ce0a3e627db5af6755d9179aa753382df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rohd_extension/src/flc_service.ts:314 \u00B7 rohd_extension/src/flc_service.ts:420 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/flc_service.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5723cffdeb154dd17f619c4fa16c9979f7988d1b6ceb1f3ad1fe5301d9fd69f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rohd_extension/src/conditional_completions.ts:835 \u00B7 rohd_extension/src/conditional_completions.ts:876 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"988981d2381e1f457ae740f2488a40b3d625e5a6837f67b15e342d44a6b2544f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): rohd_extension/src/dtd_bridge.ts:249 \u00B7 rohd_extension/src/dtd_bridge.ts:259 \u00B7 rohd_extension/src/dtd_bridge.ts:269 \u00B7 rohd_extension/src/dtd_bridge.ts:279 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/dtd_bridge.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0e40608dda74e38cf7ba8574a7e2e7abd038fe6f724a5e92764e4cc483da0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rohd_extension/src/flc_service.ts:169 \u00B7 rohd_extension/src/flc_service.ts:382 \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":"rohd_extension/src/flc_service.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee972b20b1058c31029459b4309aaee5f0b6071423c489ff876410fc9ea4e5bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:47 \u00B7 rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js:73 \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":"rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68c333cb8386b723bd13df0eee21ad7b6788541d86765b38ab817b220766ecf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rohd_extension/src/flc_service.ts:366 \u00B7 rohd_extension/src/flc_service.ts:514 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/flc_service.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d15629545d859028139fc3679cb3698f6e5ebf272576119cc76cd041ac12f1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectContext (cyclomatic 38, cognitive 57): detectContext has cyclomatic complexity 38 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee569c8b8e4af9ecdc4741596160bf65a8dbc1ffea50fe495f165aa634b30ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findEnclosingClassInfo (cyclomatic 36, cognitive 50): findEnclosingClassInfo has cyclomatic complexity 36 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"74755f2c151d4038a9baecbf310edc96268662a7b3ddd14e8e1a7a301eac54d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queryModule (cyclomatic 26, cognitive 41): queryModule has cyclomatic complexity 26 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/flc_service.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"36750ffa149db7c1c887a161f3c5bb68cf2def74c3493dbb1dcc32f832a38208"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildModuleInfo (cyclomatic 20, cognitive 25): buildModuleInfo has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/assets/extension/module_info_helper.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"131549ca2c3a4c5e28cd227de6bddd25dd5bcb7bed8da8c8c29483dcd855cd2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildModuleInfo (cyclomatic 19, cognitive 23): buildModuleInfo has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/shared/module_info_helper.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf34aa40a61c46b90186a5f3cd84d6cff97499e32c7e2f82453cf58ef1a80a74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOutputPositions (cyclomatic 14, cognitive 28): parseOutputPositions has cyclomatic complexity 14 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/flc_service.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5e67db30ce096282dcf22e3160cbc926227238cc7e590f1642836a45992095"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleMessage (cyclomatic 14, cognitive 22): handleMessage has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/dtd_bridge.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"585cc3f142032e20fb204b5e2243341d071c1ea6466879c036446a628d4cdc18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provideCompletionItems (cyclomatic 13, cognitive 13): provideCompletionItems has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffaa8778cc91e762d2dcafbb80a55dae44300b36d5f22f60cfbd4767867ffde6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function elkLayoutOnly (cyclomatic 12, cognitive 12): elkLayoutOnly has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e07981edc9adfb0fde6d4ecf6fad226a5de93358123fe1e5d2b9a8e4811b8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookupSignal (cyclomatic 12, cognitive 10): lookupSignal has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/flc_service.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"de396537efe2b21b1aa851b2beabe269ec66b67417ec8b0d955658578a18e005"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function entryToFrames (cyclomatic 11, cognitive 13): entryToFrames has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/flc_service.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e053da99af65b8e45f47e21cfd0252076e602a6a232277d3caa56db12232c5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openSourceLocations (cyclomatic 11, cognitive 10): openSourceLocations has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/source_navigator.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"73668aa7bc5e724037d94296740d431e2b5ee3748ba7bc6edaa2195d0ac4ef2d"}},{"ruleId":"R3","level":"warning","message":{"text":"rohd_extension/src/conditional_completions.ts: 1014 lines of code: rohd_extension/src/conditional_completions.ts has 1014 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/conditional_completions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb01296e07f091a49684761910d71484090cb2ba85f6ea08d46e4d0e50cac8b"}},{"ruleId":"R3","level":"warning","message":{"text":"rohd_extension/src/flc_service.ts: 576 lines of code: rohd_extension/src/flc_service.ts has 576 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/flc_service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb992012e74b51c4011e89af5965c3c3e1713fbb68674c95815940fe0cece7df"}},{"ruleId":"R3","level":"warning","message":{"text":"rohd_extension/src/source_navigator.ts: 423 lines of code: rohd_extension/src/source_navigator.ts has 423 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/source_navigator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2a3660a90a84cdfbb0a89fe5ebacd2fab74c4a64a433c9bea0b934211b82a1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/uri_forwarder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae23ca3f9e2a7323753eeee66a8ff1e2d4a1400bbe8694f47b67e2bc397b489"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/assets/extension/module_info_helper.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c7ad3e0545049f90ffd589d01bad8cc2b02a010d5941997f1109c9376fa7b0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/shared/module_info_helper.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"237d58e3a973458e24adbc8ff88c0598ab7e59d9e74bf72264040476a367477f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/assets/layout_bridge/elk_layout_only.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2eaf380d4279b06bac2d2fc83fc5db2c452b9e2a3f212b941a57559e96b324"}},{"ruleId":"R6","level":"warning","message":{"text":"No lint script: test \u2713 \u00B7 lint \u2717 \u00B7 typecheck \u2713 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc8e67e81453cf5399dd04786d18b232180426b135169175fee670bdd83ccb03"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~295 LoC): no import path from any entry point (3 application, 0 tooling, 1 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/uri_forwarder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7fdcc3a6104f14818cc30bee8ac24357844a4e5c65eea3dda3cd670965a782"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~159 LoC): no import path from any entry point (3 application, 0 tooling, 1 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/shared/module_info_helper.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"146c750836693a7ba9f821429d89fa15f56b2d274b6e0d45610af4c12ca19448"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getDtdUri\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/debug_tracker.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b49f231097f88771b122af8cffd548e23614144f0581d6615fe8ea98f9e8b2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getVmServiceUri\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/debug_tracker.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd0715705418401e14e187a2044b7cd6f602cdf093273d81ea95004f3ec9662"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_parentModule == null || _parentModule == newParentModule\u0060 appears character-identically in 2 files \u2014 lib/src/signals/logic.dart, lib/src/signals/logic_structure.dart. 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":"lib/src/signals/logic.dart"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f30d3702d70fac0265544af1e91f858ed45d884edc2a80a4df7bd3eee90491"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_value == other._value \u0026\u0026 _invalid == other._invalid\u0060 appears character-identically in 2 files \u2014 lib/src/values/big_logic_value.dart, lib/src/values/small_logic_value.dart. 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":"lib/src/values/big_logic_value.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"535d1de3cf058889fc100d41a35e68dcdb89fbba2a047631a07627f4cef2d3e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arrayDims != null \u0026\u0026 arrayDims.isNotEmpty\u0060 appears character-identically in 2 files \u2014 packages/rohd_hierarchy/lib/src/signal_occurrence.dart, rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart. 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":"packages/rohd_hierarchy/lib/src/signal_occurrence.dart"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfd49fd08e0a5e17754596f1121fffeb190dadfd082dbe414d0027634c7c93b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060assignment.src.isNet \u0026\u0026 assignment.dst.isNet\u0060 appears character-identically in 2 files \u2014 lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart, lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart. 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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ce93c30ab30454b5ede026fb0664519d63ebb53fb2814422a31988bbc33871"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060decoded.containsKey(\u0027modules\u0027) \u0026\u0026 !decoded.containsKey(definitionName)\u0060 appears character-identically in 3 files \u2014 rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart, rohd_devtools_extension/lib/rohd_devtools/services/tree_service.dart, rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart. 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":"rohd_devtools_extension/lib/rohd_devtools/services/in_process_transport.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b38620ee96070914f340096ed47ff2943a763a6fc2e0eb28d088e5acb47278d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060decoded[\u0027status\u0027] == \u0027fail\u0027 || decoded[\u0027status\u0027] == \u0027unavailable\u0027\u0060 appears character-identically in 2 files \u2014 rohd_devtools_extension/lib/rohd_devtools/services/tree_service.dart, rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart. 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":"rohd_devtools_extension/lib/rohd_devtools/services/tree_service.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfec7ffee2fcc668e616cfc81abdd4227118439ac1951ec4e945d537e8ef7513"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060element is LogicStructure \u0026\u0026 element is! BaseLogicArray\u0060 appears character-identically in 2 files \u2014 lib/src/synthesizers/netlist/netlist_module_translation.dart, lib/src/synthesizers/utilities/synth_structure_layout.dart. 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":"lib/src/synthesizers/netlist/netlist_module_translation.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f61fe55e37e3c195a0c6be4eaf3600a8eadb2cd5b69d5c29cbf4d2d6df50c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lib.uri != null \u0026\u0026 lib.uri!.contains(\u0027rohd\u0027) \u0026\u0026 lib.uri!.contains(\u0027inspector_service\u0027)\u0060 appears character-identically in 3 files \u2014 rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart, rohd_devtools_extension/lib/rohd_devtools/services/web_vm_connection_strategy.dart, rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart. 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":"rohd_devtools_extension/lib/rohd_devtools/services/io_vm_connection_strategy.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e053b29e6c4dd0ca0e88ae8bce20df048c4e9c46eb103b958bfd8ebbbc815073"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060logic is LogicStructure || logic.parentStructure != null\u0060 appears character-identically in 2 files \u2014 lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart, lib/src/synthesizers/utilities/synth_module_definition.dart. 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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bba3a27e1f2d277b9d0046fc78b38acb823f4beba7f7915c9c67d3ae32c1cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module is Mux || module is FlipFlop || module is Passthrough\u0060 appears character-identically in 2 files \u2014 lib/src/synthesizers/netlist/netlist_synthesizer_configuration.dart, lib/src/synthesizers/utilities/synth_module_stop_policy.dart. 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":"lib/src/synthesizers/netlist/netlist_synthesizer_configuration.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dfc8742e505db6388c0c2274a4ba3112c7d31c786de1a9c39862a55f3adbac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module is SystemVerilog \u0026\u0026 module.generatedDefinitionType == DefinitionGenerationType.custom\u0060 appears character-identically in 2 files \u2014 lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart, lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart. 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":"lib/src/synthesizers/systemverilog/systemverilog_synthesis_result.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bf30b3dc6c65183a64f1251a01518e6acec677f1080868f2155b2e05d35007"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module is SystemVerilog \u0026\u0026 module.generatedDefinitionType == DefinitionGenerationType.none\u0060 appears character-identically in 5 files \u2014 lib/src/synthesizers/netlist/netlist_module_translation.dart, lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart, lib/src/synthesizers/systemverilog/systemverilog_synthesizer.dart, lib/src/synthesizers/utilities/synth_module_definition.dart. 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":"lib/src/synthesizers/netlist/netlist_module_translation.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9978fb358243d9546196587e4bbae89531b73da67b2ede3587fcce18bfc8f048"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mounted \u0026\u0026 dialogContext.mounted \u0026\u0026 _isConnected\u0060 appears character-identically in 2 files \u2014 rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart, rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart. 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":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde28f1fafd8f0279431d10c1523202bdf09eaece98b7f1d697f24e30d8c6c41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nextType == null || !modules.containsKey(nextType)\u0060 appears character-identically in 3 files \u2014 rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart, rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart, rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart. 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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a3ca87b8e0ffd97034c1cdeec6ff80d7271d5a67f5cde271f66ebeb56780a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060packageRoot != null \u0026\u0026 SourceTracer.hasTraces\u0060 appears character-identically in 2 files \u2014 lib/src/synthesizers/netlist/netlist_passes.dart, lib/src/synthesizers/netlist/netlist_synthesizer.dart. 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":"lib/src/synthesizers/netlist/netlist_passes.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a36898fb3c8792c416304ac7b1a8a8e7a1b063facebfe373d80c510b2e5f5df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parentData.isEmpty || parentData.first.data.isEmpty\u0060 appears character-identically in 2 files \u2014 packages/rohd_waveform/lib/src/waveform_repository.dart, rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart. 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":"packages/rohd_waveform/lib/src/waveform_repository.dart"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"02070b4470a1bb38e44aa5a949345fc9fc2e46c0e97bd7585af76999052df06c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw == null || raw == \u0027null\u0027 || raw.startsWith(\u0027{\u0027)\u0060 appears character-identically in 2 files \u2014 rohd_devtools_extension/lib/rohd_devtools/services/tree_service.dart, rohd_devtools_extension/lib/rohd_devtools/services/vm_service_tree_data_source.dart. 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":"rohd_devtools_extension/lib/rohd_devtools/services/tree_service.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"943424c4a088ba880c519bab9ffcbfb5cd3166289d26ced76ce58ce374920c10"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolvedHome == null || resolvedLib == null\u0060 appears character-identically in 2 files \u2014 lib/src/utilities/systemc_cosim_ffi.dart, lib/src/utilities/systemc_simcompare.dart. 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":"lib/src/utilities/systemc_cosim_ffi.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbeeab742897b7438309b0a86cd9e98ba4b516bae69a468063b2c0e806bfcd30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060srcLogic is! BaseLogicArray || dstLogic is! BaseLogicArray\u0060 appears character-identically in 2 files \u2014 lib/src/synthesizers/netlist/netlist_synthesizer.dart, lib/src/synthesizers/utilities/synth_module_definition.dart. 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":"lib/src/synthesizers/netlist/netlist_synthesizer.dart"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4732e0b8de27018048b22c26823bc8df3db8544acef07c404f37056ed84a1ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start \u003E 0 \u0026\u0026 !RegExp(r\u0027\\s\u0027).hasMatch(input[start - 1])\u0060 appears character-identically in 2 files \u2014 lib/src/diagnostics/design_command_shell.dart, rohd_devtools_extension/lib/rohd_devtools/ui/rohd_design_shell.dart. 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":"lib/src/diagnostics/design_command_shell.dart"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b315de8a51e05d582f7886e94d686f8a1f51343e86e7d087d4812c11db12fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060structure == null || structure.modules.isEmpty\u0060 appears character-identically in 2 files \u2014 rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart, rohd_devtools_extension/lib/rohd_devtools/services/wellen_backed_waveform_data_source.dart. 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":"rohd_devtools_extension/lib/rohd_devtools/services/base_signal_waveform_api.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"84362142d0cd32ab60fd99c32374d7bf9250b3f416f5640af4e2e74cc6163183"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060synthLogic != null \u0026\u0026 synthLogic.isArray\u0060 appears character-identically in 2 files \u2014 lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart, lib/src/synthesizers/utilities/synth_module_definition.dart. 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":"lib/src/synthesizers/systemverilog/systemverilog_synth_module_definition.dart"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ca028c3ea0b686ae7a334f22804d87c9f427c9d4dd47e204da3d3c216f34a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!hasFormats \u0026\u0026 instancePath \u0026\u0026 instancePath.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/rohd_devtools_widgets/assets/extension/module_info_helper.js, rohd_devtools_extension/shared/module_info_helper.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/assets/extension/module_info_helper.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf228ea70a833532225800f2fcb3dcca353f0edf722802343cf6ef9dec57e7f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060instanceName \u0026\u0026 instanceName !== moduleName\u0060 appears character-identically in 2 files \u2014 packages/rohd_devtools_widgets/assets/extension/module_info_helper.js, rohd_devtools_extension/shared/module_info_helper.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/assets/extension/module_info_helper.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"95da62263fb9795893f64f1770023bb287deafc180db13d9f04e53d365850ecf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof segment === \u0027string\u0027 \u0026\u0026 segment.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/rohd_devtools_widgets/assets/extension/module_info_helper.js, rohd_devtools_extension/shared/module_info_helper.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_devtools_widgets/assets/extension/module_info_helper.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66b030d7ea2722ccc79b8c7d29f7cbf7eee95eb49237816f0caea917c6ab11e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060HierarchyOccurrence.fromJson\u0060 is public and takes \u0060Map\u003CString, dynamic\u003E json\u0060 from its caller, and it calls itself at line 120 (\u0060HierarchyOccurrence.fromJson\u0060) with a piece of \u0060json\u0060 \u2014 and nowhere in \u0060HierarchyOccurrence.fromJson\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060HierarchyOccurrence.fromJson\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rohd_hierarchy/lib/src/hierarchy_occurrence.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b123c995a736671826f0ddb59ec8e864d5568ad0b4a5a53e5a9db6dd7c12c85d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/dtd_bridge.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd6fe8ba81b8b140d5d8caffe06c2c3a1c9f391c8a183f62651cb0613c5a99b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/dtd_bridge.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"837e433f24ea940ac22c233fb3e28ecfafbc55c32396763d71ac2b8182948ba4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/source_navigator.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c568f31c47dc792467c1da6e6a01c8143ff0595bfccf557ca50e3122d9b3c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/source_navigator.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1bebc59bd91ce05950a85c3b54e7260aa8ea92f7967630d6114cad4a4ef974"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\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":"rohd_devtools_extension/scripts/fix_directives.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e81b8b6f9f8c3d39c38f82e49b84054d98eeec4d65f670586c26124d43725f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\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":"rohd_devtools_extension/scripts/fix_types.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a95849ca6b6b94909e958a7a30171449b41b19be05f2295fc5ebb82094dadd0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/main.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9395dafe5328283f14f59baad8e77125a83b6194f148e66dacadd12dc90cee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/ui/devtools_connection_host.dart"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bab8cb13d5de4cff0af6a0a7878ae35dab997b0d1dfcc4a57737ec4d220f680"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\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":"rohd_devtools_extension/lib/rohd_devtools/ui/signal_table.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"46eba5b0920f4d6e97fba1031c126939dc775f15dd3c91ff6a4f61db91ef0232"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fe71aef3aee01da0ec65b95c5cbee3c2a91b1b20bce9de290f82c5c4b09e6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/ui/standalone_app_shell.dart"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d868bd417ce63a8df1c80838b58fabef0dbe81230de075d8135055419d0ad7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\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":"rohd_devtools_extension/lib/rohd_devtools/services/netlist_const_extractor.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f977e3c8674b232fecec21f762ac9bf06de38e18460b8c797dd26a883392150"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\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":"rohd_devtools_extension/lib/rohd_devtools/services/netlist_evaluator.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23caa5bd53ca49e62a67adab17e7f1772d048b4a6411e0d860220abbb769600"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f697117f5831b6730e5942b7b97aa4acde5401c136b6b8e4f012578f897291"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/standalone_tree_service.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"babc49fe05381f363e2c8160afc14f0fca36f7d66b2a2ab4a5ad231013f46ba5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/standalone_tree_service.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"89afc7ee1b2b75233815e3e49ebc45d2b68822b95b6c6012f9f2b908d3407fcf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_signal_value_source.dart"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a6788013fba2d34c2f5716074d877a9f2d634cf4b313d84a2d2e820fc7b0f5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baeace5ba8e125b7b4550a10df07e2c02cc42929431ba375995ecd1e69cff61"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"917ab61c440c4dfe01897df0ba4ab9ac6d7ddc9d412dea56fa2134477a96b5b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ecd3ea25db8e88cc81ffda7c85ac73486d11bf08f12db319849a7e35ca888a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d6fca3158b4a74c979001739d92803c30710d59715d2e27d4bfa93df1ffa72"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d0701ed365478a4d09e2ac54758b349c7fbf27ea8fe1b60908bdc22c91b5fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baf3561b2928aaa773f08d67795448f014d9ea37d2fbfc86314997f5d836964"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d464f58ff0b743ec4f9ae1ff3b93218cd5a1c46df0f2d7b2613ec11738c60b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff3b1832cb90c440a0a74a6f4803911af0837e981c6a20a4e4d7956cbb2a03f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a565b9dc927560b444cf6248dfaaea1b2ebfd1a226abbb6c50c31a8b5355ba9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\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":"rohd_devtools_extension/bin/rohd_shell.dart"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77e1de636ddfcb634464c0c24c8812ea7432482c0513968a02a918298a639da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"packages/rohd_devtools_widgets/lib/src/logic_type_utils.dart"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"de789d1f4f8db96c13496d7179507200a4c778541f6c458c6359e731f8c18b34"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/systemc_cosim_ffi.dart"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e91d9de2511d3333b37e512cc2c9955355c1073f53d1346546016d460d72c5f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/systemc_simcompare.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"327f1aa56217ec978f8673887c98fba0338d2bdc3f2fd9ed57451cc3c8ded6e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utilities/systemc_simcompare.dart"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5cfd9cfb976449891517a11137abbf81867ff1cfbd493ed09aa208e9ffa8cc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_extractFramesFromMissingTypeError\u0060 turns every thrown error into \u0060[]\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/source_navigation_service.dart"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e995be1ae6285bd9d89e5b28264a8a17621da8807ada0fc6298a4cb5459f10"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_getWaveformDataWithTimepointsBatch\u0060 turns every thrown error into \u0060[]\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91f4562c99b4ce8b0340d805aa7e9703bb933e29239246d494a8a7dc7628e91"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_parseCompactWaveformData\u0060 turns every thrown error into \u0060[]\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_transport.dart"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0d95ebfefcb26aa3fde203e206e39f24b36016efe685c420c58da2e4745790"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_getWaveformDataWithTimepointsBatch\u0060 turns every thrown error into \u0060[]\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_devtools_extension/lib/rohd_devtools/services/vm_service_waveform_data_source.dart"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddd08d4c74882be79c2e4e74b438801d1ed95615c9918766876e386ab28a2ed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060resolveEnclosingSymbol\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rohd_extension/src/source_navigator.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b3fe6d06b8de7c28a430015ae3738b570d02c6f390d015454cf825a660f687"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.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-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-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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-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":43,"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."]}]}