{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"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":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"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":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"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":"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":"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":"ExpressionCompiler.evaluate (cyclomatic 137): ExpressionCompiler.evaluate has cyclomatic complexity 137 (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":"Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3861b92da1885ece923b09c5c87dba2f4cb2afe98c4dddc69eeba031fa7ce96"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionScout.scoutFunction (cyclomatic 93): FunctionScout.scoutFunction has cyclomatic complexity 93 (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":"Frontend/PostParsingPass/src/dev/vale/postparsing/FunctionScout.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe01df45f2a4a8916f66bd40d7c029b1703878319d6ff743af497d22ac8451f"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionScout.scoutExpression (cyclomatic 79): ExpressionScout.scoutExpression has cyclomatic complexity 79 (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":"Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0073de130db89aee302a15bfeaa259b8c234750ce696c24996dc6574e39f59b5"}},{"ruleId":"D1","level":"warning","message":{"text":"CompilerRuleSolver.solveRule (cyclomatic 75): CompilerRuleSolver.solveRule has cyclomatic complexity 75 (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":"Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0a624611f5106b17a944e5f48d0769bdad8a32ca2ad93e44d55ef10943aa40"}},{"ruleId":"D1","level":"warning","message":{"text":"Instantiator.translateRefExpr (cyclomatic 70): Instantiator.translateRefExpr has cyclomatic complexity 70 (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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"751c756b0b623511720844b278b48f5ce4d956798ab3125e41bd84d718271085"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionHammer.translate (cyclomatic 63): ExpressionHammer.translate has cyclomatic complexity 63 (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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37fa39aa2626b9dd0b80ac95cc73f0451f5d50868969da7b3bae0a71cebdba1"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::list_struct_and_methods (cyclomatic 63): ValeRuster::list_struct_and_methods has cyclomatic complexity 63 (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":"ValeRuster/src/main.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d1c28dee55e1885b077addae2158ca195e2521b02b11e46e0f6f18c5a580db"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.evaluate (cyclomatic 49): Compiler.evaluate has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/Compiler.scala"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"817580078576ca3a4d14e15a192cd98d42ef3f347994df3032765f78297b61c3"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplexParser.parseTemplexAtom (cyclomatic 47): TemplexParser.parseTemplexAtom has cyclomatic complexity 47 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/templex/TemplexParser.scala"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2f0e27a51338b759d95ee0d37c202ec482ba014bb93ed3b2f384866fa1bab3"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::main (cyclomatic 44): ValeRuster::main has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4916882f50f3c45d0cfba7eb2b6e1d2132fc6816b43d111c2c15582104682b7"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::resolve::extend_and_resolve (cyclomatic 44): ValeRuster::resolve::extend_and_resolve has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f47b8416efbed4d3118263d54213b278d189b22bb53736357404a556a2f189"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionParser.parseSpreeStep (cyclomatic 39): ExpressionParser.parseSpreeStep has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"371a3212fb32c05f79792549538e23d9ea21310302f323f631e6ac5f131aa2c6"}},{"ruleId":"D1","level":"warning","message":{"text":"RuneTypeSolver.solveRule (cyclomatic 38): RuneTypeSolver.solveRule has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"860727e52f582f4559eb4bdbe3c00c05422b1497b69066c40a0b6ea508c988d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionParser.parseStatement (cyclomatic 36): ExpressionParser.parseStatement 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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f93c85699ae3ec89eb8c718cfcfe9fd42bc5a12de60dca2e28d2bdb03a0cc1d"}},{"ruleId":"D1","level":"warning","message":{"text":"PatternParser.parsePattern (cyclomatic 36): PatternParser.parsePattern 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":"Frontend/ParsingPass/src/dev/vale/parsing/PatternParser.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa848f403dd252b3cbf86b4e16872ccaac58ec0ea38788af2875ffea5dfc0eba"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::indexer::genealogize (cyclomatic 36): ValeRuster::indexer::genealogize has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/indexer.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"356c87273f0bcdaee2aa72f9452b2f1dbd8fa4f81b94e15fc41431befb760da8"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionParser.parseAtom (cyclomatic 32): ExpressionParser.parseAtom has cyclomatic complexity 32 (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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd4996abb0d55f70e04d9aae7e1825175e5a034de37db640e235723e12eb0aa"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionParser.parseExpressionDataElement (cyclomatic 32): ExpressionParser.parseExpressionDataElement has cyclomatic complexity 32 (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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"588c588b89b75d907e1b7ab6b2a9caa10ebbcf772e2ede7ef5db10303398f86d"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lexFunction (cyclomatic 30): Lexer.lexFunction has cyclomatic complexity 30 (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":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d5a0f0953670587c843292a93f4fe64500d5e37173c6cc4e349e37f672f6ab"}},{"ruleId":"D1","level":"warning","message":{"text":"RuneTypeSolver.solve (cyclomatic 29): RuneTypeSolver.solve 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":"Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8ff0479f9fb02073f41a45a5b06597ae36592b6ab2f6b75c8d5767efdf6cbc"}},{"ruleId":"D1","level":"warning","message":{"text":"OverloadResolver.attemptCandidateBanner (cyclomatic 28): OverloadResolver.attemptCandidateBanner has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c5b593dd08ff42d0687c683cfa99f24c7e732b4c402af2b84a7c8cd162fe04"}},{"ruleId":"D1","level":"warning","message":{"text":"AnonymousInterfaceMacro.mapRunes (cyclomatic 28): AnonymousInterfaceMacro.mapRunes has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/macros/AnonymousInterfaceMacro.scala"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"96eaf8826e14d0a73a8ef8cb1d8ee0d47a7b45f9cb70056813c362505d0e3f8f"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalHelper.getBorrowOwnership (cyclomatic 27): LocalHelper.getBorrowOwnership has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/expression/LocalHelper.scala"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f40a05b7b5af62257a9e86b4de76d789e4d5dcc954418477162b76140a7c6a0"}},{"ruleId":"D1","level":"warning","message":{"text":"RuneTypeSolver.getPuzzles (cyclomatic 26): RuneTypeSolver.getPuzzles has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9cefb15f7431919294883abd445c2bf0662b6cb4ed51eb5961797e312ebaf2"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parseGenericParameter (cyclomatic 25): Parser.parseGenericParameter has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4ef5e975247e9ac34566b5d6313ff3c84d73b77983fee18bb0554fbb4365c0"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalHelper.softLoad (cyclomatic 25): LocalHelper.softLoad has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/expression/LocalHelper.scala"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba4c0c6f0d24ffac715ef21d26860d7d8265f7c40275c25d892b9a22c4ba067"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::list_generics (cyclomatic 25): ValeRuster::list_generics has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"d274591568c99aa40d4091cd68f1a4433857fb1409a72ac4ed271619b448f6d3"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lexInterface (cyclomatic 24): Lexer.lexInterface has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"013a6e2670443514768149e9a073bd03a45f09dc4c263e2abb645ee55dacd710"}},{"ruleId":"D1","level":"warning","message":{"text":"PostParser.scoutGenericParameter (cyclomatic 24): PostParser.scoutGenericParameter has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69fd2c2610cf53de97b8d714365600ea07ba7ee93e85553ee57a2853c052299"}},{"ruleId":"D1","level":"warning","message":{"text":"RuleScout.translateRulex (cyclomatic 24): RuleScout.translateRulex has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/rules/RuleScout.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a55f79e1911f75cfcdb8af830f51f42386aeae7961ab255438fe40c18f663c"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplexScout.translateTemplex (cyclomatic 24): TemplexScout.translateTemplex has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"345453f59be09b406b5b63bb39f68c23b9b67e516f856cd359e1d8732ef67bac"}},{"ruleId":"D1","level":"warning","message":{"text":"CompilerErrorHumanizer.humanizeTemplata (cyclomatic 24): CompilerErrorHumanizer.humanizeTemplata has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: CompilerErrorHumanizer.humanize (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"406c4ad144f0deeed9879f20932bc9f6137e193cdab8b4a85cbeb5d91da0d252"}},{"ruleId":"D1","level":"warning","message":{"text":"CompilerRuleSolver.solveCallRule (cyclomatic 24): CompilerRuleSolver.solveCallRule 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":"Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b27cf89bdce0bad2efa1af202bfe2f4df9e5835cdaeb78bd20c60618c0f6401"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::simplify_type (cyclomatic 24): ValeRuster::simplify_type has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"87573896114030af718c6f92d72aa46f2e8bcbcbd75cd6ed97c7ec523cb2203f"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::resolve::resolve (cyclomatic 24): ValeRuster::resolve::resolve has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b4fc0926db2237ba7de80208e965189af4a327ed75fd66a94460bf056eea29"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayCompiler.evaluateRuntimeSizedArrayFromCallable (cyclomatic 23): ArrayCompiler.evaluateRuntimeSizedArrayFromCallable 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":"Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17ce44a32fffb0d2567b3cccb396c58cf624330381b349b5109b5e1c6c09258"}},{"ruleId":"D1","level":"warning","message":{"text":"InferCompiler.checkResolvingConclusionsAndResolve (cyclomatic 23): InferCompiler.checkResolvingConclusionsAndResolve 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":"Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"db793a9ba345e6331ce2e99de69a6c7a2a19a5322437c843984b0d77c982807d"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::resolve_id::resolve_uid (cyclomatic 23): ValeRuster::resolve_id::resolve_uid 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":"ValeRuster/src/resolve_id.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8659e18b2bf3b6a9f7e7016f26b46db0225faf08d9c9ea7ae0ea2e714599b1d0"}},{"ruleId":"D1","level":"warning","message":{"text":"HigherTypingPass.explicifyLookups (cyclomatic 21): HigherTypingPass.explicifyLookups has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"409920f836648f6db635f26a4a708a8f27355dc72e98692137541e9345a3dd38"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lexImpl (cyclomatic 21): Lexer.lexImpl has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da8604f6ae497d071922fc855bccf0841a7fc4d4767849621dbfdd552bc2672"}},{"ruleId":"D1","level":"warning","message":{"text":"PassManager.parseOpts (cyclomatic 21): PassManager.parseOpts 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":"Frontend/PassManager/src/dev/vale/passmanager/PassManager.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0843cef9e42123615c49b3dff911c0adc96a6e0c13e826dd489521e89ebdda"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lexStruct (cyclomatic 20): Lexer.lexStruct has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Lexer.lexDenizen (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"074e7cfbeefd6595e07f51ed607ce445013713f0da238f171f8d5d7c9773c7c8"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lexNumber (cyclomatic 20): Lexer.lexNumber 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 is NOT this file\u0027s highest cyclomatic complexity: Lexer.lexDenizen (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cc5314c0cf69c3d6352e42f5128b3b455843095171b49642f6578273060e1d"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.ensureDeepExports (cyclomatic 20): Compiler.ensureDeepExports has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/Compiler.scala"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8185a1c1cc92528e34b7825c4e6bd061b78df2965d0b7ff71f7151652cf9480"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::parse_type_path_step (cyclomatic 20): ValeRuster::parse_type_path_step 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":"ValeRuster/src/main.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"adef578b124bf082563370019a0424d1b163be3474659585e82e61a7f7b53c58"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lexAttribute (cyclomatic 19): Lexer.lexAttribute has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Lexer.lexDenizen (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d453b6f105c57e96286d3215c4734ccff6679b8039ec5066fd9d4b6139aba698"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionParser.parseArray (cyclomatic 19): ExpressionParser.parseArray has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a8a427ff660079acc2c835794d041bb384374d1c902b8096ca3a2ee2b200ff"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseAndExplore.parseAndExplore (cyclomatic 19): ParseAndExplore.parseAndExplore has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ParseAndExplore.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f72c21cc86bce7f39330b2cc84b51f47ef998624adc5acb5898f00c256fdcf"}},{"ruleId":"D1","level":"warning","message":{"text":"PassManager.build (cyclomatic 19): PassManager.build 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":"Frontend/PassManager/src/dev/vale/passmanager/PassManager.scala"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae829a1e9b46a155677a3f336d055021231c1aa597a4b5be25e1f4acf9fdc6a"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCompilerCore.evaluateFunctionForHeader (cyclomatic 19): FunctionCompilerCore.evaluateFunctionForHeader has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerCore.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aed934c3267fcb9695c076b4b002dbf623d51249ccf944f273feb83249099a7"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lexStringPart (cyclomatic 18): Lexer.lexStringPart has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Lexer.lexDenizen (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60d7aec0a2b3ec2e5922da3c1615910a66a0e7a6e117fc73efcdcb6e2ee4599"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::resolve_id::extend_and_resolve_uid (cyclomatic 18): ValeRuster::resolve_id::extend_and_resolve_uid 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":"ValeRuster/src/resolve_id.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c59bdde1d9ce2ac271ae113a6f129559030dd8bbc2b63dba6d2177e81ea1e7"}},{"ruleId":"D1","level":"warning","message":{"text":"Solver.advance (cyclomatic 17): Solver.advance has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Solver/src/dev/vale/solver/Solver.scala"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d512852de81c4d0924aa93da4daa06ed7019633b40a4395a0b6e226d160be50d"}},{"ruleId":"D1","level":"warning","message":{"text":"StructCompilerCore.compileStruct (cyclomatic 17): StructCompilerCore.compileStruct has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerCore.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"971906a3d2c87b70d44902f83aff9284b9e90ac147cef2f125b0f67b10fdbc9c"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::rustify_simple_valtype (cyclomatic 17): ValeRuster::rustify_simple_valtype 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":"ValeRuster/src/main.rs"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"25893f2ba57e58a7667e4b4f6a8fcedbd6b2159c87fd20b4850e9dd52ce4c0f0"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::indexer::infer_missing_owners (cyclomatic 17): ValeRuster::indexer::infer_missing_owners has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/indexer.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"873ab4b370305e12950248cdbfdb668222e27332d40f7792abc349720134d78a"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionParser.parseForeach (cyclomatic 16): ExpressionParser.parseForeach has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b0e4dfa4e9149b45c9f895a07e78deaf2f984c858c61d834959f0126d0713d"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parseFunction (cyclomatic 16): Parser.parseFunction has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1225fe61ef7e60b3f8d4f2acd3b3a784850a8ec50fad85b7aa3710b1713a68"}},{"ruleId":"D1","level":"warning","message":{"text":"PatternParser.parseParameter (cyclomatic 16): PatternParser.parseParameter has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/PatternParser.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3774db13e4146c582a5c6b469b82c97ff3ac48a37c52b30f71c915248132c7ff"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplexParser.parseArray (cyclomatic 16): TemplexParser.parseArray has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/templex/TemplexParser.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cb25b2c53fc346a9cb7116888c3e8aa094da98a615acd2a772c8439d4061eb"}},{"ruleId":"D1","level":"warning","message":{"text":"ValeRuster::get_impl_children (cyclomatic 16): ValeRuster::get_impl_children 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":"ValeRuster/src/main.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c66c349f3483cc0770bdb4d64ed9022f527b9ac28ce5546ccf772d081e51d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionCompiler.evaluate (cognitive 149): ExpressionCompiler.evaluate has cognitive complexity 149 (threshold 15). Drivers by points: match/switch 33 (76 pts), if/else 40 (71 pts), boolean chains 2 (nesting depth added 74). 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":"Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9a0a7375420e9395580dab452640ec1687843e0bc834e4f50e45faae1d398c"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::main (cognitive 134): ValeRuster::main has cognitive complexity 134 (threshold 15). Drivers by points: if/else 31 (82 pts), loops 10 (31 pts), match/switch 5 (17 pts), boolean chains 4 (nesting depth added 84). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eaf928a68ff77578ff1733d8265a7ae2e9ae0ed484d0e114671bb67b12aa85f"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerRuleSolver.solveRule (cognitive 121): CompilerRuleSolver.solveRule has cognitive complexity 121 (threshold 15). Drivers by points: match/switch 28 (69 pts), if/else 29 (52 pts) (nesting depth added 64). 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":"Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c4c3ef96592ae11490440fb16b09046adffc1842e78f2c648cf52924aabec4"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::indexer::genealogize (cognitive 100): ValeRuster::indexer::genealogize has cognitive complexity 100 (threshold 15). Drivers by points: match/switch 13 (44 pts), if/else 8 (32 pts), loops 9 (24 pts) (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/indexer.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"15881bf2ab150efd692d0d0fa85ad1449d30165609110ee35950160f8611e387"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::resolve::extend_and_resolve (cognitive 95): ValeRuster::resolve::extend_and_resolve has cognitive complexity 95 (threshold 15). Drivers by points: if/else 20 (44 pts), loops 9 (26 pts), match/switch 8 (24 pts), boolean chains 1 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"242e7fd76683e7ffd2499bd5397f5318225699ccb45bd5606ad9bdc1c031f69f"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionScout.scoutFunction (cognitive 89): FunctionScout.scoutFunction has cognitive complexity 89 (threshold 15). Drivers by points: match/switch 40 (57 pts), if/else 20 (31 pts), boolean chains 1 (nesting depth added 28). 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":"Frontend/PostParsingPass/src/dev/vale/postparsing/FunctionScout.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ede96a8926a7f49514276d47d24e4ad3e46cc42239b8e303aabe31bc29521d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.evaluate (cognitive 85): Compiler.evaluate has cognitive complexity 85 (threshold 15). Drivers by points: match/switch 28 (67 pts), if/else 12 (13 pts), loops 2 (3 pts), boolean chains 1, error handling 1 (nesting depth added 41). 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":"Frontend/TypingPass/src/dev/vale/typing/Compiler.scala"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"147706777b0498765c3ca53f6cba81ee4a412a28888813d56f05f0a0510b43e3"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionScout.scoutExpression (cognitive 69): ExpressionScout.scoutExpression has cognitive complexity 69 (threshold 15). Drivers by points: match/switch 20 (43 pts), if/else 14 (24 pts), boolean chains 2 (nesting depth added 33). 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":"Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca4747858a43c689f9a66685a844d8e5ff71f436da1c5de07576ff3799f7f32"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::resolve_id::resolve_uid (cognitive 63): ValeRuster::resolve_id::resolve_uid has cognitive complexity 63 (threshold 15). Drivers by points: if/else 7 (30 pts), match/switch 7 (20 pts), loops 3 (12 pts), boolean chains 1 (nesting depth added 45). 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":"ValeRuster/src/resolve_id.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a0b45251d9ae8f45280175a2af8ea206704cf3219c5d8f9dca499c7b208648"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::resolve::resolve (cognitive 62): ValeRuster::resolve::resolve has cognitive complexity 62 (threshold 15). Drivers by points: if/else 7 (26 pts), match/switch 7 (20 pts), loops 4 (15 pts), boolean chains 1 (nesting depth added 43). 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":"ValeRuster/src/resolve.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb168dd431f6f99041ae8f87868a5760f4bd019f0201e193ea9ddd895414f72"}},{"ruleId":"D2","level":"warning","message":{"text":"OverloadResolver.attemptCandidateBanner (cognitive 59): OverloadResolver.attemptCandidateBanner has cognitive complexity 59 (threshold 15). Drivers by points: match/switch 12 (49 pts), if/else 5 (10 pts) (nesting depth added 42). 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":"Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f1ffcaa702fc9614335fcc3d69726388c0cc18271ad99db20f53e71729c7e2"}},{"ruleId":"D2","level":"warning","message":{"text":"PatternParser.parsePattern (cognitive 49): PatternParser.parsePattern has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (32 pts), match/switch 10 (16 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/PatternParser.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d500b4ea5f7aad0a8941d46e611abd58404a3463cb312a9fe8a543aaa2755ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.lexNumber (cognitive 46): Lexer.lexNumber has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 3 (8 pts), boolean chains 5 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"56853e355ca185b9beb43e9adde9b5412f8aed1c6ce58ee46e8fd044a8b5b084"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerRuleSolver.solveCallRule (cognitive 45): CompilerRuleSolver.solveCallRule has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 7 (17 pts) (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":"Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90f101f589c68791bacffd68ad7f6dc6b1b69a1730510bf701b0b38ca53a989"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::get_impl_children (cognitive 44): ValeRuster::get_impl_children has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 3 (8 pts), match/switch 2 (6 pts) (nesting depth added 28). 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":"ValeRuster/src/main.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1892328b9ea72a5b39f6e3e6f3f1693da627cfa325eadfecd9568e5349e735"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::indexer::infer_missing_owners (cognitive 42): ValeRuster::indexer::infer_missing_owners has cognitive complexity 42 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 5 (14 pts), loops 4 (11 pts), boolean chains 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":"ValeRuster/src/indexer.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"367ee47d89256b6793181425adba44d9713bf3650da9c8c38cf284d9b6e18e21"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.lexFunction (cognitive 38): Lexer.lexFunction has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 12 (28 pts), if/else 9, boolean chains 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e76dcdf989212c1cd477d9d05741073957935da2dd50d8b143abf48c2ffdb7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionHammer.translate (cognitive 35): ExpressionHammer.translate has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 11 (21 pts), if/else 11 (13 pts), boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"184fb24319ce91f9c6f79a418d965e7b3879ccc16051a047e4d0e4aa7ff375d1"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::list_struct_and_methods (cognitive 33): ValeRuster::list_struct_and_methods has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 3 (12 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c56ce594458d032038f9fb9c51ee8a6308be3875bbe869bd5dd98551853327"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::parse_type_path_step (cognitive 33): ValeRuster::parse_type_path_step has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 3, loops 1 (3 pts), match/switch 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":"ValeRuster/src/main.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"551942fddd44393a295d329157de77a1947507262cfe92ce9152fb8554ca9885"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionParser.parseSpreeStep (cognitive 30): ExpressionParser.parseSpreeStep has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 8 (14 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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3919c077f0cb48458abcce1c5ccab9d01a61a875ed859892e336d03e1f041f6"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleScout.translateRulex (cognitive 30): RuleScout.translateRulex has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 5 (11 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":"Frontend/PostParsingPass/src/dev/vale/postparsing/rules/RuleScout.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e9c71ab21cab9d53f2a00649a166f06f155c6ae60cf3fa487477298a5cac40"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::rustify_simple_valtype (cognitive 30): ValeRuster::rustify_simple_valtype has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"ValeRuster/src/main.rs"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"9236739221ab8a86f8bbe6c4802306bed762254ecd2dc4afecddb17a0df1ec01"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::resolve_id::extend_and_resolve_uid (cognitive 30): ValeRuster::resolve_id::extend_and_resolve_uid has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 4 (7 pts), loops 3 (7 pts) (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve_id.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e05dd884aec3ee2e0a93b6214de7e70d40878632a32364a13afc2c38c878a49"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parseGenericParameter (cognitive 29): Parser.parseGenericParameter has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 11 (26 pts), if/else 3 (nesting depth added 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. 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":"Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"289d17b756565615ea488ab47d4db94e86fec4698ac94874f3cdd5cc3e95dad0"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::simplify_type (cognitive 28): ValeRuster::simplify_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (9 pts), loops 2 (6 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d87d0093a3244e68621021bfecb36a116ed2254c2ee78a481af4a7cc521df5"}},{"ruleId":"D2","level":"warning","message":{"text":"StructCompilerCore.compileStruct (cognitive 27): StructCompilerCore.compileStruct has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 8 (13 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":"Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerCore.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f9c4f602c7e86a999fa51d31e3dd832e1759c4366542a08e52dbea459330aa"}},{"ruleId":"D2","level":"warning","message":{"text":"PassManager.build (cognitive 26): PassManager.build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 5 (9 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":"Frontend/PassManager/src/dev/vale/passmanager/PassManager.scala"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4184fcb0165e69b04207f90383edb0c38c95d34e4bd591c00f71fa495c32ce04"}},{"ruleId":"D2","level":"warning","message":{"text":"RuneTypeSolver.solve (cognitive 26): RuneTypeSolver.solve has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 9, boolean chains 1, loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"8567aa697107e50b42ad2c68f676d2d0cc3cfe6df0e2b5015397037fa18606f4"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplexScout.translateTemplex (cognitive 25): TemplexScout.translateTemplex has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (9 pts) (nesting depth added 14). 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":"Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23a98fea9e7833397f171f4d02f55fc21e54743c4a450fa441df4d59ba5ddcf"}},{"ruleId":"D2","level":"warning","message":{"text":"HigherTypingPass.explicifyLookups (cognitive 24): HigherTypingPass.explicifyLookups has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 8 (18 pts), if/else 6 (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":"Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13e9ad7bc66832ae171bd6db4398e76f7bfa2b2731ed5a1d8e9bcc35bd1bad6"}},{"ruleId":"D2","level":"warning","message":{"text":"LexAndExplore.lexAndExplore (cognitive 24): LexAndExplore.lexAndExplore has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 2 (5 pts), loops 2 (3 pts) (nesting depth added 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. 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":"Frontend/LexingPass/src/dev/vale/lexing/LexAndExplore.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"64857619afa425f3f8169aaf45ef7d90784bb5d91edc6e3de04493e0bc4e619a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionParser.parseStatement (cognitive 24): ExpressionParser.parseStatement has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 12 (19 pts), if/else 5 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"282e07adb2fd061b6abb9d50d86075407927d0b3402a46274b258c190f712583"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplexParser.parseTemplexAtom (cognitive 24): TemplexParser.parseTemplexAtom has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 21 (22 pts), if/else 2 (nesting depth added 1). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/templex/TemplexParser.scala"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41264117d416ef5ee5d32b3f6c099249decd00e678d596318c1b52dc61cc0af"}},{"ruleId":"D2","level":"warning","message":{"text":"PassManager.parseOpts (cognitive 24): PassManager.parseOpts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 1, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PassManager/src/dev/vale/passmanager/PassManager.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8039c0444746b6bd4f6572ab4500871c9c2078355b5dbf92324b0ee1877890"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::mangle_simple_type (cognitive 24): ValeRuster::mangle_simple_type has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (23 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":"ValeRuster/src/main.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"5374eaaa4bb2acf7c4c8361feb15009758e312675c82c410c1ddab9b09db657f"}},{"ruleId":"D2","level":"warning","message":{"text":"Instantiator.translateRefExpr (cognitive 23): Instantiator.translateRefExpr has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 6 (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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a57767cc0bf24cbb7135324f5e4dd8ed19c8848e7633cd650c78872baa982ce"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.lexInterface (cognitive 23): Lexer.lexInterface has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 8, boolean chains 2, loops 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea28860185186a34479035c78d231f230bad8da76de72f42cefcbf9031cd5002"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionParser.parseExpressionDataElement (cognitive 23): ExpressionParser.parseExpressionDataElement has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 13 (17 pts), if/else 6 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"43448147852cfc84244e3b7502b7c5f832ea34c1ba69fe5ccf427b86e57e8ba6"}},{"ruleId":"D2","level":"warning","message":{"text":"VonPrinter.printObjectSingleLine (cognitive 23): VonPrinter.printObjectSingleLine has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (VonPrinter.printArraySingleLine) 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":"Frontend/Von/src/dev/vale/von/VonPrinter.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0751490a127c4eaf6976095e0d9dfb02fbd77a6c74a9113a4031cc5bfdd93789"}},{"ruleId":"D2","level":"warning","message":{"text":"VonPrinter.printArraySingleLine (cognitive 23): VonPrinter.printArraySingleLine has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (VonPrinter.printObjectSingleLine) 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":"Frontend/Von/src/dev/vale/von/VonPrinter.scala"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6268dfdf47bd6e43a01745a0db1ffd1323e07e937eaceeb1588a0e8afedecc9"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionParser.parseArray (cognitive 22): ExpressionParser.parseArray has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 7 (10 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"acac59c9f7a548ba89f91eee8c5174abbb3f99a6812246271f538e79de30f6d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.lexAttribute (cognitive 21): Lexer.lexAttribute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (18 pts), match/switch 1 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6d3bfe891fa31a721205b475abf939582df8dd7f66b69d1c9b3d10dd6d1e47"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.lexStringPart (cognitive 21): Lexer.lexStringPart has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"94400d7ddd740954cf41bda2110f0e612479eb9bd5fe53273e82db8d25692e68"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionParser.parseTupleOrSubExpression (cognitive 20): ExpressionParser.parseTupleOrSubExpression has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (8 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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b868ecdf3228ffb5f3cc6cfb49fb9b92c72875fddcf90c0e32e8f30448939945"}},{"ruleId":"D2","level":"warning","message":{"text":"PostParser.scoutGenericParameter (cognitive 20): PostParser.scoutGenericParameter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 7 (10 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":"Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"391a7a591669bc56f40adae0a4d9df336f5ee896b44fc1556ca5ee9963d59374"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver.advance (cognitive 20): Solver.advance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 5 (9 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":"Frontend/Solver/src/dev/vale/solver/Solver.scala"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2a62d5d28b0836545dc75d925fb8b135253b18bf8a6f4c761e97af82462271"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayCompiler.evaluateRuntimeSizedArrayFromCallable (cognitive 20): ArrayCompiler.evaluateRuntimeSizedArrayFromCallable has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 8 (11 pts), if/else 5 (9 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c8ed1a548f140e34590ad9b641319643b7da4d1e247d779ffc9de04756c541"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplataCompiler.createPlaceholder (cognitive 20): TemplataCompiler.createPlaceholder has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ec29c6004636602733b5255c0b8c8feaa76cdfd0766dcb265d0bc172d7caf7"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCompilerCore.evaluateFunctionForHeader (cognitive 20): FunctionCompilerCore.evaluateFunctionForHeader has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 9 (12 pts), if/else 6 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerCore.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bf5a777ce8921fcd35158daf8383cc035b83810c27e3e8459227e31ede3361"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::get_concrete_impls (cognitive 20): ValeRuster::get_concrete_impls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 2 (5 pts), 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":"ValeRuster/src/main.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f0e5d210018e2b440a8fb63ab364e84fc5fbc7fac1bb81b5989920d253f6c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.lexStruct (cognitive 19): Lexer.lexStruct has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, match/switch 6 (9 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a556d4397ebf3321660ed0d357d38bb9073ac2dac8a6f38fc8ec598223c820a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionParser.parseAtom (cognitive 19): ExpressionParser.parseAtom has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 11 (14 pts), if/else 5 (nesting depth added 3). 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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fd4f9531d5f7c365d1973e6b2a341effbb0f7313704dd3825ccbb8255bd717"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.ensureDeepExports (cognitive 19): Compiler.ensureDeepExports has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/Compiler.scala"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"461268ded5d9d6e29c3599cbeb530f89669689f62ce0d0900c5310121ea8fb19"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::impl_from_matches_generic_args (cognitive 19): ValeRuster::impl_from_matches_generic_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (7 pts), loops 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":"ValeRuster/src/main.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b965055711c2e860f1fd657cb4c0059d1162ac32d2c531608d2debf911cceb"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::mangle_simple_valtype (cognitive 19): ValeRuster::mangle_simple_valtype has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 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":"ValeRuster/src/main.rs"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"210f661bce6fbca8e82b45e378bc91f786e18c0a7595814080d815c4dbc17af9"}},{"ruleId":"D2","level":"warning","message":{"text":"Instantiator.translate (cognitive 18): Instantiator.translate has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 4, loops 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"20141009368f601263610213958c6d33acbb5f8a33641029f65297bdaa817b46"}},{"ruleId":"D2","level":"warning","message":{"text":"RuneTypeSolver.solveRule (cognitive 18): RuneTypeSolver.solveRule has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 2 (3 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97d69b5aa4a46a6764a61dd7bf610df5253facfe120c46d4ae32e5f3837812a"}},{"ruleId":"D2","level":"warning","message":{"text":"BodyCompiler.evaluateFunctionBody (cognitive 18): BodyCompiler.evaluateFunctionBody has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/function/FunctionBodyCompiler.scala"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e06117f9ce9895acdb4165b2b2b9aee2e2af503ae823163e37f886d2a83bc04"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionParser.parseIfLadder (cognitive 17): ExpressionParser.parseIfLadder has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (10 pts), if/else 5, boolean chains 1, loops 1 (nesting depth added 3). 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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"926354391467e036972a070014c791abe44de064be5a1b5bc5a1dbe21b2c8b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionParser.parseBlockContents (cognitive 17): ExpressionParser.parseBlockContents has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 6 (7 pts), loops 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15795f0b6723e3103b215ce9ab1ed698ad36fda37c9882b1cca4289e09adacb"}},{"ruleId":"D2","level":"warning","message":{"text":"InferCompiler.checkResolvingConclusionsAndResolve (cognitive 17): InferCompiler.checkResolvingConclusionsAndResolve has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 11 (14 pts), if/else 3 (nesting depth added 3). 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":"Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26c0ee9c6460da9f288c8cac1f7300e2676106bef823a8fd4508badff4182b0"}},{"ruleId":"D2","level":"warning","message":{"text":"BodyCompiler.declareAndEvaluateFunctionBody (cognitive 17): BodyCompiler.declareAndEvaluateFunctionBody has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 5 (8 pts), boolean chains 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":"Frontend/TypingPass/src/dev/vale/typing/function/FunctionBodyCompiler.scala"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ce1480b28bc1849030b23045dbc2826cd0f453c0cb0999b9cc2e03b3b35932"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerRuleSolver.complexSolve (cognitive 17): CompilerRuleSolver.complexSolve has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8 (12 pts), if/else 4 (5 pts) (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"479c6139b793d76894cc00cf1de2773dbd0d6ae2849df9156c41ceae54fafb7d"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::match_generic_arg_valtype (cognitive 17): ValeRuster::match_generic_arg_valtype has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2f0d6d294d86472d2559f5a5af822250278cbb0fb5b0db31185d8ec62329c8"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionParser.parseExpression (cognitive 16): ExpressionParser.parseExpression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (6 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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"055ba43b0d31e71508dcff86f4f46b942626e139cf08e8755ef8110cc6f065ad"}},{"ruleId":"D2","level":"warning","message":{"text":"PassManager.main (cognitive 16): PassManager.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (7 pts), error handling 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":"Frontend/PassManager/src/dev/vale/passmanager/PassManager.scala"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c306f458edcc71ce942029e86fda4793d56664e1d79bb82d9b17016906432e"}},{"ruleId":"D2","level":"warning","message":{"text":"RuneTypeSolver.lookup (cognitive 16): RuneTypeSolver.lookup has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 3 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fad3b05f6df3e038d517ae8447ee0ec08d646d648b306db6692883a02d7dea"}},{"ruleId":"D2","level":"warning","message":{"text":"ValeRuster::rustify_simple_type (cognitive 16): ValeRuster::rustify_simple_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 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":"ValeRuster/src/main.rs"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b09a3bea967c96f2bf991a5745852bea6d08d6307a3ba24a58cade498a53bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: instantiating/Instantiator.scala: FileTooLong \u2014 2452 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1952 over it, 4.90\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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9aa4fa60ea4d5d384d300e584cc7021f45aef2ba38ee2943cad0f19772b256"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExpressionCompiler: ClassTooLong \u2014 1421 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 1021 over it, 3.55\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":"Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c9e96be357143bc03a5a8ccff58befa32eeae98475cf949803f2ed2a93dde6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 1601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 1101 over it, 3.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c974d89225bd9f6391e0a27e2078d3f64e6aacd54bba5f8a36596f129963fd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expression/ExpressionCompiler.scala: FileTooLong \u2014 1482 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: ExpressionCompiler (70-2012). The bar is 500 significant lines; this is 982 over it, 2.96\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":"Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd04d44eb9d8fe300ffaa700a31363a3ecacd99b4bd2a2cfd308f8c47f72f1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsing/ExpressionParser.scala: FileTooLong \u2014 1199 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: ExpressionParser (239-1933). The bar is 500 significant lines; this is 699 over it, 2.40\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1b5ac5232a3215f57d12589dfa5f93852aff65713b63ce8b2e050bd3b90e19"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Instantiator: 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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa380dbd97e627483390261546873a218296cff6c57083902835716c2ca31c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typing/Compiler.scala: FileTooLong \u2014 1128 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: Compiler (72-1600). The bar is 500 significant lines; this is 628 over it, 2.26\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":"Frontend/TypingPass/src/dev/vale/typing/Compiler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e21ba48389b56614b5bb17d5746a32278fb93858605521c8a0429df6d38116"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParsedLoader: TooManyMethods \u2014 65 methods. The bar is 30 methods; this is 35 over it, 2.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":"Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef745c4364d4411f2e91e7dc9d42e78c30d9fc8194124bd659e4dce08d72d38"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VonHammer: ClassTooLong \u2014 807 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 407 over it, 2.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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45a597160eb6dc93a76da8608932e27b2a785d4beb505f9df55977cbbdaacdf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExpressionHammer: ClassTooLong \u2014 758 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 358 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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d631f20229cffb3b7c344f00eecfdda62d45ed2751a52e37341809b389a2610"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsing/ParserVonifier.scala: FileTooLong \u2014 917 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 417 over it, 1.83\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":"Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d547985b71129cf2f97f01a16f5c278fe4251165b38fcfcbc2dbbfe4efc96d21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typing/TemplataCompiler.scala: FileTooLong \u2014 882 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 382 over it, 1.76\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":"Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23853b6b093bd91df401466134804232388a8344138eae12d6da99bc9277e80"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ValeRuster::resolve::extend_and_resolve: FunctionTooLong \u2014 ValeRuster::resolve::extend_and_resolve runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1fe81a6ed8f31c804fb1f6425bf3b3dc461ec90fd5defb640f729ffd87bab5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParserVonifier: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"949f69f4c2ed5e48ce21040019e4b37656da83341ac322a3ef9eb2462e31a705"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: simplifying/VonHammer.scala: FileTooLong \u2014 815 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: VonHammer (11-978). The bar is 500 significant lines; this is 315 over it, 1.63\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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fbcaac523cc1ef74e9ad2d6d9286669bad354a87426fa7676849ac8bedc1a7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ParsedLoader: ClassTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded), 65 methods. The bar is 400 significant lines; this is 236 over it, 1.59\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f22e0de4cd305e49ae4c808e6189be035186c3ff0d1ccb9a5b5cc69261518b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexing/Lexer.scala: FileTooLong \u2014 794 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 294 over it, 1.59\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":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8725a3510054accd49fce93dfc8babf51fe3471ad4750b657c4b1cac82ecdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: simplifying/ExpressionHammer.scala: FileTooLong \u2014 764 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: ExpressionHammer (10-1115). The bar is 500 significant lines; this is 264 over it, 1.53\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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54314da25364087d469a95aa3d029285cdff1efda0e114a4a1d91125e155fc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/CompilerSolver.scala: FileTooLong \u2014 762 significant lines (blank, comment-only and punctuation-only lines excluded), about 66% of them inside a single declaration: CompilerRuleSolver (347-1412). The bar is 500 significant lines; this is 262 over it, 1.52\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7c42610be08e4d9d7740767d324f5eed3edd6f83b4856541034dc2fee3c23f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompilerErrorHumanizer.humanize: MethodTooLong \u2014 humanize runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1165fda01e3ea2d42a57047a3f3713233f0930c56a679b3bb371ee84b6fd14a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ValeRuster::indexer::genealogize: FunctionTooLong \u2014 ValeRuster::indexer::genealogize runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/indexer.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86200b66defa5141f23f911f4bc18cec44b22e94171f9b32dc77f0411e46e20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: postparsing/PostParser.scala: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded), about 60% of them inside a single declaration: PostParser (373-920). The bar is 500 significant lines; this is 155 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5cbd8b04515b7180f9f73c876617d2abc29ff28207cddacbd1c0786531a7ef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExpressionParser: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ccc06ceaefa45f227de6e4ebdeb71a4cf563194fa09a1492aaef2eb4cd0c10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsing/ParsedLoader.scala: FileTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: ParsedLoader (9-878). The bar is 500 significant lines; this is 142 over it, 1.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b25625a2d88f438ae6174c4d60b151b48ed319aa5acb02c09889eb22ca68e7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typing/CompilerErrorHumanizer.scala: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 133 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f16b4084e306fad8668648f6be9562028722569e7d19ffc96c0ab585e7e8b7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CompilerRuleSolver: ClassTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded), 5 methods. The bar is 400 significant lines; this is 105 over it, 1.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66729949e739785875b0684d806ae46ea1188b223fa169155a6c3689f1b6fba"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionScout: ClassTooLong \u2014 496 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 96 over it, 1.24\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/FunctionScout.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be679dec9eb4b42aa8af2b6b3633e719f41dcbb12d6d2b2c0ff67bc47aac9d6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RegionCounter: 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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCounter.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"235cad73c5f629385f7e50a1840d8b4f629eb46216042225dd7f57e9b130ad13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: postparsing/ExpressionScout.scala: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: ExpressionScout (53-892). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a4a68e5d85439ecda4d3d5040bd41b236c4db4ff3ce6b219a88d203637b7b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: highertyping/HigherTypingPass.scala: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded), about 70% of them inside a single declaration: HigherTypingPass (197-791). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5833055c39da3fe61710bcdc8b9b8ca3235e6d05ede7923ba5de196bb394c0b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TemplataCompiler: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4b41c6c985736d38e7ee5986b194cb420b7b6a21380dd03f046846799016f7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArrayCompiler: ClassTooLong \u2014 465 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 65 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5314a3ea06aa68666ab172123cfaa554935809ebc8d584d49bb115b6086f25e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typing/InferCompiler.scala: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 61 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"034065e6596fa5fde92b1e141a4e31abcd39803292ab472bbe734f1250af6812"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: env/FunctionEnvironmentT.scala: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e180b69db1c4ad38c63b6a91ac954800ebc5670f608d65ba5bbf810da9b01bda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsing/Parser.scala: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: Parser (18-697). The bar is 500 significant lines; this is 39 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3f09e58a4bb2108b9b8dfcb35307edc3313c9e25298c3597a26cf09d807da9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: U: 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":"Frontend/Utils/src/dev/vale/Utils.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c96843db4b5529046b1b4ba2ebf33a277949a03fbab342beec8a7f59b2dac63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/expressions.scala: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 30 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/ast/expressions.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"932cebac924b641b6519a9655eb16d2246c143878c3cd47478b4f402f4c755ae"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TemplexParser: ClassTooLong \u2014 419 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 19 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/templex/TemplexParser.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56b075a12e3259d32f5ab172dee5e1d1c4c2ad2b3062ced95286d7d13acdcd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: postparsing/FunctionScout.scala: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: FunctionScout (38-747). The bar is 500 significant lines; this is 22 over it, 1.04\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/FunctionScout.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae97b8f97eb43786aeed4c667049e42911bc8363171a53501015f14d3368fc5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PatternCompiler: ClassTooLong \u2014 416 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 16 over it, 1.04\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/expression/PatternCompiler.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bbcf74548d157c7f91cb566e3e5712afb918ef2fea666220412bea166e08ac"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionCompilerSolvingLayer: ClassTooLong \u2014 412 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 12 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":"Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"148e2eeda6f495e1288ab5637c26b3e3c08c0800af45d8a5e3896f9114bd8909"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): ValeRuster/src/resolve.rs:20-182 | ValeRuster/src/resolve_id.rs:11-137 \u2014 These two members are variants of one another: 62 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":"ValeRuster/src/resolve.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed46cb27c35e1cbbc41ec96f66ce77f902b95a269f4d435eb2e68daf01b897e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (24 shared lines): Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:21-55 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:80-114 \u2014 These two members are variants of one another: 24 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":"Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee438e1eda427cd70f453d123a10658b5fa5801f37cc0aba3bfe3d89e8fd4691"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:304-407 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:417-499 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:501-553 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:555-602 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:604-648 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:658-685 \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":"Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"947a7c556d4d2c552f44686a644fb7343101ef9d618f4d3c27328d72c9f03b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:53-125 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:138-306 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:320-429 | Frontend/TypingPass/src/dev/vale/typing/expression/PatternCompiler.scala:125-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":"Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54e2bff35422b844850ce507a8c862bebcd2bfbba0a2fbda8ca01648bfbeefa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala:111-187 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:738-826 \u2014 These two members are one piece of code written twice and then edited apart: 77 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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0698021f01cd0f41e08d3f1babc181791dd8921582d527025bc12950a7c001"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala:32-108 | Frontend/TypingPass/src/dev/vale/typing/macros/citizen/StructDropMacro.scala:38-114 \u2014 These two members are one piece of code written twice and then edited apart: 77 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":"Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"99da5a4d7a870b44eb1b808dd252b5ecad8db69c5c1d6df656edaae2f3776113"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (83 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:306-394 | Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:401-483 \u2014 These two members are one piece of code written twice and then edited apart: 83 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":"Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0626ac8fbc51f4698daa06cb2446f4f997f43afb2e22aa3ee27985d2ea4e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:168-242 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:250-330 \u2014 These two members are one piece of code written twice and then edited apart: 75 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":"Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a335b75d7f498c27022ff4720189eac103ac2f0906f2b02112a1e622282fb43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (98 corresponding lines): Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:387-484 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:487-592 \u2014 These two members are one piece of code written twice and then edited apart: 98 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":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cea61da8a46b182cb58f56e8e66ff6ce63901c0eddd1c078a2f56045ed455e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:57-100 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:116-183 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"61832d45ed11e57114487a225d8d5952ea9dd88594055cc07f68d82ef24551a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:1562-1621 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:1631-1708 \u2014 These two members are one piece of code written twice and then edited apart: 60 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":"Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f9142835efef9289b3fe794158779236533d9e30f67c7471bfb9c4015f7f01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (78 corresponding lines): Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:177-254 | Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:257-395 \u2014 These two members are one piece of code written twice and then edited apart: 78 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":"Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"538c0dfbfc04343614ea583c6b364a2339fc10603bc15f3df25b60762ea6d57f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:42-102 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:40-106 \u2014 These two members are one piece of code written twice and then edited apart: 61 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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d09e18b73c4a70112b1223afc793072097fee8b0cfd7d48b729b9950b1556f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 54\u002B corresponding lines): Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:64-117 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:132-187 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:202-260 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 54 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bf12b01bc98f1a21c176f226cec9a1d465442c416d79e139ab4d442dd28ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:114-171 | Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:181-240 \u2014 These two members are one piece of code written twice and then edited apart: 58 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":"Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f8484301745791c31ea53493b1a22fd2f68646c9685b63a9fd778910efe8fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:503-548 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:568-607 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c1002e8dacd6919358e5e8edb61f9d8c3c6f66ae7924fead403571230c81bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 55\u002B corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:228-285 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:438-492 | Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:118-172 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 55 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6183c4fd5906179a5f822894391e9b5bd9636e1c72c74e51aaae44936a7186"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): Frontend/Von/src/dev/vale/von/VonPrinter.scala:219-264 | Frontend/Von/src/dev/vale/von/VonPrinter.scala:270-313 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"Frontend/Von/src/dev/vale/von/VonPrinter.scala"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84ae4f7676133e65f14f0fc77984f09e29d4d005812cf207479991ec5a1d918"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:126-167 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:177-217 \u2014 These two members are one piece of code written twice and then edited apart: 41 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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13c206eabdcc2751ca3fc22107feb062d27e08905e34870704c7d7dd16d5d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala:52-107 | Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala:117-160 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5591d6118c573b6a8176562ccb1f3572161fb5f9bb914896d364fcef74e61a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): Frontend/CompileServer/src/dev/vale/compileserver/BuildAction.scala:9-35 | Frontend/CompileServer/src/dev/vale/compileserver/RunAction.scala:11-48 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/CompileServer/src/dev/vale/compileserver/BuildAction.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a7e29ea4a9799c09cf7be457e714458f075d4b69fda35173e37f6f408faadc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:242-279 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:281-313 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f86d723f44589a57d13c0b9d63fd4c13e53adf83b30f88e8ace07cf17a91f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:367-419 | Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:481-535 \u2014 These two members are one piece of code written twice and then edited apart: 53 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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"936d2de6f61e57791642e18ac5e6a327ab6ff84256d64dbaa5be557df527f81e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:934-959 | Frontend/ParsingPass/src/dev/vale/parsing/templex/TemplexParser.scala:634-659 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c8040793f80982a7b26a9ce9ea6f503c3d9a53b1043c9460b63999fd6094f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompiler.scala:191-220 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompiler.scala:231-254 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompiler.scala"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d2b108aaebe28fefcec3984e50115bc605db8f95f7caedea1600893d4d424c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:909-941 | Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:949-985 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcd4db5f81ab024cbb460204fac396ef3f96f9aaf5a6d3dc7c59ddf2d14fc47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:25-53 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:61-89 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:97-119 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab32c13278de384e10e95fafda1d12b77c1a63777bbb116d3304f088616582a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:830-864 | Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:872-901 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f044c7cb85592d9bfad1ae2ae9bdfa8338654131714efb2e9b23b2cc3d8443"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/TypeHammer.scala:93-113 | Frontend/SimplifyingPass/src/dev/vale/simplifying/TypeHammer.scala:115-134 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/TypeHammer.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b6116bfc48e9a489aced1f51d7b96b78480d8e7a0abd314339c33166b753ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:668-694 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:736-762 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:764-791 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f810ba2c3fa33d8fa607c68c23266feaa004d9ec0f6f541d734faae41d6d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Frontend/Von/src/dev/vale/von/VonPrinter.scala:47-64 | Frontend/Von/src/dev/vale/von/VonPrinter.scala:171-188 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Von/src/dev/vale/von/VonPrinter.scala"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d53c1b490930d8a7cdcf6a216d5f6be8ed3761a4c6221975576ebf47ab3126"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/Hamuts.scala:265-298 | Frontend/SimplifyingPass/src/dev/vale/simplifying/Hamuts.scala:300-333 | Frontend/SimplifyingPass/src/dev/vale/simplifying/Hamuts.scala:370-404 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/Hamuts.scala"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"718e4810e05c96bc31220fff647dee94600967f9c4a3e26241516e1270925014"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Frontend/Von/src/dev/vale/von/VonPrinter.scala:74-94 | Frontend/Von/src/dev/vale/von/VonPrinter.scala:129-146 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Von/src/dev/vale/von/VonPrinter.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"db08122fec6b19df13fa3af35a33cc6c16e02319818a2af01ac2b434800b5eea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:68-83 | Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:135-150 | Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:233-254 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb64432e92510ec16a9bc5ff1c74c28b221e30dedb7321f6a5b8184c9df7f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:179-192 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:202-215 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"770e3c11543fb50130fd942e0c6dea3c15952c9e820f5b82c1ab36d47fac7284"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:297-328 | Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:182-207 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"445b6f3c6e4cc3a2027e4d904438e4404d1c85401cc31816aecb08b98961b031"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:131-148 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:160-176 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adc08ae4b6af83963e75b5d6867af842075a048e8b2a0aa28546043af57920d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:166-179 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:181-194 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e5d4536cc1e24b64c3fd21efe394e19ec96e4b858834047b3532d7e9dd1ece"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:148-158 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:173-183 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fad3ba09544dcd85275b054d9284561db53e609da985ffcce8685a43e34df8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1315-1332 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1334-1351 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1353-1370 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a679fdccbd126570bc8984d375ea7b40e0f8f4d1ffb3ae4c0e0aaadd4503cce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerClosureOrLightLayer.scala:91-108 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerClosureOrLightLayer.scala:121-135 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerClosureOrLightLayer.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df51ff1d910783607d68a5ebf9d83b55ecf279281203a2f4219cfa020be0c12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:267-283 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:273-291 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2870ab4655b41aa947680ba5ff2c8eaaa4e439547cf9c5c949634bf031bec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:62-80 | Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:90-108 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"023ef8b554d3ef821ac2c96774078c6c5324a187f9ff134906e46ed659610a96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSADropIntoMacro.scala:28-44 | Frontend/TypingPass/src/dev/vale/typing/macros/ssa/SSADropIntoMacro.scala:28-45 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSADropIntoMacro.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b5b3e1508449636e1c473e714341a663865d50b2d44c2973e82d347d88d999"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:733-745 | Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:755-766 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce183fe0ba9b08906afc9c44de69892c4753e5c10d68410b54acdc8b836bfe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala:168-179 | Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala:195-205 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44733c7537e3aa6b51902f142b6bcb07b6e0ae008b885ea0b10304a5df1d870"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:681-694 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:714-731 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c7b583ac053169fd6bd5d172cfcc86181238bdbc11fffe54128e988ea906a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): Frontend/ParsingPass/src/dev/vale/parsing/ParseUtils.scala:46-67 | Frontend/ParsingPass/src/dev/vale/parsing/ParseUtils.scala:81-102 \u2014 These two members are one piece of code written twice and then edited apart: 22 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":"Frontend/ParsingPass/src/dev/vale/parsing/ParseUtils.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"23775dfb22ce380bd60939c6707d1a77f83ba9585065ef3a69b3d4af341c32da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:267-298 | Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:300-330 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2ca49fa8bd94650890ed60419d3beb7ba3ee5910044a961698053d93ff3557"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Frontend/Utils/src/dev/vale/Utils.scala:241-251 | Frontend/Utils/src/dev/vale/Utils.scala:253-266 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Utils/src/dev/vale/Utils.scala"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceee8596a4b4cd355a9adc2306d421154751f5394da40bdeea94837ecdae657e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala:193-208 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:832-847 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cc1802527142f67344eadb09b1c992f128e29ebf9d6a327e5983e81fdd1d36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:557-573 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:579-599 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8f49fa3b488204ebfd245eb8c4c071dc9334e88a83f35266bf6a757fd9547a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 14\u002B corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:116-129 | Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:131-144 | Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:155-168 | Frontend/TypingPass/src/dev/vale/typing/HinputsT.scala:145-158 | Frontend/TypingPass/src/dev/vale/typing/HinputsT.scala:160-173 | Frontend/TypingPass/src/dev/vale/typing/HinputsT.scala:184-197 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba61891b748eeb20168ae0e96528db3c1bc67411898400bfaf7f0dfeaaea154"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/BlockHammer.scala:59-78 | Frontend/SimplifyingPass/src/dev/vale/simplifying/BlockHammer.scala:86-105 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/BlockHammer.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"998ef74a2e5980b94fc82c227081de4d5d47a4cdb45d6b0f3e9ecfdd8522139f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Frontend/LexingPass/src/dev/vale/lexing/LexingIterator.scala:94-108 | Frontend/LexingPass/src/dev/vale/lexing/LexingIterator.scala:110-122 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/LexingIterator.scala"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b94d1ef7a22790602537a4d8aeb26180a577a4e1dbe4a6433e0bd36a1733a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:170-181 | Frontend/TypingPass/src/dev/vale/typing/HinputsT.scala:199-210 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efdf97b241b9286f34232947dd845eb005887c7982134c8d9d28af3df64ca37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:821-835 | Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:951-964 | Frontend/TypingPass/src/dev/vale/typing/Compilation.scala:60-77 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14ad68f094f90c1f598c202301845f8293f516bf774437a68b4f9129b5fdac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:197-211 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:216-232 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:237-253 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"40150c2c66789bacc53b7298669e64ef6bf484f3c9806c6df712e92a4a7a0e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala:111-119 | Frontend/Solver/src/dev/vale/solver/SimpleSolverState.scala:175-183 \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":"Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd4b3c72ba8f2575b454ebe17e871e799f0672d3797f94b66bb11bdac4b111c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 14\u002B corresponding lines): Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala:164-177 | Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala:184-197 | Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala:202-215 | Frontend/Solver/src/dev/vale/solver/SimpleSolverState.scala:201-214 | Frontend/Solver/src/dev/vale/solver/SimpleSolverState.scala:221-234 | Frontend/Solver/src/dev/vale/solver/SimpleSolverState.scala:239-252 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"940b5378da1ae77c9b45a8731ee903311761c004c110be4aff1d9ed23dc54edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:1814-1830 | Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:1839-1855 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc765288ce911d07c37b8ddb808d9c83cd7e26f07c8343200c873eedb3cdf74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:3009-3023 | Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:3032-3044 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2581fcffd2b849894a1fb1e25e0d4f5a0aadb43ddf0e74d87ae1adb9de4f3c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:190-205 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:266-289 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1ff4430c9e80a1bf434499ba39d927aa61ca107766021b4b0495133360d72c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Frontend/HigherTypingPass/src/dev/vale/highertyping/ast.scala:35-41 | Frontend/HigherTypingPass/src/dev/vale/highertyping/ast.scala:42-48 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/HigherTypingPass/src/dev/vale/highertyping/ast.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1d9af4d7de73de526cf0bcac8f7dba697942ce387b1800a73e3daeefa972b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala:204-213 | Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala:223-231 \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":"Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc7b6469c14251ebca2c94b9472e95f43616ac1b85079c3e6aa5b8d2d7a1f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): Frontend/TypingPass/src/dev/vale/typing/macros/SameInstanceMacro.scala:28-37 | Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSAMutableCapacityMacro.scala:32-48 | Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSAMutablePopMacro.scala:31-42 | Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSAMutablePushMacro.scala:32-44 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/macros/SameInstanceMacro.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"41867faff404cddf144fabf1e3636c2f1c693913335611e1ba9b54c0d689d110"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:81-91 | Frontend/TypingPass/src/dev/vale/typing/ast/ast.scala:154-164 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07aa525d0d012fe60bd6be5ec940422440acc211f2f7a5dd774ec6b8ce482eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:226-233 | Frontend/TypingPass/src/dev/vale/typing/ast/ast.scala:417-424 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe7d388e91b61aea109311fb4315c71b7c2536247d7f7f2f2c54d76c9bfe706"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/citizens.scala:48-57 | Frontend/TypingPass/src/dev/vale/typing/ast/citizens.scala:55-64 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/citizens.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e209a70927c07b02f77b0567b6b24d66626e6717026d737a9e9c27e34a76e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:108-118 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:348-357 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f48b5153b49d3231f88fe8703ea5efb2fb22bd1a317a87890be83219ea3335"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:235-242 | Frontend/TypingPass/src/dev/vale/typing/ast/ast.scala:426-433 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0269956a381d27e763a45668e5d1a0a5ccefb3fbf4bb1eff589dc18444e9d8f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:770-777 | Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:175-184 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"f415475d52c0875ffaa1bbab69ef920bdf6085a421acadd6a4946d23fd9dd818"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:321-330 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:337-345 \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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c09f51cfee06566dea1105211a73bee09118ff696ce198114f51b8d6a1180d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:335-344 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:350-358 \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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"2addf0baa49e143657baacce252763aefea1c07a3813f68ea372809676d123a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala:173-176 | Frontend/TypingPass/src/dev/vale/typing/types/types.scala:151-154 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c712b4d5ce4c8f97925de18ea3b3dbab2edf6746dd54fab501e3a41e3221aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Frontend/TypingPass/src/dev/vale/typing/env/Environment.scala:504-511 | Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:807-814 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/env/Environment.scala"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"620d9c9284bdd64bf98c82f94d94ef2f220e818e059f090b066ed4072393400c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/names.scala:22-29 | Frontend/TypingPass/src/dev/vale/typing/names/names.scala:55-62 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/names.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"039d63c1f95775aad0bf15de83653433c16edfdbcbc0697888e294a005846928"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/expressions.scala:870-875 | Frontend/TypingPass/src/dev/vale/typing/ast/expressions.scala:907-912 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/expressions.scala"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b73195c3be6ec10d691dac4dd0401a8c593e0f7321b29e1f7d4fe65a59e6464"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:21-27 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:22-28 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c698a0185c8cec1f7d557faffacec5e23a1bc14d4ce1e9d20a902aea33f503fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala:192-195 | Frontend/TypingPass/src/dev/vale/typing/types/types.scala:169-172 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2438e073c034f1b39004c59214a73525292ab4bad522d8f165b66280c883140a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Frontend/Utils/src/dev/vale/CodeHierarchy.scala:14-20 | Frontend/Utils/src/dev/vale/Range.scala:8-17 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Utils/src/dev/vale/CodeHierarchy.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd4e1a716aaea5836b2d02925111991553cbcaeadefa7eb0bcf0581838d03df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:361-367 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:362-367 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23adbfc6a8e6dba9414afc67030f30a153b982ba4cfb119788c7074abd3b006"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala:196-203 | Frontend/TypingPass/src/dev/vale/typing/ast/ast.scala:387-394 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f19714461f52a59a3148523439a0a71055d7389d2434dfc7e2687d934990e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2): Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:398-451 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:498-551 \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 \u0060Frontend/LexingPass/src/dev/vale/lexing/Lexer.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":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e478dfcee547874761d61f16d6afc02c22f4ddd23a5027e42ee829400baf9b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201345 lines \u00D7 4): Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:88-92 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:168-212 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:361-401 | Frontend/TypingPass/src/dev/vale/typing/expression/PatternCompiler.scala:148-152 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:88\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":"Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f9882005172017dfcd90cb5af3a41ab0a2f8966082aab2881c8e3888a6d7bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201339 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala:54-92 | Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala:119-156 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala:54\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":"Frontend/TypingPass/src/dev/vale/typing/citizen/ImplCompiler.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f60f0bda3820b1a602ae19d4acca6984fe5f82646bb1c676f556b8874be959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:195-227 | Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:275-307 \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 \u0060Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:195\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":"Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9523eab768fc341e83164eaee799635b756146333cb952186caafba700246e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 3): Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:181-202 | Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:261-282 | Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala:402-422 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed59e48454822d0a4ad7c2cec9e2eaed63b0b8fd81bd73e6c8fe7de0366c1c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:208-227 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:294-312 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:208\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, \u0060Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:313\u0060 calls \u0060lookupStruct\u0060, \u0060vassert\u0060, \u0060contains\u0060 and \u0060Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:228\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":"Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c258cf90bc4e1e918d47d7a5c8904422be08b2edc27c45e47550ef841e6bbfda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:669-686 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:737-754 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:669\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":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"af46a39429eec7ef32ad38892567266c968ed1c34998b4e04d1ae82e91b555f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:229-246 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:441-458 \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, \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:459\u0060 calls \u0060vassert\u0060 and \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:248\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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b923921dbe23b73b4df6dee68fff0b90b6a91452aaa4a7bdfd309f7b31d531e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:137-154 | Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:209-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9903a26c7e240a7d91326e19f832fa27ca9d7e8d47a06198571b364f331e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:176-193 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:262-279 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:176\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":"Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"210f22f5883c897e8c8a7b30c69b53a5172ef141f69ad257af43f606c7a065b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSAImmutableNewMacro.scala:40-56 | Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSAMutableNewMacro.scala:39-55 \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":"Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSAImmutableNewMacro.scala"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"746153e9e7bfb2c68ee02664b1c74c09e505588b2d565ea7ae5f96d39e241bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:177-192 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:211-226 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:263-278 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:297-311 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:194\u0060 calls \u0060intern\u0060, \u0060ClosureParamNameT\u0060 and \u0060Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:228\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":"Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1275fc486f3ff6e93b7c2e74948054d0322da17978323ea08c8e806ef5c4b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:432-463 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:465-496 \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 \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:432\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6360bdb4889e02ca51f209d0faaaf8aeb0b39fb48063598325ff97299fd567"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:239-254 | Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:129-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 both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"60879736d05b34d21d4ca25ec03dbb7af5fb7482a568c2dc235e08504706460d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:676-690 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:744-758 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:773-787 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:771\u0060 calls \u0060advance\u0060 and \u0060Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:674\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":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"600cde11a49b615b6f11f07096c0647adcdd94b0a18b2d26c961998b1eaaa839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:139-153 | Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:168-181 \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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"65740ca7c5fe69c1fb68a0d17e0cd68157c4e281cdc235261686d0489f4d826a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:236-249 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:421-434 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:521-534 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d151236d97a4d41215388590d589f6f7dd295937ec64450a6b45c9949e151284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Frontend/CompileServer/src/dev/vale/compileserver/BuildAction.scala:10-23 | Frontend/CompileServer/src/dev/vale/compileserver/RunAction.scala:12-25 \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":"Frontend/CompileServer/src/dev/vale/compileserver/BuildAction.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1f5b26f9459301ade153c92818ec8d27b8b519f75077ae89a765ef0e3c8e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:28-41 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:64-77 \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 \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"56125b39fd70c689f24c979af081ea559335841d14c73697a88aa5456275272c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:74-87 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:154-167 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:74\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":"Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa8660beba300e7e99286dc20f578437724b7764b8429760ffe714a8d4b569e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:115-128 | Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:250-263 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala:115\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":"Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fe713f25fd80276fbfade67d15795834a656d2fdf7bbf92244dc5a89adf1d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:672-684 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:704-716 | Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:740-752 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:700\u0060 calls \u0060peek\u0060, \u0060Ok\u0060 and \u0060Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala:670\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":"Frontend/LexingPass/src/dev/vale/lexing/Lexer.scala"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dd3952310bdb367debb2e38831a5b3f82880981bbbcf940887919d65d4db3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:321-333 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:434-446 \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 \u0060Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:321\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":"Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d19b4198f4ec9094e6f1b75f13a61999e84e6dbd604b1581322bb8ab3d958c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:43-55 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:102-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:43\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d7d0597b9fb047586e6612fa9b0225578b70b9638d01ef3e1d7f91d190b971"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:307-318 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:420-431 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:504-515 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:560-571 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:607-618 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:659-670 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea79d1765ded8ea8553e7fae18abae52dafe82091c11bf16779363ab53493eec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:102-113 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:172-183 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala:245-256 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerSolvingLayer.scala"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4273549048a66323de3da3f7b70a265688110367b896e557b28f832945b7599c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:221-232 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:242-253 \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 \u0060Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:221\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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a00b5c84fe80797a231d3f6f9884afe57dfb7adf188e2da6d361b9b4eb78427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:587-598 | Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:803-814 \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, \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:600\u0060 calls \u0060flatMap\u0060 and \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:816\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab5e363944f0b82339675ce27908a280537fb91b8d025d12e5964e9d88cdeed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:119-130 | Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:183-194 \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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c1fcb2c78e6c6c3bbe8a2daf954237d52e0d43f684245033f3fbaa04c4edab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Frontend/Von/src/dev/vale/von/VonPrinter.scala:226-237 | Frontend/Von/src/dev/vale/von/VonPrinter.scala:275-286 \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 \u0060Frontend/Von/src/dev/vale/von/VonPrinter.scala:226\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Von/src/dev/vale/von/VonPrinter.scala"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"912d6f2312cc00b84047659d1a7c681ebc89de77e9fdc830374b2e4824b3e4af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Frontend/Von/src/dev/vale/von/VonPrinter.scala:240-251 | Frontend/Von/src/dev/vale/von/VonPrinter.scala:289-300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Frontend/Von/src/dev/vale/von/VonPrinter.scala:240\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":"Frontend/Von/src/dev/vale/von/VonPrinter.scala"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dbc2a326817e192c73aad1bc3c1e1475a7c35fa244c3bee78fd016118dff94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:78-89 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:158-169 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:351-362 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:78\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":"Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0c915e330a981dfde09aa7a5ec0d2c7185e24639fde05f4fa9485b24eb4e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1154-1164 | Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1209-1219 \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":"Frontend/TypingPass/src/dev/vale/typing/Compiler.scala"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a24382dbe8e4e1b2b942cd0b964f8534e331fd3b25a2599852424dcb903e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:120-129 | Frontend/TypingPass/src/dev/vale/typing/HinputsT.scala:149-158 \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 \u0060Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:120\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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0682a75f108de299331747fde5295a3beabe30103f083bee799381f56c56438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:135-144 | Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:159-168 \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 \u0060Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala:135\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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa0b44ac283b435e1be3f15d4656f067c0de87b4b63d189569884e0df47ad09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:603-612 | Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:626-635 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:603\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54c96fa40035565f1652443df49248012b8f7bfba7140e4368d5e445f6bb214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:82-100 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:166-183 \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 \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:82\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea891cafc182fe27b6c88a77ecfb04964bf1c1a76f3407fc66862f2381fcd640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:203-212 | Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:237-245 \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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c896d11de926fe112b6ac4d5f8946eebb7708d0da4f0943c71586c9e4d1650"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:461-470 | Frontend/SimplifyingPass/src/dev/vale/simplifying/MutateHammer.scala:138-147 \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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f222d7955ee12340ec30228dc0cba2d299233b8c8ca8899dc34d0bc941e1c5c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201310 lines \u00D7 3): Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:193-202 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:440-443 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:573-582 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:193\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"502263082da8a83e45ca8f7ac3953407e1e677de3eca32f4883a68f3dce6ae65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:105-113 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:207-215 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:302-310 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:469-477 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:105\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":"Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50c5e866f1e88352350a2390cc327916431483f1a7ef40f809dce23873b61fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:232-240 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:306-314 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:444-452 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:301\u0060 calls \u0060val\u0060, \u0060translateCoord\u0060 and \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala:230\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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/LoadHammer.scala"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ddabd1a4d8cd38d1375a6be3a26416cab97372627b38db3d9cdb9b1702574c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:706-714 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:724-732 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:781-789 \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 \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:706\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, \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:734\u0060 calls \u0060VonMember\u0060, \u0060vonifyKind\u0060, \u0060vonifyCoord\u0060 and \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:791\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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcf5942d3f6d432e909f97c7f3f188c40b2b44f948704ca51685273eb65897c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:467-475 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:579-590 \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 \u0060Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:467\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f4b71f6f59015788ca79cfbcce66744158a7f6917fce7d5dc621b6f953ab68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:261-269 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:294-302 \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 \u0060Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:261\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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"363291b2b47d81556f44c8a31bbdae2d32cc1b0962c9ce34e79221379fbad042"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:202-210 | Frontend/PostParsingPass/src/dev/vale/postparsing/FunctionScout.scala:686-694 \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 \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala:202\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/ExpressionScout.scala"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"031964344d811fccfd30218c162a9990c04a550db595f4446a5aa482689ee3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): Frontend/PostParsingPass/src/dev/vale/postparsing/LoopPostParser.scala:74-81 | Frontend/PostParsingPass/src/dev/vale/postparsing/LoopPostParser.scala:220-228 \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 \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/LoopPostParser.scala:74\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/LoopPostParser.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ee417d7f89d41c36ff180e54eff80bf3893e1949d2919181ba586805f95a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:616-624 | Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:831-839 \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 \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:616\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6290c7c42218544a3b273cf2f6dc085d53ab39d110286d0598f7259725b1944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:512-520 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:522-530 \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 \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:512\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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a9cfea1b38d35527cbcda51c092ef26f08dd439d6f5791291185a8814f9f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:539-547 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:618-626 \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 \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:539\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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"3710f3e13ad7e363101c554efdc8e7bf6ca4ace6aa8c7f5e7c039832d9de1661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:512-520 | Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala:577-585 \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":"Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"475f8cc2baa0c0e954029fff1ceacb2fbb403142092c211225be08e252c6c97b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1464-1471 | Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerCore.scala:75-83 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1464\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":"Frontend/TypingPass/src/dev/vale/typing/Compiler.scala"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ca06536ea5494a4cf06e4d51e2413e7de2839568753dd9de15c7a55127f100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:354-362 | Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:369-378 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala:354\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":"Frontend/TypingPass/src/dev/vale/typing/OverloadResolver.scala"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b474eedf628a14620f2e7ef27574a950a6ae9987b8c8943459b3e2fd73792ac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:467-475 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:530-537 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:583-590 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:624-631 \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 \u0060Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:467\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 before the matched lines, \u0060Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:528\u0060 calls \u0060put\u0060, \u0060Some\u0060 and \u0060Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala:581\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":"Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingPass.scala"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"262887af1dab921305b8aa01a84b33b7a80717cfdec5419aec4c5cd0bd60bae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Frontend/Builtins/src/dev/vale/Builtins.scala:79-86 | Frontend/Builtins/src/dev/vale/Builtins.scala:97-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Frontend/Builtins/src/dev/vale/Builtins.scala:79\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, \u0060Frontend/Builtins/src/dev/vale/Builtins.scala:106\u0060 calls \u0060put\u0060, \u0060intern\u0060, \u0060FileCoordinate\u0060 and \u0060Frontend/Builtins/src/dev/vale/Builtins.scala:87\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":"Frontend/Builtins/src/dev/vale/Builtins.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a56cf17f9f03065e04a8513fad1b7e9c42c63dbb52a295df687c9dae5174963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:1493-1500 | Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:1518-1530 \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 \u0060Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala:1493\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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"74df2288234a81122731422c53ccf55921751883d4ddfac1b25c383d9e899311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:70-77 | Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:137-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:70\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":"Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9578b68cc8e3632dae5fcacfe44946fba57dc69bdc972b048676d85b142ec2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:699-706 | Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala:888-895 \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":"Frontend/PostParsingPass/src/dev/vale/postparsing/PostParser.scala"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cb3062eae0564729e80e15232a2f2eafd1fd1fce4ed69e4beee3bd8c2e9f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:759-766 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:772-779 \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 \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:759\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, \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:756\u0060 calls \u0060VonMember\u0060, \u0060vonifyExpression\u0060, \u0060vonifyCoord\u0060 and \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:771\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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd2e0d0ba51551498a6993ece0807edb062e359112b3b9615652a9c28179095"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:909-916 | Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:960-967 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:909\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":"Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"88572a0ced95271d61e23fe869acbfad23b25c8dd44c9c4b9e5e5fdad4645033"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:1896-1903 | Frontend/TypingPass/src/dev/vale/typing/expression/PatternCompiler.scala:138-147 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala:1896\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e337b449e71b770ff1defa1d1923e237a47e0006c6481f875c10e07e8edcc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerMiddleLayer.scala:124-131 | Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerMiddleLayer.scala:343-350 \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":"Frontend/TypingPass/src/dev/vale/typing/function/FunctionCompilerMiddleLayer.scala"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"625c9d8087cfb13eeea9663e50cbf19fcde1e1ba43d6ef9a17e938cc01bb7442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:152-158 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:177-183 \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 \u0060Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:152\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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"babb4fd3e1af0f6f3ca6c27f6f81ff5ac6e2011c4d36ce86bac9a0193d7c0423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:180-186 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:203-209 \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 \u0060Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:180\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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"639a1b5f8f8cc8423b3dd1fc6716645959763f67fb15595702205afb7eae4525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:899-905 | Frontend/ParsingPass/src/dev/vale/parsing/templex/TemplexParser.scala:94-99 \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 \u0060Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:899\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a379f54fc38fd0546c80462ed45ea39ad397f20925b09245a9ff44cb921cd69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:854-860 | Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:864-870 \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 \u0060Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:854\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":"Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b2ebe37584d4eb5681429302f441296c407bd8ee566885895a7a93c2162734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala:233-239 | Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala:254-260 | Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala:273-276 \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 \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.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. 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":"Frontend/PostParsingPass/src/dev/vale/postparsing/rules/TemplexScout.scala"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f1cb3c49e4cbb2678f8bfaf0e617814d21fc093d569c9ce2ccfbe7145fac9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:426-432 | Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala:449-455 \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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/ExpressionHammer.scala"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a127462465674f20daa27c313bccac03827ec3d765e6d365607f55411751c6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:142-148 | Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:170-176 \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 \u0060Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala:142\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":"Frontend/SimplifyingPass/src/dev/vale/simplifying/LetHammer.scala"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c785c94cb2dc70cb80bd8a7d44b21f4b22bcdb8a966f322a83761f649eb8b705"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/Von/src/dev/vale/von/VonPrinter.scala:86-92 | Frontend/Von/src/dev/vale/von/VonPrinter.scala:138-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Frontend/Von/src/dev/vale/von/VonPrinter.scala:86\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":"Frontend/Von/src/dev/vale/von/VonPrinter.scala"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a634e7023519a111b974b82f0fecb4e9024b5858674201f0748c22797485b0c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:765-770 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1462-1468 \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 \u0060Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:765\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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"869d62cd7742095d7f08e25594fcb71d556335ae69a827692136f37948addc84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:760-765 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1448-1454 \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 \u0060Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:760\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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8cc839f3baa02814c1c33dc485186a72377b930b4a4be9bfdfefc2511732a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1650-1655 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1669-1674 \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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"8002a86ee010b51556bd0e793ed82a3c1dab4f9a0001b8da5b1f8e7cacf51126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1893-1898 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1901-1906 \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 \u0060Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1893\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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"d188de08e342f6a0a538bc74dcd7c47519c8be64249532d58919ef75a61d9d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:912-917 | Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1153-1158 \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":"Frontend/TypingPass/src/dev/vale/typing/Compiler.scala"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc71c799450c255a044416344d0a3046f270569457914cc5b170dff335f0427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1559-1564 | Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1566-1571 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/Compiler.scala:1559\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":"Frontend/TypingPass/src/dev/vale/typing/Compiler.scala"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b39ce37e205dd02e2cb09ae0dd0037a3c31cc9bdade50a55c6e41f23757aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala:96-102 | Frontend/TypingPass/src/dev/vale/typing/macros/citizen/StructDropMacro.scala:103-109 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala:96\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":"Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"57356c607f4193c3daab164ad526a7689f4805234f0faf9fcfecdbcb5410a286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:222-226 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:228-232 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:234-238 \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 \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:222\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e7069b82f62327f550372fb52f061974440f999871221905236526a774bdf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingErrorHumanizer.scala:38-44 | Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingErrorHumanizer.scala:70-76 \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 \u0060Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingErrorHumanizer.scala:38\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":"Frontend/HigherTypingPass/src/dev/vale/highertyping/HigherTypingErrorHumanizer.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab07b896e055c0ea0528940d760779faf1d0ef92d0bd8571d014aa461156c74d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1639-1643 | Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1644-1648 \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 \u0060Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala:1639\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":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6a3bd1aeaf1171321a6a2d56ef1fc49ec65a6064b431f901f8efd1341ddb26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:137-141 | Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:143-147 \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 \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:137\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"521c83343741fb0d0b6ea312d9d716c9a818643ad1a82f0f1e85f929b146ed51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Frontend/PostParsingPass/src/dev/vale/postparsing/PostParserErrorHumanizer.scala:42-47 | Frontend/PostParsingPass/src/dev/vale/postparsing/PostParserErrorHumanizer.scala:58-63 \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 \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/PostParserErrorHumanizer.scala:42\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/PostParserErrorHumanizer.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c799cfaaada1d38405bd0d98f4c632c5137f2f6d898a79e18b166ee43c2f606e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala:478-486 | Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:868-872 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala:478\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/InferCompiler.scala"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9b405ea191481424be2db1b8122d4498330bbb493ab054c70a02bb16889237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (151 lines \u00D7 2): Frontend/LexingPass/src/dev/vale/lexing/ast.scala:6-156 | Frontend/LexingPass/src/dev/vale/lexing/errors.scala:9-177 \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 \u0060Frontend/LexingPass/src/dev/vale/lexing/ast.scala:6\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":"Frontend/LexingPass/src/dev/vale/lexing/ast.scala"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"becf9249689ebc4fb1aa77b0bea6ac7c141d0687939448e361832fe34c88c862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala:98-105 | Frontend/TypingPass/src/dev/vale/typing/CompilerErrorHumanizer.scala:725-732 \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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8c5b2e0678ef67b3fd23dbb3f247f5dcb41b5fa081ebd6b60c1de3c909882b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala:433-438 | Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala:395-400 \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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad00ba75181f1109dcb3fa10b1bd5b55372983c74f70de17f228281b2e877bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala:11-16 | Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala:925-930 \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":"Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"befa5891542626280aee02f64be240aed9e72438b1e876491ac960e2ba9eb557"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): Frontend/TypingPass/src/dev/vale/typing/env/Environment.scala:458-463 | Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:34-39 | Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:96-101 | Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:552-557 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Frontend/TypingPass/src/dev/vale/typing/env/Environment.scala:457\u0060 calls \u0060_hashCode\u0060, \u0060hashCode\u0060 and \u0060Frontend/TypingPass/src/dev/vale/typing/env/FunctionEnvironmentT.scala:550\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":"Frontend/TypingPass/src/dev/vale/typing/env/Environment.scala"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b9e306304da9f975556a6ce5be7ae4956948ac9a5b8315d98e7b7d7507346b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/macros/RSALenMacro.scala:28-37 | Frontend/TypingPass/src/dev/vale/typing/macros/rsa/RSALenMacro.scala:28-37 \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":"Frontend/TypingPass/src/dev/vale/typing/macros/RSALenMacro.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb2b755e0dcad8b2d341c8f8df7af35d0d6fcc27a84841bb96f747aab5be37d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:23-27 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:82-86 \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 \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:23\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, \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:87\u0060 calls \u0060DefinitionCoordIsaSR\u0060, \u0060Vector\u0060, \u0060CallSiteCoordIsaSR\u0060 and \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:28\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff586a30b58db1a3c191697578947ceb6d18ee3afad4967db0b8f7241923dbdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:36-41 | Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:95-100 | Frontend/TypingPass/src/dev/vale/typing/infer/CompilerSolver.scala:199-204 \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 \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:36\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, \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala:34\u0060 calls \u0060CallSiteCoordIsaSR\u0060, \u0060Vector\u0060, \u0060DefinitionCoordIsaSR\u0060 and \u0060Frontend/PostParsingPass/src/dev/vale/postparsing/RuneTypeSolver.scala:94\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":"Frontend/PostParsingPass/src/dev/vale/postparsing/IdentifiabilitySolver.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"475e9de6e444ce15748cd5cadf153b8923310db08062785ffccf64ae1867163b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:337-341 | Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:352-356 \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 \u0060Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala:337\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":"Frontend/TypingPass/src/dev/vale/typing/TemplataCompiler.scala"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d90987843edc176e53cb36e086924340e39e6a3e4da2e754a28f24c974aa1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala:44-49 | Frontend/TypingPass/src/dev/vale/typing/macros/citizen/StructDropMacro.scala:49-54 \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":"Frontend/TypingPass/src/dev/vale/typing/macros/citizen/InterfaceDropMacro.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8304ec3f77e719c88ce6187bbb414838b1535b8c2859d1aa53eacdb3bac6a26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Frontend/Utils/src/dev/vale/Utils.scala:242-246 | Frontend/Utils/src/dev/vale/Utils.scala:254-258 \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 \u0060Frontend/Utils/src/dev/vale/Utils.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":"Frontend/Utils/src/dev/vale/Utils.scala"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddc8ce54b049928ae85fe98ca13189dca47f34ccb436abb5aca74e6bb8e45bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): ValeRuster/src/resolve.rs:84-103 | ValeRuster/src/resolve_id.rs:70-89 \u2014 before extracting anything, compare \u0060ValeRuster/src/resolve.rs\u0060 and \u0060ValeRuster/src/resolve_id.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 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 \u0060ValeRuster/src/resolve.rs:84\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":"ValeRuster/src/resolve.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca6e1de7a962286c879a11050c9546a8ec796c315041691ae0d2b4a79d8f35e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): ValeRuster/src/resolve.rs:55-72 | ValeRuster/src/resolve_id.rs:44-61 \u2014 before extracting anything, compare \u0060ValeRuster/src/resolve.rs\u0060 and \u0060ValeRuster/src/resolve_id.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 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 \u0060ValeRuster/src/resolve.rs:55\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ValeRuster/src/resolve.rs:53\u0060 calls \u0060is_empty\u0060 and \u0060ValeRuster/src/resolve_id.rs:43\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":"ValeRuster/src/resolve.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b07c21b63c243b3a21d648fbf07eb5d6b45e048dcba8598861a92e332a42e4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 3): ValeRuster/src/main.rs:1448-1461 | ValeRuster/src/main.rs:1487-1503 | ValeRuster/src/main.rs:1533-1545 \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 \u0060ValeRuster/src/main.rs:1448\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, \u0060ValeRuster/src/main.rs:1447\u0060 calls \u0060Impl\u0060 and \u0060ValeRuster/src/main.rs:1486\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":"ValeRuster/src/main.rs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3da337ff0edf9d43a84479956cbc912aace8c3cb296bd006c04073bd21ac3be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): ValeRuster/src/resolve.rs:36-51 | ValeRuster/src/resolve_id.rs:28-43 \u2014 before extracting anything, compare \u0060ValeRuster/src/resolve.rs\u0060 and \u0060ValeRuster/src/resolve_id.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 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 \u0060ValeRuster/src/resolve.rs:36\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, \u0060ValeRuster/src/resolve.rs:53\u0060 calls \u0060is_empty\u0060 and \u0060ValeRuster/src/resolve_id.rs:44\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":"ValeRuster/src/resolve.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e25fd25063f504c22179c432d3b3cc34d69d22567475dd76764da11eee514d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ValeRuster/src/indexer.rs:309-319 | ValeRuster/src/indexer.rs:328-337 \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":"ValeRuster/src/indexer.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f25375016793ffe1603a1220b61aaf5247ab2f8637b6f2450d70269c9063c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ValeRuster/src/main.rs:369-378 | ValeRuster/src/main.rs:387-396 \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":"ValeRuster/src/main.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d867e965486279b049bb5bd22ce7bba353a793ee07818a37abca668d74d1070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): ValeRuster/src/resolve.rs:22-29 | ValeRuster/src/resolve_id.rs:13-22 \u2014 before extracting anything, compare \u0060ValeRuster/src/resolve.rs\u0060 and \u0060ValeRuster/src/resolve_id.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 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 \u0060ValeRuster/src/resolve.rs:22\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7389bf183cfb03ad2dfb1378caa12df5afa959d74781a130f09e61c75aa5f866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ValeRuster/src/main.rs:1961-1969 | ValeRuster/src/main.rs:2120-2128 \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 \u0060ValeRuster/src/main.rs:1961\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":"ValeRuster/src/main.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b791ecbd6bba7ad4290a4e85225944cd8d152dc7f2489ec7bfef39546311c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): ValeRuster/src/main.rs:355-362 | ValeRuster/src/main.rs:503-509 \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 \u0060ValeRuster/src/main.rs:355\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":"ValeRuster/src/main.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b876d685c047ca10b7682c420d525e5d0285fce0db0aeb856ecf399f996372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ValeRuster/src/main.rs:1615-1621 | ValeRuster/src/main.rs:1634-1640 \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":"ValeRuster/src/main.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea46f9c2216375c82a7a28f433acd700a2bbf400805b5533035562b2c3c83daa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ValeRuster/src/main.rs:1478-1483 | ValeRuster/src/main.rs:1524-1529 \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":"ValeRuster/src/main.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"81763b0f5d8391f36e2e3f0dbd8cc8cf9867d58c05dde695abc7e92da967d2d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ValeRuster/src/indexer.rs:47-51 | ValeRuster/src/indexer.rs:293-299 \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 \u0060ValeRuster/src/indexer.rs:47\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":"ValeRuster/src/indexer.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"da835007db1444fd37c0b404f9c509c20242c151e938c062e5ed0ce6c2270e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ValeRuster/src/main.rs:522-533 | ValeRuster/src/main.rs:543-553 \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 \u0060ValeRuster/src/main.rs:522\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":"ValeRuster/src/main.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"6974e9d9ce19489a99c19f342ceb49467684346e5409a460810a9b6c69535d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ValeRuster/src/indexer.rs:196-203 | ValeRuster/src/indexer.rs:210-217 \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 \u0060ValeRuster/src/indexer.rs:196\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":"ValeRuster/src/indexer.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1e653ac1e4f170ae64495ad483020c9b1e390fa3aac97fcf4a62edc91d72c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ValeRuster/src/main.rs:679-684 | ValeRuster/src/main.rs:1254-1259 \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 \u0060ValeRuster/src/main.rs:679\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":"ValeRuster/src/main.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da68dda90b81c8640a74fdbc75151505257d08a28e2a657a5883b9dae5e835c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ValeRuster/src/main.rs:735-740 | ValeRuster/src/main.rs:751-756 \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":"ValeRuster/src/main.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1d6342978158486176b4bfff2ae49fad057cc87af84bb4e9064951525fa67a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ValeRuster/src/main.rs:663-667 | ValeRuster/src/main.rs:1601-1605 \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 \u0060ValeRuster/src/main.rs:663\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 \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":"ValeRuster/src/main.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"804abe163d6f427c2504684968e73d660ba0d7d1bd4be73315d4f57d114b2dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (20 members, 50\u002B identical tokens): Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:194-203 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:205-214 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:216-225 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:227-240 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:242-251 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:253-262 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:264-273 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:275-284 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:286-295 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:297-306 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:326-335 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:337-346 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:348-357 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:366-379 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:381-390 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:392-401 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:403-412 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:414-423 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:425-434 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:436-445 \u2014 These 20 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 20 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 20 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cd2b18f5a6d809eea15195d88bafdc89dfaefdc57be8b1e8a10fa4e3a5b9a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:15-24 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:26-35 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:37-46 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:48-57 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:77-86 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:88-97 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:99-108 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e446d3406ea9f861fb42f0269be762784900a263dbc98c2b001f1127725c36db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:1042-1078 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:1091-1123 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8cc409ef30c0338ff97dbaa8eb5dcf44527d7c6858dd0d67d0b8d0644ca131"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): Frontend/TestVM/src/dev/vale/testvm/Heap.scala:425-446 | Frontend/TestVM/src/dev/vale/testvm/Heap.scala:453-475 \u2014 These two members are one piece of code written twice and then edited apart: 22 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":"Frontend/TestVM/src/dev/vale/testvm/Heap.scala"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c68d9384d4f8b33503c38993027489bd0be0234c9d652912ed2470a944bfe0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:186-196 | Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:202-213 | Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:219-231 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fafffe0d129ea10f169869ab947b9adbac7d3a54297d8aa517a981e1c8d509e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:122-131 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:133-142 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:144-153 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"151b33722a0db57a41635f40ca44174d046211bfc242c2e13387e1093aa39394"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:252-264 | Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala:266-278 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/TestParseUtils.scala"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df4935da893cc0cd55c2f91aa753881467ac6c2bae1eaa3c8daefcaba59494e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Frontend/TestVM/src/dev/vale/testvm/Heap.scala:355-365 | Frontend/TestVM/src/dev/vale/testvm/Heap.scala:371-385 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TestVM/src/dev/vale/testvm/Heap.scala"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c769ded2e76f5e49345c9cf0d6c47e6a05028a9dfc1d5f196d82c5a9d82183"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 3): Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:444-457 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:459-472 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:473-480 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:444\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":"Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"32060b2b77a93f3ba821f45c750ac60b3e2cd660411a7eafe5067561eace0140"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:734-745 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:765-776 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:734\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":"Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee21ae787825586adf79fdd38e51e222c1787a29400a5ab5295e3efe70269911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:104-114 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:578-588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"882d89b949d90ebac30416d770af2535702d60d2061f818329ac645ad3b2689e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:516-525 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:753-762 \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":"Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d0f1fce73cd244b45372922437d93f6ace320497c191b1940ef873b6338858"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:632-640 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:659-667 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:680-688 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:632\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":"Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d98cc917f55da864e44cc3b121ff3677fd24d309e2780b1c4e4a4ba36ef578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:198-206 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:216-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:198\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":"Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dce1b2875c75068f7fe54f7cf6dd0e525f461fa2e2156de1c6a95b24835232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:314-322 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:328-336 \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":"Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3dcf3c8b8dc0684db19405b428467f33b1a1785ff30aa86d99e527ea86fa0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:494-501 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:523-530 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:494\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":"Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4a3bc260bbe10c9aad4de0a2ddc3d5a6b352f7b0a9cfe89e9977102b002796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:256-262 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:395-401 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:256\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":"Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"976113b72333beba0bc684c534dce8a16eb1bacfa7ce8308bf9e41020235c417"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:267-273 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:406-412 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:267\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":"Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbcaec9657af1670c17ef2f3210fc9a01289e4170b9f52ed6919adf3ab519c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:278-284 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:417-423 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:278\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":"Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de0970b856e465b6759cc82058f1c5272360dfdd8f4bd65325e93a53fbb9879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:289-295 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:428-434 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:289\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":"Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d3bb093ef2b26efd529ecd28e6723748a1cee9d9499edaea040b7258a9d611"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:300-306 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:439-445 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:300\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":"Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64214e9d4e2243b2cfd5f5b4e44ba334bf25aab02eb56cfc08e572378444b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:273-280 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:305-312 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:273\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":"Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8159365109aa30b3685312fb8d7791bc28502f32ef9c65c7b4c9814216770c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:1235-1241 | Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:1246-1252 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala:1235\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":"Frontend/TestVM/src/dev/vale/testvm/ExpressionVivem.scala"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"870623351d44a82b231a44f6a56fba756fa401ee6a08de9873450347755f573b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:228-233 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:367-372 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:228\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":"Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0be3f38040cc4d056df351219ac3f060b9bcb01e5afa1f41cfa4c661c11a839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 20): Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:195-199 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:206-210 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:217-221 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:228-232 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:243-247 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:254-258 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:265-269 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:276-280 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:287-291 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:298-302 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:327-331 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:338-342 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:349-353 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:367-371 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:382-386 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:393-397 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:404-408 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:415-419 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:426-430 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:437-441 \u2014 all 20 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 \u0060Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:195\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":"Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"004aa74b7c3e4ba7216ec8dec04972e67b782aaeced9b9325ff9f1cf0c0b34af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:16-20 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:27-31 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:38-42 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:49-53 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:78-82 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:89-93 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:100-104 \u2014 all 7 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 \u0060Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:16\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":"Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bec2f08af0211f067946245b2cc547755beb2a918c53cb033b935baa7b6a109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:123-127 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:134-138 | Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:145-149 \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 \u0060Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala:123\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":"Frontend/TestVM/src/dev/vale/testvm/VivemExterns.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe239cc7db3f32f76201717b4f947fc4d0989ebf89f93d85557394f1430d44e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ArrayCompiler (LCOM4 8): ArrayCompiler\u0027s methods fall into 8 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 8 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":"Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf91c7aeb7739ac92900f34f6a28e79756539fa216324d7f588e46e85a72cfa1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StructCompilerGenericArgsLayer (LCOM4 5): StructCompilerGenericArgsLayer\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":"Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompilerGenericArgsLayer.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e241899f6a98f5c8056e4c88cab7851fa026c1c2d6ea1772cd96363ff2a8c8eb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExpressionCompiler (LCOM4 4): ExpressionCompiler\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":"Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f7d96916902e0323fc192e579967a9428a7b8336cab7445327aa2d8fc4a6f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: resultify all these panics \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/indexer.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"58be3bc37b18f2b273001e204a7cfd0d5dd0f1d48410f007a4b4abb18b89479a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize: expensive clones \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/indexer.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ed5b8a2dd265e8b3228fbea8966bb23ae32f98f219a3e735610c82c214081b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize: memoize results, use past calculations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/indexer.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29e9d327563d4bffc81a068c091fa1185b5ce6eb74d475e5ccdd7f665898fd4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //                   // TODO: use a better resolution approach \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/indexer.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a791b480e5313a4b5206c7b2c4cd9ce50d1440026f34a202b99bde0559a4c061"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use a better resolution approach \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/indexer.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"3799fcb9e30ced1d3fffd29955db55dee7b0dac9bed06e87e2ac6f5b9e5e22b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize: All over the place we\u0027re calling .keys() and .collect() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b88003f126ac3b2dd694a9bb69e20c120de089196ac789d333bf5006955e311"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rename \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d381a32c8e41e9cd7b3a539a9f344271592e9f83e614a03d915fd826ac46e662"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Expensive call to string_path \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da8166b71b55c68983631fbd852d4c41a8235e71a1762d4b25d602ecae5707e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check duplicates, i think we\u0027re doing extra work here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a656ad089b72d561386b59693945836983a77a202b952e2cbb2dee4c98b72c91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check duplicates, i think we\u0027re doing extra work here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c9f922ff3285879a52c74fd6e82175b90e1be20340f41597fef56474d8cb5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check duplicates, i think we\u0027re doing extra work here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"82587c511b5a0bc141403cb32a6cb451b85a902d7ba60251513901dcb74d71bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: dedupe \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9c3c6905254eb8f51efa005ea426d130389142a38b3b2fba8955b33394c931"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: O(n^2) lol \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74c2a4ac4eba2819aee7ed81eca68a129c92e86448a2f1def2d6ea72fbffded"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: dedupe with other call to instantiate_struct \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb07c68919968fc14dd23974e0acd529a9d5a9a5cb3fc3dd908e6e509b13f62e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     \u0026needle_type.valtype.name.as_ref().map(|x| x.to_string()).unwrap_or(\u0022Tup\u0022.to_string()); // 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":"ValeRuster/src/main.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fcd7c007d9da2c6d4d93faea41a1f7b7a107b3f1e8ea0101bd8f4e92c09ba8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is it okay to use u8 here instead of c_char? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e2a94dc47b8155055bb67833e25a0686cf829d1bc5a86f791104e3ecd64d3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe dedup with instantiate_func\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa1c13cd21f8233ff3ba83d48a2fa6d76a0be7153abb7f1fb524fd162892031"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: dedup with instantiate_func\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b258bae593b3ad6adee32aa939fd8cb5005db6db244a813461df2beb49855e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Resultify \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a01415a5bceeed5af3ab9a3297c7d5706b262ecd6f3fdbd15a870610c33279"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do result or something? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"323f112ec249248833053b71f2e90178382ab80429ca9fde37414cd917592de8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize: super expensive \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"35077eac3a9c7f4a4fa44adb150836c52235d2d66a0485fe85deadfee5025db6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: look for impls in other crates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a69bebd06c0c1fd3df9e596feacd914bf1d5f479936a94d74f7dded82d8b839"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: doc better \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"733c19ae844ac5ca29b2846c374f57aee0408737b9989c09ac5dd5adfd62fb2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: stop using ResolvedPath\u0027s name, it\u0027s inconsistent and we have an ID instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"984b581734b4ff8f361ea5b246869b1ccc97cbad39cfe344901ee40505f09df9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: prevent parsing \u0027staticky or something \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"055662f87026fe9ec95827ce6df7242d5de37b781ea73dbec296fb24837a477d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe handle \u0026 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"108cedae8351c99d2f0735d4acaa54effb5f37c1c57017e06943e066b6d92ce0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe handle \u0026 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c36926159b7c12bd93db39c4eed0929d2d68ecbf70f3b55e8e1dbf274700f4c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: see if you can take this out and have an outer function instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"298c190c7c39efb665aa478d04f4b412fcd74fadd069268492c7a4545d35a2d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO DO NOT SUBMIT \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6c5d8f853ad2878de7b5f77c8491e3797083ac0ecd5d8d431948c5beed1bc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It might be nice to get that is_func from the SimpleType... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dc9548853df7553ad3f59735eb04fbc20220efdf869fe9048f5c24ae93e974"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: document better or something? seems sketchy. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca25c448f1d64eaf87351b99733ae7e0aec5d2813467a78303c14d4ed8d29ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: document better or something? seems sketchy. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve_id.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8814cf839ae0a099edd425e9f8d1379eba6c23730233f4f6dcf156717492ca55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // // TODO: impl \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdbfd78dafa2a3bd12f1a16a52fbc9c09dfeb9002e2e2ee825c9a97005caea2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // // TODO: impl \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve_id.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a5961926133292c48793894ff760fc635d326e520f9af67316ef232a18e474"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if we\u0027re not addressing a foreign crate, we might need to add \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"03857977040568597cf42e0f2d42c24a8a6247cd97b7bd306d92775a8766a0ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if we\u0027re not addressing a foreign crate, we might need to add \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve_id.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2e9c256c3c2acfe61f11a13d2b315de273f8d23d5724cf72b2e6194568ed19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: explain more with examples, this is very nuanced \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dbf5c136c1260bdfb2b80920bb42074ad6893b1d62a80d5a65304bb24abd64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: lets have two different types for uid, resolved and unresolved \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"acba1977ee62bf6a0126cc062283bbf40fd54ae715dcdb8075dc98ba7b727e78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use this more \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve_id.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ee5b4a87c6ab417c9b95175367800ac7d0293e698e34c8bef78abb43c42b95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize: get_concrete_impls_children is repeating get_concrete_impls\u0027s work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/resolve_id.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"335df846e23923ea20b3ed5c13aea7f33c89b4351e97c8ddb724a3091a895e86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can optimize this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Utils/src/dev/vale/SourceCodeUtils.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4107f409321a8e225d6897da88c0569f6c2eae680721bcddcb0c1a754ba5956"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can optimize this perhaps \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Utils/src/dev/vale/SourceCodeUtils.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec488932a14bb5f13c31d85e30238aeee1045f99d60e22fc634a562d8842ed7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(optimize): this is probably slow? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Utils/src/dev/vale/Utils.scala"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2669ecbceb03620fc333e6685ade4bd80cceda36e2a7a988ea5e48bc4e3f29b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Utils/src/dev/vale/Utils.scala"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"5246ca9ece54d0995f39a72363babae289d55043cef6bf84b5ea3c8c7a82d40a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pull all of the typingpass specific stuff out, the unit test-y stuff \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/test/dev/vale/typing/CompilerGenericsTests.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6194858aec8cbd03d9f418b624af0b90687b1f17c4e29342c886ba4f30e59e8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pull all of the typingpass specific stuff out, the unit test-y stuff \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/test/dev/vale/typing/CompilerLambdaTests.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"100cdb3bed2a71b37fca7145504a2d45d5f5898506b37c613781dbf98595bf94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pull all of the typingpass specific stuff out, the unit test-y stuff \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/test/dev/vale/typing/CompilerMutateTests.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"113beac4a3a8742b0c07fcb03a707f9328fcc6fc68f2df2c22ef4eabc831c0fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pull all of the typingpass specific stuff out, the unit test-y stuff \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/test/dev/vale/typing/CompilerOwnershipTests.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efe01e18b628f7f191b8485ba009dc13db391706db96c06fb5327172edeea1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pull all of the typingpass specific stuff out, the unit test-y stuff \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/test/dev/vale/typing/CompilerSolverTests.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1193ae09628f2858dbf2ad42e725c88d615d9fab0b697817151f10515769d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pull all of the typingpass specific stuff out, the unit test-y stuff \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/test/dev/vale/typing/CompilerTests.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7244c179fa1557a60d2d20bcb9b29cc477d88dc967e4582901ded6f9ce4277f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Bring tuples back \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/test/dev/vale/typing/CompilerMutateTests.scala"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a1f3eb19040656e8c496544de91e03db82350eeee30616bbdd1c016b87bf16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(regions): Sometimes add default region rune \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b823b85d0825bf817734e8460e34a09f6f36ccf2caa55a03f1dc75d8642881"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(regions): Sometimes add default region \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/ArrayCompiler.scala"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c23ba0f77203b20af09c9db24b5cec5c2a77dc1ef5c70a14f07ffca081dab1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Give a trait with a reduced API. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/Compiler.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fc4d4efd62454595c5e8605e781e66cae03d4f83b824750e3a61f6fa63b61e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: have asserts for the impls too. Might become moot if we don\u0027t need to register \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/CompilerOutputs.scala"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07a9af32a09db474dd37d5efa517e0c9fcca810cad9be21f34f32308d2f99f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(regions): Replace with an actual region. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/types/types.scala"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c45c54933532653b16ab5294b9b3cfa7526e49d4e22886412ca766564fdbfa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: at this point, to allow for recursive calls, add a callable type to the environment \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/function/FunctionBodyCompiler.scala"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a15d34db077ae53657cbfceabf95c82b99910917f011821a7ab8c345c4038e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // should just ignore others, TODO impl \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/expression/ExpressionCompiler.scala"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"7094480bf1e85e2d1d4459d00368b6445c185345a2cc5bfd548f9f1bb490ee06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(CRASTBU): make test that we have the right type in there, cuz the coordRuneA seems to be unused \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/expression/PatternCompiler.scala"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e15c63f5174d8acf57670560cadfdac3e9d0d9c16649517d948bdfae9e73275"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Take those internal methods that were defined inside the interface, and move them to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/TypingPass/src/dev/vale/typing/citizen/StructCompiler.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e09e2211803d48069b60a26ed6579642ab29234a338b9e58cd48fa211cc0717"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(optimize): zipWithIndex taking 1% of total time \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Solver/src/dev/vale/solver/OptimizedSolverState.scala"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c81b1c73627d0c9c7db51534f50e67d1cfcea3d6082045a6b863754d8578e62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(optimize): There has to be a faster way to do this... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/Solver/src/dev/vale/solver/Solver.scala"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7662dc7ba14149ca5504ea2604517b822b5d3f99be9a3b4b45e60a31795956a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rename block to body \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/SimplifyingPass/src/dev/vale/simplifying/VonHammer.scala"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7ce572a68f98912d00e8db76c25b0af18b3f2e30a093855b2679d3b86245a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Get rid of this in favor of just CoordComponentsSR. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/PostParsingPass/src/dev/vale/postparsing/rules/rules.scala"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"480989d9324171f914f9a930236cb87293131eac16cd55cee9cfecf37a68a7d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Soon, it will fall apart on certain cases. For example, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f065d2b6a8bd1fac8ad1d78365efcf64c2cedd808fa155a00933317fa0039b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Someday, we could interpret this occurrence as a way to make a List. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7342c79830071aa5b90f0d87012228c95c6994445f2ec43dd4aeb142bf7e77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is pretty confusing if youre not really deep into the \u0022trySkipPast\u0022 mindset already. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ParseUtils.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"975079fe7d42f4ee119a419294db87dfcee458665d4d63bac2768072ae118998"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: simplify this. It\u0027s really just trying to split on \u0022where\u0022. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/Parser.scala"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47f2049c2730703b6ba3497a1963029c63ca38dd7e7e02dc43aed508f695f5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Get rid of all the below when we\u0027ve migrated away from combinators. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/LexingPass/src/dev/vale/lexing/errors.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"95301ab9f8eadb0a97655595b011d5d44faa1f7f9130269f646df6ddc7ec6377"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We do nothing with kindExterns here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fc08743950c8a6e7ae2b3ea6bb5f0aafa9cd2f4271009a7a2b341f305fbb28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(regions): might be obsolete? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2f0aaca40c4f413ec2a1d18b29a603f87d567d385d1a62c5c30191094f4fb0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(regions): might be obsolete? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e0f2504363cfc9fc44ce308f6b94a04386167607ca5217b3bcb69a14f01673"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Feels like these can be simplified somehow... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cd0e2e415ab191e65f074110d38bd3585e6e28a613eaf03232392de9739698"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(regions): Figure out how to turn this into an sI. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65ae407e484b42e02a15a55e67d54875f664d71413ba4d2f84fa743ff0b44b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(regions): Figure out how to turn this into an sI. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"041010b9d4fbc79c6247a5310e7a376beca1bf8414af52ccd5dac3d947284fd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Catch impls up \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cdc89f6e502fa64ed649a1ca47dfbabbedcdf2c227af885651e356f3cb5e62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Catch impls up \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d364a1745a1534fc53035937b6df2b321006621293097242e3119e4e3d334e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //        // TODO(regions): centralize docs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3e7e56868906d5597c1c88f923c97d7f1201db1fc700ff8723bf600562c1a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //        // TODO use an array instead of a map here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03067892052f1b95ca8656fae88502857a911c9530b1a924522caaf66577827"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: see if we can combine this with the other composeOwnerships function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb7fbac3dccf40e6c9bf5ba7689e95a860c67aac4dcc13f0eb7b4644e24580b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: see if we can combine this with the other composeOwnerships function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":2884}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0a47b329bf5eb5d3b35c0729411b84b81c2bd9a9aeda8215cec24a09aaacc2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: see if we can combine this with the other composeOwnerships function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":2944}}}],"partialFingerprints":{"codehealthFindingId/v1":"5297ba179c1dd81ede3fb3034a01aa41c5f5c082aa380ffbe3c958dbdfa1a726"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: see if we can combine this with the other composeOwnerships function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/Instantiator.scala"},"region":{"startLine":3161}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb3abd5c6adadfc6aec28f4a98a0278f77ec2913f6deea99e2fbb1a68835585"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(optimize): Use an array for this, with a minimum index and maximum index (similar to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCounter.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a04d7b51748e6d2f7a12c9cb3a22db7dd28316b504e690313ae5b7e165ab32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Change this to edges, since interfaces impl other interfaces. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/FinalAST/src/dev/vale/finalast/ast.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07e5fa72c9fb5eb2c743e08359ca1f4ef9440707097c5976254ae330b2ec460"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If the vcurious below doesn\u0027t panic, get rid of this redundant member. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/FinalAST/src/dev/vale/finalast/instructions.scala"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5962ba3972590505c6487bce6373591bef70d996e5120849b213d681ab7df10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If the vcurious below doesn\u0027t panic, get rid of this redundant member. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/FinalAST/src/dev/vale/finalast/instructions.scala"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aaedbfe3e93aaeb2f87b8a6d54a9ed602e74ef7ee7d5bd73cbafae784c95c8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: See if we can infer this from the types in the expressions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/FinalAST/src/dev/vale/finalast/instructions.scala"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9db26e24a17aea5ea5ea7019e73564ae9b57945f5993a4fb4e6d111799813af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Take this out, it\u0027s redundant, can get it from argsExpressions[virtualParamIndex] \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/FinalAST/src/dev/vale/finalast/instructions.scala"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae36e6c4d651b8b8a8e5ac671e8eff4f776b9672cbce89cf6287562693d1a18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this, it\u0027s redundant with the generatorExpression\u0027s interface\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/FinalAST/src/dev/vale/finalast/instructions.scala"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71d9f93db443e218580b90ec0f7197bfc0a2bcd1059205bdb29e7749611f0ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this, it\u0027s redundant with the generatorExpression\u0027s interface\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/FinalAST/src/dev/vale/finalast/instructions.scala"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f230f727103321011b14a857a018fc1f64ab826a6a1793adbe9f7bf1267a29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     TODO: Get rid of raw. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/FinalAST/src/dev/vale/finalast/types.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"651226ecc374a3abc62b55f22b0530df6f91f097f223e037e640ef159595a974"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This feels weird being a kind in metal. Figure out a way to not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/FinalAST/src/dev/vale/finalast/types.scala"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8ddb85cfb696b694508a9dd1e377c17d42ffca5be8ab5e398408088f3eb9a3"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060ValeRuster/src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ValeRuster/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74240366469a9d3d18947f5de3cd2ac5f0690e4722eecfc8e6658e28fbd9fd16"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060Frontend\u0060 (58065 LoC, 1883 module-visible types across 35 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":"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":"703b990f6d9a60db46de372b4bc3713bc769740b61be7dfed2b23b523664ac12"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04cc6ef8b2713c5ae671a21c5adfc62ed3d32eec231bd27236ea49e066082d50"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b362aa4f8adb4306b3d145674ff15a61aacd3d276d618258794efce080a924e9"},"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":"bc26593caf509b487cb3dff9d1a587737a02c72fc5e13e59c1a151f7d6412ad4"},"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":"61146628abcb14f96f83ba5669ac6e9257cac15b64555c6536dd7d4f400920ad"},"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":"6bc3b539f953f180f304780b633bbb65e6d2911ce57503f2f0e4a05dfd504060"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"baa151beff35ac46ee2536907cc918a207da07c42b004fec4c9aab8d58a6df6d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f07ec2e89ac4b54707f3c0b0d03cd2c61e15b4b72a2bade5e46420d93f616e8"},"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":"28fb95c74cf7e51a3f6e58d6d5d9aaba698bdc10ef21fbd45c72dc90736c26c6"},"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":"77e2e71a4329e551cbe8be7023c7191820e375353d80fbebb52a3572f6943665"},"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":"2f665b15cfd0fa7c094c7944bf8e129fa62c6a2bf3b783b2751778d17896b9a6"},"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":"b2dde333b800a886ba8945ed6420eaed4efaf6025b8e0c01cc777c6266def479"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"bbc4f8bd230f76cb076300a43ccdc7a85f50e37710a914903aa652fe6ec7a67f"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"fbfb9293ee4c17f82ee59d2fbb04dc8b2dd77f013a0fe035730ea65af071bd25"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"33e24a8c563c94674c0bfd71bb8c07c6a8e80aff6d62d6d0fd8f8b65709aebed"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"75214684a7e1d6c3c1c31ae9af1fa8106e23789d1684321af16e5ec82a199c98"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"939cfc7b82db7414193213cadb41bc62acd39b057a2da95ea1fa82b2da9b4af3"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"ec5792d29a47791e5caca1c398d8e1fef5abfcf16db12b34c26cd1b0b4ba6ede"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"43556742800bbd2899cb862701f9afc147ad7e595aa49239bd9186462d0b8ee1"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"b9223c0e781b30ad3a13873d3cba0e6e4dafbba6ff2be1fa62e83cc7e5e0a073"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"70e64850e3d7fbfda92221dc0e183a9a69f9eb54048469ebb9d9e3b050de4179"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"69bd2bfc6b11051b7bd5466b6da6692a3c6ad496f1f3e753bc3163bf71dc8fa0"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48df2d7febd97c7a2ffffbf81abec22edc3db965c0c64511acf6ff8490a3e8c5"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e811bef75447baac0c6d898bcc081208bc4aa19abca85ac6f9bf4fdf75d0a41"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5939fdefdbdb4a9d68cfbdeff81688810ce4a0019e27cc42ccad6011273700ff"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9bb1c347f4413088fd5e30c7796cc2b8410926ffc9656da91adc875f25b6d651"},"properties":{"dependency":{"package":"adler","version":"1.0.2","advisory":"RUSTSEC-2025-0056","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee9604b003900af49dbec105cff16fd376a598f8e6653cfae2c2fb29dbdbe430"},"properties":{"dependency":{"package":"anyhow","version":"1.0.83","advisory":"RUSTSEC-2026-0190","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bffc628c0f6acf203d7214ce92acc68e9cc914c36e769d9fea7602da2bc4ff37"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3a23a2af3e96c002c885a0eedc9a14738dd10da714959fcdcbe5c5f52f6b731"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35b69589afb5c9dd725c7aef718386add3de095c281afa5c7e2ec798cf0c4810"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dce0f177715a767c14b1b76e9b55be4dab7bac3c1c7d81425206db68b2f59aaa"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"039469c8c19c326b2b4b2dc4edc77ecfafdf8fa99c13a77f7f26556d03480550"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c34f4fba2c95408b1ab901f2c180611b782e7f1e23c1f687b26119b437076c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/expressions.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aad87b080f3969773715d48da822cad3e3dfb2ad623f1c5aa86ce5c90827241"}},{"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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/names.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8481886fccefab2d71ca9fe0faa43fdf30a680b90cdd627310723ea9a08c0808"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 9 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCounter.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/templata.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala, Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala (and 1 more) (11 orphaned of 144 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 144 of the 184 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserIndividual.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7108ae7ebb26d3ef2bad76649c67e0aab2dad365409963c832abb529a4c8d43b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCounter.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fce78cd7a7d9edb4cb33c9fd22ae3e3b7a3aeeefe6d0cf1035aa70aa3de4b28"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/RegionCollapserConsistent.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccdda390541bc76e15cb4f1ed1dc287b04bbb6e006d26aa9aa4a802ab67043e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1b618547015f58a9b348ed84d5236d0b8f2af8f9c3a8cea3e53f302a736b38"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/HinputsI.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e82826aed2b5b47c87ae8f120f777fdfa897232c0259d842c784fcc2b030593"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/templata.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf5236cac94344a52b50be2b2693e8eb26a81b1d9a234a3ea2fd3821bdeff8a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/InstantiatedHumanizer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4c5cb2e23fe41d17c9c7e1551a3eb36d5fda3933ca9cec6d759d84b18b5f0f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/types.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d0dabda996567a30b192da7a727913fccd31729f63d28255e3d08020a0c967"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/citizens.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd12dd7aeabf9b8db13178a9970515b132c1911b05ab60f718862b0f16717afa"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ParsedLoader.scala \u2194 ParserVonifier.scala: \u0060Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala\u0060 and \u0060Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala\u0060 change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060bdae7907\u0060 Changed #!DeriveStructDrop to linear; \u0060db076f71\u0060 Added parsing of isolates. Added a flag for controlling whether to us\u2026; \u006070ea54dc\u0060 Upgrades for lexing and parsing pass to support regions \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ParsedLoader.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38fd314956fe3e109ad2680c4a65bdce7676919748ffba8000790cca8df57f3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ExpressionParser.scala \u2194 ParserVonifier.scala: \u0060Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala\u0060 and \u0060Frontend/ParsingPass/src/dev/vale/parsing/ParserVonifier.scala\u0060 change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060bdae7907\u0060 Changed #!DeriveStructDrop to linear; \u006070ea54dc\u0060 Upgrades for lexing and parsing pass to support regions; \u0060240affeb\u0060 Fixing array bugs (at that commit the files were still \u0060Valestrom/Parser/src/net/verdagon/vale/parser/ExpressionParser.scala\u0060 and \u0060Valestrom/Parser/src/net/verdagon/vale/parser/ParserVonifier.scala\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Frontend/ParsingPass/src/dev/vale/parsing/ExpressionParser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b390570fa181b6eb9919e36d0c8f781178e47d72d4064ae96639862bf6c1dde2"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90ef8645d5d250a2cdd6c4ddecf434c2439a3eaf0b71b0b76b3e93b4d1bb9e49"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"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 1 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/ci.yml"},"region":{"startLine":6}}}],"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":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.path[0] == \u0022core\u0022 \u0026\u0026 path.path[1] == \u0022macros\u0022\u0060 appears character-identically in 2 files \u2014 ValeRuster/src/resolve.rs, ValeRuster/src/resolve_id.rs. 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":"ValeRuster/src/resolve.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a687504b659d2cdfc8c12b59f8a8173faaae8ee078df2ee53715c2ed072bd2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name == that.name \u0026\u0026 virtuality == that.virtuality \u0026\u0026 tyype == that.tyype\u0060 appears character-identically in 2 files \u2014 Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala, Frontend/TypingPass/src/dev/vale/typing/ast/ast.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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e943a221c028e5a8bb9992f2cf82d51484e721741d42d2a07a411bab0057374c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060packageCoord == thatPackageCoord \u0026\u0026 initSteps == thatInitSteps \u0026\u0026 localName == thatLast\u0060 appears character-identically in 2 files \u2014 Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/names.scala, Frontend/TypingPass/src/dev/vale/typing/names/names.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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/names.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"46686792d4565905f2b6ed4a375decaca69657a44ab4fb34b6fda2dd72675c4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060subCitizen == thatStruct \u0026\u0026 superInterface == thatInterface\u0060 appears character-identically in 2 files \u2014 Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala, Frontend/TypingPass/src/dev/vale/typing/ast/ast.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":"Frontend/InstantiatingPass/src/dev/vale/instantiating/ast/ast.scala"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9da104bca57b7376170cf22b2ecb4e1514b0dd3361e77afa3a18a1ff6d52ea3"}},{"ruleId":"X5","level":"note","message":{"text":"Scala\u0027s null is not held to the type system everywhere: No build over this repository\u0027s 169 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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-676","guid":"550e6fab-2881-3252-8a05-c688a6b19c14","name":"Use of Potentially Dangerous Function","shortDescription":{"text":"Use of Potentially Dangerous Function"},"helpUri":"https://cwe.mitre.org/data/definitions/676.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"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":35,"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."]}]}