{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"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":"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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"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":"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":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"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":"CPU6510_CE.initStates (cyclomatic 428): CPU6510_CE.initStates has cyclomatic complexity 428 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala holds 2 of the 99 methods over the threshold \u2014 including the worst \u2014 and 429 of the 1680 points over it (26%), 2.9\u00D7 the next-largest file (Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala at 148). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c79d16cff745b3d80a577a2eebfc0e7a29d7fcb94387867cf0f068332863bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"AsmCompiler.compile (cyclomatic 96): AsmCompiler.compile has cyclomatic complexity 96 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmCompiler.scala"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18d1aefb468c1a7d5c06091206bdb3e63049405fa06a1bdc6ad327df54a0b13"}},{"ruleId":"D1","level":"warning","message":{"text":"VDC.write_regs (cyclomatic 72): VDC.write_regs has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent 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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"31026bff389006f0dd0fa26fd7ad03b154b7ecd88e375bb0754ad29777f072a2"}},{"ruleId":"D1","level":"warning","message":{"text":"EN25QH128A.clock (cyclomatic 70): EN25QH128A.clock has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent 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":"Kernal64/src/ucesoft/cbm/misc/EN25QH128A.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3194e52647fa2c14334d32234e0bae28d2cf3135ec794198fef1fc7b38ad926"}},{"ruleId":"D1","level":"warning","message":{"text":"VASYL.writeReg (cyclomatic 68): VASYL.writeReg has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14aed0800e7aa480ef4d3f4d4ebc628152e6d6ca5787264cc5a352186a06178"}},{"ruleId":"D1","level":"warning","message":{"text":"SCPU_MMU.writeRegisters (cyclomatic 64): SCPU_MMU.writeRegisters has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b93bbfb43cbe541fbd48f0b7851fc1a301de0879222b95ecab230f7559e405f"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.eval (cyclomatic 57): Evaluator.eval has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmEvaluator.scala"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48968f2a0b97303499f57e1755291dee55bb1dc8f5c0291827695a02b137b50"}},{"ruleId":"D1","level":"warning","message":{"text":"WiC64.executeCmd (cyclomatic 54): WiC64.executeCmd has cyclomatic complexity 54 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/WiC64.scala"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f664637a5012d27180aa3b64930b397ef8fb2e48100be95e38d15d36bced0f39"}},{"ruleId":"D1","level":"warning","message":{"text":"VDC.drawTextLine (cyclomatic 52): VDC.drawTextLine 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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"e163fe47716a625a4b0739b4325f29b59983ec22642199d9a3ba34a7bad7849e"}},{"ruleId":"D1","level":"warning","message":{"text":"TracerConditionEvaluator.eval (cyclomatic 51): TracerConditionEvaluator.eval has cyclomatic complexity 51 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/trace/TracerConditionEvaluator.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffad35f2bfbc337a9107e7ffa4b4c3e7b3962f8b7a8b25a25af1832a9516e84"}},{"ruleId":"D1","level":"warning","message":{"text":"GFXShifter.shift (cyclomatic 50): GFXShifter.shift 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8200959ade95e619881f39d565219b14cdbb0b4b38c616f0acd552f93b6f57"}},{"ruleId":"D1","level":"warning","message":{"text":"VIC_II.clock (cyclomatic 42): VIC_II.clock has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de973c7c90eeede34b88844384996aa9132b606fa2b8ee088d317887fa0cae6"}},{"ruleId":"D1","level":"warning","message":{"text":"Z80.initOpcodes (cyclomatic 41): Z80.initOpcodes 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":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9bb0a0a867e2512742d34ca2e35222fc669e972905ada4c287393e5fb9fcc4"}},{"ruleId":"D1","level":"warning","message":{"text":"VDC.drawLine (cyclomatic 41): VDC.drawLine 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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cf392b1d608eb603f3cc1826db5ebff7f38f7255ab648d454b7ea8fa77a264"}},{"ruleId":"D1","level":"warning","message":{"text":"VDC.drawBitmapLine (cyclomatic 39): VDC.drawBitmapLine 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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bb7eb5aa5cd941c4be374b5c013267edeb58afbceeeab1abeed7d2d53c52fc"}},{"ruleId":"D1","level":"warning","message":{"text":"SCPU_MMU.readBank0 (cyclomatic 38): SCPU_MMU.readBank0 has cyclomatic complexity 38 (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":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"169becd11bd2da5a123d433a298fbcac9ca86c4c19b2383ea4a66d528d2f3676"}},{"ruleId":"D1","level":"warning","message":{"text":"CPU65816Disassembler.disassemble (cyclomatic 37): CPU65816Disassembler.disassemble has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8186cf263faa6fbbb4fe8d9f8f153039b0680ef54c42fdf5c5502d46b50c9b1"}},{"ruleId":"D1","level":"warning","message":{"text":"TracerConditionParser.prune (cyclomatic 36): TracerConditionParser.prune has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/trace/TracerConditionParser.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"efae9e38d008be24666defbc632762ba89b0db542008a8337be4edc056d25742"}},{"ruleId":"D1","level":"warning","message":{"text":"M93C86.clock (cyclomatic 35): M93C86.clock 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":"Kernal64/src/ucesoft/cbm/misc/M93C86.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedcfd4f06988f776b048dcb896d6b6bb9123ff32b3c2e7351cc2f50bc68e604"}},{"ruleId":"D1","level":"warning","message":{"text":"VIC_II.write (cyclomatic 35): VIC_II.write 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad21cbacf1243c1561e3ed148c9e54d4e25eb2e9b3eabae66cbbdb9ad36528e"}},{"ruleId":"D1","level":"warning","message":{"text":"VIC_II.read (cyclomatic 34): VIC_II.read has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"162dd72444ec671995068e476314b121b126a0aade11ff3012d4ca31245753f6"}},{"ruleId":"D1","level":"warning","message":{"text":"ByteCodeBlock.sizeAndCheck (cyclomatic 33): ByteCodeBlock.sizeAndCheck has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmCompiler.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c38f04f13ef7237542793d7824ecd767d9e38be80fb2c8315821a00b62e2cb"}},{"ruleId":"D1","level":"warning","message":{"text":"MPS803GFXDriver.print (cyclomatic 33): MPS803GFXDriver.print has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent 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":"Kernal64/src/ucesoft/cbm/peripheral/printer/MPS803GFXDriver.scala"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7bb230dc2c1acc80c44fa08bdbcf23f19e026ca6ae2ccf4a7c85540929d7a1"}},{"ruleId":"D1","level":"warning","message":{"text":"SCPU_MMU.writeBank0 (cyclomatic 32): SCPU_MMU.writeBank0 has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent 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":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c4a1866c68fae8cc1dc3a8cb94ac8ec3a38b922c7241f5dafebb643ca6ab5a"}},{"ruleId":"D1","level":"warning","message":{"text":"MAIN_MEMORY.read (cyclomatic 31): MAIN_MEMORY.read has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c64/C64MMU.scala"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3710e4993bea53cc62adff5c6f712cfee46aa088dcfb4d8af05b7898fc062b"}},{"ruleId":"D1","level":"warning","message":{"text":"CBMII.setGlobalCommandLineOptions (cyclomatic 31): CBMII.setGlobalCommandLineOptions has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1eb769733a84de9123ef78940170d484bf939122d8f5ee4883f3aec698bbf0"}},{"ruleId":"D1","level":"warning","message":{"text":"CPU6510_CE.fetchAndExecute (cyclomatic 31): CPU6510_CE.fetchAndExecute has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala holds 2 of the 99 methods over the threshold \u2014 including the worst \u2014 and 429 of the 1680 points over it (26%), 2.9\u00D7 the next-largest file (Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala at 148). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a56b431eb4213985b6ab29053eb4c7c70657a8b7fb30d22741b1367a83d8bff"}},{"ruleId":"D1","level":"warning","message":{"text":"IECBusDevice.clock (cyclomatic 31): IECBusDevice.clock has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/bus/IECBusDevice.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"00736674de88e1e92afc056b78d55cdb5a60a65c9220cb0c6c0ed5f4cf673f73"}},{"ruleId":"D1","level":"warning","message":{"text":"TAP.anaylize (cyclomatic 30): TAP.anaylize 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":"Kernal64/src/ucesoft/cbm/formats/TAP.scala"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc20b2ebbdfb574321938f53f5ff1f3d853d6cf5854031f075710ffcbe8d9b3"}},{"ruleId":"D1","level":"warning","message":{"text":"CRTC6845.write_regs (cyclomatic 30): CRTC6845.write_regs 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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"877ecb657d2d4ddc11f5b4bee7f08f50481f7bbdf2acb3da759a4542986cb067"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler.resolve (cyclomatic 29): Assembler.resolve has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/Assembler.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fb7a2900dfff8f68e58dd985fc62f28f5838eed0bb4cf4d6cba162bf8537f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Preprocessor.eval (cyclomatic 29): Preprocessor.eval has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/Preprocessor.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd501862533c88d4e8626010b719333b9954c794eea4cad8af82acd1ecac17c"}},{"ruleId":"D1","level":"warning","message":{"text":"ProgramLoader.checkLoadingInWarpMode (cyclomatic 29): ProgramLoader.checkLoadingInWarpMode 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":"Kernal64/src/ucesoft/cbm/formats/ProgramLoader.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"13917e748c7cb9e85be62c4719af097fd41ef07f8691393dda48e1760077ac93"}},{"ruleId":"D1","level":"warning","message":{"text":"MPS803GFXDriver.paintComponent (cyclomatic 29): MPS803GFXDriver.paintComponent 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":"Kernal64/src/ucesoft/cbm/peripheral/printer/MPS803GFXDriver.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5515fe73c5d8439e4d0c6a05e9b66d4f4340b5a64cebe4ad87b2ff4d76653bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"AnimatedGIFWriter.getRGB (cyclomatic 29): AnimatedGIFWriter.getRGB has cyclomatic complexity 29 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c15c134027cdaec6eddfe4269f6e205118ef02bc60740d687b22ba23fc172f"}},{"ruleId":"D1","level":"warning","message":{"text":"Z80.clock (cyclomatic 28): Z80.clock 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":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":2990}}}],"partialFingerprints":{"codehealthFindingId/v1":"443972d2f9fc9e6949c13a9a33b637baf103fa8a25bf3e42f614cda6b44bfc06"}},{"ruleId":"D1","level":"warning","message":{"text":"D64_D71.addFile (cyclomatic 28): D64_D71.addFile 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":"Kernal64/src/ucesoft/cbm/formats/D64_D71.scala"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1488d11a9788f376082f38ed331085af6234d65b71f6e559485e8ca454850759"}},{"ruleId":"D1","level":"warning","message":{"text":"FlyerIEC.handleChannel15 (cyclomatic 28): FlyerIEC.handleChannel15 has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ce527227c33ee1654caec9a308119214a62b657b30977158e08cd2c0e0e919"}},{"ruleId":"D1","level":"warning","message":{"text":"AMF29F040.write (cyclomatic 26): AMF29F040.write 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":"Kernal64/src/ucesoft/cbm/misc/AMF29F040.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d89ca38f92ca6f355182b289414e5f729c75d5dd47227f4a194221f1a54a41"}},{"ruleId":"D1","level":"warning","message":{"text":"CRTC6845.drawLine (cyclomatic 26): CRTC6845.drawLine 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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f9fee5a898914ecb1fc6cf35f1f192daf7b5fdd076f9e7403f20fd97964ce1"}},{"ruleId":"D1","level":"warning","message":{"text":"VIC_II.drawCycle (cyclomatic 26): VIC_II.drawCycle 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e85b42800454837c056c2e71b668120f3aab4c9a8bfc67c9a199d7a4b37d81"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvelopeGenerator.update (cyclomatic 26): EnvelopeGenerator.update 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":"Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/EnvelopeGenerator.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4e6268809049df176ab159cbda71d6654bc95133fef719ee01820ab5513376"}},{"ruleId":"D1","level":"warning","message":{"text":"AsmBytecodeEmitter.emitByteCodeFor (cyclomatic 25): AsmBytecodeEmitter.emitByteCodeFor has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmBytecodeEmitter.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c984e57587fb88cfcd980e172c0039cb85941a2b52cbc86e76f2634e5369244"}},{"ruleId":"D1","level":"warning","message":{"text":"VASYL.cycle (cyclomatic 25): VASYL.cycle 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a23d350f07cd7f6cddcd336a0e08c71beecd77c8ae30d5dc6a05e24c2f5c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"TracerGUI.editBreakGUI (cyclomatic 25): TracerGUI.editBreakGUI 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":"Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"618969603242f79a15ad719b0c7dece0080b2b2236b08e29df6460e6e4798efe"}},{"ruleId":"D1","level":"warning","message":{"text":"MOS6525.setInterruptPin (cyclomatic 24): MOS6525.setInterruptPin 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":"Kernal64/src/ucesoft/cbm/peripheral/mos6525/MOS6525.scala"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b8b4f9b4dce44c432ee1b85e13d80da389259a162d02f40434fca8c7d0ccb0"}},{"ruleId":"D1","level":"warning","message":{"text":"VIC20Ultimem.read (cyclomatic 23): VIC20Ultimem.read has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20Ultimem.scala"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"209bddd3bc9aa52e552190648c583b785e9e5154f18affbd2d55cc77e3ccf3f9"}},{"ruleId":"D1","level":"warning","message":{"text":"CIA.read (cyclomatic 23): CIA.read 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":"Kernal64/src/ucesoft/cbm/peripheral/cia/CIA.scala"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"118066017b0b51fca8ce4104443dd2ea991c05fba3afeb27e70344970361e5bd"}},{"ruleId":"D1","level":"warning","message":{"text":"CIA.write (cyclomatic 23): CIA.write has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/cia/CIA.scala"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a77d81b877239d8bacd546dcd77794048f7d891486f21c5d93a890e0534df3"}},{"ruleId":"D1","level":"warning","message":{"text":"VIA.write (cyclomatic 23): VIA.write has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/VIA.scala"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a28ff296d1867775d1d661bee1ed4db6303244906358333ac6538c233e5080"}},{"ruleId":"D1","level":"warning","message":{"text":"AbstractRS232.sendBit (cyclomatic 23): AbstractRS232.sendBit 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":"Kernal64/src/ucesoft/cbm/peripheral/rs232/AbstractRS232.scala"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e174fe424fa7cc5c763210ec60cfe7a9620af6adf851bb00130072f2cfdd5183"}},{"ruleId":"D1","level":"warning","message":{"text":"C128MMU.read64 (cyclomatic 22): C128MMU.read64 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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf4d2e94b6bdfddcd348b26234583e97bc3484aac6a1b14805f225423b5a65a"}},{"ruleId":"D1","level":"warning","message":{"text":"MAIN_MEMORY.write (cyclomatic 22): MAIN_MEMORY.write 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":"Kernal64/src/ucesoft/cbm/c64/C64MMU.scala"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ed41ddc40c53202d2f6fdd129df92c5d1f334b3d16bb82736a0228b74153f4"}},{"ruleId":"D1","level":"warning","message":{"text":"CBM2MMU.readBank15 (cyclomatic 22): CBM2MMU.readBank15 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":"Kernal64/src/ucesoft/cbm/cbm2/CBM2MMU.scala"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c3d8125d335bd5bac419709786ef7a11d9aed1ac150fe67057b7d733231297"}},{"ruleId":"D1","level":"warning","message":{"text":"CBM2MMU.writeBank15 (cyclomatic 22): CBM2MMU.writeBank15 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":"Kernal64/src/ucesoft/cbm/cbm2/CBM2MMU.scala"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfddae9d5055aef32400b3f5713e8be2b2ab21fadaba95c27f9bf935100482f"}},{"ruleId":"D1","level":"warning","message":{"text":"IECBusDevice.decodeATNCommand (cyclomatic 22): IECBusDevice.decodeATNCommand 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":"Kernal64/src/ucesoft/cbm/peripheral/bus/IECBusDevice.scala"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb2d6a4ac8600f2e01b9beed86fd139af2976aefe319097ae5dca3606df3b36"}},{"ruleId":"D1","level":"warning","message":{"text":"IECBusDevice.writeByte (cyclomatic 22): IECBusDevice.writeByte 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":"Kernal64/src/ucesoft/cbm/peripheral/bus/IECBusDevice.scala"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b84d9b4194ffc9175c28a8f0329e8da401f2c950d8f8c873b713f0c456c5236"}},{"ruleId":"D1","level":"warning","message":{"text":"CIATimerA2.enableTimer (cyclomatic 22): CIATimerA2.enableTimer 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":"Kernal64/src/ucesoft/cbm/peripheral/cia/CIATimer2.scala"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95a50751f776347991d8034920edb43017050db2c7e041bfa30d65909e1d25c"}},{"ruleId":"D1","level":"warning","message":{"text":"SCPU_MMU.readRegisters (cyclomatic 22): SCPU_MMU.readRegisters 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":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f01c886eee0c253b73617c965eb2dcef2edacc4d0c929f63cce4221eae6d86b"}},{"ruleId":"D1","level":"warning","message":{"text":"C128.init (cyclomatic 21): C128.init has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde81ea859f23680d9e54c8bd6926426ee72045d101568d14a0baa154f18f4b5"}},{"ruleId":"D1","level":"warning","message":{"text":"CPU65816Disassembler.traceRegisters (cyclomatic 21): CPU65816Disassembler.traceRegisters has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b7fdb71f7ba86259d6844388aef4f02384b096d5e978e903349dec8f01a288"}},{"ruleId":"D1","level":"warning","message":{"text":"CRTC6845.drawTextLine (cyclomatic 21): CRTC6845.drawTextLine 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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98e0d8daf6e76cd47141ea86c94b676f1cd7baf01dd7cde1caa6337a08d1595"}},{"ruleId":"D1","level":"warning","message":{"text":"VIC20.showRAMConfig (cyclomatic 21): VIC20.showRAMConfig has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/vic20/VIC20.scala"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"98499f5f0059bf1f96ee35f670515406517893c02cff8c5c8cb5fd3812e3ee9c"}},{"ruleId":"D1","level":"warning","message":{"text":"C128RAM.getBankAndAddressP0_P1 (cyclomatic 20): C128RAM.getBankAndAddressP0_P1 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":"Kernal64/src/ucesoft/cbm/c128/C128RAM.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"559227b254dd9307886105603ff8e1ed0146a3bca9f494f7936ce24f43d25247"}},{"ruleId":"D1","level":"warning","message":{"text":"Preprocessor.process (cyclomatic 20): Preprocessor.process has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/Preprocessor.scala"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"320e85f61014d79e8214f5498f517d582d8f6ce14b05bfb6257dbd60e9793f90"}},{"ruleId":"D1","level":"warning","message":{"text":"VIC20FE3.read (cyclomatic 20): VIC20FE3.read 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. This shape REPEATS in the file: one other method here (VIC20FE3.write) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f0176b83c11679eb878a8c5eea2f3cc3b079757e32efa38227ceb570c68641"}},{"ruleId":"D1","level":"warning","message":{"text":"VIC20FE3.write (cyclomatic 20): VIC20FE3.write 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. This shape REPEATS in the file: one other method here (VIC20FE3.read) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bde5a6f4446645ff7625f4eba71c272886aa2cbc2de5f2b931e298d45c2667"}},{"ruleId":"D1","level":"warning","message":{"text":"GCR.GCR2track (cyclomatic 20): GCR.GCR2track 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":"Kernal64/src/ucesoft/cbm/formats/GCR.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"904f8920e745d386d2ab29fe4f26fa1f45031de0dda03c75b5ad89a00403b149"}},{"ruleId":"D1","level":"warning","message":{"text":"C128MMU.write64 (cyclomatic 19): C128MMU.write64 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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"60909d2226141928bc25253c2adc16ecda40cfb06700a6fbdf851e887f7aeb1b"}},{"ruleId":"D1","level":"warning","message":{"text":"IEEE488BusCommand.dataAvailable (cyclomatic 19): IEEE488BusCommand.dataAvailable 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":"Kernal64/src/ucesoft/cbm/peripheral/bus/IEEE488BusCommand.scala"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6934e667b698104f731f13de7c288a75116de3887913dc433fcdd245aa1cd92"}},{"ruleId":"D1","level":"warning","message":{"text":"FlyerIEC.configure (cyclomatic 19): FlyerIEC.configure 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"374d3faa7037e246c3a142888b6fde059fd9ce2ba54ef95cd2636e93261378b0"}},{"ruleId":"D1","level":"warning","message":{"text":"IEEE488Drive.openNamedChannel (cyclomatic 19): IEEE488Drive.openNamedChannel 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/IEEE488Drive.scala"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e509cc2458bde51f69a1ac094fbf07dd0d85a5a326d8714a87d8ec8f1d1481a2"}},{"ruleId":"D1","level":"warning","message":{"text":"HostKey.parse (cyclomatic 19): HostKey.parse has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/keyboard/HostKey.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae8d2e782fb426fd849d4fd46dacfaec32c6f18585ebbaf72b131b22ff3fbe3"}},{"ruleId":"D1","level":"warning","message":{"text":"CBMComputer.loadState (cyclomatic 18): CBMComputer.loadState 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":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c8d39be900e50109e0089b6875c89acd073c09ab78fa3350a93f925e3016ed"}},{"ruleId":"D1","level":"warning","message":{"text":"AsmParser.asm (cyclomatic 18): AsmParser.asm 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":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmParser.scala"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f125e223ece3de6299d1ee60f07699ada14f067cc72c3834aad992dde8946ee8"}},{"ruleId":"D1","level":"warning","message":{"text":"Diskette.formatDirectoriesAsPRG (cyclomatic 18): Diskette.formatDirectoriesAsPRG has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/Diskette.scala"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a2cf8d366f1787ca19994050ccb8b6c33fa8dfdeb848c2c1af1f31c42ed933"}},{"ruleId":"D1","level":"warning","message":{"text":"GameBaseSpi.getContent (cyclomatic 18): GameBaseSpi.getContent has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/game/GameBaseSpi.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3a70041f5c6d30a8022f2b8f34b6f9d7955f9211501551cfd6495579d7cf70"}},{"ruleId":"D1","level":"warning","message":{"text":"MOS6525.write (cyclomatic 18): MOS6525.write 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":"Kernal64/src/ucesoft/cbm/peripheral/mos6525/MOS6525.scala"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"527ed543e821364970e2f9fb15a240991e777ffadb8408d9482a8c8dc3f0914a"}},{"ruleId":"D1","level":"warning","message":{"text":"VDC.updateGeometry (cyclomatic 18): VDC.updateGeometry 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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a07c5df72cafae34fb085a83d4db835d56deabea982d7b1ad48d1f08ae2b7e8"}},{"ruleId":"D1","level":"warning","message":{"text":"VIC_I.fetchCycle (cyclomatic 18): VIC_I.fetchCycle 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_I.scala"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb7c85d64e96a9895811d8386102e9670806eeabd66bf5d1a7cdd7a8977cc39"}},{"ruleId":"D1","level":"warning","message":{"text":"TracerGUI.init (cyclomatic 18): TracerGUI.init has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6e70e06f9dfd23b9ecf9f41571665d178fabd5c95d0ba817f776148327615c"}},{"ruleId":"D1","level":"warning","message":{"text":"C128MMU.readZ80 (cyclomatic 17): C128MMU.readZ80 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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa05390373aaa58b8b56ef74b8fcee33228327aa887f8f2e76f0767534c483d"}},{"ruleId":"D1","level":"warning","message":{"text":"C128MMU.mem_write_0xD000_0xDFFF (cyclomatic 17): C128MMU.mem_write_0xD000_0xDFFF 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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"29742f9e53cc0f02af42283e5114ff3c388fa39e6ad2669af9476b9b555e41c1"}},{"ruleId":"D1","level":"warning","message":{"text":"CPU65816Disassembler.formatRegisters (cyclomatic 17): CPU65816Disassembler.formatRegisters 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":"Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"876e33b26eb98ac2212b0c6a81655b3f8389852a28333f6d9043c14976bc2423"}},{"ruleId":"D1","level":"warning","message":{"text":"VIC20Ultimem.write (cyclomatic 17): VIC20Ultimem.write 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":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20Ultimem.scala"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"488acdea67dbc21339798809017dc033301cbc24b9258de762154d5aa7ff9e36"}},{"ruleId":"D1","level":"warning","message":{"text":"CSDBSpi.games (cyclomatic 17): CSDBSpi.games 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":"Kernal64/src/ucesoft/cbm/game/CSDBSpi.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b86d046df823053b8995002ffd55501b2c71ef2111a5c0d3fb077fd5a19dc5"}},{"ruleId":"D1","level":"warning","message":{"text":"DrivesConfigPanel.initConfigPanel (cyclomatic 17): DrivesConfigPanel.initConfigPanel 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":"Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74e0d07f687474a93118a7d137d99b29a11d2608a45f6482cd279f978c5281"}},{"ruleId":"D1","level":"warning","message":{"text":"C1541Emu.executeCommand (cyclomatic 17): C1541Emu.executeCommand 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/C1541Emu.scala"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d15c712c052ae0edf8c94cecc63226127c812a149f947dae51755d96b14ea1"}},{"ruleId":"D1","level":"warning","message":{"text":"WD1770.write (cyclomatic 17): WD1770.write 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/WD1770.scala"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1177cfc9cd9e7d76442c302226e0ba23434920032cf4706e5d2e9f188f5c9f"}},{"ruleId":"D1","level":"warning","message":{"text":"VIC20.setGlobalCommandLineOptions (cyclomatic 17): VIC20.setGlobalCommandLineOptions 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":"Kernal64/src/ucesoft/cbm/vic20/VIC20.scala"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d13aede2deb39eab7eab26109a2ab5cf50ba8f3460cfda42fb60e22ebb7c08"}},{"ruleId":"D1","level":"warning","message":{"text":"C128MMU.mem_read_0xD000_0xDFFF (cyclomatic 16): C128MMU.mem_read_0xD000_0xDFFF 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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47b0d0e1f519c36c575eff16ed6d245a02507aff06f8781f7385d1e1dccf39d"}},{"ruleId":"D1","level":"warning","message":{"text":"C128RAM.read (cyclomatic 16): C128RAM.read 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":"Kernal64/src/ucesoft/cbm/c128/C128RAM.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7c3d4961cde6418bf4f24202ddd0f76c4326b835846dc3f766a3137c2c440d"}},{"ruleId":"D1","level":"warning","message":{"text":"VIA.read (cyclomatic 16): VIA.read 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/VIA.scala"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"49567a212d17aef761a0a3ca6511ce101cc1fe725f6b97f0bd05c0fb7f992eb9"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyboardMapperStore.load (cyclomatic 16): KeyboardMapperStore.load 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":"Kernal64/src/ucesoft/cbm/peripheral/keyboard/KeyboardMapper.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"339c2b183ca5c514deafee474ea134febc1d4bbf6ff18f154a06d47892640d20"}},{"ruleId":"D1","level":"warning","message":{"text":"VDC.nextFrame (cyclomatic 16): VDC.nextFrame 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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b87ae5df08d71d04821fa17e809eca8093b93b96f011589798b9d9565980250"}},{"ruleId":"D1","level":"warning","message":{"text":"Display.paint (cyclomatic 16): Display.paint 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/Display.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdad40c26b1dc1f94db7ae4f2fdf37e06f6058ddd34f75cfb39fd7aea0f851e"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteC64Server.run (cyclomatic 16): RemoteC64Server.run has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/remote/RemoteC64Server.scala"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb7b517f5094ad93de16ae0f527a5f9bfc9de651257034efe9b5657f566703b"}},{"ruleId":"D1","level":"warning","message":{"text":"VIC20MMU.init (cyclomatic 16): VIC20MMU.init 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":"Kernal64/src/ucesoft/cbm/vic20/VIC20MMU.scala"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a165d0f46c1b90f668c7eaf0251a579a6ebe31ddda2244f7e95700d3d1845ed"}},{"ruleId":"D1","level":"warning","message":{"text":"WuQuant.quantize (cyclomatic 16): WuQuant.quantize has cyclomatic complexity 16 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"736e5a8710fd0ac6cda7d327b7a481225a01b980f084364dd52453afac8dc33a"}},{"ruleId":"D2","level":"warning","message":{"text":"CPU6510_CE.initStates (cognitive 789): CPU6510_CE.initStates has cognitive complexity 789 (threshold 15). Drivers by points: if/else 285 (784 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 500). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ae88824f1f517deb8cb3e3ed27cd809b050d3d511f0ac773c414b7e9b94740"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmCompiler.compile (cognitive 172): AsmCompiler.compile has cognitive complexity 172 (threshold 15). Drivers by points: match/switch 24 (73 pts), if/else 37 (65 pts), loops 10 (25 pts), error handling 3 (7 pts), boolean chains 2 (nesting depth added 96). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmCompiler.scala"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc7e2eaaaa674b3beb06b49d3f54ffe3a16149dbb5f9e13d26e13fc2dfe6aca"}},{"ruleId":"D2","level":"warning","message":{"text":"VDC.drawTextLine (cognitive 136): VDC.drawTextLine has cognitive complexity 136 (threshold 15). Drivers by points: if/else 43 (109 pts), boolean chains 20, loops 3 (7 pts) (nesting depth added 70). 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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"043edf306f2d02c36dba7891730c4b1d99087140a54387474ad8d284f569ab2d"}},{"ruleId":"D2","level":"warning","message":{"text":"GFXShifter.shift (cognitive 123): GFXShifter.shift has cognitive complexity 123 (threshold 15). Drivers by points: if/else 59 (114 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"75110acb4cb944a67c32a5f9d43bcd11e1bed3a33bcc87321c91aa0da2dd3f55"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.eval (cognitive 118): Evaluator.eval has cognitive complexity 118 (threshold 15). Drivers by points: match/switch 16 (54 pts), if/else 23 (46 pts), loops 3 (9 pts), error handling 2 (8 pts), boolean chains 1 (nesting depth added 73). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmEvaluator.scala"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f663b991948fb4b456f732818293ebfaa10b76e5d6b030f98d9a1b735b5b8ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"VDC.drawBitmapLine (cognitive 112): VDC.drawBitmapLine has cognitive complexity 112 (threshold 15). Drivers by points: if/else 40 (96 pts), boolean chains 9, loops 3 (7 pts) (nesting depth added 60). 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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb66641af1ed24024605baabdd2efd61c575fd0506337880873c6ffd52fcf36f"}},{"ruleId":"D2","level":"warning","message":{"text":"VASYL.writeReg (cognitive 109): VASYL.writeReg has cognitive complexity 109 (threshold 15). Drivers by points: if/else 37 (102 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b4896af66941d7e939039b25609225957d70220efeea9d440272f3b3b4772d"}},{"ruleId":"D2","level":"warning","message":{"text":"VDC.write_regs (cognitive 105): VDC.write_regs has cognitive complexity 105 (threshold 15). Drivers by points: if/else 51 (101 pts), boolean chains 3, match/switch 1 (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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9148f708945ae1fbce47169b23c8ad936b887b2287c15c13bd819ed8923d80c7"}},{"ruleId":"D2","level":"warning","message":{"text":"Z80.initOpcodes (cognitive 95): Z80.initOpcodes has cognitive complexity 95 (threshold 15). Drivers by points: if/else 24 (59 pts), loops 8 (18 pts), match/switch 5 (17 pts), boolean chains 1 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8b78fbc976f535d6e5937b32678e1a8b92c57669eed55889a3c8ddef14b3d5"}},{"ruleId":"D2","level":"warning","message":{"text":"TAP.anaylize (cognitive 87): TAP.anaylize has cognitive complexity 87 (threshold 15). Drivers by points: if/else 28 (74 pts), match/switch 1 (7 pts), boolean chains 5, loops 1 (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":"Kernal64/src/ucesoft/cbm/formats/TAP.scala"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"23107c3de3e5b21ce3de58fac6614b6746f8bfaefec53054c8d643e0e85f98ba"}},{"ruleId":"D2","level":"warning","message":{"text":"MPS803GFXDriver.paintComponent (cognitive 74): MPS803GFXDriver.paintComponent has cognitive complexity 74 (threshold 15). Drivers by points: if/else 14 (52 pts), loops 5 (20 pts), match/switch 1 (2 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/printer/MPS803GFXDriver.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7dc528134d70ce52bb0c7a2a4790062b6716e3db481b6b6486958ef22b4ed5"}},{"ruleId":"D2","level":"warning","message":{"text":"EN25QH128A.clock (cognitive 70): EN25QH128A.clock has cognitive complexity 70 (threshold 15). Drivers by points: if/else 36 (66 pts), match/switch 2 (4 pts) (nesting depth added 32). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/EN25QH128A.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3179b31108953ae83eac42546b0053131785df8ce37ba655e111f860f2adeb2e"}},{"ruleId":"D2","level":"warning","message":{"text":"SCPU_MMU.writeRegisters (cognitive 65): SCPU_MMU.writeRegisters has cognitive complexity 65 (threshold 15). Drivers by points: if/else 24 (48 pts), boolean chains 16, match/switch 1 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec61321306869152592ddc56c304684b42cadf632132c3b31b7285c202f2d31d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgramLoader.checkLoadingInWarpMode (cognitive 64): ProgramLoader.checkLoadingInWarpMode has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (53 pts), boolean chains 10, match/switch 1 (nesting depth added 36). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/ProgramLoader.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4034a95af3c7c026427d6802e0c4141a2db39b82ebe8102aa42a761263b9ba79"}},{"ruleId":"D2","level":"warning","message":{"text":"TracerConditionEvaluator.eval (cognitive 63): TracerConditionEvaluator.eval has cognitive complexity 63 (threshold 15). Drivers by points: if/else 23 (39 pts), match/switch 11 (21 pts), boolean chains 3 (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/trace/TracerConditionEvaluator.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3f89b819c9ef5e76c143b27a5c5c46e7cb1de4dacfd94ea6556af5cf37f99c"}},{"ruleId":"D2","level":"warning","message":{"text":"IECBusDevice.clock (cognitive 62): IECBusDevice.clock has cognitive complexity 62 (threshold 15). Drivers by points: if/else 20 (52 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/bus/IECBusDevice.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"044dba06b16be40d968d914aa7b5f8352e08fad5d6c41dbaef9bbab712f11030"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.resolve (cognitive 61): Assembler.resolve has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 10 (36 pts), if/else 12 (24 pts), loops 1 (nesting depth added 38). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/Assembler.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a526f0727b23138223edb209eadd175b44056ec7782476c359ce6b85e02d38"}},{"ruleId":"D2","level":"warning","message":{"text":"MAIN_MEMORY.read (cognitive 60): MAIN_MEMORY.read has cognitive complexity 60 (threshold 15). Drivers by points: if/else 33 (60 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":"Kernal64/src/ucesoft/cbm/c64/C64MMU.scala"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e39dba517997e512b29a732062c33249b67e77363761550789ea31bba60587e"}},{"ruleId":"D2","level":"warning","message":{"text":"GCR.GCR2track (cognitive 60): GCR.GCR2track has cognitive complexity 60 (threshold 15). Drivers by points: if/else 18 (56 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 39). 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":"Kernal64/src/ucesoft/cbm/formats/GCR.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"725ca1a2617dec06befbf178213d0b667e86ab357f986722357804fefb9d8653"}},{"ruleId":"D2","level":"warning","message":{"text":"M93C86.clock (cognitive 60): M93C86.clock has cognitive complexity 60 (threshold 15). Drivers by points: if/else 18 (49 pts), match/switch 3 (10 pts), boolean chains 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/M93C86.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d11319aba143b39c07e81d642913908b0292cb8a677d417a8f695bc572c49d1"}},{"ruleId":"D2","level":"warning","message":{"text":"VDC.drawLine (cognitive 60): VDC.drawLine has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29 (45 pts), boolean chains 15 (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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bde3a195b05febc435e89dcb63a659f9c45980e4a0b10c6663827bbc184da5"}},{"ruleId":"D2","level":"warning","message":{"text":"SCPU_MMU.readBank0 (cognitive 59): SCPU_MMU.readBank0 has cognitive complexity 59 (threshold 15). Drivers by points: if/else 41 (53 pts), boolean chains 6 (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c04c3688729b481d86f7683099d30f3f2143242105c3fb90a8b211e946c310"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimatedGIFWriter.getRGB (cognitive 56): AnimatedGIFWriter.getRGB has cognitive complexity 56 (threshold 15). Drivers by points: loops 12 (36 pts), if/else 15 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 27). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a976af618c7783be6bd8736aeac927cb9d02762957a7d0465e92e7a13ccf2071"}},{"ruleId":"D2","level":"warning","message":{"text":"TracerGUI.editBreakGUI (cognitive 54): TracerGUI.editBreakGUI has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 7 (19 pts), error handling 1 (4 pts), loops 2, boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68de3694b4d62d49f0a6350422c22f6392a2971a7011f7eecb44fb7823a941c"}},{"ruleId":"D2","level":"warning","message":{"text":"CBMCanvas.paint (cognitive 52): CBMCanvas.paint has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (37 pts), loops 5 (15 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/CBMCanvas.scala"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f4b20c6be96a3e0244fc13df11bc0649bcd55ede7ccdf205e7b06ca95cfd22"}},{"ruleId":"D2","level":"warning","message":{"text":"Z80.clock (cognitive 51): Z80.clock has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (36 pts), match/switch 3 (10 pts), boolean chains 5 (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":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":2990}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec4ece459d7a2d38236705c7bd8501246f67f422e1e13b490615a234c6cc4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"FindIDField.apply (cognitive 51): FindIDField.apply has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (51 pts) (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":"Kernal64/src/ucesoft/cbm/peripheral/drive/WD1770.scala"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d83405a757d09b88c59aab8319cfb4de62694f23603049daeb41e4d67558a8"}},{"ruleId":"D2","level":"warning","message":{"text":"D64_D71.addFile (cognitive 50): D64_D71.addFile has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (35 pts), loops 7 (8 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/D64_D71.scala"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c45b4ba65707551b27a20933a37d0a2005f698e0d27cf7f3e875671ad6ea16"}},{"ruleId":"D2","level":"warning","message":{"text":"IECBusDevice.writeByte (cognitive 50): IECBusDevice.writeByte has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (49 pts), match/switch 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":"Kernal64/src/ucesoft/cbm/peripheral/bus/IECBusDevice.scala"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6ea74ca1464d76b6e98a7ec884163bb384fe83184dad36d9b168c7fbe700eb"}},{"ruleId":"D2","level":"warning","message":{"text":"SCPU_MMU.writeBank0 (cognitive 49): SCPU_MMU.writeBank0 has cognitive complexity 49 (threshold 15). Drivers by points: if/else 29 (41 pts), boolean chains 8 (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":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca6db800ac68c0a2fbb3cb3f5b3b2f7c0fe2c4fbdf9e605aa5e3f26322d6ba9"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC_II.write (cognitive 48): VIC_II.write has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 6 (18 pts), boolean chains 2, match/switch 1 (2 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a3c6dcac81205844bbf813ae4699b1cdb7240c8b6709eb1c2eba310c97a6d9"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC_II.clock (cognitive 48): VIC_II.clock has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (34 pts), loops 4 (9 pts), boolean chains 4, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"785304768cae835178a58d062c0b096f55858cb55b1404eab2288f2eddb1032a"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC_II.drawCycle (cognitive 48): VIC_II.drawCycle has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 22). 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bfc8d8aca953a2b289e2a834a099539c4bf37a2bfdb11ffe4680686c6c6293"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimatedGIFWriter.encode (cognitive 47): AnimatedGIFWriter.encode has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (41 pts), loops 2 (5 pts), ternaries 1 (nesting depth added 31). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5055c51a4147c36b77ba668b58fe2719b9444b758adc04d346cbccc8e4a463b"}},{"ruleId":"D2","level":"warning","message":{"text":"CPU6510_CE.fetchAndExecute (cognitive 46): CPU6510_CE.fetchAndExecute has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 14, match/switch 1 (3 pts), error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae449b3f2d19dbd2a8c44e772c41451ddb528ff0f9cf62147bc493fb03bf9cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"Preprocessor.eval (cognitive 45): Preprocessor.eval has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 5 (19 pts), error handling 1 (2 pts), loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/Preprocessor.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7709c64ece3f3a3cf5e7d2383b65d7f26dfc65362cff6f5e8b242a44bfc1cedd"}},{"ruleId":"D2","level":"warning","message":{"text":"WiC64.executeCmd (cognitive 45): WiC64.executeCmd has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (23 pts), error handling 4 (9 pts), match/switch 4 (8 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/WiC64.scala"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6aba6ac3f2b8a3dede783c82074a250bb8ac204ba4a5a4da67c7499f000da99"}},{"ruleId":"D2","level":"warning","message":{"text":"CRTC6845.drawTextLine (cognitive 45): CRTC6845.drawTextLine has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 9, loops 3 (7 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1dcff26f159fbec55a99bbecba85add9c1bb539cedf0a42c39c4b036f0855b"}},{"ruleId":"D2","level":"warning","message":{"text":"CSDBSpi.games (cognitive 44): CSDBSpi.games has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (27 pts), error handling 2 (7 pts), match/switch 3 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/game/CSDBSpi.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"09deda74a50b05c8e57489f8f6036d0c4a7f1db5039100842a5bb58129e4f08d"}},{"ruleId":"D2","level":"warning","message":{"text":"MOS6525.setInterruptPin (cognitive 44): MOS6525.setInterruptPin has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 3 (8 pts), boolean chains 7 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/mos6525/MOS6525.scala"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f99d46eaf58825c0c1a8c1b9e808c1e68bd6f87e90fce4cd4a4049d5b2e262"}},{"ruleId":"D2","level":"warning","message":{"text":"MAIN_MEMORY.write (cognitive 42): MAIN_MEMORY.write has cognitive complexity 42 (threshold 15). Drivers by points: if/else 28 (42 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":"Kernal64/src/ucesoft/cbm/c64/C64MMU.scala"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c922a746835e1c90f4de4807f9d7913176b92f5dd0180014c86fe512effc40b5"}},{"ruleId":"D2","level":"warning","message":{"text":"CBMII.setGlobalCommandLineOptions (cognitive 42): CBMII.setGlobalCommandLineOptions has cognitive complexity 42 (threshold 15). Drivers by points: if/else 33 (37 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2645c62767de2f090a117e96909603d068f5ac344ba566999d8463bb460ec1a5"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteCodeBlock.sizeAndCheck (cognitive 41): ByteCodeBlock.sizeAndCheck has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 7 (14 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmCompiler.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"65679ae33209520267eccf039e4d9a67d9b122bb4288a3501f42f6c6cad763c2"}},{"ruleId":"D2","level":"warning","message":{"text":"CIATimerA2.enableTimer (cognitive 41): CIATimerA2.enableTimer has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 7 (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":"Kernal64/src/ucesoft/cbm/peripheral/cia/CIATimer2.scala"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a419ea83ee085639cdb50367c72895eb28a7eff9e740c452509593c7e1c9cf"}},{"ruleId":"D2","level":"warning","message":{"text":"MOS6525.write (cognitive 41): MOS6525.write has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 1 (4 pts), match/switch 2 (4 pts) (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/mos6525/MOS6525.scala"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d72764a59aaa51e0ec3f9e6a02cfa62cd62436991cebc5582ed025867312ed"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmBytecodeEmitter.emitByteCodeFor (cognitive 40): AsmBytecodeEmitter.emitByteCodeFor has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (12 pts), match/switch 5 (10 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmBytecodeEmitter.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"542772e5723feef64117235556b83676096a94dfb4ef93b00e23ff1195992a2b"}},{"ruleId":"D2","level":"warning","message":{"text":"CPU65816Disassembler.traceRegisters (cognitive 40): CPU65816Disassembler.traceRegisters has cognitive complexity 40 (threshold 15). Drivers by points: if/else 39 (40 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d409502c7cee5cd387a6c25fc9b43b97daad31bdc276442badc9d8fe666e97"}},{"ruleId":"D2","level":"warning","message":{"text":"D64_D71.findOrAllocateFreeSector (cognitive 40): D64_D71.findOrAllocateFreeSector has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (16 pts), boolean chains 1 (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":"Kernal64/src/ucesoft/cbm/formats/D64_D71.scala"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"19373713f6ba351117adbee32f15a57dc049887cefd0e7e3a87422fe3998e3ee"}},{"ruleId":"D2","level":"warning","message":{"text":"AMF29F040.write (cognitive 40): AMF29F040.write has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 2 (8 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AMF29F040.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b52c8650a1b4ee17001a5c5defa98524a97404d4644d1a87dbf2938b3c6b989"}},{"ruleId":"D2","level":"warning","message":{"text":"VDC.updateGeometry (cognitive 40): VDC.updateGeometry has cognitive complexity 40 (threshold 15). Drivers by points: if/else 27 (40 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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"8060a842a77654bdc2da4612f0b9a0dac5ee1723bdbd226216f18947b508ce8b"}},{"ruleId":"D2","level":"warning","message":{"text":"VASYL.cycle (cognitive 40): VASYL.cycle has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 6, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bd12bf83f0a6b353ffbd2b0548fec6ad6e9a31e7e279dfb06154cf51dbb83c"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteC64Server.run (cognitive 40): RemoteC64Server.run has cognitive complexity 40 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 6 (13 pts), error handling 3 (7 pts), boolean chains 2 (nesting depth added 23). 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":"Kernal64/src/ucesoft/cbm/remote/RemoteC64Server.scala"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62175f07d506b6a3004a9a250d7413f59d9e9ac4d17634d78101d5deb345d29"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractRS232.sendBit (cognitive 39): AbstractRS232.sendBit has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (36 pts), match/switch 2 (3 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":"Kernal64/src/ucesoft/cbm/peripheral/rs232/AbstractRS232.scala"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aab25a6622adeaa0a5f9842cc078f2d23dce337ea1bd9ceb87ac157bcf9b3d"}},{"ruleId":"D2","level":"warning","message":{"text":"PouetSpi.getContent (cognitive 36): PouetSpi.getContent has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 4 (13 pts), loops 3 (9 pts), error handling 1 (5 pts), if/else 5, boolean chains 4 (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":"Kernal64/src/ucesoft/cbm/game/PouetSpi.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"704eba184420591c4a880a8f13b0fb0f1ea43dd13a1de9cad58ed12a228846f6"}},{"ruleId":"D2","level":"warning","message":{"text":"MPS803GFXDriver.print (cognitive 36): MPS803GFXDriver.print has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/printer/MPS803GFXDriver.scala"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0731bd4cac8379c3e41716ed602beac363647c5da6b4d4591c5ae969ddcaa2c4"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC20FE3.read (cognitive 35): VIC20FE3.read has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 5, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (VIC20FE3.write) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b11f1e3f843a5212d224ff6dbf8e41a8634e5aa5f128403d25e268bd3b497fd"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC20FE3.write (cognitive 35): VIC20FE3.write has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 5, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (VIC20FE3.read) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f540e28b0d5c5e9777c1ce5bcb9d8deb406115078fee699c95cab08b9bdf5a"}},{"ruleId":"D2","level":"warning","message":{"text":"CRTC6845.drawLine (cognitive 34): CRTC6845.drawLine has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 8 (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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6041d8f076d39f30385e94c15148bd1c3de12e87e362e69a9eeb60e515871cf8"}},{"ruleId":"D2","level":"warning","message":{"text":"DrivesConfigPanel.initConfigPanel (cognitive 33): DrivesConfigPanel.initConfigPanel has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 4 (8 pts), match/switch 2 (4 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":"Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bc7353723593c6f3505d74b3510fa388a5c466dc9730f94a68a803bc9ff15a"}},{"ruleId":"D2","level":"warning","message":{"text":"C128RAM.getBankAndAddressP0_P1 (cognitive 32): C128RAM.getBankAndAddressP0_P1 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 8 (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":"Kernal64/src/ucesoft/cbm/c128/C128RAM.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aecf39ec8e10516a8423f5694f448edc062e7056353759cc5805e3322f362c"}},{"ruleId":"D2","level":"warning","message":{"text":"Z80.fetch (cognitive 32): Z80.fetch has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (28 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":2906}}}],"partialFingerprints":{"codehealthFindingId/v1":"a594957c1059a8dc047bf089f594c0a20e7be2b903cabcd0925a1353ccdabfc6"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmCompiler.compile (cognitive 32): AsmCompiler.compile has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 6 (15 pts), loops 5 (9 pts), if/else 6, error handling 1 (2 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmCompiler.scala"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7652b339eb72a7fdaa99b3deb40a1ce4ea9158df8fc641ae41110be1f55b79b"}},{"ruleId":"D2","level":"warning","message":{"text":"Preprocessor.process (cognitive 32): Preprocessor.process has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 7 (19 pts), if/else 6 (12 pts), loops 1 (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/Preprocessor.scala"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be5d40d971659ca86bc60825eeb5cd96ea8859d326f51aedd3e114392f7b2ae"}},{"ruleId":"D2","level":"warning","message":{"text":"CRTC6845.write_regs (cognitive 32): CRTC6845.write_regs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7891f44cc49b660102dba366b51d1ff40dbd2bf4e79327ac5bc28573dbb1d8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyboardMapperStore.load (cognitive 32): KeyboardMapperStore.load has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 18). 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":"Kernal64/src/ucesoft/cbm/peripheral/keyboard/KeyboardMapper.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"981bb63321dae28ce233251baa8983aa9c5b09d16516f215172d38df2cdfda0f"}},{"ruleId":"D2","level":"warning","message":{"text":"C128MMU.read64 (cognitive 31): C128MMU.read64 has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21 (28 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"7902cf8f8283b56e1e9951d812d7bb4b3327e8cd4d1317a36698cf9c450a4226"}},{"ruleId":"D2","level":"warning","message":{"text":"C128MMU.write64 (cognitive 31): C128MMU.write64 has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (28 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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0df1ca617f065e38ea90365e0833e9caf125c517a15aded3edb4fc996c6df67"}},{"ruleId":"D2","level":"warning","message":{"text":"CPU65816Disassembler.formatRegisters (cognitive 31): CPU65816Disassembler.formatRegisters has cognitive complexity 31 (threshold 15). Drivers by points: if/else 30 (31 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"35297b6249568dbf0f40c9a427feffd5f4d2ae7423b5be2dcd0d7e6d4e03e676"}},{"ruleId":"D2","level":"warning","message":{"text":"SCPU_MMU.readRegisters (cognitive 31): SCPU_MMU.readRegisters has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 2, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"04995bd08b9c0fd9e5f0e756a73c728ddf02239b5853da4bc9ee710622fdc3cd"}},{"ruleId":"D2","level":"warning","message":{"text":"C128RAM.write (cognitive 30): C128RAM.write has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 3, match/switch 1 (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":"Kernal64/src/ucesoft/cbm/c128/C128RAM.scala"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e39f4623a443774f4153d835a1002fddfac03aa709222543517a35e26b02380"}},{"ruleId":"D2","level":"warning","message":{"text":"CBM2MMU.readBank15 (cognitive 30): CBM2MMU.readBank15 has cognitive complexity 30 (threshold 15). Drivers by points: if/else 26 (30 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cbm2/CBM2MMU.scala"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7df5a7a8f5ada2cd7ebd8986a5e2100c3e8bee47d780d87d17c95ccadf32039"}},{"ruleId":"D2","level":"warning","message":{"text":"GameBaseSpi.getContent (cognitive 30): GameBaseSpi.getContent has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 5, boolean chains 3, error handling 2 (3 pts), loops 2 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/game/GameBaseSpi.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9087992465ea7ebf82240410e7064e001d0f4f5a855c6c999b482bc43a61bf3c"}},{"ruleId":"D2","level":"warning","message":{"text":"Time.tick (cognitive 30): Time.tick has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (30 pts) (nesting depth added 21). 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":"Kernal64/src/ucesoft/cbm/peripheral/cia/CIA.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b236351362cc3970f6f032f8add539833ff7793559ef2add8752193607c063"}},{"ruleId":"D2","level":"warning","message":{"text":"GamePadControlPort.read (cognitive 30): GamePadControlPort.read has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 3 (9 pts), match/switch 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/controlport/GamePadControlPort.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f154949fd0ecf0df9e30afecb2f035952f1468e9f766c3110b1c992d8651fd"}},{"ruleId":"D2","level":"warning","message":{"text":"FlyerIEC.handleChannel15 (cognitive 30): FlyerIEC.handleChannel15 has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18, boolean chains 12. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b902e695d6772ce4c6ea8a32c9ac496b8dc2fe253207fb44388ee2d1401cc6"}},{"ruleId":"D2","level":"warning","message":{"text":"C128MMU.vicReadPhi1 (cognitive 29): C128MMU.vicReadPhi1 has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 2 (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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"601ad8c3da683d265fd25f86182d655834a1f6a4e21a8db52c4bf7d7b46b13e3"}},{"ruleId":"D2","level":"warning","message":{"text":"CPU6510_CE.do_adc (cognitive 29): CPU6510_CE.do_adc has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6188abae0fec6f08985b41370d0cebdefc52261c466d3f3d5fa0b5fa873212"}},{"ruleId":"D2","level":"warning","message":{"text":"IEEE488BusCommand.dataAvailable (cognitive 29): IEEE488BusCommand.dataAvailable has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 2, match/switch 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":"Kernal64/src/ucesoft/cbm/peripheral/bus/IEEE488BusCommand.scala"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4125190414d2d5738ca0fc5d3f638b24fdeb804b155c326ac0561371a3a3e07d"}},{"ruleId":"D2","level":"warning","message":{"text":"IEEE488Drive.openNamedChannel (cognitive 29): IEEE488Drive.openNamedChannel has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 4 (8 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/IEEE488Drive.scala"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff16ffb8a9e1d8eb23b4431b7aca081faac24746fea816fc2f296c4b6542c17"}},{"ruleId":"D2","level":"warning","message":{"text":"TracerConditionParser.prune (cognitive 29): TracerConditionParser.prune has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 2 (3 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/trace/TracerConditionParser.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"27921ff33f040d3448a59f38fb5b3f93dec334cba0a6f068009bc027d1d95a64"}},{"ruleId":"D2","level":"warning","message":{"text":"WuQuant.quantize (cognitive 29): WuQuant.quantize has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 6 (7 pts), ternaries 2 (6 pts) (nesting depth added 11). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa86ff86e56e6f04d01152a4c248bba1484a0e3f2bb0dc0483d89cf1fd28c72"}},{"ruleId":"D2","level":"warning","message":{"text":"CBMComputer.loadState (cognitive 28): CBMComputer.loadState has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (6 pts), boolean chains 3, error handling 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ccd547fc0f7904806db6a42d6d52249e652caae27025105f1458b8a30ecd92"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.compileSource (cognitive 28): Assembler.compileSource has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), loops 2 (6 pts), error handling 2 (5 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/Assembler.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"746a6453fe6e80f7baeb2c4fb0765d82f6d65b1b8a9865b6f33537ceec06f203"}},{"ruleId":"D2","level":"warning","message":{"text":"VIA.shiftSR (cognitive 28): VIA.shiftSR has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/VIA.scala"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f9196899fdc7457d057628efb5420687efd9074b2355e16be95d130443afc1"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractDrive.loadDirectory (cognitive 27): AbstractDrive.loadDirectory has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 8 (13 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13839ca004979fb1e8a740e6b808c862f2bf0e82e363deea454c95d732c0744"}},{"ruleId":"D2","level":"warning","message":{"text":"FlyerIEC.configure (cognitive 27): FlyerIEC.configure has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (27 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fe7c703c4b8374297902a92d0d889555dae6fe560d88ee4fdfbbd31e2aaa5d"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvelopeGenerator.update (cognitive 27): EnvelopeGenerator.update has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, ternaries 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/EnvelopeGenerator.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac55879daa9adbc0f629a040e10d48f7f979702ec8905d77c5caac6a6924f84"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.handlePrePostIncDec (cognitive 26): Evaluator.handlePrePostIncDec has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (9 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmEvaluator.scala"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"533138b6bc346f6cc2474ac3497f5c44fd1926d32480cfed27b9f3aa43f9e86c"}},{"ruleId":"D2","level":"warning","message":{"text":"C128RAM.read (cognitive 25): C128RAM.read has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128RAM.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"31400736632e2c807f4f11d12b8d768cf966d28e5f8bd913f6dca81435f6ce74"}},{"ruleId":"D2","level":"warning","message":{"text":"AsmParser.asm (cognitive 25): AsmParser.asm has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (8 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmParser.scala"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc2347061f4a14343cb9f9caf620ebbf6c1feea17514fe1e45726812673ded3"}},{"ruleId":"D2","level":"warning","message":{"text":"Diskette.formatDirectoriesAsPRG (cognitive 25): Diskette.formatDirectoriesAsPRG has cognitive complexity 25 (threshold 15). Drivers by points: loops 8 (13 pts), if/else 7 (9 pts), match/switch 2, boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/Diskette.scala"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abe4b6e846133c91d1a3264e6583b42c5c57fa6b3cdcfde1daa8e9ffb799884"}},{"ruleId":"D2","level":"warning","message":{"text":"Display.paint (cognitive 25): Display.paint has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/Display.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"882aaffca7ee8ecb2f716c9472d5b4d955273dc04bb21cdc74f54c15bc4cc05e"}},{"ruleId":"D2","level":"warning","message":{"text":"Display.showFrame (cognitive 25): Display.showFrame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (23 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/Display.scala"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1c2752ad1ab2503526f38fded053f42d8541744a81f5851570a112ea20d558"}},{"ruleId":"D2","level":"warning","message":{"text":"Sprite.shift (cognitive 25): Sprite.shift has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4819eb88203c812fa0fb0484d5c2f81971616ce549a694fc215466798cf4b1cc"}},{"ruleId":"D2","level":"warning","message":{"text":"TracerGUI.editLabelGUI (cognitive 25): TracerGUI.editLabelGUI has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 2 (6 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c08e77652adebac08b85f300a6eeaa40b58583fa33c9c1840badc83c65d5c5"}},{"ruleId":"D2","level":"warning","message":{"text":"WuQuant.quantize (cognitive 25): WuQuant.quantize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 5 (6 pts), ternaries 2 (6 pts) (nesting depth added 10). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8fc386920b68340dd3633dbfcd33efc5244600da91c0747192c059e51a19e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.gte (cognitive 24): Evaluator.gte has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Evaluator.lte) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmEvaluator.scala"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69237e053f99650ee5f467b0010bbb3af6a3a1ffd8be9592496f33d9fa83344"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.lte (cognitive 24): Evaluator.lte has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Evaluator.gte) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmEvaluator.scala"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a47aaa123eeffb300fc3775d1a318a88a8b1a160f4c8f10afc1bf8bbb12d08"}},{"ruleId":"D2","level":"warning","message":{"text":"WiC64.read (cognitive 24): WiC64.read has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/WiC64.scala"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"07151e7627d150972ac8d2f9461bd8411f2565d82f5fc7a8ce5ceb39593bc8a5"}},{"ruleId":"D2","level":"warning","message":{"text":"GCR.sector2GCR (cognitive 24): GCR.sector2GCR has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), loops 6 (8 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/GCR.scala"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"390367ef45c4f5b6562bc4cc29656661c62835201aa275f48e624133e2d43580"}},{"ruleId":"D2","level":"warning","message":{"text":"IECBusDevice.decodeATNCommand (cognitive 24): IECBusDevice.decodeATNCommand has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (23 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/bus/IECBusDevice.scala"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5033ccbe3de76ca9fcef28725857660969a4afc6241a1b85558bd1cccbffebca"}},{"ruleId":"D2","level":"warning","message":{"text":"CRTC6845.updateGeometry (cognitive 24): CRTC6845.updateGeometry has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (24 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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e3ff934d3139544b707b2743e7fb35c19f6ea97f1c71d8524cac2a0903894b"}},{"ruleId":"D2","level":"warning","message":{"text":"VIA.clock (cognitive 24): VIA.clock has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 1 (3 pts) (nesting depth added 14). 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/VIA.scala"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"c550c60e1cfc5cffe1118fdce37264f582b658bfe93c788b2a3cd72734e75e15"}},{"ruleId":"D2","level":"warning","message":{"text":"WD1770.write (cognitive 24): WD1770.write has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 2 (3 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/WD1770.scala"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c69967d51a7a4484da87c2fbb4c826560b3e593d330a0f7730fffe2034e039"}},{"ruleId":"D2","level":"warning","message":{"text":"HostKey.parse (cognitive 24): HostKey.parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (6 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/keyboard/HostKey.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94fdbb37d3de61f33f53dcd18d7a45a2cd4e780ecc3c2da55438bf4da101ea3"}},{"ruleId":"D2","level":"warning","message":{"text":"C128MMU.readZ80 (cognitive 22): C128MMU.readZ80 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"177ff2dc6eae61f8429bc37db7e8e7779747c95c7353e30b66e6dbd8999db7e9"}},{"ruleId":"D2","level":"warning","message":{"text":"C128MMU.writeZ80 (cognitive 22): C128MMU.writeZ80 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2551791184b355738dd7aabf3068859506da6316710d7b98455a4e0ac04b2610"}},{"ruleId":"D2","level":"warning","message":{"text":"C128MMU.mem_read_0xD000_0xDFFF (cognitive 22): C128MMU.mem_read_0xD000_0xDFFF has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (22 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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc27ffedaa284654d3577edd8af5a043c9af87d40dfc178928ccc14559d79b3"}},{"ruleId":"D2","level":"warning","message":{"text":"C128MMU.mem_write_0xD000_0xDFFF (cognitive 22): C128MMU.mem_write_0xD000_0xDFFF has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c17ee62577b7e421e5ddbe89702861f4cc511f02fbc5c90375d33e867b70fb1"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.importFile (cognitive 22): Evaluator.importFile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (6 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmEvaluator.scala"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b123346a1e5ae3c2e40cc0a8a89633d17502ef16d303c32825db46e6776803"}},{"ruleId":"D2","level":"warning","message":{"text":"SwiftLink.write (cognitive 22): SwiftLink.write has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/SwiftLink.scala"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4f9c3b317d107aebe2683e020639742430be5bf3c67eae5fb3a9e9eb5df596"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC20Ultimem.read (cognitive 22): VIC20Ultimem.read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 10. 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":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20Ultimem.scala"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb67048a8301df9b4c21de31c840b34297fc1ce8582f744172bf037a5c97645"}},{"ruleId":"D2","level":"warning","message":{"text":"CIA.sendSerial (cognitive 22): CIA.sendSerial has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 1 (nesting depth added 14). 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":"Kernal64/src/ucesoft/cbm/peripheral/cia/CIA.scala"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f3507e4220729e9d06ce79ea7bce3a6bb046171d566831eb9ba2fbce0968ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Modem.run (cognitive 22): Modem.run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 3 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/rs232/Modem.scala"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a14f22b60492528975d1779a6d5062158099d5153f711fe7d8c4ceb83d08244"}},{"ruleId":"D2","level":"warning","message":{"text":"Breaks.isBreak (cognitive 22): Breaks.isBreak has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 5 (10 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"399e6747e1bf8be1e07a5cdf94da0375d9c67f5ca4601427181051323586e6b0"}},{"ruleId":"D2","level":"warning","message":{"text":"C128MMU.out (cognitive 21): C128MMU.out has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2c053eced5b3d67e9fb35a1ca6ec03a3c989bf8201568d9290d96ba76b6c17"}},{"ruleId":"D2","level":"warning","message":{"text":"C128MMU.read64_IO (cognitive 21): C128MMU.read64_IO has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f5e5e5d07e087feea59328ef59f577eaeaf65830b2319038f1f47b59387d17"}},{"ruleId":"D2","level":"warning","message":{"text":"CBM2MMU.writeBank15 (cognitive 21): CBM2MMU.writeBank15 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cbm2/CBM2MMU.scala"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f47ced5fe260442ad7e56d78ef4eba3264780df506aaa4a7a99abeaf50289ed"}},{"ruleId":"D2","level":"warning","message":{"text":"G64.directories (cognitive 21): G64.directories has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/G64.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"541d4a8bd25f692b77eb5b2f9475377d644af8625ac6adaebd5ffb90b348d439"}},{"ruleId":"D2","level":"warning","message":{"text":"Repository.load (cognitive 21): Repository.load has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 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":"Kernal64/src/ucesoft/cbm/game/Repository.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ba3882678f1cbf533c6818d827997069cf394c67b83030e84990e2995635ed"}},{"ruleId":"D2","level":"warning","message":{"text":"DNDHandler.importData (cognitive 21): DNDHandler.importData has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 7 (9 pts), boolean chains 1, error handling 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/DNDHandler.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3447139191befefe23bf9588d1450bfeb7ed41d81cbb84600aed18d922ad8a85"}},{"ruleId":"D2","level":"warning","message":{"text":"IECBusDevice.readByte (cognitive 21): IECBusDevice.readByte has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/bus/IECBusDevice.scala"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"757b07e88ecd5ba5e46c645a62a456bf6fbf419287adfac73d1c4ccc0418cb00"}},{"ruleId":"D2","level":"warning","message":{"text":"VDC.nextFrame (cognitive 21): VDC.nextFrame has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"a099270dd868b679d46743ce62efa34f02b97d93df5cf2b03658ac1253a1bcb5"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC_I.drawDisplayCycle (cognitive 21): VIC_I.drawDisplayCycle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_I.scala"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b5f33aee2622fafdfa3ebafd0d302aec8cb19981d5d85130681e82f7a76963"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC_I.clock (cognitive 21): VIC_I.clock has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_I.scala"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"be92141a9842402ef1a944da968f09346d867808c2a834414f7d4b86d9d6d69a"}},{"ruleId":"D2","level":"warning","message":{"text":"Sprite.producePixels (cognitive 21): Sprite.producePixels has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 2, loops 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6ef4b7e489aa0d63a59f0b3d28bc996922780ac30c13fa5c3af7259a9a98f9"}},{"ruleId":"D2","level":"warning","message":{"text":"VASYL.WAIT (cognitive 21): VASYL.WAIT has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"0979467895299a170065db638e8160d21fd8dce362b48cacaa3d95cdcbf10d06"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveRenderer.renderCycle (cognitive 21): DriveRenderer.renderCycle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (21 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/renderer/DriveRenderer.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad934a8769270dc5285dbf90051145ee11a09d977e03326a1bb3586bca7fd0ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Clock.run (cognitive 20): Clock.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/Clock.scala"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a11562b6f6cea29126dfc5d1c8b3dac70b8ace3b6171c9e5872948cb363d70"}},{"ruleId":"D2","level":"warning","message":{"text":"C128MMU.in (cognitive 20): C128MMU.in has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d181c70338208e49f30a24997f94903ae31e3428387e46cbef7a735cea49ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"MFM.physicalTrackToLogical (cognitive 20): MFM.physicalTrackToLogical has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/MFM.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b3a0b29f5bfb7f5e6911a158e0eca2f4d69e676e1eacdbe06e403ae3fec964"}},{"ruleId":"D2","level":"warning","message":{"text":"C1541Emu.executeCommand (cognitive 20): C1541Emu.executeCommand has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (18 pts), error handling 1, 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/C1541Emu.scala"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a850b7f3f6ca23671453122fc11957a0fc3d188aac2c515c5797127c187ccce"}},{"ruleId":"D2","level":"warning","message":{"text":"VIA.read (cognitive 20): VIA.read has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/VIA.scala"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e9435c3b8c44678620894d60e4383f2bd0928b3df32eb9507defeebfa6396f"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyboardThread.run (cognitive 20): KeyboardThread.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/keyboard/HomeKeyboard.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"31253b4173eee23cb13b0aa04b4c5fb8436afd6e9f66e45fa34751d10db5bb27"}},{"ruleId":"D2","level":"warning","message":{"text":"KBThread.run (cognitive 20): KBThread.run has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (11 pts), match/switch 2 (5 pts), error handling 1 (2 pts), if/else 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/remote/RemoteC64Server.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8aed400e6cd7fae208a319283c750559157ee4043fc3b18b0ae12084f824e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"CBM2MMU.readBank (cognitive 19): CBM2MMU.readBank has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (19 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":"Kernal64/src/ucesoft/cbm/cbm2/CBM2MMU.scala"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"72005f2317f4480e3385a78fed04b810f991e6fce2acbbbea48d032887eeb3eb"}},{"ruleId":"D2","level":"warning","message":{"text":"KeybEditor.clearConfig (cognitive 19): KeybEditor.clearConfig has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (8 pts), loops 1 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/KeybEditor.scala"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96ea7971a7418c6774aee8455b5d0aa06e6e59c9aaebfc0101a05c5eca55710"}},{"ruleId":"D2","level":"warning","message":{"text":"CIA.read (cognitive 19): CIA.read has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/cia/CIA.scala"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b16eaed023a6d9d09df852beb59cf6f37b2d88919c52856d5b5a9e857552aab"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC_II.read (cognitive 19): VIC_II.read has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"336e3a8a014cb0bfa0fcb172dc1a0fc52c91b63c760d18f50b6fe69321b9cde5"}},{"ruleId":"D2","level":"warning","message":{"text":"SCPU_MMU.write (cognitive 19): SCPU_MMU.write has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (19 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":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a7866b9738cba04fa436aa12ed330508b58225b5999c227ba77225b4f8fc8f"}},{"ruleId":"D2","level":"warning","message":{"text":"TracerGUI.init (cognitive 19): TracerGUI.init has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 5 (8 pts), loops 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":"Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a00a72026ff155b72ef8dcccfc490f9dd9ab5c7e241343f587b4a12ad81894"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvelopeGenerator.writeCONTROL_REG (cognitive 19): EnvelopeGenerator.writeCONTROL_REG has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 5 (8 pts), boolean chains 2 (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":"Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/EnvelopeGenerator.java"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf8878899827aad210a9b5678a3f3fe42f6df65aaae70a26d04ea4ddc2dc449"}},{"ruleId":"D2","level":"warning","message":{"text":"WaveformGenerator.set_waveform_output (cognitive 19): WaveformGenerator.set_waveform_output has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, ternaries 2 (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":"Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/WaveformGenerator.java"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0cf30f12221ec26df4f761d6bb062f97089ec38328fa5c90274165a278065d"}},{"ruleId":"D2","level":"warning","message":{"text":"C128MMU.configureFunctionROM (cognitive 18): C128MMU.configureFunctionROM has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (18 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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d81854169dd4dbbc7cb957ade24b2ae6b0d2126fe98da0a919f82e0e344d75"}},{"ruleId":"D2","level":"warning","message":{"text":"C128MMU.write64_IO (cognitive 18): C128MMU.write64_IO has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"9679c6f6582c63eade91aa705261ac1b298152ce5ddb176b1dd5f9acc9ba1420"}},{"ruleId":"D2","level":"warning","message":{"text":"CBM2MMU.writeBank (cognitive 18): CBM2MMU.writeBank has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (18 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":"Kernal64/src/ucesoft/cbm/cbm2/CBM2MMU.scala"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b51b4d72b391b22359ef3889eac197210f4cb23f7efcd6616532c0a80a4a8dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.encode (cognitive 18): Assembler.encode has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (9 pts), loops 3 (7 pts), if/else 2 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/Assembler.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb7556798b150569ff067553e9bbc694ebef225bd8706a46f66c2a3cbdaa466"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.mode (cognitive 18): Parser.mode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 5 (7 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/Assembler.scala"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"097ce746b58a84b874eccd02ec4fc51ca19fc7f2fff43048975c9f0d6ab0cc01"}},{"ruleId":"D2","level":"warning","message":{"text":"CPU6510_CE.do_sbc (cognitive 18): CPU6510_CE.do_sbc has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bce99ce34bb1f091b63d47b167e800c76c6292e198d16ced9bf181c02072eb"}},{"ruleId":"D2","level":"warning","message":{"text":"WiC64.dump (cognitive 18): WiC64.dump has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/WiC64.scala"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b465e49bfa395a4d4a7785f204b394ee5d2a358bd7058b1a5720904a0333542b"}},{"ruleId":"D2","level":"warning","message":{"text":"Diskette.load (cognitive 18): Diskette.load has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/Diskette.scala"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a3d6d2e12e714dbb8c37bc953ec748ab1ac42f708c37caab74dd43fa34a427"}},{"ruleId":"D2","level":"warning","message":{"text":"BasicListExplorer.createSource (cognitive 18): BasicListExplorer.createSource has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BasicListExplorer.createSourceCBM2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/BasicListExplorer.scala"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26bb469308fe692ad01dbbec366e3833712e966f9b6fbb580c5997f1d9f1921"}},{"ruleId":"D2","level":"warning","message":{"text":"BasicListExplorer.createSourceCBM2 (cognitive 18): BasicListExplorer.createSourceCBM2 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BasicListExplorer.createSource) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/BasicListExplorer.scala"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc17c4de3c548eee26adfb8508e76eed6a5443872e1b76bf01ee4ee3a38b36a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Preferences.parseAndLoad (cognitive 18): Preferences.parseAndLoad has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 2, error handling 1 (2 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/Preferences.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a020f994620948f46ece4ab0e63f00d2c61cd1f1951a46d822dfe24aec7cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"FlyerIEC.loadLocalDiskDirectory (cognitive 18): FlyerIEC.loadLocalDiskDirectory has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 4 (6 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5f5bb57d84f2167b3f8c0dfc921450091f16b6ed05f6ffca587044fd18a1a2"}},{"ruleId":"D2","level":"warning","message":{"text":"FindDataField.apply (cognitive 18): FindDataField.apply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (18 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/WD1770.scala"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9d7f786d76636b627f62dfe6aa22d3b1cba4835d517c97cbd6821628ffa8eb"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractRS232.setTXD (cognitive 18): AbstractRS232.setTXD has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/rs232/AbstractRS232.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a7102db200d6fdcd1d6f3ba9fcd00355cebd8110962671e6e71feec1d75a37"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimatedGIFWriter.dither_FloydSteinberg (cognitive 18): AnimatedGIFWriter.dither_FloydSteinberg has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"6494bf09e83800cf770006cd73b8aee4ec23dbb483b31ef5cadcf3d4d6378c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"C128.mainLoop (cognitive 17): C128.mainLoop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b9fe158ad6271e33de15f330863655cc7693f69a8c3723d909830d297a8aad"}},{"ruleId":"D2","level":"warning","message":{"text":"IEEE488InterfaceA.write (cognitive 17): IEEE488InterfaceA.write has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (17 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":"Kernal64/src/ucesoft/cbm/cbm2/IEEE488Connectors.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d963af1dd48e95bb52e16bb3e3bbf44cd9dd908badf0a4c57a63b12e2cd399"}},{"ruleId":"D2","level":"warning","message":{"text":"WiC64.sendHttpPOST (cognitive 17): WiC64.sendHttpPOST has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (3 pts), boolean chains 2, error handling 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":"Kernal64/src/ucesoft/cbm/expansion/WiC64.scala"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d66d0486ecabae9a7960dc991f29b685b8ad5335bab39b9ad14ad0477b86f7"}},{"ruleId":"D2","level":"warning","message":{"text":"FlashROM.getOrCreateBank (cognitive 17): FlashROM.getOrCreateBank has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (17 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/cart/EasyFlash.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a802b98cc37c3504bd8bcd0aa3e864aa297e67228d15e72cc9911b67efb89a"}},{"ruleId":"D2","level":"warning","message":{"text":"ROMPanel.makePanel (cognitive 17): ROMPanel.makePanel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/ROMPanel.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3176f336fca077e0129bc6e717c3f0e39a250c8f9d5e6c93e0647ce10be27597"}},{"ruleId":"D2","level":"warning","message":{"text":"CIA.write (cognitive 17): CIA.write has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/cia/CIA.scala"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd7c85dc83df9b79a5a177fa6f7a2bc888cdaa3663a1a753a343a38fbb4015a"}},{"ruleId":"D2","level":"warning","message":{"text":"IEEE488Drive.closeChannel (cognitive 17): IEEE488Drive.closeChannel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/IEEE488Drive.scala"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b21ddd188e07e9c427b439973cdfb1cf1329c888ac4d89ab72386e771dce15"}},{"ruleId":"D2","level":"warning","message":{"text":"IEEE488Drive.executeCommand (cognitive 17): IEEE488Drive.executeCommand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/IEEE488Drive.scala"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0d35137d6971b4ecc26fe7848b3febaff6113c7287bd64237f174151a82aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeKeyboard.read (cognitive 17): HomeKeyboard.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/keyboard/HomeKeyboard.scala"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c56dad5bef62feb55d2fa43d37822686d48d19410dd9fa87ccb1f4d7d99cb7d"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC_I.readRasterLine (cognitive 17): VIC_I.readRasterLine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_I.scala"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d7acd832d2ebf90e63aca5d8aae4e4f027acd58cf23bcc146a11bb90ccc940"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC20MMU.init (cognitive 17): VIC20MMU.init has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (16 pts), loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/vic20/VIC20MMU.scala"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbea92fe3ace91d1538d0910b1443aa207d8a978de004fcf42887731913c83f"}},{"ruleId":"D2","level":"warning","message":{"text":"DAC.build_dac_table (cognitive 17): DAC.build_dac_table has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 4 (7 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/DAC.java"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf6d22f9dd844aefdf100861072a31bd5f5b534914b0a667c32231a73bdd839"}},{"ruleId":"D2","level":"warning","message":{"text":"C128.init (cognitive 16): C128.init has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"254326bc8d60ca76d9304af8cb4a5d4480fbaf7d1499074b384c89f49c4e8742"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.sr2String (cognitive 16): Context.sr2String has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. 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":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"43da65f2250ea4e295fdabffe4248cc356135260c48bf434c6e6f7e05faa898a"}},{"ruleId":"D2","level":"warning","message":{"text":"CPU65816Disassembler.disassemble (cognitive 16): CPU65816Disassembler.disassemble has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2996a99a3dabea66af67d8dcdabd6e8ca51b678c1fa656efd26f0faacdf6e275"}},{"ruleId":"D2","level":"warning","message":{"text":"REUImpl.verifyOperation (cognitive 16): REUImpl.verifyOperation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"Kernal64/src/ucesoft/cbm/expansion/REU.scala"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf3a79032b276061e83d2aa926304726d33eb55d6543ecb170daa7dd73f5f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC20Ultimem.write (cognitive 16): VIC20Ultimem.write has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \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":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20Ultimem.scala"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"19097a578bea032706d69836127f35564455e0de186277a036a1dcc3273b3248"}},{"ruleId":"D2","level":"warning","message":{"text":"D64LocalDirectory.createDiskFromLocalDir (cognitive 16): D64LocalDirectory.createDiskFromLocalDir 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":"Kernal64/src/ucesoft/cbm/formats/D64LocalDirectory.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3211812dabc826519b1d11a3b1cc7c9ee1b059aa2d5a81283fad686a7625f66f"}},{"ruleId":"D2","level":"warning","message":{"text":"Diskette.directories (cognitive 16): Diskette.directories has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/Diskette.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bb663774b7fb7f16efa60c4084150ab701a7e0b766220cc7390c93e21813a7"}},{"ruleId":"D2","level":"warning","message":{"text":"EasyFlash.createCRT (cognitive 16): EasyFlash.createCRT has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/cart/EasyFlash.scala"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d230e1e4fc1f90a29c6f1822022adc623fd70d345afd6bb6144ce18da4a0a86"}},{"ruleId":"D2","level":"warning","message":{"text":"D1571.write (cognitive 16): D1571.write has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5 (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":"Kernal64/src/ucesoft/cbm/peripheral/drive/D1571.scala"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca94066d34122bebd0c7e9c88b422857fb91340fcaeec219cbb0dd86d452f9a9"}},{"ruleId":"D2","level":"warning","message":{"text":"D1571.clock (cognitive 16): D1571.clock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/D1571.scala"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"428097bb1fde1ef92ce68004021d1e6b66b740d29745d42ac0bc327bfc0b98a3"}},{"ruleId":"D2","level":"warning","message":{"text":"IEEE488Drive.executeBlockRead (cognitive 16): IEEE488Drive.executeBlockRead has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, error handling 1 (2 pts), match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/IEEE488Drive.scala"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfcc5e30aeb9d96cace04046db54e4afc63282388788c24fda3ab6a5e2d24f0"}},{"ruleId":"D2","level":"warning","message":{"text":"VIA.write (cognitive 16): VIA.write has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/VIA.scala"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9461d27433b50e50699e57734b796b812205ce975266d1ab485e30efb198a02"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeKeyboard.keyPressed (cognitive 16): HomeKeyboard.keyPressed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/keyboard/HomeKeyboard.scala"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaee7f0d6a7d012bdef2abedb9245cfc7cac074f9b90eaeeb37ff9b6a66a6cb"}},{"ruleId":"D2","level":"warning","message":{"text":"VDC.fetchGFXAndAttrs (cognitive 16): VDC.fetchGFXAndAttrs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a18d9398921b8e2f4bc68322d485c9d6da36eebcc8969733bee62097adfbaea"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC_I.fetchCycle (cognitive 16): VIC_I.fetchCycle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_I.scala"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"1804b39cbba4f3fca46a5aa6407021b2f8374ecae3c0bcb2bd308ea16de9cdfa"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC_II.gAccess (cognitive 16): VIC_II.gAccess has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b0e0e85afaf07e251add84272cb803e62059a2a528c624d8ea9421b0b8ba0b"}},{"ruleId":"D2","level":"warning","message":{"text":"VASYL.readReg (cognitive 16): VASYL.readReg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96f4735c93bb2d60954c8ae45c32314012e478be700310589df772b301db482"}},{"ruleId":"D2","level":"warning","message":{"text":"VIC20.setGlobalCommandLineOptions (cognitive 16): VIC20.setGlobalCommandLineOptions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/vic20/VIC20.scala"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadbb4e9873b0a23529b8eb966a5ea4fef29e5e16e56b1bd93bc0b55b9f33996"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimatedGIFWriter.writeFrame (cognitive 16): AnimatedGIFWriter.writeFrame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6b227c72b63a9817452d42c6d3ea9917c8028b10f78d042b16b634626e0a04"}},{"ruleId":"D2","level":"warning","message":{"text":"InverseColorMap.createInverseMap (cognitive 16): InverseColorMap.createInverseMap has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 1 (5 pts) (nesting depth added 10). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7ac9e05e6552babf9481f04ebd69bd697a5f64764a94decd6daa8b5b801701"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Context: TooManyMethods \u2014 142 methods. The bar is 30 methods; this is 112 over it, 4.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":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"77650392ad14ef50d3fbc54b49a46b68e4f993272e208ce9c0c778709e19dc55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cpu/Z80.scala: FileTooLong \u2014 2179 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1679 over it, 4.36\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":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44efa46460cef2b9160488d85e7b970c4b5b3dc37bb9919d4829ed29f3160d07"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CPU6510_CE: ClassTooLong \u2014 1709 significant lines (blank, comment-only and punctuation-only lines excluded), 50 methods. The bar is 400 significant lines; this is 1309 over it, 4.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":"Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d960f04e61f71b2ddf4435e3da4a6b251d07642ab586cf390cbc3ead5fd3d1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CBMHomeComputer: ClassTooLong \u2014 1375 significant lines (blank, comment-only and punctuation-only lines excluded), 69 methods. The bar is 400 significant lines; this is 975 over it, 3.44\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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9138735b2e7b7766a04bd00339a88837587102a629fe7465baa9d3aef527c71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cpu/CPU6510_CE.scala: FileTooLong \u2014 1716 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: CPU6510_CE (11-2327). The bar is 500 significant lines; this is 1216 over it, 3.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb7519593aea8de1bc645e4ca5025df0e1a88fd8bec1c0e072a132a3b950feb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VIC_II: ClassTooLong \u2014 1124 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 724 over it, 2.81\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":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3d124d1edf962aa82fc3ee6e643ce3cc8bcbe35d37cc5d0cdb247d523666d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cbm/CBMHomeComputer.scala: FileTooLong \u2014 1405 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: CBMHomeComputer (34-1900). The bar is 500 significant lines; this is 905 over it, 2.81\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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d8508f0d5df5213d8e5edfc1b7e32e337a05b63d8eccd3c3f0313350c342c0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnimatedGIFWriter: ClassTooLong \u2014 1043 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 643 over it, 2.61\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf2c88fa1122dcef33da3d70d7105f0288ebb33972df384cf425ee91e28a7b8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CBMComputer: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cded4280a2c047d86235eb43b121d8f1a18d994fee6f6eb0bd7bf126dafdeb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CBMHomeComputer: TooManyMethods \u2014 69 methods. The bar is 30 methods; this is 39 over it, 2.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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d10320ce4ecded1a42e7f740ca8a9aadb55e5ea8a6f6845739b9092a995f22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vic/VIC_II.scala: FileTooLong \u2014 1134 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: VIC_II (15-1709). The bar is 500 significant lines; this is 634 over it, 2.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"509984b8753be9c857a73cb36088aa32a36487fc9c878eb3da96b2a311580449"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AsmParser: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.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":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmParser.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73bf18bab459d15e3122685ef026c7db44212a6dd79cdf738fe46d390a66bb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: misc/AnimatedGIFWriter.java: FileTooLong \u2014 1053 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: AnimatedGIFWriter (32-1750). The bar is 500 significant lines; this is 553 over it, 2.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"398c82c4a8c0b58bd26e850db3b9c8ab2cd35494d43e4760766a2318264709d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: C128MMU: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfeb8ddac051f69e3b77bd191fad4793b2f38a44e66c45860ba18945d539317"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TracerGUI: ClassTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 361 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":"Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"818a0bfadfebcb7e9327eed684c5af6ec97139895aa18c123811e06cd857e8d5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: C128MMU: ClassTooLong \u2014 672 significant lines (blank, comment-only and punctuation-only lines excluded), 62 methods. The bar is 400 significant lines; this is 272 over it, 1.68\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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8230b9325fd085b5777df1cb290f5b7de58e4c36418e4504d1f12d1865af5a94"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CPU6510_CE: 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":"Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3495075ca7f990fd314076216addb5ee5962a107655874e7d9b6bfcd95c990c1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CBMCanvas: 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":"Kernal64/src/ucesoft/cbm/misc/CBMCanvas.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"636caf0dfe6218846d29814d755d8a9a4c1837b8b39ab3e08d9617e21a88567f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VASYL: ClassTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 253 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be73d3da6239760651d6131a3bdf9a030f6e232ff7f25d8df4555223d769f0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vic20/VIC20.scala: FileTooLong \u2014 782 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: VIC20 (34-1119). The bar is 500 significant lines; this is 282 over it, 1.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":"Kernal64/src/ucesoft/cbm/vic20/VIC20.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24c9b78b946cad129336820b0487a0900dbafff2b99994f2318aa42c36c5d0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: trace/TracerGUI.scala: FileTooLong \u2014 775 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: TracerGUI (18-1016). The bar is 500 significant lines; this is 275 over it, 1.55\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad9a1606d2e2e3822bec90c4975af004aad4c3d784275690a625175bdb2b065"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdc/VDC.scala: FileTooLong \u2014 758 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 258 over it, 1.52\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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b59abaf231ccf661e141280d33acf6709d632dd465eb3090f23a5ff3c843a8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: D64_D71: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/D64_D71.scala"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f48b4a9cc80ef1e2d0072607d453a9d13ccdab501253e91c54d0323417eaf9c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WD1770: ClassTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 200 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/WD1770.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"499a2c85f7117f4733b7649ef7bff8f5ebd4e68d530cf3fb7a57a08fff6ca35e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: c128/C128.scala: FileTooLong \u2014 739 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: C128 (30-1065). The bar is 500 significant lines; this is 239 over it, 1.48\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":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cab3964f1b7fe55744318438adbb52159cda65cd7b7f8b0a8545bafadfd0f2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FlyerIEC: ClassTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 162 over it, 1.41\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":"Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd53de89fca190dab1d17ccf6387c5bc435b4243b543c67cb6ef2cebaab4e1d8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VIC_II: 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"09de04bb87c543f66fdc85a783b83e6b09a76a88d5bf50db316d579c2050d220"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: c128/C128MMU.scala: FileTooLong \u2014 693 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: C128MMU (27-1055). The bar is 500 significant lines; this is 193 over it, 1.39\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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e610a951067f93641548c907d2f035d78f04c389868ee6ffdacae964bace6b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cbm2/CBMII.scala: FileTooLong \u2014 676 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: CBMII (36-975). The bar is 500 significant lines; this is 176 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1bf1c99a1a3d126d478372a1990c2d6ec0a878945ea602fba3cbdc29758d7d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VASYL: 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4318bc38460d20947c8ff640030718a83bb2af6fb3f9edd69d1a3031d69120e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scpu/SCPUC64MMU.scala: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 166 over it, 1.33\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":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d3897faf4bc2da5596cfb143ca7e67d3c3c0dee89f253b0bf2f88b5f927052"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: coprocessor/VASYL.scala: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: VASYL (10-874). The bar is 500 significant lines; this is 159 over it, 1.32\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":"Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b0c589f743233694508c49c968962ec78b64d40435a69fb13a556187bb0196"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expansion/WiC64.scala: FileTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 142 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/WiC64.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67f68442daf0882fe2645aadf7c52a1ccf2749b7f2e4092985fd327051a5fc0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AsmCompiler: ClassTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 108 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":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmCompiler.scala"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d628972c2eea8add637ae38b52741205a04b0ed122e511a09d91710b59233b99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cbm/CBMComputer.scala: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: CBMComputer (43-871). The bar is 500 significant lines; this is 134 over it, 1.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc35306c60eb5d5e2a48b079fe9259d6c7fbd99ca4ba0ddc1af45e7aa177b934"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Display: 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/Display.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f3a8d44232f91dc5c08bbafb9c33e249afa00a232137cfdbcbe9df943b8afe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VDC: 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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8b370d209510d3c81c24a1823c9afb9276977900ed55eb1ff1998bb8e8b9aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drive/WD1770.scala: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: WD1770 (11-867). The bar is 500 significant lines; this is 107 over it, 1.21\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":"Kernal64/src/ucesoft/cbm/peripheral/drive/WD1770.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"817ea938885cc73f4820c7c04faff32f96d10ee1e05903f2e4f217720d49ce75"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: asm/AsmCompiler.scala: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: AsmCompiler (131-839). The bar is 500 significant lines; this is 103 over it, 1.21\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":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmCompiler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3d5f6f7bc080b519547e54a4e1a4f81e8e12c098650ec33ffdf3c77ad32650"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CRTC6845: 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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"968b53d86e88d724abcbbb3705744325c16084ae779246ac9e30e4433c38744c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: D64_D71: ClassTooLong \u2014 469 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 400 significant lines; this is 69 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":"Kernal64/src/ucesoft/cbm/formats/D64_D71.scala"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e17cbe9e5a993d140421fc1fb7e7d6e421e853923f72a3a8614c99d2c9473bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drive/FlyerIEC.scala: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: FlyerIEC (11-776). The bar is 500 significant lines; this is 69 over it, 1.14\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":"Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"308bf36aebbe2cf25a4c93c851e4e5669dc324ef9dde2581c7f96d7bf2a3d0a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: asm/Assembler.scala: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded), about 62% of them inside a single declaration: AssemblerPanel (291-764). The bar is 500 significant lines; this is 61 over it, 1.12\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/Assembler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b854b8e395843198cb5e26fd56e143c86bbeed64dc2bb2b8d28b7706351b641"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VIC_I: ClassTooLong \u2014 438 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 38 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":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_I.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7b6ab1fde50119a58a8827a564160f7094f76875b3d1a00533cd95e36adfff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnimatedGIFWriter: 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":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a3ee56a3000b467318050a56c8f6f8a747d206aff2afc51b7e466a4c98dab5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VIA: 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":"Kernal64/src/ucesoft/cbm/peripheral/drive/VIA.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed113a64344572fadc09c60c000b82f9934a444197788498a8691dc4b758b56b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SCPU_MMU: 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":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b938b62073b2901f4d7b0b4504d6cef6a3b934499d2222e17328f68345029896"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: D1571: ClassTooLong \u2014 409 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/D1571.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8647804077982da651b10551316049261368b70ad7beed513d3debbd1554c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 19 shared lines): Kernal64/src/ucesoft/cbm/c128/C128.scala:1002-1064 | Kernal64/src/ucesoft/cbm/c64/C64.scala:480-521 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:78-126 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:508-556 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:1058-1113 \u2014 These 5 members are variants of one another: a block of 19 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10b51c3d37478a2cc59167c85bbf7e59219793531ca056c4a358c0fbb8dbc15"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (106 shared lines): Kernal64/src/ucesoft/cbm/c64/C64.scala:225-402 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:252-445 \u2014 These two members are variants of one another: 106 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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f1c6ad46d6c4cd8280b22ee2fa4624df3e8685168b6e94f78308fd5b537a9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (94 shared lines): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:930-1123 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:395-528 \u2014 These two members are variants of one another: 94 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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f48eb82223671a3f0b81462acfba27e783ac8d43e7b66b2d50a3b270b56b4be"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (68 shared lines): Kernal64/src/ucesoft/cbm/c128/C128.scala:569-846 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:252-445 \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":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd230bff985f4320a74928615abb5ba8b01791655d4d53cc4f831223a668665f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): Kernal64/src/ucesoft/cbm/c64/C64.scala:225-402 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:725-865 \u2014 These two members are variants of one another: 57 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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"96283e87c127c3158ff94ca7d02297643f87b41f761c9007ba7065c262c4735b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (54 shared lines): Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1077-1150 | Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1152-1216 \u2014 These two members are variants of one another: 54 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":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06b2b86387e9fb128c641037cee671cbf51449e92792ffd7ec0f6e3dfecb36a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (46 shared lines): Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:252-445 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:725-865 \u2014 These two members are variants of one another: 46 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":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1bf23e911e830768c929e2a888af27cbe53c892dfc2a70e5243b153566a3fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (45 shared lines): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:856-918 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:867-951 \u2014 These two members are variants of one another: 45 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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"f840fa217762b68f00730a8360e443d6b4ccdf64f6c76ff6562aa5c594403565"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (41 shared lines): Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala:103-170 | Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20Ultimem.scala:105-175 \u2014 These two members are variants of one another: 41 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":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a77aa035a4b69777d6bb2f6ac557203a5f1c08ec283fdf878a2819c01f3cec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala:36-109 | Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala:399-459 \u2014 These two members are variants of one another: 36 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79af2c1a47d9d27b87bd295cb8298f53128474ce2dd09fc7ae212219931b232"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (30 shared lines): Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:569-684 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:725-865 \u2014 These two members are variants of one another: 30 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":"Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"602c3384f2da5a577b181fb552c5f1415daa073a9431ad829afa5683adce5cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Kernal64/src/ucesoft/cbm/cpu/asm/AsmBytecodeEmitter.scala:145-155 | Kernal64/src/ucesoft/cbm/misc/CBMCanvas.scala:109-117 \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":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmBytecodeEmitter.scala"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57fd5d5a54969f197018e068f47fb395507bac359c74f52b1eceac61bbef61b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): Kernal64/src/ucesoft/cbm/CBMComputer.scala:475-494 | Kernal64/src/ucesoft/cbm/CBMComputer.scala:715-794 | Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:172-186 | Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:318-330 | Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:382-399 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:374-393 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f16a42c8542c9721064c80fa868dbdc5b03d9f139f383c98026cc64dfad955b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): Kernal64/src/ucesoft/cbm/c128/C128.scala:984-1000 | Kernal64/src/ucesoft/cbm/c64/C64.scala:468-477 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:67-76 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:496-505 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:1046-1055 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fcc3b8900c901ec8369b003ae902b9f9d94b250fa3f5b294f35c675d5c4b88"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): Kernal64/src/ucesoft/cbm/c128/C128.scala:87-274 | Kernal64/src/ucesoft/cbm/c64/C64.scala:52-148 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:59-162 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:98-189 \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":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db4aab2a027a32e6674f8e1a0572da9e326c39c1df8f490e750be8073a2001f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): Kernal64/src/ucesoft/cbm/c64/C64.scala:215-223 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:923-931 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:242-250 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:262-270 \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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8d14de6b6b0eb146444d7b93acbcabcd748e5d5cb8b14f8fee0aee7fdf77c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): Kernal64/src/ucesoft/cbm/c64/C64.scala:412-425 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:554-567 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:447-460 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:953-966 \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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce47aaf2ad015e54ded703d68774fdb02a69924c5ef35e20dc3b55c73b15a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:952-1002 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:398-448 \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 \u0060Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:952\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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f852754cd3514fd5e65849139f27443e0bcf81badebaed231c8e12168f191fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c128/C128.scala:781-822 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:352-393 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 175 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":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d05b66fb77fe90f35a2ad44f359cf4192186e2dd5d5096b70c7b3b77e03e276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201341 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala:237-269 | Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:320-360 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 118 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 \u0060Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala:237\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, \u0060Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:318\u0060 calls \u0060regs\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala:233\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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fca60712cfdc8f19917d78e14a2c53e195a7ca063a4734c03ed1cb15ef887d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c64/C64.scala:73-109 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:85-121 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 416 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:84\u0060 calls \u0060C64VICMemory\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:71\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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e12fcd11a79a753ae2d711fa025312f5c74a211d1cf88a3934db6d4c608cd43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c64/C64.scala:233-261 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:264-292 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 416 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 \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:233\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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5c7ef4b668714f8f3271e650d72bfb417515a272ce65402e6d0b3bdf062591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): Kernal64/src/ucesoft/cbm/c128/C128.scala:781-806 | Kernal64/src/ucesoft/cbm/c64/C64.scala:334-359 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:352-377 \u2014 \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 133 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:361\u0060 calls \u0060setIsepicSettings\u0060, \u0060setBeamRacerSettings\u0060 and \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala:810\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":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0fe330919fb780c5156b920f09daa718bcd74577820dcfc822cc6c94f13fa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala:147-172 | Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala:246-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala:174\u0060 calls \u0060fmt8\u0060 and \u0060Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala:278\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":"Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0480ba608d76bd3202abff60a9bca5f1c61f88c6e757aadc6dee2900d5bcda79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3): Kernal64/src/ucesoft/cbm/expansion/vic20/VIC201112IEEE488.scala:102-126 | Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala:125-149 | Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20Ultimem.scala:129-153 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/expansion/vic20/VIC201112IEEE488.scala:102\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, \u0060Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala:124\u0060 calls \u0060setSelected\u0060 and \u0060Kernal64/src/ucesoft/cbm/expansion/vic20/VIC201112IEEE488.scala:100\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":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC201112IEEE488.scala"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"255f8ff506fdfcf5d9f99b23a02375b30d818d5d44e539aaffdc242d9fcbedbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:1201-1225 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:503-527 \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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"243ec0ab1dd8f2f49f8eee6750445cd059d27f069fe64d79dbb4ba3b70daab39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c64/C64.scala:303-327 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:328-350 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 416 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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f277769fb55dbfe89295afc62c231536f6cdaa18d160dffa801b9d0c287ecfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala:118-142 | Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala:201-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/wd65816/CPU65816Disassembler.scala"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1458cf2c9a3797726d2a196b8fc30fc9b1871e6745a951443af35e160cd7512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): Kernal64/src/ucesoft/cbm/expansion/WiC64.scala:383-407 | Kernal64/src/ucesoft/cbm/expansion/WiC64.scala:435-459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/expansion/WiC64.scala:383\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Kernal64/src/ucesoft/cbm/expansion/WiC64.scala:434\u0060 calls \u0060log\u0060 and \u0060Kernal64/src/ucesoft/cbm/expansion/WiC64.scala:382\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":"Kernal64/src/ucesoft/cbm/expansion/WiC64.scala"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"9009d27c322eeed7fa5407a7051ebbe7359ef6e20006e729fe347ec0e2502029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:1055-1076 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:474-497 \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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"36323ce42b1fa2825a76cc7781fade411ac50bdaac13fa00cffe208c3046d8e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:826-849 | Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:927-950 \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 \u0060Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:826\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":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"227844e92c3d57b6135d103e28257a4f8801d1d0d80233bcf6868f3a0ae259bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 3): Kernal64/src/ucesoft/cbm/c64/C64.scala:503-521 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:536-556 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:1091-1113 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 416 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 \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:503\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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"847ac7a8c2935d5227fe94ff5097641e853f5f6074ae32eb875e72d788451380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201321 lines \u00D7 4): Kernal64/src/ucesoft/cbm/c64/C64.scala:484-497 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:84-102 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:514-530 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:1064-1084 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:484\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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf49f39047f6aba76c413c5428ad020c67f0fbef1d307524cbf5c802120144c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:1103-1123 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:509-528 \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 \u0060Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:1103\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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a37eb0bb29a162d2f7da753c41c9d0e3af77a0d066a0b802d03d24cff0a0652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/rs232/TCPRS232.scala:27-47 | Kernal64/src/ucesoft/cbm/peripheral/rs232/TelnetRS232.scala:25-45 \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":"Kernal64/src/ucesoft/cbm/peripheral/rs232/TCPRS232.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea07becffe2ba492b5b219caed3a835d164294a6d8c3c7c9cff55d06b676192a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201319 lines \u00D7 3): Kernal64/src/ucesoft/cbm/c128/C128.scala:1029-1041 | Kernal64/src/ucesoft/cbm/c64/C64.scala:494-507 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:524-542 \u2014 \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 133 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc75b451d930ebbefb6983c9c34c51d03f5eb7290a627554b773c594af24960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:883-897 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:893-911 \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. 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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dfc1fed9a1c6eead88457433d134c4c2efc9ee3c69d705b1213dfe3d6da11e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c64/C64.scala:157-175 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:171-189 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 416 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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8787c30b7e73cf481a6c6c6bb4f9c2e2cc103266605c55289cf007035d810609"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): Kernal64/src/ucesoft/cbm/c64/C64.scala:231-248 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:262-279 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:752-769 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 416 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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6007a0cc0931beb1241bce6a37b168ccadbec46d10ad9f3959254a17aac87d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:146-162 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:885-901 \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 \u0060Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:146\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":"Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0c5ab0477f1d626f2e5c304d69401da49150cec541b2c9cd994fc29d52609c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 4): Kernal64/src/ucesoft/cbm/c128/C128.scala:761-775 | Kernal64/src/ucesoft/cbm/c64/C64.scala:301-316 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:326-339 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:817-830 \u2014 \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 133 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ec1c6049b3bbefff225fac309ba8c848db9cb0cbf35e8b121bf56b3c078ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMComputer.scala:658-672 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:289-304 \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 \u0060Kernal64/src/ucesoft/cbm/CBMComputer.scala:658\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":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"166ef2382d0c199ef06c0b1e948d020862c71e1eb99d675af68a640dda7ae035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:905-918 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:936-951 \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 \u0060Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:905\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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c042afd9628974d966e82ccb0e4492bd4f33dc134fd201a00a2abe455963bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c64/C64.scala:56-71 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:67-82 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 416 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:84\u0060 calls \u0060C64VICMemory\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:73\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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"853b9220f7fb9ba15a33fc2ef4862ce02e6fa360d55ba49ecf2de3916c58e0a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala:72-87 | Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala:434-447 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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 \u0060Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala:72\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":"Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da6cb01deeca44a190488c3267c6a31d7c3e6f520f627887e42c6d1dc46f821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): Kernal64/src/ucesoft/cbm/cpu/Z80.scala:1022-1036 | Kernal64/src/ucesoft/cbm/cpu/Z80.scala:1055-1068 \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 \u0060Kernal64/src/ucesoft/cbm/cpu/Z80.scala:1022\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":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"04eb37da5e36b6950a3a288247299f0b8ee76a9f2dc05e8b996845ffe001fc71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:320-334 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:349-363 \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 \u0060Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:320\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":"Kernal64/src/ucesoft/cbm/vic20/VIC20.scala"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac0d07692f2bfbaef87c8aa572097af1e719b3f9310ab130caf4027c5758b71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala:58-71 | Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20Ultimem.scala:55-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1884c86b8122e26d7554e26f6451dba0568fd135fab8e46a769def860e6477f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Kernal64/src/ucesoft/cbm/formats/D64_D71.scala:193-206 | Kernal64/src/ucesoft/cbm/formats/D81.scala:28-41 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/D64_D71.scala"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f38d3583126b411b9664945ec840b18e28eaa4e39e677591b08ed55791ec2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Kernal64/src/ucesoft/cbm/game/GameBaseSpi.scala:194-207 | Kernal64/src/ucesoft/cbm/game/PouetSpi.scala:133-146 \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 \u0060Kernal64/src/ucesoft/cbm/game/GameBaseSpi.scala:194\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":"Kernal64/src/ucesoft/cbm/game/GameBaseSpi.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa917d58a8b5f9c830cb21b41b0b5408f4e01d7ef9f41d0f7af5a4571045645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala:37-50 | Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala:402-415 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0defa22ba0844bf7a9f1beda5706ab39b8c596c3b73b082206d1d70dfee5ba42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 5): Kernal64/src/ucesoft/cbm/c128/C128.scala:1035-1043 | Kernal64/src/ucesoft/cbm/c64/C64.scala:501-509 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:107-117 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:534-544 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:1089-1101 \u2014 \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 133 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"922fcececb444133bf0b1a7cd78715be862280a5947f2d5337d05cce4f578552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): Kernal64/src/ucesoft/cbm/c64/C64.scala:413-425 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:555-567 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:448-460 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:954-966 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. 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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"305da77034aa8085867c336c89bf794ca8cde2e8e994b7b18c1a3d873f575bdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c64/C64.scala:286-298 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:311-323 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 416 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:283\u0060 calls \u0060setOneFrameMode\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:308\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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaeef13ab4876ff30ae3122c23289c3f61aa1ceef1fd2ab9a6f7e5e3b43d4ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 5): Kernal64/src/ucesoft/cbm/c128/C128.scala:1005-1014 | Kernal64/src/ucesoft/cbm/c64/C64.scala:483-492 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:83-94 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:513-522 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:1063-1074 \u2014 \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 133 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala:1015\u0060 calls \u0060checkFunctionROMS\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:494\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":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"268c85841060d2c6d33fb80219aad8ae21d6e3f2cf7252479313c853f6042f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): Kernal64/src/ucesoft/cbm/c64/C64.scala:230-240 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:610-621 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:261-271 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:751-761 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ef29552ebbbdffeaa941ee4b095bb5fc951cfafa355d2f18556482d2040f1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): Kernal64/src/ucesoft/cbm/c128/C128.scala:284-295 | Kernal64/src/ucesoft/cbm/c64/C64.scala:152-162 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:166-176 \u2014 \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 133 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:168\u0060 calls \u0060clock\u0060 and \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala:302\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":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba515bd68ccd19f72d56e7e9fb59d0f41b65ab701b15dfaff1ab7160c99cbcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMComputer.scala:483-494 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:382-393 \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 \u0060Kernal64/src/ucesoft/cbm/CBMComputer.scala:483\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":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c27fda0941c5d9fec2c601dd8f196378abe24c28db23b67cc16478fd2af93e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:1328-1339 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:935-946 \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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c540b4f03d79d3fd4574e3bc8c7687d6d679184504ca244959415640e8af155d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Kernal64/src/ucesoft/cbm/formats/ProgramLoader.scala:20-31 | Kernal64/src/ucesoft/cbm/formats/ProgramLoader.scala:46-57 \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 \u0060Kernal64/src/ucesoft/cbm/formats/ProgramLoader.scala:20\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":"Kernal64/src/ucesoft/cbm/formats/ProgramLoader.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0a8ca3a3a7802d5c9631e4d0449688f2faf514b0f774524ef6db330f90303f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala:573-584 | Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:982-993 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 118 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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebaa6a35cf76bd7aa9a190c09c6c4ca15431f1a05d4ba15ad3f93e5fe697483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala:601-612 | Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:1020-1031 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 118 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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f668af331558f45538d5bfe80ff1b474f536105512b929e7fbe61bfdb93200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): Kernal64/src/ucesoft/cbm/c128/C128.scala:706-716 | Kernal64/src/ucesoft/cbm/c64/C64.scala:259-269 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:290-300 \u2014 \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 133 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala:706\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala:704\u0060 calls \u0060setVICModel\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:257\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":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c656e3662513b6e8096b1715e062f5c7dfcbcc50c8a5d9edd891df5ebf8f328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): Kernal64/src/ucesoft/cbm/c64/C64.scala:115-125 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:127-137 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:148-158 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 416 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:127\u0060 calls \u0060Datassette\u0060, \u0060setDatassette\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:140\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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"38434dd470b4a5082c13cc29259ccec5e5039210abbb1cad8f934a929bc6e0dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): Kernal64/src/ucesoft/cbm/c64/C64.scala:392-402 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:674-684 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:855-865 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:392\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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccb85cff07a62009719cf2568ea5bf926e45a468535343557b9105fdd5aaeac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): Kernal64/src/ucesoft/cbm/game/CSDBSpi.scala:85-95 | Kernal64/src/ucesoft/cbm/game/GameBaseSpi.scala:195-205 | Kernal64/src/ucesoft/cbm/game/PouetSpi.scala:134-144 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Kernal64/src/ucesoft/cbm/game/CSDBSpi.scala:97\u0060 calls \u0060Game\u0060, \u0060Some\u0060, \u0060URL\u0060 and \u0060Kernal64/src/ucesoft/cbm/game/GameBaseSpi.scala:206\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":"Kernal64/src/ucesoft/cbm/game/CSDBSpi.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa62e9b94e07ffd267accf4c2504404e6b8a4d638ec90aba14345ac355090fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:534-544 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:721-731 \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 \u0060Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:534\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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"44eeaa9ffe1eb53e9baad2c7aac4d136e921bde6969187d4dce379167a40f69b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala:325-335 | Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala:389-399 \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. 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":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"45df5e36ac3367d950559ca3410e41c38423cd76f28797e68fc52864d340e815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala:271-279 | Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:376-386 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 118 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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3c6a2495896db3e1f68fcf5b017eb1916bd8af156419a8c93c5a16ecbc8a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala:450-460 | Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:696-706 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 118 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 \u0060Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala:450\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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db35207272ce3070975b1fa061efcdcd9cb87e78d4ab9ac562687e7d3a26bf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): Kernal64/src/ucesoft/cbm/CBMComputer.scala:478-487 | Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:385-393 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:377-386 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bd7c8720d18fb64ab630ab84994825a629ab6fbca4de93f6f3a17888456caf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): Kernal64/src/ucesoft/cbm/formats/Diskette.scala:398-407 | Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala:89-97 \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 \u0060Kernal64/src/ucesoft/cbm/formats/Diskette.scala:398\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/Diskette.scala"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cb78f88d861eebbe2b94ef009233d1ebdb643c2d4283b242029d5c917670d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Kernal64/src/ucesoft/cbm/misc/BasicListExplorer.scala:387-396 | Kernal64/src/ucesoft/cbm/misc/BasicListExplorer.scala:400-409 \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 \u0060Kernal64/src/ucesoft/cbm/misc/BasicListExplorer.scala:387\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":"Kernal64/src/ucesoft/cbm/misc/BasicListExplorer.scala"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"be84dd239fb779ac3a74190ae6c4e9322c3b470ef3aa0a08bb059baeb3be0600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Kernal64/src/ucesoft/cbm/misc/DisplayEffectPanel.scala:36-45 | Kernal64/src/ucesoft/cbm/misc/GIFPanel.scala:48-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. 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":"Kernal64/src/ucesoft/cbm/misc/DisplayEffectPanel.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebe17ac058740529315a3fecb9497c34d4e53bb7214d35d98548d91099744eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala:622-631 | Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala:647-656 \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 \u0060Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala:622\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":"Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c29d5497ebd8f1f1251441186a858a18f68d5b57375de6aa48a9d58e944175e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala:632-641 | Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala:655-664 \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 \u0060Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala:632\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, \u0060Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala:631\u0060 calls \u0060requestFocus\u0060 and \u0060Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala:654\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":"Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3484b203c5f7ed758af73cb0c39db9f1444b6d63b7e7c2a6abc9bb4f710fe3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:455-462 | Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:491-498 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:358-366 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:455\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, \u0060Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:463\u0060 calls \u0060attachPRGAsDisk\u0060 and \u0060Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:367\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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"98adc1d34f9ee2f68b49426fa7dc7612374490a6679e4f0e716c2e0c38655500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:869-875 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:145-153 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:884-892 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. 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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"beec9ab9bf1ab629f48a33593550d6c3c2c70c99985f3a63df64e5c3b9fbd278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Kernal64/src/ucesoft/cbm/expansion/vic20/VIC201112IEEE488.scala:92-100 | Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala:114-122 | Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20Ultimem.scala:117-125 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC201112IEEE488.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ae2832fd7ef75d4a733ccdccbaa1dd8bdd122781e5772c984b08ea1a98e411"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c128/C128MMU.scala:904-912 | Kernal64/src/ucesoft/cbm/c64/C64MMU.scala:350-358 \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 \u0060Kernal64/src/ucesoft/cbm/c128/C128MMU.scala:904\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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cceedcc77e8f3a5b88e6e5f1069255a80af5f5663d4eb96481c49af7eab9ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Kernal64/src/ucesoft/cbm/cpu/asm/AsmEvaluator.scala:598-606 | Kernal64/src/ucesoft/cbm/cpu/asm/AsmEvaluator.scala:608-616 \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":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmEvaluator.scala"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"6678269143f7290dcff47b3956bab1aa7a0e4d89f06eade5e896243942dcf7c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala:38-46 | Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20Ultimem.scala:35-43 \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":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f42c6e112e8d03173a09cd73b9624fad9e5b077d33d9b33e61fc131c6a9e959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Kernal64/src/ucesoft/cbm/formats/Diskette.scala:242-250 | Kernal64/src/ucesoft/cbm/formats/Diskette.scala:269-277 \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 \u0060Kernal64/src/ucesoft/cbm/formats/Diskette.scala:242\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":"Kernal64/src/ucesoft/cbm/formats/Diskette.scala"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae15fe1728046b798b6fd782280cd162189cb32f1053207b5d2b879fc7a82fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Kernal64/src/ucesoft/cbm/misc/BasicListExplorer.scala:331-339 | Kernal64/src/ucesoft/cbm/misc/BasicListExplorer.scala:367-375 \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":"Kernal64/src/ucesoft/cbm/misc/BasicListExplorer.scala"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"399c1deef2bbd483b83fb56ad6270bba2ec6604fc2996bfd53119869c717f4c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala:561-569 | Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:970-978 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 118 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. 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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"3565e909eb20d942b31f1bd700cd11e4d9fb1ea20e8f14e1eacf54cd938af33e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala:622-630 | Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala:637-645 \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 \u0060Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala:622\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":"Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f0baae37bb616e18b417e93edd9d012e34e5a326034df604042af16e3ffb9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): Kernal64/src/ucesoft/cbm/CBMComputer.scala:482-489 | Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:320-326 | Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:389-395 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:381-388 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/CBMComputer.scala:482\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":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"855cd7f71f12c68de24daa92dd9bb160265d457c25cb73dbc6da1dcec786a760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): Kernal64/src/ucesoft/cbm/c64/C64.scala:216-223 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:924-931 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:243-250 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:263-270 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. 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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07f52d220711a9d437c4906b161c6c253ebe60c2a19d79afdf97278dd50e9d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): Kernal64/src/ucesoft/cbm/c64/C64.scala:297-304 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:650-657 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:322-329 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:813-820 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:306\u0060 calls \u0060addSeparator\u0060 and \u0060Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:659\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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1e353f6720f05f18401b5cb58cde95d3962ddf549cb7503fe5312533bf10ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): Kernal64/src/ucesoft/cbm/c64/C64.scala:136-143 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:867-874 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:150-157 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:136\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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da42bb632f904e7855e87d55485c4e9cda6186a154770ba2ec744d5dbf00be1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): Kernal64/src/ucesoft/cbm/c64/C64.scala:255-262 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:286-293 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:771-778 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 416 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 \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:255\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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc0c490b9cf42407e4a9168845b6a075c9ecf220c7e08ca80e34abb1444ebb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Kernal64/src/ucesoft/cbm/formats/D64_D71.scala:627-634 | Kernal64/src/ucesoft/cbm/formats/D80.scala:100-107 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"Kernal64/src/ucesoft/cbm/formats/D64_D71.scala"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"6736358765e5e859f6f33643c193e2ae5dbf757a9c49f34b7a229d3b19092469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala:52-59 | Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala:417-424 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/AbstractDrive.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"778e354580ef71b6c628fc65f00132f181c8a249833ec3f59a4c1f5b2c3f943d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/drive/IEEE488Drive.scala:483-490 | Kernal64/src/ucesoft/cbm/peripheral/drive/IEEE488Drive.scala:525-532 \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 \u0060Kernal64/src/ucesoft/cbm/peripheral/drive/IEEE488Drive.scala:483\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":"Kernal64/src/ucesoft/cbm/peripheral/drive/IEEE488Drive.scala"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06f912d7aba51c43fdd1159a9686d285fbca8c8fe33d20ae06f8b05cd7a25ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala:442-449 | Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala:452-459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala:442\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":"Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a87500c2be8c51a8175d17359ab274e694eb63e4900da9a4e88769dac47eb5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 4): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:857-863 | Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:864-865 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:129-137 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:868-876 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:864\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:863\u0060 calls \u0060add\u0060, \u0060Set\u0060 and \u0060Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:865\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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c88343087887d6603efb3e62c3014cf07a36fc9a9f395c35c2d10c28ca5e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): Kernal64/src/ucesoft/cbm/c128/C128.scala:164-170 | Kernal64/src/ucesoft/cbm/c64/C64.scala:113-119 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:125-131 \u2014 \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 133 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"084dfb4b3cb0f08c156474c96b43e26082f9ffd7344f01db041330f4692b43c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala:162-168 | Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala:181-187 | Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala:200-206 \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 \u0060Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala:162\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":"Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19559998b0a52ee75660bb93c58dff7c4da19708e5b452249cb0ab706f3e13a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMComputer.scala:651-657 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:282-288 \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 \u0060Kernal64/src/ucesoft/cbm/CBMComputer.scala:651\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":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"a794015a4bc2bc19b7fc3621bd411c2b71dab4c9722561ad9057f46faa912307"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:203-209 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:315-321 \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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7606ccae2df06b6c91e7fed22474536a58991fc099c34f770cccc5f5f343bea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:921-927 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:273-279 \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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"981a321aa7dc10b7f607029bc49bb1a823441848633c343baaca099a684cb22b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Kernal64/src/ucesoft/cbm/cpu/Z80.scala:1039-1045 | Kernal64/src/ucesoft/cbm/cpu/Z80.scala:1051-1057 \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":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c3eb3f7368d1fed8f9bec0a649b62ba61c76195d1c628213699179aa5760a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Kernal64/src/ucesoft/cbm/cpu/Z80.scala:1090-1096 | Kernal64/src/ucesoft/cbm/cpu/Z80.scala:1113-1119 \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 \u0060Kernal64/src/ucesoft/cbm/cpu/Z80.scala:1090\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":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"b473dd2b2805ed24d3819dbfed59f9c0f74eb68c6be83f1629b33b02bc44d61a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala:106-112 | Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20Ultimem.scala:108-114 \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 after the matched lines, \u0060Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20Ultimem.scala:116\u0060 calls \u0060add\u0060 and \u0060Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala:114\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":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afecb0f07e20e92bc45c5a662dc80b0177f3a63110a6057c5f0f4a02d7ec4de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Kernal64/src/ucesoft/cbm/misc/C64FileView.scala:28-34 | Kernal64/src/ucesoft/cbm/misc/DNDHandler.scala:27-33 \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 \u0060Kernal64/src/ucesoft/cbm/misc/C64FileView.scala:28\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/C64FileView.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a5d3301f7e59e48ce924d23640bd68fc034a0b62b126fecdaf59c3a58a05a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/drive/C1541Emu.scala:176-182 | Kernal64/src/ucesoft/cbm/peripheral/drive/LocalDrive.scala:134-140 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/C1541Emu.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7849086b07229fc00f41e41259b3982c3aa33859bfabeeda3ab1f9ca3fe0a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): Kernal64/src/ucesoft/cbm/c128/C128.scala:995-1000 | Kernal64/src/ucesoft/cbm/c64/C64.scala:472-477 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:71-76 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:500-505 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:1050-1055 \u2014 \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 133 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala:995\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":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"59057e981b172f4e41b3ca03ce1f239610f7b4bac2282d13d1b4f544ea74622b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): Kernal64/src/ucesoft/cbm/c128/C128.scala:705-710 | Kernal64/src/ucesoft/cbm/c64/C64.scala:258-263 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:289-294 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:774-779 \u2014 \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 133 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala:705\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, \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala:704\u0060 calls \u0060setVICModel\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:257\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":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3b941a434f484e1fbe1eeda3950d9de49a618cc3f9051cf46c1f0e47e7c0b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): Kernal64/src/ucesoft/cbm/CBMComputer.scala:727-732 | Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:173-178 | Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:319-324 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"add79e5df3294c33ac08daa11f30f58440eca26631239a4ebbfb2e85ce52e03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c128/C128MMU.scala:923-928 | Kernal64/src/ucesoft/cbm/c64/C64MMU.scala:184-189 \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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ef713ed22d5cd299b3ce488e9f71c353269c3031d934c4eed1ab5ffbfb79b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Kernal64/src/ucesoft/cbm/cpu/Z80.scala:486-491 | Kernal64/src/ucesoft/cbm/cpu/Z80.scala:562-567 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e7553ee66403c5be5a9e9f7696e69822c181c42d2361bab4de2b6b4b222e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Kernal64/src/ucesoft/cbm/cpu/Z80.scala:1075-1080 | Kernal64/src/ucesoft/cbm/cpu/Z80.scala:1135-1140 \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":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41a83a9a071f69ae151aea92d85edb4d2b4be3390596b547c15330c0f7cdd67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): Kernal64/src/ucesoft/cbm/c128/C128.scala:270-274 | Kernal64/src/ucesoft/cbm/c64/C64.scala:144-148 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:158-162 | Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:185-189 \u2014 \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 133 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/c128/C128.scala:270\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Kernal64/src/ucesoft/cbm/vic20/VIC20.scala:180\u0060 calls \u0060Signals\u0060, \u0060reset\u0060 and \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala:139\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":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bcfee3a109271c864592e3a271503af204ce36d3b96cd3534f07dea9ff1fee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala:145-149 | Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala:164-168 | Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala:183-187 | Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala:202-206 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala:145\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":"Kernal64/src/ucesoft/cbm/misc/DrivesConfigPanel.scala"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7688d54804005b962d13302bbe3e1e53a5285a0e342f4f0518b9c6a774cb0236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Kernal64/src/ucesoft/cbm/cpu/asm/AsmBytecodeEmitter.scala:150-154 | Kernal64/src/ucesoft/cbm/misc/CBMCanvas.scala:113-117 \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 \u0060Kernal64/src/ucesoft/cbm/cpu/asm/AsmBytecodeEmitter.scala: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmBytecodeEmitter.scala"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b11f81fb0d52c2f60419bb4783ab0f569904190430ec7a9c2a6ba88581992e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/mos6525/MOS6525.scala:235-239 | Kernal64/src/ucesoft/cbm/peripheral/mos6525/MOS6525.scala:246-250 \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 \u0060Kernal64/src/ucesoft/cbm/peripheral/mos6525/MOS6525.scala:235\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/mos6525/MOS6525.scala"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bd96c5efbe225435ed69a65ac293ba86f6a4cf76a56ffcd6ed290f454cadc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c64/C64.scala:199-204 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:226-231 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 416 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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e641ca4de64f9360844b3e97eb563ee51265fcba187ec31739b0b646b009293b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c64/C64.scala:206-213 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala:233-240 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/c64/C64.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala\u0060 as WHOLE FILES: this scan already matched 29 separate duplicated blocks between them, totalling at least 416 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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c307e8cf5586332120c5f24a3febad04ecac8ba8fafd55e16d9a56dbc7aba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c64/C64MMU.scala:59-64 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala:74-79 \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":"Kernal64/src/ucesoft/cbm/c64/C64MMU.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec1f567d2c555c9e441b0fa6adad6d72c9ef4aee186be7d72c815f5613817f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c64/C64MMU.scala:65-70 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala:80-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c64/C64MMU.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"977ff3bb385da8f6a2f75b0d5221644ee9f18cadfed7bd64889baf8c56212995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): Kernal64/src/ucesoft/cbm/expansion/GeoRAM.scala:31-36 | Kernal64/src/ucesoft/cbm/expansion/RAMCart.scala:59-64 | Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20GeoRAM.scala:44-49 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/GeoRAM.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f66c5d5a5b9f0ba88f10fd5bf3e4cf410f6a8641720599d6d65efa4122c2a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): Kernal64/src/ucesoft/cbm/formats/G64.scala:10-15 | Kernal64/src/ucesoft/cbm/formats/GCR.scala:23-28 | Kernal64/src/ucesoft/cbm/peripheral/drive/Floppy.scala:71-76 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/G64.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6bf9e6830c269e432b96423a8db718aa65710e22a28938197ea22525ded456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala:118-123 | Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:176-181 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 118 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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c2d33e9c344556c2031fa9c106ca655efc521de5f7f686491bc1cbce91fec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala:285-294 | Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:438-447 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 118 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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5069e39ddc21249754c968f47701392c8ff703b556f2f379530157d425f758e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala:552-557 | Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala:961-966 \u2014 before extracting anything, compare \u0060Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala\u0060 and \u0060Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 118 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":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f49421e4673c98e100d49752b9d200d1de7ac7bfdc8285e76f434f253b29ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:194-199 | Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala:307-312 \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 \u0060Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala:194\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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c87d2be1dadbdb9044f2fa2f530d93f5e8f65716d183a5ed41f9be815a54f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Kernal64/src/ucesoft/cbm/c128/C128MMU.scala:975-981 | Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala:374-380 \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":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"031364edf2a1adfcb48a2524246b7b73186a267c80ea33ed3a4a89b9344a91c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1102-1118 | Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1176-1192 \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 \u0060Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1102\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1119\u0060 calls \u0060Mark\u0060 and \u0060Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1193\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":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0958ba91c4f47af18aa4f28e002fc9b419e3a8f6dadabe9fdd10fa800fc2036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/SIDfilter.java:79-95 | Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/SIDfilter.java:99-115 \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 \u0060Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/SIDfilter.java:79\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":"Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/SIDfilter.java"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa046e65a3f7ff6544498d08470382b0159c9ae52d1470e6400ae98a624bdefa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/SID.java:89-102 | Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/SID.java:118-131 | Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/SID.java:147-160 \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 \u0060Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/SID.java: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. 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":"Kernal64/src/ucesoft/cbm/peripheral/sid/resid4/SID.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fda55dc719e007cc4302729ddadfe8cefabf0ec037d038a6753fc0bdb98658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:162-175 | Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:182-195 \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":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bc4f8901cddcd5250c09ddf7919712f924f27a1fa03d29b66e8fb7043e27ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1139-1150 | Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1205-1216 \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 \u0060Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1139\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fa2d569bfc30de30fcef4a7c6eeb084d5c342f2b8e5a282269b1a8f19cdb44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1082-1092 | Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1156-1166 \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":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0c9a85ece5802a487b447f22b2b5b730127dc636cbf9f78be97817cb6345ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1093-1099 | Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1167-1173 \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 \u0060Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1093\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":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a581e9c9da07122e37d51f357bd20480468243999f717a99db0ecaf7d9f5ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1124-1130 | Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1197-1203 \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 \u0060Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:1124\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":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71bd2994b57047f8e671572a2dde7f653c0ffa5f19b014259786a107527bde1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:485-489 | Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:551-555 \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 \u0060Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java:485\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":"Kernal64/src/ucesoft/cbm/misc/AnimatedGIFWriter.java"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dd2b1292ca87ca3309ac482108227743a6adce2dbe2705c25d99bd3af72d2c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CBMHomeComputer (LCOM4 10): CBMHomeComputer\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":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"238a9b47b4c56ab8b9d821dde922b4f900b011d0ef339f14dc0b84c652bd735a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: C64 (LCOM4 6): C64\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":"Kernal64/src/ucesoft/cbm/c64/C64.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"333e561277c63087d7ddc49a60048d0a68e7885480f7b08a5455799dbf9b67aa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MCPRESTServer (LCOM4 6): MCPRESTServer\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":"Kernal64/src/ucesoft/cbm/mcp/MCPRESTServer.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b079c791883bd7d30fb1ff697c223483b5300b89936964fc657730c3e10a2576"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CBMComputer (LCOM4 5): CBMComputer\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":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9181d7927a0cd1f64ecfc07f1d8b519bf1bdb9bc0900a311301e456fcf7f7f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CBM2MMU (LCOM4 5): CBM2MMU\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":"Kernal64/src/ucesoft/cbm/cbm2/CBM2MMU.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6293339ca60a355e602d2757d850df3a75131bfcd38684711fd583b108547559"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MFMRWHeadController (LCOM4 5): MFMRWHeadController\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":"Kernal64/src/ucesoft/cbm/peripheral/drive/MFMRWHeadController.scala"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3c39c73f69dfa155ebaa6cd8d8c15fecb146e78af9b7d4c4a4c2cf446c215e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HomeKeyboard (LCOM4 5): HomeKeyboard\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":"Kernal64/src/ucesoft/cbm/peripheral/keyboard/HomeKeyboard.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b33d08a21311d3b435f737b6582aee0a5267f0411c5ef02037ee41440f12897"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MMUStatusPanel (LCOM4 4): MMUStatusPanel\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":"Kernal64/src/ucesoft/cbm/c128/MMUStatusPanel.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1910d7ae533e10cedb64ba30aec122b9bcb05a907771346571d7ea81efbd643"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: KCS (LCOM4 4): KCS\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":"Kernal64/src/ucesoft/cbm/formats/cart/KCS.scala"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d0525c8c4b78dd8de139e03492f56d90895f83df7a609e687b52e78f21c2c8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MMUStatusPanel (LCOM4 4): MMUStatusPanel\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":"Kernal64/src/ucesoft/cbm/scpu/MMUStatusPanel.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6b679d3b5a8a3f34b014a36f0bef6f290b0a36d714768e1aa3f742a70186ef"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VIC20 (LCOM4 4): VIC20\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":"Kernal64/src/ucesoft/cbm/vic20/VIC20.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f9498f0e3b630370c7f71cf874ba04e6d1ad1f60df9d4d646df8499f87984f"}},{"ruleId":"D16","level":"warning","message":{"text":"bus factor 1 \u2014 one contributor carries this repository: 3 contributor(s) have commits in this repository (automation and bot accounts excluded), but the commits of a single one of them cover most of its history \u2014 84% of the 1139 commit(s) sampled \u2014 so the number of people who actually carry it is 1. This is not the ambient state of a solo project: there ARE other contributors, and if the one who carries the repository becomes unavailable, the knowledge behind most of its history goes with them. Spread the next changes deliberately \u2014 have a second contributor review or pair on them \u2014 and write down the parts only one person can currently change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a99f114ab4dfee37ae0bf0665b44c7468d85b809d361949e2b6258101fa1e5a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: preferences \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"226fc22db705adbe2df43ba58aefd1af49300508e87f8fbb5677b467751efc61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO : preferences \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"107a70d2d924c2b3c7697cf34e201f643099eaf47d4568e037845ff79f846ac6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/vic20/VIC20.scala"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7c60d150772be6ed9850e156f11e4601e416a977450a8bc1daca833f60c01d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"904b1f030cc42d40427b7ec3599f28eff47d3a6595d81ebf94ae0060177b1c31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/C1541Emu.scala"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71ddb97f587a7fbdad6b8d797047311fe24bc9fa00e78e287bc49b8f74a0338"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/EN25QH128A.scala"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6322086b8bf01b80d0b4680dc59a89abc6d16736958e49c8328eb5c377390ad3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/Z80.scala"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"26371fe4f2b628768b909ea4413ff5ba015125a218eeab27e615083b8f86ef56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmParser.scala"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d74ec3f36eafff058d6ece7fcc1a9455718ccaaee8b2e1cf435fb10d83cf56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmParser.scala"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc3654406f2fd689c6c8fd00b55d2f24f9d64bfadbbbafb3824df416610d402"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO testbench screen dim =\u003E display.setPreferredSize(new java.awt.Dimension(568,284)) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/vic20/VIC20.scala"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"505a9bb07d62449dbe938927da32b594c0a09d2377673f6df074ecad7449d5a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: vicZoomFactor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/vic20/VIC20.scala"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff123219848947751709c58a606ead006bb57264875a7f752c5269a9dd32ee5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO to be checked ?? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"51973ad6d3fba70f65d3b8faec53987b14d473554555be062778eceb939e30f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO to check if these values are correct \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VICModel.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d2f1421a928023c2bc5c8d480a17218cd00c605f11936f7b05c348fca9d13e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Display one more line if h-flipflop is already open \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_I.scala"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3909281f5eba4754814f757347e2c95a747b4f57a7b9b35d2c13a8a556a4bad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //var xcoord = xCoord(rasterCycleToDraw) // TODO: PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"96aad9d9867677261e50acab657343fb0f8e05dcfb8af83fb14c7eacb8d9cd8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //var xcoord = xCoord(rasterCycleToDraw) // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca68dd130b3fb55f23a2765cef35bcd404cf4eab32b53b161aa10df3813c6058"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e0e1c250814e0d7330be99946eb43cdd79e8866c43c97262c7887506092edb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"188a7aee3b1061f9f2f863aa3c18480b8058fb3b6f18f1ccb29a51a9081deec9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45d6f1de28c61efab0d713b3521f73164b7c11be446777405415fc6dd38bf13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23e4c8bcbe46d03ead14c8dc23e2882b4e260b082d3d473bafee7fa8846ed40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"42db67fce160fe62795c26c3e46f84b25b3fc779bdf38d353e0ba74a73e270fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cb9a55e06e246f7fb6ddf95192d9ac2b1e2d778318b810e2e079c10fab9102"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"690b0093aebdf46933846229a5fedef0376f093db417e20bfae0d5e201942934"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //val backgroundColor = if (counter \u003C 1) shadowBackgroundColor else VIC.this.backgroundColor // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d77ab976ae798fc0b890bf36cfc1554edfa2920a90b70b773b253b2b07f424b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //val checkLP = lightPenEnabled \u0026\u0026 displayLineToDraw == display.getLightPenY // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aad4b6fd7a07d2cdfcf73b42131495713084dd89bc043d8a5c1c67417a73b3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //xcoord = xCoord(rasterCycleToDraw) // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"03aa72edf99728d3fbaa4b1e823d72f03015faea12727c71a3920d1abe8efd20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // baseX = rasterCycleToDraw \u003C\u003C 3 // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"652e9ecbd4004e4fc399c8eeb47ec9f66b61568badc3f390aa2060081f05cbe3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // shadowBorderColor = borderColor // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1ed6ad610760983761bb16e123ddb5972ba276dc126639ad16cb24737f18cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // shadowBackgroundColor(offset - 33) = backgroundColor(offset - 33) // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2aa91372f7493aef703400dcc9c642f415b7f123ed488aeac9e1d983a87a0ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // backgroundColorChangedIndex = offset - 33 // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c265c96be617437c22a1edaad59495fda6f95975f810d81a7c169ca9f92938b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // var dataToDraw = -1 // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0103a7a75d21541b533a040b3f5f9eb7c1dc7171385729b83f2176c9b221eef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // vmliToDrawPipe = vmliToDrawPipe \u003C\u003C 8 | vmli // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2c85d796c3f5666ca16c70bf86234ac260a8090caa145277056b1c24780176"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // val outOfYScreen = displayLineToDraw \u003C= model.BLANK_TOP_LINE || displayLineToDraw \u003E= model.BLANK_BOTTOM_LINE // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"303956af2d5898c859040d5f0dc0c23bfa2f6e458bf4c38ba196fd2406a1191d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // val outOfXScreen = rasterCycleToDraw \u003C model.BLANK_LEFT_CYCLE || rasterCycleToDraw \u003E model.BLANK_RIGHT_CYCLE // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6eef66c46d225268c94cc312ee8a63e273af01ae71fd5deabb58348c8701313"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //val x = (rasterCycleToDraw - 1) \u003C\u003C 3 // TODO : PIPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/VIC_II.scala"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"63945cbc69b5d06a9094de6b9e76e48117f7661487dbccb70ef97687d8b5bcee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: grey dot kill \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/coprocessor/VASYL.scala"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"5413c2c53c7621d13987d9979dd099c4094b6700fddc775dd16423ff13d3d17e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack used to force vsync when no vsync has been reached at the end of raster path \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b62a903d899bd2825ede8098e5b4648ec4b3dcb633f64208eaf654290d69ce4"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack used to force vsync when no vsync has been reached at the end of raster path \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26a8072ba948460bc74ed7bcc2b992667d5c50f1c2ea8a2994d7176e0a2df4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO read/write direction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/C1541Emu.scala"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24883d93a162b06957e3d5c0681f722365adde6b8d857ccf53c910a9396d2d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO LOAD or SAVE CHANNEL \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/C1541Emu.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea4162b8d8583edb8eb4ee0d8f3486f27546f048db5e2a8b9c78c4d00fcd203"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO WD1770 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/D1571.scala"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52fe0b06307143fbdeedc2838adbacd9f8f8a365d0c1e3176e9f478964d7010"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: missing API to block allocate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/IEEE488Drive.scala"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9fb7e84c1322bcd67b388e838bc2dcf207682537c8ec7e955c6eda0227d936"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO put record record type in status bit 5 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/WD1770.scala"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"092bc4794db0cd54bf9f09e3ead416353070e8fb327ec62ce967dd9e62b1cabb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Timer counts underflow of timer A, TODO can be removed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/cia/CIATimer2.scala"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4f1ec25277d01ceed23d8de81f40510742ce4fa1737f8fea7f03f35de936e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO CHECK IF MUST BE SKIPPED SEPARATOR (1) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/WiC64.scala"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab5a6c69845dab74cafa188e39d2a504461533f6f3649dd01f081319330e838"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: else if (tapeAllowed \u0026\u0026 name.endsWith(\u0022.TAP\u0022)) attachTapeFile(file, None, autorun) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcf66ade6a5ee53afd195ab7a18394534407ad497b4aa1472dd116390eaa066"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO return also PB0, PB1 from bus (IFC, SRQ) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cbm2/IEEE488Connectors.scala"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b34cfe8bdf1f1a805c25c78651d8670b76fd9544b4d6b4241845a8230b0fa1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO to be verified \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cbm2/IEEE488Connectors.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"894098b3bdc9eed8080e59d923cd5eec02b6fc15b751faa2bafab73ff2ca5e2a"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: cycles used to load D64 files are not taken into account for limitcycles \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4233b94eb3755c63fb90f9d693e36d53a2db65039519f35449f9e7b897221f"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060Kernal64\u0060 (55271 LoC, 589 module-visible types across 39 directories). 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":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"089a6dbb52c5c4626eed674879b825015f4f58c6fd84f9115d11a0be7d47aaa7"},"properties":{"commitSha":"5dabe066da315614327349f754abe489979da20d"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9603565aa6069e0abcf535dcde33980e7f55a15fa6af1c7abedeeffe7f52bf08"},"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":"188b0fa7f5d9a6fe39b67b6c9d2c56717a9c8395e8dfaee45f9a83ed7f988f9a"},"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":"2219f42c42c2814b5e085f4af09f94ccc91560439478e9472f2d769c0a2c7484"},"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":"3b20c9e3f5f07cd9ed7d38e1ad9e3677b956fa28fa72534ce39bdba4769b42e6"},"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":"c1c4d842ef553eb52873da929a7fc534635918b905b0c725a59b981e2a469c27"},"taxa":[{"id":"CWE-918","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe088d604c150e24cc790a8b4917b5adc01587a1f057d6b40279ba36af300beb"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Floppy (16 abstract members): \u0060Floppy\u0060 declares 16 abstract members: \u0060isReadOnly\u0060, \u0060totalTracks\u0060, \u0060file\u0060, \u0060nextBit\u0060, \u0060writeNextBit\u0060, \u0060nextByte\u0060, \u0060writeNextByte\u0060, \u0060currentTrack\u0060, \u0060currentSector\u0060, \u0060changeTrack\u0060, \u0060setTrackChangeListener\u0060, \u0060notifyTrackSectorChangeListener\u0060, \u0060close\u0060, \u0060reset\u0060, \u0060save\u0060, \u0060load\u0060. Counted over its ABSTRACT members \u2014 a \u0060def\u0060 with no body or a \u0060val\u0060/\u0060var\u0060 with no initializer, once per signature; concrete members, private and protected members, and members of a companion \u0060object\u0060 are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/Floppy.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82187edd5ed01074e225aa3734631e9f76f0154317337d864ad2de94856990f"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is \u0060???\u0060: \u0060newStack\u0060 is a shipped member whose whole body is still \u0060???\u0060, and nothing in the repository overrides it \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmCompiler.scala"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"227bf79dcc736eae3da7069fde4249f576dbe995d027b7ff8e89feeae295b5d9"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is \u0060???\u0060: \u0060pop\u0060 is a shipped member whose whole body is still \u0060???\u0060, and nothing in the repository overrides it \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmCompiler.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec718ab4cef0c4262d89ecf2e8d1af5c459a6b81989f6bd4fcc80286e91269d"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is \u0060???\u0060: \u0060saveState\u0060 is a shipped member whose whole body is still \u0060???\u0060, and nothing in the repository overrides it \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/D8050.scala"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"745247ef110636e5195b6a2c6e5ac6a91d13519f8234532ebac56c6c8878a200"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is \u0060???\u0060: \u0060loadState\u0060 is a shipped member whose whole body is still \u0060???\u0060, and nothing in the repository overrides it \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/D8050.scala"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1be5dde39eb8d387486a7197aef5f13c97d1bc9e799eb80d5dc86e98e649844"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is \u0060???\u0060: \u0060allowsStateRestoring\u0060 is a shipped member whose whole body is still \u0060???\u0060, and nothing in the repository overrides it \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/D8050.scala"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fd369405ab76c5d263faf5f84ddf849c965a17d3d300a58fe68d31a31ed940"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is \u0060???\u0060: \u0060executeCommand\u0060 is a shipped member whose whole body is still \u0060???\u0060, and nothing in the repository overrides it \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a852da539708b5893284f1b3e14f4df0a8ced24adba3e511de4bd9f337ff0d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is ??? / NotImplementedError: \u0060newStack\u0060 is a shipped method whose whole body is \u0060???\u0060 (or throws NotImplementedError), and nothing in the repository overrides it \u2014 scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmCompiler.scala"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8c7ece6b48dc3d5709ab407762c7bf40bbc11ac35a5cc9e73e97e953fdcfce"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is ??? / NotImplementedError: \u0060pop\u0060 is a shipped method whose whole body is \u0060???\u0060 (or throws NotImplementedError), and nothing in the repository overrides it \u2014 scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/asm/AsmCompiler.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0c9dfa687c0fdf8cd8ef760c4f423f64ebb9a2e0a59a55e9977e8e4e1475cc"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is ??? / NotImplementedError: \u0060saveState\u0060 is a shipped method whose whole body is \u0060???\u0060 (or throws NotImplementedError), and nothing in the repository overrides it \u2014 scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/D8050.scala"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c837ae2b79cd3472ac45600d9941c371833f9a394d2cc5d5232b9c42e00c208"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is ??? / NotImplementedError: \u0060loadState\u0060 is a shipped method whose whole body is \u0060???\u0060 (or throws NotImplementedError), and nothing in the repository overrides it \u2014 scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/D8050.scala"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"633d2d8d7e3f38dd51628d2e57813057ab930f393ebbe6c17548dd1e32043815"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is ??? / NotImplementedError: \u0060allowsStateRestoring\u0060 is a shipped method whose whole body is \u0060???\u0060 (or throws NotImplementedError), and nothing in the repository overrides it \u2014 scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/D8050.scala"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9d939fbbf560178c4e2f44bbc4103dbae0fe9ff497c4a83b95b51e9b3cafb2"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is ??? / NotImplementedError: \u0060executeCommand\u0060 is a shipped method whose whole body is \u0060???\u0060 (or throws NotImplementedError), and nothing in the repository overrides it \u2014 scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/trace/TracerGUI.scala"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"233d8d6c0879ec0186da1a23ffcd64a6b534253569cb36ad7b2f4d65d89fef4f"}},{"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add scalafix or scapegoat (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 1074 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/build.yml"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060MessageDigest.getInstance(\u0022SHA-256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/game/Game.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5163ec8af8b9c660f169a05c61fc7badcdffa1b899e542f566ae019d570b1f07"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository runs an HTTP server and nothing in its Scala source or committed configuration secures the transport: no HTTPS served (akka/pekko-http \u0060ConnectionContext.httpsServer\u0060/\u0060enableHttps\u0060, an http4s builder\u0027s \u0060withTLS\u0060, Jetty\u0027s \u0060SslContextFactory\u0060, zio-http\u0027s \u0060SSLConfig\u0060, Play\u0027s \u0060https.port\u0060), no \u0060Strict-Transport-Security\u0060 header, HSTS middleware or Play \u0060RedirectHttpsFilter\u0060, no \u0060X-Forwarded-Proto\u0060 read or Play \u0060play.http.forwarded.trustedProxies\u0060 for a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: Kernal64/src/ucesoft/cbm/mcp/MCPRESTServer.scala:20 \u2014 \u0060cask.MainRoutes\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is set on a response this repository\u0027s Scala server sends \u2014 defense in depth, even when a proxy could set them. (\u22122.0 on this card.) The server: Kernal64/src/ucesoft/cbm/mcp/MCPRESTServer.scala:20 \u2014 \u0060cask.MainRoutes\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"S1","level":"note","message":{"text":"No inbound request validation detected: No handler of this repository\u0027s Scala server answers 400, 413 or 422 (\u0060BadRequest\u0060, \u0060StatusCodes.BadRequest\u0060, \u0060Status.BadRequest\u0060, \u0060UnprocessableEntity\u0060), and nothing declares validation \u2014 no Play \u0060Form(mapping(\u2026))\u0060 or \u0060validate[T]\u0060, no tapir \u0060Validator\u0060, no akka/pekko-http \u0060validate(\u2026)\u0060 or \u0060withSizeLimit\u0060, no validation library (refined, iron, accord, cats \u0060Validated\u0060, Jakarta Bean Validation) \u2014 nothing shows inbound requests being checked, and refused, before a handler acts on them. A check that answers its failure with 200 and an error body is not seen. (\u22122.0 on this card.) The server: Kernal64/src/ucesoft/cbm/mcp/MCPRESTServer.scala:20 \u2014 \u0060cask.MainRoutes\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0ffa303f3c9cef4b4c2cf028a78ce2f3c83f6078f80716eea7362fad047265eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!stateLoading \u0026\u0026 Thread.currentThread != Clock.systemClock\u0060 appears character-identically in 3 files \u2014 Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala, Kernal64/src/ucesoft/cbm/c128/C128.scala, Kernal64/src/ucesoft/cbm/vic20/VIC20.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5aa672777a555ad29582cfe493438b148180dfb779a7d767fe0f0a101fe77c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(address \u003E= 0x1000 \u0026\u0026 address \u003C 0x8000) || (address \u003E= 0xA000 \u0026\u0026 address \u003C 0xD000)\u0060 appears character-identically in 3 files \u2014 Kernal64/src/ucesoft/cbm/c128/C128MMU.scala, Kernal64/src/ucesoft/cbm/c64/C64MMU.scala, Kernal64/src/ucesoft/cbm/scpu/SCPUC64MMU.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f22189ab36a1988865c14a97c7313ab2c7b6e79e1b77d67461265a9f7549c9d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(cursorTopLine \u003C cursorBottomLine) currentCharScanLine \u003E= cursorTopLine \u0026\u0026 currentCharScanLine \u003C= cursorBottomLine\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala, Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5437c7d86d6ead3bbee2120b003f6b7b09faba8bcab43d6c9fd11ea9fda9d80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060adaptScreenResolution \u0026\u0026 newScreenHeight \u003E MIN_HEIGHT \u0026\u0026 newScreenHeight \u003C MAX_HEIGHT \u0026\u0026 newScreenHeight != currentHeight\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala, Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4246e23b0a853410f93a53551ac67afdaee512204d9d04b43d0a27d4a0d003b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060breakType != null \u0026\u0026 breakType.isBreak(IRQBreakInfo())\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala, Kernal64/src/ucesoft/cbm/cpu/Z80.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec738207907d869a8a0b4378b3b1a65115648b4db7baa1e5568021f8bbcfc9b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060breakType != null \u0026\u0026 breakType.isBreak(NMIBreakInfo())\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala, Kernal64/src/ucesoft/cbm/cpu/Z80.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6215249ca39cf31f31a8634ed73f43124b70f66d1aab04994870fb524543eb0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060breakType != null \u0026\u0026 breakType.isBreak(ResetBreakInfo())\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala, Kernal64/src/ucesoft/cbm/cpu/Z80.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cpu/CPU6510_CE.scala"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c786b342b1e7d71ab2ef4d04b6632827e55f19944ac733411a13641c8ac07fcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cartButtonRequested \u0026\u0026 cpu.isFetchingInstruction\u0060 appears character-identically in 3 files \u2014 Kernal64/src/ucesoft/cbm/c128/C128.scala, Kernal64/src/ucesoft/cbm/c64/C64.scala, Kernal64/src/ucesoft/cbm/scpu/SCPUC64.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128.scala"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"924f29f3407f78a9092021e436ffcd871445a3dd7ac3284e5930e8322c921a77"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060channel == 15 \u0026\u0026 channels(channel).fileName.length \u003E 0\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/peripheral/drive/C1541Emu.scala, Kernal64/src/ucesoft/cbm/peripheral/drive/FlyerIEC.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/drive/C1541Emu.scala"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d797fd7e8d7f50a3eff75162569db784dc8200e9e552e92c04d36709ed1809fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060colPix \u003C borderWidth || colPix \u003E= rightBorderPix\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala, Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eec409558797094c5ef4db13f1f2ee38b5782f74798bd5f1305735288550ae2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060currentCharScanLine \u003C cursorBottomLine || currentCharScanLine \u003E cursorTopLine\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala, Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c9d99ea2cc6f3edf09f34c51479d5b1b6d03c90e34614b88e71ca58fad4489"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data_falloff_bit7 \u0026\u0026 (data_set_clk_bit7 \u003C clk)\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/c128/C128MMU.scala, Kernal64/src/ucesoft/cbm/c64/C64MMU.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/c128/C128MMU.scala"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcd0075f67c568692cd1886f4799c44db8729217ff17c45feb9444f8fde8831"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entryIndex == 9 || buffer.forall(_ == 0)\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/formats/Diskette.scala, Kernal64/src/ucesoft/cbm/formats/G64.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/Diskette.scala"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16f4b0678bad840779a6356b826031ee58cd9cd5e33cc87c0c23068855e3aee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.isDirectory || f.getName.toUpperCase.endsWith(\u0022.PRG\u0022)\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala, Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/CBMHomeComputer.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b618f57594c32d93f5221d5ea58fe5870dbb0b4248fca2b8ed24786ea4c350"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.isDirectory || f.getName.toUpperCase.endsWith(\u0022.TAP\u0022)\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/CBMComputer.scala, Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c934b3bd979dd9dc45935ab13265ab64074f30ffa67057395796ed4ae6d82f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060imageWriteBack \u0026\u0026 flash.hasBeenWritten()\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala, Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20Ultimem.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/vic20/VIC20FE3.scala"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b388b484c8eee72755eaa47193223c69ca6c553953e7894724d489c6701245"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keybThreadRunning \u0026\u0026 strpos \u003C txt.length\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/peripheral/keyboard/BKeyboard.scala, Kernal64/src/ucesoft/cbm/peripheral/keyboard/HomeKeyboard.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/keyboard/BKeyboard.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7be965dcbf58b7e51ea6690a82829fdb3979e7afaf89a227f5f003dcdd6f818"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ram_ptr == cursor_pos \u0026\u0026 cursorMode != 0x20\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala, Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"6447be616123a813b03567106ab717e38e29114aa3dc9235fc5408b290c699f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060regs(7) \u003E regs(4) \u0026\u0026 rasterLine \u003E= screenHeight\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala, Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bdf23b140ace97c93e9045e366f00e31f7d6ba336791437076c19e0d6fdcff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rowCounter == regs(7) \u0026\u0026 rowCounterY == 0\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala, Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c168054a7a93ba52ef4be38dc1bbe1dcc7ded138308db06e88a1987cddbab4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rowCounter == visibleTextRows \u0026\u0026 currentCharScanLine == 0\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala, Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdab1b742cfc22b70e79d743a2208d78fe26d5aeee678e52c0bbfce2ddc9331"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060vsync || videoMode == VideoMode.IDLE || videoMode == VideoMode.BLANK || outRow\u0060 appears character-identically in 2 files \u2014 Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala, Kernal64/src/ucesoft/cbm/peripheral/vdc/VDC.scala. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/crtc/CRTC6845.scala"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a4a5ca74eafc2330dc03a2788578308e876b824a4ee089c4803b768734f308"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060len\u0060 is read from the bytes being parsed at line 12 (\u0060readInt\u0060), then used to size an \u0060Array.ofDim\u0060 at line 13 \u2014 and nowhere in its scope is \u0060len\u0060 bounded from above \u2014 compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an \u0060OutOfMemoryError\u0060 or, negative, throws \u0060NegativeArraySizeException\u0060 out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/formats/Cartridge.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"759380a20e58ae881abdb12d627b955ef095395f3c5a02ef89096c3d642d6e1a"}},{"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":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"7019aeb05d2c3d1f1d530d47b63095de627be5b394235f6265cc117b1042dba3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/CBMComputer.scala"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c6b7f409d133845f9a7c93039e8df8d0da6f4257b1574b14805e72466e7944"}},{"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":"Kernal64/src/ucesoft/cbm/remote/RemoteC64Server.scala"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2427e980f1f1977711cbc2dbce481892dbd9fb948d5d3a8b778d11f111c6872b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/vic/Palette.scala"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1443cd03399d3c36ff31dfa0f32abf58afdf0d3180444ae2fcf9c1ca105e2451"}},{"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":"Kernal64/src/ucesoft/cbm/peripheral/rs232/ProcessRS232.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6113402b02b00169a20870e390bb1fb3aa44bfb9b41f8dacfaee6732d7355f88"}},{"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":"Kernal64/src/ucesoft/cbm/peripheral/rs232/TCPRS232.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a6a1219ef5a8af531f1075d953340cfbb215c6228e3e8e9283506ec6c3c97a"}},{"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":"Kernal64/src/ucesoft/cbm/peripheral/rs232/TelnetRS232.scala"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"897d2c53530eb43c913ab1b391d3a3a3470d3e16b2640a3f4fd82934bea1fbb9"}},{"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":"Kernal64/src/ucesoft/cbm/peripheral/rs232/TelnetRS232.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"09013d6b5f81265145032ad0d0b8dc9ff033b3ca1d68a3438185a9339d624ecd"}},{"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":"Kernal64/src/ucesoft/cbm/peripheral/mos6551/ACIA6551.scala"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"529bd21ea1d826c54a30f77bae5a32d448e1b359aa2114ea76885f24aa696e08"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _:Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/peripheral/keyboard/KeyboardMapper.scala"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1569bbce1d6dd0043eed1efbb23d80843a7efdb7c3499170b962ee8283409b21"}},{"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":"Kernal64/src/ucesoft/cbm/misc/GIFPanel.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"496f015ecbd3f88d131d1f4c0b5a6fe8bbc027a99a5179d5d871740d13ff79a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/misc/KeybEditor.scala"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d5fb09fcf28ef51e981967f3bf58451af0761b723504ccc3c7d766ac707b85"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case t:Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/game/GameBaseSpi.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8909ef3afa6b340479f2fe80496c376d5b01a4ebeb9e2646ae5077f51145970a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case t:Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/expansion/DigiMAX.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1307009ac800781f10ee1b1563450f6d746633feb1bf09077ce46c5efccfc64e"}},{"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":"Kernal64/src/ucesoft/cbm/expansion/SwiftLink.scala"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9df54a4b23882d2c590d689bd6d406c4cd74b9c06769ee1fd73f3ca3dcdf2d"}},{"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":"Kernal64/src/ucesoft/cbm/expansion/WiC64.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a182d1c2890a358e4864ec99109c826096e91a38ca94459444ef7008d4f780f2"}},{"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":"Kernal64/src/ucesoft/cbm/cpu/asm/Assembler.scala"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"67aeafbc94e0c8503feb261da76ea69a367b0c25a494a56eebd0a73bc92ff6c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Kernal64/src/ucesoft/cbm/cbm2/CBMII.scala"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa4f7cdead45ea8dc173f13a89f2605ded4eb6bdbb72ad5954934601b416f6c"}},{"ruleId":"X5","level":"note","message":{"text":"Scala\u0027s null is not held to the type system everywhere: No build over this repository\u0027s 242 Scala product file(s) passes \u0060-Yexplicit-nulls\u0060, enables WartRemover\u0027s \u0060Null\u0060 wart or runs Scalafix\u0027s \u0060DisableSyntax.noNulls\u0060, so every reference type admits null and nothing reports a \u0060null\u0060 written into the code or returned from a Java API \u2014 the first one to reach a method call is a \u0060NullPointerException\u0060. \u0060Option\u0060 by convention is a habit no tool here holds the code to."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"23e7c3c6da50151f07723c64ca4f881fd5903e713d143161a7c0594ad7ba29cc"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-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-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-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-918","guid":"2e9b9091-5a0f-dc57-b644-7ad04bd56e64","name":"Server-Side Request Forgery (SSRF)","shortDescription":{"text":"Server-Side Request Forgery (SSRF)"},"helpUri":"https://cwe.mitre.org/data/definitions/918.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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"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":"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/"}]}],"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":7,"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."]}]}