{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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":"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":"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":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"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":"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":"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":"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":"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":"VirtualMachine::interpret (cyclomatic 194): VirtualMachine::interpret has cyclomatic complexity 194 (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":"tera/src/vm/interpreter.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1240df0ce4bc9bfa97fb7bf8e9f7ffcad48a65a017cd718ce5cf4fdbdeef7d8d"}},{"ruleId":"D1","level":"warning","message":{"text":"tera::parsing::lexer::basic_tokenize (cyclomatic 116): tera::parsing::lexer::basic_tokenize has cyclomatic complexity 116 (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":"tera/src/parsing/lexer.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"5611837dfb67b3e65170dd3e0bec55de211ae36666cee3f5a73f03e46ec678e5"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler::compile_expr (cyclomatic 58): Compiler::compile_expr 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":"tera/src/parsing/compiler.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba16e155a470b0f7a8308124b896428f8d8d8226acc4831a4ca6750b8ebf19d"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_expr_bp (cyclomatic 54): Parser::parse_expr_bp has cyclomatic complexity 54 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc662c7026b3f08976d1fe8a13934be3c0c38f08c8f9e3a940c0707aad75a64"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_component_definition (cyclomatic 43): Parser::parse_component_definition has cyclomatic complexity 43 (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":"tera/src/parsing/parser.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e750c5e44208473423b8b14dd5673d96051804ea63acd488e65b793cc90eee9"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler::compile_node (cyclomatic 32): Compiler::compile_node has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/compiler.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c5659d9be1a8f11b121faedf0ccd4c30eecf312e3c722e56850f71138e261f"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_tag (cyclomatic 31): Parser::parse_tag 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":"tera/src/parsing/parser.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f34f876d732228dcc3e76543686a92d31a6e6294218ac24a64f21e37b41f52"}},{"ruleId":"D1","level":"warning","message":{"text":"Expression::fmt (cyclomatic 30): Expression::fmt 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":"tera/src/parsing/ast.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"47356fd3a60ee31a746cbceb7e5a0d53e0eff48eeb2572bd5d1d8b75dbebd822"}},{"ruleId":"D1","level":"warning","message":{"text":"Tera::finalize_templates (cyclomatic 23): Tera::finalize_templates has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/tera.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3b712311bdd866b0ce44f2acc331024d42328ad3a5f406b3973ce1a527e8f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Chunk::optimize (cyclomatic 20): Chunk::optimize 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":"tera/src/parsing/instructions.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3193567d58df5ebe781d83ecb2ee166526d8e10cf7efd5677d8759d9a2a6fd7f"}},{"ruleId":"D1","level":"warning","message":{"text":"ComponentDefinition::build_context (cyclomatic 17): ComponentDefinition::build_context has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Expression::fmt (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/ast.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"4943d68eee5414024e9b8113e9c065da5353a6f9789077a00487d64ed3919743"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_until_inner (cyclomatic 17): Parser::parse_until_inner has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598a01a70a378b8e605a38bb74deba9df7ff33f56d69795f2db6e547be5c260"}},{"ruleId":"D1","level":"warning","message":{"text":"Tera::validate_template_references (cyclomatic 17): Tera::validate_template_references has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/tera.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c41e31ead09c8f29b95939b65daa0813b7bde5caf79cc972bb18da0f7d209f5"}},{"ruleId":"D2","level":"warning","message":{"text":"VirtualMachine::interpret (cognitive 480): VirtualMachine::interpret has cognitive complexity 480 (threshold 15). Drivers by points: if/else 140 (356 pts), match/switch 28 (82 pts), loops 9 (32 pts), boolean chains 10 (nesting depth added 293). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/vm/interpreter.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c30e16060a0d945f0c247dd83ff61198131acc638401a907d52949649f03e3"}},{"ruleId":"D2","level":"warning","message":{"text":"tera::parsing::lexer::basic_tokenize (cognitive 212): tera::parsing::lexer::basic_tokenize has cognitive complexity 212 (threshold 15). Drivers by points: if/else 35 (93 pts), loops 17 (65 pts), match/switch 25 (48 pts), boolean chains 6 (nesting depth added 129). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/lexer.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8862af026561a04707b1a405d65c7c5c775e41f88c79b3d41e24484cd878a79f"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler::compile_expr (cognitive 89): Compiler::compile_expr has cognitive complexity 89 (threshold 15). Drivers by points: if/else 34 (62 pts), match/switch 5 (14 pts), loops 4 (13 pts) (nesting depth added 46). 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":"tera/src/parsing/compiler.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c65ed9ea81f2d57e86bcc43ebfe55c1f06a1f29648a1c135aab5dbe4cbd68e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_component_definition (cognitive 62): Parser::parse_component_definition has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (48 pts), match/switch 3 (10 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f00bba73a676ca2e61e7486261612ce3fb4cc615f69d40e1757eb8dd8d27d1"}},{"ruleId":"D2","level":"warning","message":{"text":"Tera::finalize_templates (cognitive 58): Tera::finalize_templates has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 12 (25 pts), match/switch 1 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/tera.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4a1f30fbd474ba87ebb10fded72f5c88e8da75bcdadcc486a2ab39bdcb9d90"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler::compile_node (cognitive 54): Compiler::compile_node has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 8 (18 pts), match/switch 2 (3 pts) (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":"tera/src/parsing/compiler.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b9e0744a1ce75ef9707cf398537c30ea7ad948bebbcd961650d300d958d457"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_tag (cognitive 43): Parser::parse_tag has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (32 pts), match/switch 4 (7 pts), loops 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f339f547f6169af7612113a4e6bacd1d734f6ba467efe4a7957f5c1e6d11c94"}},{"ruleId":"D2","level":"warning","message":{"text":"Chunk::optimize (cognitive 41): Chunk::optimize has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 4 (13 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/instructions.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"295742f722fec462cc705252cc977d644a39a69c2085d3e9303203be8787cad5"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentDefinition::build_context (cognitive 38): ComponentDefinition::build_context has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (30 pts), match/switch 2 (5 pts), loops 2, 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":"tera/src/parsing/ast.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3763730dc9b332a35136c2ae5271ee3fb82d81a9910ba78517f81d468c471d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr_bp (cognitive 37): Parser::parse_expr_bp has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 8 (16 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b93a5ba82eac8c80f3a98ae135c4deae23209379115613fa35464d60149478"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_until_inner (cognitive 32): Parser::parse_until_inner has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (20 pts), match/switch 3 (8 pts), boolean chains 3, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f60e71ff66c4d418bfd0be47ebff59856e982c45e2005c15b24f3a2f37a6a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Tera::validate_template_references (cognitive 31): Tera::validate_template_references has cognitive complexity 31 (threshold 15). Drivers by points: loops 10 (20 pts), if/else 5 (10 pts), boolean chains 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/tera.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"2728f287c7061a31d29205c9e57437b59391b60912dcfec933a59ee2dbec390b"}},{"ruleId":"D2","level":"warning","message":{"text":"tera::filters::indent (cognitive 21): tera::filters::indent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/filters.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"498eb792327448ba64a057dde2160fa52a64bc0b686466fc52c4379d13b24524"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_map (cognitive 18): Parser::parse_map has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"882a1ab1caee869d95216340c5b0c42b091645dd1282afcf926f1ae709920639"}},{"ruleId":"D2","level":"warning","message":{"text":"tera::parsing::lexer::whitespace_filter (cognitive 18): tera::parsing::lexer::whitespace_filter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 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":"tera/src/parsing/lexer.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8aefd0b971d1ef0b5f88f51c5bac9a337fbe76afa762d7fa5eb7523855ab74"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_ident (cognitive 17): Parser::parse_ident has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f2643e38376a3116bd5800b1e99f7b01cfc948a5a201ddc55d2909e1d951cf"}},{"ruleId":"D2","level":"warning","message":{"text":"tera::value::number::rem (cognitive 17): tera::value::number::rem has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 pts), boolean chains 3 (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":"tera/src/value/number.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8527d35d6822462aee4c8ffcc1a6b73dfcf050f0d59b891cdce9c5f9a2bf29"}},{"ruleId":"D2","level":"warning","message":{"text":"Value::slice (cognitive 16): Value::slice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2, loops 1 (nesting depth added 2). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (slice_items). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/mod.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb6fcff52e4e4d8c05c1358e0dd57d58cedaedc76c52d2076463ea5a9cc2184"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VirtualMachine.interpret: MethodTooLong \u2014 interpret runs 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 503 over it, 6.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/vm/interpreter.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"271f9c47590d2b2f1d7091f2802b7a16bd3f81c3e5e2c6832b6051aaa7d1b433"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 1136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 33 methods, 2 blocks, lines 130-1871. The bar is 400 significant lines; this is 736 over it, 2.84\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":"tera/src/parsing/parser.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0a246c5b7162603b80d3b8d8ea93be8e2adeca516b09fe2ac7607cb716e27a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsing/parser.rs: FileTooLong \u2014 1213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: Parser (2 blocks, 130-1871). The bar is 500 significant lines; this is 713 over it, 2.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21aec4615ede233c0b7e91c472451d04ab75a1536b9569d9dd1d6e22c4a8cb57"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Compiler.compile_expr: MethodTooLong \u2014 compile_expr runs 231 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/compiler.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"847399d1e6a16769c5308056bbbc6c7eabedd341451d6b3478ec28d22e076dd4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VirtualMachine: ClassTooLong \u2014 785 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 2 blocks, lines 18-1088. The bar is 400 significant lines; this is 385 over it, 1.96\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":"tera/src/vm/interpreter.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bbeeb799b42880bb306b7a790d5eee09ef7654c76727a0ca7e716c783ec7c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_component_definition: MethodTooLong \u2014 parse_component_definition runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a96cb2bbb5dd252b5bc25ef3e0e31bc215b3044ff1c5e30c9891c46b562d81"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Value: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e701822e13d936ace83e632097a37a18b26735b23338b00b6055b89d3f4927"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: value/mod.rs: FileTooLong \u2014 856 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: Value (39 blocks, 204-1369). The bar is 500 significant lines; this is 356 over it, 1.71\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":"tera/src/value/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"432fecb6d0806b1786a2ecbb985942e19e6095a4bcd5d85c2d5f1337a2b4ec18"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Value: ClassTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 52 methods, 39 blocks, lines 204-1369. The bar is 400 significant lines; this is 273 over it, 1.68\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"100bcd5d6242cd65c25ecb16a9af6872ff51346b891429181582454beab8f54a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vm/interpreter.rs: FileTooLong \u2014 798 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 98% of them inside a single declaration: VirtualMachine (2 blocks, 18-1088). The bar is 500 significant lines; this is 298 over it, 1.60\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":"tera/src/vm/interpreter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7828f112425f845fa227c4e6034c85a122156ddc03880de6affc0b52cacba2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tera: ClassTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 46 methods, 4 blocks, lines 67-1577. The bar is 400 significant lines; this is 237 over it, 1.59\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/tera.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd819ee5518654b98128e6141e6f3109c3ca914dc8e166b84240005d5a85c9e9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tera: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\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":"tera/src/tera.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf3e05f57746586ca2dd22f9feee142d0903d7b0b464e8e7991d7f3a85afe76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_expr_bp: MethodTooLong \u2014 parse_expr_bp runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"de81dbacf50b400367b87fbe42cce35a1f2abbc4980119daa095722541fda819"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_tag: MethodTooLong \u2014 parse_tag runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5b6158d6fd65e44cf617b4cf009e9f81f59d927708dec3a47fc5e4182c18c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tera.rs: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: Tera (4 blocks, 67-1577). The bar is 500 significant lines; this is 162 over it, 1.32\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/tera.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"996d95b0cff72273217e0e5a8ee55a4d5fc8558b985873b749145a39993997fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsing/ast.rs: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 127 over it, 1.25\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":"tera/src/parsing/ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"318241a978e1482305837379d3ea97536637ba6575377886dfb33735b34d1895"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Compiler.compile_node: MethodTooLong \u2014 compile_node runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/compiler.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"663c0754e26cdcf3350ffb0484e80a654c8d2d95f02f887ac0197a84b2a60440"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Compiler: ClassTooLong \u2014 450 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 2 blocks, lines 23-647. The bar is 400 significant lines; this is 50 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":"tera/src/parsing/compiler.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d240fced26dc77632f0652fa15675512d90153d8da65fd54f4a5b559eef66a23"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: 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":"tera/src/parsing/parser.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf0323b847bb12fca44f7a8a4e6a7748a433f9bb1b1a8b044017568bcd22213"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): tera/src/value/mod.rs:274-300 | tera/src/value/mod.rs:307-344 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b876f36df5b24928e1fa9e41611e4bc7341355c8245060f92c2f29f2e8faa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): tera/src/value/number.rs:145-180 | tera/src/value/number.rs:196-224 | tera/src/value/number.rs:226-260 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/number.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3549380b4ba9a28194d38d32fd16a4ef7fa728c2103646b30baeded93863733a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): tera/src/tera.rs:812-843 | tera/src/tera.rs:922-945 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/tera.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc0ebee89925cf50919eca6b553d3f0949171e005ced8a41fdf7e786aacd6b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): tera/src/parsing/ast.rs:265-279 | tera/src/parsing/ast.rs:404-421 | tera/src/parsing/ast.rs:469-482 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/ast.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5faa97ed7e114184172c0f428ce5d4a48874204389c5475243fd844409188ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): tera/src/value/key.rs:246-265 | tera/src/value/key.rs:271-290 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/key.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4852e617a14f999b6431d0feaff7f0e678e13a85865d779f07f86d25f167d80f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): tera/src/parsing/parser.rs:537-555 | tera/src/parsing/parser.rs:557-575 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef40bf0bc19dedf80460932832a10436f80230585472171bd607408d850ffe71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tera/src/value/key.rs:85-97 | tera/src/value/key.rs:109-122 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/key.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a1db1001e2a0fbda20d1d52d0a694378f708034d82f7605c54db4911a00106"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tera-contrib/src/dates.rs:175-185 | tera-contrib/src/dates.rs:195-205 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera-contrib/src/dates.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40783ce77bb02c29f9d986b37f88719a0853a824a3b0400879916a6cc72dc8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): tera/src/value/mod.rs:237-253 | tera/src/value/mod.rs:255-271 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"df77581f5c1f41c02ba5df8c9dc962f8f4cc889bb88058fd36df3c0767f646ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tera/src/parsing/ast.rs:334-344 | tera/src/parsing/ast.rs:371-381 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/ast.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"055b17cb3a9288180fc5f28d59307996198e4cbab0f9c8e294c41987f8b95c5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): tera/src/tera.rs:1492-1501 | tera/src/tera.rs:1526-1535 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/tera.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28212feb472b9bb83d2b4d63e3ab697d7f99334b665697a74d6e983b007eac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): tera/src/filters.rs:166-177 | tera/src/filters.rs:179-187 | tera/src/filters.rs:189-197 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/filters.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8599d37b2a7e91c7259f62ad663e43fc251c6af5602889c659e8a99d8f097a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tera/src/value/ser.rs:300-307 | tera/src/value/ser.rs:579-586 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/ser.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2404343a95c0cecdc8b99127fe04eca36e131f8aec73cb12c5a0ae414095cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): tera/src/args.rs:347-353 | tera/src/value/mod.rs:1335-1343 | tera/src/value/mod.rs:1347-1355 | tera/src/value/mod.rs:1360-1368 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/args.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf131e2464d13a0f6d82da420e6961d85e61960d945492f7aa1b253d0573834e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tera/src/tera.rs:1276-1280 | tera/src/vm/interpreter.rs:979-983 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/tera.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddd3b2dfd49e92c0dbd85d4fcbf01ebaef2de1340cd1417243de82012c39548"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tera/src/tera.rs:1171-1175 | tera/src/vm/interpreter.rs:1055-1059 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/tera.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fe467f10f3b41d48b8410a76238efb4b911bd061565cd712c1ea073b41e07b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): tera/src/tera.rs:824-843 | tera/src/tera.rs:927-945 \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 \u0060tera/src/tera.rs:824\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/tera.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7a7a6051b0bfe397e1a39b5314d350d7a0a06a0443264355418aa30658269c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): tera/src/parsing/compiler.rs:488-506 | tera/src/parsing/compiler.rs:618-636 \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":"tera/src/parsing/compiler.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abb82958656acbfdedc9270a589bda6fb11dfc838bdfd99b3492db5598ef595"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tera/src/parsing/compiler.rs:474-486 | tera/src/parsing/compiler.rs:507-519 \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 \u0060tera/src/parsing/compiler.rs:474\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/compiler.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"342df6182d4a14b8f551f3faaa07b3f9f449d1f809a86da9239a1786c54426a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tera/src/value/number.rs:146-157 | tera/src/value/number.rs:197-208 \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 \u0060tera/src/value/number.rs:146\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":"tera/src/value/number.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b3e68031b300100deeb9f9ac41ac7320d7d7b2608ebfa189f0a7dbc376f5e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tera/src/vm/interpreter.rs:528-539 | tera/src/vm/interpreter.rs:545-556 \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":"tera/src/vm/interpreter.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b650ba0d997b4c49ea3a2c3d7fb03de87a175536f13c12bde2b21dee6e4c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): tera/src/parsing/compiler.rs:267-275 | tera/src/parsing/compiler.rs:538-545 \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":"tera/src/parsing/compiler.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"599335eefa8ea4d555c0d7321164000f50a1fad3fd8c90348b5c6cd659e0d0c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): tera/src/parsing/ast.rs:269-277 | tera/src/parsing/ast.rs:409-417 | tera/src/parsing/ast.rs:472-480 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/ast.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"654bf3e16dc9260bd1961f10711625fe05c783b7d30067b3250d01073bd2574b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): tera/src/parsing/compiler.rs:225-232 | tera/src/parsing/compiler.rs:498-505 | tera/src/parsing/compiler.rs:628-635 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tera/src/parsing/compiler.rs:225\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/compiler.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa57a0df7824288065163f5cdf2c732b9f2dbfc3e2219dbc7631eb3f070d110"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): tera/src/value/mod.rs:1336-1343 | tera/src/value/mod.rs:1348-1355 | tera/src/value/mod.rs:1361-1368 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060input\u0060 to \u0060HashMap\u003CK, T\u003E\u0060 in one and \u0060BTreeMap\u003CK, T\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/mod.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"8327652e80bada78d8e3fff75eb94205f886e6831b5c2c2890ab79d862abf8af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): tera/src/vm/interpreter.rs:224-230 | tera/src/vm/interpreter.rs:240-247 | tera/src/vm/interpreter.rs:275-282 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tera/src/vm/interpreter.rs:224\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tera/src/vm/interpreter.rs:272\u0060 calls \u0060pop\u0060 and \u0060tera/src/vm/interpreter.rs:238\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":"tera/src/vm/interpreter.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1820b16be5ef1499dd5838d832b91c5ce9f00634bb70e40146a492c72ba175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tera/src/parsing/parser.rs:538-545 | tera/src/parsing/parser.rs:558-565 \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":"tera/src/parsing/parser.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ce557b7b7d6b66f34b4225cedad03f72a4ceb59f53d72bd959df2b23075384"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tera/src/value/mod.rs:505-512 | tera/src/value/mod.rs:514-521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/mod.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd54e393c870b81acc668c3e44a92df94fc50490972fc4bb8d6fc517c8ea159"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tera/src/value/mod.rs:523-530 | tera/src/value/mod.rs:532-539 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/mod.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"d195671cef6f734bd9d9c43dec5bc13ed0e0ec972b7eefac036e00d1addf1bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): tera/src/parsing/parser.rs:1085-1106 | tera/src/parsing/parser.rs:1149-1168 \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 \u0060tera/src/parsing/parser.rs:1085\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"e155e50b96c336c30b3828fa464d54e9933eb2e56b35f35f804c772cd89c0231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tera-contrib/src/rand.rs:22-26 | tera-contrib/src/rand.rs:43-47 \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 \u0060tera-contrib/src/rand.rs:22\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera-contrib/src/rand.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb38d10636cf2d3907091963cdb2c2032a8912896e44649d358864d91992354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): tera/src/parsing/parser.rs:492-506 | tera/src/parsing/parser.rs:1372-1386 | tera/src/parsing/parser.rs:1405-1419 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tera/src/parsing/parser.rs:492\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"880ba98ea68fe5718f15c70b405b700cab1d9364539c6ee88a7cd17b636ba21e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tera/src/vm/interpreter.rs:293-306 | tera/src/vm/interpreter.rs:309-319 \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 \u0060tera/src/vm/interpreter.rs:293\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":"tera/src/vm/interpreter.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee31b6b3b87ed369043873bac24093a00b35ecf0de4a50af49ef006e9424cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): tera/src/parsing/parser.rs:492-505 | tera/src/parsing/parser.rs:1372-1385 | tera/src/parsing/parser.rs:1405-1418 | tera/src/parsing/parser.rs:1441-1453 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tera/src/parsing/parser.rs:492\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e0b650740e8867e1a9f1780e595f78f3e44be8898c9382a418d60405ebfd63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): tera/src/tera.rs:549-559 | tera/src/tera.rs:563-573 | tera/src/tera.rs:577-587 | tera/src/tera.rs:591-601 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tera/src/tera.rs:549\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":"tera/src/tera.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4a5fcbeff1574ac7c602b5d9b96ab0e72845b974e14830fa6a9fa9c67883b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tera/src/parsing/parser.rs:978-988 | tera/src/parsing/parser.rs:1216-1226 \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 \u0060tera/src/parsing/parser.rs:978\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1a5929f0e2b8a2dfe1ee64c195260ac9c648d79f5dbed95f76505b26e3dd3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tera-contrib/src/dates.rs:176-180 | tera-contrib/src/dates.rs:196-200 \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 \u0060tera-contrib/src/dates.rs:176\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":"tera-contrib/src/dates.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1967f4bc81e63bf28e20e461e053d85415e41c84dc2e2a91927806f2f1277ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tera/src/value/mod.rs:931-936 | tera/src/value/mod.rs:1002-1007 \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 \u0060tera/src/value/mod.rs:931\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":"tera/src/value/mod.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0713dfd1862950f11c09d31387b853f7cd4b7c01a244742208cde79c69b6241"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: tera: tera: abstractness 0.07, instability 0.00, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f02016198ff4d9fc2842ff3a08de892190761fbfe1a9e99f4a931e5b0f296d9b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tera/src/value/utils.rs: 18.8% line coverage (3/16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/value/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7d60af1cd642aaad8a3ebe7d7bf09d99f4a2303f59b2346c18506431d8b789"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tera/src/vm/interpreter.rs: tera/src/vm/interpreter.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 194 in VirtualMachine::interpret at line 54. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 14:27:32 \u002B01:00\u0027 --until=\u00272026-10-27 14:27:32 \u002B01:00\u0027 --full-history --no-merges -- tera/src/vm/interpreter.rs\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":"tera/src/vm/interpreter.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"034a9248e1237bf1b907079eb79b8dca478a1bb125eb8c70a69d4c938248a3ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tera/src/parsing/parser.rs: tera/src/parsing/parser.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in Parser::parse_expr_bp at line 741. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 14:27:32 \u002B01:00\u0027 --until=\u00272026-10-27 14:27:32 \u002B01:00\u0027 --full-history --no-merges -- tera/src/parsing/parser.rs\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":"tera/src/parsing/parser.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64c5e419dc77cfe06786b266dbd7cc61414e21b6b6d677f82be5a89b504da76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // If the error comes from some third party libs, TODO we need that? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/errors.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5f586f048972cdb78db31d401608b990216bd2fa4c494a2ee04106d0cef702"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(perf): can we optimize this at the bytecode level to avoid hashmap lookups? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/vm/interpreter.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab84660a34822911dbe642f2f7be2154b422b574dc92a20900456ce39eef623"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should string kind be used for partialeq? They might be equal now 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":"tera/src/value/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ab46422fd64cdfbff5c83196ec2e0e53ee927f98507b9a66d62bcad6caa0f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: push a single instr for all keys as a Vec\u003CString\u003E like Python? bench first \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/compiler.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ddf695915a1e2e81bdb1e1eca9c736c9b62dc39918546504a0cf9f7888e8d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement constant folding for arithmetics, string concat \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/compiler.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b1395ef557e00583e2321844f1df8c1ccbd463165e38c83bc491fc524b4bcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Can we skip 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":"tera/src/parsing/instructions.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e9096696964839e38af44c82cee5acef4a6487718e1418f43e319fbb39cc52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can we borrow 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":"tera/src/parsing/parser.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad82cc938a8ec321af44b35c251abca4e24e9f37af4ff083715fa68982e1b07d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: DRY that with forloop \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ebdb0db6cc8acc1ddca2edd4553faa4868dd32e398f24c5298698b4dd47ca6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add a Node::Keyword if we have more than one like that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/src/parsing/parser.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59f33d7b0a5c1683b949b19a65836b8cb56aea4b5061157b23a8865ac8339dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: move examples folder to root of the repo to be able to select features \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tera/examples/basic/main.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bc94ce16fa41d23b3220d4ecdfa0b11713677ea99300f031686e54438e7d31"}},{"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"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":"866f5db9e17cba13054be81498300d5689d6380b38ab693dd948f99e20adbff5"},"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":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"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":"05dd1cc6a6536213feac72458953b3ecc92da85b7219289a9d2c68054660f8e9"},"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":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"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":"c31dd2fa4f78f8c14898a35f3458c3e1b22b8dd337badcb88751e2f7121f06bf"},"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":"8500bd444dd29b22a2b7ee47bd5fb7323de7a5296fca9e95d0d7da12354cfcad"},"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":"50adbcd711dca68f872cf2be71adcafe71227cad845e99d760eb77a975a1047e"},"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":"af9a61083c7a4524493ed8e0a5443b8d46fdc943c88f95a4ddbca79bc01c55d1"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"dcf9739ed5c7a8b66007b7c0c4c9b4359f7ed431801e30e77f12f0e359be4df4"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"77019055eb2bce4de966171b9e2af456f970f8fe5efee53def0ef33f471a6952"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"65175a19da3f93fcd6be859719da40f4165826bb6a2dadb880516bf9a21137d5"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"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":"M1","level":"note","message":{"text":"Thin README: The root README is 89 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, in the README and in the repository documents it links, it found no a build/run or getting-started 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":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88b11295dc6ac6146c259ace6043143959f96dc98628f8c8578b6c5f95b8149"}},{"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"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-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"}]}],"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":15,"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."]}]}