{"$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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"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":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED1","name":"Handler temporal coupling","shortDescription":{"text":"Handler temporal coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/ED1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"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":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X31","name":"Test-only surface in a production module","shortDescription":{"text":"Test-only surface in a production module"},"helpUri":"https://codehealth.canine.dev/dimensions/X31"},{"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":"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":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"type_system.infer (cyclomatic 139): type_system.infer has cyclomatic complexity 139 (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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/type_system.erl holds 4 of the 12 functions over the threshold \u2014 including the worst \u2014 and 254 of the 469 points over it (54%), 2.2\u00D7 the next-largest file (src/code_gen.erl at 117). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type_system.erl"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52d74c81fb6802be88133a76444da450ba027e77ca563f689940dfe59c3f4ba"}},{"ruleId":"D1","level":"warning","message":{"text":"code_gen.rep (cyclomatic 114): code_gen.rep has cyclomatic complexity 114 (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":"src/code_gen.erl"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"11dddd1bd88a62873fc634c1743f2668c270853eb86c81cc76fa7e014726fc27"}},{"ruleId":"D1","level":"warning","message":{"text":"type_system.unify (cyclomatic 105): type_system.unify has cyclomatic complexity 105 (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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/type_system.erl holds 4 of the 12 functions over the threshold \u2014 including the worst \u2014 and 254 of the 469 points over it (54%), 2.2\u00D7 the next-largest file (src/code_gen.erl at 117). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type_system.erl"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f42a22af2f5c2a040cd155e99436d004b1204d9336fcff1f4d1734ebbd0af0"}},{"ruleId":"D1","level":"warning","message":{"text":"interpreter.eval (cyclomatic 73): interpreter.eval has cyclomatic complexity 73 (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":"src/interpreter.erl"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"563fcd73f966e4beaf63347de6b5ce185649a71c62952fe93301fc9928d0d8a7"}},{"ruleId":"D1","level":"warning","message":{"text":"type_system.infer_sig_helper (cyclomatic 48): type_system.infer_sig_helper has cyclomatic complexity 48 (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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/type_system.erl holds 4 of the 12 functions over the threshold \u2014 including the worst \u2014 and 254 of the 469 points over it (54%), 2.2\u00D7 the next-largest file (src/code_gen.erl at 117). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type_system.erl"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c04a2b6fd09b7d3dcad082439711afe78cce80b62ec42d2d1bd0a70c05a8a5"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.subs (cyclomatic 34): utils.subs has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.erl"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6a93fb1836641ac6cfe0cd16028b50ab067689b1362e1a73417e6081bc049b"}},{"ruleId":"D1","level":"warning","message":{"text":"code_gen.rewrite (cyclomatic 31): code_gen.rewrite 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":"src/code_gen.erl"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d44d0c6d3e8ab6c50c1abf71fee62d51bd164694f5537ad1b87f1baf0a7bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.pretty (cyclomatic 28): utils.pretty 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":"src/utils.erl"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38c5665aebbce210635fae242c77a439fe06221803f835d6ba3cbeefc67886b"}},{"ruleId":"D1","level":"warning","message":{"text":"type_system.define_type (cyclomatic 22): type_system.define_type 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/type_system.erl holds 4 of the 12 functions over the threshold \u2014 including the worst \u2014 and 254 of the 469 points over it (54%), 2.2\u00D7 the next-largest file (src/code_gen.erl at 117). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type_system.erl"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f6adf8c9d73ec6ea3c1f9ecc7638ac0c0eb5bcd4b89b73bc75387cf797be36"}},{"ruleId":"D1","level":"warning","message":{"text":"interpreter.match (cyclomatic 21): interpreter.match 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":"src/interpreter.erl"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"951138c0fe5da5bff5333307a8ed3dbf2a8acae4f86bc3aeb449e6115dc2be3e"}},{"ruleId":"D1","level":"warning","message":{"text":"code_gen.populate_env (cyclomatic 17): code_gen.populate_env 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":"src/code_gen.erl"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"736f481db372af8f9dac68f3eb6c7aa2f90f31668b954f8a918fd4eecd22289a"}},{"ruleId":"D1","level":"warning","message":{"text":"par_native.wrap (cyclomatic 17): par_native.wrap 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":"src/par_native.erl"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"468ed4f27c620ac3a1555e81f591dc87c166e75642458ba570d5f6cbef10553b"}},{"ruleId":"D2","level":"warning","message":{"text":"type_system.infer (cognitive 102): type_system.infer has cognitive complexity 102 (threshold 15). Drivers by points: match/switch 65 (85 pts), loops 4 (8 pts), boolean chains 6, if/else 3 (nesting depth added 24). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/type_system.erl holds 6 of the 14 functions over the threshold \u2014 including the worst \u2014 and 227 of the 326 points over it (70%), 3.5\u00D7 the next-largest file (src/code_gen.erl at 65). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type_system.erl"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ece2dbf72937416ad67286b167c973eb4a0b427b5d2509238dcf05c4b11ef41"}},{"ruleId":"D2","level":"warning","message":{"text":"type_system.unify (cognitive 101): type_system.unify has cognitive complexity 101 (threshold 15). Drivers by points: match/switch 40 (58 pts), if/else 22, boolean chains 20, loops 1 (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/type_system.erl holds 6 of the 14 functions over the threshold \u2014 including the worst \u2014 and 227 of the 326 points over it (70%), 3.5\u00D7 the next-largest file (src/code_gen.erl at 65). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type_system.erl"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2aa6a17b625aba4ae9a13ec733c1ff5c941c895f8bba7f9b186cc04edaeac2"}},{"ruleId":"D2","level":"warning","message":{"text":"code_gen.rep (cognitive 61): code_gen.rep has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 50 (58 pts), boolean chains 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":"src/code_gen.erl"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b281d73f43773dff08e92a07239d844532303a447ab5f42367e1ca3bef5e972"}},{"ruleId":"D2","level":"warning","message":{"text":"type_system.infer_sig_helper (cognitive 43): type_system.infer_sig_helper has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 25 (40 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/type_system.erl holds 6 of the 14 functions over the threshold \u2014 including the worst \u2014 and 227 of the 326 points over it (70%), 3.5\u00D7 the next-largest file (src/code_gen.erl at 65). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type_system.erl"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85826991056a41bab2c45cac99eee9dacdf739e5206c39aaeec280454381325"}},{"ruleId":"D2","level":"warning","message":{"text":"interpreter.eval (cognitive 33): interpreter.eval has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 22 (25 pts), boolean chains 4, if/else 2, loops 1 (2 pts) (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/interpreter.erl"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b105032de5956ca602e87b51260891d47fe87d63fa1e2aea3355b1abac4b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"code_gen.rewrite (cognitive 29): code_gen.rewrite has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 22 (27 pts), loops 1 (2 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":"src/code_gen.erl"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"056c4b6258c17dd7352cbabd92b980119948748290452e3af30311bcb345c1f5"}},{"ruleId":"D2","level":"warning","message":{"text":"type_system.infer_impl_inits (cognitive 26): type_system.infer_impl_inits has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 6 (14 pts), loops 2 (10 pts), boolean chains 1, if/else 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/type_system.erl holds 6 of the 14 functions over the threshold \u2014 including the worst \u2014 and 227 of the 326 points over it (70%), 3.5\u00D7 the next-largest file (src/code_gen.erl at 65). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type_system.erl"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc63b83d52ea803a47f8932668390564ad6d5a908accae2ff9f09e7f802d9c64"}},{"ruleId":"D2","level":"warning","message":{"text":"type_system.define_type (cognitive 23): type_system.define_type has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 10 (16 pts), loops 1 (4 pts), boolean chains 2, if/else 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/type_system.erl holds 6 of the 14 functions over the threshold \u2014 including the worst \u2014 and 227 of the 326 points over it (70%), 3.5\u00D7 the next-largest file (src/code_gen.erl at 65). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type_system.erl"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"2904e99ce3e7c67ce866a4c2e4b1fb445e56578ecc8b6f84c556e57b0768d4bd"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.subs (cognitive 23): utils.subs has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 10 (13 pts), loops 4 (5 pts), if/else 4, boolean chains 1 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.erl"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e49cc2cc88b0ad1fce2d7c0b9a1f5dc53e7f3600c63a490a79e152bd33cbff"}},{"ruleId":"D2","level":"warning","message":{"text":"type_system.infer_defs (cognitive 22): type_system.infer_defs has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 12 (17 pts), if/else 3, boolean chains 1, loops 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/type_system.erl holds 6 of the 14 functions over the threshold \u2014 including the worst \u2014 and 227 of the 326 points over it (70%), 3.5\u00D7 the next-largest file (src/code_gen.erl at 65). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type_system.erl"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e668baccc64b4e4ea8195621b4547118defbcd79ff356be2c18052de8cdf910"}},{"ruleId":"D2","level":"warning","message":{"text":"code_gen.populate_env (cognitive 20): code_gen.populate_env has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 11 (17 pts), if/else 2, 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":"src/code_gen.erl"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"21673c33bbaf48d6695017347af5d6c71691b1d878b7a429369df9cef6fa6d1a"}},{"ruleId":"D2","level":"warning","message":{"text":"par.run (cognitive 19): par.run has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/par.erl"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6ad4b6a65cd0b1fb32aa5c312f5ab4ee1730b4e281d83a3ad30a408026d130"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.pretty (cognitive 18): utils.pretty has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 10 (11 pts), loops 3 (4 pts), if/else 2, boolean chains 1 (nesting depth added 2). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"src/utils.erl"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4e5f0ea2566042a14bacec26a2a551f7ee35460c0cc9996b9c42ac0609c31a"}},{"ruleId":"D2","level":"warning","message":{"text":"interpreter.match (cognitive 16): interpreter.match has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 8 (11 pts), if/else 4, boolean chains 1 (nesting depth added 3). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/interpreter.erl"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd12d42939d06964541d606d2179a3b308830d0c3f1156e0c3dc94f889cb0143"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_system.erl: FileTooLong \u2014 2605 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 76 functions. The bar is 500 significant lines; this is 2105 over it, 5.21\u00D7 the bar. In this language a module is exactly one source file, so its length cannot be moved into sibling files of the same module. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no one module has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type_system.erl"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7037adf4661896e3e710158c10e5ea3f2a633e95658484eb848cd9a870ab0882"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/code_gen.erl: FileTooLong \u2014 1167 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 41 functions. The bar is 500 significant lines; this is 667 over it, 2.33\u00D7 the bar. In this language a module is exactly one source file, so its length cannot be moved into sibling files of the same module. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no one module has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/code_gen.erl"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"795175ba425ba6e78ea7e526452fbbabe5a08f52c962172806bb60d29aea62dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: utils: TooManyFunctions \u2014 31 functions. The bar is 30 functions; this is 1 over it, 1.03\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.erl"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51c03f43ca95d207bd5d6697152fed324b8a11318381994e78f5e2046c0b099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/type_system.erl:1450-1461 | src/type_system.erl:1475-1486 \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":"src/type_system.erl"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b3d432d4ba97752238fac4053a8dd734b12d860f171ab7e8b41af4016780ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/type_system.erl:1646-1657 | src/type_system.erl:1677-1688 \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":"src/type_system.erl"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c5bad38d0e937337548857fdf63a534272c2674ffdcf1838760d56e5224d87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/type_system.erl:1594-1602 | src/type_system.erl:1618-1627 \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":"src/type_system.erl"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99dda58400fca12f64a226df793670931ce5cc662cc9d9fffb42417849b453f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/type_system.erl:2786-2794 | src/type_system.erl:2807-2815 \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":"src/type_system.erl"},"region":{"startLine":2786}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbeb55345d5ba7d93fdbd429e17f6416f512dada7065d41c878e695dc0b1df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/type_system.erl:2902-2910 | src/type_system.erl:2912-2920 \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":"src/type_system.erl"},"region":{"startLine":2902}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5e9f791b7bf36ad378d3ab52d5a341b9e6a48d9a167d4e6288250dcc6764d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): src/code_gen.erl:680-685 | src/code_gen.erl:709-716 \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":"src/code_gen.erl"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fd4f0ddf3014655730fe9b897708ea7036e01d0d8f7a81b03dbaf948f03ca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/type_system.erl:2771-2778 | src/type_system.erl:3002-3009 \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":"src/type_system.erl"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"b513cf6c3b307e7b16d608088bea3b199cd98ce458f3194042f262af58180fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/code_gen.erl:652-658 | src/code_gen.erl:663-669 \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":"src/code_gen.erl"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f1f468dab82bb05b0aa583c9e0e48cd1084d73c4e87364a3358f5946acf8e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/code_gen.erl:1303-1309 | src/code_gen.erl:1317-1323 \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":"src/code_gen.erl"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0226ca193bb582ad366f2ea02c47e08e1b5c4d89eedbaad4bd1dbc4331ec899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/type_system.erl:2865-2871 | src/type_system.erl:2873-2879 \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":"src/type_system.erl"},"region":{"startLine":2865}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5251d6f2d6961e95e108b4d0bcd335576b0396f9d9f3a57bb6188b3fcc54659"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/code_gen.erl:725-729 | src/code_gen.erl:739-743 \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":"src/code_gen.erl"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d754052beff8be97fc7f0e93dccc438c9ab834b2205083b79ea1cd88851553"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/type_system.erl:2656-2660 | src/type_system.erl:2663-2667 \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":"src/type_system.erl"},"region":{"startLine":2656}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b26e2fa71140423e528941ae92d452d7775f9cd057c00d279935ced56c3054a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/type_system.erl:3018-3022 | src/type_system.erl:3071-3075 \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":"src/type_system.erl"},"region":{"startLine":3018}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c14e049c512eaade53d10f414a8431645defc470e5d54060566912bd91a99a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: % TODO: think about ways to improve error reporting to make this test pass \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060% REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/type_system_test.erl"},"region":{"startLine":2643}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd55392ce9bfb2947570f5e0e7c11376b5c841fa63546f4fa8717275a80dd9d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: % guard clause; TODO: optimize by not doing this if valid 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":"src/code_gen.erl"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"5225452568bcd58635ffffc82f2e0e0b3b2596dfb7cd575797b9a8ff74105165"}},{"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":"src/par.erl"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9845aa9d1580fbaf5c868bef1c0f7877faa160b615f0bec164210e2b06787da4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: % TODO: better messages when module is not defined (e.g. Bad.Type) and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060% REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type_system.erl"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b0b572df213ed1368f5e1e5045ab20d6152cd10eec8387372fd6900f255fad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: % TODO: is this necessary? can we 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":"src/utils.erl"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"90212e22ff07421346fefae4d387fb8b956870b8e0de24bab30816a808a7670e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: % TODO: use iolists for efficiency \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060% REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.erl"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2519f28d58ad843ab5582ba310fb7fb3a9e7092d6bc2d4c3762cd2e9ddbd35"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"ED1","level":"warning","message":{"text":"Handler temporal coupling: interpreter clause \u0060env_get/2#459\u0060: \u0060interpreter\u0060 clause \u0060env_get/2#459\u0060 blocks on a hand-rolled \u0060Pid ! Req, receive Resp\u0060 rendezvous awaiting a peer\u0027s reply while handling a message \u2014 the process is blocked (holding its mailbox) until a peer replies or the sleep elapses. That couples this handler in real time to another process being up and fast, and a mutual call can DEADLOCK. To decouple, reply asynchronously (send-and-continue), or run the round-trip in a throwaway spawned process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/interpreter.erl"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf71020a4c31f9b09f636bcf405001dd949477513ea9d30ba5270ed8f02d554"}},{"ruleId":"M1","level":"note","message":{"text":"Thin README: The root README is 21 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, it found no a build/run or getting-started section, no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise \u2014 or with no heading at all \u2014 is not seen and this row may understate what the document covers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5fc8f78bec0b6b3daab9d9139ba49b687f61b54f8310b64c159df9616f47e38e"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add dialyzer or elvis as a CI step. What was searched, so you can tell an absence from a miss: the 103 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}}],"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-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-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/"}]}],"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":0,"secretScannerRunsExcluded":0}}}]}