{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Elaborator.subterm (cyclomatic 209): Elaborator.subterm has cyclomatic complexity 209 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2d00691cd6a5caa3657af1fcbc36ce0d37084934ec4c897c974fe4eac113af"}},{"ruleId":"D1","level":"warning","message":{"text":"Elaborator.blockOrRcd (cyclomatic 200): Elaborator.blockOrRcd has cyclomatic complexity 200 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b4fc2bf4605932b3e6c673125f7264093bb8e6bfd1e0d39176b4e5af0958f1"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowering.term (cyclomatic 149): Lowering.term has cyclomatic complexity 149 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09ac687044de967c3935555ddeb8076e5ac876833b4befd4b11058be83fd24f"}},{"ruleId":"D1","level":"warning","message":{"text":"JSBuilder.returningTerm (cyclomatic 118): JSBuilder.returningTerm has cyclomatic complexity 118 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"99600c3eb76e8e6f479c6b3bafb07ed6d41e9acf8d069daa95664412a775debb"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.listen (cyclomatic 106): NewResolver.listen has cyclomatic complexity 106 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":4496}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c87ac0213820f3b904657433bd9720f3e407a6d274564658046588b10de542b"}},{"ruleId":"D1","level":"warning","message":{"text":"WatBuilder.result (cyclomatic 95): WatBuilder.result has cyclomatic complexity 95 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/WatBuilder.scala"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"58466ad1461ca5f4d2cec981398c2e4c5e3974f033a1de730b005e5c1ea59eea"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementImpl.show (cyclomatic 88): StatementImpl.show has cyclomatic complexity 88 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/TermImpl.scala"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c24083fbee0b41774eed21bbd184ae3df3c0cdc65942f902473e783534542b"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.matchShapePat (cyclomatic 87): NewResolver.matchShapePat has cyclomatic complexity 87 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":2953}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbbf17aad2068fa62edd233e7538c6719ebddd780591d8a543f684393ab4cdc"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFlowAnalysis.applyBlock (cyclomatic 76): DataFlowAnalysis.applyBlock has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"7814e9f591174e035d7135d6af79f678494da9b871970fc7195e860b293f2782"}},{"ruleId":"D1","level":"warning","message":{"text":"WatBuilder.returningTerm (cyclomatic 76): WatBuilder.returningTerm has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/WatBuilder.scala"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3bbdb19f79d3c910550fbc0ed30771f4f0aa1709f987d84057ea05fecf9ef9"}},{"ruleId":"D1","level":"warning","message":{"text":"Elaborator.pattern (cyclomatic 72): Elaborator.pattern has cyclomatic complexity 72 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f36648b0a60a47e91c598730dbc39f94c91552a6b4522e8b868ea417f9f0087"}},{"ruleId":"D1","level":"warning","message":{"text":"TailRecOpt.optScc (cyclomatic 71): TailRecOpt.optScc has cyclomatic complexity 71 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/TailRecOpt.scala"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb2a29bbcb8376c3f6f563952e5e2c7eb5c0b5d0ae2cb40649f5eb66cb68a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementImpl.showPlain (cyclomatic 71): StatementImpl.showPlain has cyclomatic complexity 71 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/TermImpl.scala"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3764b07a614ca1ebaa64129ff386e78834077c29aeb418682722e574085fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.listenTypeViews (cyclomatic 68): NewResolver.listenTypeViews has cyclomatic complexity 68 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b80110a820eb965118c9e0a1ccc27903bcddf7347895c66d63b378920c47df"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementImpl.describe (cyclomatic 65): StatementImpl.describe has cyclomatic complexity 65 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/TermImpl.scala"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e44f6eea3d501a88b262581f6457bc168ce39f278966aa6940a8db18ecb486"}},{"ruleId":"D1","level":"warning","message":{"text":"Cloner.term (cyclomatic 61): Cloner.term has cyclomatic complexity 61 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Cloner.scala"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceee2b2cc84a9f3c348ed9d8ccf1561d19c57b55b3677eb4ba25b062ab0546f2"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.regularType (cyclomatic 61): NewResolver.regularType has cyclomatic complexity 61 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7c2f2b9d231665176889eec200093bdb5bf7e2873b70f97473db70a5cd5344"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowering.block (cyclomatic 60): Lowering.block has cyclomatic complexity 60 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbba14197d479d6a280d3f6969d1162aecd7d06ccedb50b4df73727bc747c465"}},{"ruleId":"D1","level":"warning","message":{"text":"UsedVarAnalyzer.reqdCaptureLocalsBlk (cyclomatic 60): UsedVarAnalyzer.reqdCaptureLocalsBlk has cyclomatic complexity 60 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/UsedVarAnalyzer.scala"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4a652b859eaa9366106fa0631f6bc4bfb39616dd68c6352c0d189eb9190714"}},{"ruleId":"D1","level":"warning","message":{"text":"InvalTyper.typeCheck (cyclomatic 59): InvalTyper.typeCheck has cyclomatic complexity 59 (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":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d97e864f56d4efa58ff0f6f87577d2cf21e6ef4e8efbe6946738c6ab6fd1684"}},{"ruleId":"D1","level":"warning","message":{"text":"JSBuilder.result (cyclomatic 58): JSBuilder.result has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a41851fe0313b5370a5181d809ac9ea12d0b5caf57089b997a76a40cf018b20"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver.resolve (cyclomatic 56): Resolver.resolve has cyclomatic complexity 56 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1be13d4afe8b90260e786454b6a0d91fbf5806196293ed3841d235b298e09f"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lex (cyclomatic 53): Lexer.lex has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Lexer.scala"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dd2f9b5cf400dacef3dd17e7891cf375a95255fbdba9e060da9f7deff83444"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.typeResolution (cyclomatic 52): NewResolver.typeResolution has cyclomatic complexity 52 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe9ea732f2d7ac3f21a21ff8c09a5930fc18d73f3d30799004cc9764ceb0c1f"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.dependencies (cyclomatic 52): NewResolver.dependencies has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c520cb846813e70504ee29dd71f74bec5d6be4f36bd47ba30cdde18257cce1"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.exprContImpl (cyclomatic 52): Parser.exprContImpl has cyclomatic complexity 52 (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":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bd6cf9eea5ccd263f975476d0228561c29faf13945b193905d68a3b3d78212"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.inferTypeArguments (cyclomatic 47): NewResolver.inferTypeArguments 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"687f5acabee4732ad77b7e02ac4c5c355f3dc859c93bc825fb2b05802d2d647e"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowAnalysis.typeProdImpl (cyclomatic 47): FlowAnalysis.typeProdImpl 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32e8281d4ffbdde761462fb26f4f3fa055ef79471d601a5716b0d96baa546a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parseRuleImpl (cyclomatic 47): Parser.parseRuleImpl 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":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"989b301b0e5993df79b9f61164b7267f40136fddf6684b81c5fbce652f78517a"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.simpleExprImpl (cyclomatic 47): Parser.simpleExprImpl 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":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c574928f167492d4a4f4662db662e565319e5641b3caae9087ed16aa6b0c337"}},{"ruleId":"D1","level":"warning","message":{"text":"HandlerLowering.translateBlock (cyclomatic 45): HandlerLowering.translateBlock has cyclomatic complexity 45 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13841303624d46609157ac2cc58f20e7d6de788580f594dff445ac632fbbe02"}},{"ruleId":"D1","level":"warning","message":{"text":"Instantiator.instantiate (cyclomatic 43): Instantiator.instantiate has cyclomatic complexity 43 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Instantiator.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2cae7b4515f6450a550fa24a3fb6e231521486a626683ce7a287c65ff38669"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.applyShape (cyclomatic 42): NewResolver.applyShape has cyclomatic complexity 42 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e6b2842d05d220348993383a893abeb363d28ead6034354896be2cb1e0d093"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockTransformer.applyBlock (cyclomatic 41): BlockTransformer.applyBlock has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"985f442f88103b7186c07fa49e2ec9a0279a67943ee2eadf30f7f45a80eaa2df"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockRewriter.rewriteDefnRefs (cyclomatic 41): BlockRewriter.rewriteDefnRefs has cyclomatic complexity 41 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"83235c29114c16d587cc4a12adc17dc07bf789a98fa403bc5431ff030783fa9a"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowAnalysis.solveConstraints (cyclomatic 40): FlowAnalysis.solveConstraints has cyclomatic complexity 40 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f8591041c29221fa5fe2af3f5d5f2dab2f54f68975d81f89ec0173a87130bc"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitCompiler.makeMatchSplit (cyclomatic 40): SplitCompiler.makeMatchSplit has cyclomatic complexity 40 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"6552d638b411d3db3655535ec0ec8646a5d408775cf783ee69aa8c37e7dadfb0"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.resultFlow (cyclomatic 39): NewResolver.resultFlow 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":4352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1a22eacaa261dbc20d3f452da6730c53b78ad9f533676ccd7e58640a9f72e3"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeSimplifier.simplifyBounds (cyclomatic 38): TypeSimplifier.simplifyBounds has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/TypeSimplifier.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaf544f35d88a2c9a738e7e0c57b9e7616c14eefe34113be4d489b8e79fb18b"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolutionContext.checkAccess (cyclomatic 37): ResolutionContext.checkAccess has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolverState.scala"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1de55ef6298d30c1549a3ade3729810994c3072e3f7430bf2407c59782d253"}},{"ruleId":"D1","level":"warning","message":{"text":"View.sameValue (cyclomatic 36): View.sameValue 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Shape.scala"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c381680fcefff7a8a8abbe191d1dab93001672803acc8f1076d25aaca4b6327"}},{"ruleId":"D1","level":"warning","message":{"text":"Block.flatten (cyclomatic 35): Block.flatten has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a9113d8bcfb8cd5c14fce86f9b6ed8c45b2a26dd71223537c92be10b7c1a6c"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.completePattern (cyclomatic 34): Compiler.completePattern has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9254f6ed795cadf8303aeb6aa8a915e919a8617ff0434a8d69c9b347c78aee5"}},{"ruleId":"D1","level":"warning","message":{"text":"ReportFormatter.apply (cyclomatic 34): ReportFormatter.apply has cyclomatic complexity 34 (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":"hkmc2/shared/src/main/scala/hkmc2/utils/ReportFormatter.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"657bf20a3414a06142703e7f7e22441ca8bfe2affd51049a7738bd311d74b9c5"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.constructorPattern (cyclomatic 33): NewResolver.constructorPattern has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6e2e8f5dbea669f92165991150e025d0cd30d48a9efbc32054044eebc68b71"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitCompiler.makeStringPrefixMatchSplitImpl (cyclomatic 33): SplitCompiler.makeStringPrefixMatchSplitImpl has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"371dc33b263e18b5e367dd323aaede746253aff93f4ea426ba1dcbff732d380b"}},{"ruleId":"D1","level":"warning","message":{"text":"Lifter.createMetadata (cyclomatic 32): Lifter.createMetadata 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d56f063086654abc441b5d79e13cde9c6d48a208dd64fd0ba0f1cd844879a1"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.fromBMSAt (cyclomatic 32): NewResolver.fromBMSAt 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":4107}}}],"partialFingerprints":{"codehealthFindingId/v1":"37be1f299ed42ef63bd3eec89d616805808066189da5e7dd2bcb11b76396f0b7"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeResolution.validate (cyclomatic 32): TypeResolution.validate 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/TypeShape.scala"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"786a27dd513d8a999e0e91b5ca84774276f828bcad6a116766ab32be20f91471"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.num (cyclomatic 32): Lexer.num has cyclomatic complexity 32 (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":"hkmc2/shared/src/main/scala/hkmc2/syntax/Lexer.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"368b3aa76499510803685fcc0cfcf2c029c1ca294be717e704db21eb046e942e"}},{"ruleId":"D1","level":"warning","message":{"text":"HandlerLowering.partitionBlock (cyclomatic 31): HandlerLowering.partitionBlock has cyclomatic complexity 31 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae320868e7f4a54b79bd95e301b52d4b2087e5484b7527b04bd489b930b68923"}},{"ruleId":"D1","level":"warning","message":{"text":"InvalTyper.typeAndSubstType (cyclomatic 31): InvalTyper.typeAndSubstType has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d0b75b4daa4b30f01c35a1bc9f4c75b945bac61cf7ef1488409bd4805424b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowering.reportAnnotations (cyclomatic 30): Lowering.reportAnnotations 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"84254934c422c99d5b5b593370452121af9f88fba530571b96ea584be09e2bf7"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.str (cyclomatic 30): Lexer.str has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Lexer.scala"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03b3bb95371c171b75a137e4b500f055115d667c1a1b85171e34bf8034208ce"}},{"ruleId":"D1","level":"warning","message":{"text":"DebugPrinter.printProduct (cyclomatic 29): DebugPrinter.printProduct has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/utils/utils.scala"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee248a8d661d840637e11e19f545d86f1da4a8216901c1692efdeb5373acc39"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer.print (cyclomatic 28): Printer.print 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Printer.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"77137e7e1754b45bb44bf5d10761395496484d2194930e82c03664c94be16cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.symbolKey (cyclomatic 28): NewResolver.symbolKey has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":4271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7a0e0e38f59ccc5585daca8f5347004ed7b0bed2fb0c89376fae1311c6bac7"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitCompiler.makeMatchClassSplit (cyclomatic 28): SplitCompiler.makeMatchClassSplit has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdba58e149aac0b597f03eb014ecfa67b9db7cea33636f21d65f03b7dbbb164"}},{"ruleId":"D1","level":"warning","message":{"text":"EtaExpansionSolver.etaExpansionTargetShapes (cyclomatic 27): EtaExpansionSolver.etaExpansionTargetShapes has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/EtaExpansion.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0de93b53dd4c30eca305fa0d0d11e34144f002b210f34f761a454a644af3d9"}},{"ruleId":"D1","level":"warning","message":{"text":"InterfaceExposure.valueIn (cyclomatic 27): InterfaceExposure.valueIn 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/InterfaceExposure.scala"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4c9a3c06cbfa856150016f874db923bce87e8c8ad0cbf97d8f82f6d2c757ad"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.newSel (cyclomatic 27): NewResolver.newSel 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":3712}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e2f66ae4072a53111e11cefc56d30360eebe920a4ee6f06c0d9ad37e619e2b"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitCompiler.preservesOriginalScrutinee (cyclomatic 27): SplitCompiler.preservesOriginalScrutinee 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c643f92b1e41fbed6357a4e75578353a3d00ad621752b93b526104be5684d4"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowPreAnalyzer.applyBlock (cyclomatic 26): FlowPreAnalyzer.applyBlock 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"6456b8efd94adac888c48a7971c28bc5f796652366e1c5fb24969df10ec67bfe"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver.resolveSign (cyclomatic 26): Resolver.resolveSign 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c7304f9ae23226b3a1c138b991a1614dd159991c8ba849f579b0e2f7656815"}},{"ruleId":"D1","level":"warning","message":{"text":"Normalization.lowerSplit (cyclomatic 26): Normalization.lowerSplit 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b15b950af986ccfc20919dfeec63cccefa07dc2e1518dd700993e29b84a6d29"}},{"ruleId":"D1","level":"warning","message":{"text":"Pattern.simplify (cyclomatic 26): Pattern.simplify 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Pattern.scala"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"75116e1fd80337e85546e7f2bc25eec119baeae59b6d5db18bd0d4aa3708d318"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.blockOfImpl (cyclomatic 26): Parser.blockOfImpl 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":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"828d352c507c8198877fb958760e4b9273e263bb82469f43d6bf7f9baa31ae38"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowering.ref (cyclomatic 25): Lowering.ref 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"62879bcade1fcccf8e49c9059f28588263573a0687d09a567d81030c7eb26199"}},{"ruleId":"D1","level":"warning","message":{"text":"Elaborator.annot (cyclomatic 25): Elaborator.annot 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fa333ad95336aca0bbeef4fce95234a4d451bc691ee4693f08f75d4cb35bd4"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.exposeTypeHoles (cyclomatic 25): NewResolver.exposeTypeHoles 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"caccd23e2037106c7a7f9f7b2a68415d2310c553d42f4aee08eb57156af499df"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.constrainFunction (cyclomatic 25): NewResolver.constrainFunction 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd47c4efe89cdae1e10a876934a47f953cf2e6beec64799078baca934ffddf9"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.builtinApplication (cyclomatic 25): NewResolver.builtinApplication has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":3275}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cac79e47d591c11aa704d643358cff7046106be5d0c20223437ff0f98ee25b"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolutionContext.completeBlock (cyclomatic 25): ResolutionContext.completeBlock 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolverState.scala"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30d8995072034ba7f5b8d84f647c100288e0fc161967e20e1713c072afaede4"}},{"ruleId":"D1","level":"warning","message":{"text":"Document.format (cyclomatic 25): Document.format 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":"hkmc2/shared/src/main/scala/hkmc2/utils/document/Document.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ced940aca00f50c8c1b3dbac0eb99c0bcf0bcd601843e9971506316d61757d"}},{"ruleId":"D1","level":"warning","message":{"text":"Elaborator.params (cyclomatic 24): Elaborator.params 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3331}}}],"partialFingerprints":{"codehealthFindingId/v1":"261666da822a569375b1812523da95a4993f0aad3a605534c4f9c7bd2a9b5f49"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.instantiateShape (cyclomatic 24): NewResolver.instantiateShape 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5505981992c7ba8ab0bbaa24ea4f98a18e567ba94a3f77f797b9c4d42c97cea"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowering.quote (cyclomatic 23): Lowering.quote 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe4be0a59f0ca3a4746f2eae80ce9ce37ffd05c1b9bcaea18e837af377a6de7"}},{"ruleId":"D1","level":"warning","message":{"text":"Normalization.apply (cyclomatic 23): Normalization.apply has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b903b6c2c8dce1367ca22a4154e6046a224a92183a7ab71dcb634d5ae4d59a"}},{"ruleId":"D1","level":"warning","message":{"text":"UsedVarAnalyzer.blkAccessesShallow (cyclomatic 22): UsedVarAnalyzer.blkAccessesShallow has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/UsedVarAnalyzer.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"af95b45a405f386b07ec6b2053466a0c4334f77988a2f64928970600bacace6b"}},{"ruleId":"D1","level":"warning","message":{"text":"BuiltinOperatorResults.apply (cyclomatic 22): BuiltinOperatorResults.apply has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/BuiltinOperatorResults.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a62d1548a736af164927f7c1bdca3835b2c01dac8520ea2164b1c8b8fcece9"}},{"ruleId":"D1","level":"warning","message":{"text":"Normalization.specialize (cyclomatic 22): Normalization.specialize has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"280850cee5a5b3a817f036f6bb03a0124561623dcb42203c5eba00c9dcda6a5d"}},{"ruleId":"D1","level":"warning","message":{"text":"FixedPointCompiler.compile (cyclomatic 22): FixedPointCompiler.compile has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/FixedPointCompiler.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa6e9626fe187c7b5cbad6b87f589527c252c7bbb27874caa8ccd0eaea3d1f1"}},{"ruleId":"D1","level":"warning","message":{"text":"Erasure.erasedDefinitionSignature (cyclomatic 21): Erasure.erasedDefinitionSignature has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Erasure.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceaee87e8921c48c68fcd38dcda6ac90828fe48e0748c51e4553d0786fc366f"}},{"ruleId":"D1","level":"warning","message":{"text":"HandlerLowering.computeRestoreList (cyclomatic 21): HandlerLowering.computeRestoreList 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d89ce277ccd0640f093b82d6d8df663851fa85de8224781dd11cb986de55c5"}},{"ruleId":"D1","level":"warning","message":{"text":"ScopeData.makeScopeTreeRec (cyclomatic 21): ScopeData.makeScopeTreeRec 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/ScopeData.scala"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a36657bdd100b3564ff85b6911a16e50ec2b5db515f2dd95016ac58a151b36b"}},{"ruleId":"D1","level":"warning","message":{"text":"InvalTyper.typeCode (cyclomatic 21): InvalTyper.typeCode 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":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"66791eb4ee5eb257b96b77ce40c5e746167a3ef920b3e065c1c4fc2d80986ec7"}},{"ruleId":"D1","level":"warning","message":{"text":"Rewriter.applyResult (cyclomatic 20): Rewriter.applyResult 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/FlowAnalysisBasedRewrite.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce63b0d819098f3326a569384490ceb86a50997e1c93e5b1a5ad4810c5c4e07c"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockRewriter.applyBlock (cyclomatic 20): BlockRewriter.applyBlock has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f93fd733917233e56df6cffe1c35171a27f968e8cb70e5d16859b8cadb6d7d9"}},{"ruleId":"D1","level":"warning","message":{"text":"InvalTyper.typeADTMatch (cyclomatic 20): InvalTyper.typeADTMatch 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":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fa2febf7b4a5566f9b1fede28b67faf2a6597772329fa8c0d1013d7c4b0320"}},{"ruleId":"D1","level":"warning","message":{"text":"InvalTyper.typeSplit (cyclomatic 20): InvalTyper.typeSplit has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e272d67e74ab17aca36803d29c06bd00a639fdf9cdb81841c43d8f10f09f93d4"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.zipTupleShapes (cyclomatic 20): NewResolver.zipTupleShapes 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2d9f10f563264989169731bb69f85eca7244d521574c7302afa209cbc397dc"}},{"ruleId":"D1","level":"warning","message":{"text":"doc.apply (cyclomatic 20): doc.apply has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/utils/document/DocumentContext.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a7a08d387dd6aef2d040b16b88ac5dc4a6c9cd4baa9f6cc266553f762baeb8"}},{"ruleId":"D1","level":"warning","message":{"text":"DeadCodeElim.applyBlock (cyclomatic 19): DeadCodeElim.applyBlock 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d749ebf9e3bf677d66f33ea03d4ba8d2c822a8a67afa58ba9941e4bbdf12799"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.listenDeclaredMember (cyclomatic 19): NewResolver.listenDeclaredMember 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"630eabbb107762e62b0244ad718dddaa3f561121cb4123621127e0dbbe871471"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver.resolveType (cyclomatic 19): Resolver.resolveType 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a879660b058878968e0c5271f826bb0b77fdcaa5113450abe6ce981242b681c"}},{"ruleId":"D1","level":"warning","message":{"text":"prettyPrint.showSplit (cyclomatic 19): prettyPrint.showSplit 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Split.scala"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16d54be5c10b85d8fa5ca65488ba40999e81ee9347797b46bd73890433c9392"}},{"ruleId":"D1","level":"warning","message":{"text":"Match.apply (cyclomatic 18): Match.apply has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de4361e5df619978ab5caa3f6a330dfe5eaa23a13c05cbabaa17629bb4468ca"}},{"ruleId":"D1","level":"warning","message":{"text":"WatBuilder.compilePreCtor (cyclomatic 18): WatBuilder.compilePreCtor 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/WatBuilder.scala"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa4d68ce9995b0bf59ec8101074d6cfd55e9c0703aa58af4cd707e8eeaa6d8b"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.listenClass (cyclomatic 18): NewResolver.listenClass has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: NewResolver.shapeDependencies (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":3607}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49e2a498ce3400df1240c4aec355b73c99f31fa0ad8347f1f5631dd1cd1964c"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver.traverse (cyclomatic 18): Resolver.traverse 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c54dbf69d260688b88172098596ab9f1b4f5120594595824c9241da2b51896c"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver.traverseSign (cyclomatic 18): Resolver.traverseSign 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7abec0f546cba0163330536ced9e82a4b1269e8eb50a32f2fe9189cd4f5b35c"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclaredType.equivalent (cyclomatic 18): DeclaredType.equivalent has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/TypeShape.scala"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bec3b2b598fa30c339d7f54efe830d851ce87eecd67abbdc8ee1f318fc634f6"}},{"ruleId":"D1","level":"warning","message":{"text":"Normalization.compareCasePattern (cyclomatic 18): Normalization.compareCasePattern 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd39b6e3b519b5821044d4b97f9abcf01ddb19e1836ac2e65ecbb338cbddb676"}},{"ruleId":"D1","level":"warning","message":{"text":"Scope.allocateName (cyclomatic 18): Scope.allocateName has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/utils/Scope.scala"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9d9af27c7b5f5159ede4beba498c2668a94f226d4f87070467a0fdc8645f0c"}},{"ruleId":"D1","level":"warning","message":{"text":"RecordShape.getMemberImpl (cyclomatic 17): RecordShape.getMemberImpl 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. This is NOT this file\u0027s highest cyclomatic complexity: Shape.shwDbg (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Shape.scala"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be65cbf4b3ffc0ef9e237b222c7f43c06a29fe16f661394860cd281713927f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Normalization.normalizeImpl (cyclomatic 17): Normalization.normalizeImpl 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e701cf94a4b37bfb7c788982bd5d3f001e15572bc38dd1c3114e0b1ebc55585e"}},{"ruleId":"D1","level":"warning","message":{"text":"Lowering.reportAnnotations (cyclomatic 16): Lowering.reportAnnotations 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"921b66aecd24d3dd0e24ba1c3a34cc797bde1d4afe3ab4839bd099f4a2878a59"}},{"ruleId":"D1","level":"warning","message":{"text":"TailRecOpt.transform (cyclomatic 16): TailRecOpt.transform 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/TailRecOpt.scala"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"562485aea83bccc88501e5d4528c962f7bc1c0bf138678b6440b654cb948bbbe"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.declaredType (cyclomatic 16): NewResolver.declaredType 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. This is NOT this file\u0027s highest cyclomatic complexity: NewResolver.shapeDependencies (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7b06aab9da8b6238e5afc92573b98eed509feaad919ea68577dbe3250e787e"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.registerParameterSignature (cyclomatic 16): NewResolver.registerParameterSignature 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. This is NOT this file\u0027s highest cyclomatic complexity: NewResolver.shapeDependencies (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"196c020b09c865430dbb45eecf5bf14032cbb79927e99c0ffaf2c6da8ae53dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"NewResolver.unresolvedRef (cyclomatic 16): NewResolver.unresolvedRef 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. This is NOT this file\u0027s highest cyclomatic complexity: NewResolver.shapeDependencies (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":3555}}}],"partialFingerprints":{"codehealthFindingId/v1":"421a6ef663858cfcabeed501fa6eac429216d7df02f7c86766bef21cada960dc"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver.traverseDefn (cyclomatic 16): Resolver.traverseDefn 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8062af2bfbb8c5dd8941efaca0a2edd9bbcaade6333ed7c3cfd7878a0f3154c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Elaborator.blockOrRcd (cognitive 358): Elaborator.blockOrRcd has cognitive complexity 358 (threshold 15). Drivers by points: if/else 89 (176 pts), match/switch 60 (155 pts), boolean chains 27 (nesting depth added 182). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2247f97f5edba3aadd72fe851635aaeaf0f8d37dba3569c827785abd57e0fc63"}},{"ruleId":"D2","level":"warning","message":{"text":"JSBuilder.returningTerm (cognitive 240): JSBuilder.returningTerm has cognitive complexity 240 (threshold 15). Drivers by points: if/else 59 (131 pts), match/switch 27 (93 pts), boolean chains 16 (nesting depth added 138). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"551e44d5e464517444c8f8f25ebd658565ec375c7240ae21d744b45fae122323"}},{"ruleId":"D2","level":"warning","message":{"text":"Elaborator.subterm (cognitive 196): Elaborator.subterm has cognitive complexity 196 (threshold 15). Drivers by points: if/else 74 (105 pts), match/switch 41 (89 pts), boolean chains 2 (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec78c1c7ec819ec9efcf99a31c5b22ea5007516168e46dacdb47d38793f2fa5"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowering.term (cognitive 168): Lowering.term has cognitive complexity 168 (threshold 15). Drivers by points: if/else 52 (86 pts), match/switch 29 (77 pts), boolean chains 5 (nesting depth added 82). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"1110efa27abd6a4471c48508905ca9c92ae4058cd57412ed044af268cfa61a68"}},{"ruleId":"D2","level":"warning","message":{"text":"WatBuilder.result (cognitive 147): WatBuilder.result has cognitive complexity 147 (threshold 15). Drivers by points: match/switch 32 (89 pts), if/else 33 (56 pts), boolean chains 2 (nesting depth added 80). 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/WatBuilder.scala"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5963b40f73e58d5c1df0384a2c432ad5893f4545d49264074614c1dac3b08be"}},{"ruleId":"D2","level":"warning","message":{"text":"TailRecOpt.optScc (cognitive 142): TailRecOpt.optScc has cognitive complexity 142 (threshold 15). Drivers by points: if/else 57 (69 pts), match/switch 25 (60 pts), loops 3 (8 pts), boolean chains 5 (nesting depth added 52). 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/TailRecOpt.scala"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc51f18d5c55759ae5d136fd1fb86c1f9b85309857f3e9db21ab09206ce4b71"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFlowAnalysis.applyBlock (cognitive 136): DataFlowAnalysis.applyBlock has cognitive complexity 136 (threshold 15). Drivers by points: if/else 48 (74 pts), match/switch 14 (46 pts), boolean chains 16 (nesting depth added 58). 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c7dd4de0315bed9f90089dfa89db3d2d79df899e375dd7a93cc59c351aba64"}},{"ruleId":"D2","level":"warning","message":{"text":"WatBuilder.returningTerm (cognitive 132): WatBuilder.returningTerm has cognitive complexity 132 (threshold 15). Drivers by points: if/else 34 (78 pts), match/switch 20 (50 pts), boolean chains 4 (nesting depth added 74). 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/WatBuilder.scala"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8072442d8b95a3388683a6db46d277e7cb6528bcc45b091ea6a11d78635cb4"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.listen (cognitive 130): NewResolver.listen has cognitive complexity 130 (threshold 15). Drivers by points: if/else 34 (66 pts), match/switch 22 (61 pts), boolean chains 3 (nesting depth added 71). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":4496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03595361b48bf64e528df2db2629f30d13b770565fc77163f78da2f3e3e65d8"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.matchShapePat (cognitive 121): NewResolver.matchShapePat has cognitive complexity 121 (threshold 15). Drivers by points: match/switch 26 (81 pts), if/else 18 (29 pts), boolean chains 7, loops 1 (4 pts) (nesting depth added 69). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":2953}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b98d83b617e9d148082a726e7fdd75f9667a24a8ece67626bf93bec32bcdf88"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.dependencies (cognitive 110): NewResolver.dependencies has cognitive complexity 110 (threshold 15). Drivers by points: if/else 30 (79 pts), match/switch 6 (24 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96e0c0ac613661c44db631bcd9330baa29b3108df2a0e892815d846c9d2ccec"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowering.block (cognitive 95): Lowering.block has cognitive complexity 95 (threshold 15). Drivers by points: match/switch 22 (65 pts), if/else 12 (26 pts), boolean chains 3, loops 1 (nesting depth added 57). 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a6cb5515b191d30a057b018a97c8a37754e9e78266f4d0f1832cd24dd5a60f"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.listenTypeViews (cognitive 94): NewResolver.listenTypeViews has cognitive complexity 94 (threshold 15). Drivers by points: match/switch 21 (67 pts), if/else 17 (26 pts), boolean chains 1 (nesting depth added 55). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01e50aebba97ea4221aada02e3cfbd21572377d05e98c9eb04fa1fe093ec61a"}},{"ruleId":"D2","level":"warning","message":{"text":"UsedVarAnalyzer.reqdCaptureLocalsBlk (cognitive 90): UsedVarAnalyzer.reqdCaptureLocalsBlk has cognitive complexity 90 (threshold 15). Drivers by points: if/else 18 (35 pts), match/switch 15 (27 pts), loops 8 (22 pts), boolean chains 6 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/UsedVarAnalyzer.scala"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caf2804844a1bd442404ff4d4a0671038cd47f9886397d30487674a07ecddb6"}},{"ruleId":"D2","level":"warning","message":{"text":"JSBuilder.result (cognitive 87): JSBuilder.result has cognitive complexity 87 (threshold 15). Drivers by points: if/else 46 (74 pts), match/switch 6 (12 pts), boolean chains 1 (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9aa18987bc3411f4f2b0797e311b3b3d56d8c70c9290cd932e0e1632f7b462"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.constructorPattern (cognitive 84): NewResolver.constructorPattern has cognitive complexity 84 (threshold 15). Drivers by points: if/else 18 (42 pts), match/switch 12 (41 pts), boolean chains 1 (nesting depth added 53). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fee0f85edf50fe03b4196788b46324b05ea889eba687023ee8ed81d01e9484b"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.lex (cognitive 84): Lexer.lex has cognitive complexity 84 (threshold 15). Drivers by points: if/else 30 (63 pts), boolean chains 16, match/switch 2 (5 pts) (nesting depth added 36). 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":"hkmc2/shared/src/main/scala/hkmc2/syntax/Lexer.scala"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d6e3dcb814d8b5cee4147e7ebee82bf9e2b14abb84098b5d04a78f439566b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.exprContImpl (cognitive 83): Parser.exprContImpl has cognitive complexity 83 (threshold 15). Drivers by points: if/else 27 (40 pts), match/switch 15 (38 pts), boolean chains 5 (nesting depth added 36). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8a57acc1ebb108aa69b3ab7b2aeea7587184655d7696625206518ac3e325ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.resolve (cognitive 78): Resolver.resolve has cognitive complexity 78 (threshold 15). Drivers by points: match/switch 18 (43 pts), if/else 17 (32 pts), boolean chains 3 (nesting depth added 40). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"666367053fd40f501501273d51f2d0c573e25570fed1bb9fd9bbe990bc791a1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parseRuleImpl (cognitive 78): Parser.parseRuleImpl has cognitive complexity 78 (threshold 15). Drivers by points: match/switch 14 (45 pts), if/else 12 (26 pts), boolean chains 7 (nesting depth added 45). 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":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba6145e20f83635f3686550d75b4b1dcf58e540430f75e58f20e8a46447f440"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowAnalysis.solveConstraints (cognitive 77): FlowAnalysis.solveConstraints has cognitive complexity 77 (threshold 15). Drivers by points: match/switch 11 (60 pts), if/else 6 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 55). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"413d654533ccc9df52bc06f8720959649816e3dac0a2927a3f4982db9b095922"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.inferTypeArguments (cognitive 75): NewResolver.inferTypeArguments has cognitive complexity 75 (threshold 15). Drivers by points: if/else 19 (38 pts), match/switch 11 (37 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d1bbc7ff79c668905b06a06c97b1f2e289d9e58ba69ec67584c892f4b2c600"}},{"ruleId":"D2","level":"warning","message":{"text":"InvalTyper.typeCheck (cognitive 72): InvalTyper.typeCheck has cognitive complexity 72 (threshold 15). Drivers by points: match/switch 16 (46 pts), if/else 14 (25 pts), boolean chains 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":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41da443288fb4cc47e5de11d27d073ee6ec62262f967550df84d36620f6320e"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.applyShape (cognitive 70): NewResolver.applyShape has cognitive complexity 70 (threshold 15). Drivers by points: match/switch 17 (38 pts), if/else 23 (30 pts), boolean chains 2 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"120647ba826911dc32c408cbce5cea3ced61e2c7e7443705719c201c09efc907"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.str (cognitive 66): Lexer.str has cognitive complexity 66 (threshold 15). Drivers by points: if/else 27 (54 pts), match/switch 3 (8 pts), boolean chains 4 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Lexer.scala"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7a17432586d9c97162007affaa162f58c1505f695202c618bf9b8b8a3e7c35"}},{"ruleId":"D2","level":"warning","message":{"text":"HandlerLowering.translateBlock (cognitive 65): HandlerLowering.translateBlock has cognitive complexity 65 (threshold 15). Drivers by points: if/else 41 (49 pts), boolean chains 9, match/switch 7 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"af82f0280be7dedc84a63fd284861b146b21bcce7c215a1d82d4f7ef8258ab81"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockRewriter.rewriteDefnRefs (cognitive 64): BlockRewriter.rewriteDefnRefs has cognitive complexity 64 (threshold 15). Drivers by points: match/switch 17 (44 pts), if/else 13 (19 pts), boolean chains 1 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b20d276d1dd95afb559f25e6134403735e154db1f5dd7e1917fd2f5e2124f92"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.fromBMSAt (cognitive 63): NewResolver.fromBMSAt has cognitive complexity 63 (threshold 15). Drivers by points: match/switch 11 (31 pts), if/else 15 (27 pts), boolean chains 5 (nesting depth added 32). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":4107}}}],"partialFingerprints":{"codehealthFindingId/v1":"de39d31fd0f924a3d3dc29397fc6648ff91e267c022ba823a83a1eb5a35cc983"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionContext.checkAccess (cognitive 63): ResolutionContext.checkAccess has cognitive complexity 63 (threshold 15). Drivers by points: match/switch 13 (37 pts), if/else 18 (24 pts), boolean chains 2 (nesting depth added 30). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolverState.scala"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a139b6057adbf5e9c9b250d683db8f1e1696fe18acd011f61ff81658043201"}},{"ruleId":"D2","level":"warning","message":{"text":"View.sameValue (cognitive 63): View.sameValue has cognitive complexity 63 (threshold 15). Drivers by points: match/switch 14 (39 pts), if/else 14, boolean chains 10 (nesting depth added 25). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Shape.scala"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7bdbb87e680f4bfbbb3792c0837fe5537f95bd0e499f8628b3e578c21b9040"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementImpl.show (cognitive 63): StatementImpl.show has cognitive complexity 63 (threshold 15). Drivers by points: if/else 33 (49 pts), match/switch 8 (14 pts) (nesting depth added 22). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/TermImpl.scala"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1caf6f5638b3ff732f3cb19cb76ac177287bb61c17319f99726fdfd1af06e79"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockTransformer.applyBlock (cognitive 61): BlockTransformer.applyBlock has cognitive complexity 61 (threshold 15). Drivers by points: if/else 34 (51 pts), boolean chains 9, match/switch 1 (nesting depth added 17). 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3be16556f49542c239d28f3af2cd0f9604c6f5234f0bc72381cef989af3fa6"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.regularType (cognitive 59): NewResolver.regularType has cognitive complexity 59 (threshold 15). Drivers by points: match/switch 11 (33 pts), if/else 14 (23 pts), boolean chains 3 (nesting depth added 31). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"6316e26dec0d85d2fe91e6834207ca06df9f2cab27be5c0e1e5c341ddaeeb627"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeSimplifier.simplifyBounds (cognitive 58): TypeSimplifier.simplifyBounds has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (43 pts), match/switch 6 (9 pts), boolean chains 6 (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/TypeSimplifier.scala"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa245e5d6608c899b8d336c3379cc07198655b617dfc0c0353ae9c64ba332af"}},{"ruleId":"D2","level":"warning","message":{"text":"InvalTyper.typeAndSubstType (cognitive 57): InvalTyper.typeAndSubstType has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (34 pts), match/switch 9 (23 pts) (nesting depth added 33). 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":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cc9a3e4d659251a68b038128ee3ae7c07538d64fe14c6e4164362a1d0aa72e"}},{"ruleId":"D2","level":"warning","message":{"text":"Block.flatten (cognitive 56): Block.flatten has cognitive complexity 56 (threshold 15). Drivers by points: if/else 26 (44 pts), boolean chains 6, match/switch 3 (6 pts) (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e07fee499c5adf687fc0a059e5df5536480adf0fce3e59443ea420aa7981aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Normalization.specialize (cognitive 56): Normalization.specialize has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (36 pts), match/switch 5 (19 pts), boolean chains 1 (nesting depth added 32). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f087cbc90ecd25d39d4de556293612b42c3efc4874f944d94786ea07e3e81597"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.completePattern (cognitive 53): Compiler.completePattern has cognitive complexity 53 (threshold 15). Drivers by points: if/else 30 (46 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 18). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba018204070f6579397b645a3689d1d11419e3d761ba5cd3dbd647318fdcd21"}},{"ruleId":"D2","level":"warning","message":{"text":"InvalTyper.typeADTMatch (cognitive 52): InvalTyper.typeADTMatch has cognitive complexity 52 (threshold 15). Drivers by points: match/switch 9 (27 pts), if/else 13 (25 pts) (nesting depth added 30). 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":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c223e425cda93339c20db63cd98efa184146b25c9744fd9404b08d6e2345d4"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.typeResolution (cognitive 51): NewResolver.typeResolution has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 13 (31 pts), if/else 11 (16 pts), boolean chains 4 (nesting depth added 23). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"632fcef48108b2357648f2ca3e761c4b53ea92deff55bc02575052049adb0577"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitCompiler.makeMatchClassSplit (cognitive 50): SplitCompiler.makeMatchClassSplit has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (32 pts), match/switch 7 (14 pts), boolean chains 4 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"145fd15dcb6bf8fa063f8cd2abc9cf4d9d873cef10b11c123f9a2d067d8a4422"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.simpleExprImpl (cognitive 50): Parser.simpleExprImpl has cognitive complexity 50 (threshold 15). Drivers by points: match/switch 12 (32 pts), if/else 12 (17 pts), boolean chains 1 (nesting depth added 25). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"9562a9d698ec8e4299972e68977e45a569b17b86c667df932dc1a5b5dea5d9f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Instantiator.instantiate (cognitive 49): Instantiator.instantiate has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 13 (41 pts), if/else 3 (8 pts) (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Instantiator.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5731afb69e84be6b496cd074b35187108cf34802ed2fbb78a3b99e94b352c15d"}},{"ruleId":"D2","level":"warning","message":{"text":"Elaborator.params (cognitive 47): Elaborator.params has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 4 (10 pts), boolean chains 5 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3331}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9de18d3620f5489df08cfa68727c58b6ffc49749e20803b1b560ec52dd94bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.blockOfImpl (cognitive 47): Parser.blockOfImpl has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 11 (35 pts), if/else 7 (11 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":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"3312e0d1a909b9dee5dbd36cc68ba2415e611799e8de85e0eb08faaa97c65bd1"}},{"ruleId":"D2","level":"warning","message":{"text":"CaseOfCase.applyBlock (cognitive 46): CaseOfCase.applyBlock has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (32 pts), match/switch 3 (11 pts), boolean chains 3 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d91136e057fd8f13ca8ee4c46889f68242d49ff765e73524629983a67f2b429"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.symbolKey (cognitive 45): NewResolver.symbolKey has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 8 (13 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":4271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4067d822dfb46ead178c494b463cf4f83c0e56fac84a9bb5a29469174084b96"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.num (cognitive 45): Lexer.num has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (26 pts), match/switch 6 (13 pts), boolean chains 6 (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Lexer.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"398570ed958b5bbabf6cd99c169100c10b5bc4e147c0bfe443908dcef2e83751"}},{"ruleId":"D2","level":"warning","message":{"text":"EtaExpansionSolver.etaExpansionTargetShapes (cognitive 44): EtaExpansionSolver.etaExpansionTargetShapes has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (26 pts), match/switch 8 (16 pts), boolean chains 2 (nesting depth added 17). 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/EtaExpansion.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b177b44133dab0b0e8c987ab3301c88e50b53f7fe67dee8e70b06e9e20a1c352"}},{"ruleId":"D2","level":"warning","message":{"text":"ReportFormatter.apply (cognitive 44): ReportFormatter.apply has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (30 pts), boolean chains 8, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/utils/ReportFormatter.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bf71213ff9529efeb812df4c34d623293c4ba338916d39135ef738b01e43a4"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.constrainFunction (cognitive 43): NewResolver.constrainFunction has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 14 (28 pts), if/else 11 (15 pts) (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f977895a24af99c01820e4f576cf008247cff896d435236e299091eabc6a587"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclaredType.equivalent (cognitive 43): DeclaredType.equivalent has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 1 (7 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/TypeShape.scala"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"390006b7ceaeb22d35787c1e8e3e23445595c0ec828884c13f1463e63a1d4374"}},{"ruleId":"D2","level":"warning","message":{"text":"Match.apply (cognitive 41): Match.apply has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (28 pts), match/switch 3 (9 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d1e1eb63a2f046ad49e6e1f5650d76ea784560f209947cf6d501e84b5d1fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"Elaborator.pattern (cognitive 40): Elaborator.pattern has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 14 (26 pts), if/else 11 (14 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3404}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b590888e639d5c99b8770db2d74de0a37091750cc0007292eb8219978d8d218"}},{"ruleId":"D2","level":"warning","message":{"text":"Lifter.createMetadata (cognitive 39): Lifter.createMetadata has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 10 (13 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"280f5c10adc33cda879dfde5312926dd9ba9330635345836ef730d32b23b2fe7"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowAnalysis.typeProdImpl (cognitive 39): FlowAnalysis.typeProdImpl has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 13 (31 pts), if/else 6 (8 pts) (nesting depth added 20). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4611d02edffbc629eb1ac26eb6819e47ef604e550847511f5639a5c4b81e15"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.listenDeclaredMember (cognitive 38): NewResolver.listenDeclaredMember has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 6 (17 pts), boolean chains 2 (nesting depth added 17). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da4ffd2ff649ae25ec588777bba2e7a4146069070df0f1879eaa80904327afd"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.resolveSign (cognitive 38): Resolver.resolveSign has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (23 pts), match/switch 8 (15 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb7406627a57bcb64f02c412221a4e5bc34195c30349e498205947e6ec674ec"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.zipTupleShapes (cognitive 37): NewResolver.zipTupleShapes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (31 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"b518b9275704162bf6d44bd933606223965bbea22ab5bc8d8e30db00e759c932"}},{"ruleId":"D2","level":"warning","message":{"text":"Pattern.simplify (cognitive 37): Pattern.simplify has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 7 (15 pts), boolean chains 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Pattern.scala"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c652d98fddf6a02bb92a091f68946cd2d0ebc0facb693f2b9f19ea3fb025a207"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeResolution.validate (cognitive 36): TypeResolution.validate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 5 (15 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/TypeShape.scala"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efdad2ebfe9ba5b6c35235fd4b09b63e84f39a8c6b4a7c61e73d85649d1fa21"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.listenClass (cognitive 35): NewResolver.listenClass has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 7 (16 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":3607}}}],"partialFingerprints":{"codehealthFindingId/v1":"53546abf0bbd05b7867d40f104b3da936e37d8c57dc7365fcf392d121cd91c2e"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugPrinter.printProduct (cognitive 35): DebugPrinter.printProduct has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (29 pts), match/switch 4 (5 pts), boolean chains 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":"hkmc2/shared/src/main/scala/hkmc2/utils/utils.scala"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3bd09e36e52d9ce9834fdef7fbc3296e8f44390e24584bfeaeff7607770290"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.instantiateShape (cognitive 34): NewResolver.instantiateShape has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 2 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98c6a0bd7506e3420ab1fb00c7c6046e4cc9f5c9245b689a4247859deaa32e6"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.builtinApplication (cognitive 34): NewResolver.builtinApplication has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 7 (12 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":3275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be7cc390a6def878144bf1f4487fd11255f4c6e89ea709c32d7de1bf919164f"}},{"ruleId":"D2","level":"warning","message":{"text":"Normalization.lowerSplit (cognitive 34): Normalization.lowerSplit has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 7 (15 pts), loops 3 (10 pts), if/else 6 (8 pts), boolean chains 1 (nesting depth added 17). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5ccf67afbaa1fbfeac9af1c9b87c3102e92b6f3c9b980b7c1cf92b530932f4"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitCompiler.makeMatchSplit (cognitive 34): SplitCompiler.makeMatchSplit has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 8 (17 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cc22fd724290307023f4f5d4420acead339d4cdd6fd5bc5c55b3f287fddd02"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewriter.applyResult (cognitive 33): Rewriter.applyResult has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/FlowAnalysisBasedRewrite.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efe903732e4b5d437d85ea4e0f5117e143e7b8d66f80bf3f5f18774b25da96d"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockRewriter.applyBlock (cognitive 33): BlockRewriter.applyBlock has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 6 (11 pts), boolean chains 4 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15c2aa74f68d8587036a09f67770d21075242462e579c2eea091a9ad2ee7d76"}},{"ruleId":"D2","level":"warning","message":{"text":"Normalization.apply (cognitive 32): Normalization.apply has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 3, match/switch 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"49835d9e7c8b28b15ac93cf37c411ba0349da8535a23fd05a8afeb6dd07419da"}},{"ruleId":"D2","level":"warning","message":{"text":"FixedPointCompiler.compile (cognitive 31): FixedPointCompiler.compile has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 6 (9 pts), boolean chains 2 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/FixedPointCompiler.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7ad4c7a2cd820e96a36edc1470432fe3e5d276662f04dab35dd2411e0531a6"}},{"ruleId":"D2","level":"warning","message":{"text":"FixedPointCompiler.classify (cognitive 31): FixedPointCompiler.classify has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 10 (14 pts), boolean chains 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/FixedPointCompiler.scala"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9382bac5cdcd1b55a788ab65902a4e7e8351f56df354245a7dae0ed05477b6"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitCompiler.matchParametersWithArguments (cognitive 31): SplitCompiler.matchParametersWithArguments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (10 pts) (nesting depth added 19). 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"182071ebe1ababbea63e9f12f98238dd7253670bcbde046db7a2989c26085684"}},{"ruleId":"D2","level":"warning","message":{"text":"InvalTyper.createADTCtor (cognitive 30): InvalTyper.createADTCtor has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 7 (14 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edbc84d5df67a609e69306d83dd551e2ea0b259e11212c499111212e9eac508"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionContext.completeBlock (cognitive 30): ResolutionContext.completeBlock has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (16 pts), match/switch 7 (11 pts), boolean chains 3 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolverState.scala"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46ab617675deb67805a469b105cdd8ed564e540f9cf4eb526412209814beb82"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitCompiler.preservesOriginalScrutinee (cognitive 30): SplitCompiler.preservesOriginalScrutinee has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 4 (10 pts), boolean chains 6 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b90c658a7e4d3753a6c0ac87068a7cd1326769cfb39e8184fb1dd11773c0804"}},{"ruleId":"D2","level":"warning","message":{"text":"DeadCodeElim.applyBlock (cognitive 29): DeadCodeElim.applyBlock has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1416a5bf8b5505b74e58d33b779c019ffa0c6f327d8c2082c6ba5e88a177b913"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferableTransform.transform (cognitive 29): BufferableTransform.transform has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (24 pts), match/switch 3 (5 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BufferableTransform.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fb532358e43766a2dd861a4e8016c0aeae776d01c47928d7612a16f28bc786"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowering.classOf (cognitive 29): Lowering.classOf has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 10 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"3983145b8d63063ff61e7e4b6afee3f5c6d98910a3303689a10d845a1226065d"}},{"ruleId":"D2","level":"warning","message":{"text":"OverrideLayout.correspondingList (cognitive 29): OverrideLayout.correspondingList has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 6 (18 pts), if/else 8 (10 pts), boolean chains 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/OverrideLayout.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1093b77c97e67ad3ded75bc5acf4273e79ce21a0e92e6f18939af30c651b634"}},{"ruleId":"D2","level":"warning","message":{"text":"HandlerLowering.partitionBlock (cognitive 28): HandlerLowering.partitionBlock has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 7 (9 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"886706f817077b5585189de88ee79ec8b051523b20cdf1f6b64b212d03931a8f"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctx.lookupLabel (cognitive 28): Ctx.lookupLabel has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 5 (9 pts), boolean chains 3 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28d76000ffeb28be09e41a96761b9c3948803aa4bd39cdd88d9a5d6a22a7871"}},{"ruleId":"D2","level":"warning","message":{"text":"Elaborator.annot (cognitive 28): Elaborator.annot has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 8 (12 pts), boolean chains 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e75324de3edafdb99217a8955bd1bcebc4df951eb544a1062e0e0003125de2"}},{"ruleId":"D2","level":"warning","message":{"text":"Erasure.erasedDefinitionSignature (cognitive 26): Erasure.erasedDefinitionSignature has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Erasure.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa064d990f95d87aa943d5260814fd2d242d4b7febc2f5dcf6d936c4af0869e"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowPreAnalyzer.applyBlock (cognitive 26): FlowPreAnalyzer.applyBlock has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (14 pts), match/switch 4 (9 pts), if/else 3 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"b133475367d9d88975f484dd34ce71ef4632626a6dcffb09d52c5e3f49efb1e1"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitCompiler.makeStringPrefixMatchSplitImpl (cognitive 26): SplitCompiler.makeStringPrefixMatchSplitImpl has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 5 (7 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc53a7ec919671152ed5416910144ca4eadfbf7ebe522e50e2808459c4ee2f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowering.ref (cognitive 25): Lowering.ref has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 8 (14 pts), if/else 7 (11 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfc52d9adb1059c97fae3a7a9aab72600a17c356c5d8056445139736603362c"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowering.reportAnnotations (cognitive 25): Lowering.reportAnnotations has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 9 (16 pts), if/else 7, boolean chains 2 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bcbcad5b2391261dfa175eb010adada05a35722e9af246b7a35115bb8b4f6e"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockSimplifier.apply (cognitive 24): BlockSimplifier.apply has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b02c93a3b227561b5c45c7219a32f6dfc887dce6acf456dfa2dd811b6a3b338"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.newSel (cognitive 24): NewResolver.newSel has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 7 (15 pts), boolean chains 6, if/else 3 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":3712}}}],"partialFingerprints":{"codehealthFindingId/v1":"1277a8296fab8f286a5f04ba2fd2e20b084a477d753a60c288e25f762059f079"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.resultFlow (cognitive 24): NewResolver.resultFlow has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 5, boolean chains 3 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":4352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d719b63ff524b8b65b3419738a37a9ab0e542eeda492738bd02c55a4d09de4"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintSolver.constrainConj (cognitive 23): ConstraintSolver.constrainConj has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/ConstraintSolver.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a428fdeb344477396759743ba93122f1f342639339345ffbc0045e59b8e7db1"}},{"ruleId":"D2","level":"warning","message":{"text":"InterfaceExposure.valueIn (cognitive 23): InterfaceExposure.valueIn has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 9 (19 pts), if/else 4 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/InterfaceExposure.scala"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81f52a57571a943781f6849902aa30c1923a8838d4af6e7fb682bc38e47dfd8"}},{"ruleId":"D2","level":"warning","message":{"text":"Normalization.normalizeImpl (cognitive 23): Normalization.normalizeImpl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"569bae1c8859b00e27ce21cfd0d64c3f6d53f69e1cef51dacdedc5bb8a006b52"}},{"ruleId":"D2","level":"warning","message":{"text":"UsedVarAnalyzer.blkAccessesShallow (cognitive 22): UsedVarAnalyzer.blkAccessesShallow has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (15 pts), if/else 6, boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/UsedVarAnalyzer.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b670d9f081ed386fcc29a7691c70dac019a06f65cf32583848d22842c7693c1"}},{"ruleId":"D2","level":"warning","message":{"text":"InvalTyper.typeSplit (cognitive 22): InvalTyper.typeSplit has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (19 pts), if/else 3 (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":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf536a697fec16ebc58cb633bdd66920a45ec0e86b5c4b832029db8a878b9dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Elaborator.param (cognitive 22): Elaborator.param has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac0f7e4c66be65b7ee0711749676392ad4c631ca31e298a69157b5212216e7d"}},{"ruleId":"D2","level":"warning","message":{"text":"Importer.importPath (cognitive 22): Importer.importPath has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Importer.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc2b442818e4d558c66753ae535b1c91815f986bdbea394f03c540506942916"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.declaredType (cognitive 22): NewResolver.declaredType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 4 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc80846321a9cf5071f89ac59dda41fb8754ea39cffd563c6b03a2a753da6113"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.registerParameterSignature (cognitive 22): NewResolver.registerParameterSignature has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b25106d91ac49f44723856e45cc1d460a231719d203272adbde3fe76bdc8553"}},{"ruleId":"D2","level":"warning","message":{"text":"Transformer.inlineCall (cognitive 21): Transformer.inlineCall has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"c054b866fcf4918202c10ccfd4de0ba3fcfb7f62156d048a9024614a5d9a7145"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassParamFlattener.applyResult (cognitive 21): ClassParamFlattener.applyResult has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ClassParamFlattener.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe1eb400fdc6fafc1ce4c1a50f5713b9c634017aff87dd4d988e19b8a8a661e"}},{"ruleId":"D2","level":"warning","message":{"text":"InvalTyper.typeAllSplits (cognitive 21): InvalTyper.typeAllSplits has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdf82a59869329cc0de9ef5e41a2c4fd3fc7f2f75a53214910c90ab2ce63109"}},{"ruleId":"D2","level":"warning","message":{"text":"prettyPrint.showSplit (cognitive 20): prettyPrint.showSplit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 6 (9 pts), boolean chains 1 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Split.scala"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7befac4feef3d2731ae1ffcd12cfaf1af0a2a613e62a3fa4d24d51109b7ec20"}},{"ruleId":"D2","level":"warning","message":{"text":"SccAnalysis.run (cognitive 20): SccAnalysis.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/utils/SccAnalysis.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6376b547dd85cb2b73aaba9ada2b5cb5607386865ae03bec0ea0708006618d3"}},{"ruleId":"D2","level":"warning","message":{"text":"HandlerLowering.computeRestoreList (cognitive 19): HandlerLowering.computeRestoreList has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (6 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce7c0fe5ad54dda3d16f0b83aaa446984777b6652cc1602190caab68b4d29c8"}},{"ruleId":"D2","level":"warning","message":{"text":"TailRecOpt.transform (cognitive 19): TailRecOpt.transform has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 5 (8 pts), boolean chains 2 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/TailRecOpt.scala"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ba9d8dddefd0b1e1caf322da0c42b6b5ba4a8868f7272b82be192829a755a9"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessPath.findAccessPath (cognitive 19): AccessPath.findAccessPath has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 6 (7 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/AccessPath.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c3c8153500e733990b65961ec710068a0c861ee32ee25db171f92364467100"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.zipDeclaredParameters (cognitive 19): NewResolver.zipDeclaredParameters has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":2301}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c8511f48af0eb297c923f214bc9d095a50cb246420923205ed9aaf7039914c"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.resolveSymbol (cognitive 19): Resolver.resolveSymbol has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 3 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"5679aeaccd0acbef9888c3d2d78983d62ebeae49038ef4cffd5a27c0dea44c54"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.resolveType (cognitive 19): Resolver.resolveType has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (14 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9821047ff58617fbb97488347ae5938163d37fe653e2855b43d1f8166418348"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.traverseSign (cognitive 19): Resolver.traverseSign has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 5 (7 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"3135928f8f7de067461b9cacf437b6a85be067dc4619ebaaa2477e431e1acdaf"}},{"ruleId":"D2","level":"warning","message":{"text":"Helpers.matchArgs (cognitive 18): Helpers.matchArgs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc279b75abe2b01e2f0808fcfa6021fe6a2d965fc636abd65f1a459488bcab65"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockTransformer.applyResult (cognitive 18): BlockTransformer.applyResult has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"896e10a600e2e0c6ecd38e3311803e978060e8497392f0d62db9e23297239acf"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowering.newSelection (cognitive 18): Lowering.newSelection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e90c896a87898e9ef6a212796c34ea8eff3a84afda584f90235f5b6b44d80ab"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.constrainTuple (cognitive 18): NewResolver.constrainTuple has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (8 pts), boolean chains 2 (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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7eb4d61bd683831da3704fb2f94cc60a4803b26c3d74a723168fa8f3897cd89"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.annotationSymbol (cognitive 18): NewResolver.annotationSymbol has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":4232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeded661359ecfcadc1b2fc6d8ea815b6effb15ac3106700326880f844aa475"}},{"ruleId":"D2","level":"warning","message":{"text":"FixedPointCompiler.compileMachine (cognitive 18): FixedPointCompiler.compileMachine has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 7 (8 pts) (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/FixedPointCompiler.scala"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"2046dd86bb6203c07b6742a67909975344c70df720b952bc7e078e9f1cfc1b38"}},{"ruleId":"D2","level":"warning","message":{"text":"FixedPointCompiler.assemble (cognitive 18): FixedPointCompiler.assemble has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, match/switch 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/FixedPointCompiler.scala"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d13a676fe20edecf88f80a838177465ac2b769b2675b5cccdbd7d441da1620"}},{"ruleId":"D2","level":"warning","message":{"text":"Scope.allocateName (cognitive 18): Scope.allocateName has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/utils/Scope.scala"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe001b57395ba69c0ab69ac09e96c6d32bb078f4e6f16bca50c5960f0db7e60"}},{"ruleId":"D2","level":"warning","message":{"text":"doc.apply (cognitive 18): doc.apply has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8 (14 pts), if/else 3, boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/utils/document/DocumentContext.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d5aba3165efc8f9ada6a5284690efc3cac0f2749739812f6c84f05a96f5352"}},{"ruleId":"D2","level":"warning","message":{"text":"VirtualPath.normalize (cognitive 17): VirtualPath.normalize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/js/src/main/scala/hkmc2/io/VirtualPath.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3425a53d2837b757f8e0c00abd9352d822413d0fb6c4481b3f4a91ec74390d71"}},{"ruleId":"D2","level":"warning","message":{"text":"FirstClassFunctionTransformer.applyResult (cognitive 17): FirstClassFunctionTransformer.applyResult has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/FirstClassFunctionTransformer.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d287966f58711f113e74ec09e156345935afcbaf7ccb5d3664ff8f4aab6fe79"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowering.lowerMultiInstantiate (cognitive 17): Lowering.lowerMultiInstantiate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (8 pts) (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"287ab3d4626e379596c1485670dc45f5308442ec774b19a1da24311374f7f4a0"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberStorage.privateOwner (cognitive 17): MemberStorage.privateOwner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/MemberStorage.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e917f6d7c62ae50724542e480132191c61d204cda1a56f6661d7e8abeee9193"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer.print (cognitive 17): Printer.print has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Printer.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"173ec4e85606a5d3623865ad6663bb5a67d3358133909621dad8c3b88a69822d"}},{"ruleId":"D2","level":"warning","message":{"text":"ReflectionInstrumenter.transformResult (cognitive 17): ReflectionInstrumenter.transformResult has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 3 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0e1f00f7c1984df3017298b5f27aae93f5503cb77e215867652e415e3788d2"}},{"ruleId":"D2","level":"warning","message":{"text":"FixedPointCompiler.recognizeCycle (cognitive 17): FixedPointCompiler.recognizeCycle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/FixedPointCompiler.scala"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb738f04d627a6cba50d80276648fd6345cc610ceaf10dbf9832d72e3e321503"}},{"ruleId":"D2","level":"warning","message":{"text":"FastParseHelpers.mkLineNumberLookup (cognitive 17): FastParseHelpers.mkLineNumberLookup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/utils/FastParseHelpers.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"180d070120852a8eb20a1e42f45f786fbd47947fe9770e4ca01dfad246ad457e"}},{"ruleId":"D2","level":"warning","message":{"text":"Version.parse (cognitive 16): Version.parse has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (6 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/Config.scala"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c00cdf9a162e76a2f296bbf752340496b992514a00de5f62e593b14bd417a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFlowAnalysis.apply (cognitive 16): DataFlowAnalysis.apply has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 4 (5 pts), boolean chains 2 (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":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e53bf881d2f06385e6558f941267b1933d7327fb55244faf8df3a9d6b03244"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockTransformer.applyPath (cognitive 16): BlockTransformer.applyPath has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2929030e046962aed7df5d3662c80e6ef652449b0265c74a7dae82dcea2fa6"}},{"ruleId":"D2","level":"warning","message":{"text":"ErasedType.needsCast (cognitive 16): ErasedType.needsCast has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (7 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ErasedType.scala"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b477aa1b53e0073aa65523441e3313008d7a117df1b3591fc75a2ce31e59c5f"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopeRewriter.applyBlock (cognitive 16): ScopeRewriter.applyBlock has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 5 (6 pts), boolean chains 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"674f6d728f34b63d1cafda4db57c039a93f10842311aa30b8ce989ba5ea4aa18"}},{"ruleId":"D2","level":"warning","message":{"text":"Lowering.quote (cognitive 16): Lowering.quote has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 5 (6 pts) (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"1628dda6d16a3289ef3d2ae63a6ddd95ae8665c61297dd36efe0abc868b50897"}},{"ruleId":"D2","level":"warning","message":{"text":"CallFinder.applyBlock (cognitive 16): CallFinder.applyBlock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/TailRecOpt.scala"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d145a4b6e09f3017407ed7fec2232fe3461992fb43b23d7ca5f6d3518f4c1a0"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewriter.applyResult (cognitive 16): Rewriter.applyResult has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6 (7 pts) (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/deforest/Rewrite.scala"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d616cc549e0bbfff5d67d4eceb444ccb338762eb776ec83f733897bd7bb3fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"NewResolver.checkArgumentArity (cognitive 16): NewResolver.checkArgumentArity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":2824}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab517c9241c14faf0154df84f88f3fee4e6a480eedbe620a2d5fe6c3ef1236d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantics/NewResolver.scala: FileTooLong \u2014 3492 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2992 over it, 6.98\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b3b9e63f2c93b91b877921ec6ade6ddd90f3919182d8327434226ae90e54e7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NewResolver: TooManyMethods \u2014 207 methods. The bar is 30 methods; this is 177 over it, 6.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":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"555450f05fda96d8be69cabbc2518ec9f853e75187bce957c4a7e3fb659b87b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantics/Elaborator.scala: FileTooLong \u2014 2887 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2387 over it, 5.77\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b2b61c971d5383c3e08e2f45c81b16a91014b4e179fb96ef5ee2c98431a260"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Elaborator: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae256ecb211e7c3317b6d58dd5ef21ae8372df6d2effc0c0ccbb8a6ac0958962"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ups/SplitCompiler.scala: FileTooLong \u2014 1032 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 532 over it, 2.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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1f62e0c5410afeba9fb781c08c406f8994b2416cda915896c894c62c3ff766"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/Parser.scala: FileTooLong \u2014 1000 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 500 over it, 2.00\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":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0a81b4f771df2d981e612f4ed373eec53dee94fcb4fdcfda7b63aec2155a33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantics/Term.scala: FileTooLong \u2014 887 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 387 over it, 1.77\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60d5d10f32aa2539404ec5ca754d75614af017ba2d69d04df48f8bb8a793cf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantics/Shape.scala: FileTooLong \u2014 886 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 386 over it, 1.77\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Shape.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d842862f63093f479fb14b2ddf2ea427175cd11838009d1dc5be08077471ff6e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ResolutionContext: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolverState.scala"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78bbe4f773150a8f388f60a2a9bef53a998d0bfe5677860a001eb1d4229a7fe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"760f57b1725d5632fe1623ece7f36534d16d1564b44afc539a47c7a5f7c50ab5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantics/Resolver.scala: FileTooLong \u2014 798 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 298 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c150bfcfb95efb28e25b45893e7efa2beb45cb92c2aa69143c09327f0dd4c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: invalml/InvalML.scala: FileTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 246 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0762b6a668a13e674e9a67ae00c273b0ac3421a5dae7e71956223cab4fbf347a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Cloner: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Cloner.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be49015b9871cb98fc130a1180000ca869dda7f02b46c35d13b01b761e7efd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hkmc2/Config.scala: FileTooLong \u2014 689 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 189 over it, 1.38\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":"hkmc2/shared/src/main/scala/hkmc2/Config.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"652f39c9c543d7ab7301f8a76bac42d8162eec0746af294105a09200582e2468"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/Tree.scala: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 107 over it, 1.21\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":"hkmc2/shared/src/main/scala/hkmc2/syntax/Tree.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5c8332a8ca7beedf1bdc028228e0b73ffe90e9b65bcaab3aa9a75ab2036159"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TermSynthesizer: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/TermSynthesizer.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"63106a65d3d464e6f79d678e9acc98a361d1df1a5db79a39b1643641737ce771"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantics/NewResolverState.scala: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: constructorApplications (116-784). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolverState.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7cd43698c5bbec701d92046a9e6c08fbe88f436601f3325c2cdff4d7312369"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConfigParser: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/Config.scala"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9e232589d990a219def22301adf2a919bac854677b22ca2cd54b9f552ebb40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ups/FixedPointCompiler.scala: FileTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 65 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/FixedPointCompiler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c2bbbf70a9616fe158bbaba095b1795e1fb984509aff3855a014ac01d98433"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: State: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc118a89e7be3b34e8a06b4e8fdb1e6b0f61fa92dbf682e9ca9a4de2a0006c73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantics/Cloner.scala: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Cloner.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe12186188ecd0d13e22d6a25903f3eec8af07be9576accd69d668807bc94fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantics/TermImpl.scala: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 17 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/TermImpl.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d385c7c8e6cac69615ca1973b451c1820ad93f3999a70d4c3cc3edb228ccbbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201320 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:313-326 | hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:389-408 \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 \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:313\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a11b8c2e7b1dbaf07b467f11071bfa67d3fc45c975082120864e14f762bc27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala:411-426 | hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala:432-443 \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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e4c2d8fdfb22b35f0980b90ec2c319697fe10604178643209bd902826b5250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/typing/Type.scala:48-61 | hkmc2/shared/src/main/scala/hkmc2/typing/Type.scala:71-84 \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 \u0060hkmc2/shared/src/main/scala/hkmc2/typing/Type.scala:48\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":"hkmc2/shared/src/main/scala/hkmc2/typing/Type.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4506b5bbbd10054efda3e8a594493039e07fc00e72707fcb7b95ba21c2291ada"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/codegen/UsedVarAnalyzer.scala:395-405 | hkmc2/shared/src/main/scala/hkmc2/codegen/UsedVarAnalyzer.scala:428-438 \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":"hkmc2/shared/src/main/scala/hkmc2/codegen/UsedVarAnalyzer.scala"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62624bcc39aa4a9dd5932a40f43c73d596d6241d13b7d19f8e6278db4252d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:298-307 | hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:372-381 \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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ce1b3a1d196d237d9d83e0f18d96590203bc8a8650dd86759bb12c12f7aa18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:337-343 | hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:410-418 \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 \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:337\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, \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:419\u0060 calls \u0060RcdField\u0060, \u0060str\u0060 and \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:344\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbd99603ba2df262a7d534855c083b27774b1655715eefa55447bccc25d279a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:352-360 | hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:426-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 \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:352\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc697be449be5ff99e216222c81a2c01074600dd3e82abaf18de50e7e36f683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:362-370 | hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:436-444 \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 \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala:362\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e861a701d20295beb7f2d27a9204d80147e14af984e1374b8a3b42c9eba21d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala:861-869 | hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala:1155-1162 \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 \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala:861\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"824cb15a4942646bd91d26e3b5f457cf3ad0818e3f4d9a89041192505af56443"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Instantiator.scala:167-174 | hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala:861-868 | hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala:1155-1162 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Instantiator.scala:167\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Instantiator.scala"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"826801fc5a7eb18fb515867a36219586c6c8720856cc01cf76d0bcb3acb559a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala:283-290 | hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala:298-305 \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":"hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4af1ad9d508bb8c7e8f8f1e73b4a872fb93f31c4ca71877516d92871d77d7fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala:995-1002 | hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala:1322-1329 \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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec1f849728c86b97c244e4911f7f98678a066a17349386fc0cf5df34d2a31d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala:828-839 | hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala:1116-1122 \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 \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala:828\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"7628ef10a4968d73902134022553ee0c3fbb2dc4908b9e8ca90da45add89dff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/codegen/ScopeData.scala:39-44 | hkmc2/shared/src/main/scala/hkmc2/codegen/ScopeData.scala:448-453 \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":"hkmc2/shared/src/main/scala/hkmc2/codegen/ScopeData.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ce74bf2d6287e899a30dcc2d37e35a658a4eb86021f00746446ac31ecf7fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/invalml/types.scala:173-178 | hkmc2/shared/src/main/scala/hkmc2/invalml/types.scala:186-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hkmc2/shared/src/main/scala/hkmc2/invalml/types.scala:173\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":"hkmc2/shared/src/main/scala/hkmc2/invalml/types.scala"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9932e43c2227b9a9409ea1f63ab8490c4f2128dea2adc8ca8e3992cb8d441e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala:273-281 | hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala:290-295 \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 \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala:288\u0060 calls \u0060log\u0060, \u0060rec\u0060 and \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala:272\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc802e31cbb0a7b36b916956ccb673b6b5c924877ca4c577e0cd131f62a85be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala:668-673 | hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala:681-686 \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 \u0060hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala:668\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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdadb5a83bfe4a806ae1a23e8cedf2775eb13b811fdaa03460e455c48db8d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/codegen/deforest/Rewrite.scala:353-357 | hkmc2/shared/src/main/scala/hkmc2/codegen/deforest/Rewrite.scala:404-408 \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":"hkmc2/shared/src/main/scala/hkmc2/codegen/deforest/Rewrite.scala"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d537118a14325fc637de3c9bf61ea9bbf34790e44c818ece941fee87a648d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala:262-266 | hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala:705-709 \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 \u0060hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala:262\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":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40e5493328c62ed2386ae5137d335b98ce8f161c69feb63573782de8beac1ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hkmc2/shared/src/main/scala/hkmc2/codegen/FlowAnalysisBasedRewrite.scala:148-152 | hkmc2/shared/src/main/scala/hkmc2/codegen/deforest/Rewrite.scala:414-418 \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 \u0060hkmc2/shared/src/main/scala/hkmc2/codegen/FlowAnalysisBasedRewrite.scala:148\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, \u0060hkmc2/shared/src/main/scala/hkmc2/codegen/FlowAnalysisBasedRewrite.scala:146\u0060 calls \u0060SimpleRef\u0060, \u0060activeEliminatedParams\u0060, \u0060k\u0060 and \u0060hkmc2/shared/src/main/scala/hkmc2/codegen/deforest/Rewrite.scala:413\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":"hkmc2/shared/src/main/scala/hkmc2/codegen/FlowAnalysisBasedRewrite.scala"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"67eb693b8dc7bfb370a816ee99478d4c04a0367d8687e7cd929bd50875799d80"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VirtualPath (LCOM4 4): VirtualPath\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":"hkmc2/js/src/main/scala/hkmc2/io/VirtualPath.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6385ad9fd16169c5e8dd2191e0fcf2f4fd473f23b3c6c9025a5ded58d82115f2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ParseRules (LCOM4 4): ParseRules\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":"hkmc2/shared/src/main/scala/hkmc2/syntax/ParseRule.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a8a8dda95a8904f4cd8c1128dbf32e8255c677fa7b1b58b60784c48bfb511d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala changed 134 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 209 in Elaborator.subterm at line 1534. 9 of those changes were fix/bug commits, and the other 125 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dcd2a67b636003bcfb15592fb269d720c232e500f6b34fbb599ecb5e4ba95c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala changed 176 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in NewResolver.listen at line 4496. 16 of those changes were fix/bug commits, and the other 160 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":4496}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ce246382e42689bae93c2d1bba1dc025e9067484bd9dc09a83c63fc2bb2cad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala changed 98 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 149 in Lowering.term at line 1056. 6 of those changes were fix/bug commits, and the other 92 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"42183cd1864272c3eb2a37e761c873b5a531886ecb429032bddcb33c4ff2c984"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 118 in JSBuilder.returningTerm at line 509. 3 of those changes were fix/bug commits, and the other 42 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"0414d56955062d3fcd9296ef115981cb8f3c6a402e98f462744764a59bd02e82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in DataFlowAnalysis.applyBlock at line 864. 5 of those changes were fix/bug commits, and the other 35 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf40e527143c6a7abac304b8254aa4595124e3f97bf1eebd7bc0842e8bab803"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/Shape.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/Shape.scala changed 84 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in View.sameValue at line 127. 6 of those changes were fix/bug commits, and the other 78 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/Shape.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Shape.scala"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a252a2a3dff6e8f2dfbb6d9d0704e592d21bcf8de3ff2b5aef38ef33165090df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/WatBuilder.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/WatBuilder.scala changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in WatBuilder.result at line 1827. 2 of those changes were fix/bug commits, and the other 24 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/WatBuilder.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/WatBuilder.scala"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"71220675ac1d3e61d5c2204e4a672d0e6c2a2802e9e723dcc3ceb6cc2d66deb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolverState.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolverState.scala changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in ResolutionContext.checkAccess at line 550. 7 of those changes were fix/bug commits, and the other 51 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolverState.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolverState.scala"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"9320d08551f6036697339f9a3a3ad364506e6093665f15379c56954db1b61339"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala changed 81 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Annot.show at line 73. 6 of those changes were fix/bug commits, and the other 75 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4878e71dc902b4223e321da69b38959ca225e10821c3d5d59f07821f934ab8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/TermImpl.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/TermImpl.scala changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in StatementImpl.show at line 290. 1 of those changes was a fix/bug commit, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/TermImpl.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/TermImpl.scala"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"83904a66a8f8dd7eecf917f71de2d4e3d9575c34933c8eedcdfe1be9abffc9f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/TailRecOpt.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/TailRecOpt.scala changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in TailRecOpt.optScc at line 330. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/TailRecOpt.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/TailRecOpt.scala"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78fa8634799a04249e8685935cb5ef00646bdfc924ac766e68daa64ddfb1f10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in Block.flatten at line 277. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffa3e058bbdee9832c512a0c9babee507f2bf6b40623f1ccc5291a14e72ea7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/syntax/Tree.scala: hkmc2/shared/src/main/scala/hkmc2/syntax/Tree.scala changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in Tree.describe at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/syntax/Tree.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Tree.scala"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"363c21805e23837bb8372aecd6d14c0211cefb5e701f0122a35b8365ec6a3cf5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala: hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in Parser.exprContImpl at line 1019. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c14b187cab269e40d49c4eccddb4a0c887894f0daaeab95f1ded914b0eb4e8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala: hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in InvalTyper.typeCheck at line 648. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ed792033cb3b0ee20e5d9b3d7c5b63b1e00c9089eec73d3e72285bc9238138"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/TypeShape.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/TypeShape.scala changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in TypeResolution.validate at line 192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/TypeShape.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/TypeShape.scala"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fdb24ebbae71a225084fafa142af2cf1b1b5ed9591f6e671fabed0e075d402"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in SplitCompiler.makeMatchSplit at line 664. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fbd7e36eeffab2a3bd0eb4fde21e7a73e64c01a9e2b1f44194b6bad5ad323e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in BlockRewriter.rewriteDefnRefs at line 344. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9c848e1eac14d5118c7a5f478a4b64db79441e1bc2576e5a765b9345cba6ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/InterfaceExposure.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/InterfaceExposure.scala changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in InterfaceExposure.valueIn at line 142. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/InterfaceExposure.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/InterfaceExposure.scala"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0dfb6bc184f4c7ce5ac1ed3b0b63b3612c0f7a760d23bd9df61440e9c593d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in HandlerLowering.translateBlock at line 550. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"7739bbb23121ee26ad3418840c71bacfd2116cb9f62eefc75017edeae1585b45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in Resolver.resolve at line 525. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d782d3f8fd278439c6d46c20d6b7515b99ff543f652fbab575da5db652aec1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in BlockTransformer.applyBlock at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"671236566f1ceb9162792503dddba66d7fd104d976c090ef446c03cb9ce64989"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in FlowPreAnalyzer.applyBlock at line 522. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"e743ffb0255d64b2962db9bd3a08c003a67452aeb29387b81c768c98159afd12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Normalization.lowerSplit at line 320. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"462f267d05d20a0deae6bb508865b9031cd2e390b85a80257904c9105fa7e450"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/Printer.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/Printer.scala changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Printer.print at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/Printer.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Printer.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3212824cbbbb3f17417725b8d05d1f9422f9ab2f03ddf8054df3c23924ea54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Compiler.completePattern at line 290. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6048849487b98fe2f5ea8bdb5a99a158557786b10d424fafbeec00819e92262"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in FlowAnalysis.typeProdImpl at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c296edd99d8cc57ce93e104df4d1bd83027ad5f058f1a72961cbcdf8b6bee7dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/Erasure.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/Erasure.scala changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Erasure.erasedDefinitionSignature at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/Erasure.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Erasure.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce141af833ac85062cf13fee60f53f3641f91e0abb16dbf83c1e213bdc67769"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/Config.scala: hkmc2/shared/src/main/scala/hkmc2/Config.scala changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ConfigParser.parseField at line 803. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/Config.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/Config.scala"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd56b72694e598a9bbec0194028ba9a9ce0cddd4989d306480ecd37c64ff9ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/FlowAnalysisBasedRewrite.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/FlowAnalysisBasedRewrite.scala changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Rewriter.applyResult at line 176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/FlowAnalysisBasedRewrite.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/FlowAnalysisBasedRewrite.scala"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcbd1757c393403874207548246d9e8876440fa8821b348b846a76fb5652421"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/EtaExpansion.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/EtaExpansion.scala changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in EtaExpansionSolver.etaExpansionTargetShapes at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/EtaExpansion.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/EtaExpansion.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf863c31d5374f105f117400f51fc63436e76276db863cc13e8bc477cb4af7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/syntax/Lexer.scala: hkmc2/shared/src/main/scala/hkmc2/syntax/Lexer.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in Lexer.lex at line 273. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/syntax/Lexer.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Lexer.scala"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e370dec2c1cc93567520cd2a9baeb181c74b6d8fab68d19f0d11e0981ba29c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/ErasedType.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/ErasedType.scala changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in ErasedType.needsCast at line 319. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/ErasedType.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ErasedType.scala"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05c72d2cf144769f1c831bd0b9fd71de93f2c6baecce593693a535c81b0b75d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Instantiator.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Instantiator.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in Instantiator.instantiate at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Instantiator.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Instantiator.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e941f5e401ddc837959ebe40621c47f9b4f1e8f62864e961ff703151021f1190"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in ReflectionInstrumenter.transformResult at line 206. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"165487f9254202e2420143ec0238a484598909f3f317feee55bf3c9abb54233d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTraverser.scala: hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTraverser.scala changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in BlockTraverser.applyBlock at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTraverser.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTraverser.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c544f67c813bed93e26f9f35040076399ec4ebc9131156ec98a2db9fb388a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/utils/utils.scala: hkmc2/shared/src/main/scala/hkmc2/utils/utils.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in DebugPrinter.printProduct at line 108. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/utils/utils.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/utils/utils.scala"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e43975a221cb64ea231336e7eeaa3af15834f70f10984fadb310181c504af1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Pattern.scala: hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Pattern.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Pattern.simplify at line 246. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Pattern.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Pattern.scala"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32915a6ea176b02dc94ce669c5debbac10d826962ea919b24b728712cadde79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hkmc2/shared/src/main/scala/hkmc2/utils/ReportFormatter.scala: hkmc2/shared/src/main/scala/hkmc2/utils/ReportFormatter.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ReportFormatter.apply at line 51. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 23:25:40 \u002B08:00\u0027 --until=\u00272026-11-06 23:25:40 \u002B08:00\u0027 --full-history --no-merges -- hkmc2/shared/src/main/scala/hkmc2/utils/ReportFormatter.scala\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/utils/ReportFormatter.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6265cb0100ad82d23e81876ea48184d6b472782700284b522e40fee7158c4a9"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 2 significant file(s) lose their only recent owner: hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolverState.scala, hkmc2/shared/src/main/scala/hkmc2/semantics/TypeShape.scala. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4a7700e50813c69b34fb8eed119d32f08eca2b2a867259d0a0e382838bb5a50d"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (4 single-owned of 107 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; 107 of the 148 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: hkmc2/shared/src/main/scala/hkmc2/utils/document/Document.scala, hkmc2/shared/src/main/scala/hkmc2/typing/Type.scala."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Preserve object identity in Lifter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2DiffTests/src/test/scala/hkmc2/JSBackendDiffMaker.scala"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bc755d3b71bb35e4add0ee63b92b1b7302c646acaf15a9d4d5697db992b2ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // should always ends with \u0022undefined\u0022 (TODO: check) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2DiffTests/src/test/scala/hkmc2/JSBackendDiffMaker.scala"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9407457c707acbb0a0fa507be333c863ee4fb573fabd5dcf3586e0e48591a39f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO also use hash comparison to avoid needless re-parses? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/CompilerCtx.scala"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"96019644df6443179fec85e3e3ddf62b985e19d1939393fdcd3ce323a5b93ff2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make the default S \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/Config.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00c5493ecea56dccf2b1f6bf0b0dcb148b99585277f3973c61fccad76b13fd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/Config.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5787e98edad595aee9ff1e514d17a5f4967cb1d10c53744bbc3144265f0f405"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/Config.scala"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b35b84499509ec637ab56447aa42ead33141e8a057d9bae161280e2de00b98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99d12fb36c54be26c32d92e80dae9723bb90206a6339f9daa629d01bb7d26ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Tree.scala"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d875c8227c30cf40954f6ca070a1ce53d2a14f64204d6b29d100c5442fafb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b01c73d46cb451f94076a47ec88910f4775ca588e1249b923ceb52a7462ab5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd10bda526b914f1bc2bc73bc21dd014fbeb01237226eb58e900ce6db6c5df8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"003ed99f7e986b5332b10b41bce0b7e6bd9c798c0f2dde8ae431b3ed778c7576"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4183b4bd57bb7faf5ec63c9284c7ad84cfd77e2837b64f51d9824d554ef4123"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO improve \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/typing/Type.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"79898017a6dfb5189b5b26b26f4067da41e745fbac8106717190788dd4d660bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO improve \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/typing/Type.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09aac3f33c4e8d4c0719f40ce10aa6060f28eb8a5018dec76031849764928ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove (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":"hkmc2/shared/src/main/scala/hkmc2/syntax/Lexer.scala"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bebb70c4ee012bcb302e74b5ac23322d8813dfc53b08ca67fd9d5d697d7dca9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // * TODO: add lookahead to Expr as a PartialFunction[Ls[Token], Bool] \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/ParseRule.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53f652863848a4095e443f6afaff5e296e0586c3df202ca7cf6f0ae750b173e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can it be something else? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/ParseRule.scala"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dad574278a72f9d5a5603040288d21629c9bd7a679eeb9cdd60b95da344dbfd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME throw error if empty? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"56925eacb2dfa9d0558ca3e3a7a2bfd84756d76099768794cfbc5de3ff20caaa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME allowNewlines? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"3067de04b7b425b47a115554fd1dcede00ca1bf47ce72d5bd58012b21d5393a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dedup this common-looking logic: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"c205d9213b78e5eadd2bc66d9f338a09c098230d1eedaa2971643581e316b6d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dedup? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fe4e9f208ad23a82e53092e03057b8f5270ee378e6e71122051fc3bccf36dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   // TODO dedup with \u0022nil\u0022 case below? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bef4800bd3130e710e9a242bbd65d98cfb0ad2a2c9d556c6fb88a0c7f517ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cur) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"96402d5c873837b1742b6860f1681d6795027ee8a53a7804071ab27edddc17b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO refactor? This is only used for quotes, which should parse like normal code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"25eb72b3d0f1193e230539751dd19b3a793b4f3cc486bbb4149ceaa1e1894e1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: | ... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f730f258b2cca97ae11936e9ffddda3e0701278ca67f59bdb933d4cfcc44889"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use a new tree ctor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"df369e5a1800a7945a15bf4ebc0c387125a9807b6ba75b21124851feaa092a3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0da54d140b5fb3e3e4bdbde0961f750c5b8680150599680b37abdbfd724e2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8655f953e4535709ffb3123f7f09228a153efd2a7e76b247b40cfef4eb5278ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2667}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1f027f92c38e15c2f4403b6406708f4db719a41ab0916f408daf069a6f1f70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7be845d06a544e7e5d7e87d02167aa554b64e972e16500c94e1ec9ed16cd90b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dedup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10da48ad9372af209e7e1df075ece3ba507caf0019b5fdf98e157ae064306b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO indented op block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce66c95fa1acb67765ce13b3dda748863d79f444371f483bdc089074b872add"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [CY] looks fishy. a better way? [LP] indeed; ref should be a prefix keyword! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7156d2cd69ba44b17eaa807979cf500e21341196f2de6214650310d3d3650b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO also allow uses of SELECT \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9c1b6c299cfa60f6648cac92eefc90a9e10d555b1533509879bbce453784e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME prec?? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ec3ec889a8def88b85c7b95cb6d1ebe94227404abff442002d9b9a9c7c4e2a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO other alts...? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Parser.scala"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3d6d7d88d1929b9995bc6e1fc0190bb16d0425803ce1def59b84556bc67ef9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO rm \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Token.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f052ababef2d7d85d9e2ad4464bfbb1a461676bcd5821c41c2c1d7d9ca24c870"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO rm \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53a1f518534f786bcf251737624a43934d336fdc00f46930f166086f84b8256"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dedup logic with \u0060JSBuilder.makeStringLiteral\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Tree.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fe7aa82dc254d5535e694831ca26ea124f1c848c39407523f9b4494734e609"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO change the places where this is used \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Tree.scala"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eda157cafb1d9b5ebcb90ac529efa383d1f8667d79991cbe13920ffcfb3d8dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO change the places where this is used \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Tree.scala"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baf14bc8fab46fd55404dbc85fafa793199fcfc384205be63ced47e420e8e73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO generalize to pattern-let and rm this special case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Tree.scala"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"17302d379d52172234e3576e58b5b4a27e0c88926c8c36adc06d2b72eec9627c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO only do this if the lhs is non-expansive/a valid assignment receiver? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Tree.scala"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddc7aeee8183e4e387cb7a72e115d5f1b05f0093d074ce09e70e9d4aaf988b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME! This is an extremely hacky way of naming implicit instances \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/syntax/Tree.scala"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd8b2f18ecd759cfd35ee3a90361e55426881bd82a42708f8553b1deebc6b93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: No raise contextual variable. Only \u0060Error\u0060 nodes are returned if there is an error. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/BlockImpl.scala"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d950333556be8496c3f0d23f441c795c4c19b670670ef22db7cacfb4875caf6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rename to ScopeKind? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8a60797fae0b1cc9454f8e3de81bf626dc614bb53a7cd5b1d778ea2cd9ca40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO later: use TempSymbol instead of VarSymbol? (currently, trying that creates lot of problems) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cf5def8f4f54c71b0544881befac3b64bf2dadd509950b9690d02d670562ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove in favor of new resolution logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"8549615e3512cab1f58eb38c9c94c22181bbbf9ee7233aa864439258656b2261"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is currently copy-pasted from the \u0060and\u0060 case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe788e1b3677e14b95382815939d23bf42eb440276543cea4257bdc3613d8b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO vce \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"6548f598ef2494e2e52c47aff57c1d4b5377c87805a422229562ef13a69041b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"5385b844e1f2178d2b665106b8f27636992eab7a8b820dfe9b75081cc7cc3bb0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fb9cfe4963569931d96fc899d032cda6cc9d188547c11b717f90e4a8419362"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle Under \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"04252b8b225ded085b4ff331cc05bbd2270ec85fac47d861e45cc4cf0e0f49e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO integrate context inherited from cls \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e3e72b7403f3fd2a8b3c5064db8c039e24f8a253efd8d184a99df3d6595e36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make context with var symbols for class parameters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"84391fb2d794c5a4200c02b91741f91982c28455d6d8a3d51278045164ede956"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // * FIXME this \u0060f.name.head.isLetter\u0060 test is a big hack... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d07accef954394899123946338a5fc3e22e7ad34546369cfa4acb5b7295e2e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // * TODO would be better to keep the fixity of applications part of the Tree repr. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f918f1b923a5e250b143329dbeabd72bb4009842a6f58010bf35b6977237f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO extract this into a separate method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2cfbd1629c6caaca439773cb689517ed2255e1ae195110ce0b7f192984c2af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly handle (it currently desugars to sibling classes) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f91148899c7f260cc61a85fe64bfeb408c2bf7719a85113895107afb4c3c2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO lookup in members? inherited/refined 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d11ea15e746b10b55d5751fb3468338f3fd885f93b0f8e8d89c807b6d5a3d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO BE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e241dae08fd8065c4f09cf299e043fcd53df99f2a879a20efdbdf926b5165cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: may elaborate external sig twice!! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a55e3782e942ff1308c8ae98db76220bc320c01ae102c7db75c37a9c2d83019"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: correct \u002B\u002B? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"a020837d59d08c4f8f83c0b0c50d7c2f4f065146bb24d07c86f06a3ed29f4737"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: never use term symbols on LetDecl LHS \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff7846712d5bcb6024e8f7cdbe30a2260b644f95c6da0c4afbe915d0dd5cda6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle this gracefully (could be caused by erroneous input code) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2877}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a69ac4249b8bfd0486a33cbb464b7a99eb097a153b0549b818a69131ed61e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rm \u0060|| newResolution\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2883}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ca118fdc396694e566e68574e8790918c0c2f2ca740a32609bcd6a15d169a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO improve \u0060asInstanceOf\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2933}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e05c64b276b4a7440262dc66345534fecc31945e6fe5db2a7a3a439fc9e558"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO improve \u0060asInstanceOf\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":2944}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f34fd6b0ff4456e25e4b61dacc30bc7c9ad85835651db021d99ca23ac2f4c90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve \u0060asInstanceOf\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3002}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c65e6b77b16816505862beb6bfcf116400a76401e540997cf599a5448f6ddf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve \u0060asInstanceOf\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3018}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d32f7e828b9facee0772144cac939acd637029cca834894d4b6ec923475ef7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO reject plain term statements? Currently, \u0060(1, 2)\u0060 is allowed to elaborate (tho it should be rejected in type checking later) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee96194b7b38c0f8dce4e86cd43211f0f5244fb4863879dc4c73dc79e6201d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO actually use applied shape providing generics? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3168}}}],"partialFingerprints":{"codehealthFindingId/v1":"979c10a72cdfb890c889496bdff9464dd9cb574a4888d379fe9b0f6458a58dcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO actually use applied shape providing generics? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3171}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d1a8f4cf790acd7285b2ef72c1ffabec2e3d4a44170450348c3540409a77fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: patterns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3174}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ff178dd40570392280230d69df4549f4baab5334fbcc7a5bd593da36a1b7e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO forbid certain kinds of terms in records \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1ae359444cded0db0790aed5d7cee1ac418bfd86101f95a85b0d53e3d0441c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rm this weird \u0060: Ctor\u0060 guard \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3538}}}],"partialFingerprints":{"codehealthFindingId/v1":"649def4f59bf97fd96bdf5b8ea504ff9a41134739ceb5059ce28cbd49b9c8e0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this case reached by, eg, \u0060pattern p = () =\u003E Unit\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b82c2db57b40dc247b75c7684593f0e59299e5c04218366e1e727ab8f20994"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle name clashes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Elaborator.scala"},"region":{"startLine":3630}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f614d334b51f622d3dbf7b9fd89e12b833503ad71570a62383c2131d201ada0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO loc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Importer.scala"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3571a1e88f1b936a32a1592088c150b7a1119ae26b350ea494846c8d41a1439"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO loc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Importer.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1092405ef10a6bf6cbe492b8b325d3ed3e16ec80eae914b0cd65d3bc9d1bf6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: resolve ctor? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":3451}}}],"partialFingerprints":{"codehealthFindingId/v1":"38877f096693cc7d3f0f569866ba03b3c51a52cf96830b62cee477507f6536df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle \u0060mss\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":3452}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0615c19067495651b940e6db84732b29a09b48d9333d22a011862169fffa3cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle \u0060mss\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":3458}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf1301bd9e6af9ed36423100fc9de370d457a2e37ba57b48e6070e15d51ce6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   ??? // TODO error? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":4186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82e01d24f293ca8c0ab24d28add3a8268342d0fb3c4affa109078910dcf37f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove remaining occurrences of such refs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/NewResolver.scala"},"region":{"startLine":4744}}}],"partialFingerprints":{"codehealthFindingId/v1":"855f961afbf2fe2d38a48fa87869e75969fc6cb5b74ed50f29d56c4a1e7e078b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The above edge case would fail the following assertion. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Pattern.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"005c63dd00fd6d318b0e78a7e048dc897f49d084ff0651ede39854962106c981"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rm this ugly mutable hack: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Pattern.scala"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e766e76f2c07825dec08f63e858cf3fc959065c6ca6e8e16505dfe0ad519509"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: subtyping for Ref \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4583532498dc06c779bccb18f9cfa9971c26a12b3099d3a4047e38400aa9f4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: currently it checks for only overloaded statically \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"84124fb1c366006c96bb06ed352297b4eb5274441cfbda5ca3fa577423b08dfa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO @Harry: Appropriately resolve all selections on classes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"70159575a18e072deb0a22ecbf776373b92a5cce9e3e065bd650676ba2fa7157"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME[Harry]: Don\u0027t re-resolve signatures for every argument! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a4d4f505175c0d2516b63e66988bcb5d3ea26eb428e2b9b462e906985f2d13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check arity? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54c2f4570dc4245a8efaccc85ed10351b878dcad733bdcd0f9ecf2b76d77072"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support Lit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6958c2a072503322519fc460619195a38d78299510cb8a42149794ec1c87d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support UnitVal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dcbeb925310ebbe9034665390fbedca8a4d487d40bd6a13d0511bb274c62c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support Lit with operator \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"311239faebe6560e6f87fd5d7467114cdb5905ee16f82931228fd09dbc6a11be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support complex types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Resolver.scala"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"553f3e069e84704b5532bc64fc8bb1c2d693349011ef942b163bba587557f80a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make it not a TermShape? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Shape.scala"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc8aab667fd812156468bebaad140e728363ed2ad732683089463559f51bc37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2013 see \u0060RefinedShape\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Shape.scala"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"b338d85a95d216accfacd5767402b886fd4b2f0f89bbafa820846ae7a0014b77"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: @Luyu pls clean up this mess \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Split.scala"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4693a71b433c59b5dbe20975b1e5ad2d45d7e486c602c847642e9f3f334b66c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME hack \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Symbol.scala"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fff4333a8009279235136323004e1fac29f2979f90eac6e56217cdb02bff2ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO track source trees of flows \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Symbol.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"164eef79d165b15495da509e67daa77dd375684419627fe1f9523d620e024df5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support immutable temporary variables (currently the UPS assigns some) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Symbol.scala"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"81464a952b2bf2df209a7e539294d97818fd4864f1f21143a926b795450d8798"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rm \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Symbol.scala"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa9b59dd4aa86f0b1b412154966f9079e188ee99e19552e57e61169d790b5d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO prevent from appearing in Ref \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Symbol.scala"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc3a0c06795050829caa686b1a166308b67fa90f9a74f3b6f7690979b6f6938"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Derppening): Can we meaningfully infer the erased type of \u0060this\u0060 from the definition? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Symbol.scala"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecb7523eb200c7161ef46f2176f81b9ca2955cef91bbe39c03c9e606ce8642c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO track source tree of classe 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Symbol.scala"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"9733fc048731ebad75f2e25f24cbb4446e9ba80444f289c87d27efe334447b28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO track source tree of module 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Symbol.scala"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"88765b142ff8265da0a727c5eacff797721594271ed974eb32ec0992a31696f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO track source tree of type alias 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Symbol.scala"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e312bcaba78c73f2df6d572fb54feaa5c7b583d7828322c496c198d2e29f22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO track source tree of pattern 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/Symbol.scala"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a299795c3b1617cd576600a103d362e9d3ca5bbb517c7773c020966be86859e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove when the new resolution migration is completed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42f8942f45b1d09428c223c7a354d6708e3fbfcf53946e9c568419678fc8dc2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle class-like definitions with flags \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a8f1f287a62fd36ff476aa8f3f055ea84f8c7865edb54674e75989d7ad30f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle class-like definitions with flags \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3e7fa7da754f3423b13b4e77d0422651ebe4ddfca860ec943f8563418b94ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle modulefulness for class-like definitions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"b072cee2d3820aa9de14dad8c12976d48aa86ac456d82d7bea6775b5a8ab0b23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle modulefulness for class-like definitions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5567182f71e76a24e4722aa25f218a9a512df374ab3edc84f788da3977704d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle class-like definitions with signatures \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e55b34afa8871034102a9741e088a3b29dfe59170bc18c013380333aafa9cd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"517869fd260dc80e139c80264181e6510bbe446f45f33d143a9cf1fb7c3b26e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc43b4124b7a5d648468a26c9f8e18d1d662767191d0ad29f9e240ce340076e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cf062073bd1baa300d77ba8bccd549ec4d97785a1303f4176e928a155d17b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Store optional source locations for the flags instead of booleans \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/Term.scala"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"265de7feac29b61516e0a74f173c911ecd31d99061c22a3908f727f8afde6a9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO more precise (include located things that aren\u0027t terms) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/TermImpl.scala"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"e930c4ca898e0599f17f118f606e44531df9cdf9148f8c753aebab9f33a0e7e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Think about how to handle the spread pattern. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"8918d0f21212a99b5bb1125e14d0ebfaf783625c2f1fdd09bd2fa67d9819b971"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Think about how to handle negation patterns. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Compiler.scala"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"b551d49508e260dbfa57998deb770d8321311bfcd6df2678e994cf2644b1d036"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(after we defined the semantics of pattern parameters): We need \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Instantiator.scala"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13580569d09fd5d415b668fbf64f8c86191370c8d57a2b42b8fb8ade58513c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Associate with locations. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Pattern.scala"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b284daad1b725cf4f720ca118c7744d4551206570dc8f84c14554143006f9a34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: raise a warning \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Pattern.scala"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff6c0df0392cc9ca9ca37cfd5cdb3fb595a92ae06d267155b6af6a7f572faae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Complete the simplification logic 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/Pattern.scala"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"917f5f557fa82500ca1833d652b13cb9673b4264e8df17d165deb91f3c4f5ce5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Combine \u0060outerOutput\u0060 and \u0060elementOutput\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f64bf5e1eb1ebd486e35a1c0802ccd9e51c59cd4e9cf4f6784059c532e4e73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Combine \u0060outerOutput\u0060 and \u0060elementOutput\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1546f5ba3367d213d812426fa0bc413701d8ead3e3f0c3b9a22e6435f94983d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Combine \u0060outerRemaining\u0060 and \u0060elementRemaining\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95dd307cf7d1175704324dce064ddade18fdda97a13f8e601e0a0a8842857a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We can use \u0060LazyScrut\u0060 for this, but the match result pattern\u0027s parameters requires a symbol. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"22701ff2e28a98b7e0a6f70544dfe8383b660f442ace2232eb7d52b676f7f894"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This can be automatically removed when no transformation is used. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a088853648b86131dec6975585b6dbedf2144456649733a231d96bb57ccd5b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Combine \u0060outerOutput\u0060 and \u0060spreadOutput\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"0366ef1b0bb745b464657805ad72f96485119601a860614ba66ed1549f8387b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Deduplicate the code with the \u0060Constructor\u0060 case. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3563f9fe5481c89b547f3ccfa6124b3a4653c70dd97ec08ae55bfa0011c8d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Combine \u0060outerOutput\u0060 and \u0060fieldOutput\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7ff0f15b006f6ad6cfc86f456f7b27c145a5f7424f32d4fed32f728a726cf1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // END 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce7dc475d988656beb2ded06bb2b05da962dd2d19ea2caf95174b5c8262d47c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement the correct backtracking behavior. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c64a7438fa9c70a305a1b09072ebde8882da113e78ea8eaf0ff5d329d0a12c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use \u0060pd.extractionParams\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ups/SplitCompiler.scala"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd97bcf7496af5cef30be26b830b5a35d0953b379534099887a6f4d90a04bab3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the warning will be useful when we have inheritance information \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b230d536371aec543a9b7511edafb97a20014d120f8af7d5575abe8e9c1856"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME? case when there are only aux parameter lists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"af577d9005000804f6833e25035920a1262b39b56dd53bfae331bf691b2dd3a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add failed-match scrutinee info \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2779d28dff500db4a70f2878faa581bc1e528d02dff19e2cef25a63fb0c31d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Derppening): Do we limit IntLit to (1 \u003C\u003C 31) - 1 for \u0060Int31\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/ucs/Normalization.scala"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fac81638650e0ac57cfaf3821e2d43ba8971425655763322072be06931f75a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: more info (owner) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"439d5b32c5f2a428b67b95e02464b1b3fcfcf1f818cc497a256c0b47671a4328"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use sign_ty \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc34568fc39c4ebb0add6739f893f52003c879a5f51d3f9fdd16b1a42168308"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Nil \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d09130c9fa89de06cf326678922eb85d24d0ef35cd3de7d355ca29c68d4056e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: actually allow that in dead code (use floodfill constraints from exported members to detect) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"24eb5a6ea71dfc587bbcac05e422cc8177f6a2d2bda0f38af7be0f7da5798d9b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: actually allow that in dead code (use floodfill constraints from exported members to detect) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fc75994f16e35acadc4bd6b58a82bb22dc4edfe7746de24cb8b4eaf5004439"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should get a frozen inferred type view of the internally inferred flow \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"965af2424921033b98c00efde2158dcaab617ac92d8c723bb7867cfecc1761ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf869e95e5989d72b25f7607212c0d92f779a0732b5c50d89b0428245e059ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c77fda7b01e64afbae6b5ef450488c0c491769a82702d5a432f5a4967b60ea9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"436be6963b2109ace2456fad62761fafd5b861dcb271b8d10f7f40cd32cca623"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME 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":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c99238a787603bb912c8a361a7081bba257579784d58e583db02de698c85b1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO generalize \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"475dfa39003cee68e9107d7af966126b1feac5b4d2db79708ea49ed5802f604f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: producer-side spread vs remaining consumers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0aa298e5d0bb0cb6f7323c3dff1a5783ecdd1804b4fd565d659fa710a416a9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO construct proper error message \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"769d9bd99f52894fa8b7ab13abec2fdfa39f00d77e982551adebbaf2d9c52987"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO construct proper error message \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/semantics/flow/FlowAnalysis.scala"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"e283ad5e1665eb1cbde1076db24071b6c81e7bac88f24a6fd70a4767835676c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: error type? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"438d67e093c55908af16442bd05817ec844f32d647bd633a0fbe13d0dfb14c12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: error type? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77c8a9485019e5a8587d55e59ef97a7ade7105ebe2fd6df4168380dfe546fff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME hygiene \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04fb55df759dcb3db6e9356ab038d21c38e0c5e8036e680cbce40a70b75272d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME hygiene \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"53844f4c41240e30fb3dd9a651dd20a632119d78cca70b76ca2d66663ff0b4a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: a type var symbol may be 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":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5060cf4d81d5b64269f2033db00c0729d9af72b543011cc05ae89906f0b4f38c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO dedup with other \u0060case Lit(lit)\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"252294b6a6192c46241ec8bfc3aa16a50c3cf0fb5f6895a5d80c66937c41ef88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: right \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5df6bf62004935d3b072f9ce29505afa28de8461fe9d002b8939d4cc1793452"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: more than one!! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1c726dcff0ad798bc4c75ea2fafe76fc19fa53d83d8de5a06c810b495ae85f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: refine all variables holding this value? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbea36cc820d31a950ac5549cf6420e6bfa0d6e74347c7b89ad23616b567fdf5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: t -\u003E loc when toLoc is implemented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"701273f8b411fda53843211053f66acf31fed264bfa16c37d419076c829a8cf8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement toLoc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a89faec8444f389d0b961fd4d520566e057b64738927ad517ac749b5dadcbe6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/InvalML.scala"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5ff11a8c74ce7c27e1f1662a1bd3e4f584ef45ef6c7d8024bd3023b79a3e40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO improve: avoid inefficient use of toBasic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/NormalForm.scala"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2557aa98242bc5ed078f1bc8bc71a22174b9f9e144bd1b896d957fa11b056e36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO opt \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/TypeSimplifier.scala"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b1b37e6c6cb17b7d3b0ce10e1cef7178e4afef7337995fc3bea4f35e1db2ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO else?? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/TypeSimplifier.scala"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"503fe267dd162e3b95450b16e35f1838c15b0e977201328a19a589febf926c4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO NOPE \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/TypeSimplifier.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"767cb0124f9351481edd734e19a1e1fc7d1683bdf68fb0574c6b5266e50b54da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TypeBounds(TopType, BotType)(noProv) // TODO improve? creates lots of junk... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/TypeSimplifier.scala"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4955085c37bd802735c1983b2644308d3e3bd459259c881743aa86276f0e8da0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME arbitrary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/TypeSimplifier.scala"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"447bfcff0b02fcf668d9ba1795b27659d79decc9e86b30d75cbebc6f077b25d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO rm self-cycles \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/TypeSimplifier.scala"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b177e99e5ee84b8f4a764f7a221c41c67e2ddc32e4b06f74e5fde068bfedbe9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO improve impl for all ctors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/TypeTraverser.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a89544d925a691f07992632edc8e38dc31a75c3d5ed02df1c93d3152884f08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO improve: map on all type constructors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/types.scala"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72201f241474bae9c97147633bbcdf7fc89f84595296ef12b5f118f5a810582"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/types.scala"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1092e070518ede6bfc327fdc651e3d2cb4eea49183ac85ab175d8bf580dd982b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/invalml/types.scala"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbf17e4127558d78ee5fb220a89476dcd3bc5da9786b77c459ce0edf6c0e7aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make patmat use unreach \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b922aa807addfde7eaa959ff1b9ec8d32ee6e2cdbba50c0daab8e56abb945131"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO rm Lam from results and thus the need for these cases \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a7acaa769d4c4fafe196b0426b8b5c3b5819edc06ffee51b2c0b4d9d983b93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix this very inefficient implementation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfb44f5c3dcf14d190d849cb68b63bf4805d5f588a98a7fd7f50545b9e295ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this form? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc39e5e2358c9369ea59eeb90a13814bc0d9d142f5a0c6734e24f1c02d38e38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also handle non-End rest (may require a join point) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c47f05fcad7151579426150ac7e54fb97913921d30d70bbb7a265a47f4e426"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // * Simple heuristic. TODO: check the purity of the ctor somehow? (ignore pure local field inits) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eaf5e7128396e5caef1f6ad425d226d1e17ef808b79e33999ce75815c597314"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO rm \u0060empty\u0060? it\u0027s currently 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e5575c51d27d9daa1532cb51352fefa369168f34cadcb7f030551ff1e47394"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // case Instantiate(mut, cls, args) =\u003E // 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8ea8900b71e6dc151f5a76bd3ab5af4fe50cef27b4f573be887491c71d6a63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO rm Lam from values and thus the need for this method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cd967013f8f5ca9583004ba489217a83bc3f28e961799e85f59e24653d458f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Derppening): Inline \u0060Value.Ref.apply\u0060 into this function once that function is removed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Block.scala"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1eaae6a84a5841ef1b40e10f4a62f127f64a5f49f68f98f886395a2d3d6460"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: other simplifications, such as partial evaluation? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7f11cbf7a01581fb65c50bd7c1afddec27d39d15e19470b3ee753b17eaad89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could also analyse the effects of the extends clauses and companion module ctor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6426b2873eaa8b09d561d7036aff9bf5dd5d40eef21357db368d80f17ba86baf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: refactor transformers so this is not so error-prone (adding this case to \u0060applyBlock\u0060 doesn\u0027t 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e089f39d2f2f9b515df80bdb0e4cb19343a5aad273a428456699bce881ea724"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: refactor transformers so this is not so error-prone (adding this case to \u0060applyBlock\u0060 doesn\u0027t 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7406f98ca0040af898255f0fc6d8894298a0ce0a5e58c2bae18e570e53cc6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this case. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67357905681a03bb82355bf5fa23746d3d4b9b8ddc0fb475653875b0a7dc502"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // ^ TODO: technically, all we need to prevent is changes to \u0060nonLocallyAssignedVars\u0060, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfae2684e6c86602ee0813a075abf82bca00a4a46c52241db13c6a99567cbcb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this currently short-circuits, which will miss some live assignments... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"f745fedaf6a1008d21eaf3921f2c7428d022b831691694c3662bf50a6ee0ce0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix the rest of the compiler so this invariant actually holds \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fd9f80c750b98eb03aea72192db170ea7638a1739739d3c557eeb2363e540d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is probably only needed when \u0060!inDryRun\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c509e4b73be73758ac69df45ce46dafd94fc2cb1f147b0bcfe12e21affd8fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // * TODO: Support Tup and Field shapes; ModuleOrObjectSymbol \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92d6b92bf61933277741fca2dae3f7842aebb3683402865c453f25267eac37a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // * TODO: Support class inheritance reasoning (using a tree of hierarchical shapes) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e105865170489c746757cc9ad472151235dbb5a746be2343e5d93021ad16d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if analysis gave up, make the shapes the set of cases of the patmat, to rm redundant arms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb495d8c5f59992f4fc97d83a0e8bd6b45604de208e3204d75af710a33333049"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: take inheritance into account \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d4344d6edbe3f264e1e9a25d3858910587c7e5e7394319fc9a4d71395c0805"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: take lit \u003C: virual-cls into account (such as true \u003C: Bool) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dad0d93c75807c3d3b48ad59c7c2781283a42438ddf2cf3176ae3a8ea52181"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Some partial evaluation \u2013 TODO: move to IR smart constructors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e7d2d21b19622aef64552a90ab28062002dbfff3be08fe614d6abeafae30b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // * TODO: instead of hacks like this, in the future, we should make sure 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fb976442cc882f3b05b4be9dbf476cc52222a1368cbb8178c6ea0f9dbcd3b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: https://github.com/hkust-taco/mlscript/pull/504#discussion_r3827173721"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/BufferableTransform.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c5aa35311002f4ce8e33db59dddcd562f4723a4c96a0ab57fe727723bb770c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can be more aggressive to add another blksimplifier 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/CompilationPipeline.scala"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"64370ee4c8fcc54df9fd8ced70b72595d9cd20c5ea2bd726cd344dd36affed6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should be able to remove this later when we can reason about \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/DeadConstructorElim.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9e4534409d91ad0c85c378e552485838c16fa6d07bae92dd1323351eca899f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Derppening): Skip appending \u0060Object\u0060 and/or \u0060Anything\u0060 if the symbols explicitly extend either of them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ErasedType.scala"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce1c6d9acc8046ccc6e0a2c4e183a984b071d9707178c99f3a7d9854ded143d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Derppening): Remove this fallback once \u0060extends Object\u0060 is explicit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ErasedType.scala"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e7aad6ed6f45a0ce83cc52e7f5c00d95f541070212c377591f7b25b83808c3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this fallback once imported functions have their \u0060irFunDefn\u0060 properly linked. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/FirstClassFunctionTransformer.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7dc4dcb26329cfcda81729405577a183888a63ba19ffe6a5128d72434457ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove this fallback once imported functions have their \u0060irFunDefn\u0060 properly linked. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/FirstClassFunctionTransformer.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"34adca875c399c625110347332e602a6e425cb5203b42eaf19e6dcdbca183b1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Companion\u0027s ctor is more well behaved so it is possible to handle it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/HandlerLowering.scala"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a01066e2323a07b2ba06ef0aa739519b5e69362ea410df0e72c0ad133c1895"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: lhs.nme is not always meaningful \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/LambdaRewriter.scala"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e6bd77d0c7d1412a6ef7dda5bd46195b94f0af5be4c10607b0aeceb5dba2c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement tracing debug system \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfd72df5e98858eada8a033ae5e45a9d3b0607a39612ae4104f4600a026d451"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack: ClassLikeSymbol does not extend DefinitionSymbol directly, so we must \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.scala"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7941269156a5f86583197a2ed7b0f05063eb9805b0ac1edfea2189b43a04682"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we should also isolate and reorder classes by inheritance topological sort \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fffe514c4a8edc8cc82fa6ccdd13213abd489cf6dc828d0599312c60917403"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: instead, make SelectionTarget a listener that resolves to a more precise target \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8a48d5bb664cd4f9840c207a99ffb9323746a29e8c14aeb8729c120e9c8556"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME should not be required (using dummy value) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"03307f978434c285ac0bab5bed3920cb6e9d33b9980f55bac14e3d1902545bc3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME should not be required (using dummy value) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28408eaec51d8a06c473c4d19ca64c3865e6c2f5456cfaf4f9605fea2be6e52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO panic here; can only lower refs to elab\u0027d symbols \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"418d877077aa70cf4a67020011bbfa302060d55f36abc1cce1847894d588135c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Does \u0060@untyped\u0060 on a primitive make sense? How should be handle it? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0a1953a6a1b312c3513db6bcfb51606fec9fcc831f6a965fbeb75f2ef634f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: clean up logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"6771c81158e727addfcfdd853d2f65a9f04ace3a61fcb12a1311d60c3410a72c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: warn when in statement position \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac27eab0e4e62c90cb0ba50a81c067aad89f6ee990a39c0a1bebd5dc6f791cce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: warn when in statement position \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3a974c4e403f35f67ba7f9b040df85691c00c2b7f9cea6be465affadcb5715"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: restParam? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10dc3b06c3ae697609142d8d1d21565a7dda322de1169806ee32b52658fd114"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // @tailrec // 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ba8e5fa2327306082f0016829a9781353db1067d78bdd58d5ee3089dafb2c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: reduce duplication between the two \u0060reportAnnotations\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"77abc0ab47462f4e3608299bc24964da3b23bddfae72d1974cc5b967454c2414"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // * TODO: Instrumentation collapses the trailing parameter lists into lambdas, so \u0060fun f(a)(b): Int\u0060 is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/Lowering.scala"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb2f41351b7d71717c6c2766db7c4c271b086cf64c637bbe7d5d4664d861599"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // case _ =\u003E TODO(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":"hkmc2/shared/src/main/scala/hkmc2/codegen/Printer.scala"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"444c3dbe86102d3ff8266fb9fff45acc31ae4cce84fefbda10149e2fd0c1ae9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there could be a fresh scope per function body, instead of a single one for the entire program \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e2f96579fec95778bf0f85763ebf9879fc47d84bb8117fa9a210278b96dfd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: skip assignment if res: 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4d5b8dd0762877ecba1e48cefe73db69619f7b0cb9cf609041c650d9313af9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: hack to patch in staging for returning the object Unit. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e246dab6404a16d9e90ca877bc0b09560669af0d77e6d1266ccd0e96c840777e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: there may be more types of symbols that need to be renamed during staging \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd463bbae7bd1a98f2b8e1ec623f826ab7adca5ba7bc8301d6a044558a45bd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use transformOption 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11bdc4c7965686736979419c3d6821b6751e987292b47b2779a71b9dab20931"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve. This is a kludge to allow private field initialization in modules; \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c7f089fffb3bc6fd1e03c61df6cbb56b57a11087bb18ba129c5bcb59f4ce07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle companion object \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebac94bb6330293de96bbd2bb3999d8ec2e5be2f884e396b441d642a92fc5f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: only allow ValDefn inside ctors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0e1605572c64eef0cf48faaff0825bd1f84128c074b6f5de7ebedea8a214bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is untested as there is no test case that generates the Begin block yet \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2edf9eda95e5be5b5cb5d767eecd8cbc2caf7baec9a15e10972c17376a964b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove it. only for test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/ReflectionInstrumenter.scala"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9d6e0d5f026202af8f222829c0229021a7c446bce1eb88d2c089c5024634aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: refine for object and module ctors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/SpecializedSwitch.scala"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87a77433324fe6b8616f5949e21e6b7ad45aafa7e024d188b829629af7bcaa6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // * TODO: support this once we normalize known-call sites in the future. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/WorkerWrapper.scala"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8029d4638e07bdcb6130829c0952b35b3350f44084f0c7d92c02b67d89521940"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Derppening): Add \u0060tableuse\u0060 here if/when we support multiple tables. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/Wasm.scala"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dde3252ccf6971ced06ca9bcb5d2a0ea9e7e79daf8bd6a805ee83d66f33a1e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: LP: why do we need to access elaborated Term methods, here?! We should just be able to look at the IR definitions, and if that\u0027s not enough, we should put the required info there... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/WatBuilder.scala"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a484ac61adcaef046497ef8ab98d26e95b263b68a7e5d994b75fa404cd23d22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement proper lowering for Errors with unit payloads. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/WatBuilder.scala"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0ba3aaedf664f18a9e8a509acc521ba3841788ea8f8804d2b1048577b261a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Derppening): Ideally we should be able to tell \u0060Int\u0060 and \u0060Bool\u0060 apart at runtime, but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/wasm/text/WatBuilder.scala"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"e503dfccb8a22f93d5b556bd11e4c392e565c9da31aa84cf26d49fd567b40cd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO factor some logic for other codegen backends \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f01a8bf192a716d257b0966855b2f153c4a98b768c7ae26e8e344f61c1e331f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use this to avoid parens when we generate recomposed expressions later \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9598b48a8713b93be2933e2daecd9bbad3b61a7c90e96d5d62e056b30689ac06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve location \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ddb4d9f2fd8bc5caecf1c722ba11eaeff6783fcf1d9c6cbe18c88fdb844f82"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // [fixme:0] TODO check scope and allocate local variables here (see: https://github.com/hkust-taco/mlscript/pull/293#issuecomment-2792229849)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c2f94bc05b8086ed8c9736af0b9fdc4595fc5cb819506f092249a724a1063d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // * TODO: make JSBuilder never raise; \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/js/JSBuilder.scala"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44bd92672b2a22bfb00cb6714ba10dbba832fe2071ceb04fd64fa3025f00f50"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // * FIXME: not all symbols have irDefn; add and look up an irHeader 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":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b8a41e62a8aa1c741523116a2404e0d41543a7fcd52115fabb48869d059951"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tighten \u0060Symbol\u0060 type! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e843f8d73f687875ab435e0f040ceff5268e7efb9884daea3b66b97feb1abdb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tighten \u0060Symbol\u0060 type! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"395f1145fa6d254443f8bf2d50c0797a3fb701e90f3f7458fbb4f952491feeab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tighten \u0060Symbol\u0060 type! // TODO: populate for getters! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"faea86fc7eb4396aae7bfbbae4ee8897e3ced56b133c32658295017ccb57c083"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tighten \u0060Symbol\u0060 type! // TODO: use at access sites of getters! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd225c0667d4759093204182042af8603e6e0bbcf1a659d42f1acf370aee6f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t register such constraints unless a flag is on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"0555def0afc5c74cf99fc352f9d3c8140004e30d1f9d8375f06aa388a53818fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: preserve callee-effect precision for spread calls \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d591850ddc76aa3c740638f1eee8a2764481f3f724c9c305d5a7b265d2e7703"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use irDefn here and elsewhere \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1183ff89d9d0ec6a534d69366dd832a36fe77a1b70d53e3ab782872ff9db7885"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: properly check the parameter lists, which may change after passes like lifting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a277a40db0353de67d8503b3736138e1fe0f8050d76ca243df70b90b4a04a68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // ? [todo:harry-0] \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0c33d38c00bf6c9003936c07648a3f55cd93bc3e0d270a0b5c2c4446af45ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Properly track value flows through class constructors (current and inherited) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/flowAnalysis/FlowAnalysis.scala"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"6969a219a74da003d230d3be1468d00b8dabfb9d65ce2fe9a86065d247cfdebb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle see through imported modules \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/deforest/Deforest.scala"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb360d93b86a2231223bcacbaefc02a132f44ffb6899a011fa5bb64c833ba96"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (51864 LoC, 1131 module-visible types across 24 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":"e27fdebd872266fac1e3da99f1bb709878b68b632941674880d71c6f3f1ec668"},"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":"fcf4639de1019bf5b2c9b6dcc14e98a5e06c7a1da12d8bbfb48f6bbb622429da"},"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":"34faa425d34c67abc4228418e1a2d59ece996b1ec99f7246cad780ef4fe4005f"},"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":"80d1c0883b1f50753e0ac06a4245d94b0356e65b5df2ce0a1f4f1e64ddd0f200"},"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":"b2af489240184a6abbda74b76af559e7be8f3f699800b30321bfdbcb71c0cba4"},"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":"bf0ae3c397d482362fc6e9ebcfcdd19e1f29945d709fbc24cce3226a2a5a49d0"},"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":"be19211694dca8c7142806df237bffca0d9d33a457732d8dcad78630578b5206"},"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":"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":"ce5a045b8e8d4d11c6e6f8a28f66c3a43604bf438b7cff8ff37f5e67140b2d70"},"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":"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":"14fe158483c79870e5ce291e766c65e19b997eecc624015f0b60f7a64579b9b2"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"13226765d223c9d4e2c97f0944f2e4016e07e1bb568bd2b857565f9f914fbcbd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"local_testing.html"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f278645965ef6d1e7f0a8cb15440bf8b28cee2e2d8550638401285b3aeea1d5e"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c03112092084821eb10323780c41f92cd64c7f4713debc46d9031ab90eaa76"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"732c4587b5831e9d9da4b05f6bb12d9a8a817ddcc0ff07809f91bca0b3a52697"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"local_testing.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"29575bcf2a9b9f35e84bd3e861f9987810af753b884ff73df9d0e725e94baad4"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"local_testing.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8619244d003c1305844ecbeca7eb86b6e9404045ff6b50a2e354e13578f435"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#mlscript-input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.css"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f3742c4adf8b9a3943435ae7b5279e6730c3838822d1f7aa33d521a5c10d81"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no a11y linter (an accessibility check that can read your UI \u2014 no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have) and no axe/pa11y/Lighthouse in tests or CI. Start by running that check over your rendered pages in CI. What was searched, so you can tell an absence from a miss: the 2 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060preOptimizeHook\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/CompilationPipeline.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e7276a9d47730e268af0933099314cde81bec150c1f93fc100f7484f5d7fc8"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060passHook\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/hkmc2/codegen/CompilationPipeline.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38f21f380b1b4467d171b591a85cca48f27d5d640dbdc513f05195b8923dd7b"}},{"ruleId":"IC1","level":"note","message":{"text":"Method throws NotImplementedError: \u0060TODO\u0060\u0027s body only throws NotImplementedError \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/shared/src/main/scala/utils/package.scala"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a388de967973428ff6af77b8490dc669d174d3da43392fa40f589c74e07c94e"}},{"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":"M4","level":"note","message":{"text":"README/code drift: doc/wasm-modules.md names Binaryen 131, but the manifest declares \u0060binaryen\u0060 ^132.0.0. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doc/wasm-modules.md"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc2c73af4f5ef66d9548f3dc8743a0e003cc4b1fb28ab8e25718c1e8408a4f0"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"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: \u0060(lbl2 is lbl) \u0026\u0026 (bod2 is bod) \u0026\u0026 (rst2 is rst)\u0060 appears character-identically in 3 files \u2014 hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala, hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala, hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.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":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockSimplifier.scala"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"c666d902cd79edc3f5730dc6cdcb9b709f858b24dfdb6179881f2fc223d52cf2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(scrut2 is scrut) \u0026\u0026 (arms2 is arms) \u0026\u0026 (dflt2 is dflt) \u0026\u0026 (rst2 is rst)\u0060 appears character-identically in 2 files \u2014 hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala, hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.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":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c715905bf3428eafd4648b65146a4ae3a629a3d08a316a8ef49d038bb60b455"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(sub2 is sub) \u0026\u0026 (fin2 is fin) \u0026\u0026 (rst2 is rst)\u0060 appears character-identically in 2 files \u2014 hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala, hkmc2/shared/src/main/scala/hkmc2/codegen/Lifter.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":"hkmc2/shared/src/main/scala/hkmc2/codegen/BlockTransformer.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a4a32bb4c505d5588dc808e13f2bc68f32f5b1a7558740a16ad723768cab80"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/jvm/src/main/scala/hkmc2/io/PlatformPath.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4982f338385d21b91b3811481ac27488b606207bf373114776df5025bc9bd8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/js/src/main/scala/hkmc2/io/VirtualPath.scala"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d98be75e698cc1ac5edd6fe087fd2d49e28a00dae8a219425a2d7f9d2711ed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hkmc2/js/src/main/scala/hkmc2/io/node/NodePath.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ffe127b77ec5e7caf9be3b3768daf83bf5effae408d4255dddb42db68707ef"}},{"ruleId":"X5","level":"note","message":{"text":"Scala\u0027s null is not held to the type system everywhere: No build over this repository\u0027s 146 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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-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":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"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":10,"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."]}]}